@firebase/firestore 3.3.0 → 3.3.1-canary.086df7c7e

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

@@ -4,7 +4,7 @@ import { SDK_VERSION as i, _registerComponent as o, registerVersion as a, _getPr
 
 import { Component as c } from "@firebase/component";
 
-import { Logger as f, LogLevel as l } from "@firebase/logger";
+import { Logger as l, LogLevel as f } from "@firebase/logger";
 
 import { getModularInstance as h, createMockUserToken as p } from "@firebase/util";
 
@@ -67,7 +67,7 @@ d.MOCK_USER = new d("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var m = "9.4.0", y = new f("@firebase/firestore");
+var m = "9.5.0-canary.086df7c7e", y = new l("@firebase/firestore");
 
 /**
  * @license
@@ -104,7 +104,7 @@ function v(t) {
 
 function g(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (y.logLevel <= l.DEBUG) {
+    if (y.logLevel <= f.DEBUG) {
         var i = e.map(_);
         y.debug.apply(y, r([ "Firestore (" + m + "): " + t ], i));
     }
@@ -112,7 +112,7 @@ function g(t) {
 
 function w(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (y.logLevel <= l.ERROR) {
+    if (y.logLevel <= f.ERROR) {
         var i = e.map(_);
         y.error.apply(y, r([ "Firestore (" + m + "): " + t ], i));
     }
@@ -122,7 +122,7 @@ function w(t) {
  * @internal
  */ function b(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (y.logLevel <= l.WARN) {
+    if (y.logLevel <= f.WARN) {
         var i = e.map(_);
         y.warn.apply(y, r([ "Firestore (" + m + "): " + t ], i));
     }
@@ -180,7 +180,7 @@ function w(t) {
  * Returns `never` and can be used in expressions:
  * @example
  * let futureVar = fail('not implemented yet');
- */ function S(t) {
+ */ function T(t) {
     void 0 === t && (t = "Unexpected state");
     // Log the failure in addition to throw an exception, just in case the
     // exception is swallowed.
@@ -197,8 +197,8 @@ function w(t) {
  */;
 }
 
-function T(t, e) {
-    t || S();
+function S(t, e) {
+    t || T();
 }
 
 /**
@@ -225,7 +225,7 @@ e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ var I = "cancelled", A = "unknown", V = "invalid-argument", D = "deadline-exceeded", k = "not-found", P = "permission-denied", N = "unauthenticated", F = "resource-exhausted", O = "failed-precondition", q = "aborted", j = "out-of-range", L = "unimplemented", R = "internal", U = "unavailable", x = /** @class */ function(e) {
+ */ var I = "cancelled", A = "unknown", k = "invalid-argument", V = "deadline-exceeded", D = "not-found", P = "permission-denied", F = "unauthenticated", N = "resource-exhausted", q = "failed-precondition", O = "aborted", C = "out-of-range", j = "unimplemented", L = "internal", R = "unavailable", M = /** @class */ function(e) {
     /** @hideconstructor */
     function n(
     /**
@@ -248,16 +248,14 @@ e) {
         }, r;
     }
     return t(n, e), n;
-}(Error), B = function() {
+}(Error), U = function() {
     var t = this;
     this.promise = new Promise((function(e, n) {
         t.resolve = e, t.reject = n;
     }));
-}, C = function(t, e) {
-    this.user = e, this.type = "OAuth", this.authHeaders = {}, 
-    // Set the headers using Object Literal notation to avoid minification
-    this.authHeaders.Authorization = "Bearer " + t;
-}, M = /** @class */ function() {
+}, x = function(t, e) {
+    this.user = e, this.type = "OAuth", this.headers = new Map, this.headers.set("Authorization", "Bearer " + t);
+}, B = /** @class */ function() {
     function t() {}
     return t.prototype.getToken = function() {
         return Promise.resolve(null);
@@ -289,7 +287,7 @@ e) {
     }, t.prototype.shutdown = function() {
         this.changeListener = null;
     }, t;
-}(), Q = /** @class */ function() {
+}(), z = /** @class */ function() {
     function t(t) {
         var e = this;
         this.auth = null, t.onInit((function(t) {
@@ -299,32 +297,20 @@ e) {
     return t.prototype.getToken = function() {
         var t = this;
         return this.auth ? this.auth.getToken().then((function(e) {
-            return e ? (T("string" == typeof e.accessToken), new C(e.accessToken, new d(t.auth.getUid()))) : null;
+            return e ? (S("string" == typeof e.accessToken), new x(e.accessToken, new d(t.auth.getUid()))) : null;
         })) : Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
     t.prototype.shutdown = function() {}, t;
-}(), z = /** @class */ function() {
-    function t(t, e, n) {
-        this.t = t, this.i = e, this.o = n, this.type = "FirstParty", this.user = d.FIRST_PARTY;
-    }
-    return Object.defineProperty(t.prototype, "authHeaders", {
-        get: function() {
-            var t = {
-                "X-Goog-AuthUser": this.i
-            }, e = this.t.auth.getAuthHeaderValueForFirstParty([]);
-            // Use array notation to prevent minification
-                        return e && (t.Authorization = e), this.o && (t["X-Goog-Iam-Authorization-Token"] = this.o), 
-            t;
-        },
-        enumerable: !1,
-        configurable: !0
-    }), t;
-}(), H = /** @class */ function() {
+}(), Q = function(t, e, n) {
+    this.type = "FirstParty", this.user = d.FIRST_PARTY, this.headers = new Map, this.headers.set("X-Goog-AuthUser", e);
+    var r = t.auth.getAuthHeaderValueForFirstParty([]);
+    r && this.headers.set("Authorization", r), n && this.headers.set("X-Goog-Iam-Authorization-Token", n);
+}, K = /** @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 z(this.t, this.i, this.o));
+        return Promise.resolve(new Q(this.t, this.i, this.o));
     }, t.prototype.start = function(t, e) {
         // Fire with initial uid.
         t.enqueueRetryable((function() {
@@ -332,7 +318,22 @@ e) {
         }));
     }, t.prototype.shutdown = function() {}, t.prototype.invalidateToken = function() {}, 
     t;
-}(), K = 
+}(), H = function(t) {
+    this.value = t, this.type = "AppCheck", this.headers = new Map, t && t.length > 0 && this.headers.set("x-firebase-appcheck", this.value);
+}, W = /** @class */ function() {
+    function t(t) {
+        var e = this;
+        this.u = t, this.appCheck = null, t.onInit((function(t) {
+            e.appCheck = t;
+        }));
+    }
+    return t.prototype.getToken = function() {
+        return this.appCheck ? this.appCheck.getToken().then((function(t) {
+            return t ? (S("string" == typeof t.token), new H(t.token)) : null;
+        })) : Promise.resolve(null);
+    }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
+    t.prototype.shutdown = function() {}, t;
+}(), Y = 
 /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -353,7 +354,7 @@ e) {
 function(t, e, n, r, i, o, a, s) {
     this.databaseId = t, this.appId = e, this.persistenceKey = n, this.host = r, this.ssl = i, 
     this.forceLongPolling = o, this.autoDetectLongPolling = a, this.useFetchStreams = s;
-}, W = /** @class */ function() {
+}, $ = /** @class */ function() {
     function t(t, e) {
         this.projectId = t, this.database = e || "(default)";
     }
@@ -366,9 +367,9 @@ function(t, e, n, r, i, o, a, s) {
     }), t.prototype.isEqual = function(e) {
         return e instanceof t && e.projectId === this.projectId && e.database === this.database;
     }, t;
-}(), Y = /** @class */ function() {
+}(), X = /** @class */ function() {
     function t(t, e, n) {
-        void 0 === e ? e = 0 : e > t.length && S(), void 0 === n ? n = t.length - e : n > t.length - e && S(), 
+        void 0 === e ? e = 0 : e > t.length && T(), void 0 === n ? n = t.length - e : n > t.length - e && T(), 
         this.segments = t, this.offset = e, this.len = n;
     }
     return Object.defineProperty(t.prototype, "length", {
@@ -419,7 +420,7 @@ function(t, e, n, r, i, o, a, s) {
         }
         return t.length < e.length ? -1 : t.length > e.length ? 1 : 0;
     }, t;
-}(), X = /** @class */ function(e) {
+}(), J = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -445,7 +446,7 @@ function(t, e, n, r, i, o, a, 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 x(V, "Invalid segment (" + a + "). Paths must not contain // in them.");
+            if (a.indexOf("//") >= 0) throw new M(k, "Invalid segment (" + 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;
@@ -455,7 +456,7 @@ function(t, e, n, r, i, o, a, s) {
     }, n.emptyPath = function() {
         return new n([]);
     }, n;
-}(Y), $ = /^[_a-zA-Z][_a-zA-Z0-9]*$/, J = /** @class */ function(e) {
+}(X), Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/, tt = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -467,7 +468,7 @@ function(t, e, n, r, i, o, a, s) {
      * without escaping.
      */
     n.isValidIdentifier = function(t) {
-        return $.test(t);
+        return Z.test(t);
     }, n.prototype.canonicalString = function() {
         return this.toArray().map((function(t) {
             return t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"), n.isValidIdentifier(t) || (t = "`" + t + "`"), 
@@ -500,39 +501,39 @@ function(t, e, n, r, i, o, a, s) {
      */
     n.fromServerFormat = function(t) {
         for (var e = [], r = "", i = 0, o = function() {
-            if (0 === r.length) throw new x(V, "Invalid field path (" + t + "). Paths must not be empty, begin with '.', end with '.', or contain '..'");
+            if (0 === r.length) throw new M(k, "Invalid field path (" + t + "). Paths must not be empty, begin with '.', end with '.', or contain '..'");
             e.push(r), r = "";
         }, a = !1; i < t.length; ) {
             var s = t[i];
             if ("\\" === s) {
-                if (i + 1 === t.length) throw new x(V, "Path has trailing escape character: " + t);
+                if (i + 1 === t.length) throw new M(k, "Path has trailing escape character: " + t);
                 var u = t[i + 1];
-                if ("\\" !== u && "." !== u && "`" !== u) throw new x(V, "Path has invalid escape sequence: " + t);
+                if ("\\" !== u && "." !== u && "`" !== u) throw new M(k, "Path has invalid escape sequence: " + t);
                 r += u, i += 2;
             } else "`" === s ? (a = !a, i++) : "." !== s || a ? (r += s, i++) : (o(), i++);
         }
-        if (o(), a) throw new x(V, "Unterminated ` in path: " + t);
+        if (o(), a) throw new M(k, "Unterminated ` in path: " + t);
         return new n(e);
     }, n.emptyPath = function() {
         return new n([]);
     }, n;
-}(Y), Z = /** @class */ function() {
+}(X), et = /** @class */ function() {
     function t(t) {
         this.path = t;
     }
     return t.fromPath = function(e) {
-        return new t(X.fromString(e));
+        return new t(J.fromString(e));
     }, t.fromName = function(e) {
-        return new t(X.fromString(e).popFirst(5));
+        return new t(J.fromString(e).popFirst(5));
     }, 
     /** Returns true if the document is in the specified collectionId. */ t.prototype.hasCollectionId = function(t) {
         return this.path.length >= 2 && this.path.get(this.path.length - 2) === t;
     }, t.prototype.isEqual = function(t) {
-        return null !== t && 0 === X.comparator(this.path, t.path);
+        return null !== t && 0 === J.comparator(this.path, t.path);
     }, t.prototype.toString = function() {
         return this.path.toString();
     }, t.comparator = function(t, e) {
-        return X.comparator(t.path, e.path);
+        return J.comparator(t.path, e.path);
     }, t.isDocumentKey = function(t) {
         return t.length % 2 == 0;
     }, 
@@ -543,7 +544,7 @@ function(t, e, n, r, i, o, a, s) {
      * @returns A new instance of DocumentKey
      */
     t.fromSegments = function(e) {
-        return new t(new X(e.slice()));
+        return new t(new J(e.slice()));
     }, t;
 }();
 
@@ -564,8 +565,8 @@ function(t, e, n, r, i, o, a, s) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function tt(t, e, n) {
-    if (!n) throw new x(V, "Function " + t + "() cannot be called with an empty " + e + ".");
+function nt(t, e, n) {
+    if (!n) throw new M(k, "Function " + t + "() cannot be called with an empty " + e + ".");
 }
 
 /**
@@ -575,22 +576,22 @@ function tt(t, e, n) {
 /**
  * Validates that `path` refers to a document (indicated by the fact it contains
  * an even numbers of segments).
- */ function et(t) {
-    if (!Z.isDocumentKey(t)) throw new x(V, "Invalid document reference. Document references must have an even number of segments, but " + t + " has " + t.length + ".");
+ */ function rt(t) {
+    if (!et.isDocumentKey(t)) throw new M(k, "Invalid document reference. Document references must have an even number of segments, but " + t + " has " + t.length + ".");
 }
 
 /**
  * Validates that `path` refers to a collection (indicated by the fact it
  * contains an odd numbers of segments).
- */ function nt(t) {
-    if (Z.isDocumentKey(t)) throw new x(V, "Invalid collection reference. Collection references must have an odd number of segments, but " + t + " has " + t.length + ".");
+ */ function it(t) {
+    if (et.isDocumentKey(t)) throw new M(k, "Invalid collection reference. Collection references must have an odd number of segments, but " + t + " has " + t.length + ".");
 }
 
 /**
  * Returns true if it's a non-null object without a custom prototype
  * (i.e. excludes Array, Date, etc.).
  */
-/** Returns a string describing the type / value of the provided input. */ function rt(t) {
+/** Returns a string describing the type / value of the provided input. */ function ot(t) {
     if (void 0 === t) return "undefined";
     if (null === t) return "null";
     if ("string" == typeof t) return t.length > 20 && (t = t.substring(0, 20) + "..."), 
@@ -605,25 +606,25 @@ function tt(t, e, n) {
         }(t);
         return e ? "a custom " + e + " object" : "an object";
     }
-    return "function" == typeof t ? "a function" : S();
+    return "function" == typeof t ? "a function" : T();
 }
 
-function it(t, 
+function at(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 x(V, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
-        var n = rt(t);
-        throw new x(V, "Expected type '" + e.name + "', but it was: " + n);
+        if (e.name === t.constructor.name) throw new M(k, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
+        var n = ot(t);
+        throw new M(k, "Expected type '" + e.name + "', but it was: " + n);
     }
     return t;
 }
 
-function ot(t, e) {
-    if (e <= 0) throw new x(V, "Function " + t + "() requires a positive number, but it was: " + e + ".");
+function st(t, e) {
+    if (e <= 0) throw new M(k, "Function " + t + "() requires a positive number, but it was: " + e + ".");
 }
 
 /**
@@ -644,11 +645,11 @@ function ot(t, e) {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function at(t) {
+ */ function ut(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function st(t) {
+/** Returns whether the value represents -0. */ function ct(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;
@@ -673,7 +674,7 @@ function ot(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 ut, ct, ft = {
+ */ var lt, ft, ht = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery"
@@ -717,7 +718,7 @@ function ot(t, e) {
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function lt(t) {
+function pt(t) {
     if (void 0 === t) return w("RPC_ERROR", "HTTP error has no status"), A;
     // 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
@@ -731,14 +732,14 @@ function lt(t) {
 
       case 400:
         // Bad Request
-        return O;
+        return q;
 
         // Other possibilities based on the forward mapping
         // return Code.INVALID_ARGUMENT;
         // return Code.OUT_OF_RANGE;
               case 401:
         // Unauthorized
-        return N;
+        return F;
 
       case 403:
         // Forbidden
@@ -746,21 +747,21 @@ function lt(t) {
 
       case 404:
         // Not Found
-        return k;
+        return D;
 
       case 409:
         // Conflict
-        return q;
+        return O;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return j;
+        return C;
 
       case 429:
         // Too Many Requests
-        return F;
+        return N;
 
       case 499:
         // Client Closed Request
@@ -775,18 +776,18 @@ function lt(t) {
         // return Code.DATA_LOSS;
               case 501:
         // Unimplemented
-        return L;
+        return j;
 
       case 503:
         // Service Unavailable
-        return U;
+        return R;
 
       case 504:
         // Gateway Timeout
-        return D;
+        return V;
 
       default:
-        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? O : t >= 500 && t < 600 ? R : A;
+        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? q : t >= 500 && t < 600 ? L : A;
     }
 }
 
@@ -809,31 +810,31 @@ function lt(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (ct = ut || (ut = {}))[ct.OK = 0] = "OK", ct[ct.CANCELLED = 1] = "CANCELLED", 
-ct[ct.UNKNOWN = 2] = "UNKNOWN", ct[ct.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
-ct[ct.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", ct[ct.NOT_FOUND = 5] = "NOT_FOUND", 
-ct[ct.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", ct[ct.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
-ct[ct.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", ct[ct.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
-ct[ct.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", ct[ct.ABORTED = 10] = "ABORTED", 
-ct[ct.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", ct[ct.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
-ct[ct.INTERNAL = 13] = "INTERNAL", ct[ct.UNAVAILABLE = 14] = "UNAVAILABLE", ct[ct.DATA_LOSS = 15] = "DATA_LOSS";
-
-var ht = /** @class */ function(r) {
+ */ (ft = lt || (lt = {}))[ft.OK = 0] = "OK", ft[ft.CANCELLED = 1] = "CANCELLED", 
+ft[ft.UNKNOWN = 2] = "UNKNOWN", ft[ft.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+ft[ft.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", ft[ft.NOT_FOUND = 5] = "NOT_FOUND", 
+ft[ft.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", ft[ft.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+ft[ft.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", ft[ft.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+ft[ft.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", ft[ft.ABORTED = 10] = "ABORTED", 
+ft[ft.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", ft[ft.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+ft[ft.INTERNAL = 13] = "INTERNAL", ft[ft.UNAVAILABLE = 14] = "UNAVAILABLE", ft[ft.DATA_LOSS = 15] = "DATA_LOSS";
+
+var dt = /** @class */ function(r) {
     /**
      * @param databaseInfo - The connection info.
      * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.
      */
     function i(t, e) {
         var n = this;
-        return (n = r.call(this, t) || this).T = e, n;
+        return (n = r.call(this, t) || this).I = e, n;
     }
     /**
      * Base class for all Rest-based connections to the backend (WebChannel and
      * HTTP).
      */
-    return t(i, r), i.prototype.I = function(t, e) {
+    return t(i, r), i.prototype.A = function(t, e) {
         throw new Error("Not supported by FetchConnection");
-    }, i.prototype.g = function(t, r, i, o) {
+    }, i.prototype.v = function(t, r, i, o) {
         return e(this, void 0, void 0, (function() {
             var t, e, a;
             return n(this, (function(n) {
@@ -842,7 +843,7 @@ var ht = /** @class */ function(r) {
                     t = JSON.stringify(o), n.label = 1;
 
                   case 1:
-                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.T(r, {
+                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.I(r, {
                         method: "POST",
                         headers: i,
                         body: t
@@ -852,10 +853,10 @@ var ht = /** @class */ function(r) {
                     return e = n.sent(), [ 3 /*break*/ , 4 ];
 
                   case 3:
-                    throw a = n.sent(), new x(lt(a.status), "Request failed with error: " + a.statusText);
+                    throw a = n.sent(), new M(pt(a.status), "Request failed with error: " + a.statusText);
 
                   case 4:
-                    if (!e.ok) throw new x(lt(e.status), "Request failed with error: " + e.statusText);
+                    if (!e.ok) throw new M(pt(e.status), "Request failed with error: " + e.statusText);
                     return [ 2 /*return*/ , e.json() ];
                 }
             }));
@@ -865,38 +866,42 @@ var ht = /** @class */ function(r) {
     function t(t) {
         this.databaseInfo = t, this.databaseId = t.databaseId;
         var e = t.ssl ? "https" : "http";
-        this.u = e + "://" + t.host, this.h = "projects/" + this.databaseId.projectId + "/databases/" + this.databaseId.database + "/documents";
+        this.h = e + "://" + t.host, this.l = "projects/" + this.databaseId.projectId + "/databases/" + this.databaseId.database + "/documents";
     }
-    return t.prototype.l = function(t, e, n, r) {
-        var i = this.m(t, e);
-        g("RestConnection", "Sending: ", i, n);
-        var o = {};
-        return this.p(o, r), this.g(t, i, o, n).then((function(t) {
+    return t.prototype.m = function(t, e, n, r, i) {
+        var o = this.p(t, e);
+        g("RestConnection", "Sending: ", o, n);
+        var a = {};
+        return this.g(a, r, i), this.v(t, o, a, n).then((function(t) {
             return g("RestConnection", "Received: ", t), t;
         }), (function(e) {
-            throw b("RestConnection", t + " failed with error: ", e, "url: ", i, "request:", n), 
+            throw b("RestConnection", t + " failed with error: ", e, "url: ", o, "request:", n), 
             e;
         }));
-    }, t.prototype.v = function(t, e, n, r) {
+    }, t.prototype.T = function(t, e, n, r, i) {
         // The REST API automatically aggregates all of the streamed results, so we
         // can just use the normal invoke() method.
-        return this.l(t, e, n, r);
+        return this.m(t, e, n, r, i);
     }, 
     /**
      * Modifies the headers for a request, adding any authorization token if
      * present and any additional headers for the request.
      */
-    t.prototype.p = function(t, e) {
-        if (t["X-Goog-Api-Client"] = "gl-js/ fire/" + m, 
+    t.prototype.g = function(t, e, n) {
+        t["X-Goog-Api-Client"] = "gl-js/ fire/" + m, 
         // Content-Type: text/plain will avoid preflight requests which might
         // mess with CORS and redirects by proxies. If we add custom headers
         // we will need to change this code to potentially use the $httpOverwrite
         // parameter supported by ESF to avoid triggering preflight requests.
         t["Content-Type"] = "text/plain", this.databaseInfo.appId && (t["X-Firebase-GMPID"] = this.databaseInfo.appId), 
-        e) for (var n in e.authHeaders) e.authHeaders.hasOwnProperty(n) && (t[n] = e.authHeaders[n]);
-    }, t.prototype.m = function(t, e) {
-        var n = ft[t];
-        return this.u + "/v1/" + e + ":" + n;
+        e && e.headers.forEach((function(e, n) {
+            return t[n] = e;
+        })), n && n.headers.forEach((function(e, n) {
+            return t[n] = e;
+        }));
+    }, t.prototype.p = function(t, e) {
+        var n = ht[t];
+        return this.h + "/v1/" + e + ":" + n;
     }, t;
 }());
 
@@ -937,7 +942,7 @@ var ht = /** @class */ function(r) {
  * Generates `nBytes` of random bytes.
  *
  * If `nBytes < 0` , an error will be thrown.
- */ function pt(t) {
+ */ function mt(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
@@ -963,14 +968,14 @@ var ht = /** @class */ function(r) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ var dt = /** @class */ function() {
+ */ var yt = /** @class */ function() {
     function t() {}
-    return t.A = function() {
+    return t.P = 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 = pt(40), i = 0; i < r.length; ++i) 
+        ; n.length < 20; ) for (var r = mt(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));
@@ -978,11 +983,11 @@ var ht = /** @class */ function(r) {
     }, t;
 }();
 
-function mt(t, e) {
+function vt(t, e) {
     return t < e ? -1 : t > e ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function yt(t, e, n) {
+/** Helper to compare arrays using isEqual(). */ function gt(t, e, n) {
     return t.length === e.length && t.every((function(t, r) {
         return n(t, e[r]);
     }));
@@ -1018,7 +1023,7 @@ function mt(t, e) {
  *
  * For examples and further specifications, refer to the
  * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
- */ var vt = /** @class */ function() {
+ */ var wt = /** @class */ function() {
     /**
      * Creates a new timestamp.
      *
@@ -1039,11 +1044,11 @@ function mt(t, e) {
      * The fractions of a second at nanosecond resolution.*
      */
     e) {
-        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new x(V, "Timestamp nanoseconds out of range: " + e);
-        if (e >= 1e9) throw new x(V, "Timestamp nanoseconds out of range: " + e);
-        if (t < -62135596800) throw new x(V, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new M(k, "Timestamp nanoseconds out of range: " + e);
+        if (e >= 1e9) throw new M(k, "Timestamp nanoseconds out of range: " + e);
+        if (t < -62135596800) throw new M(k, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new x(V, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new M(k, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
@@ -1095,7 +1100,7 @@ function mt(t, e) {
     t.prototype.toMillis = function() {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }, t.prototype._compareTo = function(t) {
-        return this.seconds === t.seconds ? mt(this.nanoseconds, t.nanoseconds) : mt(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? vt(this.nanoseconds, t.nanoseconds) : vt(this.seconds, t.seconds);
     }, 
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1132,14 +1137,14 @@ function mt(t, e) {
         // 'seconds' values.
                 return String(t).padStart(12, "0") + "." + String(this.nanoseconds).padStart(9, "0");
     }, t;
-}(), gt = /** @class */ function() {
+}(), bt = /** @class */ function() {
     function t(t) {
         this.timestamp = t;
     }
     return t.fromTimestamp = function(e) {
         return new t(e);
     }, t.min = function() {
-        return new t(new vt(0, 0));
+        return new t(new wt(0, 0));
     }, t.prototype.compareTo = function(t) {
         return this.timestamp._compareTo(t.timestamp);
     }, t.prototype.isEqual = function(t) {
@@ -1191,13 +1196,13 @@ function mt(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function wt(t) {
+function _t(t) {
     var e = 0;
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
 }
 
-function bt(t, e) {
+function Tt(t, e) {
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
@@ -1226,12 +1231,12 @@ function bt(t, e) {
  *   foo.bar - Overwrites only the field bar of the object foo.
  *             If foo is not an object, foo is replaced with an object
  *             containing foo
- */ var _t = /** @class */ function() {
+ */ var St = /** @class */ function() {
     function t(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
         // Sort the field mask to support `FieldMask.isEqual()` and assert below.
-        t.sort(J.comparator)
+        t.sort(tt.comparator)
         /**
      * Verifies that `fieldPath` is included by at least one field in this field
      * mask.
@@ -1245,11 +1250,11 @@ function bt(t, e) {
         }
         return !1;
     }, t.prototype.isEqual = function(t) {
-        return yt(this.fields, t.fields, (function(t, e) {
+        return gt(this.fields, t.fields, (function(t, e) {
             return t.isEqual(e);
         }));
     }, t;
-}(), St = /** @class */ function() {
+}(), Et = /** @class */ function() {
     function t(t) {
         this.binaryString = t;
     }
@@ -1276,7 +1281,7 @@ function bt(t, e) {
     }, t.prototype.approximateByteSize = function() {
         return 2 * this.binaryString.length;
     }, t.prototype.compareTo = function(t) {
-        return mt(this.binaryString, t.binaryString);
+        return vt(this.binaryString, t.binaryString);
     }, t.prototype.isEqual = function(t) {
         return this.binaryString === t.binaryString;
     }, t;
@@ -1323,23 +1328,23 @@ function bt(t, e) {
  * the proto byte string in a common class that must be converted into a string
  * before being sent as a proto.
  * @internal
- */ St.EMPTY_BYTE_STRING = new St("");
+ */ Et.EMPTY_BYTE_STRING = new Et("");
 
-var Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+var It = 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 Et(t) {
+ */ function At(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 (T(!!t), "string" == typeof t) {
+    if (S(!!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 = Tt.exec(t);
-        if (T(!!n), n[1]) {
+        var e = 0, n = It.exec(t);
+        if (S(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             var r = n[1];
             r = (r + "000000000").substr(0, 9), e = Number(r);
@@ -1352,21 +1357,21 @@ var Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: It(t.seconds),
-        nanos: It(t.nanos)
+        seconds: kt(t.seconds),
+        nanos: kt(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function It(t) {
+ */ function kt(t) {
     // TODO(bjornick): Handle int64 greater than 53 bits.
     return "number" == typeof t ? t : "string" == typeof t ? Number(t) : 0;
 }
 
-/** Converts the possible Proto types for Blobs into a ByteString. */ function At(t) {
-    return "string" == typeof t ? St.fromBase64String(t) : St.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Vt(t) {
+    return "string" == typeof t ? Et.fromBase64String(t) : Et.fromUint8Array(t);
 }
 
 /**
@@ -1402,7 +1407,7 @@ var Tt = 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 Vt(t) {
+ */ function Dt(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);
 }
@@ -1412,16 +1417,16 @@ var Tt = 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 Dt(t) {
+ */ function Pt(t) {
     var e = t.mapValue.fields.__previous_value__;
-    return Vt(e) ? Dt(e) : e;
+    return Dt(e) ? Pt(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function kt(t) {
-    var e = Et(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new vt(e.seconds, e.nanos);
+ */ function Ft(t) {
+    var e = At(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new wt(e.seconds, e.nanos);
 }
 
 /**
@@ -1440,13 +1445,13 @@ var Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Extracts the backend's type order for the provided value. */ function Pt(t) {
-    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Vt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : S();
+/** Extracts the backend's type order for the provided value. */ function Nt(t) {
+    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Dt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : T();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Nt(t, e) {
-    var n = Pt(t);
-    if (n !== Pt(e)) return !1;
+/** Tests `left` and `right` for equality based on the backend semantics. */ function qt(t, e) {
+    var n = Nt(t);
+    if (n !== Nt(e)) return !1;
     switch (n) {
       case 0 /* NullValue */ :
         return !0;
@@ -1455,14 +1460,14 @@ var Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         return t.booleanValue === e.booleanValue;
 
       case 4 /* ServerTimestampValue */ :
-        return kt(t).isEqual(kt(e));
+        return Ft(t).isEqual(Ft(e));
 
       case 3 /* 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 = Et(t.timestampValue), r = Et(e.timestampValue);
+            var n = At(t.timestampValue), r = At(e.timestampValue);
             return n.seconds === r.seconds && n.nanos === r.nanos;
         }(t, e);
 
@@ -1471,7 +1476,7 @@ var Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            return At(t.bytesValue).isEqual(At(e.bytesValue));
+            return Vt(t.bytesValue).isEqual(Vt(e.bytesValue));
         }(t, e);
 
       case 7 /* RefValue */ :
@@ -1479,96 +1484,96 @@ var Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            return It(t.geoPointValue.latitude) === It(e.geoPointValue.latitude) && It(t.geoPointValue.longitude) === It(e.geoPointValue.longitude);
+            return kt(t.geoPointValue.latitude) === kt(e.geoPointValue.latitude) && kt(t.geoPointValue.longitude) === kt(e.geoPointValue.longitude);
         }(t, e);
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            if ("integerValue" in t && "integerValue" in e) return It(t.integerValue) === It(e.integerValue);
+            if ("integerValue" in t && "integerValue" in e) return kt(t.integerValue) === kt(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
-                var n = It(t.doubleValue), r = It(e.doubleValue);
-                return n === r ? st(n) === st(r) : isNaN(n) && isNaN(r);
+                var n = kt(t.doubleValue), r = kt(e.doubleValue);
+                return n === r ? ct(n) === ct(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* ArrayValue */ :
-        return yt(t.arrayValue.values || [], e.arrayValue.values || [], Nt);
+        return gt(t.arrayValue.values || [], e.arrayValue.values || [], qt);
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
             var n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (wt(n) !== wt(r)) return !1;
-            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !Nt(n[i], r[i]))) return !1;
+            if (_t(n) !== _t(r)) return !1;
+            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !qt(n[i], r[i]))) return !1;
             return !0;
         }(t, e);
 
       default:
-        return S();
+        return T();
     }
 }
 
-function Ft(t, e) {
+function Ot(t, e) {
     return void 0 !== (t.values || []).find((function(t) {
-        return Nt(t, e);
+        return qt(t, e);
     }));
 }
 
-function Ot(t, e) {
-    var n = Pt(t), r = Pt(e);
-    if (n !== r) return mt(n, r);
+function Ct(t, e) {
+    var n = Nt(t), r = Nt(e);
+    if (n !== r) return vt(n, r);
     switch (n) {
       case 0 /* NullValue */ :
         return 0;
 
       case 1 /* BooleanValue */ :
-        return mt(t.booleanValue, e.booleanValue);
+        return vt(t.booleanValue, e.booleanValue);
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            var n = It(t.integerValue || t.doubleValue), r = It(e.integerValue || e.doubleValue);
+            var n = kt(t.integerValue || t.doubleValue), r = kt(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 /* TimestampValue */ :
-        return qt(t.timestampValue, e.timestampValue);
+        return jt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return qt(kt(t), kt(e));
+        return jt(Ft(t), Ft(e));
 
       case 5 /* StringValue */ :
-        return mt(t.stringValue, e.stringValue);
+        return vt(t.stringValue, e.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            var n = At(t), r = At(e);
+            var n = Vt(t), r = Vt(e);
             return n.compareTo(r);
         }(t.bytesValue, e.bytesValue);
 
       case 7 /* RefValue */ :
         return function(t, e) {
             for (var n = t.split("/"), r = e.split("/"), i = 0; i < n.length && i < r.length; i++) {
-                var o = mt(n[i], r[i]);
+                var o = vt(n[i], r[i]);
                 if (0 !== o) return o;
             }
-            return mt(n.length, r.length);
+            return vt(n.length, r.length);
         }(t.referenceValue, e.referenceValue);
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            var n = mt(It(t.latitude), It(e.latitude));
-            return 0 !== n ? n : mt(It(t.longitude), It(e.longitude));
+            var n = vt(kt(t.latitude), kt(e.latitude));
+            return 0 !== n ? n : vt(kt(t.longitude), kt(e.longitude));
         }(t.geoPointValue, e.geoPointValue);
 
       case 9 /* ArrayValue */ :
         return function(t, e) {
             for (var n = t.values || [], r = e.values || [], i = 0; i < n.length && i < r.length; ++i) {
-                var o = Ot(n[i], r[i]);
+                var o = Ct(n[i], r[i]);
                 if (o) return o;
             }
-            return mt(n.length, r.length);
+            return vt(n.length, r.length);
         }(t.arrayValue, e.arrayValue);
 
       case 10 /* ObjectValue */ :
@@ -1580,36 +1585,36 @@ function Ot(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 s = mt(r[a], o[a]);
+                var s = vt(r[a], o[a]);
                 if (0 !== s) return s;
-                var u = Ot(n[r[a]], i[o[a]]);
+                var u = Ct(n[r[a]], i[o[a]]);
                 if (0 !== u) return u;
             }
-            return mt(r.length, o.length);
+            return vt(r.length, o.length);
         }(t.mapValue, e.mapValue);
 
       default:
-        throw S();
+        throw T();
     }
 }
 
-function qt(t, e) {
-    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return mt(t, e);
-    var n = Et(t), r = Et(e), i = mt(n.seconds, r.seconds);
-    return 0 !== i ? i : mt(n.nanos, r.nanos);
+function jt(t, e) {
+    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return vt(t, e);
+    var n = At(t), r = At(e), i = vt(n.seconds, r.seconds);
+    return 0 !== i ? i : vt(n.nanos, r.nanos);
 }
 
-function jt(t, e) {
+function Lt(t, e) {
     return {
         referenceValue: "projects/" + t.projectId + "/databases/" + t.database + "/documents/" + e.path.canonicalString()
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Lt(t) {
+/** Returns true if `value` is an ArrayValue. */ function Rt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Rt(t) {
+/** Returns true if `value` is a NullValue. */ function Mt(t) {
     return !!t && "nullValue" in t;
 }
 
@@ -1634,7 +1639,7 @@ function jt(t, e) {
                 fields: {}
             }
         };
-        return bt(t.mapValue.fields, (function(t, n) {
+        return Tt(t.mapValue.fields, (function(t, n) {
             return e.mapValue.fields[t] = Bt(n);
         })), e;
     }
@@ -1668,7 +1673,7 @@ function jt(t, e) {
 /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ var Ct = /** @class */ function() {
+ */ var Gt = /** @class */ function() {
     function t(t) {
         this.value = t;
     }
@@ -1703,7 +1708,7 @@ function jt(t, e) {
      * @param data - A map of fields to values (or null for deletes).
      */
     t.prototype.setAll = function(t) {
-        var e = this, n = J.emptyPath(), r = {}, i = [];
+        var e = this, n = tt.emptyPath(), r = {}, i = [];
         t.forEach((function(t, o) {
             if (!n.isImmediateParentOf(o)) {
                 // Insert the accumulated changes at this parent location
@@ -1725,7 +1730,7 @@ function jt(t, e) {
         var e = this.field(t.popLast());
         xt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }, t.prototype.isEqual = function(t) {
-        return Nt(this.value, t.value);
+        return qt(this.value, t.value);
     }, 
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -1751,7 +1756,7 @@ function jt(t, e) {
      * entries.
      */
     t.prototype.applyChanges = function(t, e, n) {
-        bt(e, (function(e, n) {
+        Tt(e, (function(e, n) {
             return t[e] = n;
         }));
         for (var r = 0, i = n; r < i.length; r++) {
@@ -1761,7 +1766,7 @@ function jt(t, e) {
     }, t.prototype.clone = function() {
         return new t(Bt(this.value));
     }, t;
-}(), Mt = /** @class */ function() {
+}(), zt = /** @class */ function() {
     function t(t, e, n, r, i) {
         this.key = t, this.documentType = e, this.version = n, this.data = r, this.documentState = i
         /**
@@ -1770,7 +1775,7 @@ function jt(t, e) {
      */;
     }
     return t.newInvalidDocument = function(e) {
-        return new t(e, 0 /* INVALID */ , gt.min(), Ct.empty(), 0 /* SYNCED */);
+        return new t(e, 0 /* INVALID */ , bt.min(), Gt.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist with the given data at the
@@ -1780,7 +1785,7 @@ function jt(t, e) {
         return new t(e, 1 /* FOUND_DOCUMENT */ , n, r, 0 /* 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 /* NO_DOCUMENT */ , n, Ct.empty(), 0 /* SYNCED */);
+        return new t(e, 2 /* NO_DOCUMENT */ , n, Gt.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist at the given version but
@@ -1788,7 +1793,7 @@ function jt(t, e) {
      * base document).
      */
     t.newUnknownDocument = function(e, n) {
-        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, Ct.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, Gt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }, 
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -1803,7 +1808,7 @@ function jt(t, e) {
      * version.
      */
     t.prototype.convertToNoDocument = function(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Ct.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Gt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }, 
     /**
@@ -1812,7 +1817,7 @@ function jt(t, e) {
      * base document).
      */
     t.prototype.convertToUnknownDocument = function(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Ct.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Gt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }, t.prototype.setHasCommittedMutations = function() {
         return this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
@@ -1851,11 +1856,11 @@ function jt(t, e) {
     }, t.prototype.toString = function() {
         return "Document(" + this.key + ", " + this.version + ", " + JSON.stringify(this.data.value) + ", {documentType: " + this.documentType + "}), {documentState: " + this.documentState + "})";
     }, t;
-}(), Gt = function(t, e, n, r, i, o, a) {
+}(), Qt = 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, 
-    this.startAt = o, this.endAt = a, this.P = null;
+    this.startAt = o, this.endAt = a, this.R = null;
 };
 
 /**
@@ -1892,13 +1897,13 @@ function jt(t, e) {
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
  */
-function Qt(t, e, n, r, i, o, a) {
+function Kt(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 Gt(t, e, n, r, i, o, a);
+    new Qt(t, e, n, r, i, o, a);
 }
 
-var zt = /** @class */ function(e) {
+var Ht = /** @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;
@@ -1906,15 +1911,15 @@ var zt = /** @class */ function(e) {
     /**
      * Creates a filter based on the provided arguments.
      */    return t(n, e), n.create = function(t, e, r) {
-        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.R(t, e, r) : new Ht(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Xt(t, r) : "in" /* IN */ === e ? new $t(t, r) : "not-in" /* NOT_IN */ === e ? new Jt(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new Zt(t, r) : new n(t, e, r);
-    }, n.R = function(t, e, n) {
-        return "in" /* IN */ === e ? new Kt(t, n) : new Wt(t, n);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, r) : new Wt(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Jt(t, r) : "in" /* IN */ === e ? new Zt(t, r) : "not-in" /* NOT_IN */ === e ? new te(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ee(t, r) : new n(t, e, r);
+    }, n.V = function(t, e, n) {
+        return "in" /* IN */ === e ? new Yt(t, n) : new $t(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 "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.V(Ot(e, this.value)) : null !== e && Pt(this.value) === Pt(e) && this.V(Ot(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.D(Ct(e, this.value)) : null !== e && Nt(this.value) === Nt(e) && this.D(Ct(e, this.value));
         // Only compare types with matching backend order (such as double and int).
-        }, n.prototype.V = function(t) {
+        }, n.prototype.D = function(t) {
         switch (this.op) {
           case "<" /* LESS_THAN */ :
             return t < 0;
@@ -1935,24 +1940,25 @@ var zt = /** @class */ function(e) {
             return t >= 0;
 
           default:
-            return S();
+            return T();
         }
-    }, n.prototype.D = function() {
+    }, n.prototype.N = function() {
         return [ "<" /* LESS_THAN */ , "<=" /* LESS_THAN_OR_EQUAL */ , ">" /* GREATER_THAN */ , ">=" /* GREATER_THAN_OR_EQUAL */ , "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ].indexOf(this.op) >= 0;
     }, n;
-}((function() {})), Ht = /** @class */ function(e) {
+}((function() {})), Wt = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this, t, n, r) || this).key = Z.fromName(r.referenceValue), i;
+        return (i = e.call(this, t, n, r) || this).key = et.fromName(r.referenceValue), 
+        i;
     }
     return t(n, e), n.prototype.matches = function(t) {
-        var e = Z.comparator(t.key, this.key);
-        return this.V(e);
+        var e = et.comparator(t.key, this.key);
+        return this.D(e);
     }, n;
-}(zt), Kt = /** @class */ function(e) {
+}(Ht), Yt = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "in" /* IN */ , n) || this).keys = Yt("in" /* IN */ , n), 
+        return (r = e.call(this, t, "in" /* IN */ , n) || this).keys = Xt("in" /* IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1960,10 +1966,10 @@ var zt = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(zt), Wt = /** @class */ function(e) {
+}(Ht), $t = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "not-in" /* NOT_IN */ , n) || this).keys = Yt("not-in" /* NOT_IN */ , n), 
+        return (r = e.call(this, t, "not-in" /* NOT_IN */ , n) || this).keys = Xt("not-in" /* NOT_IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1971,67 +1977,67 @@ var zt = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(zt);
+}(Ht);
 
-/** Filter that matches on key fields (i.e. '__name__'). */ function Yt(t, e) {
+/** Filter that matches on key fields (i.e. '__name__'). */ function Xt(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((function(t) {
-        return Z.fromName(t.referenceValue);
+        return et.fromName(t.referenceValue);
     }));
 }
 
-/** A Filter that implements the array-contains operator. */ var Xt = /** @class */ function(e) {
+/** A Filter that implements the array-contains operator. */ var Jt = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "array-contains" /* ARRAY_CONTAINS */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = t.data.field(this.field);
-        return Lt(e) && Ft(e.arrayValue, this.value);
+        return Rt(e) && Ot(e.arrayValue, this.value);
     }, n;
-}(zt), $t = /** @class */ function(e) {
+}(Ht), Zt = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "in" /* IN */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = t.data.field(this.field);
-        return null !== e && Ft(this.value.arrayValue, e);
+        return null !== e && Ot(this.value.arrayValue, e);
     }, n;
-}(zt), Jt = /** @class */ function(e) {
+}(Ht), te = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "not-in" /* NOT_IN */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
-        if (Ft(this.value.arrayValue, {
+        if (Ot(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         var e = t.data.field(this.field);
-        return null !== e && !Ft(this.value.arrayValue, e);
+        return null !== e && !Ot(this.value.arrayValue, e);
     }, n;
-}(zt), Zt = /** @class */ function(e) {
+}(Ht), ee = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = this, n = t.data.field(this.field);
-        return !(!Lt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
-            return Ft(e.value.arrayValue, t);
+        return !(!Rt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
+            return Ot(e.value.arrayValue, t);
         }));
     }, n;
-}(zt), te = function(t, e) {
+}(Ht), ne = function(t, e) {
     this.position = t, this.before = e;
-}, ee = function(t, e /* ASCENDING */) {
+}, re = function(t, e /* ASCENDING */) {
     void 0 === e && (e = "asc"), this.field = t, this.dir = e;
 };
 
-/** A Filter that implements the IN operator. */ function ne(t, e) {
+/** A Filter that implements the IN operator. */ function ie(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
-function re(t, e) {
+function oe(t, e) {
     if (null === t) return null === e;
     if (null === e) return !1;
     if (t.before !== e.before || t.position.length !== e.position.length) return !1;
-    for (var n = 0; n < t.position.length; n++) if (!Nt(t.position[n], e.position[n])) return !1;
+    for (var n = 0; n < t.position.length; n++) if (!qt(t.position[n], e.position[n])) return !1;
     return !0;
 }
 
@@ -2057,7 +2063,7 @@ function re(t, e) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ var ie = 
+ */ var ae = 
 /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2067,23 +2073,23 @@ function(t, e, n, r, i, o /* First */ , a, s) {
     void 0 === i && (i = null), void 0 === o && (o = "F"), void 0 === a && (a = null), 
     void 0 === s && (s = null), this.path = t, this.collectionGroup = e, this.explicitOrderBy = n, 
     this.filters = r, this.limit = i, this.limitType = o, this.startAt = a, this.endAt = s, 
-    this.N = null, 
+    this.$ = null, 
     // The corresponding `Target` of this `Query` instance.
-    this.$ = null, this.startAt, this.endAt;
+    this.F = null, this.startAt, this.endAt;
 };
 
-/** Creates a new Query for a query that matches all documents at `path` */ function oe(t) {
-    return !at(t.limit) && "L" /* Last */ === t.limitType;
+/** Creates a new Query for a query that matches all documents at `path` */ function se(t) {
+    return !ut(t.limit) && "L" /* Last */ === t.limitType;
 }
 
-function ae(t) {
+function ue(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function se(t) {
+function ce(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
         var r = n[e];
-        if (r.D()) return r.field;
+        if (r.N()) return r.field;
     }
     return null;
 }
@@ -2095,7 +2101,7 @@ function se(t) {
 /**
  * Returns whether the query matches a collection group rather than a specific
  * collection.
- */ function ue(t) {
+ */ function le(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2103,48 +2109,48 @@ function se(t) {
  * Returns the implicit order by constraint that is used to execute the Query,
  * which can be different from the order by constraints the user provided (e.g.
  * the SDK and backend always orders by `__name__`).
- */ function ce(t) {
+ */ function fe(t) {
     var e = E(t);
-    if (null === e.N) {
-        e.N = [];
-        var n = se(e), r = ae(e);
+    if (null === e.$) {
+        e.$ = [];
+        var n = ce(e), r = ue(e);
         if (null !== n && null === r) 
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
         // Note that the default inequality field and key ordering is ascending.
-        n.isKeyField() || e.N.push(new ee(n)), e.N.push(new ee(J.keyField(), "asc" /* ASCENDING */)); else {
+        n.isKeyField() || e.$.push(new re(n)), e.$.push(new re(tt.keyField(), "asc" /* ASCENDING */)); else {
             for (var i = !1, o = 0, a = e.explicitOrderBy; o < a.length; o++) {
                 var s = a[o];
-                e.N.push(s), s.field.isKeyField() && (i = !0);
+                e.$.push(s), s.field.isKeyField() && (i = !0);
             }
             if (!i) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 var u = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* ASCENDING */;
-                e.N.push(new ee(J.keyField(), u));
+                e.$.push(new re(tt.keyField(), u));
             }
         }
     }
-    return e.N;
+    return e.$;
 }
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function fe(t) {
+ */ function he(t) {
     var e = E(t);
-    if (!e.$) if ("F" /* First */ === e.limitType) e.$ = Qt(e.path, e.collectionGroup, ce(e), e.filters, e.limit, e.startAt, e.endAt); else {
+    if (!e.F) if ("F" /* First */ === e.limitType) e.F = Kt(e.path, e.collectionGroup, fe(e), e.filters, e.limit, e.startAt, e.endAt); else {
         for (
         // Flip the orderBy directions since we want the last results
-        var n = [], r = 0, i = ce(e); r < i.length; r++) {
+        var n = [], r = 0, i = fe(e); r < i.length; r++) {
             var o = i[r], a = "desc" /* DESCENDING */ === o.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            n.push(new ee(o.field, a));
+            n.push(new re(o.field, a));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                var s = e.endAt ? new te(e.endAt.position, !e.endAt.before) : null, u = e.startAt ? new te(e.startAt.position, !e.startAt.before) : null;
+                var s = e.endAt ? new ne(e.endAt.position, !e.endAt.before) : null, u = e.startAt ? new ne(e.startAt.position, !e.startAt.before) : null;
         // Now return as a LimitType.First query.
-                e.$ = Qt(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
+                e.F = Kt(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
     }
-    return e.$;
+    return e.F;
 }
 
 /**
@@ -2172,9 +2178,9 @@ function se(t) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function le(t, e) {
+function pe(t, e) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !st(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !ct(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
     /**
      * Returns an IntegerValue for `value`.
@@ -2184,7 +2190,7 @@ function le(t, e) {
             integerValue: "" + t
         };
     }(e) : function(t, e) {
-        if (t.F) {
+        if (t.S) {
             if (isNaN(e)) return {
                 doubleValue: "NaN"
             };
@@ -2196,7 +2202,7 @@ function le(t, e) {
             };
         }
         return {
-            doubleValue: st(e) ? "-0" : e
+            doubleValue: ct(e) ? "-0" : e
         };
     }(t, e);
 }
@@ -2217,36 +2223,36 @@ function le(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 he = function() {
+/** Used to represent a field transform on a mutation. */ var de = function() {
     // Make sure that the structural type of `TransformOperation` is unique.
     // See https://github.com/microsoft/TypeScript/issues/5451
     this._ = void 0;
-}, pe = /** @class */ function(e) {
+}, me = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(he), de = /** @class */ function(e) {
+}(de), ye = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(he), me = /** @class */ function(e) {
+}(de), ve = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(he), ye = /** @class */ function(e) {
+}(de), ge = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this) || this).S = t, r.q = n, r;
+        return (r = e.call(this) || this).q = t, r.O = n, r;
     }
     return t(n, e), n;
-}(he), ve = function(t, e) {
+}(de), we = function(t, e) {
     this.field = t, this.transform = e;
-}, ge = /** @class */ function() {
+}, be = /** @class */ function() {
     function t(t, e) {
         this.updateTime = t, this.exists = e
         /** Creates a new empty Precondition. */;
@@ -2268,7 +2274,7 @@ function le(t, e) {
     }), t.prototype.isEqual = function(t) {
         return this.exists === t.exists && (this.updateTime ? !!t.updateTime && this.updateTime.isEqual(t.updateTime) : !t.updateTime);
     }, t;
-}(), we = function() {}, be = /** @class */ function(e) {
+}(), _e = function() {}, Te = /** @class */ function(e) {
     function n(t, n, r, i) {
         void 0 === i && (i = []);
         var o = this;
@@ -2276,7 +2282,7 @@ function le(t, e) {
         o.type = 0 /* Set */ , o;
     }
     return t(n, e), n;
-}(we), _e = /** @class */ function(e) {
+}(_e), Se = /** @class */ function(e) {
     function n(t, n, r, i, o) {
         void 0 === o && (o = []);
         var a = this;
@@ -2284,24 +2290,24 @@ function le(t, e) {
         a.fieldTransforms = o, a.type = 1 /* Patch */ , a;
     }
     return t(n, e), n;
-}(we), Se = /** @class */ function(e) {
+}(_e), Ee = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).key = t, r.precondition = n, r.type = 2 /* Delete */ , 
         r.fieldTransforms = [], r;
     }
     return t(n, e), n;
-}(we), Te = /** @class */ function(e) {
+}(_e), Ie = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).key = t, r.precondition = n, r.type = 3 /* Verify */ , 
         r.fieldTransforms = [], r;
     }
     return t(n, e), n;
-}(we), Ee = {
+}(_e), Ae = {
     asc: "ASCENDING",
     desc: "DESCENDING"
-}, Ie = {
+}, ke = {
     "<": "LESS_THAN",
     "<=": "LESS_THAN_OR_EQUAL",
     ">": "GREATER_THAN",
@@ -2312,8 +2318,8 @@ function le(t, e) {
     in: "IN",
     "not-in": "NOT_IN",
     "array-contains-any": "ARRAY_CONTAINS_ANY"
-}, Ae = function(t, e) {
-    this.databaseId = t, this.F = e;
+}, Ve = function(t, e) {
+    this.databaseId = t, this.S = e;
 };
 
 /** Transforms a value into a server-generated timestamp. */
@@ -2328,8 +2334,8 @@ function le(t, e) {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Ve(t, e) {
-    return t.F ? new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "") + "." + ("000000000" + e.nanoseconds).slice(-9) + "Z" : {
+function De(t, e) {
+    return t.S ? new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "") + "." + ("000000000" + e.nanoseconds).slice(-9) + "Z" : {
         seconds: "" + e.seconds,
         nanos: e.nanoseconds
     };
@@ -2339,57 +2345,57 @@ function Ve(t, e) {
  * Returns a value for bytes that's appropriate to put in a proto.
  *
  * Visible for testing.
- */ function De(t, e) {
-    return t.F ? e.toBase64() : e.toUint8Array();
+ */ function Pe(t, e) {
+    return t.S ? e.toBase64() : e.toUint8Array();
 }
 
-function ke(t, e) {
-    return Ve(t, e.toTimestamp());
+function Fe(t, e) {
+    return De(t, e.toTimestamp());
 }
 
-function Pe(t) {
-    return T(!!t), gt.fromTimestamp(function(t) {
-        var e = Et(t);
-        return new vt(e.seconds, e.nanos);
+function Ne(t) {
+    return S(!!t), bt.fromTimestamp(function(t) {
+        var e = At(t);
+        return new wt(e.seconds, e.nanos);
     }(t));
 }
 
-function Ne(t, e) {
+function qe(t, e) {
     return function(t) {
-        return new X([ "projects", t.projectId, "databases", t.database ]);
+        return new J([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
-function Fe(t, e) {
-    return Ne(t.databaseId, e.path);
+function Oe(t, e) {
+    return qe(t.databaseId, e.path);
 }
 
-function Oe(t, e) {
+function Ce(t, e) {
     var n, r = function(t) {
-        var e = X.fromString(t);
-        return T(Me(e)), e;
+        var e = J.fromString(t);
+        return S(ze(e)), e;
     }(e);
-    if (r.get(1) !== t.databaseId.projectId) throw new x(V, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
-    if (r.get(3) !== t.databaseId.database) throw new x(V, "Tried to deserialize key from different database: " + r.get(3) + " vs " + t.databaseId.database);
-    return new Z((T((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
+    if (r.get(1) !== t.databaseId.projectId) throw new M(k, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
+    if (r.get(3) !== t.databaseId.database) throw new M(k, "Tried to deserialize key from different database: " + r.get(3) + " vs " + t.databaseId.database);
+    return new et((S((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
 }
 
-function qe(t, e) {
-    return Ne(t.databaseId, e);
+function je(t, e) {
+    return qe(t.databaseId, e);
 }
 
-function je(t) {
-    return new X([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
+function Le(t) {
+    return new J([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Le(t, e, n) {
+function Re(t, e, n) {
     return {
-        name: Fe(t, e),
+        name: Oe(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function Re(t) {
+function Me(t) {
     return {
         before: t.before,
         values: t.position
@@ -2398,12 +2404,12 @@ function Re(t) {
 
 // visible for testing
 function Ue(t) {
-    return Ee[t];
+    return Ae[t];
 }
 
 // visible for testing
 function xe(t) {
-    return Ie[t];
+    return ke[t];
 }
 
 function Be(t) {
@@ -2412,7 +2418,7 @@ function Be(t) {
     };
 }
 
-function Ce(t) {
+function Ge(t) {
     var e = [];
     return t.fields.forEach((function(t) {
         return e.push(t.canonicalString());
@@ -2421,7 +2427,7 @@ function Ce(t) {
     };
 }
 
-function Me(t) {
+function ze(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2441,8 +2447,8 @@ function Me(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 Ge(t) {
-    return new Ae(t, /* useProto3Json= */ !0);
+ */ function Qe(t) {
+    return new Ve(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -2469,7 +2475,7 @@ function Me(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 Qe = /** @class */ function() {
+ */ var Ke = /** @class */ function() {
     function t(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -2495,7 +2501,7 @@ function Me(t) {
      * much as 1.5*maxDelayMs.
      */ , i) {
         void 0 === n && (n = 1e3), void 0 === r && (r = 1.5), void 0 === i && (i = 6e4), 
-        this.O = t, this.timerId = e, this.C = n, this.L = r, this.U = i, this.j = 0, this.k = null, 
+        this.C = t, this.timerId = e, this.L = n, this.U = r, this.k = i, this.j = 0, this.M = null, 
         /** The last backoff attempt, as epoch milliseconds. */
         this.B = Date.now(), this.reset();
     }
@@ -2512,64 +2518,67 @@ function Me(t) {
      * Resets the backoff delay to the maximum delay (e.g. for use after a
      * RESOURCE_EXHAUSTED error).
      */
-    t.prototype.M = function() {
-        this.j = this.U;
+    t.prototype.G = function() {
+        this.j = this.k;
     }, 
     /**
      * Returns a promise that resolves after currentDelayMs, and increases the
      * delay for any subsequent attempts. If there was a pending backoff operation
      * already, it will be canceled.
      */
-    t.prototype.G = function(t) {
+    t.prototype.W = function(t) {
         var e = this;
         // Cancel any pending backoff operation.
                 this.cancel();
         // First schedule using the current base (which may be 0 and should be
         // honored as such).
-        var n = Math.floor(this.j + this.W()), r = Math.max(0, Date.now() - this.B), i = Math.max(0, n - r);
+        var n = Math.floor(this.j + this.Y()), r = Math.max(0, Date.now() - this.B), i = Math.max(0, n - r);
         // Guard against lastAttemptTime being in the future due to a clock change.
                 i > 0 && g("ExponentialBackoff", "Backing off for " + i + " ms (base delay: " + this.j + " ms, delay with jitter: " + n + " ms, last attempt: " + r + " ms ago)"), 
-        this.k = this.O.enqueueAfterDelay(this.timerId, i, (function() {
+        this.M = this.C.enqueueAfterDelay(this.timerId, i, (function() {
             return e.B = Date.now(), t();
         })), 
         // Apply backoff factor to determine next delay and ensure it is within
         // bounds.
-        this.j *= this.L, this.j < this.C && (this.j = this.C), this.j > this.U && (this.j = this.U);
+        this.j *= this.U, this.j < this.L && (this.j = this.L), this.j > this.k && (this.j = this.k);
     }, t.prototype.H = function() {
-        null !== this.k && (this.k.skipDelay(), this.k = null);
+        null !== this.M && (this.M.skipDelay(), this.M = null);
     }, t.prototype.cancel = function() {
-        null !== this.k && (this.k.cancel(), this.k = null);
+        null !== this.M && (this.M.cancel(), this.M = null);
     }, 
-    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.W = function() {
+    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.Y = function() {
         return (Math.random() - .5) * this.j;
     }, t;
-}(), ze = /** @class */ function(e) {
-    function n(t, n, r) {
-        var i = this;
-        return (i = e.call(this) || this).credentials = t, i.Y = n, i.S = r, i.K = !1, i;
+}(), He = /** @class */ function(e) {
+    function n(t, n, r, i) {
+        var o = this;
+        return (o = e.call(this) || this).authCredentials = t, o.appCheckCredentials = n, 
+        o.K = r, o.q = i, o.J = !1, o;
     }
-    return t(n, e), n.prototype.J = function() {
-        if (this.K) throw new x(O, "The client has already been terminated.");
+    return t(n, e), n.prototype.X = function() {
+        if (this.J) throw new M(q, "The client has already been terminated.");
     }, 
-    /** Gets an auth token and invokes the provided RPC. */ n.prototype.l = function(t, e, n) {
+    /** Invokes the provided RPC with auth and AppCheck tokens. */ n.prototype.m = function(t, e, n) {
         var r = this;
-        return this.J(), this.credentials.getToken().then((function(i) {
-            return r.Y.l(t, e, n, i);
+        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(i) {
+            var o = i[0], a = i[1];
+            return r.K.m(t, e, n, o, a);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === N && r.credentials.invalidateToken(), 
-            t) : new x(A, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === F && (r.authCredentials.invalidateToken(), 
+            r.appCheckCredentials.invalidateToken()), t) : new M(A, t.toString());
         }));
     }, 
-    /** Gets an auth token and invokes the provided RPC with streamed results. */ n.prototype.v = function(t, e, n) {
+    /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */ n.prototype.T = function(t, e, n) {
         var r = this;
-        return this.J(), this.credentials.getToken().then((function(i) {
-            return r.Y.v(t, e, n, i);
+        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(i) {
+            var o = i[0], a = i[1];
+            return r.K.T(t, e, n, o, a);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === N && r.credentials.invalidateToken(), 
-            t) : new x(A, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === F && (r.authCredentials.invalidateToken(), 
+            r.appCheckCredentials.invalidateToken()), t) : new M(A, t.toString());
         }));
     }, n.prototype.terminate = function() {
-        this.K = !0;
+        this.J = !0;
     }, n;
 }((function() {}));
 
@@ -2600,64 +2609,64 @@ function Me(t) {
  */
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-function He(t, r) {
+function We(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = E(t), i = je(e.S) + "/documents", o = {
+                return e = E(t), i = Le(e.q) + "/documents", o = {
                     writes: r.map((function(t) {
                         return function(t, e) {
                             var n;
-                            if (e instanceof be) n = {
-                                update: Le(t, e.key, e.value)
+                            if (e instanceof Te) n = {
+                                update: Re(t, e.key, e.value)
+                            }; else if (e instanceof Ee) n = {
+                                delete: Oe(t, e.key)
                             }; else if (e instanceof Se) n = {
-                                delete: Fe(t, e.key)
-                            }; else if (e instanceof _e) n = {
-                                update: Le(t, e.key, e.data),
-                                updateMask: Ce(e.fieldMask)
+                                update: Re(t, e.key, e.data),
+                                updateMask: Ge(e.fieldMask)
                             }; else {
-                                if (!(e instanceof Te)) return S();
+                                if (!(e instanceof Ie)) return T();
                                 n = {
-                                    verify: Fe(t, e.key)
+                                    verify: Oe(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 pe) return {
+                                    if (n instanceof me) return {
                                         fieldPath: e.field.canonicalString(),
                                         setToServerValue: "REQUEST_TIME"
                                     };
-                                    if (n instanceof de) return {
+                                    if (n instanceof ye) return {
                                         fieldPath: e.field.canonicalString(),
                                         appendMissingElements: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof me) return {
+                                    if (n instanceof ve) return {
                                         fieldPath: e.field.canonicalString(),
                                         removeAllFromArray: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof ye) return {
+                                    if (n instanceof ge) return {
                                         fieldPath: e.field.canonicalString(),
-                                        increment: n.q
+                                        increment: n.O
                                     };
-                                    throw S();
+                                    throw T();
                                 }(0, t);
                             }))), e.precondition.isNone || (n.currentDocument = function(t, e) {
                                 return void 0 !== e.updateTime ? {
-                                    updateTime: ke(t, e.updateTime)
+                                    updateTime: Fe(t, e.updateTime)
                                 } : void 0 !== e.exists ? {
                                     exists: e.exists
-                                } : S();
+                                } : T();
                             }(t, e.precondition)), n;
-                        }(e.S, t);
+                        }(e.q, t);
                     }))
-                }, [ 4 /*yield*/ , e.l("Commit", i, o) ];
+                }, [ 4 /*yield*/ , e.m("Commit", i, o) ];
 
               case 1:
                 return n.sent(), [ 2 /*return*/ ];
@@ -2666,46 +2675,46 @@ function He(t, r) {
     }));
 }
 
-function Ke(t, r) {
+function Ye(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o, a, s, u;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = E(t), i = je(e.S) + "/documents", o = {
+                return e = E(t), i = Le(e.q) + "/documents", o = {
                     documents: r.map((function(t) {
-                        return Fe(e.S, t);
+                        return Oe(e.q, t);
                     }))
-                }, [ 4 /*yield*/ , e.v("BatchGetDocuments", i, o) ];
+                }, [ 4 /*yield*/ , e.T("BatchGetDocuments", i, o) ];
 
               case 1:
                 return a = n.sent(), s = new Map, a.forEach((function(t) {
                     var n = function(t, e) {
                         return "found" in e ? function(t, e) {
-                            T(!!e.found), e.found.name, e.found.updateTime;
-                            var n = Oe(t, e.found.name), r = Pe(e.found.updateTime), i = new Ct({
+                            S(!!e.found), e.found.name, e.found.updateTime;
+                            var n = Ce(t, e.found.name), r = Ne(e.found.updateTime), i = new Gt({
                                 mapValue: {
                                     fields: e.found.fields
                                 }
                             });
-                            return Mt.newFoundDocument(n, r, i);
+                            return zt.newFoundDocument(n, r, i);
                         }(t, e) : "missing" in e ? function(t, e) {
-                            T(!!e.missing), T(!!e.readTime);
-                            var n = Oe(t, e.missing), r = Pe(e.readTime);
-                            return Mt.newNoDocument(n, r);
-                        }(t, e) : S();
-                    }(e.S, t);
+                            S(!!e.missing), S(!!e.readTime);
+                            var n = Ce(t, e.missing), r = Ne(e.readTime);
+                            return zt.newNoDocument(n, r);
+                        }(t, e) : T();
+                    }(e.q, t);
                     s.set(n.key.toString(), n);
                 })), u = [], [ 2 /*return*/ , (r.forEach((function(t) {
                     var e = s.get(t.toString());
-                    T(!!e), u.push(e);
+                    S(!!e), u.push(e);
                 })), u) ];
             }
         }));
     }));
 }
 
-function We(t, r) {
+function $e(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i;
         return n(this, (function(n) {
@@ -2716,10 +2725,10 @@ function We(t, r) {
                     var n = {
                         structuredQuery: {}
                     }, r = e.path;
-                    null !== e.collectionGroup ? (n.parent = qe(t, r), n.structuredQuery.from = [ {
+                    null !== e.collectionGroup ? (n.parent = je(t, r), n.structuredQuery.from = [ {
                         collectionId: e.collectionGroup,
                         allDescendants: !0
-                    } ]) : (n.parent = qe(t, r.popLast()), n.structuredQuery.from = [ {
+                    } ]) : (n.parent = je(t, r.popLast()), n.structuredQuery.from = [ {
                         collectionId: r.lastSegment()
                     } ]);
                     var i = function(t) {
@@ -2734,7 +2743,7 @@ function We(t, r) {
                                                 op: "IS_NAN"
                                             }
                                         };
-                                        if (Rt(t.value)) return {
+                                        if (Mt(t.value)) return {
                                             unaryFilter: {
                                                 field: Be(t.field),
                                                 op: "IS_NULL"
@@ -2747,7 +2756,7 @@ function We(t, r) {
                                                 op: "IS_NOT_NAN"
                                             }
                                         };
-                                        if (Rt(t.value)) return {
+                                        if (Mt(t.value)) return {
                                             unaryFilter: {
                                                 field: Be(t.field),
                                                 op: "IS_NOT_NULL"
@@ -2785,13 +2794,13 @@ function We(t, r) {
                     }(e.orderBy);
                     o && (n.structuredQuery.orderBy = o);
                     var a = function(t, e) {
-                        return t.F || at(e) ? e : {
+                        return t.S || ut(e) ? e : {
                             value: e
                         };
                     }(t, e.limit);
-                    return null !== a && (n.structuredQuery.limit = a), e.startAt && (n.structuredQuery.startAt = Re(e.startAt)), 
-                    e.endAt && (n.structuredQuery.endAt = Re(e.endAt)), n;
-                }(e.S, fe(r)), [ 4 /*yield*/ , e.v("RunQuery", i.parent, {
+                    return null !== a && (n.structuredQuery.limit = a), e.startAt && (n.structuredQuery.startAt = Me(e.startAt)), 
+                    e.endAt && (n.structuredQuery.endAt = Me(e.endAt)), n;
+                }(e.q, he(r)), [ 4 /*yield*/ , e.T("RunQuery", i.parent, {
                     structuredQuery: i.structuredQuery
                 }) ];
 
@@ -2800,13 +2809,13 @@ function We(t, r) {
                     return !!t.document;
                 })).map((function(t) {
                     return function(t, e, n) {
-                        var r = Oe(t, e.name), i = Pe(e.updateTime), o = new Ct({
+                        var r = Ce(t, e.name), i = Ne(e.updateTime), o = new Gt({
                             mapValue: {
                                 fields: e.fields
                             }
-                        }), a = Mt.newFoundDocument(r, i, o);
+                        }), a = zt.newFoundDocument(r, i, o);
                         return a;
-                    }(e.S, t.document);
+                    }(e.q, t.document);
                 })) ];
             }
         }));
@@ -2828,7 +2837,7 @@ function We(t, r) {
  * 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 Ye = new Map;
+ */ var Xe = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -2838,17 +2847,17 @@ function We(t, r) {
  * Returns an initialized and started Datastore for the given Firestore
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
- */ function Xe(t) {
-    if (t._terminated) throw new x(O, "The client has already been terminated.");
-    if (!Ye.has(t)) {
+ */ function Je(t) {
+    if (t._terminated) throw new M(q, "The client has already been terminated.");
+    if (!Xe.has(t)) {
         g("ComponentProvider", "Initializing Datastore");
         var e = function(t) {
-            return new ht(t, fetch.bind(null));
+            return new dt(t, fetch.bind(null));
         }((i = t._databaseId, o = t.app.options.appId || "", a = t._persistenceKey, s = t._freezeSettings(), 
-        new K(i, o, a, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), n = Ge(t._databaseId), r = function(t, e, n) {
-            return new ze(t, e, n);
-        }(t._credentials, e, n);
-        Ye.set(t, r);
+        new Y(i, o, a, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), n = Qe(t._databaseId), r = function(t, e, n, r) {
+            return new He(t, e, n, r);
+        }(t._authCredentials, t._appCheckCredentials, e, n);
+        Xe.set(t, r);
     }
     var i, o, a, s;
     /**
@@ -2866,7 +2875,7 @@ function We(t, r) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */    return Ye.get(t);
+ */    return Xe.get(t);
 }
 
 /**
@@ -2877,38 +2886,38 @@ function We(t, r) {
  * 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 $e = /** @class */ function() {
+ */ var Ze = /** @class */ function() {
     function t(t) {
         var e;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new x(V, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new M(k, "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, 
         void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
-            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new x(V, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new M(k, "cacheSizeBytes must be at least 1048576");
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
         this.useFetchStreams = !!t.useFetchStreams, function(t, e, n, r) {
-            if (!0 === e && !0 === r) throw new x(V, "experimentalForceLongPolling and experimentalAutoDetectLongPolling cannot be used together.");
+            if (!0 === e && !0 === r) throw new M(k, "experimentalForceLongPolling and experimentalAutoDetectLongPolling cannot be used together.");
         }(0, t.experimentalForceLongPolling, 0, t.experimentalAutoDetectLongPolling);
     }
     return t.prototype.isEqual = function(t) {
         return this.host === t.host && this.ssl === t.ssl && this.credentials === t.credentials && this.cacheSizeBytes === t.cacheSizeBytes && this.experimentalForceLongPolling === t.experimentalForceLongPolling && this.experimentalAutoDetectLongPolling === t.experimentalAutoDetectLongPolling && this.ignoreUndefinedProperties === t.ignoreUndefinedProperties && this.useFetchStreams === t.useFetchStreams;
     }, t;
-}(), Je = /** @class */ function() {
+}(), tn = /** @class */ function() {
     /** @hideconstructor */
-    function t(t, e) {
-        this._credentials = e, 
+    function t(t, e, n) {
+        this._authCredentials = e, this._appCheckCredentials = n, 
         /**
              * Whether it's a Firestore or Firestore Lite instance.
              */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new $e({}), 
-        this._settingsFrozen = !1, t instanceof W ? this._databaseId = t : (this._app = t, 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new Ze({}), 
+        this._settingsFrozen = !1, t instanceof $ ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
-            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new x(V, '"projectId" not provided in firebase.initializeApp.');
-            return new W(t.options.projectId);
+            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new M(k, '"projectId" not provided in firebase.initializeApp.');
+            return new $(t.options.projectId);
         }(t));
     }
     return Object.defineProperty(t.prototype, "app", {
@@ -2917,7 +2926,7 @@ function We(t, r) {
          * instance.
          */
         get: function() {
-            if (!this._app) throw new x(O, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+            if (!this._app) throw new M(q, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
             return this._app;
         },
         enumerable: !1,
@@ -2935,21 +2944,21 @@ function We(t, r) {
         enumerable: !1,
         configurable: !0
     }), t.prototype._setSettings = function(t) {
-        if (this._settingsFrozen) throw new x(O, "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 $e(t), void 0 !== t.credentials && (this._credentials = function(t) {
-            if (!t) return new M;
+        if (this._settingsFrozen) throw new M(q, "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 Ze(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+            if (!t) return new B;
             switch (t.type) {
               case "gapi":
                 var e = t.client;
                 // Make sure this really is a Gapi client.
-                                return T(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
-                new H(e, t.sessionIndex || "0", t.iamToken || null);
+                                return S(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
+                new K(e, t.sessionIndex || "0", t.iamToken || null);
 
               case "provider":
                 return t.client;
 
               default:
-                throw new x(V, "makeCredentialsProvider failed due to invalid credential type");
+                throw new M(k, "makeAuthCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }, t.prototype._getSettings = function() {
@@ -2974,8 +2983,8 @@ function We(t, r) {
      * Only ever called once.
      */
     t.prototype._terminate = function() {
-        return t = this, (e = Ye.get(t)) && (g("ComponentProvider", "Removing Datastore"), 
-        Ye.delete(t), e.terminate()), Promise.resolve();
+        return t = this, (e = Xe.get(t)) && (g("ComponentProvider", "Removing Datastore"), 
+        Xe.delete(t), e.terminate()), Promise.resolve();
         var t, e;
     }, t;
 }();
@@ -3000,9 +3009,9 @@ function We(t, r) {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ function Ze(t, e) {
+ */ function en(t, e) {
     var n = _getProvider(t, "firestore/lite");
-    if (n.isInitialized()) throw new x(O, "Firestore can only be initialized once per app.");
+    if (n.isInitialized()) throw new M(q, "Firestore can only be initialized once per app.");
     return n.initialize({
         options: e
     });
@@ -3016,7 +3025,7 @@ function We(t, r) {
  * @param app - The {@link @firebase/app#FirebaseApp} instance that the returned `Firestore`
  * instance is associated with.
  * @returns The `Firestore` instance of the provided app.
- */ function tn(t) {
+ */ function nn(t) {
     return void 0 === t && (t = s()), _getProvider(t, "firestore/lite").getImmediate();
 }
 
@@ -3032,10 +3041,10 @@ function We(t, r) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function en(t, e, n, r) {
+ */ function rn(t, e, n, r) {
     var i;
     void 0 === r && (r = {});
-    var o = (t = it(t, Je))._getSettings();
+    var o = (t = at(t, tn))._getSettings();
     if ("firestore.googleapis.com" !== o.host && o.host !== e && b("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, o), {
         host: e + ":" + n,
@@ -3047,10 +3056,10 @@ function We(t, r) {
             // invalid field "uid" and missing field "sub" / "user_id".)
             a = p(r.mockUserToken, null === (i = t._app) || void 0 === i ? void 0 : i.options.projectId);
             var u = r.mockUserToken.sub || r.mockUserToken.user_id;
-            if (!u) throw new x(V, "mockUserToken must contain 'sub' or 'user_id' field!");
+            if (!u) throw new M(k, "mockUserToken must contain 'sub' or 'user_id' field!");
             s = new d(u);
         }
-        t._credentials = new G(new C(a, s));
+        t._authCredentials = new G(new x(a, s));
     }
 }
 
@@ -3073,8 +3082,8 @@ function We(t, r) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function nn(t) {
-    return t = it(t, Je), u(t.app, "firestore/lite"), t._delete()
+ */ function on(t) {
+    return t = at(t, tn), u(t.app, "firestore/lite"), t._delete()
     /**
  * @license
  * Copyright 2020 Google LLC
@@ -3114,7 +3123,7 @@ function We(t, r) {
  */;
 }
 
-var rn = /** @class */ function() {
+var an = /** @class */ function() {
     /** @hideconstructor */
     function t(t, 
     /**
@@ -3155,14 +3164,14 @@ var rn = /** @class */ function() {
          * The collection this `DocumentReference` belongs to.
          */
         get: function() {
-            return new an(this.firestore, this.converter, this._key.path.popLast());
+            return new un(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;
-}(), on = /** @class */ function() {
+}(), sn = /** @class */ function() {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     function t(t, 
@@ -3177,11 +3186,11 @@ var rn = /** @class */ function() {
     return t.prototype.withConverter = function(e) {
         return new t(this.firestore, e, this._query);
     }, t;
-}(), an = /** @class */ function(e) {
+}(), un = /** @class */ function(e) {
     /** @hideconstructor */
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this, t, n, new ie(r)) || this)._path = r, 
+        return (i = e.call(this, t, n, new ae(r)) || this)._path = r, 
         /** The type of this Firestore reference. */
         i.type = "collection", i;
     }
@@ -3208,28 +3217,28 @@ var rn = /** @class */ function() {
          */
         get: function() {
             var t = this._path.popLast();
-            return t.isEmpty() ? null : new rn(this.firestore, 
-            /* converter= */ null, new Z(t));
+            return t.isEmpty() ? null : new an(this.firestore, 
+            /* converter= */ null, new et(t));
         },
         enumerable: !1,
         configurable: !0
     }), n.prototype.withConverter = function(t) {
         return new n(this.firestore, t, this._path);
     }, n;
-}(on);
+}(sn);
 
 /**
  * A `Query` refers to a query which you can read or listen to. You can also
  * construct refined `Query` objects by adding filters and ordering.
- */ function sn(t, e) {
+ */ function cn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
-    if (t = h(t), tt("collection", "path", e), t instanceof Je) {
-        var o = X.fromString.apply(X, r([ e ], n));
-        return nt(o), new an(t, /* converter= */ null, o);
+    if (t = h(t), nt("collection", "path", e), t instanceof tn) {
+        var o = J.fromString.apply(J, r([ e ], n));
+        return it(o), new un(t, /* converter= */ null, o);
     }
-    if (!(t instanceof rn || t instanceof an)) throw new x(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-    var a = t._path.child(X.fromString.apply(X, r([ e ], n)));
-    return nt(a), new an(t.firestore, 
+    if (!(t instanceof an || t instanceof un)) throw new M(k, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    var a = t._path.child(J.fromString.apply(J, r([ e ], n)));
+    return it(a), new un(t.firestore, 
     /* converter= */ null, a);
 }
 
@@ -3245,32 +3254,32 @@ var rn = /** @class */ function() {
  * 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 un(t, e) {
-    if (t = it(t, Je), tt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new x(V, "Invalid collection ID '" + e + "' passed to function collectionGroup(). Collection IDs must not contain '/'.");
-    return new on(t, 
+ */ function ln(t, e) {
+    if (t = at(t, tn), nt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new M(k, "Invalid collection ID '" + e + "' passed to function collectionGroup(). Collection IDs must not contain '/'.");
+    return new sn(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
  * within the provided collection group.
  */
     function(t) {
-        return new ie(X.emptyPath(), t);
+        return new ae(J.emptyPath(), t);
     }(e));
 }
 
-function cn(t, e) {
+function fn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
     if (t = h(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = dt.A()), tt("doc", "path", e), t instanceof Je) {
-        var o = X.fromString.apply(X, r([ e ], n));
-        return et(o), new rn(t, 
-        /* converter= */ null, new Z(o));
+    1 === arguments.length && (e = yt.P()), nt("doc", "path", e), t instanceof tn) {
+        var o = J.fromString.apply(J, r([ e ], n));
+        return rt(o), new an(t, 
+        /* converter= */ null, new et(o));
     }
-    if (!(t instanceof rn || t instanceof an)) throw new x(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-    var a = t._path.child(X.fromString.apply(X, r([ e ], n)));
-    return et(a), new rn(t.firestore, t instanceof an ? t.converter : null, new Z(a));
+    if (!(t instanceof an || t instanceof un)) throw new M(k, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    var a = t._path.child(J.fromString.apply(J, r([ e ], n)));
+    return rt(a), new an(t.firestore, t instanceof un ? t.converter : null, new et(a));
 }
 
 /**
@@ -3280,8 +3289,8 @@ function cn(t, e) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function fn(t, e) {
-    return t = h(t), e = h(e), (t instanceof rn || t instanceof an) && (e instanceof rn || e instanceof an) && t.firestore === e.firestore && t.path === e.path && t.converter === e.converter
+ */ function hn(t, e) {
+    return t = h(t), e = h(e), (t instanceof an || t instanceof un) && (e instanceof an || e instanceof un) && 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.
@@ -3293,18 +3302,18 @@ function cn(t, e) {
  */;
 }
 
-function ln(t, e) {
-    return t = h(t), e = h(e), t instanceof on && e instanceof on && t.firestore === e.firestore && function(t, e) {
+function pn(t, e) {
+    return t = h(t), e = h(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 (!ne(t.orderBy[n], e.orderBy[n])) return !1;
+            for (var n = 0; n < t.orderBy.length; n++) if (!ie(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 (i = t.filters[r], o = e.filters[r], 
-            i.op !== o.op || !i.field.isEqual(o.field) || !Nt(i.value, o.value)) return !1;
+            i.op !== o.op || !i.field.isEqual(o.field) || !qt(i.value, o.value)) return !1;
             var i, o;
-            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!re(t.startAt, e.startAt) && re(t.endAt, e.endAt);
-        }(fe(t), fe(e)) && t.limitType === e.limitType;
+            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!oe(t.startAt, e.startAt) && oe(t.endAt, e.endAt);
+        }(he(t), he(e)) && t.limitType === e.limitType;
     }(t._query, e._query) && t.converter === e.converter
     /**
  * @license
@@ -3332,7 +3341,7 @@ function ln(t, e) {
  */;
 }
 
-var hn = /** @class */ function() {
+var 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.
@@ -3341,8 +3350,8 @@ var hn = /** @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 x(V, "Invalid field name at argument $(i + 1). Field names must not be empty.");
-        this._internalPath = new J(t);
+        for (var n = 0; n < t.length; ++n) if (0 === t[n].length) throw new M(k, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        this._internalPath = new tt(t);
     }
     /**
      * Returns true if this `FieldPath` is equal to the provided one.
@@ -3357,8 +3366,8 @@ var hn = /** @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 pn() {
-    return new hn("__name__");
+ */ function mn() {
+    return new dn("__name__");
 }
 
 /**
@@ -3379,7 +3388,7 @@ var hn = /** @class */ function() {
  */
 /**
  * An immutable object representing an array of bytes.
- */ var dn = /** @class */ function() {
+ */ var yn = /** @class */ function() {
     /** @hideconstructor */
     function t(t) {
         this._byteString = t;
@@ -3391,9 +3400,9 @@ var hn = /** @class */ function() {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    return t.fromBase64String = function(e) {
         try {
-            return new t(St.fromBase64String(e));
+            return new t(Et.fromBase64String(e));
         } catch (e) {
-            throw new x(V, "Failed to construct data from Base64 string: " + e);
+            throw new M(k, "Failed to construct data from Base64 string: " + e);
         }
     }, 
     /**
@@ -3402,7 +3411,7 @@ var hn = /** @class */ function() {
      * @param array - The Uint8Array used to create the `Bytes` object.
      */
     t.fromUint8Array = function(e) {
-        return new t(St.fromUint8Array(e));
+        return new t(Et.fromUint8Array(e));
     }, 
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3437,14 +3446,14 @@ var hn = /** @class */ function() {
     t.prototype.isEqual = function(t) {
         return this._byteString.isEqual(t._byteString);
     }, t;
-}(), mn = 
+}(), vn = 
 /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
      */
 function(t) {
     this._methodName = t;
-}, yn = /** @class */ function() {
+}, gn = /** @class */ function() {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3452,8 +3461,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 x(V, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(e) || e < -180 || e > 180) throw new x(V, "Longitude must be a number between -180 and 180, but was: " + e);
+        if (!isFinite(t) || t < -90 || t > 90) throw new M(k, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(e) || e < -180 || e > 180) throw new M(k, "Longitude must be a number between -180 and 180, but was: " + e);
         this._lat = t, this._long = e;
     }
     return Object.defineProperty(t.prototype, "latitude", {
@@ -3495,23 +3504,23 @@ function(t) {
      * with an underscore.
      */
     t.prototype._compareTo = function(t) {
-        return mt(this._lat, t._lat) || mt(this._long, t._long);
+        return vt(this._lat, t._lat) || vt(this._long, t._long);
     }, t;
-}(), vn = /^__.*__$/, gn = /** @class */ function() {
+}(), wn = /^__.*__$/, bn = /** @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 _e(t, this.data, this.fieldMask, e, this.fieldTransforms) : new be(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new Se(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Te(t, this.data, e, this.fieldTransforms);
     }, t;
-}(), wn = /** @class */ function() {
+}(), _n = /** @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 _e(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new Se(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }, t;
 }();
 
@@ -3534,7 +3543,7 @@ function(t) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ function bn(t) {
+ */ function Tn(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3548,11 +3557,11 @@ function(t) {
         return !1;
 
       default:
-        throw S();
+        throw T();
     }
 }
 
-/** A "context" object passed around while parsing user data. */ var _n = /** @class */ function() {
+/** A "context" object passed around while parsing user data. */ var Sn = /** @class */ function() {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3572,7 +3581,7 @@ function(t) {
      * compromised).
      */
     function t(t, e, n, r, i, o) {
-        this.settings = t, this.databaseId = e, this.S = n, this.ignoreUndefinedProperties = r, 
+        this.settings = t, this.databaseId = e, this.q = n, this.ignoreUndefinedProperties = r, 
         // Minor hack: If fieldTransforms is undefined, we assume this is an
         // external call and we need to validate the entire path.
         void 0 === i && this.Z(), this.fieldTransforms = i || [], this.fieldMask = o || [];
@@ -3583,36 +3592,36 @@ function(t) {
         },
         enumerable: !1,
         configurable: !0
-    }), Object.defineProperty(t.prototype, "X", {
+    }), Object.defineProperty(t.prototype, "tt", {
         get: function() {
-            return this.settings.X;
+            return this.settings.tt;
         },
         enumerable: !1,
         configurable: !0
     }), 
-    /** Returns a new context with the specified settings overwritten. */ t.prototype.tt = function(e) {
-        return new t(Object.assign(Object.assign({}, this.settings), e), this.databaseId, this.S, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+    /** Returns a new context with the specified settings overwritten. */ t.prototype.nt = function(e) {
+        return new t(Object.assign(Object.assign({}, this.settings), e), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }, t.prototype.et = function(t) {
-        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.tt({
+        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.nt({
             path: n,
-            nt: !1
+            rt: !1
         });
-        return r.rt(t), r;
-    }, t.prototype.st = function(t) {
-        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.tt({
+        return r.st(t), r;
+    }, t.prototype.it = function(t) {
+        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.nt({
             path: n,
-            nt: !1
+            rt: !1
         });
         return r.Z(), r;
-    }, t.prototype.it = function(t) {
+    }, t.prototype.ot = function(t) {
         // TODO(b/34871131): We don't support array paths right now; so make path
         // undefined.
-        return this.tt({
+        return this.nt({
             path: void 0,
-            nt: !0
+            rt: !0
         });
-    }, t.prototype.ot = function(t) {
-        return Cn(t, this.settings.methodName, this.settings.ut || !1, this.path, this.settings.ct);
+    }, t.prototype.ut = function(t) {
+        return Gn(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
     }, 
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */ t.prototype.contains = function(t) {
         return void 0 !== this.fieldMask.find((function(e) {
@@ -3623,67 +3632,67 @@ function(t) {
     }, t.prototype.Z = function() {
         // TODO(b/34871131): Remove null check once we have proper paths for fields
         // within arrays.
-        if (this.path) for (var t = 0; t < this.path.length; t++) this.rt(this.path.get(t));
-    }, t.prototype.rt = function(t) {
-        if (0 === t.length) throw this.ot("Document fields must not be empty");
-        if (bn(this.X) && vn.test(t)) throw this.ot('Document fields cannot begin and end with "__"');
+        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.ut("Document fields must not be empty");
+        if (Tn(this.tt) && wn.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
     }, t;
-}(), Sn = /** @class */ function() {
+}(), En = /** @class */ function() {
     function t(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.S = n || Ge(t)
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.q = n || Qe(t)
         /** Creates a new top-level parse context. */;
     }
-    return t.prototype.at = function(t, e, n, r) {
-        return void 0 === r && (r = !1), new _n({
-            X: t,
+    return t.prototype.ht = function(t, e, n, r) {
+        return void 0 === r && (r = !1), new Sn({
+            tt: t,
             methodName: e,
-            ct: n,
-            path: J.emptyPath(),
-            nt: !1,
-            ut: r
-        }, this.databaseId, this.S, this.ignoreUndefinedProperties);
+            at: n,
+            path: tt.emptyPath(),
+            rt: !1,
+            ct: r
+        }, this.databaseId, this.q, this.ignoreUndefinedProperties);
     }, t;
 }();
 
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ function Tn(t) {
-    var e = t._freezeSettings(), n = Ge(t._databaseId);
-    return new Sn(t._databaseId, !!e.ignoreUndefinedProperties, n);
+ */ function In(t) {
+    var e = t._freezeSettings(), n = Qe(t._databaseId);
+    return new En(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function En(t, e, n, r, i, o) {
+/** Parse document data from a set() call. */ function An(t, e, n, r, i, o) {
     void 0 === o && (o = {});
-    var a = t.at(o.merge || o.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
-    Rn("Data must be an object, but it was:", a, r);
-    var s, u, c = jn(r, a);
-    if (o.merge) s = new _t(a.fieldMask), u = a.fieldTransforms; else if (o.mergeFields) {
-        for (var f = [], l = 0, h = o.mergeFields; l < h.length; l++) {
-            var p = Un(e, h[l], n);
-            if (!a.contains(p)) throw new x(V, "Field '" + p + "' is specified in your field mask but missing from your input data.");
-            Mn(f, p) || f.push(p);
+    var a = t.ht(o.merge || o.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
+    Mn("Data must be an object, but it was:", a, r);
+    var s, u, c = Ln(r, a);
+    if (o.merge) s = new St(a.fieldMask), u = a.fieldTransforms; else if (o.mergeFields) {
+        for (var l = [], f = 0, h = o.mergeFields; f < h.length; f++) {
+            var p = Un(e, h[f], n);
+            if (!a.contains(p)) throw new M(k, "Field '" + p + "' is specified in your field mask but missing from your input data.");
+            zn(l, p) || l.push(p);
         }
-        s = new _t(f), u = a.fieldTransforms.filter((function(t) {
+        s = new St(l), u = a.fieldTransforms.filter((function(t) {
             return s.covers(t.field);
         }));
     } else s = null, u = a.fieldTransforms;
-    return new gn(new Ct(c), s, u);
+    return new bn(new Gt(c), s, u);
 }
 
-var In = /** @class */ function(e) {
+var kn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        if (2 /* MergeSet */ !== t.X) throw 1 /* Update */ === t.X ? t.ot(this._methodName + "() can only appear at the top level of your update data") : t.ot(this._methodName + "() cannot be used with set() unless you pass {merge:true}");
+        if (2 /* MergeSet */ !== t.tt) throw 1 /* Update */ === t.tt ? t.ut(this._methodName + "() can only appear at the top level of your update data") : t.ut(this._methodName + "() cannot be used with set() unless you pass {merge:true}");
         // No transform to add for a delete, but we need to add it to our
         // fieldMask so it gets deleted.
                 return t.fieldMask.push(t.path), null;
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(mn);
+}(vn);
 
 /**
  * Creates a child context for parsing SerializableFieldValues.
@@ -3700,110 +3709,110 @@ var In = /** @class */ function(e) {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function An(t, e, n) {
-    return new _n({
-        X: 3 /* Argument */ ,
-        ct: e.settings.ct,
+ */ function Vn(t, e, n) {
+    return new Sn({
+        tt: 3 /* Argument */ ,
+        at: e.settings.at,
         methodName: t._methodName,
-        nt: n
-    }, e.databaseId, e.S, e.ignoreUndefinedProperties);
+        rt: n
+    }, e.databaseId, e.q, e.ignoreUndefinedProperties);
 }
 
-var Vn = /** @class */ function(e) {
+var Dn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        return new ve(t.path, new pe);
+        return new we(t.path, new me);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(mn), Dn = /** @class */ function(e) {
+}(vn), Pn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t) || this).ht = n, r;
+        return (r = e.call(this, t) || this).lt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = An(this, t, 
-        /*array=*/ !0), n = this.ht.map((function(t) {
-            return qn(t, e);
-        })), r = new de(n);
-        return new ve(t.path, r);
+        var e = Vn(this, t, 
+        /*array=*/ !0), n = this.lt.map((function(t) {
+            return jn(t, e);
+        })), r = new ye(n);
+        return new we(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(mn), kn = /** @class */ function(e) {
+}(vn), Fn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t) || this).ht = n, r;
+        return (r = e.call(this, t) || this).lt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = An(this, t, 
-        /*array=*/ !0), n = this.ht.map((function(t) {
-            return qn(t, e);
-        })), r = new me(n);
-        return new ve(t.path, r);
+        var e = Vn(this, t, 
+        /*array=*/ !0), n = this.lt.map((function(t) {
+            return jn(t, e);
+        })), r = new ve(n);
+        return new we(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(mn), Pn = /** @class */ function(e) {
+}(vn), Nn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t) || this).lt = n, r;
+        return (r = e.call(this, t) || this).ft = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = new ye(t.S, le(t.S, this.lt));
-        return new ve(t.path, e);
+        var e = new ge(t.q, pe(t.q, this.ft));
+        return new we(t.path, e);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(mn);
+}(vn);
 
-/** Parse update data from an update() call. */ function Nn(t, e, n, r) {
-    var i = t.at(1 /* Update */ , e, n);
-    Rn("Data must be an object, but it was:", i, r);
-    var o = [], a = Ct.empty();
-    bt(r, (function(t, r) {
+/** Parse update data from an update() call. */ function qn(t, e, n, r) {
+    var i = t.ht(1 /* Update */ , e, n);
+    Mn("Data must be an object, but it was:", i, r);
+    var o = [], a = Gt.empty();
+    Tt(r, (function(t, r) {
         var s = Bn(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = h(r);
-        var u = i.st(s);
-        if (r instanceof In) 
+        var u = i.it(s);
+        if (r instanceof kn) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(s); else {
-            var c = qn(r, u);
+            var c = jn(r, u);
             null != c && (o.push(s), a.set(s, c));
         }
     }));
-    var s = new _t(o);
-    return new wn(a, s, i.fieldTransforms);
+    var s = new St(o);
+    return new _n(a, s, i.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function Fn(t, e, n, r, i, o) {
-    var a = t.at(1 /* Update */ , e, n), s = [ Un(e, r, n) ], u = [ i ];
-    if (o.length % 2 != 0) throw new x(V, "Function " + e + "() needs to be called with an even number of arguments that alternate between field names and values.");
+/** Parse update data from a list of field/value arguments. */ function On(t, e, n, r, i, o) {
+    var a = t.ht(1 /* Update */ , e, n), s = [ Un(e, r, n) ], u = [ i ];
+    if (o.length % 2 != 0) throw new M(k, "Function " + 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) s.push(Un(e, o[c])), u.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 f = [], l = Ct.empty(), p = s.length - 1; p >= 0; --p) if (!Mn(f, s[p])) {
+    for (var l = [], f = Gt.empty(), p = s.length - 1; p >= 0; --p) if (!zn(l, s[p])) {
         var d = s[p], m = u[p];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
         m = h(m);
-        var y = a.st(d);
-        if (m instanceof In) 
+        var y = a.it(d);
+        if (m instanceof kn) 
         // Add it to the field mask, but don't add anything to updateData.
-        f.push(d); else {
-            var v = qn(m, y);
-            null != v && (f.push(d), l.set(d, v));
+        l.push(d); else {
+            var v = jn(m, y);
+            null != v && (l.push(d), f.set(d, v));
         }
     }
-    var g = new _t(f);
-    return new wn(l, g, a.fieldTransforms);
+    var g = new St(l);
+    return new _n(f, g, a.fieldTransforms);
 }
 
 /**
@@ -3812,8 +3821,8 @@ var Vn = /** @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 On(t, e, n, r) {
-    return void 0 === r && (r = !1), qn(n, t.at(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+ */ function Cn(t, e, n, r) {
+    return void 0 === r && (r = !1), jn(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -3824,12 +3833,12 @@ var Vn = /** @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 qn(t, e) {
-    if (Ln(
+ */ function jn(t, e) {
+    if (Rn(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = h(t))) return Rn("Unsupported field value:", e, t), jn(t, e);
-    if (t instanceof mn) 
+    t = h(t))) return Mn("Unsupported field value:", e, t), Ln(t, e);
+    if (t instanceof vn) 
     // FieldValues usually parse into transforms (except FieldValue.delete())
     // in which case we do not want to include this field in our parsed data
     // (as doing so will overwrite the field directly prior to the transform
@@ -3841,8 +3850,8 @@ var Vn = /** @class */ function(e) {
      */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!bn(e.X)) throw e.ot(t._methodName + "() can only be used with update() and set()");
-        if (!e.path) throw e.ot(t._methodName + "() is not currently supported inside arrays");
+        if (!Tn(e.tt)) throw e.ut(t._methodName + "() can only be used with update() and set()");
+        if (!e.path) throw e.ut(t._methodName + "() is not currently supported inside arrays");
         var n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
     }(t, e), null;
@@ -3861,10 +3870,10 @@ var Vn = /** @class */ function(e) {
         // the set of values to be included for the IN query) that may directly
         // contain additional arrays (each representing an individual field
         // value), so we disable this validation.
-        if (e.settings.nt && 4 /* ArrayArgument */ !== e.X) throw e.ot("Nested arrays are not supported");
+        if (e.settings.rt && 4 /* ArrayArgument */ !== e.tt) throw e.ut("Nested arrays are not supported");
         return function(t, e) {
             for (var n = [], r = 0, i = 0, o = t; i < o.length; i++) {
-                var a = qn(o[i], e.it(r));
+                var a = jn(o[i], e.ot(r));
                 null == a && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -3883,7 +3892,7 @@ var Vn = /** @class */ function(e) {
         if (null === (t = h(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return le(e.S, t);
+        if ("number" == typeof t) return pe(e.q, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -3891,41 +3900,41 @@ var Vn = /** @class */ function(e) {
             stringValue: t
         };
         if (t instanceof Date) {
-            var n = vt.fromDate(t);
+            var n = wt.fromDate(t);
             return {
-                timestampValue: Ve(e.S, n)
+                timestampValue: De(e.q, n)
             };
         }
-        if (t instanceof vt) {
+        if (t instanceof wt) {
             // 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 vt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            var r = new wt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Ve(e.S, r)
+                timestampValue: De(e.q, r)
             };
         }
-        if (t instanceof yn) return {
+        if (t instanceof gn) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof dn) return {
-            bytesValue: De(e.S, t._byteString)
+        if (t instanceof yn) return {
+            bytesValue: Pe(e.q, t._byteString)
         };
-        if (t instanceof rn) {
+        if (t instanceof an) {
             var i = e.databaseId, o = t.firestore._databaseId;
-            if (!o.isEqual(i)) throw e.ot("Document reference is for database " + o.projectId + "/" + o.database + " but should be for database " + i.projectId + "/" + i.database);
+            if (!o.isEqual(i)) throw e.ut("Document reference is for database " + o.projectId + "/" + o.database + " but should be for database " + i.projectId + "/" + i.database);
             return {
-                referenceValue: Ne(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: qe(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.ot("Unsupported field value: " + rt(t));
+        throw e.ut("Unsupported field value: " + ot(t));
     }(t, e);
 }
 
-function jn(t, e) {
+function Ln(t, e) {
     var n = {};
     return function(t) {
         for (var e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
@@ -3933,8 +3942,8 @@ function jn(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) : bt(t, (function(t, r) {
-        var i = qn(r, e.et(t));
+    e.path && e.path.length > 0 && e.fieldMask.push(e.path) : Tt(t, (function(t, r) {
+        var i = jn(r, e.et(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -3943,16 +3952,16 @@ function jn(t, e) {
     };
 }
 
-function Ln(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof vt || t instanceof yn || t instanceof dn || t instanceof rn || t instanceof mn);
+function Rn(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof wt || t instanceof gn || t instanceof yn || t instanceof an || t instanceof vn);
 }
 
-function Rn(t, e, n) {
-    if (!Ln(n) || !function(t) {
+function Mn(t, e, n) {
+    if (!Rn(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
-        var r = rt(n);
-        throw "an object" === r ? e.ot(t + " a custom object") : e.ot(t + " " + r);
+        var r = ot(n);
+        throw "an object" === r ? e.ut(t + " a custom object") : e.ut(t + " " + r);
     }
 }
 
@@ -3962,9 +3971,9 @@ function Rn(t, e, n) {
     if (
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    (e = h(e)) instanceof hn) return e._internalPath;
+    (e = h(e)) instanceof dn) return e._internalPath;
     if ("string" == typeof e) return Bn(t, e);
-    throw Cn("Field path arguments must be of type string or FieldPath.", t, 
+    throw Gn("Field path arguments must be of type string or FieldPath.", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
 }
@@ -3982,28 +3991,28 @@ function Rn(t, e, n) {
  * @param targetDoc - The document against which the field path will be
  * evaluated.
  */ function Bn(t, e, n) {
-    if (e.search(xn) >= 0) throw Cn("Invalid field path (" + e + "). Paths must not contain '~', '*', '/', '[', or ']'", t, 
+    if (e.search(xn) >= 0) throw Gn("Invalid field path (" + e + "). Paths must not contain '~', '*', '/', '[', or ']'", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return (new (hn.bind.apply(hn, r([ void 0 ], e.split(".")))))._internalPath;
+        return (new (dn.bind.apply(dn, r([ void 0 ], e.split(".")))))._internalPath;
     } catch (r) {
-        throw Cn("Invalid field path (" + e + "). Paths must not be empty, begin with '.', end with '.', or contain '..'", t, 
+        throw Gn("Invalid field path (" + e + "). Paths must not be empty, begin with '.', end with '.', or contain '..'", t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function Cn(t, e, n, r, i) {
+function Gn(t, e, n, r, i) {
     var o = r && !r.isEmpty(), a = void 0 !== i, s = "Function " + e + "() called with invalid data";
     n && (s += " (via `toFirestore()`)");
     var u = "";
     return (o || a) && (u += " (found", o && (u += " in field " + r), a && (u += " in document " + i), 
-    u += ")"), new x(V, (s += ". ") + t + u)
+    u += ")"), new M(k, (s += ". ") + t + u)
     /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */;
 }
 
-function Mn(t, e) {
+function zn(t, e) {
     return t.some((function(t) {
         return t.isEqual(e);
     }));
@@ -4033,7 +4042,7 @@ function Mn(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 Gn = /** @class */ function() {
+ */ var Qn = /** @class */ function() {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4054,7 +4063,7 @@ function Mn(t, e) {
          * The `DocumentReference` for the document included in the `DocumentSnapshot`.
          */
         get: function() {
-            return new rn(this._firestore, this._converter, this._key);
+            return new an(this._firestore, this._converter, this._key);
         },
         enumerable: !1,
         configurable: !0
@@ -4079,7 +4088,7 @@ function Mn(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 Qn(this._firestore, this._userDataWriter, this._key, this._document, 
+                var t = new Kn(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4099,11 +4108,11 @@ function Mn(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(Kn("DocumentSnapshot.get", t));
+            var e = this._document.data.field(Yn("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }, t;
-}(), Qn = /** @class */ function(e) {
+}(), Kn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4115,7 +4124,7 @@ function Mn(t, e) {
      */    return t(n, e), n.prototype.data = function() {
         return e.prototype.data.call(this);
     }, n;
-}(Gn), zn = /** @class */ function() {
+}(Qn), Hn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._docs = e, this.query = t;
@@ -4169,15 +4178,15 @@ function Mn(t, e) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */
-function Hn(t, e) {
-    return t = h(t), e = h(e), t instanceof Gn && e instanceof Gn ? 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 zn && e instanceof zn && ln(t.query, e.query) && yt(t.docs, e.docs, Hn)
+function Wn(t, e) {
+    return t = h(t), e = h(e), t instanceof Qn && e instanceof Qn ? 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 Hn && e instanceof Hn && pn(t.query, e.query) && gt(t.docs, e.docs, Wn)
     /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */;
 }
 
-function Kn(t, e) {
-    return "string" == typeof e ? Bn(t, e) : e instanceof hn ? e._internalPath : e._delegate._internalPath;
+function Yn(t, e) {
+    return "string" == typeof e ? Bn(t, e) : e instanceof dn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4203,7 +4212,7 @@ function Kn(t, e) {
  * endBefore:1}, {@link (endAt:1)}, {@link limit} or {@link limitToLast} and
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
- */ var Wn = function() {};
+ */ var $n = function() {};
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4213,7 +4222,7 @@ function Kn(t, e) {
  * @param queryConstraints - The list of {@link QueryConstraint}s to apply.
  * @throws if any of the provided query constraints cannot be combined with the
  * existing or new constraints.
- */ function Yn(t) {
+ */ function Xn(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
     for (var r = 0, i = e; r < i.length; r++) {
         var o = i[r];
@@ -4222,39 +4231,39 @@ function Kn(t, e) {
     return t;
 }
 
-var Xn = /** @class */ function(e) {
+var Jn = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).ft = t, i.dt = n, i.wt = r, i.type = "where", 
+        return (i = e.call(this) || this).dt = t, i.wt = n, i.yt = r, i.type = "where", 
         i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = Tn(t.firestore), n = function(t, e, n, r, i, o, a) {
+        var e = In(t.firestore), n = function(t, e, n, r, i, o, a) {
             var s;
             if (i.isKeyField()) {
-                if ("array-contains" /* ARRAY_CONTAINS */ === o || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === o) throw new x(V, "Invalid Query. You can't perform '" + o + "' queries on FieldPath.documentId().");
+                if ("array-contains" /* ARRAY_CONTAINS */ === o || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === o) throw new M(k, "Invalid Query. You can't perform '" + o + "' queries on FieldPath.documentId().");
                 if ("in" /* IN */ === o || "not-in" /* NOT_IN */ === o) {
-                    lr(a, o);
-                    for (var u = [], c = 0, f = a; c < f.length; c++) {
-                        var l = f[c];
-                        u.push(fr(r, t, l));
+                    pr(a, o);
+                    for (var u = [], c = 0, l = a; c < l.length; c++) {
+                        var f = l[c];
+                        u.push(hr(r, t, f));
                     }
                     s = {
                         arrayValue: {
                             values: u
                         }
                     };
-                } else s = fr(r, t, a);
-            } else "in" /* IN */ !== o && "not-in" /* NOT_IN */ !== o && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== o || lr(a, o), 
-            s = On(n, "where", a, 
+                } else s = hr(r, t, a);
+            } else "in" /* IN */ !== o && "not-in" /* NOT_IN */ !== o && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== o || pr(a, o), 
+            s = Cn(n, "where", a, 
             /* allowArrays= */ "in" /* IN */ === o || "not-in" /* NOT_IN */ === o);
-            var h = zt.create(i, o, s);
+            var h = Ht.create(i, o, s);
             return function(t, e) {
-                if (e.D()) {
-                    var n = se(t);
-                    if (null !== n && !n.isEqual(e.field)) throw new x(V, "Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '" + n.toString() + "' and '" + e.field.toString() + "'");
-                    var r = ae(t);
-                    null !== r && hr(t, e.field, r);
+                if (e.N()) {
+                    var n = ce(t);
+                    if (null !== n && !n.isEqual(e.field)) throw new M(k, "Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '" + n.toString() + "' and '" + e.field.toString() + "'");
+                    var r = ue(t);
+                    null !== r && dr(t, e.field, r);
                 }
                 var i = function(t, e) {
                     for (var n = 0, r = t.filters; n < r.length; n++) {
@@ -4298,15 +4307,15 @@ var Xn = /** @class */ function(e) {
                 }(e.op));
                 if (null !== i) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
-                throw i === e.op ? new x(V, "Invalid query. You cannot use more than one '" + e.op.toString() + "' filter.") : new x(V, "Invalid query. You cannot use '" + e.op.toString() + "' filters with '" + i.toString() + "' filters.");
+                throw i === e.op ? new M(k, "Invalid query. You cannot use more than one '" + e.op.toString() + "' filter.") : new M(k, "Invalid query. You cannot use '" + e.op.toString() + "' filters with '" + i.toString() + "' filters.");
             }(t, h), h;
-        }(t._query, 0, e, t.firestore._databaseId, this.ft, this.dt, this.wt);
-        return new on(t.firestore, t.converter, function(t, e) {
+        }(t._query, 0, e, t.firestore._databaseId, this.dt, this.wt, this.yt);
+        return new sn(t.firestore, t.converter, function(t, e) {
             var n = t.filters.concat([ e ]);
-            return new ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+            return new ae(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }, n;
-}(Wn);
+}($n);
 
 /**
  * Creates a {@link QueryConstraint} that enforces that documents must contain the
@@ -4318,36 +4327,36 @@ var Xn = /** @class */ function(e) {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function $n(t, e, n) {
-    var r = e, i = Kn("where", t);
-    return new Xn(i, r, n);
+ */ function Zn(t, e, n) {
+    var r = e, i = Yn("where", t);
+    return new Jn(i, r, n);
 }
 
-var Jn = /** @class */ function(e) {
+var tr = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this) || this).ft = t, r.yt = n, r.type = "orderBy", r;
+        return (r = e.call(this) || this).dt = t, r._t = n, r.type = "orderBy", r;
     }
     return t(n, e), n.prototype._apply = function(t) {
         var e = function(t, e, n) {
-            if (null !== t.startAt) throw new x(V, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
-            if (null !== t.endAt) throw new x(V, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            var r = new ee(e, n);
+            if (null !== t.startAt) throw new M(k, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new M(k, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            var r = new re(e, n);
             return function(t, e) {
-                if (null === ae(t)) {
+                if (null === ue(t)) {
                     // This is the first order by. It must match any inequality.
-                    var n = se(t);
-                    null !== n && hr(t, n, e.field);
+                    var n = ce(t);
+                    null !== n && dr(t, n, e.field);
                 }
             }(t, r), r;
-        }(t._query, this.ft, this.yt);
-        return new on(t.firestore, t.converter, function(t, e) {
+        }(t._query, this.dt, this._t);
+        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 ie(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new ae(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }, n;
-}(Wn);
+}($n);
 
 /**
  * Creates a {@link QueryConstraint} that sorts the query result by the
@@ -4357,31 +4366,31 @@ var Jn = /** @class */ function(e) {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function Zn(t, e) {
+ */ function er(t, e) {
     void 0 === e && (e = "asc");
-    var n = e, r = Kn("orderBy", t);
-    return new Jn(r, n);
+    var n = e, r = Yn("orderBy", t);
+    return new tr(r, n);
 }
 
-var tr = /** @class */ function(e) {
+var nr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i._t = n, i.gt = r, i;
+        return (i = e.call(this) || this).type = t, i.gt = n, i.bt = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        return new on(t.firestore, t.converter, function(t, e, n) {
-            return new ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
-        }(t._query, this._t, this.gt));
+        return new sn(t.firestore, t.converter, function(t, e, n) {
+            return new ae(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        }(t._query, this.gt, this.bt));
     }, n;
-}(Wn);
+}($n);
 
 /**
  * Creates a {@link QueryConstraint} that only returns the first matching documents.
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function er(t) {
-    return ot("limit", t), new tr("limit", t, "F" /* First */)
+ */ function rr(t) {
+    return st("limit", t), new nr("limit", t, "F" /* First */)
     /**
  * Creates a {@link QueryConstraint} that only returns the last matching documents.
  *
@@ -4393,60 +4402,60 @@ var tr = /** @class */ function(e) {
  */;
 }
 
-function nr(t) {
-    return ot("limitToLast", t), new tr("limitToLast", t, "L" /* Last */);
+function ir(t) {
+    return st("limitToLast", t), new nr("limitToLast", t, "L" /* Last */);
 }
 
-var rr = /** @class */ function(e) {
+var or = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.bt = n, i.vt = r, i;
+        return (i = e.call(this) || this).type = t, i.vt = n, i.Et = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = cr(t, this.type, this.bt, this.vt);
-        return new on(t.firestore, t.converter, function(t, e) {
-            return new ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+        var e = fr(t, this.type, this.vt, this.Et);
+        return new sn(t.firestore, t.converter, function(t, e) {
+            return new ae(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }, n;
-}(Wn);
+}($n);
 
-function ir() {
+function ar() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new rr("startAt", t, /*before=*/ !0);
+    return new or("startAt", t, /*before=*/ !0);
 }
 
-function or() {
+function sr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new rr("startAfter", t, 
+    return new or("startAfter", t, 
     /*before=*/ !1);
 }
 
-var ar = /** @class */ function(e) {
+var ur = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.bt = n, i.vt = r, i;
+        return (i = e.call(this) || this).type = t, i.vt = n, i.Et = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = cr(t, this.type, this.bt, this.vt);
-        return new on(t.firestore, t.converter, function(t, e) {
-            return new ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+        var e = fr(t, this.type, this.vt, this.Et);
+        return new sn(t.firestore, t.converter, function(t, e) {
+            return new ae(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }, n;
-}(Wn);
+}($n);
 
-function sr() {
+function cr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new ar("endBefore", t, /*before=*/ !0);
+    return new ur("endBefore", t, /*before=*/ !0);
 }
 
-function ur() {
+function lr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new ar("endAt", t, /*before=*/ !1);
+    return new ur("endAt", t, /*before=*/ !1);
 }
 
-/** Helper function to create a bound from a document or fields */ function cr(t, e, n, r) {
-    if (n[0] = h(n[0]), n[0] instanceof Gn) return function(t, e, n, r, i) {
-        if (!r) throw new x(k, "Can't use a DocumentSnapshot that doesn't exist for " + n + "().");
+/** Helper function to create a bound from a document or fields */ function fr(t, e, n, r) {
+    if (n[0] = h(n[0]), n[0] instanceof Qn) return function(t, e, n, r, i) {
+        if (!r) throw new M(D, "Can't use a DocumentSnapshot that doesn't exist for " + 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
@@ -4454,65 +4463,65 @@ function ur() {
         // 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, s = ce(t); a < s.length; a++) {
+        for (var o = [], a = 0, s = fe(t); a < s.length; a++) {
             var u = s[a];
-            if (u.field.isKeyField()) o.push(jt(e, r.key)); else {
+            if (u.field.isKeyField()) o.push(Lt(e, r.key)); else {
                 var c = r.data.field(u.field);
-                if (Vt(c)) throw new x(V, 'Invalid query. You are trying to start or end a query using a document for which the field "' + u.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+                if (Dt(c)) throw new M(k, 'Invalid query. You are trying to start or end a query using a document for which the field "' + u.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 f = u.field.canonicalString();
-                    throw new x(V, "Invalid query. You are trying to start or end a query using a document for which the field '" + f + "' (used as the orderBy) does not exist.");
+                    var l = u.field.canonicalString();
+                    throw new M(k, "Invalid query. You are trying to start or end a query using a document for which the field '" + l + "' (used as the orderBy) does not exist.");
                 }
                 o.push(c);
             }
         }
-        return new te(o, i);
+        return new ne(o, i);
     }(t._query, t.firestore._databaseId, e, n[0]._document, r);
-    var i = Tn(t.firestore);
+    var i = In(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 x(V, "Too many arguments provided to " + r + "(). The number of arguments must be less than or equal to the number of orderBy() clauses");
+        if (i.length > a.length) throw new M(k, "Too many arguments provided to " + r + "(). The number of arguments must be less than or equal to the number of orderBy() clauses");
         for (var s = [], u = 0; u < i.length; u++) {
             var c = i[u];
             if (a[u].field.isKeyField()) {
-                if ("string" != typeof c) throw new x(V, "Invalid query. Expected a string for document ID in " + r + "(), but got a " + typeof c);
-                if (!ue(t) && -1 !== c.indexOf("/")) throw new x(V, "Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to " + r + "() must be a plain document ID, but '" + c + "' contains a slash.");
-                var f = t.path.child(X.fromString(c));
-                if (!Z.isDocumentKey(f)) throw new x(V, "Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to " + r + "() must result in a valid document path, but '" + f + "' is not because it contains an odd number of segments.");
-                var l = new Z(f);
-                s.push(jt(e, l));
+                if ("string" != typeof c) throw new M(k, "Invalid query. Expected a string for document ID in " + r + "(), but got a " + typeof c);
+                if (!le(t) && -1 !== c.indexOf("/")) throw new M(k, "Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to " + r + "() must be a plain document ID, but '" + c + "' contains a slash.");
+                var l = t.path.child(J.fromString(c));
+                if (!et.isDocumentKey(l)) throw new M(k, "Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to " + r + "() must result in a valid document path, but '" + l + "' is not because it contains an odd number of segments.");
+                var f = new et(l);
+                s.push(Lt(e, f));
             } else {
-                var h = On(n, r, c);
+                var h = Cn(n, r, c);
                 s.push(h);
             }
         }
-        return new te(s, o);
+        return new ne(s, o);
     }(t._query, t.firestore._databaseId, i, e, n, r);
 }
 
-function fr(t, e, n) {
+function hr(t, e, n) {
     if ("string" == typeof (n = h(n))) {
-        if ("" === n) throw new x(V, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!ue(e) && -1 !== n.indexOf("/")) throw new x(V, "Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '" + n + "' contains a '/' character.");
-        var r = e.path.child(X.fromString(n));
-        if (!Z.isDocumentKey(r)) throw new x(V, "Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '" + r + "' is not because it has an odd number of segments (" + r.length + ").");
-        return jt(t, new Z(r));
+        if ("" === n) throw new M(k, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!le(e) && -1 !== n.indexOf("/")) throw new M(k, "Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '" + n + "' contains a '/' character.");
+        var r = e.path.child(J.fromString(n));
+        if (!et.isDocumentKey(r)) throw new M(k, "Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '" + r + "' is not because it has an odd number of segments (" + r.length + ").");
+        return Lt(t, new et(r));
     }
-    if (n instanceof rn) return jt(t, n._key);
-    throw new x(V, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: " + rt(n) + ".");
+    if (n instanceof an) return Lt(t, n._key);
+    throw new M(k, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: " + ot(n) + ".");
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function lr(t, e) {
-    if (!Array.isArray(t) || 0 === t.length) throw new x(V, "Invalid Query. A non-empty array is required for '" + e.toString() + "' filters.");
-    if (t.length > 10) throw new x(V, "Invalid Query. '" + e.toString() + "' filters support a maximum of 10 elements in the value array.");
+ */ function pr(t, e) {
+    if (!Array.isArray(t) || 0 === t.length) throw new M(k, "Invalid Query. A non-empty array is required for '" + e.toString() + "' filters.");
+    if (t.length > 10) throw new M(k, "Invalid Query. '" + e.toString() + "' filters support a maximum of 10 elements in the value array.");
 }
 
-function hr(t, e, n) {
-    if (!n.isEqual(e)) throw new x(V, "Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '" + e.toString() + "' and so you must also use '" + e.toString() + "' as your first argument to orderBy(), but your first orderBy() is on field '" + n.toString() + "' instead.");
+function dr(t, e, n) {
+    if (!n.isEqual(e)) throw new M(k, "Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '" + e.toString() + "' and so you must also use '" + e.toString() + "' as your first argument to orderBy(), but your first orderBy() is on field '" + n.toString() + "' instead.");
 }
 
 /**
@@ -4561,28 +4570,28 @@ function hr(t, e, n) {
  * because we want to provide the user with a more specific error message if
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
- */ function pr(t, e, n) {
+ */ function mr(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 dr = /** @class */ function(e) {
+var yr = /** @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 yn(t);
     }, n.prototype.convertReference = function(t) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new rn(this.firestore, /* converter= */ null, e);
+        return new an(this.firestore, /* converter= */ null, e);
     }, n;
 }(/** @class */ function() {
     function t() {}
     return t.prototype.convertValue = function(t, e) {
-        switch (void 0 === e && (e = "none"), Pt(t)) {
+        switch (void 0 === e && (e = "none"), Nt(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -4590,7 +4599,7 @@ var dr = /** @class */ function(e) {
             return t.booleanValue;
 
           case 2 /* NumberValue */ :
-            return It(t.integerValue || t.doubleValue);
+            return kt(t.integerValue || t.doubleValue);
 
           case 3 /* TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -4602,7 +4611,7 @@ var dr = /** @class */ function(e) {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(At(t.bytesValue));
+            return this.convertBytes(Vt(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -4617,15 +4626,15 @@ var dr = /** @class */ function(e) {
             return this.convertObject(t.mapValue, e);
 
           default:
-            throw S();
+            throw T();
         }
     }, t.prototype.convertObject = function(t, e) {
         var n = this, r = {};
-        return bt(t.fields, (function(t, i) {
+        return Tt(t.fields, (function(t, i) {
             r[t] = n.convertValue(i, e);
         })), r;
     }, t.prototype.convertGeoPoint = function(t) {
-        return new yn(It(t.latitude), It(t.longitude));
+        return new gn(kt(t.latitude), kt(t.longitude));
     }, t.prototype.convertArray = function(t, e) {
         var n = this;
         return (t.values || []).map((function(t) {
@@ -4634,22 +4643,22 @@ var dr = /** @class */ function(e) {
     }, t.prototype.convertServerTimestamp = function(t, e) {
         switch (e) {
           case "previous":
-            var n = Dt(t);
+            var n = Pt(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(kt(t));
+            return this.convertTimestamp(Ft(t));
 
           default:
             return null;
         }
     }, t.prototype.convertTimestamp = function(t) {
-        var e = Et(t);
-        return new vt(e.seconds, e.nanos);
+        var e = At(t);
+        return new wt(e.seconds, e.nanos);
     }, t.prototype.convertDocumentKey = function(t, e) {
-        var n = X.fromString(t);
-        T(Me(n));
-        var r = new W(n.get(1), n.get(3)), i = new Z(n.popFirst(5));
+        var n = J.fromString(t);
+        S(ze(n));
+        var r = new $(n.get(1), n.get(3)), i = new et(n.popFirst(5));
         return r.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
         w("Document " + i + " contains a document reference within a different database (" + r.projectId + "/" + r.database + ") which is not supported. It will be treated as a reference in the current database (" + e.projectId + "/" + e.database + ") instead."), 
@@ -4669,12 +4678,12 @@ var dr = /** @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 mr(t) {
-    var e = Xe((t = it(t, rn)).firestore), n = new dr(t.firestore);
-    return Ke(e, [ t._key ]).then((function(e) {
-        T(1 === e.length);
+ */ function vr(t) {
+    var e = Je((t = at(t, an)).firestore), n = new yr(t.firestore);
+    return Ye(e, [ t._key ]).then((function(e) {
+        S(1 === e.length);
         var r = e[0];
-        return new Gn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new Qn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -4689,35 +4698,35 @@ var dr = /** @class */ function(e) {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function yr(t) {
+ */ function gr(t) {
     !function(t) {
-        if (oe(t) && 0 === t.explicitOrderBy.length) throw new x(L, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = it(t, on))._query);
-    var e = Xe(t.firestore), n = new dr(t.firestore);
-    return We(e, t._query).then((function(e) {
+        if (se(t) && 0 === t.explicitOrderBy.length) throw new M(j, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = at(t, sn))._query);
+    var e = Je(t.firestore), n = new yr(t.firestore);
+    return $e(e, t._query).then((function(e) {
         var r = e.map((function(e) {
-            return new Qn(t.firestore, n, e.key, e, t.converter);
+            return new Kn(t.firestore, n, e.key, e, t.converter);
         }));
-        return oe(t._query) && 
+        return se(t._query) && 
         // Limit to last queries reverse the orderBy constraint that was
         // specified by the user. As such, we need to reverse the order of the
         // results to return the documents in the expected order.
-        r.reverse(), new zn(t, r);
+        r.reverse(), new Hn(t, r);
     }));
 }
 
-function vr(t, e, n) {
-    var r = pr((t = it(t, rn)).converter, e, n), i = En(Tn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return He(Xe(t.firestore), [ i.toMutation(t._key, ge.none()) ]);
+function wr(t, e, n) {
+    var r = mr((t = at(t, an)).converter, e, n), i = An(In(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return We(Je(t.firestore), [ i.toMutation(t._key, be.none()) ]);
 }
 
-function gr(t, e, n) {
+function br(t, e, n) {
     for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-    var o, a = Tn((t = it(t, rn)).firestore);
+    var o, a = In((t = at(t, an)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-        return o = "string" == typeof (e = h(e)) || e instanceof hn ? Fn(a, "updateDoc", t._key, e, n, r) : Nn(a, "updateDoc", t._key, e), 
-    He(Xe(t.firestore), [ o.toMutation(t._key, ge.exists(!0)) ]);
+        return o = "string" == typeof (e = h(e)) || e instanceof dn ? On(a, "updateDoc", t._key, e, n, r) : qn(a, "updateDoc", t._key, e), 
+    We(Je(t.firestore), [ o.toMutation(t._key, be.exists(!0)) ]);
 }
 
 /**
@@ -4731,8 +4740,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 wr(t) {
-    return He(Xe((t = it(t, rn)).firestore), [ new Se(t._key, ge.none()) ]);
+ */ function _r(t) {
+    return We(Je((t = at(t, an)).firestore), [ new Ee(t._key, be.none()) ]);
 }
 
 /**
@@ -4748,9 +4757,9 @@ function gr(t, e, n) {
  * @param data - An Object containing the data for the new document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function br(t, e) {
-    var n = cn(t = it(t, an)), r = pr(t.converter, e), i = En(Tn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return He(Xe(t.firestore), [ i.toMutation(n._key, ge.exists(!1)) ]).then((function() {
+ */ function Tr(t, e) {
+    var n = fn(t = at(t, un)), r = mr(t.converter, e), i = An(In(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return We(Je(t.firestore), [ i.toMutation(n._key, be.exists(!1)) ]).then((function() {
         return n;
     }));
 }
@@ -4774,15 +4783,15 @@ function gr(t, e, n) {
 /**
  * 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 _r() {
-    return new In("deleteField");
+ */ function Sr() {
+    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 Sr() {
-    return new Vn("serverTimestamp");
+ */ function Er() {
+    return new Dn("serverTimestamp");
 }
 
 /**
@@ -4796,11 +4805,11 @@ function gr(t, e, n) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function Tr() {
+ */ function Ir() {
     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 Dn("arrayUnion", t);
+        return new Pn("arrayUnion", t);
 }
 
 /**
@@ -4813,11 +4822,11 @@ function gr(t, e, n) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Er() {
+ */ function Ar() {
     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 kn("arrayRemove", t);
+        return new Fn("arrayRemove", t);
 }
 
 /**
@@ -4838,8 +4847,8 @@ function gr(t, e, n) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Ir(t) {
-    return new Pn("increment", t);
+ */ function kr(t) {
+    return new Nn("increment", t);
 }
 
 /**
@@ -4865,24 +4874,24 @@ function gr(t, e, n) {
  * 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 Ar = /** @class */ function() {
+ */ var Vr = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = Tn(t);
+        this._dataReader = In(t);
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = Vr(t, this._firestore), i = pr(r.converter, e, n), o = En(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
-        return this._mutations.push(o.toMutation(r._key, ge.none())), this;
+        var r = Dr(t, this._firestore), i = mr(r.converter, e, n), o = An(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
+        return this._mutations.push(o.toMutation(r._key, be.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 = Vr(t, this._firestore);
+        var o, a = Dr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = h(e)) || e instanceof hn ? Fn(this._dataReader, "WriteBatch.update", a._key, e, n, r) : Nn(this._dataReader, "WriteBatch.update", a._key, e), 
-        this._mutations.push(o.toMutation(a._key, ge.exists(!0))), this;
+                return o = "string" == typeof (e = h(e)) || e instanceof dn ? On(this._dataReader, "WriteBatch.update", a._key, e, n, r) : qn(this._dataReader, "WriteBatch.update", a._key, e), 
+        this._mutations.push(o.toMutation(a._key, be.exists(!0))), this;
     }, 
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -4892,8 +4901,8 @@ function gr(t, e, n) {
      */
     t.prototype.delete = function(t) {
         this._verifyNotCommitted();
-        var e = Vr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Se(e._key, ge.none())), this;
+        var e = Dr(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Ee(e._key, be.none())), this;
     }, 
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -4910,12 +4919,12 @@ function gr(t, e, n) {
     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 x(O, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new M(q, "A write batch can no longer be used after commit() has been called.");
     }, t;
 }();
 
-function Vr(t, e) {
-    if ((t = h(t)).firestore !== e) throw new x(V, "Provided document reference is from a different Firestore instance.");
+function Dr(t, e) {
+    if ((t = h(t)).firestore !== e) throw new M(k, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -4931,10 +4940,10 @@ function Vr(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Dr(t) {
-    var e = Xe(t = it(t, Je));
-    return new Ar(t, (function(t) {
-        return He(e, t);
+ */ function Pr(t) {
+    var e = Je(t = at(t, tn));
+    return new Vr(t, (function(t) {
+        return We(e, t);
     }));
 }
 
@@ -4957,7 +4966,7 @@ function Vr(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ var kr = /** @class */ function() {
+ */ var Fr = /** @class */ function() {
     function t(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -4981,8 +4990,8 @@ function Vr(t, e) {
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new x(V, "Firestore transactions require all reads to be executed before all writes.");
-                    return [ 4 /*yield*/ , Ke(this.datastore, t) ];
+                    if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new M(k, "Firestore transactions require all reads to be executed before all writes.");
+                    return [ 4 /*yield*/ , Ye(this.datastore, t) ];
 
                   case 1:
                     return [ 2 /*return*/ , ((e = n.sent()).forEach((function(t) {
@@ -5001,7 +5010,7 @@ function Vr(t, e) {
         }
         this.writtenDocs.add(t.toString());
     }, t.prototype.delete = function(t) {
-        this.write(new Se(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Ee(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;
@@ -5017,9 +5026,9 @@ function Vr(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 = Z.fromPath(n);
-                        e.mutations.push(new Te(r, e.precondition(r)));
-                    })), [ 4 /*yield*/ , He(this.datastore, this.mutations) ];
+                        var r = et.fromPath(n);
+                        e.mutations.push(new Ie(r, e.precondition(r)));
+                    })), [ 4 /*yield*/ , We(this.datastore, this.mutations) ];
 
                   case 1:
                     // For each mutation, note that the doc was written.
@@ -5030,15 +5039,15 @@ function Vr(t, e) {
     }, t.prototype.recordVersion = function(t) {
         var e;
         if (t.isFoundDocument()) e = t.version; else {
-            if (!t.isNoDocument()) throw S();
+            if (!t.isNoDocument()) throw T();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
-                        e = gt.min();
+                        e = bt.min();
         }
         var n = this.readVersions.get(t.key.toString());
         if (n) {
             if (!e.isEqual(n)) 
             // This transaction will fail no matter what.
-            throw new x(q, "Document version changed between two reads.");
+            throw new M(O, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }, 
     /**
@@ -5047,7 +5056,7 @@ function Vr(t, e) {
      */
     t.prototype.precondition = function(t) {
         var e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? ge.updateTime(e) : ge.none();
+        return !this.writtenDocs.has(t.toString()) && e ? be.updateTime(e) : be.none();
     }, 
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5057,7 +5066,7 @@ function Vr(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(gt.min())) 
+            if (e.isEqual(bt.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
@@ -5067,59 +5076,59 @@ function Vr(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 x(V, "Can't update a document that doesn't exist.");
+            throw new M(k, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return ge.updateTime(e);
+                        return be.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-                return ge.exists(!0);
+                return be.exists(!0);
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), Pr = /** @class */ function() {
+}(), Nr = /** @class */ function() {
     function t(t, e, n, r) {
         this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = r, 
-        this.Et = 5, this.Tt = new Qe(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
+        this.Tt = 5, this.It = new Ke(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.run = function() {
-        this.Et -= 1, this.It();
-    }, t.prototype.It = function() {
+        this.Tt -= 1, this.At();
+    }, t.prototype.At = function() {
         var t = this;
-        this.Tt.G((function() {
+        this.It.W((function() {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new kr(this.datastore), (e = this.At(t)) && e.then((function(e) {
+                    return t = new Fr(this.datastore), (e = this.Pt(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
                             })).catch((function(t) {
-                                r.Pt(t);
+                                r.Rt(t);
                             }));
                         }));
                     })).catch((function(t) {
-                        r.Pt(t);
+                        r.Rt(t);
                     })), [ 2 /*return*/ ];
                 }));
             }));
         }));
-    }, t.prototype.At = function(t) {
+    }, t.prototype.Pt = function(t) {
         try {
             var e = this.updateFunction(t);
-            return !at(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !ut(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.
             return this.deferred.reject(t), null;
         }
-    }, t.prototype.Pt = function(t) {
+    }, t.prototype.Rt = function(t) {
         var e = this;
-        this.Et > 0 && this.Rt(t) ? (this.Et -= 1, this.asyncQueue.enqueueAndForget((function() {
-            return e.It(), Promise.resolve();
+        this.Tt > 0 && this.Vt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((function() {
+            return e.At(), Promise.resolve();
         }))) : this.deferred.reject(t);
-    }, t.prototype.Rt = function(t) {
+    }, t.prototype.Vt = function(t) {
         if ("FirebaseError" === t.name) {
             // In transactions, the backend will fail outdated reads with FAILED_PRECONDITION and
             // non-matching document versions with ABORTED. These errors should be retried.
@@ -5134,30 +5143,30 @@ function Vr(t, e) {
             function(t) {
                 switch (t) {
                   default:
-                    return S();
+                    return T();
 
                   case I:
                   case A:
-                  case D:
-                  case F:
+                  case V:
+                  case N:
+                  case L:
                   case R:
-                  case U:
  // Unauthenticated means something went wrong with our token and we need
                     // to retry with new credentials which will happen automatically.
-                                      case N:
+                                      case F:
                     return !1;
 
-                  case V:
                   case k:
+                  case D:
                   case "already-exists":
                   case P:
-                  case O:
+                  case q:
  // 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 q:
+                                      case O:
+                  case C:
                   case j:
-                  case L:
                   case "data-loss":
                     return !0;
                 }
@@ -5203,7 +5212,7 @@ function Vr(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 Nr() {
+/** The Platform's 'document' implementation or null if not available. */ function qr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5235,10 +5244,10 @@ function Vr(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 Fr = /** @class */ function() {
+ */ var Or = /** @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 B, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
+        this.deferred = new U, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
         // It's normal for the deferred promise to be canceled (due to cancellation)
         // and so we attach a dummy catch callback to avoid
         // 'UnhandledPromiseRejectionWarning' log spam.
@@ -5287,7 +5296,7 @@ function Vr(t, e) {
      * guarantee that the operation will not be run.
      */
     t.prototype.cancel = function(t) {
-        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new x(I, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new M(I, "Operation cancelled" + (t ? ": " + t : ""))));
     }, t.prototype.handleDelayElapsed = function() {
         var t = this;
         this.asyncQueue.enqueueAndForget((function() {
@@ -5299,44 +5308,44 @@ function Vr(t, e) {
         null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle), 
         this.timerHandle = null);
     }, t;
-}(), Or = /** @class */ function() {
+}(), Cr = /** @class */ function() {
     function t() {
         var t = this;
         // The last promise in the queue.
-                this.Vt = Promise.resolve(), 
+                this.Dt = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.Dt = [], 
+        this.Nt = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.Nt = !1, 
+        this.$t = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.$t = [], 
+        this.Ft = [], 
         // visible for testing
-        this.Ft = null, 
+        this.St = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.St = !1, 
-        // Enabled during shutdown on Safari to prevent future access to IndexedDB.
         this.qt = !1, 
+        // Enabled during shutdown on Safari to prevent future access to IndexedDB.
+        this.xt = !1, 
         // List of TimerIds to fast-forward delays for.
-        this.xt = [], 
+        this.Ot = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.Tt = new Qe(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new Ke(this, "async_queue_retry" /* AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
-        this.Ot = function() {
-            var e = Nr();
-            e && g("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.Tt.H();
+        this.Ct = function() {
+            var e = qr();
+            e && g("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.It.H();
         };
-        var e = Nr();
-        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Ot);
+        var e = qr();
+        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Ct);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
         get: function() {
-            return this.Nt;
+            return this.$t;
         },
         enumerable: !1,
         configurable: !0
@@ -5349,53 +5358,53 @@ function Vr(t, e) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
         this.enqueue(t);
     }, t.prototype.enqueueAndForgetEvenWhileRestricted = function(t) {
-        this.Ct(), 
+        this.Lt(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.Lt(t);
+        this.Ut(t);
     }, t.prototype.enterRestrictedMode = function(t) {
-        if (!this.Nt) {
-            this.Nt = !0, this.qt = t || !1;
-            var e = Nr();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ot);
+        if (!this.$t) {
+            this.$t = !0, this.xt = t || !1;
+            var e = qr();
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ct);
         }
     }, t.prototype.enqueue = function(t) {
         var e = this;
-        if (this.Ct(), this.Nt) 
+        if (this.Lt(), this.$t) 
         // Return a Promise which never resolves.
         return new Promise((function() {}));
         // 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 B;
-        return this.Lt((function() {
-            return e.Nt && e.qt ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
+                var n = new U;
+        return this.Ut((function() {
+            return e.$t && e.xt ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
         })).then((function() {
             return n.promise;
         }));
     }, t.prototype.enqueueRetryable = function(t) {
         var e = this;
         this.enqueueAndForget((function() {
-            return e.Dt.push(t), e.Ut();
+            return e.Nt.push(t), e.kt();
         }));
     }, 
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
      */
-    t.prototype.Ut = function() {
+    t.prototype.kt = function() {
         return e(this, void 0, void 0, (function() {
             var t, e = this;
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    if (0 === this.Dt.length) return [ 3 /*break*/ , 5 ];
+                    if (0 === this.Nt.length) return [ 3 /*break*/ , 5 ];
                     n.label = 1;
 
                   case 1:
-                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.Dt[0]() ];
+                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.Nt[0]() ];
 
                   case 2:
-                    return n.sent(), this.Dt.shift(), this.Tt.reset(), [ 3 /*break*/ , 4 ];
+                    return n.sent(), this.Nt.shift(), this.It.reset(), [ 3 /*break*/ , 4 ];
 
                   case 3:
                     if (t = n.sent(), "IndexedDbTransactionError" !== t.name) throw t;
@@ -5404,7 +5413,7 @@ function Vr(t, e) {
                     [ 3 /*break*/ , 4 ];
 
                   case 4:
-                    this.Dt.length > 0 && 
+                    this.Nt.length > 0 && 
                     // If there are additional operations, we re-schedule `retryNextOp()`.
                     // This is necessary to run retryable operations that failed during
                     // their initial attempt since we don't know whether they are already
@@ -5415,8 +5424,8 @@ function Vr(t, e) {
                     // Since `backoffAndRun()` cancels an existing backoff and schedules a
                     // new backoff on every call, there is only ever a single additional
                     // operation in the queue.
-                    this.Tt.G((function() {
-                        return e.Ut();
+                    this.It.W((function() {
+                        return e.kt();
                     })), n.label = 5;
 
                   case 5:
@@ -5424,10 +5433,10 @@ function Vr(t, e) {
                 }
             }));
         }));
-    }, t.prototype.Lt = function(t) {
-        var e = this, n = this.Vt.then((function() {
-            return e.St = !0, t().catch((function(t) {
-                e.Ft = t, e.St = !1;
+    }, t.prototype.Ut = function(t) {
+        var e = this, n = this.Dt.then((function() {
+            return e.qt = !0, t().catch((function(t) {
+                e.St = t, e.qt = !1;
                 var n = 
                 /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -5444,39 +5453,39 @@ function Vr(t, e) {
                 // and return the rejected Promise.
                                 throw w("INTERNAL UNHANDLED ERROR: ", n), t;
             })).then((function(t) {
-                return e.St = !1, t;
+                return e.qt = !1, t;
             }));
         }));
-        return this.Vt = n, n;
+        return this.Dt = n, n;
     }, t.prototype.enqueueAfterDelay = function(t, e, n) {
         var r = this;
-        this.Ct(), 
+        this.Lt(), 
         // Fast-forward delays for timerIds that have been overriden.
-        this.xt.indexOf(t) > -1 && (e = 0);
-        var i = Fr.createAndSchedule(this, t, e, n, (function(t) {
+        this.Ot.indexOf(t) > -1 && (e = 0);
+        var i = Or.createAndSchedule(this, t, e, n, (function(t) {
             return r.jt(t);
         }));
-        return this.$t.push(i), i;
-    }, t.prototype.Ct = function() {
-        this.Ft && S();
+        return this.Ft.push(i), i;
+    }, t.prototype.Lt = function() {
+        this.St && T();
     }, t.prototype.verifyOperationInProgress = function() {}, 
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
      */
-    t.prototype.kt = function() {
+    t.prototype.Mt = function() {
         return e(this, void 0, void 0, (function() {
             var t;
             return n(this, (function(e) {
                 switch (e.label) {
                   case 0:
-                    return [ 4 /*yield*/ , t = this.Vt ];
+                    return [ 4 /*yield*/ , t = this.Dt ];
 
                   case 1:
                     e.sent(), e.label = 2;
 
                   case 2:
-                    if (t !== this.Vt) return [ 3 /*break*/ , 0 ];
+                    if (t !== this.Dt) return [ 3 /*break*/ , 0 ];
                     e.label = 3;
 
                   case 3:
@@ -5490,7 +5499,7 @@ function Vr(t, e) {
      * exists.
      */
     t.prototype.Bt = function(t) {
-        for (var e = 0, n = this.$t; e < n.length; e++) {
+        for (var e = 0, n = this.Ft; e < n.length; e++) {
             if (n[e].timerId === t) return !0;
         }
         return !1;
@@ -5502,36 +5511,36 @@ function Vr(t, e) {
      * will be drained. Pass TimerId.All to run all delayed operations.
      * @returns a Promise that resolves once all operations have been run.
      */
-    t.prototype.Mt = function(t) {
+    t.prototype.zt = function(t) {
         var e = this;
         // Note that draining may generate more delayed ops, so we do that first.
-                return this.kt().then((function() {
+                return this.Mt().then((function() {
             // Run ops in the same order they'd run if they ran naturally.
-            e.$t.sort((function(t, e) {
+            e.Ft.sort((function(t, e) {
                 return t.targetTimeMs - e.targetTimeMs;
             }));
-            for (var n = 0, r = e.$t; n < r.length; n++) {
+            for (var n = 0, r = e.Ft; n < r.length; n++) {
                 var i = r[n];
                 if (i.skipDelay(), "all" /* All */ !== t && i.timerId === t) break;
             }
-            return e.kt();
+            return e.Mt();
         }));
     }, 
     /**
      * For Tests: Skip all subsequent delays for a timer id.
      */
-    t.prototype.Qt = function(t) {
-        this.xt.push(t);
+    t.prototype.Gt = function(t) {
+        this.Ot.push(t);
     }, 
     /** Called once a DelayedOperation is run or canceled. */ t.prototype.jt = function(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        var e = this.$t.indexOf(t);
-        this.$t.splice(e, 1);
+        var e = this.Ft.indexOf(t);
+        this.Ft.splice(e, 1);
     }, t;
-}(), qr = /** @class */ function() {
+}(), jr = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = Tn(t)
+        this._firestore = t, this._transaction = e, this._dataReader = In(t)
         /**
      * Reads the document referenced by the provided {@link DocumentReference}.
      *
@@ -5540,23 +5549,23 @@ function Vr(t, e) {
      */;
     }
     return t.prototype.get = function(t) {
-        var e = this, n = Vr(t, this._firestore), r = new dr(this._firestore);
+        var e = this, n = Dr(t, this._firestore), r = new yr(this._firestore);
         return this._transaction.lookup([ n._key ]).then((function(t) {
-            if (!t || 1 !== t.length) return S();
+            if (!t || 1 !== t.length) return T();
             var i = t[0];
-            if (i.isFoundDocument()) return new Gn(e._firestore, r, i.key, i, n.converter);
-            if (i.isNoDocument()) return new Gn(e._firestore, r, n._key, null, n.converter);
-            throw S();
+            if (i.isFoundDocument()) return new Qn(e._firestore, r, i.key, i, n.converter);
+            if (i.isNoDocument()) return new Qn(e._firestore, r, n._key, null, n.converter);
+            throw T();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = Vr(t, this._firestore), i = pr(r.converter, e, n), o = En(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
+        var r = Dr(t, this._firestore), i = mr(r.converter, e, n), o = An(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 = Vr(t, this._firestore);
+        var o, a = Dr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = h(e)) || e instanceof hn ? Fn(this._dataReader, "Transaction.update", a._key, e, n, r) : Nn(this._dataReader, "Transaction.update", a._key, e), 
+                return o = "string" == typeof (e = h(e)) || e instanceof dn ? On(this._dataReader, "Transaction.update", a._key, e, n, r) : qn(this._dataReader, "Transaction.update", a._key, e), 
         this._transaction.update(a._key, o), this;
     }, 
     /**
@@ -5566,7 +5575,7 @@ function Vr(t, e) {
      * @returns This `Transaction` instance. Used for chaining method calls.
      */
     t.prototype.delete = function(t) {
-        var e = Vr(t, this._firestore);
+        var e = Dr(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }, t;
 }();
@@ -5604,10 +5613,10 @@ function Vr(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */
-function jr(t, e) {
-    var n = Xe(t = it(t, Je)), r = new B;
-    return new Pr(new Or, n, (function(n) {
-        return e(new qr(t, n));
+function Lr(t, e) {
+    var n = Je(t = at(t, tn)), r = new U;
+    return new Nr(new Cr, n, (function(n) {
+        return e(new jr(t, n));
     }), r).run(), r.promise
     /**
  * Firestore Lite
@@ -5620,11 +5629,11 @@ function jr(t, e) {
 }
 
 m = i + "_lite", o(new c("firestore/lite", (function(t, e) {
-    var n = e.options, r = t.getProvider("app").getImmediate(), i = new Je(r, new Q(t.getProvider("auth-internal")));
+    var n = e.options, r = t.getProvider("app").getImmediate(), i = new tn(r, new z(t.getProvider("auth-internal")), new W(t.getProvider("app-check-internal")));
     return n && i._setSettings(n), i;
 }), "PUBLIC" /* PUBLIC */)), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-a("firestore-lite", "3.3.0", ""), a("firestore-lite", "3.3.0", "esm5");
+a("firestore-lite", "3.3.1-canary.086df7c7e", ""), a("firestore-lite", "3.3.1-canary.086df7c7e", "esm5");
 
-export { dn as Bytes, an as CollectionReference, rn as DocumentReference, Gn as DocumentSnapshot, hn as FieldPath, mn as FieldValue, Je as Firestore, x as FirestoreError, yn as GeoPoint, on as Query, Wn as QueryConstraint, Qn as QueryDocumentSnapshot, zn as QuerySnapshot, vt as Timestamp, qr as Transaction, Ar as WriteBatch, br as addDoc, Er as arrayRemove, Tr as arrayUnion, sn as collection, un as collectionGroup, en as connectFirestoreEmulator, wr as deleteDoc, _r as deleteField, cn as doc, pn as documentId, ur as endAt, sr as endBefore, mr as getDoc, yr as getDocs, tn as getFirestore, Ir as increment, Ze as initializeFirestore, er as limit, nr as limitToLast, Zn as orderBy, Yn as query, ln as queryEqual, fn as refEqual, jr as runTransaction, Sr as serverTimestamp, vr as setDoc, v as setLogLevel, Hn as snapshotEqual, or as startAfter, ir as startAt, nn as terminate, gr as updateDoc, $n as where, Dr as writeBatch };
+export { yn as Bytes, un as CollectionReference, an as DocumentReference, Qn as DocumentSnapshot, dn as FieldPath, vn as FieldValue, tn as Firestore, M as FirestoreError, gn as GeoPoint, sn as Query, $n as QueryConstraint, Kn as QueryDocumentSnapshot, Hn as QuerySnapshot, wt as Timestamp, jr as Transaction, Vr as WriteBatch, Tr as addDoc, Ar as arrayRemove, Ir as arrayUnion, cn as collection, ln as collectionGroup, rn as connectFirestoreEmulator, _r as deleteDoc, Sr as deleteField, fn as doc, mn as documentId, lr as endAt, cr as endBefore, vr as getDoc, gr as getDocs, nn as getFirestore, kr as increment, en as initializeFirestore, rr as limit, ir as limitToLast, er as orderBy, Xn as query, pn as queryEqual, hn as refEqual, Lr as runTransaction, Er as serverTimestamp, wr as setDoc, v as setLogLevel, Wn as snapshotEqual, sr as startAfter, ar as startAt, on as terminate, br as updateDoc, Zn as where, Pr as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map