@firebase/firestore 3.7.1 → 3.7.2

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

@@ -67,7 +67,7 @@ v.MOCK_USER = new v("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var g = "9.12.1", w = new l("@firebase/firestore");
+var g = "9.13.0", w = new l("@firebase/firestore");
 
 /**
  * @license
@@ -105,7 +105,7 @@ function b(t) {
 function _(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
     if (w.logLevel <= f.DEBUG) {
-        var i = e.map(S);
+        var i = e.map(k);
         w.debug.apply(w, r([ "Firestore (" + g + "): " + t ], i));
     }
 }
@@ -113,7 +113,7 @@ function _(t) {
 function T(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
     if (w.logLevel <= f.ERROR) {
-        var i = e.map(S);
+        var i = e.map(k);
         w.error.apply(w, r([ "Firestore (" + g + "): " + t ], i));
     }
 }
@@ -123,14 +123,14 @@ function T(t) {
  */ function E(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
     if (w.logLevel <= f.WARN) {
-        var i = e.map(S);
+        var i = e.map(k);
         w.warn.apply(w, r([ "Firestore (" + g + "): " + t ], i));
     }
 }
 
 /**
  * Converts an additional log parameter to a string representation.
- */ function S(t) {
+ */ function k(t) {
     if ("string" == typeof t) return t;
     try {
         return e = t, JSON.stringify(e);
@@ -180,7 +180,7 @@ function T(t) {
  * Returns `never` and can be used in expressions:
  * @example
  * let futureVar = fail('not implemented yet');
- */ function k(t) {
+ */ function S(t) {
     void 0 === t && (t = "Unexpected state");
     // Log the failure in addition to throw an exception, just in case the
     // exception is swallowed.
@@ -198,7 +198,7 @@ function T(t) {
 }
 
 function I(t, e) {
-    t || k();
+    t || S();
 }
 
 /**
@@ -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 V = "cancelled", P = "unknown", D = "invalid-argument", O = "deadline-exceeded", N = "not-found", F = "permission-denied", R = "unauthenticated", q = "resource-exhausted", L = "failed-precondition", x = "aborted", C = "out-of-range", j = "unimplemented", M = "internal", U = "unavailable", B = /** @class */ function(e) {
+ */ var V = "cancelled", P = "unknown", D = "invalid-argument", F = "deadline-exceeded", N = "not-found", O = "permission-denied", R = "unauthenticated", q = "resource-exhausted", L = "failed-precondition", x = "aborted", C = "out-of-range", j = "unimplemented", M = "internal", U = "unavailable", B = /** @class */ function(e) {
     /** @hideconstructor */
     function n(
     /**
@@ -251,9 +251,9 @@ e) {
     this.promise = new Promise((function(e, n) {
         t.resolve = e, t.reject = n;
     }));
-}, G = function(t, e) {
+}, K = function(t, e) {
     this.user = e, this.type = "OAuth", this.headers = new Map, this.headers.set("Authorization", "Bearer " + t);
-}, K = /** @class */ function() {
+}, G = /** @class */ function() {
     function t() {}
     return t.prototype.getToken = function() {
         return Promise.resolve(null);
@@ -295,7 +295,7 @@ e) {
     return t.prototype.getToken = function() {
         var t = this;
         return this.auth ? this.auth.getToken().then((function(e) {
-            return e ? (I("string" == typeof e.accessToken), new G(e.accessToken, new v(t.auth.getUid()))) : null;
+            return e ? (I("string" == typeof e.accessToken), new K(e.accessToken, new v(t.auth.getUid()))) : null;
         })) : Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
     t.prototype.shutdown = function() {}, t;
@@ -387,7 +387,7 @@ function(t, e, n, r, i, o, a, u) {
     }, t;
 }(), tt = /** @class */ function() {
     function t(t, e, n) {
-        void 0 === e ? e = 0 : e > t.length && k(), void 0 === n ? n = t.length - e : n > t.length - e && k(), 
+        void 0 === e ? e = 0 : e > t.length && S(), void 0 === n ? n = t.length - e : n > t.length - e && S(), 
         this.segments = t, this.offset = e, this.len = n;
     }
     return Object.defineProperty(t.prototype, "length", {
@@ -638,7 +638,7 @@ function ot(t, e, n) {
         }(t);
         return e ? "a custom " + e + " object" : "an object";
     }
-    return "function" == typeof t ? "a function" : k();
+    return "function" == typeof t ? "a function" : S();
 }
 
 function ct(t, 
@@ -776,7 +776,7 @@ function mt(t) {
 
       case 403:
         // Forbidden
-        return F;
+        return O;
 
       case 404:
         // Not Found
@@ -817,7 +817,7 @@ function mt(t) {
 
       case 504:
         // Gateway Timeout
-        return O;
+        return F;
 
       default:
         return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? L : t >= 500 && t < 600 ? M : P;
@@ -1239,13 +1239,13 @@ function bt(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function St(t) {
+function kt(t) {
     var e = 0;
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
 }
 
-function kt(t, e) {
+function St(t, e) {
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
@@ -1483,10 +1483,10 @@ var It = /** @class */ function() {
     // In a balanced RB tree, the black-depth (number of black nodes) from root to
     // leaves is equal on both sides.  This function verifies that or asserts.
     t.prototype.check = function() {
-        if (this.isRed() && this.left.isRed()) throw k();
-        if (this.right.isRed()) throw k();
+        if (this.isRed() && this.left.isRed()) throw S();
+        if (this.right.isRed()) throw S();
         var t = this.left.check();
-        if (t !== this.right.check()) throw k();
+        if (t !== this.right.check()) throw S();
         return t + (this.isRed() ? 0 : 1);
     }, t;
 }();
@@ -1504,31 +1504,31 @@ Vt.EMPTY = new (/** @class */ function() {
     }
     return Object.defineProperty(t.prototype, "key", {
         get: function() {
-            throw k();
+            throw S();
         },
         enumerable: !1,
         configurable: !0
     }), Object.defineProperty(t.prototype, "value", {
         get: function() {
-            throw k();
+            throw S();
         },
         enumerable: !1,
         configurable: !0
     }), Object.defineProperty(t.prototype, "color", {
         get: function() {
-            throw k();
+            throw S();
         },
         enumerable: !1,
         configurable: !0
     }), Object.defineProperty(t.prototype, "left", {
         get: function() {
-            throw k();
+            throw S();
         },
         enumerable: !1,
         configurable: !0
     }), Object.defineProperty(t.prototype, "right", {
         get: function() {
-            throw k();
+            throw S();
         },
         enumerable: !1,
         configurable: !0
@@ -1678,7 +1678,7 @@ var Pt = /** @class */ function() {
     }, t.prototype.hasNext = function() {
         return this.iter.hasNext();
     }, t;
-}(), Ot = /** @class */ function() {
+}(), Ft = /** @class */ function() {
     function t(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
@@ -1769,7 +1769,7 @@ var Pt = /** @class */ function() {
 
 Nt.EMPTY_BYTE_STRING = new Nt("");
 
-var Ft = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+var Ot = 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
@@ -1782,7 +1782,7 @@ var Ft = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         // The date string can have higher precision (nanos) than the Date class
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
-        var e = 0, n = Ft.exec(t);
+        var e = 0, n = Ot.exec(t);
         if (I(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             var r = n[1];
@@ -1896,7 +1896,7 @@ var Ft = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
         return "__max__" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;
-    }(t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : k();
+    }(t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : S();
 }
 
 /** Tests `left` and `right` for equality based on the backend semantics. */ function Bt(t, e) {
@@ -1955,13 +1955,13 @@ var Ft = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
       case 10 /* ObjectValue */ :
         return function(t, e) {
             var n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (St(n) !== St(r)) return !1;
+            if (kt(n) !== kt(r)) return !1;
             for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !Bt(n[i], r[i]))) return !1;
             return !0;
         }(t, e);
 
       default:
-        return k();
+        return S();
     }
 }
 
@@ -1971,7 +1971,7 @@ function zt(t, e) {
     }));
 }
 
-function Gt(t, e) {
+function Kt(t, e) {
     if (t === e) return 0;
     var n = Ut(t), r = Ut(e);
     if (n !== r) return bt(n, r);
@@ -1992,10 +1992,10 @@ function Gt(t, e) {
         }(t, e);
 
       case 3 /* TimestampValue */ :
-        return Kt(t.timestampValue, e.timestampValue);
+        return Gt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return Kt(jt(t), jt(e));
+        return Gt(jt(t), jt(e));
 
       case 5 /* StringValue */ :
         return bt(t.stringValue, e.stringValue);
@@ -2024,7 +2024,7 @@ function Gt(t, e) {
       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 = Gt(n[i], r[i]);
+                var o = Kt(n[i], r[i]);
                 if (o) return o;
             }
             return bt(n.length, r.length);
@@ -2044,18 +2044,18 @@ function Gt(t, e) {
             for (var a = 0; a < r.length && a < o.length; ++a) {
                 var u = bt(r[a], o[a]);
                 if (0 !== u) return u;
-                var s = Gt(n[r[a]], i[o[a]]);
+                var s = Kt(n[r[a]], i[o[a]]);
                 if (0 !== s) return s;
             }
             return bt(r.length, o.length);
         }(t.mapValue, e.mapValue);
 
       default:
-        throw k();
+        throw S();
     }
 }
 
-function Kt(t, e) {
+function Gt(t, e) {
     if ("string" == typeof t && "string" == typeof e && t.length === e.length) return bt(t, e);
     var n = Rt(t), r = Rt(e), i = bt(n.seconds, r.seconds);
     return 0 !== i ? i : bt(n.nanos, r.nanos);
@@ -2096,7 +2096,7 @@ function Qt(t, e) {
                 fields: {}
             }
         };
-        return kt(t.mapValue.fields, (function(t, n) {
+        return St(t.mapValue.fields, (function(t, n) {
             return e.mapValue.fields[t] = Jt(n);
         })), e;
     }
@@ -2194,7 +2194,7 @@ var Zt = /** @class */ function() {
      * entries.
      */
     t.prototype.applyChanges = function(t, e, n) {
-        kt(e, (function(e, n) {
+        St(e, (function(e, n) {
             return t[e] = n;
         }));
         for (var r = 0, i = n; r < i.length; r++) {
@@ -2359,7 +2359,7 @@ var ne = /** @class */ function(e) {
     }, 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.S(Gt(e, this.value)) : null !== e && Ut(this.value) === Ut(e) && this.S(Gt(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.S(Kt(e, this.value)) : null !== e && Ut(this.value) === Ut(e) && this.S(Kt(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }, n.prototype.S = function(t) {
         switch (this.op) {
@@ -2382,7 +2382,7 @@ var ne = /** @class */ function(e) {
             return t >= 0;
 
           default:
-            return k();
+            return S();
         }
     }, n.prototype.q = function() {
         return [ "<" /* LESS_THAN */ , "<=" /* LESS_THAN_OR_EQUAL */ , ">" /* GREATER_THAN */ , ">=" /* GREATER_THAN_OR_EQUAL */ , "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ].indexOf(this.op) >= 0;
@@ -2670,13 +2670,13 @@ function _e(t, e) {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(Te), Se = /** @class */ function(e) {
+}(Te), ke = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(Te), ke = /** @class */ function(e) {
+}(Te), Se = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
@@ -2722,7 +2722,7 @@ function _e(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(Pe), Oe = /** @class */ function(e) {
+}(Pe), Fe = /** @class */ function(e) {
     function n(t, n, r, i, o) {
         void 0 === o && (o = []);
         var a = this;
@@ -2741,7 +2741,7 @@ function _e(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(Pe), Fe = /** @class */ function(e) {
+}(Pe), Oe = /** @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 */ , 
@@ -2826,11 +2826,11 @@ function ze(t, e) {
     return new it((I((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
 }
 
-function Ge(t, e) {
+function Ke(t, e) {
     return Ue(t.databaseId, e);
 }
 
-function Ke(t) {
+function Ge(t) {
     return new et([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
@@ -2846,10 +2846,10 @@ function We(t, e) {
     var n = {
         structuredQuery: {}
     }, r = e.path;
-    null !== e.collectionGroup ? (n.parent = Ge(t, r), n.structuredQuery.from = [ {
+    null !== e.collectionGroup ? (n.parent = Ke(t, r), n.structuredQuery.from = [ {
         collectionId: e.collectionGroup,
         allDescendants: !0
-    } ]) : (n.parent = Ge(t, r.popLast()), n.structuredQuery.from = [ {
+    } ]) : (n.parent = Ke(t, r.popLast()), n.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     var i = function(t) {
@@ -3080,16 +3080,16 @@ function Ze(t) {
     function n(t, n, r, i) {
         var o = this;
         return (o = e.call(this) || this).authCredentials = t, o.appCheckCredentials = n, 
-        o.tt = r, o.L = i, o.et = !1, o;
+        o.connection = r, o.L = i, o.tt = !1, o;
     }
-    return t(n, e), n.prototype.nt = function() {
-        if (this.et) throw new B(L, "The client has already been terminated.");
+    return t(n, e), n.prototype.et = function() {
+        if (this.tt) throw new B(L, "The client has already been terminated.");
     }, 
     /** Invokes the provided RPC with auth and AppCheck tokens. */ n.prototype.I = function(t, e, n) {
         var r = this;
-        return this.nt(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(i) {
+        return this.et(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(i) {
             var o = i[0], a = i[1];
-            return r.tt.I(t, e, n, o, a);
+            return r.connection.I(t, e, n, o, a);
         })).catch((function(t) {
             throw "FirebaseError" === t.name ? (t.code === R && (r.authCredentials.invalidateToken(), 
             r.appCheckCredentials.invalidateToken()), t) : new B(P, t.toString());
@@ -3097,15 +3097,15 @@ function Ze(t) {
     }, 
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */ n.prototype.P = function(t, e, n, r) {
         var i = this;
-        return this.nt(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(o) {
+        return this.et(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(o) {
             var a = o[0], u = o[1];
-            return i.tt.P(t, e, n, a, u, r);
+            return i.connection.P(t, e, n, a, u, r);
         })).catch((function(t) {
             throw "FirebaseError" === t.name ? (t.code === R && (i.authCredentials.invalidateToken(), 
             i.appCheckCredentials.invalidateToken()), t) : new B(P, t.toString());
         }));
     }, n.prototype.terminate = function() {
-        this.et = !0;
+        this.tt = !0;
     }, n;
 }((function() {}));
 
@@ -3142,7 +3142,7 @@ function nn(t, r) {
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = A(t), i = Ke(e.L) + "/documents", o = {
+                return e = A(t), i = Ge(e.L) + "/documents", o = {
                     writes: r.map((function(t) {
                         return function(t, e) {
                             var n;
@@ -3150,11 +3150,11 @@ function nn(t, r) {
                                 update: Qe(t, e.key, e.value)
                             }; else if (e instanceof Ne) n = {
                                 delete: Be(t, e.key)
-                            }; else if (e instanceof Oe) n = {
+                            }; else if (e instanceof Fe) n = {
                                 update: Qe(t, e.key, e.data),
                                 updateMask: Je(e.fieldMask)
                             }; else {
-                                if (!(e instanceof Fe)) return k();
+                                if (!(e instanceof Oe)) return S();
                                 n = {
                                     verify: Be(t, e.key)
                                 };
@@ -3166,13 +3166,13 @@ function nn(t, r) {
                                         fieldPath: e.field.canonicalString(),
                                         setToServerValue: "REQUEST_TIME"
                                     };
-                                    if (n instanceof Se) return {
+                                    if (n instanceof ke) return {
                                         fieldPath: e.field.canonicalString(),
                                         appendMissingElements: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof ke) return {
+                                    if (n instanceof Se) return {
                                         fieldPath: e.field.canonicalString(),
                                         removeAllFromArray: {
                                             values: n.elements
@@ -3182,14 +3182,14 @@ function nn(t, r) {
                                         fieldPath: e.field.canonicalString(),
                                         increment: n.M
                                     };
-                                    throw k();
+                                    throw S();
                                 }(0, t);
                             }))), e.precondition.isNone || (n.currentDocument = function(t, e) {
                                 return void 0 !== e.updateTime ? {
                                     updateTime: je(t, e.updateTime)
                                 } : void 0 !== e.exists ? {
                                     exists: e.exists
-                                } : k();
+                                } : S();
                             }(t, e.precondition)), n;
                         }(e.L, t);
                     }))
@@ -3208,7 +3208,7 @@ function rn(t, r) {
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = A(t), i = Ke(e.L) + "/documents", o = {
+                return e = A(t), i = Ge(e.L) + "/documents", o = {
                     documents: r.map((function(t) {
                         return Be(e.L, t);
                     }))
@@ -3229,7 +3229,7 @@ function rn(t, r) {
                             I(!!e.missing), I(!!e.readTime);
                             var n = ze(t, e.missing), r = Me(e.readTime);
                             return $t.newNoDocument(n, r);
-                        }(t, e) : k();
+                        }(t, e) : S();
                     }(e.L, t);
                     u.set(n.key.toString(), n);
                 })), s = [], [ 2 /*return*/ , (r.forEach((function(t) {
@@ -3363,7 +3363,7 @@ var on = new Map;
     }), t.prototype._setSettings = function(t) {
         if (this._settingsFrozen) throw new B(L, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
         this._settings = new un(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
-            if (!t) return new K;
+            if (!t) return new G;
             switch (t.type) {
               case "gapi":
                 var e = t.client;
@@ -3475,7 +3475,7 @@ function ln(t, e) {
             if (!s) throw new B(D, "mockUserToken must contain 'sub' or 'user_id' field!");
             u = new v(s);
         }
-        t._authCredentials = new Q(new G(a, u));
+        t._authCredentials = new Q(new K(a, u));
     }
 }
 
@@ -3586,7 +3586,7 @@ var pn = function() {
                                 },
                                 parent: n.parent
                             };
-                        }(e.L, be(r)), o = i.parent, e.tt.v || delete i.parent, [ 4 /*yield*/ , e.P("RunAggregationQuery", o, i, /*expectedResponseCount=*/ 1) ];
+                        }(e.L, be(r)), o = i.parent, e.connection.v || delete i.parent, [ 4 /*yield*/ , e.P("RunAggregationQuery", o, i, /*expectedResponseCount=*/ 1) ];
 
                       case 1:
                         return [ 2 /*return*/ , n.sent().filter((function(t) {
@@ -3824,7 +3824,7 @@ function En(t, e) {
  */;
 }
 
-var Sn = /** @class */ function() {
+var kn = /** @class */ function() {
     /** @hideconstructor */
     function t(t) {
         this._byteString = t;
@@ -3882,7 +3882,7 @@ var Sn = /** @class */ function() {
     t.prototype.isEqual = function(t) {
         return this._byteString.isEqual(t._byteString);
     }, t;
-}(), kn = /** @class */ function() {
+}(), Sn = /** @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.
@@ -3933,7 +3933,7 @@ var Sn = /** @class */ function() {
  * It can be used in queries to sort or filter by the document ID.
  */
 function In() {
-    return new kn("__name__");
+    return new Sn("__name__");
 }
 
 /**
@@ -4020,16 +4020,16 @@ function(t) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     return t.prototype.toMutation = function(t, e) {
-        return null !== this.fieldMask ? new Oe(t, this.data, this.fieldMask, e, this.fieldTransforms) : new De(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new Fe(t, this.data, this.fieldMask, e, this.fieldTransforms) : new De(t, this.data, e, this.fieldTransforms);
     }, t;
-}(), On = /** @class */ function() {
+}(), Fn = /** @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 Oe(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new Fe(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }, t;
 }();
 
@@ -4069,11 +4069,11 @@ function(t) {
         return !1;
 
       default:
-        throw k();
+        throw S();
     }
 }
 
-/** A "context" object passed around while parsing user data. */ var Fn = /** @class */ function() {
+/** A "context" object passed around while parsing user data. */ var On = /** @class */ function() {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -4096,7 +4096,7 @@ function(t) {
         this.settings = t, this.databaseId = e, this.L = 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.rt(), this.fieldTransforms = i || [], this.fieldMask = o || [];
+        void 0 === i && this.nt(), this.fieldTransforms = i || [], this.fieldMask = o || [];
     }
     return Object.defineProperty(t.prototype, "path", {
         get: function() {
@@ -4104,36 +4104,36 @@ function(t) {
         },
         enumerable: !1,
         configurable: !0
-    }), Object.defineProperty(t.prototype, "st", {
+    }), Object.defineProperty(t.prototype, "rt", {
         get: function() {
-            return this.settings.st;
+            return this.settings.rt;
         },
         enumerable: !1,
         configurable: !0
     }), 
-    /** Returns a new context with the specified settings overwritten. */ t.prototype.it = function(e) {
+    /** Returns a new context with the specified settings overwritten. */ t.prototype.st = function(e) {
         return new t(Object.assign(Object.assign({}, this.settings), e), this.databaseId, this.L, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
-    }, t.prototype.ot = function(t) {
-        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.it({
+    }, t.prototype.it = function(t) {
+        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.st({
             path: n,
-            ut: !1
+            ot: !1
         });
-        return r.ct(t), r;
-    }, t.prototype.at = function(t) {
-        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.it({
+        return r.ut(t), r;
+    }, t.prototype.ct = function(t) {
+        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.st({
             path: n,
-            ut: !1
+            ot: !1
         });
-        return r.rt(), r;
-    }, t.prototype.ht = function(t) {
+        return r.nt(), r;
+    }, t.prototype.at = function(t) {
         // TODO(b/34871131): We don't support array paths right now; so make path
         // undefined.
-        return this.it({
+        return this.st({
             path: void 0,
-            ut: !0
+            ot: !0
         });
-    }, t.prototype.lt = function(t) {
-        return $n(t, this.settings.methodName, this.settings.ft || !1, this.path, this.settings.dt);
+    }, t.prototype.ht = function(t) {
+        return $n(t, this.settings.methodName, this.settings.lt || !1, this.path, this.settings.ft);
     }, 
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */ t.prototype.contains = function(t) {
         return void 0 !== this.fieldMask.find((function(e) {
@@ -4141,27 +4141,27 @@ function(t) {
         })) || void 0 !== this.fieldTransforms.find((function(e) {
             return t.isPrefixOf(e.field);
         }));
-    }, t.prototype.rt = function() {
+    }, t.prototype.nt = 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.ct(this.path.get(t));
-    }, t.prototype.ct = function(t) {
-        if (0 === t.length) throw this.lt("Document fields must not be empty");
-        if (Nn(this.st) && Pn.test(t)) throw this.lt('Document fields cannot begin and end with "__"');
+        if (this.path) for (var t = 0; t < this.path.length; t++) this.ut(this.path.get(t));
+    }, t.prototype.ut = function(t) {
+        if (0 === t.length) throw this.ht("Document fields must not be empty");
+        if (Nn(this.rt) && Pn.test(t)) throw this.ht('Document fields cannot begin and end with "__"');
     }, t;
 }(), Rn = /** @class */ function() {
     function t(t, e, n) {
         this.databaseId = t, this.ignoreUndefinedProperties = e, this.L = n || $e(t)
         /** Creates a new top-level parse context. */;
     }
-    return t.prototype.wt = function(t, e, n, r) {
-        return void 0 === r && (r = !1), new Fn({
-            st: t,
+    return t.prototype.dt = function(t, e, n, r) {
+        return void 0 === r && (r = !1), new On({
+            rt: t,
             methodName: e,
-            dt: n,
+            ft: n,
             path: rt.emptyPath(),
-            ut: !1,
-            ft: r
+            ot: !1,
+            lt: r
         }, this.databaseId, this.L, this.ignoreUndefinedProperties);
     }, t;
 }();
@@ -4176,16 +4176,16 @@ function(t) {
 
 /** Parse document data from a set() call. */ function Ln(t, e, n, r, i, o) {
     void 0 === o && (o = {});
-    var a = t.wt(o.merge || o.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
+    var a = t.dt(o.merge || o.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
     Hn("Data must be an object, but it was:", a, r);
     var u, s, c = Wn(r, a);
-    if (o.merge) u = new Ot(a.fieldMask), s = a.fieldTransforms; else if (o.mergeFields) {
+    if (o.merge) u = new Ft(a.fieldMask), s = a.fieldTransforms; else if (o.mergeFields) {
         for (var l = [], f = 0, h = o.mergeFields; f < h.length; f++) {
             var p = Xn(e, h[f], n);
             if (!a.contains(p)) throw new B(D, "Field '" + p + "' is specified in your field mask but missing from your input data.");
             tr(l, p) || l.push(p);
         }
-        u = new Ot(l), s = a.fieldTransforms.filter((function(t) {
+        u = new Ft(l), s = a.fieldTransforms.filter((function(t) {
             return u.covers(t.field);
         }));
     } else u = null, s = a.fieldTransforms;
@@ -4197,7 +4197,7 @@ var xn = /** @class */ function(e) {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        if (2 /* MergeSet */ !== t.st) throw 1 /* Update */ === t.st ? t.lt(this._methodName + "() can only appear at the top level of your update data") : t.lt(this._methodName + "() cannot be used with set() unless you pass {merge:true}");
+        if (2 /* MergeSet */ !== t.rt) throw 1 /* Update */ === t.rt ? t.ht(this._methodName + "() can only appear at the top level of your update data") : t.ht(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;
@@ -4222,11 +4222,11 @@ var xn = /** @class */ function(e) {
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
  */ function Cn(t, e, n) {
-    return new Fn({
-        st: 3 /* Argument */ ,
-        dt: e.settings.dt,
+    return new On({
+        rt: 3 /* Argument */ ,
+        ft: e.settings.ft,
         methodName: t._methodName,
-        ut: n
+        ot: n
     }, e.databaseId, e.L, e.ignoreUndefinedProperties);
 }
 
@@ -4242,13 +4242,13 @@ var jn = /** @class */ function(e) {
 }(An), Mn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t) || this).yt = n, r;
+        return (r = e.call(this, t) || this).wt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
         var e = Cn(this, t, 
-        /*array=*/ !0), n = this.yt.map((function(t) {
+        /*array=*/ !0), n = this.wt.map((function(t) {
             return Qn(t, e);
-        })), r = new Se(n);
+        })), r = new ke(n);
         return new Ae(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4257,13 +4257,13 @@ var jn = /** @class */ function(e) {
 }(An), Un = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t) || this).yt = n, r;
+        return (r = e.call(this, t) || this).wt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
         var e = Cn(this, t, 
-        /*array=*/ !0), n = this.yt.map((function(t) {
+        /*array=*/ !0), n = this.wt.map((function(t) {
             return Qn(t, e);
-        })), r = new ke(n);
+        })), r = new Se(n);
         return new Ae(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4272,10 +4272,10 @@ var jn = /** @class */ function(e) {
 }(An), Bn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t) || this)._t = n, r;
+        return (r = e.call(this, t) || this).yt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = new Ie(t.L, _e(t.L, this._t));
+        var e = new Ie(t.L, _e(t.L, this.yt));
         return new Ae(t.path, e);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4284,15 +4284,15 @@ var jn = /** @class */ function(e) {
 }(An);
 
 /** Parse update data from an update() call. */ function zn(t, e, n, r) {
-    var i = t.wt(1 /* Update */ , e, n);
+    var i = t.dt(1 /* Update */ , e, n);
     Hn("Data must be an object, but it was:", i, r);
     var o = [], a = Zt.empty();
-    kt(r, (function(t, r) {
+    St(r, (function(t, r) {
         var u = Zn(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = p(r);
-        var s = i.at(u);
+        var s = i.ct(u);
         if (r instanceof xn) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(u); else {
@@ -4300,12 +4300,12 @@ var jn = /** @class */ function(e) {
             null != c && (o.push(u), a.set(u, c));
         }
     }));
-    var u = new Ot(o);
-    return new On(a, u, i.fieldTransforms);
+    var u = new Ft(o);
+    return new Fn(a, u, i.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function Gn(t, e, n, r, i, o) {
-    var a = t.wt(1 /* Update */ , e, n), u = [ Xn(e, r, n) ], s = [ i ];
+/** Parse update data from a list of field/value arguments. */ function Kn(t, e, n, r, i, o) {
+    var a = t.dt(1 /* Update */ , e, n), u = [ Xn(e, r, n) ], s = [ i ];
     if (o.length % 2 != 0) throw new B(D, "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) u.push(Xn(e, o[c])), s.push(o[c + 1]);
     // We iterate in reverse order to pick the last value for a field if the
@@ -4315,7 +4315,7 @@ var jn = /** @class */ function(e) {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
         y = p(y);
-        var m = a.at(d);
+        var m = a.ct(d);
         if (y instanceof xn) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(d); else {
@@ -4323,8 +4323,8 @@ var jn = /** @class */ function(e) {
             null != v && (l.push(d), f.set(d, v));
         }
     }
-    var g = new Ot(l);
-    return new On(f, g, a.fieldTransforms);
+    var g = new Ft(l);
+    return new Fn(f, g, a.fieldTransforms);
 }
 
 /**
@@ -4333,8 +4333,8 @@ var jn = /** @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 Kn(t, e, n, r) {
-    return void 0 === r && (r = !1), Qn(n, t.wt(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+ */ function Gn(t, e, n, r) {
+    return void 0 === r && (r = !1), Qn(n, t.dt(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -4362,8 +4362,8 @@ var jn = /** @class */ function(e) {
      */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Nn(e.st)) throw e.lt(t._methodName + "() can only be used with update() and set()");
-        if (!e.path) throw e.lt(t._methodName + "() is not currently supported inside arrays");
+        if (!Nn(e.rt)) throw e.ht(t._methodName + "() can only be used with update() and set()");
+        if (!e.path) throw e.ht(t._methodName + "() is not currently supported inside arrays");
         var n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
     }(t, e), null;
@@ -4382,10 +4382,10 @@ var jn = /** @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.ut && 4 /* ArrayArgument */ !== e.st) throw e.lt("Nested arrays are not supported");
+        if (e.settings.ot && 4 /* ArrayArgument */ !== e.rt) throw e.ht("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.ht(r));
+                var a = Qn(o[i], e.at(r));
                 null == a && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4432,17 +4432,17 @@ var jn = /** @class */ function(e) {
                 longitude: t.longitude
             }
         };
-        if (t instanceof Sn) return {
+        if (t instanceof kn) return {
             bytesValue: Ce(e.L, t._byteString)
         };
         if (t instanceof mn) {
             var i = e.databaseId, o = t.firestore._databaseId;
-            if (!o.isEqual(i)) throw e.lt("Document reference is for database " + o.projectId + "/" + o.database + " but should be for database " + i.projectId + "/" + i.database);
+            if (!o.isEqual(i)) throw e.ht("Document reference is for database " + o.projectId + "/" + o.database + " but should be for database " + i.projectId + "/" + i.database);
             return {
                 referenceValue: Ue(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.lt("Unsupported field value: " + st(t));
+        throw e.ht("Unsupported field value: " + st(t));
     }(t, e);
 }
 
@@ -4454,8 +4454,8 @@ function Wn(t, e) {
     }(t) ? 
     // If we encounter an empty object, we explicitly add it to the update
     // mask to ensure that the server creates a map entry.
-    e.path && e.path.length > 0 && e.fieldMask.push(e.path) : kt(t, (function(t, r) {
-        var i = Qn(r, e.ot(t));
+    e.path && e.path.length > 0 && e.fieldMask.push(e.path) : St(t, (function(t, r) {
+        var i = Qn(r, e.it(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -4465,7 +4465,7 @@ function Wn(t, e) {
 }
 
 function Yn(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof Tt || t instanceof Vn || t instanceof Sn || t instanceof mn || t instanceof An);
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof Tt || t instanceof Vn || t instanceof kn || t instanceof mn || t instanceof An);
 }
 
 function Hn(t, e, n) {
@@ -4473,7 +4473,7 @@ function Hn(t, e, n) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         var r = st(n);
-        throw "an object" === r ? e.lt(t + " a custom object") : e.lt(t + " " + r);
+        throw "an object" === r ? e.ht(t + " a custom object") : e.ht(t + " " + r);
     }
 }
 
@@ -4483,7 +4483,7 @@ function Hn(t, e, n) {
     if (
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    (e = p(e)) instanceof kn) return e._internalPath;
+    (e = p(e)) instanceof Sn) return e._internalPath;
     if ("string" == typeof e) return Zn(t, e);
     throw $n("Field path arguments must be of type string or ", t, 
     /* hasConverter= */ !1, 
@@ -4507,7 +4507,7 @@ function Hn(t, e, n) {
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return (new (kn.bind.apply(kn, r([ void 0 ], e.split(".")))))._internalPath;
+        return (new (Sn.bind.apply(Sn, r([ void 0 ], e.split(".")))))._internalPath;
     } catch (r) {
         throw $n("Invalid field path (" + e + "). Paths must not be empty, begin with '.', end with '.', or contain '..'", t, 
         /* hasConverter= */ !1, 
@@ -4698,7 +4698,7 @@ function ir(t, e) {
 }
 
 function or(t, e) {
-    return "string" == typeof e ? Zn(t, e) : e instanceof kn ? e._internalPath : e._delegate._internalPath;
+    return "string" == typeof e ? Zn(t, e) : e instanceof Sn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4746,7 +4746,7 @@ function or(t, e) {
 var sr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).gt = t, i.vt = n, i.bt = r, i.type = "where", 
+        return (i = e.call(this) || this)._t = t, i.gt = n, i.vt = r, i.type = "where", 
         i;
     }
     return t(n, e), n.prototype._apply = function(t) {
@@ -4767,7 +4767,7 @@ var sr = /** @class */ function(e) {
                     };
                 } else u = Tr(r, t, a);
             } else "in" /* IN */ !== o && "not-in" /* NOT_IN */ !== o && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== o || Er(a, o), 
-            u = Kn(n, "where", a, 
+            u = Gn(n, "where", a, 
             /* allowArrays= */ "in" /* IN */ === o || "not-in" /* NOT_IN */ === o);
             var h = ne.create(i, o, u);
             return function(t, e) {
@@ -4775,7 +4775,7 @@ var sr = /** @class */ function(e) {
                     var n = ve(t);
                     if (null !== n && !n.isEqual(e.field)) throw new B(D, "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 = me(t);
-                    null !== r && Sr(t, e.field, r);
+                    null !== r && kr(t, e.field, r);
                 }
                 var i = function(t, e) {
                     for (var n = 0, r = t.filters; n < r.length; n++) {
@@ -4821,7 +4821,7 @@ var sr = /** @class */ function(e) {
                 // Special case when it's a duplicate op to give a slightly clearer error message.
                 throw i === e.op ? new B(D, "Invalid query. You cannot use more than one '" + e.op.toString() + "' filter.") : new B(D, "Invalid query. You cannot use '" + e.op.toString() + "' filters with '" + i.toString() + "' filters.");
             }(t, h), h;
-        }(t._query, 0, e, t.firestore._databaseId, this.gt, this.vt, this.bt);
+        }(t._query, 0, e, t.firestore._databaseId, this._t, this.gt, this.vt);
         return new vn(t.firestore, t.converter, function(t, e) {
             var n = t.filters.concat([ e ]);
             return new ye(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
@@ -4847,7 +4847,7 @@ var sr = /** @class */ function(e) {
 var lr = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this) || this).gt = t, r.Et = n, r.type = "orderBy", r;
+        return (r = e.call(this) || this)._t = t, r.bt = n, r.type = "orderBy", r;
     }
     return t(n, e), n.prototype._apply = function(t) {
         var e = function(t, e, n) {
@@ -4858,10 +4858,10 @@ var lr = /** @class */ function(e) {
                 if (null === me(t)) {
                     // This is the first order by. It must match any inequality.
                     var n = ve(t);
-                    null !== n && Sr(t, n, e.field);
+                    null !== n && kr(t, n, e.field);
                 }
             }(t, r), r;
-        }(t._query, this.gt, this.Et);
+        }(t._query, this._t, this.bt);
         return new vn(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 ]);
@@ -4887,12 +4887,12 @@ var lr = /** @class */ function(e) {
 var hr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.It = n, i.Tt = r, i;
+        return (i = e.call(this) || this).type = t, i.Et = n, i.It = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
         return new vn(t.firestore, t.converter, function(t, e, n) {
             return new ye(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
-        }(t._query, this.It, this.Tt));
+        }(t._query, this.Et, this.It));
     }, n;
 }(ar);
 
@@ -4921,10 +4921,10 @@ function dr(t) {
 var yr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.At = n, i.Rt = r, i;
+        return (i = e.call(this) || this).type = t, i.Tt = n, i.At = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = _r(t, this.type, this.At, this.Rt);
+        var e = _r(t, this.type, this.Tt, this.At);
         return new vn(t.firestore, t.converter, function(t, e) {
             return new ye(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
@@ -4946,10 +4946,10 @@ function vr() {
 var gr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.At = n, i.Rt = r, i;
+        return (i = e.call(this) || this).type = t, i.Tt = n, i.At = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = _r(t, this.type, this.At, this.Rt);
+        var e = _r(t, this.type, this.Tt, this.At);
         return new vn(t.firestore, t.converter, function(t, e) {
             return new ye(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
@@ -5006,7 +5006,7 @@ function br() {
                 var f = new it(l);
                 u.push(Qt(e, f));
             } else {
-                var h = Kn(n, r, c);
+                var h = Gn(n, r, c);
                 u.push(h);
             }
         }
@@ -5034,7 +5034,7 @@ function Tr(t, e, n) {
     if (t.length > 10) throw new B(D, "Invalid Query. '" + e.toString() + "' filters support a maximum of 10 elements in the value array.");
 }
 
-function Sr(t, e, n) {
+function kr(t, e, n) {
     if (!n.isEqual(e)) throw new B(D, "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.");
 }
 
@@ -5084,7 +5084,7 @@ function Sr(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 kr(t, e, n) {
+ */ function Sr(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
@@ -5097,7 +5097,7 @@ var Ir = /** @class */ function(e) {
         return (n = e.call(this) || this).firestore = t, n;
     }
     return t(n, e), n.prototype.convertBytes = function(t) {
-        return new Sn(t);
+        return new kn(t);
     }, n.prototype.convertReference = function(t) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
         return new mn(this.firestore, /* converter= */ null, e);
@@ -5140,11 +5140,11 @@ var Ir = /** @class */ function(e) {
             return this.convertObject(t.mapValue, e);
 
           default:
-            throw k();
+            throw S();
         }
     }, t.prototype.convertObject = function(t, e) {
         var n = this, r = {};
-        return kt(t.fields, (function(t, i) {
+        return St(t.fields, (function(t, i) {
             r[t] = n.convertValue(i, e);
         })), r;
     }, t.prototype.convertGeoPoint = function(t) {
@@ -5256,7 +5256,7 @@ var Ir = /** @class */ function(e) {
 }
 
 function Pr(t, e, n) {
-    var r = kr((t = ct(t, mn)).converter, e, n), i = Ln(qn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    var r = Sr((t = ct(t, mn)).converter, e, n), i = Ln(qn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
     return nn(an(t.firestore), [ i.toMutation(t._key, Ve.none()) ]);
 }
 
@@ -5265,7 +5265,7 @@ function Dr(t, e, n) {
     var o, a = qn((t = ct(t, mn)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-        return o = "string" == typeof (e = p(e)) || e instanceof kn ? Gn(a, "updateDoc", t._key, e, n, r) : zn(a, "updateDoc", t._key, e), 
+        return o = "string" == typeof (e = p(e)) || e instanceof Sn ? Kn(a, "updateDoc", t._key, e, n, r) : zn(a, "updateDoc", t._key, e), 
     nn(an(t.firestore), [ o.toMutation(t._key, Ve.exists(!0)) ]);
 }
 
@@ -5280,7 +5280,7 @@ function Dr(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 Or(t) {
+ */ function Fr(t) {
     return nn(an((t = ct(t, mn)).firestore), [ new Ne(t._key, Ve.none()) ]);
 }
 
@@ -5299,7 +5299,7 @@ function Dr(t, e, n) {
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
  */ function Nr(t, e) {
-    var n = _n(t = ct(t, gn)), r = kr(t.converter, e), i = Ln(qn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    var n = _n(t = ct(t, gn)), r = Sr(t.converter, e), i = Ln(qn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
     return nn(an(t.firestore), [ i.toMutation(n._key, Ve.exists(!1)) ]).then((function() {
         return n;
     }));
@@ -5334,7 +5334,7 @@ function Dr(t, e, n) {
  * @returns A Promise that will be resolved with the count; the count can be
  * retrieved from `snapshot.data().count`, where `snapshot` is the
  * `AggregateQuerySnapshot` to which the returned Promise resolves.
- */ function Fr(t) {
+ */ function Or(t) {
     var e = ct(t.firestore, sn), n = an(e), r = new Ir(e);
     return new yn(t, n, r).run();
 }
@@ -5472,7 +5472,7 @@ function Dr(t, e, n) {
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = Ur(t, this._firestore), i = kr(r.converter, e, n), o = Ln(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
+        var r = Ur(t, this._firestore), i = Sr(r.converter, e, n), o = Ln(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
         return this._mutations.push(o.toMutation(r._key, Ve.none())), this;
     }, t.prototype.update = function(t, e, n) {
         for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
@@ -5480,7 +5480,7 @@ function Dr(t, e, n) {
         var o, a = Ur(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = p(e)) || e instanceof kn ? Gn(this._dataReader, "WriteBatch.update", a._key, e, n, r) : zn(this._dataReader, "WriteBatch.update", a._key, e), 
+                return o = "string" == typeof (e = p(e)) || e instanceof Sn ? Kn(this._dataReader, "WriteBatch.update", a._key, e, n, r) : zn(this._dataReader, "WriteBatch.update", a._key, e), 
         this._mutations.push(o.toMutation(a._key, Ve.exists(!0))), this;
     }, 
     /**
@@ -5617,7 +5617,7 @@ function Ur(t, e) {
                     // a `verify` operation.
                     t.forEach((function(t, n) {
                         var r = it.fromPath(n);
-                        e.mutations.push(new Fe(r, e.precondition(r)));
+                        e.mutations.push(new Oe(r, e.precondition(r)));
                     })), [ 4 /*yield*/ , nn(this.datastore, this.mutations) ];
 
                   case 1:
@@ -5629,7 +5629,7 @@ function Ur(t, e) {
     }, t.prototype.recordVersion = function(t) {
         var e;
         if (t.isFoundDocument()) e = t.version; else {
-            if (!t.isNoDocument()) throw k();
+            if (!t.isNoDocument()) throw S();
             // Represent a deleted doc using SnapshotVersion.min().
                         e = Et.min();
         }
@@ -5676,37 +5676,37 @@ function Ur(t, e) {
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), Gr = {
+}(), Kr = {
     maxAttempts: 5
-}, Kr = /** @class */ function() {
+}, Gr = /** @class */ function() {
     function t(t, e, n, r, i) {
         this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
-        this.deferred = i, this.Pt = n.maxAttempts, this.Vt = new tn(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
+        this.deferred = i, this.Rt = n.maxAttempts, this.Pt = new tn(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.run = function() {
-        this.Pt -= 1, this.Nt();
-    }, t.prototype.Nt = function() {
+        this.Rt -= 1, this.Vt();
+    }, t.prototype.Vt = function() {
         var t = this;
-        this.Vt.J((function() {
+        this.Pt.J((function() {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new zr(this.datastore), (e = this.Dt(t)) && e.then((function(e) {
+                    return t = new zr(this.datastore), (e = this.Nt(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
                             })).catch((function(t) {
-                                r.$t(t);
+                                r.Dt(t);
                             }));
                         }));
                     })).catch((function(t) {
-                        r.$t(t);
+                        r.Dt(t);
                     })), [ 2 /*return*/ ];
                 }));
             }));
         }));
-    }, t.prototype.Dt = function(t) {
+    }, t.prototype.Nt = function(t) {
         try {
             var e = this.updateFunction(t);
             return !ft(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
@@ -5715,12 +5715,12 @@ function Ur(t, e) {
             // Do not retry errors thrown by user provided updateFunction.
             return this.deferred.reject(t), null;
         }
-    }, t.prototype.$t = function(t) {
+    }, t.prototype.Dt = function(t) {
         var e = this;
-        this.Pt > 0 && this.xt(t) ? (this.Pt -= 1, this.asyncQueue.enqueueAndForget((function() {
-            return e.Nt(), Promise.resolve();
+        this.Rt > 0 && this.$t(t) ? (this.Rt -= 1, this.asyncQueue.enqueueAndForget((function() {
+            return e.Vt(), Promise.resolve();
         }))) : this.deferred.reject(t);
-    }, t.prototype.xt = function(t) {
+    }, t.prototype.$t = 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.
@@ -5735,11 +5735,11 @@ function Ur(t, e) {
             function(t) {
                 switch (t) {
                   default:
-                    return k();
+                    return S();
 
                   case V:
                   case P:
-                  case O:
+                  case F:
                   case q:
                   case M:
                   case U:
@@ -5751,7 +5751,7 @@ function Ur(t, e) {
                   case D:
                   case N:
                   case "already-exists":
-                  case F:
+                  case O:
                   case L:
  // Aborted might be retried in some scenarios, but that is dependant on
                     // the context and should handled individually by the calling code.
@@ -5900,40 +5900,40 @@ function Ur(t, e) {
     function t() {
         var t = this;
         // The last promise in the queue.
-                this.Ft = Promise.resolve(), 
+                this.xt = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.St = [], 
+        this.Ft = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.qt = !1, 
+        this.St = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.Ot = [], 
+        this.qt = [], 
         // visible for testing
-        this.kt = null, 
+        this.Ot = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.Ct = !1, 
+        this.kt = !1, 
         // Enabled during shutdown on Safari to prevent future access to IndexedDB.
-        this.Lt = !1, 
+        this.Ct = !1, 
         // List of TimerIds to fast-forward delays for.
-        this.Mt = [], 
+        this.Lt = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.Vt = new tn(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.Pt = new tn(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.Ut = function() {
+        this.Mt = function() {
             var e = Qr();
-            e && _("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.Vt.Z();
+            e && _("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.Pt.Z();
         };
         var e = Qr();
-        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Ut);
+        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Mt);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
         get: function() {
-            return this.qt;
+            return this.St;
         },
         enumerable: !1,
         configurable: !0
@@ -5946,53 +5946,53 @@ function Ur(t, e) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
         this.enqueue(t);
     }, t.prototype.enqueueAndForgetEvenWhileRestricted = function(t) {
-        this.jt(), 
+        this.Ut(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.Bt(t);
+        this.jt(t);
     }, t.prototype.enterRestrictedMode = function(t) {
-        if (!this.qt) {
-            this.qt = !0, this.Lt = t || !1;
+        if (!this.St) {
+            this.St = !0, this.Ct = t || !1;
             var e = Qr();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ut);
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Mt);
         }
     }, t.prototype.enqueue = function(t) {
         var e = this;
-        if (this.jt(), this.qt) 
+        if (this.Ut(), this.St) 
         // 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 z;
-        return this.Bt((function() {
-            return e.qt && e.Lt ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
+        return this.jt((function() {
+            return e.St && e.Ct ? 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.St.push(t), e.Qt();
+            return e.Ft.push(t), e.Bt();
         }));
     }, 
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
      */
-    t.prototype.Qt = function() {
+    t.prototype.Bt = 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.St.length) return [ 3 /*break*/ , 5 ];
+                    if (0 === this.Ft.length) return [ 3 /*break*/ , 5 ];
                     n.label = 1;
 
                   case 1:
-                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.St[0]() ];
+                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.Ft[0]() ];
 
                   case 2:
-                    return n.sent(), this.St.shift(), this.Vt.reset(), [ 3 /*break*/ , 4 ];
+                    return n.sent(), this.Ft.shift(), this.Pt.reset(), [ 3 /*break*/ , 4 ];
 
                   case 3:
                     if (t = n.sent(), "IndexedDbTransactionError" !== t.name) throw t;
@@ -6001,7 +6001,7 @@ function Ur(t, e) {
                     [ 3 /*break*/ , 4 ];
 
                   case 4:
-                    this.St.length > 0 && 
+                    this.Ft.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
@@ -6012,8 +6012,8 @@ function Ur(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.Vt.J((function() {
-                        return e.Qt();
+                    this.Pt.J((function() {
+                        return e.Bt();
                     })), n.label = 5;
 
                   case 5:
@@ -6021,10 +6021,10 @@ function Ur(t, e) {
                 }
             }));
         }));
-    }, t.prototype.Bt = function(t) {
-        var e = this, n = this.Ft.then((function() {
-            return e.Ct = !0, t().catch((function(t) {
-                e.kt = t, e.Ct = !1;
+    }, t.prototype.jt = function(t) {
+        var e = this, n = this.xt.then((function() {
+            return e.kt = !0, t().catch((function(t) {
+                e.Ot = t, e.kt = !1;
                 var n = 
                 /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -6041,39 +6041,39 @@ function Ur(t, e) {
                 // and return the rejected Promise.
                                 throw T("INTERNAL UNHANDLED ERROR: ", n), t;
             })).then((function(t) {
-                return e.Ct = !1, t;
+                return e.kt = !1, t;
             }));
         }));
-        return this.Ft = n, n;
+        return this.xt = n, n;
     }, t.prototype.enqueueAfterDelay = function(t, e, n) {
         var r = this;
-        this.jt(), 
+        this.Ut(), 
         // Fast-forward delays for timerIds that have been overriden.
-        this.Mt.indexOf(t) > -1 && (e = 0);
+        this.Lt.indexOf(t) > -1 && (e = 0);
         var i = Wr.createAndSchedule(this, t, e, n, (function(t) {
-            return r.zt(t);
+            return r.Qt(t);
         }));
-        return this.Ot.push(i), i;
-    }, t.prototype.jt = function() {
-        this.kt && k();
+        return this.qt.push(i), i;
+    }, t.prototype.Ut = function() {
+        this.Ot && S();
     }, t.prototype.verifyOperationInProgress = function() {}, 
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
      */
-    t.prototype.Gt = function() {
+    t.prototype.zt = 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.Ft ];
+                    return [ 4 /*yield*/ , t = this.xt ];
 
                   case 1:
                     e.sent(), e.label = 2;
 
                   case 2:
-                    if (t !== this.Ft) return [ 3 /*break*/ , 0 ];
+                    if (t !== this.xt) return [ 3 /*break*/ , 0 ];
                     e.label = 3;
 
                   case 3:
@@ -6086,8 +6086,8 @@ function Ur(t, e) {
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
      */
-    t.prototype.Wt = function(t) {
-        for (var e = 0, n = this.Ot; e < n.length; e++) {
+    t.prototype.Gt = function(t) {
+        for (var e = 0, n = this.qt; e < n.length; e++) {
             if (n[e].timerId === t) return !0;
         }
         return !1;
@@ -6099,31 +6099,31 @@ function Ur(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.Kt = function(t) {
+    t.prototype.Wt = function(t) {
         var e = this;
         // Note that draining may generate more delayed ops, so we do that first.
-                return this.Gt().then((function() {
+                return this.zt().then((function() {
             // Run ops in the same order they'd run if they ran naturally.
-            e.Ot.sort((function(t, e) {
+            e.qt.sort((function(t, e) {
                 return t.targetTimeMs - e.targetTimeMs;
             }));
-            for (var n = 0, r = e.Ot; n < r.length; n++) {
+            for (var n = 0, r = e.qt; n < r.length; n++) {
                 var i = r[n];
                 if (i.skipDelay(), "all" /* All */ !== t && i.timerId === t) break;
             }
-            return e.Gt();
+            return e.zt();
         }));
     }, 
     /**
      * For Tests: Skip all subsequent delays for a timer id.
      */
-    t.prototype.Yt = function(t) {
-        this.Mt.push(t);
+    t.prototype.Kt = function(t) {
+        this.Lt.push(t);
     }, 
-    /** Called once a DelayedOperation is run or canceled. */ t.prototype.zt = function(t) {
+    /** Called once a DelayedOperation is run or canceled. */ t.prototype.Qt = function(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        var e = this.Ot.indexOf(t);
-        this.Ot.splice(e, 1);
+        var e = this.qt.indexOf(t);
+        this.qt.splice(e, 1);
     }, t;
 }(), Hr = /** @class */ function() {
     /** @hideconstructor */
@@ -6139,21 +6139,21 @@ function Ur(t, e) {
     return t.prototype.get = function(t) {
         var e = this, n = Ur(t, this._firestore), r = new Ir(this._firestore);
         return this._transaction.lookup([ n._key ]).then((function(t) {
-            if (!t || 1 !== t.length) return k();
+            if (!t || 1 !== t.length) return S();
             var i = t[0];
             if (i.isFoundDocument()) return new er(e._firestore, r, i.key, i, n.converter);
             if (i.isNoDocument()) return new er(e._firestore, r, n._key, null, n.converter);
-            throw k();
+            throw S();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = Ur(t, this._firestore), i = kr(r.converter, e, n), o = Ln(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
+        var r = Ur(t, this._firestore), i = Sr(r.converter, e, n), o = Ln(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 = Ur(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = p(e)) || e instanceof kn ? Gn(this._dataReader, "Transaction.update", a._key, e, n, r) : zn(this._dataReader, "Transaction.update", a._key, e), 
+                return o = "string" == typeof (e = p(e)) || e instanceof Sn ? Kn(this._dataReader, "Transaction.update", a._key, e, n, r) : zn(this._dataReader, "Transaction.update", a._key, e), 
         this._transaction.update(a._key, o), this;
     }, 
     /**
@@ -6204,12 +6204,12 @@ function Ur(t, e) {
  * rejected promise with the corresponding failure error is returned.
  */
 function Xr(t, e, n) {
-    var r = an(t = ct(t, sn)), i = Object.assign(Object.assign({}, Gr), n);
+    var r = an(t = ct(t, sn)), i = Object.assign(Object.assign({}, Kr), n);
     !function(t) {
         if (t.maxAttempts < 1) throw new B(D, "Max attempts must be at least 1");
     }(i);
     var o = new z;
-    return new Kr(new Yr, r, i, (function(n) {
+    return new Gr(new Yr, r, i, (function(n) {
         return e(new Hr(t, n));
     }), o).run(), o.promise
     /**
@@ -6230,7 +6230,7 @@ g = i + "_lite", o(new c("firestore/lite", (function(t, e) {
     return r && o._setSettings(r), o;
 }), "PUBLIC").setMultipleInstances(!0)), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-a("firestore-lite", "3.7.1", ""), a("firestore-lite", "3.7.1", "esm5");
+a("firestore-lite", "3.7.2", ""), a("firestore-lite", "3.7.2", "esm5");
 
-export { pn as AggregateField, dn as AggregateQuerySnapshot, Sn as Bytes, gn as CollectionReference, mn as DocumentReference, er as DocumentSnapshot, kn as FieldPath, An as FieldValue, sn as Firestore, B as FirestoreError, Vn as GeoPoint, vn as Query, ar as QueryConstraint, nr as QueryDocumentSnapshot, rr as QuerySnapshot, Tt as Timestamp, Hr as Transaction, Mr as WriteBatch, Nr as addDoc, Rr as aggregateQuerySnapshotEqual, Cr as arrayRemove, xr as arrayUnion, wn as collection, bn as collectionGroup, fn as connectFirestoreEmulator, Or as deleteDoc, qr as deleteField, _n as doc, In as documentId, br as endAt, wr as endBefore, Fr as getCount, Ar as getDoc, Vr as getDocs, ln as getFirestore, jr as increment, cn as initializeFirestore, pr as limit, dr as limitToLast, fr as orderBy, ur as query, En as queryEqual, Tn as refEqual, Xr as runTransaction, Lr as serverTimestamp, Pr as setDoc, b as setLogLevel, ir as snapshotEqual, vr as startAfter, mr as startAt, hn as terminate, Dr as updateDoc, cr as where, Br as writeBatch };
+export { pn as AggregateField, dn as AggregateQuerySnapshot, kn as Bytes, gn as CollectionReference, mn as DocumentReference, er as DocumentSnapshot, Sn as FieldPath, An as FieldValue, sn as Firestore, B as FirestoreError, Vn as GeoPoint, vn as Query, ar as QueryConstraint, nr as QueryDocumentSnapshot, rr as QuerySnapshot, Tt as Timestamp, Hr as Transaction, Mr as WriteBatch, Nr as addDoc, Rr as aggregateQuerySnapshotEqual, Cr as arrayRemove, xr as arrayUnion, wn as collection, bn as collectionGroup, fn as connectFirestoreEmulator, Fr as deleteDoc, qr as deleteField, _n as doc, In as documentId, br as endAt, wr as endBefore, Or as getCount, Ar as getDoc, Vr as getDocs, ln as getFirestore, jr as increment, cn as initializeFirestore, pr as limit, dr as limitToLast, fr as orderBy, ur as query, En as queryEqual, Tn as refEqual, Xr as runTransaction, Lr as serverTimestamp, Pr as setDoc, b as setLogLevel, ir as snapshotEqual, vr as startAfter, mr as startAt, hn as terminate, Dr as updateDoc, cr as where, Br as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map