@firebase/firestore 4.7.3-canary.64db19264 → 4.7.3-canary.8fb044e8d

package/dist/index.esm5.js

@@ -4,9 +4,9 @@ import { SDK_VERSION as i, _registerComponent as o, registerVersion as u, _getPr
 
 import { Component as c } from "@firebase/component";
 
-import { Logger as l, LogLevel as h } from "@firebase/logger";
+import { Logger as l, LogLevel as f } from "@firebase/logger";
 
-import { FirebaseError as f, getUA as d, isSafari as p, deepEqual as v, getModularInstance as m, isIndexedDBAvailable as y, createMockUserToken as g, getDefaultEmulatorHostnameAndPort as w } from "@firebase/util";
+import { FirebaseError as h, getUA as d, isSafari as p, deepEqual as v, getModularInstance as m, isIndexedDBAvailable as y, createMockUserToken as g, getDefaultEmulatorHostnameAndPort as w } from "@firebase/util";
 
 import { Integer as b, Md5 as _ } from "@firebase/webchannel-wrapper/bloom-blob";
 
@@ -72,7 +72,7 @@ k.MOCK_USER = new k("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var O = "10.14.1-canary.64db19264", P = new l("@firebase/firestore");
+var O = "10.14.1-canary.8fb044e8d", P = new l("@firebase/firestore");
 
 /**
  * @license
@@ -113,7 +113,7 @@ function R() {
 
 function F(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (P.logLevel <= h.DEBUG) {
+    if (P.logLevel <= f.DEBUG) {
         var i = e.map(q);
         P.debug.apply(P, r([ "Firestore (".concat(O, "): ").concat(t) ], i, !1));
     }
@@ -121,7 +121,7 @@ function F(t) {
 
 function M(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (P.logLevel <= h.ERROR) {
+    if (P.logLevel <= f.ERROR) {
         var i = e.map(q);
         P.error.apply(P, r([ "Firestore (".concat(O, "): ").concat(t) ], i, !1));
     }
@@ -131,7 +131,7 @@ function M(t) {
  * @internal
  */ function L(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (P.logLevel <= h.WARN) {
+    if (P.logLevel <= f.WARN) {
         var i = e.map(q);
         P.warn.apply(P, r([ "Firestore (".concat(O, "): ").concat(t) ], i, !1));
     }
@@ -381,7 +381,7 @@ e) {
         }, r;
     }
     return t(n, e), n;
-}(f), Q = function() {
+}(h), Q = function() {
     var t = this;
     this.promise = new Promise((function(e, n) {
         t.resolve = e, t.reject = n;
@@ -952,7 +952,7 @@ function it(t, e) {
     }, n.emptyPath = function() {
         return new n([]);
     }, n;
-}(ct), ht = /^[_a-zA-Z][_a-zA-Z0-9]*$/, ft = /** @class */ function(e) {
+}(ct), ft = /^[_a-zA-Z][_a-zA-Z0-9]*$/, ht = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -964,7 +964,7 @@ function it(t, e) {
      * without escaping.
      */
     n.isValidIdentifier = function(t) {
-        return ht.test(t);
+        return ft.test(t);
     }, n.prototype.canonicalString = function() {
         return this.toArray().map((function(t) {
             return t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"), n.isValidIdentifier(t) || (t = "`" + t + "`"), 
@@ -1132,7 +1132,7 @@ e) {
 };
 
 function wt(t, e) {
-    var n = ft.comparator(t.fieldPath, e.fieldPath);
+    var n = ht.comparator(t.fieldPath, e.fieldPath);
     return 0 !== n ? n : it(t.kind, e.kind);
 }
 
@@ -1597,7 +1597,7 @@ function Dt(t) {
                 switch (l.label) {
                   case 0:
                     e = "readonly" === r, u = 0, a = function() {
-                        var r, a, c, l, h, f;
+                        var r, a, c, l, f, h;
                         return n(this, (function(n) {
                             switch (n.label) {
                               case 0:
@@ -1630,9 +1630,9 @@ function Dt(t) {
                                 // exceeded errors).
                                 // Note: We cannot use an instanceof check for FirestoreException, since the
                                 // exception is wrapped in a generic error by our async/await handling.
-                                return l = n.sent(), f = "FirebaseError" !== (h = l).name && u < 3, F("SimpleDb", "Transaction failed with error:", h.message, "Retrying:", f), 
-                                s.close(), f ? [ 3 /*break*/ , 5 ] : [ 2 /*return*/ , {
-                                    value: Promise.reject(h)
+                                return l = n.sent(), h = "FirebaseError" !== (f = l).name && u < 3, F("SimpleDb", "Transaction failed with error:", f.message, "Retrying:", h), 
+                                s.close(), h ? [ 3 /*break*/ , 5 ] : [ 2 /*return*/ , {
+                                    value: Promise.reject(f)
                                 } ];
 
                               case 5:
@@ -2254,7 +2254,7 @@ var Ht = [ "userId", "batchId" ];
  * there is no useful information to store as the value. The raw (unencoded)
  * path cannot be stored because IndexedDb doesn't store prototype
  * information.
- */ var Zt = {}, $t = [ "prefixPath", "collectionGroup", "readTime", "documentId" ], te = [ "prefixPath", "collectionGroup", "documentId" ], ee = [ "collectionGroup", "readTime", "prefixPath", "documentId" ], ne = [ "canonicalId", "targetId" ], re = [ "targetId", "path" ], ie = [ "path", "targetId" ], oe = [ "collectionId", "parent" ], ue = [ "indexId", "uid" ], ae = [ "uid", "sequenceNumber" ], se = [ "indexId", "uid", "arrayValue", "directionalValue", "orderedDocumentKey", "documentKey" ], ce = [ "indexId", "uid", "orderedDocumentKey" ], le = [ "userId", "collectionPath", "documentId" ], he = [ "userId", "collectionPath", "largestBatchId" ], fe = [ "userId", "collectionGroup", "largestBatchId" ], de = r(r([], r(r([], r(r([], r(r([], [ "mutationQueues", "mutations", "documentMutations", "remoteDocuments", "targets", "owner", "targetGlobal", "targetDocuments" ], !1), [ "clientMetadata" ], !1), !0), [ "remoteDocumentGlobal" ], !1), !0), [ "collectionParents" ], !1), !0), [ "bundles", "namedQueries" ], !1), pe = r(r([], de, !0), [ "documentOverlays" ], !1), ve = [ "mutationQueues", "mutations", "documentMutations", "remoteDocumentsV14", "targets", "owner", "targetGlobal", "targetDocuments", "clientMetadata", "remoteDocumentGlobal", "collectionParents", "bundles", "namedQueries", "documentOverlays" ], me = ve, ye = r(r([], me, !0), [ "indexConfiguration", "indexState", "indexEntries" ], !1), ge = ye, we = r(r([], ye, !0), [ "globals" ], !1), be = /** @class */ function(e) {
+ */ var Zt = {}, $t = [ "prefixPath", "collectionGroup", "readTime", "documentId" ], te = [ "prefixPath", "collectionGroup", "documentId" ], ee = [ "collectionGroup", "readTime", "prefixPath", "documentId" ], ne = [ "canonicalId", "targetId" ], re = [ "targetId", "path" ], ie = [ "path", "targetId" ], oe = [ "collectionId", "parent" ], ue = [ "indexId", "uid" ], ae = [ "uid", "sequenceNumber" ], se = [ "indexId", "uid", "arrayValue", "directionalValue", "orderedDocumentKey", "documentKey" ], ce = [ "indexId", "uid", "orderedDocumentKey" ], le = [ "userId", "collectionPath", "documentId" ], fe = [ "userId", "collectionPath", "largestBatchId" ], he = [ "userId", "collectionGroup", "largestBatchId" ], de = r(r([], r(r([], r(r([], r(r([], [ "mutationQueues", "mutations", "documentMutations", "remoteDocuments", "targets", "owner", "targetGlobal", "targetDocuments" ], !1), [ "clientMetadata" ], !1), !0), [ "remoteDocumentGlobal" ], !1), !0), [ "collectionParents" ], !1), !0), [ "bundles", "namedQueries" ], !1), pe = r(r([], de, !0), [ "documentOverlays" ], !1), ve = [ "mutationQueues", "mutations", "documentMutations", "remoteDocumentsV14", "targets", "owner", "targetGlobal", "targetDocuments", "clientMetadata", "remoteDocumentGlobal", "collectionParents", "bundles", "namedQueries", "documentOverlays" ], me = ve, ye = r(r([], me, !0), [ "indexConfiguration", "indexState", "indexEntries" ], !1), ge = ye, we = r(r([], ye, !0), [ "globals" ], !1), be = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this)._e = t, r.currentSequenceNumber = n, r;
@@ -2803,7 +2803,7 @@ function ke(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
         // Sort the field mask to support `FieldMask.isEqual()` and assert below.
-        t.sort(ft.comparator);
+        t.sort(ht.comparator);
     }
     return t.empty = function() {
         return new t([]);
@@ -2813,7 +2813,7 @@ function ke(t) {
      * fields paths to this field mask.
      */
     t.prototype.unionWith = function(e) {
-        for (var n = new Ne(ft.comparator), r = 0, i = this.fields; r < i.length; r++) {
+        for (var n = new Ne(ht.comparator), r = 0, i = this.fields; r < i.length; r++) {
             var o = i[r];
             n = n.add(o);
         }
@@ -3146,7 +3146,7 @@ function(t, e, n, r, i, o, u, a, s) {
  */
 /** Extracts the backend's type order for the provided value. */
 function We(t) {
-    return "nullValue" in t ? 0 /* TypeOrder.NullValue */ : "booleanValue" in t ? 1 /* TypeOrder.BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* TypeOrder.NumberValue */ : "timestampValue" in t ? 3 /* TypeOrder.TimestampValue */ : "stringValue" in t ? 5 /* TypeOrder.StringValue */ : "bytesValue" in t ? 6 /* TypeOrder.BlobValue */ : "referenceValue" in t ? 7 /* TypeOrder.RefValue */ : "geoPointValue" in t ? 8 /* TypeOrder.GeoPointValue */ : "arrayValue" in t ? 9 /* TypeOrder.ArrayValue */ : "mapValue" in t ? Ue(t) ? 4 /* TypeOrder.ServerTimestampValue */ : hn(t) ? 9007199254740991 /* TypeOrder.MaxValue */ : cn(t) ? 10 /* TypeOrder.VectorValue */ : 11 /* TypeOrder.ObjectValue */ : U();
+    return "nullValue" in t ? 0 /* TypeOrder.NullValue */ : "booleanValue" in t ? 1 /* TypeOrder.BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* TypeOrder.NumberValue */ : "timestampValue" in t ? 3 /* TypeOrder.TimestampValue */ : "stringValue" in t ? 5 /* TypeOrder.StringValue */ : "bytesValue" in t ? 6 /* TypeOrder.BlobValue */ : "referenceValue" in t ? 7 /* TypeOrder.RefValue */ : "geoPointValue" in t ? 8 /* TypeOrder.GeoPointValue */ : "arrayValue" in t ? 9 /* TypeOrder.ArrayValue */ : "mapValue" in t ? Ue(t) ? 4 /* TypeOrder.ServerTimestampValue */ : fn(t) ? 9007199254740991 /* TypeOrder.MaxValue */ : cn(t) ? 10 /* TypeOrder.VectorValue */ : 11 /* TypeOrder.ObjectValue */ : U();
 }
 
 /** Tests `left` and `right` for equality based on the backend semantics. */ function Je(t, e) {
@@ -3462,11 +3462,11 @@ function nn(t, e) {
     return Object.assign({}, t);
 }
 
-/** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */ function hn(t) {
+/** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */ function fn(t) {
     return "__max__" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;
 }
 
-var fn = {
+var hn = {
     mapValue: {
         fields: {
             __type__: {
@@ -3499,7 +3499,7 @@ var fn = {
         }
     } : "arrayValue" in t ? {
         arrayValue: {}
-    } : "mapValue" in t ? cn(t) ? fn : {
+    } : "mapValue" in t ? cn(t) ? hn : {
         mapValue: {}
     } : U();
 }
@@ -3524,7 +3524,7 @@ var fn = {
         }
     } : "geoPointValue" in t ? {
         arrayValue: {}
-    } : "arrayValue" in t ? fn : "mapValue" in t ? cn(t) ? {
+    } : "arrayValue" in t ? hn : "mapValue" in t ? cn(t) ? {
         mapValue: {}
     } : je : U();
 }
@@ -3593,7 +3593,7 @@ function mn(t, e) {
      * @param data - A map of fields to values (or null for deletes).
      */
     t.prototype.setAll = function(t) {
-        var e = this, n = ft.emptyPath(), r = {}, i = [];
+        var e = this, n = ht.emptyPath(), r = {}, i = [];
         t.forEach((function(t, o) {
             if (!n.isImmediateParentOf(o)) {
                 // Insert the accumulated changes at this parent location
@@ -3658,7 +3658,7 @@ function mn(t, e) {
  */ function gn(t) {
     var e = [];
     return Te(t.fields, (function(t, n) {
-        var r = new ft([ t ]);
+        var r = new ht([ t ]);
         if (sn(n)) {
             var i = gn(n.mapValue).fields;
             if (0 === i.length) 
@@ -4238,14 +4238,14 @@ function Jn(t) {
     // If there is an additional bound, compare the values against the existing
     // range to see if we can narrow the scope.
         if (null !== n) for (var l = 0; l < t.orderBy.length; ++l) if (t.orderBy[l].field.isEqual(e)) {
-        var h = n.position[l];
+        var f = n.position[l];
         vn({
             value: r,
             inclusive: i
         }, {
-            value: h,
+            value: f,
             inclusive: n.inclusive
-        }) < 0 && (r = h, i = n.inclusive);
+        }) < 0 && (r = f, i = n.inclusive);
         break;
     }
     return {
@@ -4293,14 +4293,14 @@ function Jn(t) {
     // If there is an additional bound, compare the values against the existing
     // range to see if we can narrow the scope.
         if (null !== n) for (var l = 0; l < t.orderBy.length; ++l) if (t.orderBy[l].field.isEqual(e)) {
-        var h = n.position[l];
+        var f = n.position[l];
         mn({
             value: r,
             inclusive: i
         }, {
-            value: h,
+            value: f,
             inclusive: n.inclusive
-        }) > 0 && (r = h, i = n.inclusive);
+        }) > 0 && (r = f, i = n.inclusive);
         break;
     }
     return {
@@ -4399,7 +4399,7 @@ function(t, e, n, r, i, o /* LimitType.First */ , u, a) {
         }
         // The order of the implicit ordering always matches the last explicit order by.
                 var u = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* Direction.ASCENDING */ , a = function(t) {
-            var e = new Ne(ft.comparator);
+            var e = new Ne(ht.comparator);
             return t.filters.forEach((function(t) {
                 t.getFlattenedFilters().forEach((function(t) {
                     t.isInequality() && (e = e.add(t.field));
@@ -4415,7 +4415,7 @@ function(t, e, n, r, i, o /* LimitType.First */ , u, a) {
             n.has(t.canonicalString()) || t.isKeyField() || e.ce.push(new Tn(t, u));
         })), 
         // Add the document key field to the last if it is not explicitly ordered.
-        n.has(ft.keyField().canonicalString()) || e.ce.push(new Tn(ft.keyField(), u));
+        n.has(ht.keyField().canonicalString()) || e.ce.push(new Tn(ht.keyField(), u));
     }
     return e.ce;
 }
@@ -4473,7 +4473,7 @@ function lr(t) {
     return "".concat(Qn(ir(t)), "|lt:").concat(t.limitType);
 }
 
-function hr(t) {
+function fr(t) {
     return "Query(target=".concat(function(t) {
         var e = t.path.canonicalString();
         return null !== t.collectionGroup && (e += " collectionGroup=" + t.collectionGroup), 
@@ -4493,7 +4493,7 @@ function hr(t) {
     }(ir(t)), "; limitType=").concat(t.limitType, ")");
 }
 
-/** Returns whether `doc` matches the constraints of `query`. */ function fr(t, e) {
+/** Returns whether `doc` matches the constraints of `query`. */ function hr(t, e) {
     return e.isFoundDocument() && function(t, e) {
         var n = e.key.path;
         return null !== t.collectionGroup ? e.key.hasCollectionId(t.collectionGroup) && t.path.isPrefixOf(n) : dt.isDocumentKey(t.path) ? t.path.isEqual(n) : t.path.isImmediateParentOf(n);
@@ -5060,7 +5060,7 @@ e) {
     if (!t.hasLocalMutations || e && 0 === e.fields.length) return null;
     // mask is null when sets or deletes are applied to the current document.
         if (null === e) return t.isNoDocument() ? new si(t.key, Wr.none()) : new ei(t.key, t.data, Wr.none());
-    for (var n = t.data, r = yn.empty(), i = new Ne(ft.comparator), o = 0, u = e.fields; o < u.length; o++) {
+    for (var n = t.data, r = yn.empty(), i = new Ne(ht.comparator), o = 0, u = e.fields; o < u.length; o++) {
         var a = u[o];
         if (!i.has(a)) {
             var s = n.field(a);
@@ -5356,7 +5356,7 @@ function ii(t, e, n) {
             return ti(t, e);
         }));
     }, t;
-}(), hi = /** @class */ function() {
+}(), fi = /** @class */ function() {
     function t(t, e, n, 
     /**
      * A pre-computed mapping from each mutated document to the resulting
@@ -5375,7 +5375,7 @@ function ii(t, e, n) {
         for (var i = Sr, o = e.mutations, u = 0; u < o.length; u++) i = i.insert(o[u].key, r[u].version);
         return new t(e, n, r, i);
     }, t;
-}(), fi = /** @class */ function() {
+}(), hi = /** @class */ function() {
     function t(t, e) {
         this.largestBatchId = t, this.mutation = e;
     }
@@ -5998,22 +5998,22 @@ n
                         this.Qe = this.Qe.insert(e, c);
                     }
                     null == yi || yi.et(function(t, e, n, r, i) {
-                        var o, u, a, s, c, l, h = {
+                        var o, u, a, s, c, l, f = {
                             localCacheCount: t,
                             existenceFilterCount: e.count,
                             databaseId: n.database,
                             projectId: n.projectId
-                        }, f = e.unchangedNames;
-                        return f && (h.bloomFilter = {
+                        }, h = e.unchangedNames;
+                        return h && (f.bloomFilter = {
                             applied: 0 /* BloomFilterApplicationStatus.Success */ === i,
-                            hashCount: null !== (o = null == f ? void 0 : f.hashCount) && void 0 !== o ? o : 0,
-                            bitmapLength: null !== (s = null === (a = null === (u = null == f ? void 0 : f.bits) || void 0 === u ? void 0 : u.bitmap) || void 0 === a ? void 0 : a.length) && void 0 !== s ? s : 0,
-                            padding: null !== (l = null === (c = null == f ? void 0 : f.bits) || void 0 === c ? void 0 : c.padding) && void 0 !== l ? l : 0,
+                            hashCount: null !== (o = null == h ? void 0 : h.hashCount) && void 0 !== o ? o : 0,
+                            bitmapLength: null !== (s = null === (a = null === (u = null == h ? void 0 : h.bits) || void 0 === u ? void 0 : u.bitmap) || void 0 === a ? void 0 : a.length) && void 0 !== s ? s : 0,
+                            padding: null !== (l = null === (c = null == h ? void 0 : h.bits) || void 0 === c ? void 0 : c.padding) && void 0 !== l ? l : 0,
                             mightContain: function(t) {
                                 var e;
                                 return null !== (e = null == r ? void 0 : r.mightContain(t)) && void 0 !== e && e;
                             }
-                        }), h;
+                        }), f;
                     }(u, t.me, this.Le.tt(), a, s));
                 }
             }
@@ -6355,7 +6355,7 @@ function $i(t, e) {
         delete: ji(t, e.key)
     }; else if (e instanceof ni) n = {
         update: Xi(t, e.key, e.data),
-        updateMask: fo(e.fieldMask)
+        updateMask: ho(e.fieldMask)
     }; else {
         if (!(e instanceof ci)) return U();
         n = {
@@ -6409,7 +6409,7 @@ function to(t, e) {
                 var i = e.removeAllFromArray.values || [];
                 n = new Ur(i);
             } else "increment" in e ? n = new zr(t, e.increment) : U();
-            var o = ft.fromServerFormat(e.fieldPath);
+            var o = ht.fromServerFormat(e.fieldPath);
             return new jr(o, n);
         }(t, e);
     })) : [];
@@ -6424,7 +6424,7 @@ function to(t, e) {
             var u = function(t) {
                 var e = t.fieldPaths || [];
                 return new Oe(e.map((function(t) {
-                    return ft.fromServerFormat(t);
+                    return ht.fromServerFormat(t);
                 })));
             }(e.updateMask);
             return new ni(i, o, u, n, r);
@@ -6460,7 +6460,7 @@ function no(t, e) {
         collectionId: i.lastSegment()
     } ]), r.parent = Wi(t, n);
     var o = function(t) {
-        if (0 !== t.length) return ho(Dn.create(t, "and" /* CompositeOperator.AND */));
+        if (0 !== t.length) return fo(Dn.create(t, "and" /* CompositeOperator.AND */));
     }(e.filters);
     o && (r.structuredQuery.where = o);
     var u = function(t) {
@@ -6680,10 +6680,10 @@ function co(t) {
 }
 
 function lo(t) {
-    return ft.fromServerFormat(t.fieldPath);
+    return ht.fromServerFormat(t.fieldPath);
 }
 
-function ho(t) {
+function fo(t) {
     return t instanceof xn ? function(t) {
         if ("==" /* Operator.EQUAL */ === t.op) {
             if (an(t.value)) return {
@@ -6721,7 +6721,7 @@ function ho(t) {
         };
     }(t) : t instanceof Dn ? function(t) {
         var e = t.getFilters().map((function(t) {
-            return ho(t);
+            return fo(t);
         }));
         return 1 === e.length ? e[0] : {
             compositeFilter: {
@@ -6732,7 +6732,7 @@ function ho(t) {
     }(t) : U();
 }
 
-function fo(t) {
+function ho(t) {
     var e = [];
     return t.fields.forEach((function(t) {
         return e.push(t.canonicalString());
@@ -6965,7 +6965,7 @@ function To(t, e) {
 
 /** Encodes a NamedQuery proto object to a NamedQuery model object. */
 /** Encodes a DbDocumentOverlay object to an Overlay model object. */ function So(t, e) {
-    return new fi(e.largestBatchId, to(t.ct, e.overlayMutation));
+    return new hi(e.largestBatchId, to(t.ct, e.overlayMutation));
 }
 
 /** Decodes an Overlay model object into a DbDocumentOverlay object. */
@@ -7101,7 +7101,7 @@ function Do(t, e, n, r) {
     }, t.prototype.saveOverlays = function(t, e, n) {
         var r = this, i = [];
         return n.forEach((function(n, o) {
-            var u = new fi(e, o);
+            var u = new hi(e, o);
             i.push(r.ht(t, u));
         })), Ct.waitFor(i);
     }, t.prototype.removeOverlaysForBatchId = function(t, e, n) {
@@ -7222,7 +7222,7 @@ function Do(t, e, n, r) {
         e.gt(qe(t.bytesValue)), this.ft(e); else if ("referenceValue" in t) this.yt(t.referenceValue, e); else if ("geoPointValue" in t) {
             var i = t.geoPointValue;
             this.dt(e, 45), e.At(i.latitude || 0), e.At(i.longitude || 0);
-        } else "mapValue" in t ? hn(t) ? this.dt(e, Number.MAX_SAFE_INTEGER) : cn(t) ? this.wt(t.mapValue, e) : (this.St(t.mapValue, e), 
+        } else "mapValue" in t ? fn(t) ? this.dt(e, Number.MAX_SAFE_INTEGER) : cn(t) ? this.wt(t.mapValue, e) : (this.St(t.mapValue, e), 
         this.ft(e)) : "arrayValue" in t ? (this.bt(t.arrayValue, e), this.ft(e)) : U();
     }, t.prototype.Vt = function(t, e) {
         this.dt(e, 25), this.Dt(t, e);
@@ -7557,7 +7557,7 @@ function Go(t, e) {
         // Note: The sort on FieldFilters is not required. Using SortedSet here just to utilize the custom
         // comparator.
         this.Xt = new Ne((function(t, e) {
-            return ft.comparator(t.field, e.field);
+            return ht.comparator(t.field, e.field);
         })), this.collectionId = null != t.collectionGroup ? t.collectionGroup : t.path.lastSegment(), 
         this.en = t.orderBy, this.tn = [];
         for (var e = 0, n = t.filters; e < n.length; e++) {
@@ -7636,7 +7636,7 @@ function Go(t, e) {
         // We want to make sure only one segment created for one field. For example,
         // in case like a == 3 and a > 2, Index {a ASCENDING} will only be created
         // once.
-                for (var t = new Ne(ft.comparator), e = [], n = 0, r = this.tn; n < r.length; n++) {
+                for (var t = new Ne(ht.comparator), e = [], n = 0, r = this.tn; n < r.length; n++) {
             var i = r[n];
             if (!i.field.isKeyField()) if ("array-contains" /* Operator.ARRAY_CONTAINS */ === i.op || "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === i.op) e.push(new gt(i.field, 2 /* IndexKind.CONTAINS */)); else {
                 if (t.has(i.field)) continue;
@@ -8118,7 +8118,7 @@ var tu = /** @class */ function() {
                             n.push(a.value), r && (r = a.inclusive);
                         }
                         return new bn(n, r);
-                    }(o, i), h = n.In(i, o, c), f = n.In(i, o, l), d = n.Tn(i, o, s), p = n.En(i.indexId, a, h, c.inclusive, f, l.inclusive, d);
+                    }(o, i), f = n.In(i, o, c), h = n.In(i, o, l), d = n.Tn(i, o, s), p = n.En(i.indexId, a, f, c.inclusive, h, l.inclusive, d);
                     return Ct.forEach(p, (function(n) {
                         return r.G(n, e.limit).next((function(e) {
                             e.forEach((function(e) {
@@ -8144,18 +8144,18 @@ var tu = /** @class */ function() {
      * bounds.
      */
     t.prototype.En = function(t, e, n, r, i, o, u) {
-        for (var a = this, s = (null != e ? e.length : 1) * Math.max(n.length, i.length), c = s / (null != e ? e.length : 1), l = [], h = function(s) {
-            var h = e ? f.dn(e[s / c]) : nu, d = f.An(t, h, n[s % c], r), p = f.Rn(t, h, i[s % c], o), v = u.map((function(e) {
-                return a.An(t, h, e, 
+        for (var a = this, s = (null != e ? e.length : 1) * Math.max(n.length, i.length), c = s / (null != e ? e.length : 1), l = [], f = function(s) {
+            var f = e ? h.dn(e[s / c]) : nu, d = h.An(t, f, n[s % c], r), p = h.Rn(t, f, i[s % c], o), v = u.map((function(e) {
+                return a.An(t, f, e, 
                 /* inclusive= */ !0);
             }));
-            l.push.apply(l, f.createRange(d, p, v));
-        }, f = this, d = 0
+            l.push.apply(l, h.createRange(d, p, v));
+        }, h = this, d = 0
         // The number of total index scans we union together. This is similar to a
         // distributed normal form, but adapted for array values. We create a single
         // index range per value in an ARRAY_CONTAINS or ARRAY_CONTAINS_ANY filter
         // combined with the values from the query bounds.
-        ; d < s; ++d) h(d);
+        ; d < s; ++d) f(d);
         return l;
     }, 
     /** Generates the lower bound for `arrayValue` and `directionalValue`. */ t.prototype.An = function(t, e, n, r) {
@@ -8181,7 +8181,7 @@ var tu = /** @class */ function() {
         return Ct.forEach(i, (function(e) {
             return n.Pn(t, e).next((function(t) {
                 t ? 0 /* IndexType.NONE */ !== r && t.fields.length < function(t) {
-                    for (var e = new Ne(ft.comparator), n = !1, r = 0, i = t.filters; r < i.length; r++) for (var o = 0, u = i[r].getFlattenedFilters(); o < u.length; o++) {
+                    for (var e = new Ne(ht.comparator), n = !1, r = 0, i = t.filters; r < i.length; r++) for (var o = 0, u = i[r].getFlattenedFilters(); o < u.length; o++) {
                         var a = u[o];
                         // __name__ is not an explicit segment of any index, so we don't need to
                         // count it.
@@ -8248,10 +8248,10 @@ var tu = /** @class */ function() {
         var r = [];
         r.push(new Uo);
         for (var i = 0, o = 0, u = mt(t); o < u.length; o++) for (var a = u[o], s = n[i++], c = 0, l = r; c < l.length; c++) {
-            var h = l[c];
+            var f = l[c];
             if (this.fn(e, a.fieldPath) && on(s)) r = this.gn(r, a, s); else {
-                var f = h.Yt(a.kind);
-                Ro.vt.It(s, f);
+                var h = f.Yt(a.kind);
+                Ro.vt.It(s, h);
             }
         }
         return this.pn(r);
@@ -8276,8 +8276,8 @@ var tu = /** @class */ function() {
      */
     t.prototype.gn = function(t, e, n) {
         for (var i = r([], t, !0), o = [], u = 0, a = n.arrayValue.values || []; u < a.length; u++) for (var s = a[u], c = 0, l = i; c < l.length; c++) {
-            var h = l[c], f = new Uo;
-            f.seed(h.zt()), Ro.vt.It(s, f.Yt(e.kind)), o.push(f);
+            var f = l[c], h = new Uo;
+            h.seed(f.zt()), Ro.vt.It(s, h.Yt(e.kind)), o.push(h);
         }
         return o;
     }, t.prototype.fn = function(t, e) {
@@ -8293,7 +8293,7 @@ var tu = /** @class */ function() {
                     e.push(function(t, e) {
                         var n = e ? new bt(e.sequenceNumber, new Tt(bo(e.readTime), new dt(Jt(e.documentKey)), e.largestBatchId)) : bt.empty(), r = t.fields.map((function(t) {
                             var e = t[0], n = t[1];
-                            return new gt(ft.fromServerFormat(e), n);
+                            return new gt(ht.fromServerFormat(e), n);
                         }));
                         return new pt(t.indexId, t.collectionGroup, r, n);
                     }(t, n));
@@ -8386,11 +8386,11 @@ var tu = /** @class */ function() {
             for (var o = t.getIterator(), u = e.getIterator(), a = ke(o), s = ke(u); a || s; ) {
                 var c = !1, l = !1;
                 if (a && s) {
-                    var h = n(a, s);
-                    h < 0 ? 
+                    var f = n(a, s);
+                    f < 0 ? 
                     // The element was removed if the next element in our ordered
                     // walkthrough is only in `before`.
-                    l = !0 : h > 0 && (
+                    l = !0 : f > 0 && (
                     // The element was added if the next element in our ordered walkthrough
                     // is only in `after`.
                     c = !0);
@@ -8447,8 +8447,8 @@ var tu = /** @class */ function() {
             // If we encounter two bounds that will create an unmatchable key range,
             // then we return an empty set of key ranges.
             if (this.Cn(r[l], r[l + 1])) return [];
-            var h = [ r[l].indexId, this.uid, r[l].arrayValue, r[l].directionalValue, nu, [] ], f = [ r[l + 1].indexId, this.uid, r[l + 1].arrayValue, r[l + 1].directionalValue, nu, [] ];
-            c.push(IDBKeyRange.bound(h, f));
+            var f = [ r[l].indexId, this.uid, r[l].arrayValue, r[l].directionalValue, nu, [] ], h = [ r[l + 1].indexId, this.uid, r[l + 1].arrayValue, r[l + 1].directionalValue, nu, [] ];
+            c.push(IDBKeyRange.bound(f, h));
         }
         return c;
     }, t.prototype.Cn = function(t, e) {
@@ -8564,7 +8564,7 @@ function su(t) {
  * Delete a mutation batch and the associated document mutations.
  * @returns A PersistencePromise of the document mutations that were removed.
  */
-function hu(t, e, n) {
+function fu(t, e, n) {
     var r = t.store("mutations"), i = t.store("documentMutations"), o = [], u = IDBKeyRange.only(n.batchId), a = 0, s = r.J({
         range: u
     }, (function(t, e, n) {
@@ -8573,9 +8573,9 @@ function hu(t, e, n) {
     o.push(s.next((function() {
         B(1 === a);
     })));
-    for (var c = [], l = 0, h = n.mutations; l < h.length; l++) {
-        var f = h[l], d = Xt(e, f.key.path, n.batchId);
-        o.push(i.delete(d)), c.push(f.key);
+    for (var c = [], l = 0, f = n.mutations; l < f.length; l++) {
+        var h = f[l], d = Xt(e, h.key.path, n.batchId);
+        o.push(i.delete(d)), c.push(h.key);
     }
     return Ct.waitFor(o).next((function() {
         return c;
@@ -8584,7 +8584,7 @@ function hu(t, e, n) {
 
 /**
  * Returns an approximate size for the given document.
- */ function fu(t) {
+ */ function hu(t) {
     if (!t) return 0;
     var e;
     if (t.document) e = t.document; else if (t.unknownDocument) e = t.unknownDocument; else {
@@ -8683,13 +8683,13 @@ var du = /** @class */ function() {
                     baseMutations: r,
                     mutations: i
                 };
-            }(i.serializer, i.userId, s), l = [], h = new Ne((function(t, e) {
+            }(i.serializer, i.userId, s), l = [], f = new Ne((function(t, e) {
                 return it(t.canonicalString(), e.canonicalString());
-            })), f = 0, d = r; f < d.length; f++) {
-                var p = d[f], v = Xt(i.userId, p.key.path, a);
-                h = h.add(p.key.path.popLast()), l.push(u.put(c)), l.push(o.put(v, Zt));
+            })), h = 0, d = r; h < d.length; h++) {
+                var p = d[h], v = Xt(i.userId, p.key.path, a);
+                f = f.add(p.key.path.popLast()), l.push(u.put(c)), l.push(o.put(v, Zt));
             }
-            return h.forEach((function(e) {
+            return f.forEach((function(e) {
                 l.push(i.indexManager.addToCollectionParentIndex(t, e));
             })), t.addOnCommittedListener((function() {
                 i.Fn[a] = s.keys();
@@ -8821,7 +8821,7 @@ var du = /** @class */ function() {
         }));
     }, t.prototype.removeMutationBatch = function(t, e) {
         var n = this;
-        return hu(t._e, this.userId, e).next((function(r) {
+        return fu(t._e, this.userId, e).next((function(r) {
             return t.addOnCommittedListener((function() {
                 n.On(e.batchId);
             })), Ct.forEach(r, (function(e) {
@@ -9331,7 +9331,7 @@ function bu(t) {
         })).next((function(e) {
             return i = e, a = Date.now(), c.removeOrphanedDocuments(t, n);
         })).next((function(t) {
-            return s = Date.now(), R() <= h.DEBUG && F("LruGarbageCollector", "LRU Garbage Collection\n\tCounted targets in ".concat(o - l, "ms\n\tDetermined least recently used ").concat(r, " in ") + (u - o) + "ms\n" + "\tRemoved ".concat(i, " targets in ") + (a - u) + "ms\n" + "\tRemoved ".concat(t, " documents in ") + (s - a) + "ms\n" + "Total Duration: ".concat(s - l, "ms")), 
+            return s = Date.now(), R() <= f.DEBUG && F("LruGarbageCollector", "LRU Garbage Collection\n\tCounted targets in ".concat(o - l, "ms\n\tDetermined least recently used ").concat(r, " in ") + (u - o) + "ms\n" + "\tRemoved ".concat(i, " targets in ") + (a - u) + "ms\n" + "\tRemoved ".concat(t, " documents in ") + (s - a) + "ms\n" + "Total Duration: ".concat(s - l, "ms")), 
             Ct.resolve({
                 didRun: !0,
                 sequenceNumbersCollected: r,
@@ -9660,7 +9660,7 @@ function Nu(t, e) {
         }, (function(t, i) {
             r = {
                 document: n.ir(e, i),
-                size: fu(i)
+                size: hu(i)
             };
         })).next((function() {
             return r;
@@ -9685,7 +9685,7 @@ function Nu(t, e) {
         var n = this, r = gr(), i = new xe(dt.comparator);
         return this._r(t, e, (function(t, e) {
             var o = n.ir(t, e);
-            r = r.insert(t, o), i = i.insert(t, fu(e));
+            r = r.insert(t, o), i = i.insert(t, hu(e));
         })).next((function() {
             return {
                 documents: r,
@@ -9722,7 +9722,7 @@ function Nu(t, e) {
             null == i || i.incrementDocumentReadCount(t.length);
             for (var n = gr(), u = 0, a = t; u < a.length; u++) {
                 var s = a[u], c = o.ir(dt.fromSegments(s.prefixPath.concat(s.collectionGroup, s.documentId)), s);
-                c.isFoundDocument() && (fr(e, c) || r.has(c.key)) && (
+                c.isFoundDocument() && (hr(e, c) || r.has(c.key)) && (
                 // Either the document matches the given query, or it is mutated.
                 n = n.insert(c.key, c));
             }
@@ -9838,7 +9838,7 @@ function Nu(t, e) {
             if (n.push(e.cr.removeEntry(t, o, a.readTime)), u.isValidDocument()) {
                 var s = yo(e.cr.serializer, u);
                 i = i.add(o.path.popLast());
-                var c = fu(s);
+                var c = hu(s);
                 r += c - a.size, n.push(e.cr.addEntry(t, o, s));
             } else if (r -= a.size, e.trackRemovals) {
                 // In order to track removals, we store a "sentinel delete" in the
@@ -10251,7 +10251,7 @@ e) {
                 var o = i.get(t);
                 void 0 !== o && Zr(o.mutation, r, Oe.empty(), at.now()), 
                 // Finally, insert the documents that still match the query
-                fr(e, r) && (n = n.insert(t, r));
+                hr(e, r) && (n = n.insert(t, r));
             })), n;
         }));
     }, t;
@@ -10338,7 +10338,7 @@ e) {
             var i = this.Ir.get(r.largestBatchId).delete(n.key);
             this.Ir.set(r.largestBatchId, i);
         }
-        this.overlays = this.overlays.insert(n.key, new fi(e, n));
+        this.overlays = this.overlays.insert(n.key, new hi(e, n));
         // Create the association of this overlay to the given largestBatchId.
         var o = this.Ir.get(e);
         void 0 === o && (o = Dr(), this.Ir.set(e, o)), this.Ir.set(e, o.add(n.key));
@@ -10609,7 +10609,7 @@ e) {
         ; a.hasNext(); ) {
             var s = a.getNext(), c = s.key, l = s.value.document;
             if (!o.isPrefixOf(c.path)) break;
-            c.path.length > o.length + 1 || Et(It(l), n) <= 0 || (r.has(l.key) || fr(e, l)) && (i = i.insert(l.key, l.mutableCopy()));
+            c.path.length > o.length + 1 || Et(It(l), n) <= 0 || (r.has(l.key) || hr(e, l)) && (i = i.insert(l.key, l.mutableCopy()));
         }
         return Ct.resolve(i);
     }, t.prototype.getAllFromCollectionGroup = function(t, e, n, r) {
@@ -11048,9 +11048,9 @@ e) {
                 var e = t.createObjectStore("documentOverlays", {
                     keyPath: le
                 });
-                e.createIndex("collectionPathOverlayIndex", he, {
+                e.createIndex("collectionPathOverlayIndex", fe, {
                     unique: !1
-                }), e.createIndex("collectionGroupOverlayIndex", fe, {
+                }), e.createIndex("collectionGroupOverlayIndex", he, {
                     unique: !1
                 });
             }(t);
@@ -11100,7 +11100,7 @@ e) {
     }, t.prototype.ri = function(t) {
         var e = 0;
         return t.store("remoteDocuments").J((function(t, n) {
-            e += fu(n);
+            e += hu(n);
         })).next((function() {
             var n = {
                 byteSize: e
@@ -11116,7 +11116,7 @@ e) {
                     return Ct.forEach(r, (function(r) {
                         B(r.userId === n.userId);
                         var i = _o(e.serializer, r);
-                        return hu(t, n.userId, i).next((function() {}));
+                        return fu(t, n.userId, i).next((function() {}));
                     }));
                 }));
             }));
@@ -11267,10 +11267,10 @@ var na = "Failed to obtain exclusive access to the persistence layer. To allow s
      * If set to true, forcefully obtains database access. Existing tabs will
      * no longer be able to access IndexedDB.
      */
-    l, h) {
-        if (void 0 === h && (h = 17), this.allowTabSynchronization = e, this.persistenceKey = n, 
+    l, f) {
+        if (void 0 === f && (f = 17), this.allowTabSynchronization = e, this.persistenceKey = n, 
         this.clientId = r, this.ui = o, this.window = u, this.document = a, this.ci = c, 
-        this.li = l, this.hi = h, this.Qr = null, this.Kr = !1, this.isPrimary = !1, this.networkEnabled = !0, 
+        this.li = l, this.hi = f, this.Qr = null, this.Kr = !1, this.isPrimary = !1, this.networkEnabled = !0, 
         /** Our window.unload handler, if registered. */
         this.Pi = null, this.inForeground = !1, 
         /** Our 'visibilitychange' listener if registered. */
@@ -11936,9 +11936,9 @@ var aa = /** @class */ function() {
             return o.result;
         }));
     }, t.prototype.es = function(t, e, n, r) {
-        return n.documentReadCount < this.ji ? (R() <= h.DEBUG && F("QueryEngine", "SDK will not create cache indexes for query:", hr(e), "since it only creates cache indexes for collection contains", "more than or equal to", this.ji, "documents"), 
-        Ct.resolve()) : (R() <= h.DEBUG && F("QueryEngine", "Query:", hr(e), "scans", n.documentReadCount, "local documents and returns", r, "documents as results."), 
-        n.documentReadCount > this.Hi * r ? (R() <= h.DEBUG && F("QueryEngine", "The SDK decides to create cache indexes for query:", hr(e), "as using cache indexes may help improve performance."), 
+        return n.documentReadCount < this.ji ? (R() <= f.DEBUG && F("QueryEngine", "SDK will not create cache indexes for query:", fr(e), "since it only creates cache indexes for collection contains", "more than or equal to", this.ji, "documents"), 
+        Ct.resolve()) : (R() <= f.DEBUG && F("QueryEngine", "Query:", fr(e), "scans", n.documentReadCount, "local documents and returns", r, "documents as results."), 
+        n.documentReadCount > this.Hi * r ? (R() <= f.DEBUG && F("QueryEngine", "The SDK decides to create cache indexes for query:", fr(e), "as using cache indexes may help improve performance."), 
         this.indexManager.createTargetIndexes(t, ir(e))) : Ct.resolve());
     }, 
     /**
@@ -11981,7 +11981,7 @@ var aa = /** @class */ function() {
         var i = this;
         return er(e) || r.isEqual(st.min()) ? Ct.resolve(null) : this.Ji.getDocuments(t, n).next((function(o) {
             var u = i.ts(e, o);
-            return i.ns(e, u, n, r) ? Ct.resolve(null) : (R() <= h.DEBUG && F("QueryEngine", "Re-using previous result from %s to execute query: %s", r.toString(), hr(e)), 
+            return i.ns(e, u, n, r) ? Ct.resolve(null) : (R() <= f.DEBUG && F("QueryEngine", "Re-using previous result from %s to execute query: %s", r.toString(), fr(e)), 
             i.rs(t, u, e, _t(r, -1)).next((function(t) {
                 return t;
             })));
@@ -11994,7 +11994,7 @@ var aa = /** @class */ function() {
         // matching documents do not necessarily still match the query.
         var n = new Ne(pr(t));
         return e.forEach((function(e, r) {
-            fr(t, r) && (n = n.add(r));
+            hr(t, r) && (n = n.add(r));
         })), n;
     }, 
     /**
@@ -12028,7 +12028,7 @@ var aa = /** @class */ function() {
                 var i = "F" /* LimitType.First */ === t.limitType ? e.last() : e.first();
         return !!i && (i.hasPendingWrites || i.version.compareTo(r) > 0);
     }, t.prototype.Xi = function(t, e, n) {
-        return R() <= h.DEBUG && F("QueryEngine", "Using full collection scan to execute query:", hr(e)), 
+        return R() <= f.DEBUG && F("QueryEngine", "Using full collection scan to execute query:", fr(e)), 
         this.Ji.getDocumentsMatchingQuery(t, e, Tt.min(), n);
     }, 
     /**
@@ -12103,7 +12103,7 @@ var aa = /** @class */ function() {
 /**
  * A tracker to keep a record of important details during database local query
  * execution.
- */ function ha(
+ */ function fa(
 /** Manages our in-memory or durable persistence. */
 t, e, n, r) {
     return new la(t, e, n, r);
@@ -12117,7 +12117,7 @@ t, e, n, r) {
  */
 // PORTING NOTE: Android and iOS only return the documents affected by the
 // change.
-function fa(t, r) {
+function ha(t, r) {
     return e(this, void 0, void 0, (function() {
         var e;
         return n(this, (function(n) {
@@ -12135,9 +12135,9 @@ function fa(t, r) {
                         ; a < s.length; a++) {
                             var c = s[a];
                             i.push(c.batchId);
-                            for (var l = 0, h = c.mutations; l < h.length; l++) {
-                                var f = h[l];
-                                u = u.add(f.key);
+                            for (var l = 0, f = c.mutations; l < f.length; l++) {
+                                var h = f[l];
+                                u = u.add(h.key);
                             }
                         }
                         for (var d = 0, p = r; d < p.length; d++) {
@@ -12532,13 +12532,13 @@ function Ta(t, e, n) {
  * queue.
  */ function Ea(t, r, i, o) {
     return e(this, void 0, void 0, (function() {
-        var e, u, a, s, c, l, h, f, d, p;
+        var e, u, a, s, c, l, f, h, d, p;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                for (e = G(t), u = Dr(), a = gr(), s = 0, c = i; s < c.length; s++) l = c[s], h = r.Es(l.metadata.name), 
-                l.document && (u = u.add(h)), (f = r.ds(l)).setReadTime(r.As(l.metadata.readTime)), 
-                a = a.insert(h, f);
+                for (e = G(t), u = Dr(), a = gr(), s = 0, c = i; s < c.length; s++) l = c[s], f = r.Es(l.metadata.name), 
+                l.document && (u = u.add(f)), (h = r.ds(l)).setReadTime(r.As(l.metadata.readTime)), 
+                a = a.insert(f, h);
                 return d = e.cs.newChangeBuffer({
                     trackRemovals: !0
                 }), [ 4 /*yield*/ , ga(e, function(t) {
@@ -12764,7 +12764,7 @@ var Na = /** @class */ function() {
         return !(!t || !t.localStorage);
     }, t.prototype.start = function() {
         return e(this, void 0, void 0, (function() {
-            var t, e, r, i, o, u, a, s, c, l, h, f = this;
+            var t, e, r, i, o, u, a, s, c, l, f, h = this;
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
@@ -12773,12 +12773,12 @@ var Na = /** @class */ function() {
                   case 1:
                     for (t = n.sent(), e = 0, r = t; e < r.length; e++) (i = r[e]) !== this.ps && (o = this.getItem(xa(this.persistenceKey, i))) && (u = ka.Rs(i, o)) && (this.Ss = this.Ss.insert(u.clientId, u));
                     for (this.Ns(), (a = this.storage.getItem(this.xs)) && (s = this.Ls(a)) && this.Bs(s), 
-                    c = 0, l = this.bs; c < l.length; c++) h = l[c], this.ws(h);
+                    c = 0, l = this.bs; c < l.length; c++) f = l[c], this.ws(f);
                     return this.bs = [], 
                     // Register a window unload hook to remove the client metadata entry from
                     // WebStorage even if `shutdown()` was not called.
                     this.window.addEventListener("pagehide", (function() {
-                        return f.shutdown();
+                        return h.shutdown();
                     })), this.started = !0, [ 2 /*return*/ ];
                 }
             }));
@@ -13247,10 +13247,10 @@ var Ua = {
         a.encodeInitMessageHeaders = !0;
         var c = i.join("");
         F(za, "Creating RPC '".concat(t, "' stream ").concat(r, ": ").concat(c), a);
-        var l = o.createWebChannel(c, a), h = !1, f = !1, d = new Ba({
+        var l = o.createWebChannel(c, a), f = !1, h = !1, d = new Ba({
             Io: function(e) {
-                f ? F(za, "Not sending because RPC '".concat(t, "' stream ").concat(r, " is closed:"), e) : (h || (F(za, "Opening RPC '".concat(t, "' stream ").concat(r, " transport.")), 
-                l.open(), h = !0), F(za, "RPC '".concat(t, "' stream ").concat(r, " sending:"), e), 
+                h ? F(za, "Not sending because RPC '".concat(t, "' stream ").concat(r, " is closed:"), e) : (f || (F(za, "Opening RPC '".concat(t, "' stream ").concat(r, " transport.")), 
+                l.open(), f = !0), F(za, "RPC '".concat(t, "' stream ").concat(r, " sending:"), e), 
                 l.send(e));
             },
             To: function() {
@@ -13279,16 +13279,16 @@ var Ua = {
         // Note that eventually this function could go away if we are confident
         // enough the code is exception free.
         return p(l, D.EventType.OPEN, (function() {
-            f || (F(za, "RPC '".concat(t, "' stream ").concat(r, " transport opened.")), d.yo());
+            h || (F(za, "RPC '".concat(t, "' stream ").concat(r, " transport opened.")), d.yo());
         })), p(l, D.EventType.CLOSE, (function() {
-            f || (f = !0, F(za, "RPC '".concat(t, "' stream ").concat(r, " transport closed")), 
+            h || (h = !0, F(za, "RPC '".concat(t, "' stream ").concat(r, " transport closed")), 
             d.So());
         })), p(l, D.EventType.ERROR, (function(e) {
-            f || (f = !0, L(za, "RPC '".concat(t, "' stream ").concat(r, " transport errored:"), e), 
+            h || (h = !0, L(za, "RPC '".concat(t, "' stream ").concat(r, " transport errored:"), e), 
             d.So(new j(K.UNAVAILABLE, "The operation could not be completed")));
         })), p(l, D.EventType.MESSAGE, (function(e) {
             var n;
-            if (!f) {
+            if (!h) {
                 var i = e.data[0];
                 B(!!i);
                 // TODO(b/35143891): There is a bug in One Platform that caused errors
@@ -13315,7 +13315,7 @@ var Ua = {
                     }(a), c = u.message;
                     void 0 === s && (s = K.INTERNAL, c = "Unknown error status: " + a + " with message " + u.message), 
                     // Mark closed so no further events are propagated
-                    f = !0, d.So(new j(s, c)), l.close();
+                    h = !0, d.So(new j(s, c)), l.close();
                 } else F(za, "RPC '".concat(t, "' stream ").concat(r, " received:"), i), d.bo(i);
             }
         })), p(u, C.STAT_EVENT, (function(e) {
@@ -13859,11 +13859,11 @@ function Ka() {
                 e.documentChange;
                 var s = e.documentChange;
                 s.document, s.document.name, s.document.updateTime;
-                var c = Qi(t, s.document.name), l = Bi(s.document.updateTime), h = s.document.createTime ? Bi(s.document.createTime) : st.min(), f = new yn({
+                var c = Qi(t, s.document.name), l = Bi(s.document.updateTime), f = s.document.createTime ? Bi(s.document.createTime) : st.min(), h = new yn({
                     mapValue: {
                         fields: s.document.fields
                     }
-                }), d = wn.newFoundDocument(c, l, h, f), p = s.targetIds || [], v = s.removedTargetIds || [];
+                }), d = wn.newFoundDocument(c, l, f, h), p = s.targetIds || [], v = s.removedTargetIds || [];
                 n = new xi(p, v, d.key, d);
             } else if ("documentDelete" in e) {
                 e.documentDelete;
@@ -14398,7 +14398,7 @@ function ls(t) {
     }));
 }
 
-function hs(t) {
+function fs(t) {
     return e(this, void 0, void 0, (function() {
         return n(this, (function(e) {
             return t.N_.forEach((function(e, n) {
@@ -14408,7 +14408,7 @@ function hs(t) {
     }));
 }
 
-function fs(t, r) {
+function hs(t, r) {
     return e(this, void 0, void 0, (function() {
         return n(this, (function(e) {
             return cs(t), 
@@ -14686,7 +14686,7 @@ function _s(t, r, i) {
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = t.O_.shift(), o = hi.from(e, r, i), [ 4 /*yield*/ , vs(t, (function() {
+                return e = t.O_.shift(), o = fi.from(e, r, i), [ 4 /*yield*/ , vs(t, (function() {
                     return t.remoteSyncer.applySuccessfulWrite(o);
                 })) ];
 
@@ -14837,8 +14837,8 @@ function Ts(t, r) {
         return r.w_(), new Ha(e, r.connection, r.authCredentials, r.appCheckCredentials, r.serializer, n);
     }(t.datastore, t.asyncQueue, {
         Eo: ls.bind(null, t),
-        Ro: hs.bind(null, t),
-        mo: fs.bind(null, t),
+        Ro: fs.bind(null, t),
+        mo: hs.bind(null, t),
         d_: ds.bind(null, t)
     }), t.B_.push((function(i) {
         return e(r, void 0, void 0, (function() {
@@ -15277,7 +15277,7 @@ function Ms(t, r) {
                 return [ 3 /*break*/ , 10 ];
 
               case 9:
-                return c = n.sent(), l = Cs(c, "Initialization of query '".concat(hr(r.query), "' failed")), 
+                return c = n.sent(), l = Cs(c, "Initialization of query '".concat(fr(r.query), "' failed")), 
                 [ 2 /*return*/ , void r.onError(l) ];
 
               case 10:
@@ -15620,32 +15620,32 @@ function Qs(t) {
         var n = this, r = e ? e.fa : new Os, i = e ? e.Ra : this.Ra, o = e ? e.mutatedKeys : this.mutatedKeys, u = i, a = !1, s = "F" /* LimitType.First */ === this.query.limitType && i.size === this.query.limit ? i.last() : null, c = "L" /* LimitType.Last */ === this.query.limitType && i.size === this.query.limit ? i.first() : null;
         // Drop documents out to meet limit/limitToLast requirement.
         if (t.inorderTraversal((function(t, e) {
-            var l = i.get(t), h = fr(n.query, e) ? e : null, f = !!l && n.mutatedKeys.has(l.key), d = !!h && (h.hasLocalMutations || 
+            var l = i.get(t), f = hr(n.query, e) ? e : null, h = !!l && n.mutatedKeys.has(l.key), d = !!f && (f.hasLocalMutations || 
             // We only consider committed mutations for documents that were
             // mutated during the lifetime of the view.
-            n.mutatedKeys.has(h.key) && h.hasCommittedMutations), p = !1;
+            n.mutatedKeys.has(f.key) && f.hasCommittedMutations), p = !1;
             // Calculate change
-            l && h ? l.data.isEqual(h.data) ? f !== d && (r.track({
+            l && f ? l.data.isEqual(f.data) ? h !== d && (r.track({
                 type: 3 /* ChangeType.Metadata */ ,
-                doc: h
-            }), p = !0) : n.ga(l, h) || (r.track({
+                doc: f
+            }), p = !0) : n.ga(l, f) || (r.track({
                 type: 2 /* ChangeType.Modified */ ,
-                doc: h
-            }), p = !0, (s && n.Aa(h, s) > 0 || c && n.Aa(h, c) < 0) && (
+                doc: f
+            }), p = !0, (s && n.Aa(f, s) > 0 || c && n.Aa(f, c) < 0) && (
             // This doc moved from inside the limit to outside the limit.
             // That means there may be some other doc in the local cache
             // that should be included instead.
-            a = !0)) : !l && h ? (r.track({
+            a = !0)) : !l && f ? (r.track({
                 type: 0 /* ChangeType.Added */ ,
-                doc: h
-            }), p = !0) : l && !h && (r.track({
+                doc: f
+            }), p = !0) : l && !f && (r.track({
                 type: 1 /* ChangeType.Removed */ ,
                 doc: l
             }), p = !0, (s || c) && (
             // A doc was removed from a full limit query. We'll need to
             // requery from the local cache to see if we know about some other
             // doc that should be in the results.
-            a = !0)), p && (h ? (u = u.add(h), o = d ? o.add(t) : o.delete(t)) : (u = u.delete(t), 
+            a = !0)), p && (f ? (u = u.add(f), o = d ? o.add(t) : o.delete(t)) : (u = u.delete(t), 
             o = o.delete(t)));
         })), null !== this.query.limit) for (;u.size > this.query.limit; ) {
             var l = "F" /* LimitType.First */ === this.query.limitType ? u.last() : u.first();
@@ -15967,7 +15967,7 @@ function ec(t, r, i, o) {
  * snapshot.
  */ function nc(t, r, i, o, u) {
     return e(this, void 0, void 0, (function() {
-        var a, s, c, l, h, f;
+        var a, s, c, l, f, h;
         return n(this, (function(d) {
             switch (d.label) {
               case 0:
@@ -16007,10 +16007,10 @@ function ec(t, r, i, o) {
 
               case 1:
                 return a = d.sent(), s = new Hs(r, a.Ts), c = s.ma(a.documents), l = Si.createSynthesizedTargetChangeForCurrentChange(i, o && "Offline" /* OnlineState.Offline */ !== t.onlineState, u), 
-                h = s.applyChanges(c, 
-                /* limboResolutionEnabled= */ t.isPrimaryClient, l), mc(t, i, h.wa), f = new Ys(r, i, s), 
-                [ 2 /*return*/ , (t.Fa.set(r, f), t.Ma.has(i) ? t.Ma.get(i).push(r) : t.Ma.set(i, [ r ]), 
-                h.snapshot) ];
+                f = s.applyChanges(c, 
+                /* limboResolutionEnabled= */ t.isPrimaryClient, l), mc(t, i, f.wa), h = new Ys(r, i, s), 
+                [ 2 /*return*/ , (t.Fa.set(r, h), t.Ma.has(i) ? t.Ma.get(i).push(r) : t.Ma.set(i, [ r ]), 
+                f.snapshot) ];
             }
         }));
     }));
@@ -16296,7 +16296,7 @@ function cc(t, r) {
                 // raise events immediately (depending on whether the watcher is caught
                 // up), so we raise user callbacks first so that they consistently happen
                 // before listen events.
-                dc(e, i, /*error=*/ null), fc(e, i), e.sharedClientState.updateMutationState(i, "acknowledged"), 
+                dc(e, i, /*error=*/ null), hc(e, i), e.sharedClientState.updateMutationState(i, "acknowledged"), 
                 [ 4 /*yield*/ , wc(e, o) ];
 
               case 3:
@@ -16352,7 +16352,7 @@ function lc(t, r, i) {
                 // raise events immediately (depending on whether the watcher is caught up),
                 // so we raise user callbacks first so that they consistently happen before
                 // listen events.
-                dc(e, r, i), fc(e, r), e.sharedClientState.updateMutationState(r, "rejected", i), 
+                dc(e, r, i), hc(e, r), e.sharedClientState.updateMutationState(r, "rejected", i), 
                 [ 4 /*yield*/ , wc(e, o) ];
 
               case 3:
@@ -16378,7 +16378,7 @@ function lc(t, r, i) {
 /**
  * Registers a user callback that resolves when all pending mutations at the moment of calling
  * are acknowledged .
- */ function hc(t, r) {
+ */ function fc(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o, u, a;
         return n(this, (function(n) {
@@ -16413,7 +16413,7 @@ function lc(t, r, i) {
 /**
  * Triggers the callbacks that are waiting for this batch id to get acknowledged by server,
  * if there are any.
- */ function fc(t, e) {
+ */ function hc(t, e) {
     (t.ka.get(e) || []).forEach((function(t) {
         t.resolve();
     })), t.ka.delete(e)
@@ -16513,7 +16513,7 @@ function wc(t, r, i) {
               case 1:
                 return c.sent(), o.Ca.d_(u), [ 4 /*yield*/ , function(t, r) {
                     return e(this, void 0, void 0, (function() {
-                        var e, i, o, u, a, s, c, l, h;
+                        var e, i, o, u, a, s, c, l, f;
                         return n(this, (function(n) {
                             switch (n.label) {
                               case 0:
@@ -16546,9 +16546,9 @@ function wc(t, r, i) {
 
                               case 4:
                                 for (o = 0, u = r; o < u.length; o++) a = u[o], s = a.targetId, a.fromCache || (c = e.os.get(s), 
-                                l = c.snapshotVersion, h = c.withLastLimboFreeSnapshotVersion(l), 
+                                l = c.snapshotVersion, f = c.withLastLimboFreeSnapshotVersion(l), 
                                 // Advance the last limbo free snapshot version
-                                e.os = e.os.insert(s, h));
+                                e.os = e.os.insert(s, f));
                                 return [ 2 /*return*/ ];
                             }
                         }));
@@ -16572,7 +16572,7 @@ function bc(t, r) {
             switch (n.label) {
               case 0:
                 return (e = G(t)).currentUser.isEqual(r) ? [ 3 /*break*/ , 3 ] : (F("SyncEngine", "User change. New user:", r.toKey()), 
-                [ 4 /*yield*/ , fa(e.localStore, r) ]);
+                [ 4 /*yield*/ , ha(e.localStore, r) ]);
 
               case 1:
                 return i = n.sent(), e.currentUser = r, 
@@ -16675,7 +16675,7 @@ function Ec(t, r, i, o) {
                 "acknowledged" === i || "rejected" === i ? (
                 // NOTE: Both these methods are no-ops for batches that originated from
                 // other clients.
-                dc(e, r, o || null), fc(e, r), function(t, e) {
+                dc(e, r, o || null), hc(e, r), function(t, e) {
                     G(G(t).mutationQueue).On(e);
                 }(e.localStore, r)) : U(), n.label = 4;
 
@@ -16754,7 +16754,7 @@ function Sc(t, r) {
 
 function xc(t, r, i) {
     return e(this, void 0, void 0, (function() {
-        var e, i, o, u, a, s, c, l, h, f, d, p, v, m;
+        var e, i, o, u, a, s, c, l, f, h, d, p, v, m;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
@@ -16768,16 +16768,16 @@ function xc(t, r, i) {
                 // from LocalStore (as the resume token and the snapshot version
                 // might have changed) and reconcile their views with the persisted
                 // state (the list of syncedDocuments may have gotten out of sync).
-                c = n.sent(), h = 0, f = l, n.label = 3;
+                c = n.sent(), f = 0, h = l, n.label = 3;
 
               case 3:
-                return h < f.length ? (d = f[h], p = e.Fa.get(d), [ 4 /*yield*/ , Ic(e, p) ]) : [ 3 /*break*/ , 6 ];
+                return f < h.length ? (d = h[f], p = e.Fa.get(d), [ 4 /*yield*/ , Ic(e, p) ]) : [ 3 /*break*/ , 6 ];
 
               case 4:
                 (v = n.sent()).snapshot && o.push(v.snapshot), n.label = 5;
 
               case 5:
-                return h++, [ 3 /*break*/ , 3 ];
+                return f++, [ 3 /*break*/ , 3 ];
 
               case 6:
                 return [ 3 /*break*/ , 11 ];
@@ -16883,7 +16883,7 @@ function Nc(t, r, i, o) {
 
 /** Adds or removes Watch targets for queries from different tabs. */ function Ac(t, r, i) {
     return e(this, void 0, void 0, (function() {
-        var e, o, u, a, s, c, l, h, f, d;
+        var e, o, u, a, s, c, l, f, h, d;
         return n(this, (function(p) {
             switch (p.label) {
               case 0:
@@ -16926,16 +16926,16 @@ function Nc(t, r, i, o) {
                             return [ 2 /*return*/ ];
                         }
                     }));
-                }, h = 0, f = i, p.label = 7;
+                }, f = 0, h = i, p.label = 7;
 
               case 7:
-                return h < f.length ? (d = f[h], [ 5 /*yield**/ , l(d) ]) : [ 3 /*break*/ , 10 ];
+                return f < h.length ? (d = h[f], [ 5 /*yield**/ , l(d) ]) : [ 3 /*break*/ , 10 ];
 
               case 8:
                 p.sent(), p.label = 9;
 
               case 9:
-                return h++, [ 3 /*break*/ , 7 ];
+                return f++, [ 3 /*break*/ , 7 ];
 
               case 10:
                 return [ 2 /*return*/ ];
@@ -17097,7 +17097,7 @@ var Rc = /** @class */ function() {
     }, t.prototype.Ha = function(t, e) {
         return null;
     }, t.prototype.za = function(t) {
-        return ha(this.persistence, new ca, t.initialUser, this.serializer);
+        return fa(this.persistence, new ca, t.initialUser, this.serializer);
     }, t.prototype.Ga = function(t) {
         return new Yu(Zu.Zr, this.serializer);
     }, t.prototype.Wa = function(t) {
@@ -17181,7 +17181,7 @@ var Vc = /** @class */ function(e) {
             }));
         }));
     }, i.prototype.za = function(t) {
-        return ha(this.persistence, new ca, t.initialUser, this.serializer);
+        return fa(this.persistence, new ca, t.initialUser, this.serializer);
     }, i.prototype.ja = function(t, e) {
         var n = this.persistence.referenceDelegate.garbageCollector;
         return new Su(n, t.asyncQueue, e);
@@ -17956,7 +17956,7 @@ var Uc = /** @class */ function() {
                         return n(this, (function(e) {
                             switch (e.label) {
                               case 0:
-                                return o.isEqual(t) ? [ 3 /*break*/ , 2 ] : [ 4 /*yield*/ , fa(r.localStore, t) ];
+                                return o.isEqual(t) ? [ 3 /*break*/ , 2 ] : [ 4 /*yield*/ , ha(r.localStore, t) ];
 
                               case 1:
                                 e.sent(), o = t, e.label = 2;
@@ -18340,7 +18340,7 @@ e) {
     return t;
 }
 
-function hl(t, e) {
+function fl(t, e) {
     if (e <= 0) throw new j(K.INVALID_ARGUMENT, "Function ".concat(t, "() requires a positive number, but it was: ").concat(e, "."));
 }
 
@@ -18365,7 +18365,7 @@ function hl(t, e) {
  * 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 fl = /** @class */ function() {
+ */ var hl = /** @class */ function() {
     function t(t) {
         var e, n;
         if (void 0 === t.host) {
@@ -18405,7 +18405,7 @@ function hl(t, e) {
         /**
              * Whether it's a Firestore or Firestore Lite instance.
              */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new fl({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new hl({}), 
         this._settingsFrozen = !1, 
         // A task that is assigned when the terminate() is invoked and resolved when
         // all components have shut down. Otherwise, Firestore is not terminated,
@@ -18438,7 +18438,7 @@ function hl(t, e) {
         configurable: !0
     }), t.prototype._setSettings = function(t) {
         if (this._settingsFrozen) throw new j(K.FAILED_PRECONDITION, "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 fl(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new hl(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new J;
             switch (t.type) {
               case "firstParty":
@@ -19338,7 +19338,7 @@ function Fl(t) {
                 return n(this, (function(n) {
                     switch (n.label) {
                       case 0:
-                        return e = hc, [ 4 /*yield*/ , Zc(t) ];
+                        return e = fc, [ 4 /*yield*/ , Zc(t) ];
 
                       case 1:
                         return [ 2 /*return*/ , e.apply(void 0, [ n.sent(), i ]) ];
@@ -19687,7 +19687,7 @@ function(t, e) {
     function t() {
         for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
         for (var n = 0; n < t.length; ++n) if (0 === t[n].length) throw new j(K.INVALID_ARGUMENT, "Invalid field name at argument $(i + 1). Field names must not be empty.");
-        this._internalPath = new ft(t);
+        this._internalPath = new ht(t);
     }
     /**
      * Returns true if this `FieldPath` is equal to the provided one.
@@ -19875,7 +19875,7 @@ function(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ var th = /** @class */ function() {
+/** A "context" object passed around while parsing user data. */ var tf = /** @class */ function() {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -19935,7 +19935,7 @@ function(t) {
             xu: !0
         });
     }, t.prototype.Bu = function(t) {
-        return bh(t, this.settings.methodName, this.settings.ku || !1, this.path, this.settings.qu);
+        return _f(t, this.settings.methodName, this.settings.ku || !1, this.path, this.settings.qu);
     }, 
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */ t.prototype.contains = function(t) {
         return void 0 !== this.fieldMask.find((function(e) {
@@ -19951,17 +19951,17 @@ function(t) {
         if (0 === t.length) throw this.Bu("Document fields must not be empty");
         if ($l(this.Cu) && Yl.test(t)) throw this.Bu('Document fields cannot begin and end with "__"');
     }, t;
-}(), eh = /** @class */ function() {
+}(), ef = /** @class */ function() {
     function t(t, e, n) {
         this.databaseId = t, this.ignoreUndefinedProperties = e, this.serializer = n || Qa(t)
         /** Creates a new top-level parse context. */;
     }
     return t.prototype.Qu = function(t, e, n, r) {
-        return void 0 === r && (r = !1), new th({
+        return void 0 === r && (r = !1), new tf({
             Cu: t,
             methodName: e,
             qu: n,
-            path: ft.emptyPath(),
+            path: ht.emptyPath(),
             xu: !1,
             ku: r
         }, this.databaseId, this.serializer, this.ignoreUndefinedProperties);
@@ -19971,21 +19971,21 @@ function(t) {
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ function nh(t) {
+ */ function nf(t) {
     var e = t._freezeSettings(), n = Qa(t._databaseId);
-    return new eh(t._databaseId, !!e.ignoreUndefinedProperties, n);
+    return new ef(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function rh(t, e, n, r, i, o) {
+/** Parse document data from a set() call. */ function rf(t, e, n, r, i, o) {
     void 0 === o && (o = {});
     var u = t.Qu(o.merge || o.mergeFields ? 2 /* UserDataSource.MergeSet */ : 0 /* UserDataSource.Set */ , e, n, i);
-    mh("Data must be an object, but it was:", u, r);
-    var a, s, c = ph(r, u);
+    yf("Data must be an object, but it was:", u, r);
+    var a, s, c = vf(r, u);
     if (o.merge) a = new Oe(u.fieldMask), s = u.fieldTransforms; else if (o.mergeFields) {
-        for (var l = [], h = 0, f = o.mergeFields; h < f.length; h++) {
-            var d = yh(e, f[h], n);
+        for (var l = [], f = 0, h = o.mergeFields; f < h.length; f++) {
+            var d = gf(e, h[f], n);
             if (!u.contains(d)) throw new j(K.INVALID_ARGUMENT, "Field '".concat(d, "' is specified in your field mask but missing from your input data."));
-            _h(l, d) || l.push(d);
+            If(l, d) || l.push(d);
         }
         a = new Oe(l), s = u.fieldTransforms.filter((function(t) {
             return a.covers(t.field);
@@ -19994,7 +19994,7 @@ function(t) {
     return new Xl(new yn(c), a, s);
 }
 
-var ih = /** @class */ function(e) {
+var of = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -20023,8 +20023,8 @@ var ih = /** @class */ function(e) {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function oh(t, e, n) {
-    return new th({
+ */ function uf(t, e, n) {
+    return new tf({
         Cu: 3 /* UserDataSource.Argument */ ,
         qu: e.settings.qu,
         methodName: t._methodName,
@@ -20032,7 +20032,7 @@ var ih = /** @class */ function(e) {
     }, e.databaseId, e.serializer, e.ignoreUndefinedProperties);
 }
 
-var uh = /** @class */ function(e) {
+var af = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -20041,35 +20041,35 @@ var uh = /** @class */ function(e) {
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(Wl), ah = /** @class */ function(e) {
+}(Wl), sf = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).Ku = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = oh(this, t, 
+        var e = uf(this, t, 
         /*array=*/ !0), n = this.Ku.map((function(t) {
-            return dh(t, e);
+            return pf(t, e);
         })), r = new Lr(n);
         return new jr(t.path, r);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n && v(this.Ku, t.Ku);
     }, n;
-}(Wl), sh = /** @class */ function(e) {
+}(Wl), cf = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).Ku = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = oh(this, t, 
+        var e = uf(this, t, 
         /*array=*/ !0), n = this.Ku.map((function(t) {
-            return dh(t, e);
+            return pf(t, e);
         })), r = new Ur(n);
         return new jr(t.path, r);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n && v(this.Ku, t.Ku);
     }, n;
-}(Wl), ch = /** @class */ function(e) {
+}(Wl), lf = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).$u = n, r;
@@ -20082,20 +20082,20 @@ var uh = /** @class */ function(e) {
     }, n;
 }(Wl);
 
-/** Parse update data from an update() call. */ function lh(t, e, n, r) {
+/** Parse update data from an update() call. */ function ff(t, e, n, r) {
     var i = t.Qu(1 /* UserDataSource.Update */ , e, n);
-    mh("Data must be an object, but it was:", i, r);
+    yf("Data must be an object, but it was:", i, r);
     var o = [], u = yn.empty();
     Te(r, (function(t, r) {
-        var a = wh(e, t, n);
+        var a = bf(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = m(r);
         var s = i.Nu(a);
-        if (r instanceof ih) 
+        if (r instanceof of) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(a); else {
-            var c = dh(r, s);
+            var c = pf(r, s);
             null != c && (o.push(a), u.set(a, c));
         }
     }));
@@ -20103,27 +20103,27 @@ var uh = /** @class */ function(e) {
     return new Zl(u, a, i.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function hh(t, e, n, r, i, o) {
-    var u = t.Qu(1 /* UserDataSource.Update */ , e, n), a = [ yh(e, r, n) ], s = [ i ];
+/** Parse update data from a list of field/value arguments. */ function hf(t, e, n, r, i, o) {
+    var u = t.Qu(1 /* UserDataSource.Update */ , e, n), a = [ gf(e, r, n) ], s = [ i ];
     if (o.length % 2 != 0) throw new j(K.INVALID_ARGUMENT, "Function ".concat(e, "() needs to be called with an even number of arguments that alternate between field names and values."));
-    for (var c = 0; c < o.length; c += 2) a.push(yh(e, o[c])), s.push(o[c + 1]);
+    for (var c = 0; c < o.length; c += 2) a.push(gf(e, o[c])), s.push(o[c + 1]);
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
-    for (var l = [], h = yn.empty(), f = a.length - 1; f >= 0; --f) if (!_h(l, a[f])) {
-        var d = a[f], p = s[f];
+    for (var l = [], f = yn.empty(), h = a.length - 1; h >= 0; --h) if (!If(l, a[h])) {
+        var d = a[h], p = s[h];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
         p = m(p);
         var v = u.Nu(d);
-        if (p instanceof ih) 
+        if (p instanceof of) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(d); else {
-            var y = dh(p, v);
-            null != y && (l.push(d), h.set(d, y));
+            var y = pf(p, v);
+            null != y && (l.push(d), f.set(d, y));
         }
     }
     var g = new Oe(l);
-    return new Zl(h, g, u.fieldTransforms);
+    return new Zl(f, g, u.fieldTransforms);
 }
 
 /**
@@ -20132,8 +20132,8 @@ var uh = /** @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 fh(t, e, n, r) {
-    return void 0 === r && (r = !1), dh(n, t.Qu(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
+ */ function df(t, e, n, r) {
+    return void 0 === r && (r = !1), pf(n, t.Qu(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
 }
 
 /**
@@ -20144,11 +20144,11 @@ var uh = /** @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 dh(t, e) {
-    if (vh(
+ */ function pf(t, e) {
+    if (mf(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = m(t))) return mh("Unsupported field value:", e, t), ph(t, e);
+    t = m(t))) return yf("Unsupported field value:", e, t), vf(t, e);
     if (t instanceof Wl) 
     // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
@@ -20184,7 +20184,7 @@ var uh = /** @class */ function(e) {
         if (e.settings.xu && 4 /* UserDataSource.ArrayArgument */ !== e.Cu) throw e.Bu("Nested arrays are not supported");
         return function(t, e) {
             for (var n = [], r = 0, i = 0, o = t; i < o.length; i++) {
-                var u = dh(o[i], e.Lu(r));
+                var u = pf(o[i], e.Lu(r));
                 null == u && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -20268,13 +20268,13 @@ var uh = /** @class */ function(e) {
     }(t, e);
 }
 
-function ph(t, e) {
+function vf(t, e) {
     var n = {};
     return Se(t) ? 
     // If we encounter an empty object, we explicitly add it to the update
     // mask to ensure that the server creates a map entry.
     e.path && e.path.length > 0 && e.fieldMask.push(e.path) : Te(t, (function(t, r) {
-        var i = dh(r, e.Mu(t));
+        var i = pf(r, e.Mu(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -20283,12 +20283,12 @@ function ph(t, e) {
     };
 }
 
-function vh(t) {
+function mf(t) {
     return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof at || t instanceof Jl || t instanceof Kl || t instanceof ml || t instanceof Wl || t instanceof Hl);
 }
 
-function mh(t, e, n) {
-    if (!vh(n) || !function(t) {
+function yf(t, e, n) {
+    if (!mf(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         var r = cl(n);
@@ -20298,20 +20298,20 @@ function mh(t, e, n) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function yh(t, e, n) {
+ */ function gf(t, e, n) {
     if (
     // If required, replace the FieldPath Compat class with the firestore-exp
     // FieldPath.
     (e = m(e)) instanceof jl) return e._internalPath;
-    if ("string" == typeof e) return wh(t, e);
-    throw bh("Field path arguments must be of type string or ", t, 
+    if ("string" == typeof e) return bf(t, e);
+    throw _f("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 gh = new RegExp("[~\\*/\\[\\]]");
+ */ var wf = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -20321,20 +20321,20 @@ function mh(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function wh(t, e, n) {
-    if (e.search(gh) >= 0) throw bh("Invalid field path (".concat(e, "). Paths must not contain '~', '*', '/', '[', or ']'"), t, 
+ */ function bf(t, e, n) {
+    if (e.search(wf) >= 0) throw _f("Invalid field path (".concat(e, "). Paths must not contain '~', '*', '/', '[', or ']'"), t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
         return (new (jl.bind.apply(jl, r([ void 0 ], e.split("."), !1))))._internalPath;
     } catch (r) {
-        throw bh("Invalid field path (".concat(e, "). Paths must not be empty, begin with '.', end with '.', or contain '..'"), t, 
+        throw _f("Invalid field path (".concat(e, "). Paths must not be empty, begin with '.', end with '.', or contain '..'"), t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function bh(t, e, n, r, i) {
+function _f(t, e, n, r, i) {
     var o = r && !r.isEmpty(), u = void 0 !== i, a = "Function ".concat(e, "() called with invalid data");
     n && (a += " (via `toFirestore()`)"), a += ". ";
     var s = "";
@@ -20343,7 +20343,7 @@ function bh(t, e, n, r, i) {
     /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */;
 }
 
-function _h(t, e) {
+function If(t, e) {
     return t.some((function(t) {
         return t.isEqual(e);
     }));
@@ -20373,7 +20373,7 @@ function _h(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 Ih = /** @class */ function() {
+ */ var Tf = /** @class */ function() {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -20419,7 +20419,7 @@ function _h(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 Th(this._firestore, this._userDataWriter, this._key, this._document, 
+                var t = new Ef(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -20439,11 +20439,11 @@ function _h(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(Eh("DocumentSnapshot.get", t));
+            var e = this._document.data.field(Sf("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }, t;
-}(), Th = /** @class */ function(e) {
+}(), Ef = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -20455,7 +20455,7 @@ function _h(t, e) {
      */    return t(n, e), n.prototype.data = function() {
         return e.prototype.data.call(this);
     }, n;
-}(Ih);
+}(Tf);
 
 /**
  * A `QueryDocumentSnapshot` contains data read from a document in your
@@ -20471,8 +20471,8 @@ function _h(t, e) {
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */
-function Eh(t, e) {
-    return "string" == typeof e ? wh(t, e) : e instanceof jl ? e._internalPath : e._delegate._internalPath;
+function Sf(t, e) {
+    return "string" == typeof e ? bf(t, e) : e instanceof jl ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -20490,19 +20490,19 @@ function Eh(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function Sh(t) {
+ */ function xf(t) {
     if ("L" /* LimitType.Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new j(K.UNIMPLEMENTED, "limitToLast() queries require specifying at least one orderBy() clause");
 }
 
 /**
  * An `AppliableConstraint` is an abstraction of a constraint that can be applied
  * to a Firestore query.
- */ var xh = function() {}, Dh = /** @class */ function(e) {
+ */ var Df = function() {}, Cf = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(xh);
+}(Df);
 
 /**
  * A `QueryConstraint` is used to narrow the set of documents returned by a
@@ -20511,14 +20511,14 @@ function Eh(t, e) {
  * (endBefore:1)}, {@link (endAt:1)}, {@link limit}, {@link limitToLast} and
  * can then be passed to {@link (query:1)} to create a new query instance that
  * also contains this `QueryConstraint`.
- */ function Ch(t, e) {
+ */ function Nf(t, e) {
     for (var n = [], r = 2; r < arguments.length; r++) n[r - 2] = arguments[r];
     var i = [];
-    e instanceof xh && i.push(e), function(t) {
+    e instanceof Df && i.push(e), function(t) {
         var e = t.filter((function(t) {
-            return t instanceof kh;
+            return t instanceof Of;
         })).length, n = t.filter((function(t) {
-            return t instanceof Nh;
+            return t instanceof Af;
         })).length;
         if (e > 1 || e > 0 && n > 0) throw new j(K.INVALID_ARGUMENT, "InvalidQuery. When using composite filters, you cannot use more than one filter at the top level. Consider nesting the multiple filters within an `and(...)` statement. For example: change `query(query, where(...), or(...))` to `query(query, and(where(...), or(...)))`.");
     }(i = i.concat(n));
@@ -20535,7 +20535,7 @@ function Eh(t, e) {
  * `QueryFieldFilterConstraint`s are created by invoking {@link where} and can then
  * be passed to {@link (query:1)} to create a new query instance that also contains
  * this `QueryFieldFilterConstraint`.
- */ var Nh = /** @class */ function(e) {
+ */ var Af = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -20549,32 +20549,32 @@ function Eh(t, e) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
         var e = this._parse(t);
-        return Jh(t._query, e), new vl(t.firestore, t.converter, ar(t._query, e));
+        return Hf(t._query, e), new vl(t.firestore, t.converter, ar(t._query, e));
     }, n.prototype._parse = function(t) {
-        var e = nh(t.firestore), n = function(t, e, n, r, i, o, u) {
+        var e = nf(t.firestore), n = function(t, e, n, r, i, o, u) {
             var a;
             if (i.isKeyField()) {
                 if ("array-contains" /* Operator.ARRAY_CONTAINS */ === o || "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === o) throw new j(K.INVALID_ARGUMENT, "Invalid Query. You can't perform '".concat(o, "' queries on documentId()."));
                 if ("in" /* Operator.IN */ === o || "not-in" /* Operator.NOT_IN */ === o) {
-                    Wh(u, o);
+                    Jf(u, o);
                     for (var s = [], c = 0, l = u; c < l.length; c++) {
-                        var h = l[c];
-                        s.push(Qh(r, t, h));
+                        var f = l[c];
+                        s.push(Wf(r, t, f));
                     }
                     a = {
                         arrayValue: {
                             values: s
                         }
                     };
-                } else a = Qh(r, t, u);
-            } else "in" /* Operator.IN */ !== o && "not-in" /* Operator.NOT_IN */ !== o && "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ !== o || Wh(u, o), 
-            a = fh(n, e, u, 
+                } else a = Wf(r, t, u);
+            } else "in" /* Operator.IN */ !== o && "not-in" /* Operator.NOT_IN */ !== o && "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ !== o || Jf(u, o), 
+            a = df(n, e, u, 
             /* allowArrays= */ "in" /* Operator.IN */ === o || "not-in" /* Operator.NOT_IN */ === o);
             return xn.create(i, o, a);
         }(t._query, "where", e, t.firestore._databaseId, this._field, this._op, this._value);
         return n;
     }, n;
-}(Dh);
+}(Cf);
 
 /**
  * Creates a {@link QueryFieldFilterConstraint} that enforces that documents
@@ -20586,9 +20586,9 @@ function Eh(t, e) {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link QueryFieldFilterConstraint}.
- */ function Ah(t, e, n) {
-    var r = e, i = Eh("where", t);
-    return Nh._create(i, r, n);
+ */ function kf(t, e, n) {
+    var r = e, i = Sf("where", t);
+    return Af._create(i, r, n);
 }
 
 /**
@@ -20598,7 +20598,7 @@ function Eh(t, e) {
  * `QueryCompositeFilterConstraint`s are created by invoking {@link or} or
  * {@link and} and can then be passed to {@link (query:1)} to create a new query
  * instance that also contains the `QueryCompositeFilterConstraint`.
- */ var kh = /** @class */ function(e) {
+ */ var Of = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -20622,7 +20622,7 @@ function Eh(t, e) {
         return 0 === e.getFilters().length ? t : (function(t, e) {
             for (var n = t, r = 0, i = e.getFlattenedFilters(); r < i.length; r++) {
                 var o = i[r];
-                Jh(n, o), n = ar(n, o);
+                Hf(n, o), n = ar(n, o);
             }
         }(t._query, e), new vl(t.firestore, t.converter, ar(t._query, e)));
     }, n.prototype._getQueryConstraints = function() {
@@ -20630,7 +20630,7 @@ function Eh(t, e) {
     }, n.prototype._getOperator = function() {
         return "and" === this.type ? "and" /* CompositeOperator.AND */ : "or" /* CompositeOperator.OR */;
     }, n;
-}(xh);
+}(Df);
 
 /**
  * Creates a new {@link QueryCompositeFilterConstraint} that is a disjunction of
@@ -20641,12 +20641,12 @@ function Eh(t, e) {
  * {@link QueryFilterConstraint}s to perform a disjunction for. These must be
  * created with calls to {@link where}, {@link or}, or {@link and}.
  * @returns The newly created {@link QueryCompositeFilterConstraint}.
- */ function Oh() {
+ */ function Pf() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // Only support QueryFilterConstraints
         return t.forEach((function(t) {
-        return Hh("or", t);
-    })), kh._create("or" /* CompositeOperator.OR */ , t)
+        return Yf("or", t);
+    })), Of._create("or" /* CompositeOperator.OR */ , t)
     /**
  * Creates a new {@link QueryCompositeFilterConstraint} that is a conjunction of
  * the given filter constraints. A conjunction filter includes a document if it
@@ -20659,12 +20659,12 @@ function Eh(t, e) {
  */;
 }
 
-function Ph() {
+function Rf() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // Only support QueryFilterConstraints
         return t.forEach((function(t) {
-        return Hh("and", t);
-    })), kh._create("and" /* CompositeOperator.AND */ , t)
+        return Yf("and", t);
+    })), Of._create("and" /* CompositeOperator.AND */ , t)
     /**
  * A `QueryOrderByConstraint` is used to sort the set of documents returned by a
  * Firestore query. `QueryOrderByConstraint`s are created by invoking
@@ -20676,7 +20676,7 @@ function Ph() {
  */;
 }
 
-var Rh = /** @class */ function(e) {
+var Vf = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -20700,7 +20700,7 @@ var Rh = /** @class */ function(e) {
             return new Zn(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }, n;
-}(Dh);
+}(Cf);
 
 /**
  * Creates a {@link QueryOrderByConstraint} that sorts the query result by the
@@ -20713,10 +20713,10 @@ var Rh = /** @class */ function(e) {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link QueryOrderByConstraint}.
- */ function Vh(t, e) {
+ */ function Ff(t, e) {
     void 0 === e && (e = "asc");
-    var n = e, r = Eh("orderBy", t);
-    return Rh._create(r, n);
+    var n = e, r = Sf("orderBy", t);
+    return Vf._create(r, n);
 }
 
 /**
@@ -20725,7 +20725,7 @@ var Rh = /** @class */ function(e) {
  * `QueryLimitConstraint`s are created by invoking {@link limit} or
  * {@link limitToLast} and can then be passed to {@link (query:1)} to create a new
  * query instance that also contains this `QueryLimitConstraint`.
- */ var Fh = /** @class */ function(e) {
+ */ var Mf = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -20740,7 +20740,7 @@ var Rh = /** @class */ function(e) {
     }, n.prototype._apply = function(t) {
         return new vl(t.firestore, t.converter, sr(t._query, this._limit, this._limitType));
     }, n;
-}(Dh);
+}(Cf);
 
 /**
  * Creates a {@link QueryLimitConstraint} that only returns the first matching
@@ -20748,8 +20748,8 @@ var Rh = /** @class */ function(e) {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link QueryLimitConstraint}.
- */ function Mh(t) {
-    return hl("limit", t), Fh._create("limit", t, "F" /* LimitType.First */)
+ */ function Lf(t) {
+    return fl("limit", t), Mf._create("limit", t, "F" /* LimitType.First */)
     /**
  * Creates a {@link QueryLimitConstraint} that only returns the last matching
  * documents.
@@ -20762,8 +20762,8 @@ var Rh = /** @class */ function(e) {
  */;
 }
 
-function Lh(t) {
-    return hl("limitToLast", t), Fh._create("limitToLast", t, "L" /* LimitType.Last */)
+function qf(t) {
+    return fl("limitToLast", t), Mf._create("limitToLast", t, "L" /* LimitType.Last */)
     /**
  * A `QueryStartAtConstraint` is used to exclude documents from the start of a
  * result set returned by a Firestore query.
@@ -20773,7 +20773,7 @@ function Lh(t) {
  */;
 }
 
-var qh = /** @class */ function(e) {
+var Uf = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -20787,22 +20787,22 @@ var qh = /** @class */ function(e) {
     return t(n, e), n._create = function(t, e, r) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
-        var e = jh(t, this.type, this._docOrFields, this._inclusive);
+        var e = Qf(t, this.type, this._docOrFields, this._inclusive);
         return new vl(t.firestore, t.converter, function(t, e) {
             return new Zn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }, n;
-}(Dh);
+}(Cf);
 
-function Uh() {
+function Bf() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return qh._create("startAt", t, 
+    return Uf._create("startAt", t, 
     /*inclusive=*/ !0);
 }
 
-function Bh() {
+function zf() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return qh._create("startAfter", t, 
+    return Uf._create("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
@@ -20812,7 +20812,7 @@ function Bh() {
  * `QueryEndAtConstraint`s are created by invoking {@link (endAt:1)} or
  * {@link (endBefore:1)} and can then be passed to {@link (query:1)} to create a new
  * query instance that also contains this `QueryEndAtConstraint`.
- */ var zh = /** @class */ function(e) {
+ */ var Gf = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -20826,27 +20826,27 @@ function Bh() {
     return t(n, e), n._create = function(t, e, r) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
-        var e = jh(t, this.type, this._docOrFields, this._inclusive);
+        var e = Qf(t, this.type, this._docOrFields, this._inclusive);
         return new vl(t.firestore, t.converter, function(t, e) {
             return new Zn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }, n;
-}(Dh);
+}(Cf);
 
-function Gh() {
+function Kf() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return zh._create("endBefore", t, 
+    return Gf._create("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function Kh() {
+function jf() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return zh._create("endAt", t, 
+    return Gf._create("endAt", t, 
     /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function jh(t, e, n, r) {
-    if (n[0] = m(n[0]), n[0] instanceof Ih) return function(t, e, n, r, i) {
+/** Helper function to create a bound from a document or fields */ function Qf(t, e, n, r) {
+    if (n[0] = m(n[0]), n[0] instanceof Tf) return function(t, e, n, r, i) {
         if (!r) throw new j(K.NOT_FOUND, "Can't use a DocumentSnapshot that doesn't exist for ".concat(n, "()."));
         // Because people expect to continue/end a query at the exact document
         // provided, we need to use the implicit sort order rather than the explicit
@@ -20869,7 +20869,7 @@ function Kh() {
         }
         return new bn(o, i);
     }(t._query, t.firestore._databaseId, e, n[0]._document, r);
-    var i = nh(t.firestore);
+    var i = nf(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 u = t.explicitOrderBy;
@@ -20881,18 +20881,18 @@ function Kh() {
                 if (!nr(t) && -1 !== c.indexOf("/")) throw new j(K.INVALID_ARGUMENT, "Invalid query. When querying a collection and ordering by documentId(), the value passed to ".concat(r, "() must be a plain document ID, but '").concat(c, "' contains a slash."));
                 var l = t.path.child(lt.fromString(c));
                 if (!dt.isDocumentKey(l)) throw new j(K.INVALID_ARGUMENT, "Invalid query. When querying a collection group and ordering by documentId(), the value passed to ".concat(r, "() must result in a valid document path, but '").concat(l, "' is not because it contains an odd number of segments."));
-                var h = new dt(l);
-                a.push(nn(e, h));
+                var f = new dt(l);
+                a.push(nn(e, f));
             } else {
-                var f = fh(n, r, c);
-                a.push(f);
+                var h = df(n, r, c);
+                a.push(h);
             }
         }
         return new bn(a, o);
     }(t._query, t.firestore._databaseId, i, e, n, r);
 }
 
-function Qh(t, e, n) {
+function Wf(t, e, n) {
     if ("string" == typeof (n = m(n))) {
         if ("" === n) throw new j(K.INVALID_ARGUMENT, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
         if (!nr(e) && -1 !== n.indexOf("/")) throw new j(K.INVALID_ARGUMENT, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '".concat(n, "' contains a '/' character."));
@@ -20907,7 +20907,7 @@ function Qh(t, e, n) {
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function Wh(t, e) {
+ */ function Jf(t, e) {
     if (!Array.isArray(t) || 0 === t.length) throw new j(K.INVALID_ARGUMENT, "Invalid Query. A non-empty array is required for '".concat(e.toString(), "' filters."));
 }
 
@@ -20920,7 +20920,7 @@ function Qh(t, e, n) {
  * Operators in a query must adhere to the following set of rules:
  * 1. Only one inequality per query.
  * 2. `NOT_IN` cannot be used with array, disjunctive, or `NOT_EQUAL` operators.
- */ function Jh(t, e) {
+ */ function Hf(t, e) {
     var n = function(t, e) {
         for (var n = 0, r = t; n < r.length; n++) for (var i = 0, o = r[n].getFlattenedFilters(); i < o.length; i++) {
             var u = o[i];
@@ -20948,11 +20948,11 @@ function Qh(t, e, n) {
     throw n === e.op ? new j(K.INVALID_ARGUMENT, "Invalid query. You cannot use more than one '".concat(e.op.toString(), "' filter.")) : new j(K.INVALID_ARGUMENT, "Invalid query. You cannot use '".concat(e.op.toString(), "' filters with '").concat(n.toString(), "' filters."));
 }
 
-function Hh(t, e) {
-    if (!(e instanceof Nh || e instanceof kh)) throw new j(K.INVALID_ARGUMENT, "Function ".concat(t, "() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'."));
+function Yf(t, e) {
+    if (!(e instanceof Af || e instanceof Of)) throw new j(K.INVALID_ARGUMENT, "Function ".concat(t, "() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'."));
 }
 
-var Yh = /** @class */ function() {
+var Xf = /** @class */ function() {
     function t() {}
     return t.prototype.convertValue = function(t, e) {
         switch (void 0 === e && (e = "none"), We(t)) {
@@ -21074,14 +21074,14 @@ var Yh = /** @class */ function() {
  * 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 Xh(t, e, n) {
+ */ function Zf(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 Zh = /** @class */ function(e) {
+var $f = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).firestore = t, n;
@@ -21092,7 +21092,7 @@ var Zh = /** @class */ function(e) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
         return new ml(this.firestore, /* converter= */ null, e);
     }, n;
-}(Yh);
+}(Xf);
 
 /**
  * @license
@@ -21114,22 +21114,22 @@ var Zh = /** @class */ function(e) {
  * Create an AggregateField object that can be used to compute the sum of
  * a specified field over a range of documents in the result set of a query.
  * @param field Specifies the field to sum across the result set.
- */ function $h(t) {
-    return new zl("sum", yh("sum", t));
+ */ function th(t) {
+    return new zl("sum", gf("sum", t));
 }
 
 /**
  * Create an AggregateField object that can be used to compute the average of
  * a specified field over a range of documents in the result set of a query.
  * @param field Specifies the field to average across the result set.
- */ function tf(t) {
-    return new zl("avg", yh("average", t));
+ */ function eh(t) {
+    return new zl("avg", gf("average", t));
 }
 
 /**
  * Create an AggregateField object that can be used to compute the count of
  * documents in the result set of a query.
- */ function ef() {
+ */ function nh() {
     return new zl("count");
 }
 
@@ -21138,7 +21138,7 @@ var Zh = /** @class */ function(e) {
  *
  * @param left Compare this AggregateField to the `right`.
  * @param right Compare this AggregateField to the `left`.
- */ function nf(t, e) {
+ */ function rh(t, e) {
     var n, r;
     return t instanceof zl && e instanceof zl && t.aggregateType === e.aggregateType && (null === (n = t._internalFieldPath) || void 0 === n ? void 0 : n.canonicalString()) === (null === (r = e._internalFieldPath) || void 0 === r ? void 0 : r.canonicalString());
 }
@@ -21154,7 +21154,7 @@ var Zh = /** @class */ function(e) {
  *
  * @returns `true` if the objects are "equal", as defined above, or `false`
  * otherwise.
- */ function rf(t, e) {
+ */ function ih(t, e) {
     return Il(t.query, e.query) && v(t.data(), e.data());
 }
 
@@ -21176,7 +21176,7 @@ var Zh = /** @class */ function(e) {
  */
 /**
  * Metadata about a snapshot, describing the state of the snapshot.
- */ var of = /** @class */ function() {
+ */ var oh = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this.hasPendingWrites = t, this.fromCache = e
@@ -21190,7 +21190,7 @@ var Zh = /** @class */ function(e) {
     return t.prototype.isEqual = function(t) {
         return this.hasPendingWrites === t.hasPendingWrites && this.fromCache === t.fromCache;
     }, t;
-}(), uf = /** @class */ function(e) {
+}(), uh = /** @class */ function(e) {
     /** @hideconstructor protected */
     function n(t, n, r, i, o, u) {
         var a = this;
@@ -21221,7 +21221,7 @@ var Zh = /** @class */ function(e) {
             if (this._converter) {
                 // We only want to use the converter and create a new DocumentSnapshot
                 // if a converter has been provided.
-                var e = new af(this._firestore, this._userDataWriter, this._key, this._document, this.metadata, 
+                var e = new ah(this._firestore, this._userDataWriter, this._key, this._document, this.metadata, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(e, t);
             }
@@ -21248,11 +21248,11 @@ var Zh = /** @class */ function(e) {
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     n.prototype.get = function(t, e) {
         if (void 0 === e && (e = {}), this._document) {
-            var n = this._document.data.field(Eh("DocumentSnapshot.get", t));
+            var n = this._document.data.field(Sf("DocumentSnapshot.get", t));
             if (null !== n) return this._userDataWriter.convertValue(n, e.serverTimestamps);
         }
     }, n;
-}(Ih), af = /** @class */ function(e) {
+}(Tf), ah = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -21271,10 +21271,10 @@ var Zh = /** @class */ function(e) {
      */    return t(n, e), n.prototype.data = function(t) {
         return void 0 === t && (t = {}), e.prototype.data.call(this, t);
     }, n;
-}(uf), sf = /** @class */ function() {
+}(uh), sh = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e, n, r) {
-        this._firestore = t, this._userDataWriter = e, this._snapshot = r, this.metadata = new of(r.hasPendingWrites, r.fromCache), 
+        this._firestore = t, this._userDataWriter = e, this._snapshot = r, this.metadata = new oh(r.hasPendingWrites, r.fromCache), 
         this.query = n;
     }
     return Object.defineProperty(t.prototype, "docs", {
@@ -21309,7 +21309,7 @@ var Zh = /** @class */ function(e) {
     t.prototype.forEach = function(t, e) {
         var n = this;
         this._snapshot.docs.forEach((function(r) {
-            t.call(e, new af(n._firestore, n._userDataWriter, r.key, r, new of(n._snapshot.mutatedKeys.has(r.key), n._snapshot.fromCache), n.query.converter));
+            t.call(e, new ah(n._firestore, n._userDataWriter, r.key, r, new oh(n._snapshot.mutatedKeys.has(r.key), n._snapshot.fromCache), n.query.converter));
         }));
     }, 
     /**
@@ -21331,7 +21331,7 @@ var Zh = /** @class */ function(e) {
             if (t._snapshot.oldDocs.isEmpty()) {
                 var n = 0;
                 return t._snapshot.docChanges.map((function(e) {
-                    var r = new af(t._firestore, t._userDataWriter, e.doc.key, e.doc, new of(t._snapshot.mutatedKeys.has(e.doc.key), t._snapshot.fromCache), t.query.converter);
+                    var r = new ah(t._firestore, t._userDataWriter, e.doc.key, e.doc, new oh(t._snapshot.mutatedKeys.has(e.doc.key), t._snapshot.fromCache), t.query.converter);
                     return e.doc, {
                         type: "added",
                         doc: r,
@@ -21346,11 +21346,11 @@ var Zh = /** @class */ function(e) {
             return t._snapshot.docChanges.filter((function(t) {
                 return e || 3 /* ChangeType.Metadata */ !== t.type;
             })).map((function(e) {
-                var n = new af(t._firestore, t._userDataWriter, e.doc.key, e.doc, new of(t._snapshot.mutatedKeys.has(e.doc.key), t._snapshot.fromCache), t.query.converter), i = -1, o = -1;
+                var n = new ah(t._firestore, t._userDataWriter, e.doc.key, e.doc, new oh(t._snapshot.mutatedKeys.has(e.doc.key), t._snapshot.fromCache), t.query.converter), i = -1, o = -1;
                 return 0 /* ChangeType.Added */ !== e.type && (i = r.indexOf(e.doc.key), r = r.delete(e.doc.key)), 
                 1 /* ChangeType.Removed */ !== e.type && (o = (r = r.add(e.doc)).indexOf(e.doc.key)), 
                 {
-                    type: cf(e.type),
+                    type: ch(e.type),
                     doc: n,
                     oldIndex: i,
                     newIndex: o
@@ -21368,7 +21368,7 @@ var Zh = /** @class */ function(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.
- */ function cf(t) {
+ */ function ch(t) {
     switch (t) {
       case 0 /* ChangeType.Added */ :
         return "added";
@@ -21393,8 +21393,8 @@ var Zh = /** @class */ function(e) {
  * @param left - A snapshot to compare.
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
- */ function lf(t, e) {
-    return t instanceof uf && e instanceof uf ? 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 sf && e instanceof sf && t._firestore === e._firestore && Il(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot);
+ */ function lh(t, e) {
+    return t instanceof uh && e instanceof uh ? 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 sh && e instanceof sh && t._firestore === e._firestore && Il(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot);
 }
 
 /**
@@ -21424,15 +21424,15 @@ var Zh = /** @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 hf(t) {
+ */ function fh(t) {
     t = ll(t, ml);
     var e = ll(t.firestore, Dl);
     return el(Al(e), t._key).then((function(n) {
-        return Sf(e, t, n);
+        return Sh(e, t, n);
     }));
 }
 
-var ff = /** @class */ function(e) {
+var hh = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).firestore = t, n;
@@ -21443,7 +21443,7 @@ var ff = /** @class */ function(e) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
         return new ml(this.firestore, /* converter= */ null, e);
     }, n;
-}(Yh);
+}(Xf);
 
 /**
  * Reads the document referred to by this `DocumentReference` from cache.
@@ -21451,9 +21451,9 @@ var ff = /** @class */ function(e) {
  *
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
- */ function df(t) {
+ */ function dh(t) {
     t = ll(t, ml);
-    var r = ll(t.firestore, Dl), i = Al(r), o = new ff(r);
+    var r = ll(t.firestore, Dl), i = Al(r), o = new hh(r);
     return function(t, r) {
         var i = this, o = new Q;
         return t.asyncQueue.enqueueAndForget((function() {
@@ -21497,7 +21497,7 @@ var ff = /** @class */ function(e) {
             }));
         })), o.promise;
     }(i, t._key).then((function(e) {
-        return new uf(r, o, t._key, e, new of(null !== e && e.hasLocalMutations, 
+        return new uh(r, o, t._key, e, new oh(null !== e && e.hasLocalMutations, 
         /* fromCache= */ !0), t.converter);
     }));
 }
@@ -21508,13 +21508,13 @@ var ff = /** @class */ function(e) {
  *
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
- */ function pf(t) {
+ */ function ph(t) {
     t = ll(t, ml);
     var e = ll(t.firestore, Dl);
     return el(Al(e), t._key, {
         source: "server"
     }).then((function(n) {
-        return Sf(e, t, n);
+        return Sh(e, t, n);
     }));
 }
 
@@ -21527,11 +21527,11 @@ var ff = /** @class */ function(e) {
  * invoke {@link getDocsFromCache} or {@link getDocsFromServer}.
  *
  * @returns A `Promise` that will be resolved with the results of the query.
- */ function vf(t) {
+ */ function vh(t) {
     t = ll(t, vl);
-    var e = ll(t.firestore, Dl), n = Al(e), r = new ff(e);
-    return Sh(t._query), nl(n, t._query).then((function(n) {
-        return new sf(e, r, t, n);
+    var e = ll(t.firestore, Dl), n = Al(e), r = new hh(e);
+    return xf(t._query), nl(n, t._query).then((function(n) {
+        return new sh(e, r, t, n);
     }))
     /**
  * Executes the query and returns the results as a `QuerySnapshot` from cache.
@@ -21542,9 +21542,9 @@ var ff = /** @class */ function(e) {
  */;
 }
 
-function mf(t) {
+function mh(t) {
     t = ll(t, vl);
-    var r = ll(t.firestore, Dl), i = Al(r), o = new ff(r);
+    var r = ll(t.firestore, Dl), i = Al(r), o = new hh(r);
     return function(t, r) {
         var i = this, o = new Q;
         return t.asyncQueue.enqueueAndForget((function() {
@@ -21584,7 +21584,7 @@ function mf(t) {
             }));
         })), o.promise;
     }(i, t._query).then((function(e) {
-        return new sf(r, o, t, e);
+        return new sh(r, o, t, e);
     }));
 }
 
@@ -21593,30 +21593,30 @@ function mf(t) {
  * server. Returns an error if the network is not available.
  *
  * @returns A `Promise` that will be resolved with the results of the query.
- */ function yf(t) {
+ */ function yh(t) {
     t = ll(t, vl);
-    var e = ll(t.firestore, Dl), n = Al(e), r = new ff(e);
+    var e = ll(t.firestore, Dl), n = Al(e), r = new hh(e);
     return nl(n, t._query, {
         source: "server"
     }).then((function(n) {
-        return new sf(e, r, t, n);
+        return new sh(e, r, t, n);
     }));
 }
 
-function gf(t, e, n) {
+function gh(t, e, n) {
     t = ll(t, ml);
-    var r = ll(t.firestore, Dl), i = Xh(t.converter, e, n);
-    return Ef(r, [ rh(nh(r), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Wr.none()) ]);
+    var r = ll(t.firestore, Dl), i = Zf(t.converter, e, n);
+    return Eh(r, [ rf(nf(r), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Wr.none()) ]);
 }
 
-function wf(t, e, n) {
+function wh(t, e, n) {
     for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
     t = ll(t, ml);
-    var o = ll(t.firestore, Dl), u = nh(o);
-    return Ef(o, [ ("string" == typeof (
+    var o = ll(t.firestore, Dl), u = nf(o);
+    return Eh(o, [ ("string" == typeof (
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-    e = m(e)) || e instanceof jl ? hh(u, "updateDoc", t._key, e, n, r) : lh(u, "updateDoc", t._key, e)).toMutation(t._key, Wr.exists(!0)) ]);
+    e = m(e)) || e instanceof jl ? hf(u, "updateDoc", t._key, e, n, r) : ff(u, "updateDoc", t._key, e)).toMutation(t._key, Wr.exists(!0)) ]);
 }
 
 /**
@@ -21625,8 +21625,8 @@ function wf(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 (note that it won't resolve while you're offline).
- */ function bf(t) {
-    return Ef(ll(t.firestore, Dl), [ new si(t._key, Wr.none()) ]);
+ */ function bh(t) {
+    return Eh(ll(t.firestore, Dl), [ new si(t._key, Wr.none()) ]);
 }
 
 /**
@@ -21638,14 +21638,14 @@ function wf(t, e, n) {
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend (Note that it
  * won't resolve while you're offline).
- */ function _f(t, e) {
-    var n = ll(t.firestore, Dl), r = bl(t), i = Xh(t.converter, e);
-    return Ef(n, [ rh(nh(t.firestore), "addDoc", r._key, i, null !== t.converter, {}).toMutation(r._key, Wr.exists(!1)) ]).then((function() {
+ */ function _h(t, e) {
+    var n = ll(t.firestore, Dl), r = bl(t), i = Zf(t.converter, e);
+    return Eh(n, [ rf(nf(t.firestore), "addDoc", r._key, i, null !== t.converter, {}).toMutation(r._key, Wr.exists(!1)) ]).then((function() {
         return r;
     }));
 }
 
-function If(t) {
+function Ih(t) {
     for (var r, i, o, u = [], a = 1; a < arguments.length; a++) u[a - 1] = arguments[a];
     t = m(t);
     var s = {
@@ -21653,7 +21653,7 @@ function If(t) {
         source: "default"
     }, c = 0;
     "object" != typeof u[c] || El(u[c]) || (s = u[c], c++);
-    var l, h, f, d = {
+    var l, f, h, d = {
         includeMetadataChanges: s.includeMetadataChanges,
         source: s.source
     };
@@ -21662,23 +21662,23 @@ function If(t) {
         u[c] = null === (r = p.next) || void 0 === r ? void 0 : r.bind(p), u[c + 1] = null === (i = p.error) || void 0 === i ? void 0 : i.bind(p), 
         u[c + 2] = null === (o = p.complete) || void 0 === o ? void 0 : o.bind(p);
     }
-    if (t instanceof ml) h = ll(t.firestore, Dl), f = tr(t._key.path), l = {
+    if (t instanceof ml) f = ll(t.firestore, Dl), h = tr(t._key.path), l = {
         next: function(e) {
-            u[c] && u[c](Sf(h, t, e));
+            u[c] && u[c](Sh(f, t, e));
         },
         error: u[c + 1],
         complete: u[c + 2]
     }; else {
         var v = ll(t, vl);
-        h = ll(v.firestore, Dl), f = v._query;
-        var y = new ff(h);
+        f = ll(v.firestore, Dl), h = v._query;
+        var y = new hh(f);
         l = {
             next: function(t) {
-                u[c] && u[c](new sf(h, y, v, t));
+                u[c] && u[c](new sh(f, y, v, t));
             },
             error: u[c + 1],
             complete: u[c + 2]
-        }, Sh(t._query);
+        }, xf(t._query);
     }
     return function(t, r, i, o) {
         var u = this, a = new Uc(o), s = new zs(r, a, i);
@@ -21711,10 +21711,10 @@ function If(t) {
                 }));
             }));
         };
-    }(Al(h), f, d, l);
+    }(Al(f), h, d, l);
 }
 
-function Tf(t, r) {
+function Th(t, r) {
     return function(t, r) {
         var i = this, o = new Uc(r);
         return t.asyncQueue.enqueueAndForget((function() {
@@ -21761,7 +21761,7 @@ function Tf(t, r) {
 /**
  * Locally writes `mutations` on the async queue.
  * @internal
- */ function Ef(t, r) {
+ */ function Eh(t, r) {
     return function(t, r) {
         var i = this, o = new Q;
         return t.asyncQueue.enqueueAndForget((function() {
@@ -21784,9 +21784,9 @@ function Tf(t, r) {
 /**
  * Converts a {@link ViewSnapshot} that contains the single document specified by `ref`
  * to a {@link DocumentSnapshot}.
- */ function Sf(t, e, n) {
-    var r = n.docs.get(e._key), i = new ff(t);
-    return new uf(t, i, e._key, r, new of(n.hasPendingWrites, n.fromCache), e.converter);
+ */ function Sh(t, e, n) {
+    var r = n.docs.get(e._key), i = new hh(t);
+    return new uh(t, i, e._key, r, new oh(n.hasPendingWrites, n.fromCache), e.converter);
 }
 
 /**
@@ -21825,9 +21825,9 @@ function Tf(t, r) {
  * @returns A Promise that will be resolved with the count; the count can be
  * retrieved from `snapshot.data().count`, where `snapshot` is the
  * `AggregateQuerySnapshot` to which the returned Promise resolves.
- */ function xf(t) {
-    return Df(t, {
-        count: ef()
+ */ function xh(t) {
+    return Dh(t, {
+        count: nh()
     });
 }
 
@@ -21863,7 +21863,7 @@ function Tf(t, r) {
  * const totalHours: number = aggregateSnapshot.data().totalHours;
  * const averageScore: number | null = aggregateSnapshot.data().averageScore;
  * ```
- */ function Df(t, r) {
+ */ function Dh(t, r) {
     var i = ll(t.firestore, Dl), o = Al(i), u = Ee(r, (function(t, e) {
         return new di(e, t.aggregateType, t._internalFieldPath);
     }));
@@ -21881,7 +21881,7 @@ function Tf(t, r) {
                       case 1:
                         return o = s.sent(), u.resolve(function(t, r, i) {
                             return e(this, void 0, void 0, (function() {
-                                var e, o, u, a, s, c, l, h;
+                                var e, o, u, a, s, c, l, f;
                                 return n(this, (function(n) {
                                     switch (n.label) {
                                       case 0:
@@ -21894,9 +21894,9 @@ function Tf(t, r) {
                                             return !!t.result;
                                         })), 
                                         // Omit RunAggregationQueryResponse that only contain readTimes.
-                                        B(1 === l.length), h = null === (e = l[0].result) || void 0 === e ? void 0 : e.aggregateFields, 
-                                        [ 2 /*return*/ , Object.keys(h).reduce((function(t, e) {
-                                            return t[s[e]] = h[e], t;
+                                        B(1 === l.length), f = null === (e = l[0].result) || void 0 === e ? void 0 : e.aggregateFields, 
+                                        [ 2 /*return*/ , Object.keys(f).reduce((function(t, e) {
+                                            return t[s[e]] = f[e], t;
                                         }), {}) ];
                                     }
                                 }));
@@ -21921,13 +21921,13 @@ function Tf(t, r) {
      * @internal
      */
         return function(t, e, n) {
-            var r = new ff(t);
+            var r = new hh(t);
             return new Gl(e, r, n);
         }(i, t, e);
     }));
 }
 
-var Cf = /** @class */ function() {
+var Ch = /** @class */ function() {
     function t(t) {
         this.kind = "memory", this._onlineComponentProvider = Lc.provider, (null == t ? void 0 : t.garbageCollector) ? this._offlineComponentProvider = t.garbageCollector._offlineComponentProvider : this._offlineComponentProvider = Rc.provider;
     }
@@ -21936,11 +21936,11 @@ var Cf = /** @class */ function() {
             kind: this.kind
         };
     }, t;
-}(), Nf = /** @class */ function() {
+}(), Nh = /** @class */ function() {
     function t(t) {
         var e;
         this.kind = "persistent", (null == t ? void 0 : t.tabManager) ? (t.tabManager._initialize(t), 
-        e = t.tabManager) : (e = Lf(void 0))._initialize(t), this._onlineComponentProvider = e._onlineComponentProvider, 
+        e = t.tabManager) : (e = Lh(void 0))._initialize(t), this._onlineComponentProvider = e._onlineComponentProvider, 
         this._offlineComponentProvider = e._offlineComponentProvider;
     }
     return t.prototype.toJSON = function() {
@@ -21948,7 +21948,7 @@ var Cf = /** @class */ function() {
             kind: this.kind
         };
     }, t;
-}(), Af = /** @class */ function() {
+}(), Ah = /** @class */ function() {
     function t() {
         this.kind = "memoryEager", this._offlineComponentProvider = Rc.provider;
     }
@@ -21957,7 +21957,7 @@ var Cf = /** @class */ function() {
             kind: this.kind
         };
     }, t;
-}(), kf = /** @class */ function() {
+}(), kh = /** @class */ function() {
     function t(t) {
         this.kind = "memoryLru", this._offlineComponentProvider = {
             build: function() {
@@ -21976,8 +21976,8 @@ var Cf = /** @class */ function() {
  * Creates an instance of `MemoryEagerGarbageCollector`. This is also the
  * default garbage collector unless it is explicitly specified otherwise.
  */
-function Of() {
-    return new Af;
+function Oh() {
+    return new Ah;
 }
 
 /**
@@ -21986,15 +21986,15 @@ function Of() {
  * A target size can be specified as part of the setting parameter. The
  * collector will start deleting documents once the cache size exceeds
  * the given size. The default cache size is 40MB (40 * 1024 * 1024 bytes).
- */ function Pf(t) {
-    return new kf(null == t ? void 0 : t.cacheSizeBytes);
+ */ function Ph(t) {
+    return new kh(null == t ? void 0 : t.cacheSizeBytes);
 }
 
 /**
  * Creates an instance of `MemoryLocalCache`. The instance can be set to
  * `FirestoreSettings.cache` to tell the SDK which cache layer to use.
- */ function Rf(t) {
-    return new Cf(t);
+ */ function Rh(t) {
+    return new Ch(t);
 }
 
 /**
@@ -22002,11 +22002,11 @@ function Of() {
  * `FirestoreSettings.cache` to tell the SDK which cache layer to use.
  *
  * Persistent cache cannot be used in a Node.js environment.
- */ function Vf(t) {
-    return new Nf(t);
+ */ function Vh(t) {
+    return new Nh(t);
 }
 
-var Ff = /** @class */ function() {
+var Fh = /** @class */ function() {
     function t(t) {
         this.forceOwnership = t, this.kind = "persistentSingleTab";
     }
@@ -22026,7 +22026,7 @@ var Ff = /** @class */ function() {
             }
         };
     }, t;
-}(), Mf = /** @class */ function() {
+}(), Mh = /** @class */ function() {
     function t() {
         this.kind = "PersistentMultipleTab";
     }
@@ -22052,14 +22052,14 @@ var Ff = /** @class */ function() {
  *
  * @param settings Configures the created tab manager.
  */
-function Lf(t) {
-    return new Ff(null == t ? void 0 : t.forceOwnership);
+function Lh(t) {
+    return new Fh(null == t ? void 0 : t.forceOwnership);
 }
 
 /**
  * Creates an instance of `PersistentMultipleTabManager`.
- */ function qf() {
-    return new Mf;
+ */ function qh() {
+    return new Mh;
 }
 
 /**
@@ -22077,25 +22077,25 @@ function Lf(t) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ var Uf = {
+ */ var Uh = {
     maxAttempts: 5
-}, Bf = /** @class */ function() {
+}, Bh = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = nh(t);
+        this._dataReader = nf(t);
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = zf(t, this._firestore), i = Xh(r.converter, e, n), o = rh(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
+        var r = zh(t, this._firestore), i = Zf(r.converter, e, n), o = rf(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
         return this._mutations.push(o.toMutation(r._key, Wr.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, u = zf(t, this._firestore);
+        var o, u = zh(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = m(e)) || e instanceof jl ? hh(this._dataReader, "WriteBatch.update", u._key, e, n, r) : lh(this._dataReader, "WriteBatch.update", u._key, e), 
+                return o = "string" == typeof (e = m(e)) || e instanceof jl ? hf(this._dataReader, "WriteBatch.update", u._key, e, n, r) : ff(this._dataReader, "WriteBatch.update", u._key, e), 
         this._mutations.push(o.toMutation(u._key, Wr.exists(!0))), this;
     }, 
     /**
@@ -22106,7 +22106,7 @@ function Lf(t) {
      */
     t.prototype.delete = function(t) {
         this._verifyNotCommitted();
-        var e = zf(t, this._firestore);
+        var e = zh(t, this._firestore);
         return this._mutations = this._mutations.concat(new si(e._key, Wr.none())), this;
     }, 
     /**
@@ -22151,7 +22151,7 @@ function Lf(t) {
  * provides methods for adding writes to the write batch. None of the writes
  * will be committed (or visible locally) until {@link WriteBatch.commit} is
  * called.
- */ function zf(t, e) {
+ */ function zh(t, e) {
     if ((t = m(t)).firestore !== e) throw new j(K.INVALID_ARGUMENT, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -22203,7 +22203,7 @@ function Lf(t) {
  * The `Transaction` object passed to a transaction's `updateFunction` provides
  * the methods to read and write data within the transaction context. See
  * {@link runTransaction}.
- */ var Gf = /** @class */ function(e) {
+ */ var Gh = /** @class */ function(e) {
     // This class implements the same logic as the Transaction API in the Lite SDK
     // but is subclassed in order to return its own DocumentSnapshot types.
     /** @hideconstructor */
@@ -22217,9 +22217,9 @@ function Lf(t) {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    return t(n, e), n.prototype.get = function(t) {
-        var n = this, r = zf(t, this._firestore), i = new ff(this._firestore);
+        var n = this, r = zh(t, this._firestore), i = new hh(this._firestore);
         return e.prototype.get.call(this, t).then((function(t) {
-            return new uf(n._firestore, i, r._key, t._document, new of(
+            return new uh(n._firestore, i, r._key, t._document, new oh(
             /* hasPendingWrites= */ !1, 
             /* fromCache= */ !1), r.converter);
         }));
@@ -22227,7 +22227,7 @@ function Lf(t) {
 }(/** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = nh(t)
+        this._firestore = t, this._transaction = e, this._dataReader = nf(t)
         /**
      * Reads the document referenced by the provided {@link DocumentReference}.
      *
@@ -22236,23 +22236,23 @@ function Lf(t) {
      */;
     }
     return t.prototype.get = function(t) {
-        var e = this, n = zf(t, this._firestore), r = new Zh(this._firestore);
+        var e = this, n = zh(t, this._firestore), r = new $f(this._firestore);
         return this._transaction.lookup([ n._key ]).then((function(t) {
             if (!t || 1 !== t.length) return U();
             var i = t[0];
-            if (i.isFoundDocument()) return new Ih(e._firestore, r, i.key, i, n.converter);
-            if (i.isNoDocument()) return new Ih(e._firestore, r, n._key, null, n.converter);
+            if (i.isFoundDocument()) return new Tf(e._firestore, r, i.key, i, n.converter);
+            if (i.isNoDocument()) return new Tf(e._firestore, r, n._key, null, n.converter);
             throw U();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = zf(t, this._firestore), i = Xh(r.converter, e, n), o = rh(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
+        var r = zh(t, this._firestore), i = Zf(r.converter, e, n), o = rf(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, u = zf(t, this._firestore);
+        var o, u = zh(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = m(e)) || e instanceof jl ? hh(this._dataReader, "Transaction.update", u._key, e, n, r) : lh(this._dataReader, "Transaction.update", u._key, e), 
+                return o = "string" == typeof (e = m(e)) || e instanceof jl ? hf(this._dataReader, "Transaction.update", u._key, e, n, r) : ff(this._dataReader, "Transaction.update", u._key, e), 
         this._transaction.update(u._key, o), this;
     }, 
     /**
@@ -22262,7 +22262,7 @@ function Lf(t) {
      * @returns This `Transaction` instance. Used for chaining method calls.
      */
     t.prototype.delete = function(t) {
-        var e = zf(t, this._firestore);
+        var e = zh(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }, t;
 }());
@@ -22285,9 +22285,9 @@ function Lf(t) {
  * (the `updateFunction` returned a failed promise), the promise returned by the
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
- */ function Kf(t, r, i) {
+ */ function Kh(t, r, i) {
     t = ll(t, Dl);
-    var o = Object.assign(Object.assign({}, Uf), i);
+    var o = Object.assign(Object.assign({}, Uh), i);
     return function(t) {
         if (t.maxAttempts < 1) throw new j(K.INVALID_ARGUMENT, "Max attempts must be at least 1");
     }(o), function(t, r, i) {
@@ -22307,7 +22307,7 @@ function Lf(t) {
             }));
         })), u.promise;
     }(Al(t), (function(e) {
-        return r(new Gf(t, e));
+        return r(new Gh(t, e));
     }), o);
 }
 
@@ -22330,15 +22330,15 @@ function Lf(t) {
 /**
  * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or
  * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.
- */ function jf() {
-    return new ih("deleteField");
+ */ function jh() {
+    return new of("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 Qf() {
-    return new uh("serverTimestamp");
+ */ function Qh() {
+    return new af("serverTimestamp");
 }
 
 /**
@@ -22352,11 +22352,11 @@ function Lf(t) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function Wf() {
+ */ function Wh() {
     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 ah("arrayUnion", t);
+        return new sf("arrayUnion", t);
 }
 
 /**
@@ -22369,11 +22369,11 @@ function Lf(t) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Jf() {
+ */ function Jh() {
     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 sh("arrayRemove", t);
+        return new cf("arrayRemove", t);
 }
 
 /**
@@ -22394,8 +22394,8 @@ function Lf(t) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Hf(t) {
-    return new ch("increment", t);
+ */ function Hh(t) {
+    return new lf("increment", t);
 }
 
 /**
@@ -22404,7 +22404,7 @@ function Lf(t) {
  * @param values - Create a `VectorValue` instance with a copy of this array of numbers.
  *
  * @returns A new `VectorValue` constructed with a copy of the given array of numbers.
- */ function Yf(t) {
+ */ function Yh(t) {
     return new Hl(t);
 }
 
@@ -22434,9 +22434,9 @@ function Lf(t) {
  *
  * @returns A {@link WriteBatch} that can be used to atomically execute multiple
  * writes.
- */ function Xf(t) {
-    return Al(t = ll(t, Dl)), new Bf(t, (function(e) {
-        return Ef(t, e);
+ */ function Xh(t) {
+    return Al(t = ll(t, Dl)), new Bh(t, (function(e) {
+        return Eh(t, e);
     }))
     /**
  * @license
@@ -22456,7 +22456,7 @@ function Lf(t) {
  */;
 }
 
-function Zf(t, i) {
+function Zh(t, i) {
     var o = Al(t = ll(t, Dl));
     if (!o._uninitializedComponentsProvider || "memory" === o._uninitializedComponentsProvider._offline.kind) 
     // PORTING NOTE: We don't return an error if the user has not enabled
@@ -22471,10 +22471,10 @@ function Zf(t, i) {
             }
         }(t) : t, n = [];
         if (Array.isArray(e.indexes)) for (var r = 0, i = e.indexes; r < i.length; r++) {
-            var o = i[r], u = $f(o, "collectionGroup"), a = [];
+            var o = i[r], u = $h(o, "collectionGroup"), a = [];
             if (Array.isArray(o.fields)) for (var s = 0, c = o.fields; s < c.length; s++) {
-                var l = c[s], h = wh("setIndexConfiguration", $f(l, "fieldPath"));
-                "CONTAINS" === l.arrayConfig ? a.push(new gt(h, 2 /* IndexKind.CONTAINS */)) : "ASCENDING" === l.order ? a.push(new gt(h, 0 /* IndexKind.ASCENDING */)) : "DESCENDING" === l.order && a.push(new gt(h, 1 /* IndexKind.DESCENDING */));
+                var l = c[s], f = bf("setIndexConfiguration", $h(l, "fieldPath"));
+                "CONTAINS" === l.arrayConfig ? a.push(new gt(f, 2 /* IndexKind.CONTAINS */)) : "ASCENDING" === l.order ? a.push(new gt(f, 0 /* IndexKind.ASCENDING */)) : "DESCENDING" === l.order && a.push(new gt(f, 1 /* IndexKind.DESCENDING */));
             }
             n.push(new pt(pt.UNKNOWN_ID, u, a, bt.empty()));
         }
@@ -22563,7 +22563,7 @@ function Zf(t, i) {
     }(o, u);
 }
 
-function $f(t, e) {
+function $h(t, e) {
     if ("string" != typeof t[e]) throw new j(K.INVALID_ARGUMENT, "Missing string value for: " + e);
     return t[e];
 }
@@ -22778,7 +22778,7 @@ function ad(t) {
  * public API surface.
  *
  * @internal
- */ var cd, ld, hd = /** @class */ function() {
+ */ var cd, ld, fd = /** @class */ function() {
     function t() {
         throw new Error("instances of this class should not be created");
     }
@@ -22796,9 +22796,9 @@ function ad(t) {
      * the first invocation of the returned function does anything; all subsequent
      * invocations do nothing.
      */    return t.onExistenceFilterMismatch = function(t) {
-        return fd.instance.onExistenceFilterMismatch(t);
+        return hd.instance.onExistenceFilterMismatch(t);
     }, t;
-}(), fd = /** @class */ function() {
+}(), hd = /** @class */ function() {
     function t() {
         this.Uu = new Map;
     }
@@ -22835,9 +22835,9 @@ function ad(t) {
     return r = Object.assign({
         useFetchStreams: ld
     }, r), o._setSettings(r), o;
-}), "PUBLIC").setMultipleInstances(!0)), u(A, "4.7.3-canary.64db19264", cd), 
+}), "PUBLIC").setMultipleInstances(!0)), u(A, "4.7.3-canary.8fb044e8d", cd), 
 // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-u(A, "4.7.3-canary.64db19264", "esm5");
+u(A, "4.7.3-canary.8fb044e8d", "esm5");
 
-export { Yh as AbstractUserDataWriter, zl as AggregateField, Gl as AggregateQuerySnapshot, Kl as Bytes, xl as CACHE_SIZE_UNLIMITED, yl as CollectionReference, ml as DocumentReference, uf as DocumentSnapshot, jl as FieldPath, Wl as FieldValue, Dl as Firestore, j as FirestoreError, Jl as GeoPoint, Sl as LoadBundleTask, td as PersistentCacheIndexManager, vl as Query, kh as QueryCompositeFilterConstraint, Dh as QueryConstraint, af as QueryDocumentSnapshot, zh as QueryEndAtConstraint, Nh as QueryFieldFilterConstraint, Fh as QueryLimitConstraint, Rh as QueryOrderByConstraint, sf as QuerySnapshot, qh as QueryStartAtConstraint, of as SnapshotMetadata, at as Timestamp, Gf as Transaction, Hl as VectorValue, Bf as WriteBatch, rt as _AutoId, Ve as _ByteString, Ke as _DatabaseId, dt as _DocumentKey, et as _EmptyAppCheckTokenProvider, J as _EmptyAuthCredentialsProvider, ft as _FieldPath, hd as _TestingHooks, ll as _cast, z as _debugAssert, sd as _internalAggregationQueryToProtoRunAggregationQueryRequest, ad as _internalQueryToProtoQueryTarget, Re as _isBase64Available, L as _logWarn, ul as _validateIsNotUsedTogether, _f as addDoc, nf as aggregateFieldEqual, rf as aggregateQuerySnapshotEqual, Ph as and, Jf as arrayRemove, Wf as arrayUnion, tf as average, Vl as clearIndexedDbPersistence, gl as collection, wl as collectionGroup, pl as connectFirestoreEmulator, ef as count, id as deleteAllPersistentCacheIndexes, bf as deleteDoc, jf as deleteField, Ll as disableNetwork, rd as disablePersistentCacheIndexAutoCreation, bl as doc, Ql as documentId, Ol as enableIndexedDbPersistence, Pl as enableMultiTabIndexedDbPersistence, Ml as enableNetwork, nd as enablePersistentCacheIndexAutoCreation, Kh as endAt, Gh as endBefore, Al as ensureFirestoreConfigured, Ef as executeWrite, Df as getAggregateFromServer, xf as getCountFromServer, hf as getDoc, df as getDocFromCache, pf as getDocFromServer, vf as getDocs, mf as getDocsFromCache, yf as getDocsFromServer, Nl as getFirestore, ed as getPersistentCacheIndexManager, Hf as increment, Cl as initializeFirestore, Mh as limit, Lh as limitToLast, Ul as loadBundle, Of as memoryEagerGarbageCollector, Rf as memoryLocalCache, Pf as memoryLruGarbageCollector, Bl as namedQuery, If as onSnapshot, Tf as onSnapshotsInSync, Oh as or, Vh as orderBy, Vf as persistentLocalCache, qf as persistentMultipleTabManager, Lf as persistentSingleTabManager, Ch as query, Il as queryEqual, _l as refEqual, Kf as runTransaction, Qf as serverTimestamp, gf as setDoc, Zf as setIndexConfiguration, V as setLogLevel, lf as snapshotEqual, Bh as startAfter, Uh as startAt, $h as sum, ql as terminate, wf as updateDoc, Yf as vector, Fl as waitForPendingWrites, Ah as where, Xf as writeBatch };
+export { Xf as AbstractUserDataWriter, zl as AggregateField, Gl as AggregateQuerySnapshot, Kl as Bytes, xl as CACHE_SIZE_UNLIMITED, yl as CollectionReference, ml as DocumentReference, uh as DocumentSnapshot, jl as FieldPath, Wl as FieldValue, Dl as Firestore, j as FirestoreError, Jl as GeoPoint, Sl as LoadBundleTask, td as PersistentCacheIndexManager, vl as Query, Of as QueryCompositeFilterConstraint, Cf as QueryConstraint, ah as QueryDocumentSnapshot, Gf as QueryEndAtConstraint, Af as QueryFieldFilterConstraint, Mf as QueryLimitConstraint, Vf as QueryOrderByConstraint, sh as QuerySnapshot, Uf as QueryStartAtConstraint, oh as SnapshotMetadata, at as Timestamp, Gh as Transaction, Hl as VectorValue, Bh as WriteBatch, rt as _AutoId, Ve as _ByteString, Ke as _DatabaseId, dt as _DocumentKey, et as _EmptyAppCheckTokenProvider, J as _EmptyAuthCredentialsProvider, ht as _FieldPath, fd as _TestingHooks, ll as _cast, z as _debugAssert, sd as _internalAggregationQueryToProtoRunAggregationQueryRequest, ad as _internalQueryToProtoQueryTarget, Re as _isBase64Available, L as _logWarn, ul as _validateIsNotUsedTogether, _h as addDoc, rh as aggregateFieldEqual, ih as aggregateQuerySnapshotEqual, Rf as and, Jh as arrayRemove, Wh as arrayUnion, eh as average, Vl as clearIndexedDbPersistence, gl as collection, wl as collectionGroup, pl as connectFirestoreEmulator, nh as count, id as deleteAllPersistentCacheIndexes, bh as deleteDoc, jh as deleteField, Ll as disableNetwork, rd as disablePersistentCacheIndexAutoCreation, bl as doc, Ql as documentId, Ol as enableIndexedDbPersistence, Pl as enableMultiTabIndexedDbPersistence, Ml as enableNetwork, nd as enablePersistentCacheIndexAutoCreation, jf as endAt, Kf as endBefore, Al as ensureFirestoreConfigured, Eh as executeWrite, Dh as getAggregateFromServer, xh as getCountFromServer, fh as getDoc, dh as getDocFromCache, ph as getDocFromServer, vh as getDocs, mh as getDocsFromCache, yh as getDocsFromServer, Nl as getFirestore, ed as getPersistentCacheIndexManager, Hh as increment, Cl as initializeFirestore, Lf as limit, qf as limitToLast, Ul as loadBundle, Oh as memoryEagerGarbageCollector, Rh as memoryLocalCache, Ph as memoryLruGarbageCollector, Bl as namedQuery, Ih as onSnapshot, Th as onSnapshotsInSync, Pf as or, Ff as orderBy, Vh as persistentLocalCache, qh as persistentMultipleTabManager, Lh as persistentSingleTabManager, Nf as query, Il as queryEqual, _l as refEqual, Kh as runTransaction, Qh as serverTimestamp, gh as setDoc, Zh as setIndexConfiguration, V as setLogLevel, lh as snapshotEqual, zf as startAfter, Bf as startAt, th as sum, ql as terminate, wh as updateDoc, Yh as vector, Fl as waitForPendingWrites, kf as where, Xh as writeBatch };
 //# sourceMappingURL=index.esm5.js.map