@firebase/firestore 3.4.7 → 3.4.8-canary.44948ac91

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

@@ -67,7 +67,7 @@ m.MOCK_USER = new m("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var y = "9.6.10", v = new l("@firebase/firestore");
+var y = "9.6.11-canary.44948ac91", v = new l("@firebase/firestore");
 
 /**
  * @license
@@ -2102,14 +2102,10 @@ function(t, e, n, r, i, o /* First */ , a, s) {
 };
 
 /** Creates a new Query for a query that matches all documents at `path` */ function ue(t) {
-    return !ct(t.limit) && "L" /* Last */ === t.limitType;
-}
-
-function ce(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function le(t) {
+function ce(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
         var r = n[e];
         if (r.N()) return r.field;
@@ -2124,7 +2120,7 @@ function le(t) {
 /**
  * Returns whether the query matches a collection group rather than a specific
  * collection.
- */ function fe(t) {
+ */ function le(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2132,11 +2128,11 @@ function le(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 he(t) {
+ */ function fe(t) {
     var e = I(t);
     if (null === e.$) {
         e.$ = [];
-        var n = le(e), r = ce(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.
@@ -2159,17 +2155,17 @@ function le(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function pe(t) {
+ */ function he(t) {
     var e = I(t);
-    if (!e.S) if ("F" /* First */ === e.limitType) e.S = Ht(e.path, e.collectionGroup, he(e), e.filters, e.limit, e.startAt, e.endAt); else {
+    if (!e.S) if ("F" /* First */ === e.limitType) e.S = Ht(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 = he(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 ie(o.field, a));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                var s = e.endAt ? new re(e.endAt.position, !e.endAt.inclusive) : null, u = e.startAt ? new re(e.startAt.position, !e.startAt.inclusive) : null;
+                var s = e.endAt ? new re(e.endAt.position, e.endAt.inclusive) : null, u = e.startAt ? new re(e.startAt.position, e.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
                 e.S = Ht(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
     }
@@ -2201,7 +2197,7 @@ function le(t) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function de(t, e) {
+function pe(t, e) {
     return function(t) {
         return "number" == typeof t && Number.isInteger(t) && !lt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
@@ -2246,36 +2242,36 @@ function de(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 me = 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;
-}, ye = /** @class */ function(e) {
+}, me = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(me), ve = /** @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;
-}(me), ge = /** @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;
-}(me), we = /** @class */ function(e) {
+}(de), ge = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).q = t, r.O = n, r;
     }
     return t(n, e), n;
-}(me), be = function(t, e) {
+}(de), we = function(t, e) {
     this.field = t, this.transform = e;
-}, _e = /** @class */ function() {
+}, be = /** @class */ function() {
     function t(t, e) {
         this.updateTime = t, this.exists = e
         /** Creates a new empty Precondition. */;
@@ -2297,7 +2293,7 @@ function de(t, e) {
     }), t.prototype.isEqual = function(t) {
         return this.exists === t.exists && (this.updateTime ? !!t.updateTime && this.updateTime.isEqual(t.updateTime) : !t.updateTime);
     }, t;
-}(), Te = function() {}, Se = /** @class */ function(e) {
+}(), _e = function() {}, Te = /** @class */ function(e) {
     function n(t, n, r, i) {
         void 0 === i && (i = []);
         var o = this;
@@ -2305,7 +2301,7 @@ function de(t, e) {
         o.type = 0 /* Set */ , o;
     }
     return t(n, e), n;
-}(Te), Ee = /** @class */ function(e) {
+}(_e), Se = /** @class */ function(e) {
     function n(t, n, r, i, o) {
         void 0 === o && (o = []);
         var a = this;
@@ -2313,24 +2309,24 @@ function de(t, e) {
         a.fieldTransforms = o, a.type = 1 /* Patch */ , a;
     }
     return t(n, e), n;
-}(Te), Ie = /** @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;
-}(Te), Ae = /** @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;
-}(Te), ke = {
+}(_e), Ae = {
     asc: "ASCENDING",
     desc: "DESCENDING"
-}, Ve = {
+}, ke = {
     "<": "LESS_THAN",
     "<=": "LESS_THAN_OR_EQUAL",
     ">": "GREATER_THAN",
@@ -2341,7 +2337,7 @@ function de(t, e) {
     in: "IN",
     "not-in": "NOT_IN",
     "array-contains-any": "ARRAY_CONTAINS_ANY"
-}, De = function(t, e) {
+}, Ve = function(t, e) {
     this.databaseId = t, this.F = e;
 };
 
@@ -2357,7 +2353,7 @@ function de(t, e) {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Pe(t, e) {
+function De(t, e) {
     return t.F ? new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "") + "." + ("000000000" + e.nanoseconds).slice(-9) + "Z" : {
         seconds: "" + e.seconds,
         nanos: e.nanoseconds
@@ -2368,72 +2364,72 @@ function Pe(t, e) {
  * Returns a value for bytes that's appropriate to put in a proto.
  *
  * Visible for testing.
- */ function Ne(t, e) {
+ */ function Pe(t, e) {
     return t.F ? e.toBase64() : e.toUint8Array();
 }
 
-function qe(t, e) {
-    return Pe(t, e.toTimestamp());
+function Ne(t, e) {
+    return De(t, e.toTimestamp());
 }
 
-function Fe(t) {
+function qe(t) {
     return E(!!t), _t.fromTimestamp(function(t) {
         var e = kt(t);
         return new bt(e.seconds, e.nanos);
     }(t));
 }
 
-function Oe(t, e) {
+function Fe(t, e) {
     return function(t) {
         return new Z([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
-function Ce(t, e) {
-    return Oe(t.databaseId, e.path);
+function Oe(t, e) {
+    return Fe(t.databaseId, e.path);
 }
 
-function Le(t, e) {
+function Ce(t, e) {
     var n, r = function(t) {
         var e = Z.fromString(t);
-        return E(ze(e)), e;
+        return E(Ge(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 nt((E((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
 }
 
-function je(t, e) {
-    return Oe(t.databaseId, e);
+function Le(t, e) {
+    return Fe(t.databaseId, e);
 }
 
-function Re(t) {
+function je(t) {
     return new Z([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Me(t, e, n) {
+function Re(t, e, n) {
     return {
-        name: Ce(t, e),
+        name: Oe(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function xe(t) {
-    return ke[t];
+function Me(t) {
+    return Ae[t];
 }
 
 // visible for testing
-function Ue(t) {
-    return Ve[t];
+function xe(t) {
+    return ke[t];
 }
 
-function Be(t) {
+function Ue(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Ge(t) {
+function Be(t) {
     var e = [];
     return t.fields.forEach((function(t) {
         return e.push(t.canonicalString());
@@ -2442,7 +2438,7 @@ function Ge(t) {
     };
 }
 
-function ze(t) {
+function Ge(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2462,8 +2458,8 @@ function ze(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 Qe(t) {
-    return new De(t, /* useProto3Json= */ !0);
+ */ function ze(t) {
+    return new Ve(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -2490,7 +2486,7 @@ function ze(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 Ke = /** @class */ function() {
+ */ var Qe = /** @class */ function() {
     function t(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -2564,7 +2560,7 @@ function ze(t) {
     /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.Y = function() {
         return (Math.random() - .5) * this.j;
     }, t;
-}(), He = /** @class */ function(e) {
+}(), Ke = /** @class */ function(e) {
     function n(t, n, r, i) {
         var o = this;
         return (o = e.call(this) || this).authCredentials = t, o.appCheckCredentials = n, 
@@ -2624,49 +2620,49 @@ function ze(t) {
  */
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-function We(t, r) {
+function He(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = I(t), i = Re(e.q) + "/documents", o = {
+                return e = I(t), i = je(e.q) + "/documents", o = {
                     writes: r.map((function(t) {
                         return function(t, e) {
                             var n;
-                            if (e instanceof Se) n = {
-                                update: Me(t, e.key, e.value)
-                            }; else if (e instanceof Ie) n = {
-                                delete: Ce(t, e.key)
+                            if (e instanceof Te) n = {
+                                update: Re(t, e.key, e.value)
                             }; else if (e instanceof Ee) n = {
-                                update: Me(t, e.key, e.data),
-                                updateMask: Ge(e.fieldMask)
+                                delete: Oe(t, e.key)
+                            }; else if (e instanceof Se) n = {
+                                update: Re(t, e.key, e.data),
+                                updateMask: Be(e.fieldMask)
                             }; else {
-                                if (!(e instanceof Ae)) return S();
+                                if (!(e instanceof Ie)) return S();
                                 n = {
-                                    verify: Ce(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 ye) return {
+                                    if (n instanceof me) return {
                                         fieldPath: e.field.canonicalString(),
                                         setToServerValue: "REQUEST_TIME"
                                     };
-                                    if (n instanceof ve) return {
+                                    if (n instanceof ye) return {
                                         fieldPath: e.field.canonicalString(),
                                         appendMissingElements: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof ge) return {
+                                    if (n instanceof ve) return {
                                         fieldPath: e.field.canonicalString(),
                                         removeAllFromArray: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof we) return {
+                                    if (n instanceof ge) return {
                                         fieldPath: e.field.canonicalString(),
                                         increment: n.O
                                     };
@@ -2674,7 +2670,7 @@ function We(t, r) {
                                 }(0, t);
                             }))), e.precondition.isNone || (n.currentDocument = function(t, e) {
                                 return void 0 !== e.updateTime ? {
-                                    updateTime: qe(t, e.updateTime)
+                                    updateTime: Ne(t, e.updateTime)
                                 } : void 0 !== e.exists ? {
                                     exists: e.exists
                                 } : S();
@@ -2690,15 +2686,15 @@ function We(t, r) {
     }));
 }
 
-function Ye(t, r) {
+function We(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 = I(t), i = Re(e.q) + "/documents", o = {
+                return e = I(t), i = je(e.q) + "/documents", o = {
                     documents: r.map((function(t) {
-                        return Ce(e.q, t);
+                        return Oe(e.q, t);
                     }))
                 }, [ 4 /*yield*/ , e.T("BatchGetDocuments", i, o) ];
 
@@ -2707,7 +2703,7 @@ function Ye(t, r) {
                     var n = function(t, e) {
                         return "found" in e ? function(t, e) {
                             E(!!e.found), e.found.name, e.found.updateTime;
-                            var n = Le(t, e.found.name), r = Fe(e.found.updateTime), i = new zt({
+                            var n = Ce(t, e.found.name), r = qe(e.found.updateTime), i = new zt({
                                 mapValue: {
                                     fields: e.found.fields
                                 }
@@ -2715,7 +2711,7 @@ function Ye(t, r) {
                             return Qt.newFoundDocument(n, r, i);
                         }(t, e) : "missing" in e ? function(t, e) {
                             E(!!e.missing), E(!!e.readTime);
-                            var n = Le(t, e.missing), r = Fe(e.readTime);
+                            var n = Ce(t, e.missing), r = qe(e.readTime);
                             return Qt.newNoDocument(n, r);
                         }(t, e) : S();
                     }(e.q, t);
@@ -2729,7 +2725,7 @@ function Ye(t, r) {
     }));
 }
 
-function $e(t, r) {
+function Ye(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i;
         return n(this, (function(n) {
@@ -2740,10 +2736,10 @@ function $e(t, r) {
                     var n = {
                         structuredQuery: {}
                     }, r = e.path;
-                    null !== e.collectionGroup ? (n.parent = je(t, r), n.structuredQuery.from = [ {
+                    null !== e.collectionGroup ? (n.parent = Le(t, r), n.structuredQuery.from = [ {
                         collectionId: e.collectionGroup,
                         allDescendants: !0
-                    } ]) : (n.parent = je(t, r.popLast()), n.structuredQuery.from = [ {
+                    } ]) : (n.parent = Le(t, r.popLast()), n.structuredQuery.from = [ {
                         collectionId: r.lastSegment()
                     } ]);
                     var i = function(t) {
@@ -2754,34 +2750,34 @@ function $e(t, r) {
                                     if ("==" /* EQUAL */ === t.op) {
                                         if (Ut(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: Ue(t.field),
                                                 op: "IS_NAN"
                                             }
                                         };
                                         if (xt(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: Ue(t.field),
                                                 op: "IS_NULL"
                                             }
                                         };
                                     } else if ("!=" /* NOT_EQUAL */ === t.op) {
                                         if (Ut(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: Ue(t.field),
                                                 op: "IS_NOT_NAN"
                                             }
                                         };
                                         if (xt(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: Ue(t.field),
                                                 op: "IS_NOT_NULL"
                                             }
                                         };
                                     }
                                     return {
                                         fieldFilter: {
-                                            field: Be(t.field),
-                                            op: Ue(t.op),
+                                            field: Ue(t.field),
+                                            op: xe(t.op),
                                             value: t.value
                                         }
                                     };
@@ -2801,8 +2797,8 @@ function $e(t, r) {
                             // visible for testing
                             return function(t) {
                                 return {
-                                    field: Be(t.field),
-                                    direction: xe(t.dir)
+                                    field: Ue(t.field),
+                                    direction: Me(t.dir)
                                 };
                             }(t);
                         }));
@@ -2822,7 +2818,7 @@ function $e(t, r) {
                             values: t.position
                         };
                     }(e.endAt)), n;
-                }(e.q, pe(r)), [ 4 /*yield*/ , e.T("RunQuery", i.parent, {
+                }(e.q, he(r)), [ 4 /*yield*/ , e.T("RunQuery", i.parent, {
                     structuredQuery: i.structuredQuery
                 }) ];
 
@@ -2831,7 +2827,7 @@ function $e(t, r) {
                     return !!t.document;
                 })).map((function(t) {
                     return function(t, e, n) {
-                        var r = Le(t, e.name), i = Fe(e.updateTime), o = new zt({
+                        var r = Ce(t, e.name), i = qe(e.updateTime), o = new zt({
                             mapValue: {
                                 fields: e.fields
                             }
@@ -2859,7 +2855,7 @@ function $e(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 Xe = new Map;
+ */ var $e = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -2869,17 +2865,17 @@ function $e(t, r) {
  * Returns an initialized and started Datastore for the given Firestore
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
- */ function Je(t) {
+ */ function Xe(t) {
     if (t._terminated) throw new x(O, "The client has already been terminated.");
-    if (!Xe.has(t)) {
+    if (!$e.has(t)) {
         w("ComponentProvider", "Initializing Datastore");
         var e = function(t) {
             return new mt(t, fetch.bind(null));
         }((i = t._databaseId, o = t.app.options.appId || "", a = t._persistenceKey, s = t._freezeSettings(), 
-        new $(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);
+        new $(i, o, a, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), n = ze(t._databaseId), r = function(t, e, n, r) {
+            return new Ke(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, e, n);
-        Xe.set(t, r);
+        $e.set(t, r);
     }
     var i, o, a, s;
     /**
@@ -2897,7 +2893,7 @@ function $e(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 Xe.get(t);
+ */    return $e.get(t);
 }
 
 /**
@@ -2908,7 +2904,7 @@ function $e(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 Ze = /** @class */ function() {
+ */ var Je = /** @class */ function() {
     function t(t) {
         var e;
         if (void 0 === t.host) {
@@ -2928,14 +2924,14 @@ function $e(t, r) {
     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;
-}(), tn = /** @class */ function() {
+}(), Ze = /** @class */ function() {
     /** @hideconstructor */
     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 Ze({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new Je({}), 
         this._settingsFrozen = !1, t instanceof X ? 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.');
@@ -2967,7 +2963,7 @@ function $e(t, r) {
         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 Ze(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new Je(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new G;
             switch (t.type) {
               case "gapi":
@@ -3005,8 +3001,8 @@ function $e(t, r) {
      * Only ever called once.
      */
     t.prototype._terminate = function() {
-        return t = this, (e = Xe.get(t)) && (w("ComponentProvider", "Removing Datastore"), 
-        Xe.delete(t), e.terminate()), Promise.resolve();
+        return t = this, (e = $e.get(t)) && (w("ComponentProvider", "Removing Datastore"), 
+        $e.delete(t), e.terminate()), Promise.resolve();
         var t, e;
     }, t;
 }();
@@ -3031,7 +3027,7 @@ function $e(t, r) {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ function en(t, e) {
+ */ function tn(t, e) {
     var n = _getProvider(t, "firestore/lite");
     if (n.isInitialized()) throw new x(O, "Firestore can only be initialized once per app.");
     return n.initialize({
@@ -3047,7 +3043,7 @@ function $e(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 nn(t) {
+ */ function en(t) {
     return void 0 === t && (t = s()), _getProvider(t, "firestore/lite").getImmediate();
 }
 
@@ -3063,10 +3059,10 @@ function $e(t, r) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function rn(t, e, n, r) {
+ */ function nn(t, e, n, r) {
     var i;
     void 0 === r && (r = {});
-    var o = (t = st(t, tn))._getSettings();
+    var o = (t = st(t, Ze))._getSettings();
     if ("firestore.googleapis.com" !== o.host && o.host !== e && _("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, o), {
         host: e + ":" + n,
@@ -3104,8 +3100,8 @@ function $e(t, r) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function on(t) {
-    return t = st(t, tn), u(t.app, "firestore/lite"), t._delete()
+ */ function rn(t) {
+    return t = st(t, Ze), u(t.app, "firestore/lite"), t._delete()
     /**
  * @license
  * Copyright 2020 Google LLC
@@ -3145,7 +3141,7 @@ function $e(t, r) {
  */;
 }
 
-var an = /** @class */ function() {
+var on = /** @class */ function() {
     /** @hideconstructor */
     function t(t, 
     /**
@@ -3186,14 +3182,14 @@ var an = /** @class */ function() {
          * The collection this `DocumentReference` belongs to.
          */
         get: function() {
-            return new un(this.firestore, this.converter, this._key.path.popLast());
+            return new sn(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;
-}(), sn = /** @class */ function() {
+}(), an = /** @class */ function() {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     function t(t, 
@@ -3208,7 +3204,7 @@ var an = /** @class */ function() {
     return t.prototype.withConverter = function(e) {
         return new t(this.firestore, e, this._query);
     }, t;
-}(), un = /** @class */ function(e) {
+}(), sn = /** @class */ function(e) {
     /** @hideconstructor */
     function n(t, n, r) {
         var i = this;
@@ -3239,7 +3235,7 @@ var an = /** @class */ function() {
          */
         get: function() {
             var t = this._path.popLast();
-            return t.isEmpty() ? null : new an(this.firestore, 
+            return t.isEmpty() ? null : new on(this.firestore, 
             /* converter= */ null, new nt(t));
         },
         enumerable: !1,
@@ -3247,20 +3243,20 @@ var an = /** @class */ function() {
     }), n.prototype.withConverter = function(t) {
         return new n(this.firestore, t, this._path);
     }, n;
-}(sn);
+}(an);
 
 /**
  * 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 cn(t, e) {
+ */ function un(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
-    if (t = p(t), rt("collection", "path", e), t instanceof tn) {
+    if (t = p(t), rt("collection", "path", e), t instanceof Ze) {
         var o = Z.fromString.apply(Z, r([ e ], n));
-        return ot(o), new un(t, /* converter= */ null, o);
+        return ot(o), new sn(t, /* converter= */ null, o);
     }
-    if (!(t instanceof an || t instanceof un)) throw new x(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    if (!(t instanceof on || t instanceof sn)) throw new x(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
     var a = t._path.child(Z.fromString.apply(Z, r([ e ], n)));
-    return ot(a), new un(t.firestore, 
+    return ot(a), new sn(t.firestore, 
     /* converter= */ null, a);
 }
 
@@ -3276,9 +3272,9 @@ var an = /** @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 ln(t, e) {
-    if (t = st(t, tn), rt("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 sn(t, 
+ */ function cn(t, e) {
+    if (t = st(t, Ze), rt("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 an(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
@@ -3289,19 +3285,19 @@ var an = /** @class */ function() {
     }(e));
 }
 
-function fn(t, e) {
+function ln(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
     if (t = p(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = vt.R()), rt("doc", "path", e), t instanceof tn) {
+    1 === arguments.length && (e = vt.R()), rt("doc", "path", e), t instanceof Ze) {
         var o = Z.fromString.apply(Z, r([ e ], n));
-        return it(o), new an(t, 
+        return it(o), new on(t, 
         /* converter= */ null, new nt(o));
     }
-    if (!(t instanceof an || t instanceof un)) throw new x(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    if (!(t instanceof on || t instanceof sn)) throw new x(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
     var a = t._path.child(Z.fromString.apply(Z, r([ e ], n)));
-    return it(a), new an(t.firestore, t instanceof un ? t.converter : null, new nt(a));
+    return it(a), new on(t.firestore, t instanceof sn ? t.converter : null, new nt(a));
 }
 
 /**
@@ -3311,8 +3307,8 @@ function fn(t, e) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function hn(t, e) {
-    return t = p(t), e = p(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
+ */ function fn(t, e) {
+    return t = p(t), e = p(e), (t instanceof on || t instanceof sn) && (e instanceof on || e instanceof sn) && 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.
@@ -3324,8 +3320,8 @@ function fn(t, e) {
  */;
 }
 
-function pn(t, e) {
-    return t = p(t), e = p(e), t instanceof sn && e instanceof sn && t.firestore === e.firestore && function(t, e) {
+function hn(t, e) {
+    return t = p(t), e = p(e), t instanceof an && e instanceof an && t.firestore === e.firestore && function(t, e) {
         return function(t, e) {
             if (t.limit !== e.limit) return !1;
             if (t.orderBy.length !== e.orderBy.length) return !1;
@@ -3335,7 +3331,7 @@ function pn(t, e) {
             i.op !== o.op || !i.field.isEqual(o.field) || !Ot(i.value, o.value)) return !1;
             var i, o;
             return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!ae(t.startAt, e.startAt) && ae(t.endAt, e.endAt);
-        }(pe(t), pe(e)) && t.limitType === e.limitType;
+        }(he(t), he(e)) && t.limitType === e.limitType;
     }(t._query, e._query) && t.converter === e.converter
     /**
  * @license
@@ -3363,7 +3359,7 @@ function pn(t, e) {
  */;
 }
 
-var dn = /** @class */ function() {
+var pn = /** @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.
@@ -3388,8 +3384,8 @@ var dn = /** @class */ function() {
 /**
  * Returns a special sentinel `FieldPath` to refer to the ID of a document.
  * It can be used in queries to sort or filter by the document ID.
- */ function mn() {
-    return new dn("__name__");
+ */ function dn() {
+    return new pn("__name__");
 }
 
 /**
@@ -3410,7 +3406,7 @@ var dn = /** @class */ function() {
  */
 /**
  * An immutable object representing an array of bytes.
- */ var yn = /** @class */ function() {
+ */ var mn = /** @class */ function() {
     /** @hideconstructor */
     function t(t) {
         this._byteString = t;
@@ -3468,14 +3464,14 @@ var dn = /** @class */ function() {
     t.prototype.isEqual = function(t) {
         return this._byteString.isEqual(t._byteString);
     }, t;
-}(), vn = 
+}(), yn = 
 /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
      */
 function(t) {
     this._methodName = t;
-}, gn = /** @class */ function() {
+}, vn = /** @class */ function() {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3528,21 +3524,21 @@ function(t) {
     t.prototype._compareTo = function(t) {
         return gt(this._lat, t._lat) || gt(this._long, t._long);
     }, t;
-}(), wn = /^__.*__$/, bn = /** @class */ function() {
+}(), gn = /^__.*__$/, wn = /** @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 Ee(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Se(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;
-}(), _n = /** @class */ function() {
+}(), bn = /** @class */ function() {
     function t(t, 
     // The fieldMask does not include document transforms.
     e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     return t.prototype.toMutation = function(t, e) {
-        return new Ee(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new Se(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }, t;
 }();
 
@@ -3565,7 +3561,7 @@ function(t) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ function Tn(t) {
+ */ function _n(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3583,7 +3579,7 @@ function(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ var Sn = /** @class */ function() {
+/** A "context" object passed around while parsing user data. */ var Tn = /** @class */ function() {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3643,7 +3639,7 @@ function(t) {
             rt: !0
         });
     }, t.prototype.ut = function(t) {
-        return Gn(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
+        return Bn(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) {
@@ -3657,15 +3653,15 @@ function(t) {
         if (this.path) for (var t = 0; t < this.path.length; t++) this.st(this.path.get(t));
     }, t.prototype.st = function(t) {
         if (0 === t.length) throw this.ut("Document fields must not be empty");
-        if (Tn(this.tt) && wn.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
+        if (_n(this.tt) && gn.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
     }, t;
-}(), En = /** @class */ function() {
+}(), Sn = /** @class */ function() {
     function t(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.q = n || Qe(t)
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.q = n || ze(t)
         /** Creates a new top-level parse context. */;
     }
     return t.prototype.ht = function(t, e, n, r) {
-        return void 0 === r && (r = !1), new Sn({
+        return void 0 === r && (r = !1), new Tn({
             tt: t,
             methodName: e,
             at: n,
@@ -3679,30 +3675,30 @@ function(t) {
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ function In(t) {
-    var e = t._freezeSettings(), n = Qe(t._databaseId);
-    return new En(t._databaseId, !!e.ignoreUndefinedProperties, n);
+ */ function En(t) {
+    var e = t._freezeSettings(), n = ze(t._databaseId);
+    return new Sn(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function An(t, e, n, r, i, o) {
+/** Parse document data from a set() call. */ function In(t, e, n, r, i, o) {
     void 0 === o && (o = {});
     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 = jn(r, a);
+    Rn("Data must be an object, but it was:", a, r);
+    var s, u, c = Ln(r, a);
     if (o.merge) s = new Et(a.fieldMask), u = 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);
+            var p = Mn(e, h[f], n);
             if (!a.contains(p)) throw new x(V, "Field '" + p + "' is specified in your field mask but missing from your input data.");
-            zn(l, p) || l.push(p);
+            Gn(l, p) || l.push(p);
         }
         s = new Et(l), u = a.fieldTransforms.filter((function(t) {
             return s.covers(t.field);
         }));
     } else s = null, u = a.fieldTransforms;
-    return new bn(new zt(c), s, u);
+    return new wn(new zt(c), s, u);
 }
 
-var kn = /** @class */ function(e) {
+var An = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -3714,7 +3710,7 @@ var kn = /** @class */ function(e) {
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(vn);
+}(yn);
 
 /**
  * Creates a child context for parsing SerializableFieldValues.
@@ -3731,8 +3727,8 @@ var kn = /** @class */ function(e) {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function Vn(t, e, n) {
-    return new Sn({
+ */ function kn(t, e, n) {
+    return new Tn({
         tt: 3 /* Argument */ ,
         at: e.settings.at,
         methodName: t._methodName,
@@ -3740,101 +3736,101 @@ var kn = /** @class */ function(e) {
     }, e.databaseId, e.q, e.ignoreUndefinedProperties);
 }
 
-var Dn = /** @class */ function(e) {
+var Vn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        return new be(t.path, new ye);
+        return new we(t.path, new me);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(vn), Pn = /** @class */ function(e) {
+}(yn), Dn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).lt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = Vn(this, t, 
+        var e = kn(this, t, 
         /*array=*/ !0), n = this.lt.map((function(t) {
-            return Ln(t, e);
-        })), r = new ve(n);
-        return new be(t.path, r);
+            return Cn(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;
-}(vn), Nn = /** @class */ function(e) {
+}(yn), Pn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).lt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = Vn(this, t, 
+        var e = kn(this, t, 
         /*array=*/ !0), n = this.lt.map((function(t) {
-            return Ln(t, e);
-        })), r = new ge(n);
-        return new be(t.path, r);
+            return Cn(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;
-}(vn), qn = /** @class */ function(e) {
+}(yn), Nn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).ft = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = new we(t.q, de(t.q, this.ft));
-        return new be(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;
-}(vn);
+}(yn);
 
-/** Parse update data from an update() call. */ function Fn(t, e, n, 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);
+    Rn("Data must be an object, but it was:", i, r);
     var o = [], a = zt.empty();
     St(r, (function(t, r) {
-        var s = Bn(e, t, n);
+        var s = Un(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = p(r);
         var u = i.it(s);
-        if (r instanceof kn) 
+        if (r instanceof An) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(s); else {
-            var c = Ln(r, u);
+            var c = Cn(r, u);
             null != c && (o.push(s), a.set(s, c));
         }
     }));
     var s = new Et(o);
-    return new _n(a, s, i.fieldTransforms);
+    return new bn(a, s, i.fieldTransforms);
 }
 
-/** 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 = [ xn(e, r, n) ], u = [ i ];
+/** Parse update data from a list of field/value arguments. */ function Fn(t, e, n, r, i, o) {
+    var a = t.ht(1 /* Update */ , e, n), s = [ Mn(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.");
-    for (var c = 0; c < o.length; c += 2) s.push(xn(e, o[c])), u.push(o[c + 1]);
+    for (var c = 0; c < o.length; c += 2) s.push(Mn(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 l = [], f = zt.empty(), h = s.length - 1; h >= 0; --h) if (!zn(l, s[h])) {
+    for (var l = [], f = zt.empty(), h = s.length - 1; h >= 0; --h) if (!Gn(l, s[h])) {
         var d = s[h], m = u[h];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
         m = p(m);
         var y = a.it(d);
-        if (m instanceof kn) 
+        if (m instanceof An) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(d); else {
-            var v = Ln(m, y);
+            var v = Cn(m, y);
             null != v && (l.push(d), f.set(d, v));
         }
     }
     var g = new Et(l);
-    return new _n(f, g, a.fieldTransforms);
+    return new bn(f, g, a.fieldTransforms);
 }
 
 /**
@@ -3843,8 +3839,8 @@ var Dn = /** @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 Cn(t, e, n, r) {
-    return void 0 === r && (r = !1), Ln(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+ */ function On(t, e, n, r) {
+    return void 0 === r && (r = !1), Cn(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -3855,12 +3851,12 @@ var Dn = /** @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 Ln(t, e) {
-    if (Rn(
+ */ function Cn(t, e) {
+    if (jn(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = p(t))) return Mn("Unsupported field value:", e, t), jn(t, e);
-    if (t instanceof vn) 
+    t = p(t))) return Rn("Unsupported field value:", e, t), Ln(t, e);
+    if (t instanceof yn) 
     // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
     // (as doing so will overwrite the field directly prior to the transform
@@ -3872,7 +3868,7 @@ var Dn = /** @class */ function(e) {
      */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Tn(e.tt)) throw e.ut(t._methodName + "() can only be used with update() and set()");
+        if (!_n(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);
@@ -3895,7 +3891,7 @@ var Dn = /** @class */ function(e) {
         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 = Ln(o[i], e.ot(r));
+                var a = Cn(o[i], e.ot(r));
                 null == a && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -3914,7 +3910,7 @@ var Dn = /** @class */ function(e) {
         if (null === (t = p(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return de(e.q, t);
+        if ("number" == typeof t) return pe(e.q, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -3924,7 +3920,7 @@ var Dn = /** @class */ function(e) {
         if (t instanceof Date) {
             var n = bt.fromDate(t);
             return {
-                timestampValue: Pe(e.q, n)
+                timestampValue: De(e.q, n)
             };
         }
         if (t instanceof bt) {
@@ -3933,30 +3929,30 @@ var Dn = /** @class */ function(e) {
             // truncation immediately without waiting for the backend to do that.
             var r = new bt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Pe(e.q, r)
+                timestampValue: De(e.q, r)
             };
         }
-        if (t instanceof gn) return {
+        if (t instanceof vn) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof yn) return {
-            bytesValue: Ne(e.q, t._byteString)
+        if (t instanceof mn) return {
+            bytesValue: Pe(e.q, t._byteString)
         };
-        if (t instanceof an) {
+        if (t instanceof on) {
             var i = e.databaseId, o = t.firestore._databaseId;
             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: Oe(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: Fe(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
         throw e.ut("Unsupported field value: " + at(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;
@@ -3965,7 +3961,7 @@ function jn(t, e) {
     // 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) : St(t, (function(t, r) {
-        var i = Ln(r, e.nt(t));
+        var i = Cn(r, e.nt(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -3974,12 +3970,12 @@ function jn(t, e) {
     };
 }
 
-function Rn(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof bt || t instanceof gn || t instanceof yn || t instanceof an || t instanceof vn);
+function jn(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof bt || t instanceof vn || t instanceof mn || t instanceof on || t instanceof yn);
 }
 
-function Mn(t, e, n) {
-    if (!Rn(n) || !function(t) {
+function Rn(t, e, n) {
+    if (!jn(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         var r = at(n);
@@ -3989,20 +3985,20 @@ function Mn(t, e, n) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function xn(t, e, n) {
+ */ function Mn(t, e, n) {
     if (
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    (e = p(e)) instanceof dn) return e._internalPath;
-    if ("string" == typeof e) return Bn(t, e);
-    throw Gn("Field path arguments must be of type string or ", t, 
+    (e = p(e)) instanceof pn) return e._internalPath;
+    if ("string" == typeof e) return Un(t, e);
+    throw Bn("Field path arguments must be of type string or ", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
 }
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ var Un = new RegExp("[~\\*/\\[\\]]");
+ */ var xn = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4012,20 +4008,20 @@ function Mn(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function Bn(t, e, n) {
-    if (e.search(Un) >= 0) throw Gn("Invalid field path (" + e + "). Paths must not contain '~', '*', '/', '[', or ']'", t, 
+ */ function Un(t, e, n) {
+    if (e.search(xn) >= 0) throw Bn("Invalid field path (" + e + "). Paths must not contain '~', '*', '/', '[', or ']'", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return (new (dn.bind.apply(dn, r([ void 0 ], e.split(".")))))._internalPath;
+        return (new (pn.bind.apply(pn, r([ void 0 ], e.split(".")))))._internalPath;
     } catch (r) {
-        throw Gn("Invalid field path (" + e + "). Paths must not be empty, begin with '.', end with '.', or contain '..'", t, 
+        throw Bn("Invalid field path (" + e + "). Paths must not be empty, begin with '.', end with '.', or contain '..'", t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function Gn(t, e, n, r, i) {
+function Bn(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 = "";
@@ -4034,7 +4030,7 @@ function Gn(t, e, n, r, i) {
     /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */;
 }
 
-function zn(t, e) {
+function Gn(t, e) {
     return t.some((function(t) {
         return t.isEqual(e);
     }));
@@ -4064,7 +4060,7 @@ function zn(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 Qn = /** @class */ function() {
+ */ var zn = /** @class */ function() {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4085,7 +4081,7 @@ function zn(t, e) {
          * The `DocumentReference` for the document included in the `DocumentSnapshot`.
          */
         get: function() {
-            return new an(this._firestore, this._converter, this._key);
+            return new on(this._firestore, this._converter, this._key);
         },
         enumerable: !1,
         configurable: !0
@@ -4110,7 +4106,7 @@ function zn(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 Kn(this._firestore, this._userDataWriter, this._key, this._document, 
+                var t = new Qn(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4130,11 +4126,11 @@ function zn(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(Yn("DocumentSnapshot.get", t));
+            var e = this._document.data.field(Wn("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }, t;
-}(), Kn = /** @class */ function(e) {
+}(), Qn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4146,7 +4142,7 @@ function zn(t, e) {
      */    return t(n, e), n.prototype.data = function() {
         return e.prototype.data.call(this);
     }, n;
-}(Qn), Hn = /** @class */ function() {
+}(zn), Kn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._docs = e, this.query = t;
@@ -4200,15 +4196,15 @@ function zn(t, e) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */
-function Wn(t, e) {
-    return t = p(t), e = p(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) && wt(t.docs, e.docs, Wn)
+function Hn(t, e) {
+    return t = p(t), e = p(e), t instanceof zn && e instanceof zn ? 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 Kn && e instanceof Kn && hn(t.query, e.query) && wt(t.docs, e.docs, Hn)
     /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */;
 }
 
-function Yn(t, e) {
-    return "string" == typeof e ? Bn(t, e) : e instanceof dn ? e._internalPath : e._delegate._internalPath;
+function Wn(t, e) {
+    return "string" == typeof e ? Un(t, e) : e instanceof pn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4234,7 +4230,7 @@ function Yn(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 $n = function() {};
+ */ var Yn = function() {};
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4244,7 +4240,7 @@ function Yn(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 Xn(t) {
+ */ function $n(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];
@@ -4253,39 +4249,39 @@ function Yn(t, e) {
     return t;
 }
 
-var Jn = /** @class */ function(e) {
+var Xn = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         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 = In(t.firestore), n = function(t, e, n, r, i, o, a) {
+        var e = En(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 documentId().");
                 if ("in" /* IN */ === o || "not-in" /* NOT_IN */ === o) {
-                    pr(a, o);
+                    hr(a, o);
                     for (var u = [], c = 0, l = a; c < l.length; c++) {
                         var f = l[c];
-                        u.push(hr(r, t, f));
+                        u.push(fr(r, t, f));
                     }
                     s = {
                         arrayValue: {
                             values: u
                         }
                     };
-                } 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, 
+                } else s = fr(r, t, a);
+            } else "in" /* IN */ !== o && "not-in" /* NOT_IN */ !== o && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== o || hr(a, o), 
+            s = On(n, "where", a, 
             /* allowArrays= */ "in" /* IN */ === o || "not-in" /* NOT_IN */ === o);
             var h = Wt.create(i, o, s);
             return function(t, e) {
                 if (e.N()) {
-                    var n = le(t);
+                    var n = ce(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 = ce(t);
-                    null !== r && dr(t, e.field, r);
+                    var r = ue(t);
+                    null !== r && pr(t, e.field, r);
                 }
                 var i = function(t, e) {
                     for (var n = 0, r = t.filters; n < r.length; n++) {
@@ -4332,12 +4328,12 @@ var Jn = /** @class */ function(e) {
                 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.");
             }(t, h), h;
         }(t._query, 0, e, t.firestore._databaseId, this.dt, this.wt, this.yt);
-        return new sn(t.firestore, t.converter, function(t, e) {
+        return new an(t.firestore, t.converter, function(t, e) {
             var n = t.filters.concat([ e ]);
             return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }, n;
-}($n);
+}(Yn);
 
 /**
  * Creates a {@link QueryConstraint} that enforces that documents must contain the
@@ -4349,12 +4345,12 @@ var Jn = /** @class */ function(e) {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function Zn(t, e, n) {
-    var r = e, i = Yn("where", t);
-    return new Jn(i, r, n);
+ */ function Jn(t, e, n) {
+    var r = e, i = Wn("where", t);
+    return new Xn(i, r, n);
 }
 
-var tr = /** @class */ function(e) {
+var Zn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).dt = t, r._t = n, r.type = "orderBy", r;
@@ -4365,20 +4361,20 @@ var tr = /** @class */ function(e) {
             if (null !== t.endAt) throw new x(V, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
             var r = new ie(e, n);
             return function(t, e) {
-                if (null === ce(t)) {
+                if (null === ue(t)) {
                     // This is the first order by. It must match any inequality.
-                    var n = le(t);
-                    null !== n && dr(t, n, e.field);
+                    var n = ce(t);
+                    null !== n && pr(t, n, e.field);
                 }
             }(t, r), r;
         }(t._query, this.dt, this._t);
-        return new sn(t.firestore, t.converter, function(t, e) {
+        return new an(t.firestore, t.converter, function(t, e) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             var n = t.explicitOrderBy.concat([ e ]);
             return new se(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }, n;
-}($n);
+}(Yn);
 
 /**
  * Creates a {@link QueryConstraint} that sorts the query result by the
@@ -4388,31 +4384,31 @@ var tr = /** @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 er(t, e) {
+ */ function tr(t, e) {
     void 0 === e && (e = "asc");
-    var n = e, r = Yn("orderBy", t);
-    return new tr(r, n);
+    var n = e, r = Wn("orderBy", t);
+    return new Zn(r, n);
 }
 
-var nr = /** @class */ function(e) {
+var er = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this) || this).type = t, i.gt = n, i.vt = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        return new sn(t.firestore, t.converter, function(t, e, n) {
+        return new an(t.firestore, t.converter, function(t, e, n) {
             return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
         }(t._query, this.gt, this.vt));
     }, n;
-}($n);
+}(Yn);
 
 /**
  * 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 rr(t) {
-    return ut("limit", t), new nr("limit", t, "F" /* First */)
+ */ function nr(t) {
+    return ut("limit", t), new er("limit", t, "F" /* First */)
     /**
  * Creates a {@link QueryConstraint} that only returns the last matching documents.
  *
@@ -4424,61 +4420,61 @@ var nr = /** @class */ function(e) {
  */;
 }
 
-function ir(t) {
-    return ut("limitToLast", t), new nr("limitToLast", t, "L" /* Last */);
+function rr(t) {
+    return ut("limitToLast", t), new er("limitToLast", t, "L" /* Last */);
 }
 
-var or = /** @class */ function(e) {
+var ir = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this) || this).type = t, i.bt = n, i.Et = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = fr(t, this.type, this.bt, this.Et);
-        return new sn(t.firestore, t.converter, function(t, e) {
+        var e = lr(t, this.type, this.bt, this.Et);
+        return new an(t.firestore, t.converter, function(t, e) {
             return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }, n;
-}($n);
+}(Yn);
 
-function ar() {
+function or() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new or("startAt", t, 
+    return new ir("startAt", t, 
     /*inclusive=*/ !0);
 }
 
-function sr() {
+function ar() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new or("startAfter", t, 
+    return new ir("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
-var ur = /** @class */ function(e) {
+var sr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this) || this).type = t, i.bt = n, i.Et = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = fr(t, this.type, this.bt, this.Et);
-        return new sn(t.firestore, t.converter, function(t, e) {
+        var e = lr(t, this.type, this.bt, this.Et);
+        return new an(t.firestore, t.converter, function(t, e) {
             return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }, n;
-}($n);
+}(Yn);
 
-function cr() {
+function ur() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new ur("endBefore", t, 
+    return new sr("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function lr() {
+function cr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new ur("endAt", t, /*inclusive=*/ !0);
+    return new sr("endAt", t, /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function fr(t, e, n, r) {
-    if (n[0] = p(n[0]), n[0] instanceof Qn) return function(t, e, n, r, i) {
+/** Helper function to create a bound from a document or fields */ function lr(t, e, n, r) {
+    if (n[0] = p(n[0]), n[0] instanceof zn) return function(t, e, n, r, i) {
         if (!r) throw new x(P, "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
@@ -4487,7 +4483,7 @@ function lr() {
         // 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 = he(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(Rt(e, r.key)); else {
                 var c = r.data.field(u.field);
@@ -4501,7 +4497,7 @@ function lr() {
         }
         return new re(o, i);
     }(t._query, t.firestore._databaseId, e, n[0]._document, r);
-    var i = In(t.firestore);
+    var i = En(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;
@@ -4510,13 +4506,13 @@ function lr() {
             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 (!fe(t) && -1 !== c.indexOf("/")) throw new x(V, "Invalid query. When querying a collection and ordering by documentId(), the value passed to " + r + "() must be a plain document ID, but '" + c + "' contains a slash.");
+                if (!le(t) && -1 !== c.indexOf("/")) throw new x(V, "Invalid query. When querying a collection and ordering by documentId(), the value passed to " + r + "() must be a plain document ID, but '" + c + "' contains a slash.");
                 var l = t.path.child(Z.fromString(c));
                 if (!nt.isDocumentKey(l)) throw new x(V, "Invalid query. When querying a collection group and ordering by 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 nt(l);
                 s.push(Rt(e, f));
             } else {
-                var h = Cn(n, r, c);
+                var h = On(n, r, c);
                 s.push(h);
             }
         }
@@ -4524,27 +4520,27 @@ function lr() {
     }(t._query, t.firestore._databaseId, i, e, n, r);
 }
 
-function hr(t, e, n) {
+function fr(t, e, n) {
     if ("string" == typeof (n = p(n))) {
         if ("" === n) throw new x(V, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!fe(e) && -1 !== n.indexOf("/")) throw new x(V, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '" + n + "' contains a '/' character.");
+        if (!le(e) && -1 !== n.indexOf("/")) throw new x(V, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '" + n + "' contains a '/' character.");
         var r = e.path.child(Z.fromString(n));
         if (!nt.isDocumentKey(r)) throw new x(V, "Invalid query. When querying a collection group by 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 Rt(t, new nt(r));
     }
-    if (n instanceof an) return Rt(t, n._key);
+    if (n instanceof on) return Rt(t, n._key);
     throw new x(V, "Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: " + at(n) + ".");
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function pr(t, e) {
+ */ function hr(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 dr(t, e, n) {
+function pr(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.");
 }
 
@@ -4594,23 +4590,23 @@ function dr(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 mr(t, e, n) {
+ */ function dr(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 yr = /** @class */ function(e) {
+var mr = /** @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 yn(t);
+        return new mn(t);
     }, n.prototype.convertReference = function(t) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new an(this.firestore, /* converter= */ null, e);
+        return new on(this.firestore, /* converter= */ null, e);
     }, n;
 }(/** @class */ function() {
     function t() {}
@@ -4658,7 +4654,7 @@ var yr = /** @class */ function(e) {
             r[t] = n.convertValue(i, e);
         })), r;
     }, t.prototype.convertGeoPoint = function(t) {
-        return new gn(Vt(t.latitude), Vt(t.longitude));
+        return new vn(Vt(t.latitude), Vt(t.longitude));
     }, t.prototype.convertArray = function(t, e) {
         var n = this;
         return (t.values || []).map((function(t) {
@@ -4681,7 +4677,7 @@ var yr = /** @class */ function(e) {
         return new bt(e.seconds, e.nanos);
     }, t.prototype.convertDocumentKey = function(t, e) {
         var n = Z.fromString(t);
-        E(ze(n));
+        E(Ge(n));
         var r = new X(n.get(1), n.get(3)), i = new nt(n.popFirst(5));
         return r.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
@@ -4702,12 +4698,12 @@ var yr = /** @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 vr(t) {
-    var e = Je((t = st(t, an)).firestore), n = new yr(t.firestore);
-    return Ye(e, [ t._key ]).then((function(e) {
+ */ function yr(t) {
+    var e = Xe((t = st(t, on)).firestore), n = new mr(t.firestore);
+    return We(e, [ t._key ]).then((function(e) {
         E(1 === e.length);
         var r = e[0];
-        return new Qn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new zn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -4722,35 +4718,35 @@ var yr = /** @class */ function(e) {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function gr(t) {
+ */ function vr(t) {
     !function(t) {
-        if (ue(t) && 0 === t.explicitOrderBy.length) throw new x(j, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = st(t, sn))._query);
-    var e = Je(t.firestore), n = new yr(t.firestore);
-    return $e(e, t._query).then((function(e) {
+        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new x(j, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = st(t, an))._query);
+    var e = Xe(t.firestore), n = new mr(t.firestore);
+    return Ye(e, t._query).then((function(e) {
         var r = e.map((function(e) {
-            return new Kn(t.firestore, n, e.key, e, t.converter);
+            return new Qn(t.firestore, n, e.key, e, t.converter);
         }));
-        return ue(t._query) && 
+        return "L" /* Last */ === t._query.limitType && 
         // Limit to last queries reverse the orderBy constraint that was
         // specified by the user. As such, we need to reverse the order of the
         // results to return the documents in the expected order.
-        r.reverse(), new Hn(t, r);
+        r.reverse(), new Kn(t, r);
     }));
 }
 
-function wr(t, e, n) {
-    var r = mr((t = st(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, _e.none()) ]);
+function gr(t, e, n) {
+    var r = dr((t = st(t, on)).converter, e, n), i = In(En(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return He(Xe(t.firestore), [ i.toMutation(t._key, be.none()) ]);
 }
 
-function br(t, e, n) {
+function wr(t, e, n) {
     for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-    var o, a = In((t = st(t, an)).firestore);
+    var o, a = En((t = st(t, on)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-        return o = "string" == typeof (e = p(e)) || e instanceof dn ? On(a, "updateDoc", t._key, e, n, r) : Fn(a, "updateDoc", t._key, e), 
-    We(Je(t.firestore), [ o.toMutation(t._key, _e.exists(!0)) ]);
+        return o = "string" == typeof (e = p(e)) || e instanceof pn ? Fn(a, "updateDoc", t._key, e, n, r) : qn(a, "updateDoc", t._key, e), 
+    He(Xe(t.firestore), [ o.toMutation(t._key, be.exists(!0)) ]);
 }
 
 /**
@@ -4764,8 +4760,8 @@ function br(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 _r(t) {
-    return We(Je((t = st(t, an)).firestore), [ new Ie(t._key, _e.none()) ]);
+ */ function br(t) {
+    return He(Xe((t = st(t, on)).firestore), [ new Ee(t._key, be.none()) ]);
 }
 
 /**
@@ -4782,9 +4778,9 @@ function br(t, e, n) {
  * @throws Error - If the provided input is not a valid Firestore document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function Tr(t, e) {
-    var n = fn(t = st(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, _e.exists(!1)) ]).then((function() {
+ */ function _r(t, e) {
+    var n = ln(t = st(t, sn)), r = dr(t.converter, e), i = In(En(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return He(Xe(t.firestore), [ i.toMutation(n._key, be.exists(!1)) ]).then((function() {
         return n;
     }));
 }
@@ -4808,15 +4804,15 @@ function br(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 Sr() {
-    return new kn("deleteField");
+ */ function Tr() {
+    return new An("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 Er() {
-    return new Dn("serverTimestamp");
+ */ function Sr() {
+    return new Vn("serverTimestamp");
 }
 
 /**
@@ -4830,11 +4826,11 @@ function br(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 Ir() {
+ */ function Er() {
     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 Pn("arrayUnion", t);
+        return new Dn("arrayUnion", t);
 }
 
 /**
@@ -4847,11 +4843,11 @@ function br(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 Ar() {
+ */ 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 Nn("arrayRemove", t);
+        return new Pn("arrayRemove", t);
 }
 
 /**
@@ -4872,8 +4868,8 @@ function br(t, e, n) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function kr(t) {
-    return new qn("increment", t);
+ */ function Ar(t) {
+    return new Nn("increment", t);
 }
 
 /**
@@ -4899,24 +4895,24 @@ function br(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 Vr = /** @class */ function() {
+ */ var kr = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = In(t);
+        this._dataReader = En(t);
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        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, _e.none())), this;
+        var r = Vr(t, this._firestore), i = dr(r.converter, e, n), o = In(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 = Dr(t, this._firestore);
+        var o, a = Vr(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 dn ? On(this._dataReader, "WriteBatch.update", a._key, e, n, r) : Fn(this._dataReader, "WriteBatch.update", a._key, e), 
-        this._mutations.push(o.toMutation(a._key, _e.exists(!0))), this;
+                return o = "string" == typeof (e = p(e)) || e instanceof pn ? Fn(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}.
@@ -4926,8 +4922,8 @@ function br(t, e, n) {
      */
     t.prototype.delete = function(t) {
         this._verifyNotCommitted();
-        var e = Dr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Ie(e._key, _e.none())), this;
+        var e = Vr(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.
@@ -4948,7 +4944,7 @@ function br(t, e, n) {
     }, t;
 }();
 
-function Dr(t, e) {
+function Vr(t, e) {
     if ((t = p(t)).firestore !== e) throw new x(V, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -4965,10 +4961,10 @@ function Dr(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Pr(t) {
-    var e = Je(t = st(t, tn));
-    return new Vr(t, (function(t) {
-        return We(e, t);
+ */ function Dr(t) {
+    var e = Xe(t = st(t, Ze));
+    return new kr(t, (function(t) {
+        return He(e, t);
     }));
 }
 
@@ -4991,7 +4987,7 @@ function Dr(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ var Nr = /** @class */ function() {
+ */ var Pr = /** @class */ function() {
     function t(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5016,7 +5012,7 @@ function Dr(t, e) {
                 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*/ , Ye(this.datastore, t) ];
+                    return [ 4 /*yield*/ , We(this.datastore, t) ];
 
                   case 1:
                     return [ 2 /*return*/ , ((e = n.sent()).forEach((function(t) {
@@ -5035,7 +5031,7 @@ function Dr(t, e) {
         }
         this.writtenDocs.add(t.toString());
     }, t.prototype.delete = function(t) {
-        this.write(new Ie(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;
@@ -5052,8 +5048,8 @@ function Dr(t, e) {
                     // a `verify` operation.
                     t.forEach((function(t, n) {
                         var r = nt.fromPath(n);
-                        e.mutations.push(new Ae(r, e.precondition(r)));
-                    })), [ 4 /*yield*/ , We(this.datastore, this.mutations) ];
+                        e.mutations.push(new Ie(r, e.precondition(r)));
+                    })), [ 4 /*yield*/ , He(this.datastore, this.mutations) ];
 
                   case 1:
                     // For each mutation, note that the doc was written.
@@ -5081,7 +5077,7 @@ function Dr(t, e) {
      */
     t.prototype.precondition = function(t) {
         var e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? _e.updateTime(e) : _e.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.
@@ -5103,18 +5099,18 @@ function Dr(t, e) {
             // transaction.
             throw new x(V, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return _e.updateTime(e);
+                        return be.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-                return _e.exists(!0);
+                return be.exists(!0);
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), qr = /** @class */ function() {
+}(), Nr = /** @class */ function() {
     function t(t, e, n, r) {
         this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = r, 
-        this.Tt = 5, this.It = new Ke(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
+        this.Tt = 5, this.It = new Qe(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.run = function() {
@@ -5125,7 +5121,7 @@ function Dr(t, e) {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new Nr(this.datastore), (e = this.Rt(t)) && e.then((function(e) {
+                    return t = new Pr(this.datastore), (e = this.Rt(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
@@ -5237,7 +5233,7 @@ function Dr(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 Fr() {
+/** 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;
@@ -5269,7 +5265,7 @@ function Dr(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 Or = /** @class */ function() {
+ */ var Fr = /** @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 U, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
@@ -5333,7 +5329,7 @@ function Dr(t, e) {
         null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle), 
         this.timerHandle = null);
     }, t;
-}(), Cr = /** @class */ function() {
+}(), Or = /** @class */ function() {
     function t() {
         var t = this;
         // The last promise in the queue.
@@ -5357,15 +5353,15 @@ function Dr(t, e) {
         // List of TimerIds to fast-forward delays for.
         this.Ot = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new Ke(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new Qe(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.Ct = function() {
-            var e = Fr();
+            var e = qr();
             e && w("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.It.H();
         };
-        var e = Fr();
+        var e = qr();
         e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Ct);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
@@ -5389,7 +5385,7 @@ function Dr(t, e) {
     }, t.prototype.enterRestrictedMode = function(t) {
         if (!this.$t) {
             this.$t = !0, this.qt = t || !1;
-            var e = Fr();
+            var e = qr();
             e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ct);
         }
     }, t.prototype.enqueue = function(t) {
@@ -5487,7 +5483,7 @@ function Dr(t, e) {
         this.Lt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ot.indexOf(t) > -1 && (e = 0);
-        var i = Or.createAndSchedule(this, t, e, n, (function(t) {
+        var i = Fr.createAndSchedule(this, t, e, n, (function(t) {
             return r.jt(t);
         }));
         return this.St.push(i), i;
@@ -5562,10 +5558,10 @@ function Dr(t, e) {
         var e = this.St.indexOf(t);
         this.St.splice(e, 1);
     }, t;
-}(), Lr = /** @class */ function() {
+}(), Cr = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = In(t)
+        this._firestore = t, this._transaction = e, this._dataReader = En(t)
         /**
      * Reads the document referenced by the provided {@link DocumentReference}.
      *
@@ -5574,23 +5570,23 @@ function Dr(t, e) {
      */;
     }
     return t.prototype.get = function(t) {
-        var e = this, n = Dr(t, this._firestore), r = new yr(this._firestore);
+        var e = this, n = Vr(t, this._firestore), r = new mr(this._firestore);
         return this._transaction.lookup([ n._key ]).then((function(t) {
             if (!t || 1 !== t.length) return S();
             var i = t[0];
-            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);
+            if (i.isFoundDocument()) return new zn(e._firestore, r, i.key, i, n.converter);
+            if (i.isNoDocument()) return new zn(e._firestore, r, n._key, null, n.converter);
             throw S();
         }));
     }, t.prototype.set = function(t, e, 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);
+        var r = Vr(t, this._firestore), i = dr(r.converter, e, n), o = In(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 = Dr(t, this._firestore);
+        var o, a = Vr(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 dn ? On(this._dataReader, "Transaction.update", a._key, e, n, r) : Fn(this._dataReader, "Transaction.update", a._key, e), 
+                return o = "string" == typeof (e = p(e)) || e instanceof pn ? Fn(this._dataReader, "Transaction.update", a._key, e, n, r) : qn(this._dataReader, "Transaction.update", a._key, e), 
         this._transaction.update(a._key, o), this;
     }, 
     /**
@@ -5600,7 +5596,7 @@ function Dr(t, e) {
      * @returns This `Transaction` instance. Used for chaining method calls.
      */
     t.prototype.delete = function(t) {
-        var e = Dr(t, this._firestore);
+        var e = Vr(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }, t;
 }();
@@ -5638,10 +5634,10 @@ function Dr(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 = Je(t = st(t, tn)), r = new U;
-    return new qr(new Cr, n, (function(n) {
-        return e(new Lr(t, n));
+function Lr(t, e) {
+    var n = Xe(t = st(t, Ze)), r = new U;
+    return new Nr(new Or, n, (function(n) {
+        return e(new Cr(t, n));
     }), r).run(), r.promise
     /**
  * Firestore Lite
@@ -5654,11 +5650,11 @@ function jr(t, e) {
 }
 
 y = i + "_lite", o(new c("firestore/lite", (function(t, e) {
-    var n = e.options, r = t.getProvider("app").getImmediate(), i = new tn(r, new Q(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
+    var n = e.options, r = t.getProvider("app").getImmediate(), i = new Ze(r, new Q(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
     return n && i._setSettings(n), i;
 }), "PUBLIC")), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-a("firestore-lite", "3.4.7", ""), a("firestore-lite", "3.4.7", "esm5");
+a("firestore-lite", "3.4.8-canary.44948ac91", ""), a("firestore-lite", "3.4.8-canary.44948ac91", "esm5");
 
-export { yn as Bytes, un as CollectionReference, an as DocumentReference, Qn as DocumentSnapshot, dn as FieldPath, vn as FieldValue, tn as Firestore, x as FirestoreError, gn as GeoPoint, sn as Query, $n as QueryConstraint, Kn as QueryDocumentSnapshot, Hn as QuerySnapshot, bt as Timestamp, Lr 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, jr as runTransaction, Er as serverTimestamp, wr as setDoc, g as setLogLevel, Wn as snapshotEqual, sr as startAfter, ar as startAt, on as terminate, br as updateDoc, Zn as where, Pr as writeBatch };
+export { mn as Bytes, sn as CollectionReference, on as DocumentReference, zn as DocumentSnapshot, pn as FieldPath, yn as FieldValue, Ze as Firestore, x as FirestoreError, vn as GeoPoint, an as Query, Yn as QueryConstraint, Qn as QueryDocumentSnapshot, Kn as QuerySnapshot, bt as Timestamp, Cr as Transaction, kr as WriteBatch, _r as addDoc, Ir as arrayRemove, Er as arrayUnion, un as collection, cn as collectionGroup, nn as connectFirestoreEmulator, br as deleteDoc, Tr as deleteField, ln as doc, dn as documentId, cr as endAt, ur as endBefore, yr as getDoc, vr as getDocs, en as getFirestore, Ar as increment, tn as initializeFirestore, nr as limit, rr as limitToLast, tr as orderBy, $n as query, hn as queryEqual, fn as refEqual, Lr as runTransaction, Sr as serverTimestamp, gr as setDoc, g as setLogLevel, Hn as snapshotEqual, ar as startAfter, or as startAt, rn as terminate, wr as updateDoc, Jn as where, Dr as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map