@firebase/firestore 3.4.8-canary.69baecadd → 3.4.8-canary.6ceff4db0

package/dist/index.rn.js

@@ -6,7 +6,7 @@ import { Logger as o, LogLevel as u } from "@firebase/logger";
 
 import { FirebaseError as a, base64 as c, getUA as h, isIndexedDBAvailable as l, isSafari as f, isMobileCordova as d, isReactNative as _, isElectron as w, isIE as m, isUWP as g, isBrowserExtension as y, createMockUserToken as p, getModularInstance as I, deepEqual as T } from "@firebase/util";
 
-import { XhrIo as E, EventType as A, ErrorCode as R, createWebChannelTransport as P, getStatEventTarget as b, FetchXmlHttpFactory as V, WebChannel as v, Event as S, Stat as D } from "@firebase/webchannel-wrapper";
+import { XhrIo as E, EventType as A, ErrorCode as R, createWebChannelTransport as b, getStatEventTarget as P, FetchXmlHttpFactory as V, WebChannel as v, Event as S, Stat as D } from "@firebase/webchannel-wrapper";
 
 const C = "@firebase/firestore";
 
@@ -70,7 +70,7 @@ x.MOCK_USER = new x("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let N = "9.7.0-canary.69baecadd";
+let N = "9.7.0-canary.6ceff4db0";
 
 /**
  * @license
@@ -1387,7 +1387,7 @@ const Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     return "number" == typeof t ? t : "string" == typeof t ? Number(t) : 0;
 }
 
-/** Converts the possible Proto types for Blobs into a ByteString. */ function Pt(t) {
+/** Converts the possible Proto types for Blobs into a ByteString. */ function bt(t) {
     return "string" == typeof t ? Tt.fromBase64String(t) : Tt.fromUint8Array(t);
 }
 
@@ -1424,7 +1424,7 @@ const Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *   FieldValueOptions to value().
  * - With respect to other ServerTimestampValues, they sort by their
  *   localWriteTime.
- */ function bt(t) {
+ */ function Pt(t) {
     var e, n;
     return "server_timestamp" === (null === (n = ((null === (e = null == t ? void 0 : t.mapValue) || void 0 === e ? void 0 : e.fields) || {}).__type__) || void 0 === n ? void 0 : n.stringValue);
 }
@@ -1440,7 +1440,7 @@ const Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  */
 function Vt(t) {
     const e = t.mapValue.fields.__previous_value__;
-    return bt(e) ? Vt(e) : e;
+    return Pt(e) ? Vt(e) : e;
 }
 
 /**
@@ -1640,7 +1640,7 @@ function Ct(t) {
 
 /** Extracts the backend's type order for the provided value. */
 function Ft(t) {
-    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? bt(t) ? 4 /* ServerTimestampValue */ : Yt(t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : U();
+    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Pt(t) ? 4 /* ServerTimestampValue */ : Yt(t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : U();
 }
 
 /** Tests `left` and `right` for equality based on the backend semantics. */ function $t(t, e) {
@@ -1672,7 +1672,7 @@ function Ft(t) {
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            return Pt(t.bytesValue).isEqual(Pt(e.bytesValue));
+            return bt(t.bytesValue).isEqual(bt(e.bytesValue));
         }(t, e);
 
       case 7 /* RefValue */ :
@@ -1745,7 +1745,7 @@ function Lt(t, e) {
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            const n = Pt(t), s = Pt(e);
+            const n = bt(t), s = bt(e);
             return n.compareTo(s);
         }(t.bytesValue, e.bytesValue);
 
@@ -1819,7 +1819,7 @@ function Kt(t) {
     return "nullValue" in t ? "null" : "booleanValue" in t ? "" + t.booleanValue : "integerValue" in t ? "" + t.integerValue : "doubleValue" in t ? "" + t.doubleValue : "timestampValue" in t ? function(t) {
         const e = At(t);
         return `time(${e.seconds},${e.nanos})`;
-    }(t.timestampValue) : "stringValue" in t ? t.stringValue : "bytesValue" in t ? Pt(t.bytesValue).toBase64() : "referenceValue" in t ? (n = t.referenceValue, 
+    }(t.timestampValue) : "stringValue" in t ? t.stringValue : "bytesValue" in t ? bt(t.bytesValue).toBase64() : "referenceValue" in t ? (n = t.referenceValue, 
     kt.fromName(n).toString()) : "geoPointValue" in t ? `geo(${(e = t.geoPointValue).latitude},${e.longitude})` : "arrayValue" in t ? function(t) {
         let e = "[", n = !0;
         for (const s of t.values || []) n ? n = !1 : e += ",", e += Kt(s);
@@ -2889,11 +2889,11 @@ function Re(t, e) {
     return t.collectionGroup === e.collectionGroup && (!!t.path.isEqual(e.path) && (!!qe(t.startAt, e.startAt) && qe(t.endAt, e.endAt)));
 }
 
-function Pe(t) {
+function be(t) {
     return kt.isDocumentKey(t.path) && null === t.collectionGroup && 0 === t.filters.length;
 }
 
-/** Returns the field filters that target the given field path. */ function be(t, e) {
+/** Returns the field filters that target the given field path. */ function Pe(t, e) {
     return t.filters.filter((t => t instanceof Se && t.field.isEqual(e)));
 }
 
@@ -2908,7 +2908,7 @@ function Pe(t) {
 function Ve(t, e, n) {
     let s = Ot, i = !0;
     // Process all filters to find a value for the current field segment
-    for (const n of be(t, e)) {
+    for (const n of Pe(t, e)) {
         let t = Ot, e = !0;
         switch (n.op) {
           case "<" /* LESS_THAN */ :
@@ -2966,7 +2966,7 @@ function Ve(t, e, n) {
  */ function ve(t, e, n) {
     let s = Mt, i = !0;
     // Process all filters to find a value for the current field segment
-    for (const n of be(t, e)) {
+    for (const n of Pe(t, e)) {
         let t = Mt, e = !0;
         switch (n.op) {
           case ">=" /* GREATER_THAN_OR_EQUAL */ :
@@ -3689,18 +3689,18 @@ class Rn {
  * Encodes a precondition for a mutation. This follows the model that the
  * backend accepts with the special case of an explicit "empty" precondition
  * (meaning no precondition).
- */ class Pn {
+ */ class bn {
     constructor(t, e) {
         this.updateTime = t, this.exists = e;
     }
     /** Creates a new empty Precondition. */    static none() {
-        return new Pn;
+        return new bn;
     }
     /** Creates a new Precondition with an exists flag. */    static exists(t) {
-        return new Pn(void 0, t);
+        return new bn(void 0, t);
     }
     /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {
-        return new Pn(t);
+        return new bn(t);
     }
     /** Returns whether this Precondition is empty. */    get isNone() {
         return void 0 === this.updateTime && void 0 === this.exists;
@@ -3710,7 +3710,7 @@ class Rn {
     }
 }
 
-/** Returns true if the preconditions is valid for the given document. */ function bn(t, e) {
+/** Returns true if the preconditions is valid for the given document. */ function Pn(t, e) {
     return void 0 !== t.updateTime ? e.isFoundDocument() && e.version.isEqual(t.updateTime) : void 0 === t.exists || t.exists === e.isFoundDocument();
 }
 
@@ -3778,7 +3778,7 @@ class Rn {
         const s = t.value.clone(), i = On(t.fieldTransforms, e, n.transformResults);
         s.setAll(i), e.convertToFoundDocument(n.version, s).setHasCommittedMutations();
     }(t, e, n) : t instanceof kn ? function(t, e, n) {
-        if (!bn(t.precondition, e)) 
+        if (!Pn(t.precondition, e)) 
         // Since the mutation was not rejected, we know that the precondition
         // matched on the backend. We therefore must not have the expected version
         // of the document in our cache and convert to an UnknownDocument with a
@@ -3807,7 +3807,7 @@ class Rn {
  *     batch this mutation is a part of.
  */ function Sn(t, e, n) {
     t instanceof Nn ? function(t, e, n) {
-        if (!bn(t.precondition, e)) 
+        if (!Pn(t.precondition, e)) 
         // The mutation failed to apply (e.g. a document ID created with add()
         // caused a name collision).
         return;
@@ -3827,14 +3827,14 @@ class Rn {
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
  */ (t, e, n) : t instanceof kn ? function(t, e, n) {
-        if (!bn(t.precondition, e)) return;
+        if (!Pn(t.precondition, e)) return;
         const s = Fn(t.fieldTransforms, n, e), i = e.data;
         i.setAll(Mn(t)), i.setAll(s), e.convertToFoundDocument(xn(e), i).setHasLocalMutations();
     }
     /**
  * Returns a FieldPath/Value map with the content of the PatchMutation.
  */ (t, e, n) : function(t, e) {
-        bn(t.precondition, e) && 
+        Pn(t.precondition, e) && 
         // We don't call `setHasLocalMutations()` since we want to be backwards
         // compatible with the existing SDK behavior.
         e.convertToNoDocument(ht.min());
@@ -4623,7 +4623,7 @@ class as {
         const e = t.targetId, n = t.$.count, s = this.wt(e);
         if (s) {
             const t = s.target;
-            if (Pe(t)) if (0 === n) {
+            if (be(t)) if (0 === n) {
                 // The existence filter told us the document does not exist. We deduce
                 // that this document does not exist and apply a deleted document to
                 // our updates. Without applying this deleted document there might be
@@ -4648,7 +4648,7 @@ class as {
         this.st.forEach(((n, s) => {
             const i = this.wt(s);
             if (i) {
-                if (n.current && Pe(i.target)) {
+                if (n.current && be(i.target)) {
                     // Document queries for document that don't exist can produce an empty
                     // result set. To update our local cache, we synthesize a document
                     // delete if we have not previously received the document. This
@@ -4882,7 +4882,7 @@ function Ts(t, e) {
     const n = ps(e);
     if (n.get(1) !== t.databaseId.projectId) throw new j(Q.INVALID_ARGUMENT, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
     if (n.get(3) !== t.databaseId.database) throw new j(Q.INVALID_ARGUMENT, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
-    return new kt(Ps(n));
+    return new kt(bs(n));
 }
 
 function Es(t, e) {
@@ -4895,18 +4895,18 @@ function As(t) {
     // "/documents". In v1 all resource paths contain "/documents". Preserve the
     // ability to read the v1beta1 form for compatibility with queries persisted
     // in the local target cache.
-        return 4 === e.length ? wt.emptyPath() : Ps(e);
+        return 4 === e.length ? wt.emptyPath() : bs(e);
 }
 
 function Rs(t) {
     return new wt([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Ps(t) {
+function bs(t) {
     return q(t.length > 4 && "documents" === t.get(4)), t.popFirst(5);
 }
 
-/** Creates a Document proto from key and fields (but no create/update time) */ function bs(t, e, n) {
+/** Creates a Document proto from key and fields (but no create/update time) */ function Ps(t, e, n) {
     return {
         name: Is(t, e),
         fields: n.value.mapValue.fields
@@ -5000,11 +5000,11 @@ function Ss(t, e) {
 function Ds(t, e) {
     let n;
     if (e instanceof Nn) n = {
-        update: bs(t, e.key, e.value)
+        update: Ps(t, e.key, e.value)
     }; else if (e instanceof $n) n = {
         delete: Is(t, e.key)
     }; else if (e instanceof kn) n = {
-        update: bs(t, e.key, e.data),
+        update: Ps(t, e.key, e.data),
         updateMask: Gs(e.fieldMask)
     }; else {
         if (!(e instanceof Bn)) return U();
@@ -5046,8 +5046,8 @@ function Ds(t, e) {
 
 function Cs(t, e) {
     const n = e.currentDocument ? function(t) {
-        return void 0 !== t.updateTime ? Pn.updateTime(gs(t.updateTime)) : void 0 !== t.exists ? Pn.exists(t.exists) : Pn.none();
-    }(e.currentDocument) : Pn.none(), s = e.updateTransforms ? e.updateTransforms.map((e => function(t, e) {
+        return void 0 !== t.updateTime ? bn.updateTime(gs(t.updateTime)) : void 0 !== t.exists ? bn.exists(t.exists) : bn.none();
+    }(e.currentDocument) : bn.none(), s = e.updateTransforms ? e.updateTransforms.map((e => function(t, e) {
         let n = null;
         if ("setToServerValue" in e) q("REQUEST_TIME" === e.setToServerValue), n = new _n; else if ("appendMissingElements" in e) {
             const t = e.appendMissingElements.values || [];
@@ -5736,7 +5736,7 @@ class Ti {
         t && this.At.reject(t), this.aborted || (F("SimpleDb", "Aborting transaction:", t ? t.message : "Client-initiated abort"), 
         this.aborted = !0, this.transaction.abort());
     }
-    Pt() {
+    bt() {
         // If the browser supports V3 IndexedDB, we invoke commit() explicitly to
         // speed up index DB processing if the event loop remains blocks.
         // eslint-disable-next-line @typescript-eslint/no-explicit-any
@@ -5753,7 +5753,7 @@ class Ti {
      * correct, but they allow type safety through the rest of the consuming code.
      */    store(t) {
         const e = this.transaction.objectStore(t);
-        return new bi(e);
+        return new Pi(e);
     }
 }
 
@@ -5774,7 +5774,7 @@ class Ti {
      * objectstores.
      */
     constructor(t, e, n) {
-        this.name = t, this.version = e, this.bt = n;
+        this.name = t, this.version = e, this.Pt = n;
         // NOTE: According to https://bugs.webkit.org/show_bug.cgi?id=197050, the
         // bug we're checking for should exist in iOS >= 12.2 and < 13, but for
         // whatever reason it's much harder to hit after 12.2 so we only proactively
@@ -5848,7 +5848,7 @@ class Ti {
             }, s.onupgradeneeded = t => {
                 F("SimpleDb", 'Database "' + this.name + '" requires upgrade from version:', t.oldVersion);
                 const e = t.target.result;
-                this.bt.kt(e, s.transaction, t.oldVersion, this.version).next((() => {
+                this.Pt.kt(e, s.transaction, t.oldVersion, this.version).next((() => {
                     F("SimpleDb", "Database upgrade to version " + this.version + " complete");
                 }));
             };
@@ -5864,7 +5864,7 @@ class Ti {
             ++r;
             try {
                 this.db = await this.Nt(t);
-                const e = Ti.open(this.db, t, i ? "readonly" : "readwrite", n), r = s(e).next((t => (e.Pt(), 
+                const e = Ti.open(this.db, t, i ? "readonly" : "readwrite", n), r = s(e).next((t => (e.bt(), 
                 t))).catch((t => (
                 // Abort the transaction if there was an error.
                 e.abort(t), Ii.reject(t)))).toPromise();
@@ -5935,7 +5935,7 @@ class Ti {
     }
 }
 
-/** Verifies whether `e` is an IndexedDbTransactionError. */ function Pi(t) {
+/** Verifies whether `e` is an IndexedDbTransactionError. */ function bi(t) {
     // Use name equality, as instanceof checks on errors don't work with errors
     // that wrap other errors.
     return "IndexedDbTransactionError" === t.name;
@@ -5950,7 +5950,7 @@ class Ti {
  * method return a PersistencePromise instead.
  * 3) Provides a higher-level API to avoid needing to do excessive wrapping of
  * intermediate IndexedDB types (IDBCursorWithValue, etc.)
- */ class bi {
+ */ class Pi {
     constructor(t) {
         this.store = t;
     }
@@ -6485,7 +6485,7 @@ function qi(t, e) {
 /** Encodes TargetData into a DbTarget for storage locally. */ function Gi(t, e) {
     const n = Li(e.snapshotVersion), s = Li(e.lastLimboFreeSnapshotVersion);
     let i;
-    i = Pe(e.target) ? Ns(t.Jt, e.target) : ks(t.Jt, e.target);
+    i = be(e.target) ? Ns(t.Jt, e.target) : ks(t.Jt, e.target);
     // We can't store the resumeToken as a ByteString in IndexedDb, so we
     // convert it to a base64 string for storage.
         const r = e.resumeToken.toBase64();
@@ -6751,7 +6751,7 @@ class Zi {
             const n = t.timestampValue;
             this.ne(e, 20), "string" == typeof n ? e.ie(n) : (e.ie(`${n.seconds || ""}`), e.se(n.nanos || 0));
         } else if ("stringValue" in t) this.re(t.stringValue, e), this.oe(e); else if ("bytesValue" in t) this.ne(e, 30), 
-        e.ue(Pt(t.bytesValue)), this.oe(e); else if ("referenceValue" in t) this.ae(t.referenceValue, e); else if ("geoPointValue" in t) {
+        e.ue(bt(t.bytesValue)), this.oe(e); else if ("referenceValue" in t) this.ae(t.referenceValue, e); else if ("geoPointValue" in t) {
             const n = t.geoPointValue;
             this.ne(e, 45), e.se(n.latitude || 0), e.se(n.longitude || 0);
         } else "mapValue" in t ? Yt(t) ? this.ne(e, Number.MAX_SAFE_INTEGER) : (this.ce(t.mapValue, e), 
@@ -6891,8 +6891,8 @@ function er(t) {
     /**
      * Writes the "infinity" byte sequence that sorts after all other byte
      * sequences written in ascending order.
-     */    Pe() {
-        this.be(255), this.be(255);
+     */    be() {
+        this.Pe(255), this.Pe(255);
     }
     /**
      * Writes the "infinity" byte sequence that sorts before all other byte
@@ -6934,19 +6934,19 @@ function er(t) {
     }
     /** Writes a single byte ascending to the buffer. */    _e(t) {
         const e = 255 & t;
-        0 === e ? (this.be(0), this.be(255)) : 255 === e ? (this.be(255), this.be(0)) : this.be(e);
+        0 === e ? (this.Pe(0), this.Pe(255)) : 255 === e ? (this.Pe(255), this.Pe(0)) : this.Pe(e);
     }
     /** Writes a single byte descending to the buffer.  */    ge(t) {
         const e = 255 & t;
         0 === e ? (this.ve(0), this.ve(255)) : 255 === e ? (this.ve(255), this.ve(0)) : this.ve(t);
     }
     we() {
-        this.be(0), this.be(1);
+        this.Pe(0), this.Pe(1);
     }
     ye() {
         this.ve(0), this.ve(1);
     }
-    be(t) {
+    Pe(t) {
         this.Ae(1), this.buffer[this.position++] = t;
     }
     ve(t) {
@@ -6980,7 +6980,7 @@ class sr {
         this.De.Te(t);
     }
     ee() {
-        this.De.Pe();
+        this.De.be();
     }
 }
 
@@ -7375,7 +7375,7 @@ class dr {
                     const u = function(t, e) {
                         const n = oe(e);
                         if (void 0 === n) return null;
-                        for (const e of be(t, n.fieldPath)) switch (e.op) {
+                        for (const e of Pe(t, n.fieldPath)) switch (e.op) {
                           case "array-contains-any" /* ARRAY_CONTAINS_ANY */ :
                             return e.value.arrayValue.values || [];
 
@@ -7390,7 +7390,7 @@ class dr {
  * `null` if there are no such filters.
  */ (r, i), a = function(t, e) {
                         const n = new Map;
-                        for (const s of ue(e)) for (const e of be(t, s.fieldPath)) switch (e.op) {
+                        for (const s of ue(e)) for (const e of Pe(t, s.fieldPath)) switch (e.op) {
                           case "==" /* EQUAL */ :
                           case "in" /* IN */ :
                             // Encode equality prefix, which is encoded in the index value before
@@ -7926,7 +7926,7 @@ class Er {
         })).next((() => e));
     }
     addMutationBatch(t, e, n, s) {
-        const i = Pr(t), r = Rr(t);
+        const i = br(t), r = Rr(t);
         // The IndexedDb implementation in Chrome (and Firefox) does not handle
         // compound indices that include auto-generated keys correctly. To ensure
         // that the index entry is added correctly in all browsers, we perform two
@@ -8008,7 +8008,7 @@ class Er {
         // Scan the document-mutation index starting with a prefix starting with
         // the given documentKey.
         const n = Ys(this.userId, e.path), s = IDBKeyRange.lowerBound(n), i = [];
-        return Pr(t).Wt({
+        return br(t).Wt({
             range: s
         }, ((n, s, r) => {
             const [o, u, a] = n, c = Hs(u);
@@ -8032,7 +8032,7 @@ class Er {
         let n = new ge(ot);
         const s = [];
         return e.forEach((e => {
-            const i = Ys(this.userId, e.path), r = IDBKeyRange.lowerBound(i), o = Pr(t).Wt({
+            const i = Ys(this.userId, e.path), r = IDBKeyRange.lowerBound(i), o = br(t).Wt({
                 range: r
             }, ((t, s, i) => {
                 const [r, o, u] = t, a = Hs(o);
@@ -8054,7 +8054,7 @@ class Er {
         // SortedSet to accumulate batch IDs so they can be traversed in order in a
         // scan of the main table.
         let o = new ge(ot);
-        return Pr(t).Wt({
+        return br(t).Wt({
             range: r
         }, ((t, e, i) => {
             const [r, u, a] = t, c = Hs(u);
@@ -8101,7 +8101,7 @@ class Er {
             // the queue is empty.
                         const n = IDBKeyRange.lowerBound([ this.userId ]);
             const s = [];
-            return Pr(t).Wt({
+            return br(t).Wt({
                 range: n
             }, ((t, e, n) => {
                 if (t[0] === this.userId) {
@@ -8119,7 +8119,7 @@ class Er {
     // PORTING NOTE: Multi-tab only (state is held in memory in other clients).
     /** Returns the mutation queue's metadata from IndexedDb. */
     wn(t) {
-        return br(t).get(this.userId).next((t => t || {
+        return Pr(t).get(this.userId).next((t => t || {
             userId: this.userId,
             lastAcknowledgedBatchId: -1,
             lastStreamToken: ""
@@ -8133,7 +8133,7 @@ class Er {
  */ function Ar(t, e, n) {
     const s = Ys(e, n.path), i = s[1], r = IDBKeyRange.lowerBound(s);
     let o = !1;
-    return Pr(t).Wt({
+    return br(t).Wt({
         range: r,
         jt: !0
     }, ((t, n, s) => {
@@ -8152,13 +8152,13 @@ function Rr(t) {
 
 /**
  * Helper to get a typed SimpleDbStore for the mutationQueues object store.
- */ function Pr(t) {
+ */ function br(t) {
     return Ci(t, "documentMutations");
 }
 
 /**
  * Helper to get a typed SimpleDbStore for the mutationQueues object store.
- */ function br(t) {
+ */ function Pr(t) {
     return Ci(t, "mutationQueues");
 }
 
@@ -8468,11 +8468,11 @@ class Vr {
     constructor(t) {
         this.An = t, this.buffer = new ge(Nr), this.Rn = 0;
     }
-    Pn() {
+    bn() {
         return ++this.Rn;
     }
-    bn(t) {
-        const e = [ t, this.Pn() ];
+    Pn(t) {
+        const e = [ t, this.bn() ];
         if (this.buffer.size < this.An) this.buffer = this.buffer.add(e); else {
             const t = this.buffer.last();
             Nr(e, t) < 0 && (this.buffer = this.buffer.delete(t).add(e));
@@ -8512,7 +8512,7 @@ class Vr {
             try {
                 await t.collectGarbage(this.garbageCollector);
             } catch (t) {
-                Pi(t) ? F("LruGarbageCollector", "Ignoring IndexedDB error during garbage collection: ", t) : await xr(t);
+                bi(t) ? F("LruGarbageCollector", "Ignoring IndexedDB error during garbage collection: ", t) : await xr(t);
             }
             await this.Sn(t);
         }));
@@ -8529,7 +8529,7 @@ class Vr {
     nthSequenceNumber(t, e) {
         if (0 === e) return Ii.resolve(st.A);
         const n = new kr(e);
-        return this.Dn.forEachTarget(t, (t => n.bn(t.sequenceNumber))).next((() => this.Dn.xn(t, (t => n.bn(t))))).next((() => n.maxValue));
+        return this.Dn.forEachTarget(t, (t => n.Pn(t.sequenceNumber))).next((() => this.Dn.xn(t, (t => n.Pn(t))))).next((() => n.maxValue));
     }
     removeTargets(t, e, n) {
         return this.Dn.removeTargets(t, e, n);
@@ -8626,7 +8626,7 @@ class Fr {
      */    On(t, e) {
         return function(t, e) {
             let n = !1;
-            return br(t).zt((s => Ar(t, s, e).next((t => (t && (n = !0), Ii.resolve(!t)))))).next((() => n));
+            return Pr(t).zt((s => Ar(t, s, e).next((t => (t && (n = !0), Ii.resolve(!t)))))).next((() => n));
         }(t, e);
     }
     removeOrphanedDocuments(t, e) {
@@ -9537,8 +9537,8 @@ class Jr {
             if (this.isPrimary) return this.Es(t).next((t => {
                 t || (this.isPrimary = !1, this.Yn.enqueueRetryable((() => this.cs(!1))));
             }));
-        })).next((() => this.As(t))).next((e => this.isPrimary && !e ? this.Rs(t).next((() => !1)) : !!e && this.Ps(t).next((() => !0)))))).catch((t => {
-            if (Pi(t)) 
+        })).next((() => this.As(t))).next((e => this.isPrimary && !e ? this.Rs(t).next((() => !1)) : !!e && this.bs(t).next((() => !0)))))).catch((t => {
+            if (bi(t)) 
             // Proceed with the existing state. Any subsequent access to
             // IndexedDB will verify the lease.
             return F("IndexedDbPersistence", "Failed to extend owner lease: ", t), this.isPrimary;
@@ -9550,7 +9550,7 @@ class Jr {
         }));
     }
     Es(t) {
-        return Yr(t).get("owner").next((t => Ii.resolve(this.bs(t))));
+        return Yr(t).get("owner").next((t => Ii.resolve(this.Ps(t))));
     }
     Vs(t) {
         return Xr(t).delete(this.clientId);
@@ -9584,7 +9584,7 @@ class Jr {
      */    Is() {
         this.os = this.Yn.enqueueAfterDelay("client_metadata_refresh" /* ClientMetadataRefresh */ , 4e3, (() => this.gs().then((() => this.vs())).then((() => this.Is()))));
     }
-    /** Checks whether `client` is the local client. */    bs(t) {
+    /** Checks whether `client` is the local client. */    Ps(t) {
         return !!t && t.ownerId === this.clientId;
     }
     /**
@@ -9606,8 +9606,8 @@ class Jr {
             //   the foreground.
             // - the `forceOwningTab` setting was passed in.
             if (null !== e && this.Ss(e.leaseTimestampMs, 5e3) && !this.xs(e.ownerId)) {
-                if (this.bs(e) && this.networkEnabled) return !0;
-                if (!this.bs(e)) {
+                if (this.Ps(e) && this.networkEnabled) return !0;
+                if (!this.Ps(e)) {
                     if (!e.allowTabSynchronization) 
                     // Fail the `canActAsPrimary` check if the current leaseholder has
                     // not opted into multi-tab synchronization. If this happens at
@@ -9698,7 +9698,7 @@ class Jr {
             if (!e) throw $(`Failed to obtain primary lease for action '${t}'.`), this.isPrimary = !1, 
             this.Yn.enqueueRetryable((() => this.cs(!1))), new j(Q.FAILED_PRECONDITION, yi);
             return n(o);
-        })).next((t => this.Ps(o).next((() => t)))) : this.$s(o).next((() => n(o)))))).then((t => (o.raiseOnCommittedEvent(), 
+        })).next((t => this.bs(o).next((() => t)))) : this.$s(o).next((() => n(o)))))).then((t => (o.raiseOnCommittedEvent(), 
         t)));
     }
     /**
@@ -9709,13 +9709,13 @@ class Jr {
     // be turned off.
     $s(t) {
         return Yr(t).get("owner").next((t => {
-            if (null !== t && this.Ss(t.leaseTimestampMs, 5e3) && !this.xs(t.ownerId) && !this.bs(t) && !(this.Zn || this.allowTabSynchronization && t.allowTabSynchronization)) throw new j(Q.FAILED_PRECONDITION, Hr);
+            if (null !== t && this.Ss(t.leaseTimestampMs, 5e3) && !this.xs(t.ownerId) && !this.Ps(t) && !(this.Zn || this.allowTabSynchronization && t.allowTabSynchronization)) throw new j(Q.FAILED_PRECONDITION, Hr);
         }));
     }
     /**
      * Obtains or extends the new primary lease for the local client. This
      * method does not verify that the client is eligible for this lease.
-     */    Ps(t) {
+     */    bs(t) {
         const e = {
             ownerId: this.clientId,
             allowTabSynchronization: this.allowTabSynchronization,
@@ -9728,7 +9728,7 @@ class Jr {
     }
     /** Checks the primary lease and removes it if we are the current primary. */    Rs(t) {
         const e = Yr(t);
-        return e.get("owner").next((t => this.bs(t) ? (F("IndexedDbPersistence", "Releasing primary lease."), 
+        return e.get("owner").next((t => this.Ps(t) ? (F("IndexedDbPersistence", "Releasing primary lease."), 
         e.delete("owner")) : Ii.resolve()));
     }
     /** Verifies that `updateTimeMs` is within `maxAgeMs`. */    Ss(t, e) {
@@ -10462,7 +10462,7 @@ async function fo(t, e, n) {
     try {
         n || await s.persistence.runTransaction("Release target", r, (t => s.persistence.referenceDelegate.removeTarget(t, i)));
     } catch (t) {
-        if (!Pi(t)) throw t;
+        if (!bi(t)) throw t;
         // All `releaseTarget` does is record the final metadata state for the
         // target, but we've been recording this periodically during target
         // activity. If we lose this write this could cause a very slight
@@ -10756,14 +10756,14 @@ async function po(t, e, n = Zn()) {
         const n = new Ao(t, e);
         this.Ti = this.Ti.add(n), this.Ai = this.Ai.add(n);
     }
-    /** Add references to the given document keys for the given ID. */    Pi(t, e) {
+    /** Add references to the given document keys for the given ID. */    bi(t, e) {
         t.forEach((t => this.addReference(t, e)));
     }
     /**
      * Removes a reference to the given document key for the given
      * ID.
      */    removeReference(t, e) {
-        this.bi(new Ao(t, e));
+        this.Pi(new Ao(t, e));
     }
     Vi(t, e) {
         t.forEach((t => this.removeReference(t, e)));
@@ -10774,13 +10774,13 @@ async function po(t, e, n = Zn()) {
      */    vi(t) {
         const e = new kt(new wt([])), n = new Ao(e, t), s = new Ao(e, t + 1), i = [];
         return this.Ai.forEachInRange([ n, s ], (t => {
-            this.bi(t), i.push(t.key);
+            this.Pi(t), i.push(t.key);
         })), i;
     }
     Si() {
-        this.Ti.forEach((t => this.bi(t)));
+        this.Ti.forEach((t => this.Pi(t)));
     }
-    bi(t) {
+    Pi(t) {
         this.Ti = this.Ti.delete(t), this.Ai = this.Ai.delete(t);
     }
     Di(t) {
@@ -10991,7 +10991,7 @@ class Ao {
  * The memory-only RemoteDocumentCache for IndexedDb. To construct, invoke
  * `newMemoryRemoteDocumentCache()`.
  */
-class Po {
+class bo {
     /**
      * @param sizer - Used to assess the size of a document. For eager GC, this is
      * expected to just return 0 to avoid unnecessarily doing the work of
@@ -11062,7 +11062,7 @@ class Po {
     newChangeBuffer(t) {
         // `trackRemovals` is ignores since the MemoryRemoteDocumentCache keeps
         // a separate changelog and does not need special handling for removals.
-        return new bo(this);
+        return new Po(this);
     }
     getSize(t) {
         return Ii.resolve(this.size);
@@ -11079,7 +11079,7 @@ class Po {
 /**
  * Handles the details of adding and updating documents in the MemoryRemoteDocumentCache.
  */
-class bo extends Br {
+class Po extends Br {
     constructor(t) {
         super(), this.Kn = t;
     }
@@ -11178,7 +11178,7 @@ class bo extends Br {
         return Ii.resolve(n);
     }
     addMatchingKeys(t, e, n) {
-        return this.qi.Pi(e, n), Ii.resolve();
+        return this.qi.bi(e, n), Ii.resolve();
     }
     removeMatchingKeys(t, e, n) {
         this.qi.Vi(e, n);
@@ -11230,7 +11230,7 @@ class vo {
         this.Gi = {}, this.overlays = {}, this.es = new st(0), this.ns = !1, this.ns = !0, 
         this.referenceDelegate = t(this), this.fs = new Vo(this);
         this.indexManager = new hr, this.ds = function(t) {
-            return new Po(t);
+            return new bo(t);
         }((t => this.referenceDelegate.Qi(t))), this.M = new Oi(e), this._s = new Io(this.M);
     }
     start() {
@@ -11666,7 +11666,7 @@ class $o {
         this.removeItem(No(this.persistenceKey, t));
     }
     updateQueryState(t, e, n) {
-        this.Pr(t, e, n);
+        this.br(t, e, n);
     }
     handleUserChange(t, e, n) {
         e.forEach((t => {
@@ -11676,7 +11676,7 @@ class $o {
         }));
     }
     setOnlineState(t) {
-        this.br(t);
+        this.Pr(t);
     }
     notifyBundleLoaded(t) {
         this.Vr(t);
@@ -11766,14 +11766,14 @@ class $o {
         const e = xo(this.persistenceKey, this.currentUser, t);
         this.removeItem(e);
     }
-    br(t) {
+    Pr(t) {
         const e = {
             clientId: this.ir,
             onlineState: t
         };
         this.storage.setItem(this.mr, JSON.stringify(e));
     }
-    Pr(t, e, n) {
+    br(t, e, n) {
         const s = No(this.persistenceKey, t), i = new Mo(t, e, n);
         this.setItem(s, i.er());
     }
@@ -12156,7 +12156,7 @@ class {
         }));
     }
     wo(t, e, n) {
-        const s = [ this.uo, "/", "google.firestore.v1.Firestore", "/", t, "/channel" ], i = P(), r = b(), o = {
+        const s = [ this.uo, "/", "google.firestore.v1.Firestore", "/", t, "/channel" ], i = b(), r = P(), o = {
             // Required for backend stickiness, routing behavior is based on this
             // parameter.
             httpSessionIdParam: "gsessionid",
@@ -12414,7 +12414,7 @@ class Ho {
         this.cancel();
         // First schedule using the current base (which may be 0 and should be
         // honored as such).
-        const e = Math.floor(this.Io + this.Po()), n = Math.max(0, Date.now() - this.Eo), s = Math.max(0, e - n);
+        const e = Math.floor(this.Io + this.bo()), n = Math.max(0, Date.now() - this.Eo), s = Math.max(0, e - n);
         // Guard against lastAttemptTime being in the future due to a clock change.
                 s > 0 && F("ExponentialBackoff", `Backing off for ${s} ms (base delay: ${this.Io} ms, delay with jitter: ${e} ms, last attempt: ${n} ms ago)`), 
         this.To = this.Yn.enqueueAfterDelay(this.timerId, s, (() => (this.Eo = Date.now(), 
@@ -12423,13 +12423,13 @@ class Ho {
         // bounds.
         this.Io *= this.yo, this.Io < this.mo && (this.Io = this.mo), this.Io > this.po && (this.Io = this.po);
     }
-    bo() {
+    Po() {
         null !== this.To && (this.To.skipDelay(), this.To = null);
     }
     cancel() {
         null !== this.To && (this.To.cancel(), this.To = null);
     }
-    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */    Po() {
+    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */    bo() {
         return (Math.random() - .5) * this.Io;
     }
 }
@@ -12701,7 +12701,7 @@ class Jo {
         e.database = Rs(this.M), e.addTarget = function(t, e) {
             let n;
             const s = e.target;
-            return n = Pe(s) ? {
+            return n = be(s) ? {
                 documents: Ns(t, s)
             } : {
                 query: ks(t, s)
@@ -13178,7 +13178,7 @@ async function _u(t, e, n) {
  * The returned Promise is resolved once the network is disabled and before
  * any retry attempt.
  */ async function wu(t, e, n) {
-    if (!Pi(e)) throw e;
+    if (!bi(e)) throw e;
     t.wu.add(1 /* IndexedDbFailed */), 
     // Disable network and raise offline snapshots
     await su(t), t.yu.set("Offline" /* Offline */), n || (
@@ -13258,7 +13258,7 @@ async function Ru(t, e, n) {
     await gu(t);
 }
 
-async function Pu(t, e) {
+async function bu(t, e) {
     // If the write stream closed after the write handshake completes, a write
     // operation failed and we fail the pending operation.
     e && Su(t).Xo && 
@@ -13285,7 +13285,7 @@ async function Pu(t, e) {
     Iu(t) && Tu(t);
 }
 
-async function bu(t, e) {
+async function Pu(t, e) {
     const n = G(t);
     n.asyncQueue.verifyOperationInProgress(), F("RemoteStore", "RemoteStore received new credentials");
     const s = hu(n);
@@ -13360,7 +13360,7 @@ async function bu(t, e) {
         return s.iu(), new Xo(e, s.So, s.authCredentials, s.appCheckCredentials, s.M, n);
     }(t.datastore, t.asyncQueue, {
         Xr: Eu.bind(null, t),
-        eo: Pu.bind(null, t),
+        eo: bu.bind(null, t),
         eu: Au.bind(null, t),
         tu: Ru.bind(null, t)
     }), t.mu.push((async e => {
@@ -13459,7 +13459,7 @@ class Du {
  * Returns a FirestoreError that can be surfaced to the user if the provided
  * error is an IndexedDbTransactionError. Re-throws the error otherwise.
  */ function Cu(t, e) {
-    if ($("AsyncQueue", `${e}: ${t}`), Pi(t)) return new j(Q.UNAVAILABLE, `${e}: ${t}`);
+    if ($("AsyncQueue", `${e}: ${t}`), bi(t)) return new j(Q.UNAVAILABLE, `${e}: ${t}`);
     throw t;
 }
 
@@ -13673,7 +13673,7 @@ class ku {
 class Ou {
     constructor() {
         this.queries = new Qn((t => tn(t)), Ze), this.onlineState = "Unknown" /* Unknown */ , 
-        this.Pu = new Set;
+        this.bu = new Set;
     }
 }
 
@@ -13688,7 +13688,7 @@ async function Fu(t, e) {
     }
     if (n.queries.set(s, r), r.listeners.push(e), 
     // Run global snapshot listeners if a consistent snapshot has been emitted.
-    e.bu(n.onlineState), r.Ru) {
+    e.Pu(n.onlineState), r.Ru) {
         e.Vu(r.Ru) && Uu(n);
     }
 }
@@ -13727,7 +13727,7 @@ function Lu(t, e, n) {
 
 // Call all global snapshot listeners that have been set.
 function Uu(t) {
-    t.Pu.forEach((t => {
+    t.bu.forEach((t => {
         t.next();
     }));
 }
@@ -13766,7 +13766,7 @@ function Uu(t) {
     onError(t) {
         this.vu.error(t);
     }
-    /** Returns whether a snapshot was raised. */    bu(t) {
+    /** Returns whether a snapshot was raised. */    Pu(t) {
         this.onlineState = t;
         let e = !1;
         return this.Du && !this.Su && this.xu(this.Du, t) && (this.Nu(this.Du), e = !0), 
@@ -14141,7 +14141,7 @@ class zu {
     /**
      * Applies an OnlineState change to the view, potentially generating a
      * ViewChange if the view's syncState changes as a result.
-     */    bu(t) {
+     */    Pu(t) {
         return this.current && "Offline" /* Offline */ === t ? (
         // If we're offline, set `current` to false and then call applyChanges()
         // to refresh our syncState and generate a ViewChange as appropriate. We
@@ -14415,7 +14415,7 @@ async function Zu(t, e) {
                     // NOTE: The base state should only be applied if there's some
                     // existing document to override, so use a Precondition of
                     // exists=true
-                    o.push(new kn(t.key, e, se(e.value.mapValue), Pn.exists(!0)));
+                    o.push(new kn(t.key, e, se(e.value.mapValue), bn.exists(!0)));
                 }
                 return n.Bs.addMutationBatch(t, s, o, e);
             })))).then((t => (t.applyToLocalDocumentSet(r), {
@@ -14475,7 +14475,7 @@ async function Zu(t, e) {
         if (s.isPrimaryClient && 0 /* RemoteStore */ === n || !s.isPrimaryClient && 1 /* SharedClientState */ === n) {
         const t = [];
         s.ia.forEach(((n, s) => {
-            const i = s.view.bu(e);
+            const i = s.view.Pu(e);
             i.snapshot && t.push(i.snapshot);
         })), function(t, e) {
             const n = G(t);
@@ -14484,7 +14484,7 @@ async function Zu(t, e) {
             n.queries.forEach(((t, n) => {
                 for (const t of n.listeners) 
                 // Run global snapshot listeners if a consistent snapshot has been emitted.
-                t.bu(e) && (s = !0);
+                t.Pu(e) && (s = !0);
             })), s && Uu(n);
         }(s.eventManager, e), t.length && s.sa.zo(t), s.onlineState = e, s.isPrimaryClient && s.sharedClientState.setOnlineState(e);
     }
@@ -14682,7 +14682,7 @@ async function ma(t, e, n) {
         try {
             await n.persistence.runTransaction("notifyLocalViewChanges", "readwrite", (t => Ii.forEach(e, (e => Ii.forEach(e.Hs, (s => n.persistence.referenceDelegate.addReference(t, e.targetId, s))).next((() => Ii.forEach(e.Js, (s => n.persistence.referenceDelegate.removeReference(t, e.targetId, s)))))))));
         } catch (t) {
-            if (!Pi(t)) throw t;
+            if (!bi(t)) throw t;
             // If `notifyLocalViewChanges` fails, we did not advance the sequence
             // number for the documents that were included in this transaction.
             // This might trigger them to be deleted earlier than they otherwise
@@ -14872,14 +14872,14 @@ function Ra(t) {
 
 /** Returns the IDs of the clients that are currently active. */
 // PORTING NOTE: Multi-Tab only.
-function Pa(t) {
+function ba(t) {
     const e = G(t);
     return G(G(e.localStore).persistence).Fs();
 }
 
 /** Applies a query target change from a different tab. */
 // PORTING NOTE: Multi-Tab only.
-async function ba(t, e, n, s) {
+async function Pa(t, e, n, s) {
     const i = G(t);
     if (i.da) 
     // If we receive a target state notification via WebStorage, we are
@@ -15093,9 +15093,9 @@ class Ca {
         const e = this.Ta.syncEngine;
         this.sharedClientState instanceof Bo && (this.sharedClientState.syncEngine = {
             $r: Ta.bind(null, e),
-            Br: ba.bind(null, e),
+            Br: Pa.bind(null, e),
             Lr: Va.bind(null, e),
-            Fs: Pa.bind(null, e),
+            Fs: ba.bind(null, e),
             Fr: Ia.bind(null, e)
         }, await this.sharedClientState.start()), 
         // NOTE: This will immediately call the listener, so we make sure to
@@ -15309,9 +15309,9 @@ class Oa {
          * Internal buffer to hold bundle content, accumulating incomplete element
          * content.
          */
-        this.buffer = new Uint8Array, this.Pa = new TextDecoder("utf-8"), 
+        this.buffer = new Uint8Array, this.ba = new TextDecoder("utf-8"), 
         // Read the metadata (which is the first element).
-        this.ba().then((t => {
+        this.Pa().then((t => {
             t && t.Mu() ? this.metadata.resolve(t.payload.metadata) : this.metadata.reject(new Error(`The first element of the bundle is not a metadata, it is\n             ${JSON.stringify(null == t ? void 0 : t.payload)}`));
         }), (t => this.metadata.reject(t)));
     }
@@ -15323,7 +15323,7 @@ class Oa {
     }
     async ma() {
         // Makes sure metadata is read before proceeding.
-        return await this.getMetadata(), this.ba();
+        return await this.getMetadata(), this.Pa();
     }
     /**
      * Reads from the head of internal buffer, and pulling more data from
@@ -15334,10 +15334,10 @@ class Oa {
      *
      * Returns either the bundled element, or null if we have reached the end of
      * the stream.
-     */    async ba() {
+     */    async Pa() {
         const t = await this.Va();
         if (null === t) return null;
-        const e = this.Pa.decode(t), n = Number(e);
+        const e = this.ba.decode(t), n = Number(e);
         isNaN(n) && this.va(`length string (${e}) is not valid number`);
         const s = await this.Sa(n);
         return new Ku(JSON.parse(s), t.length + n);
@@ -15374,7 +15374,7 @@ class Oa {
         for (;this.buffer.length < t; ) {
             await this.Ca() && this.va("Reached the end of bundle when more is expected.");
         }
-        const e = this.Pa.decode(this.buffer.slice(0, t));
+        const e = this.ba.decode(this.buffer.slice(0, t));
         // Update the internal buffer to drop the read json string.
                 return this.buffer = this.buffer.slice(t), e;
     }
@@ -15503,7 +15503,7 @@ class $a {
      * as a precondition, or no precondition if it was not read.
      */    precondition(t) {
         const e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? Pn.updateTime(e) : Pn.none();
+        return !this.writtenDocs.has(t.toString()) && e ? bn.updateTime(e) : bn.none();
     }
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -15524,11 +15524,11 @@ class $a {
             // transaction.
             throw new j(Q.INVALID_ARGUMENT, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return Pn.updateTime(e);
+                        return bn.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-        return Pn.exists(!0);
+        return bn.exists(!0);
     }
     write(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
@@ -15555,11 +15555,10 @@ class $a {
 /**
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
- */
-class Ba {
-    constructor(t, e, n, s) {
-        this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = s, 
-        this.xa = 5, this.No = new Ho(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+ */ class Ba {
+    constructor(t, e, n, s, i) {
+        this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = s, 
+        this.deferred = i, this.xa = n.maxAttempts, this.No = new Ho(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
         this.xa -= 1, this.Na();
@@ -15705,7 +15704,7 @@ async function qa(t, e) {
     await e.initialize(n, s), 
     // The CredentialChangeListener of the online component provider takes
     // precedence over the offline component provider.
-    t.setCredentialChangeListener((t => bu(e.remoteStore, t))), t.setAppCheckTokenChangeListener(((t, n) => bu(e.remoteStore, n))), 
+    t.setCredentialChangeListener((t => Pu(e.remoteStore, t))), t.setAppCheckTokenChangeListener(((t, n) => Pu(e.remoteStore, n))), 
     t.onlineComponents = e;
 }
 
@@ -15855,13 +15854,13 @@ function ec(t, e, n = {}) {
 function nc(t, e) {
     const n = new Oa(e);
     return t.asyncQueue.enqueueAndForget((async () => function(t, e) {
-        G(t).Pu.add(e), 
+        G(t).bu.add(e), 
         // Immediately fire an initial event, indicating all existing listeners
         // are in-sync.
         e.next();
     }(await Ha(t), n))), () => {
         n.Aa(), t.asyncQueue.enqueueAndForget((async () => function(t, e) {
-            G(t).Pu.delete(e);
+            G(t).bu.delete(e);
         }(await Ha(t), n)));
     };
 }
@@ -15880,14 +15879,14 @@ function nc(t, e) {
  * accessed with the transaction will not reflect local changes that have not
  * been committed. For this reason, it is required that all reads are
  * performed before any writes. Transactions must be performed while online.
- */ function sc(t, e) {
-    const n = new W;
+ */ function sc(t, e, n) {
+    const s = new W;
     return t.asyncQueue.enqueueAndForget((async () => {
-        const s = await function(t) {
+        const i = await function(t) {
             return Ga(t).then((t => t.datastore));
         }(t);
-        new Ba(t.asyncQueue, s, e, n).run();
-    })), n.promise;
+        new Ba(t.asyncQueue, i, n, e, s).run();
+    })), s.promise;
 }
 
 function ic(t, e, n, s) {
@@ -16407,7 +16406,7 @@ function Ec(t, e, ...n) {
  * 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.
- */ class Pc {
+ */ class bc {
     constructor() {
         // The last promise in the queue.
         this.Fa = Promise.resolve(), 
@@ -16436,7 +16435,7 @@ function Ec(t, e, ...n) {
         // after page comes into foreground.
         this.Qa = () => {
             const t = Wo();
-            t && F("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.No.bo();
+            t && F("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.No.Po();
         };
         const t = Wo();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Qa);
@@ -16485,7 +16484,7 @@ function Ec(t, e, ...n) {
             try {
                 await this.$a[0](), this.$a.shift(), this.No.reset();
             } catch (t) {
-                if (!Pi(t)) throw t;
+                if (!bi(t)) throw t;
  // Failure will be handled by AsyncQueue
                                 F("AsyncQueue", "Operation failed with retryable error: " + t);
             }
@@ -16598,7 +16597,7 @@ function Ec(t, e, ...n) {
     }
 }
 
-function bc(t) {
+function Pc(t) {
     /**
  * Returns true if obj is an object and contains at least one of the specified
  * methods.
@@ -16731,7 +16730,7 @@ class Sc extends wc {
         /**
          * Whether it's a {@link Firestore} or Firestore Lite instance.
          */
-        this.type = "firestore", this._queue = new Pc, this._persistenceKey = "name" in t ? t.name : "[DEFAULT]";
+        this.type = "firestore", this._queue = new bc, this._persistenceKey = "name" in t ? t.name : "[DEFAULT]";
     }
     _terminate() {
         return this._firestoreClient || 
@@ -17911,7 +17910,7 @@ function Ih(t, e, n, s, i) {
  */
 /**
  * Metadata about a snapshot, describing the state of the snapshot.
- */ class Ph {
+ */ class bh {
     /** @hideconstructor */
     constructor(t, e) {
         this.hasPendingWrites = t, this.fromCache = e;
@@ -17934,7 +17933,7 @@ function Ih(t, e, n, s, i) {
  * 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.
- */ class bh extends Eh {
+ */ class Ph extends Eh {
     /** @hideconstructor protected */
     constructor(t, e, n, s, i, r) {
         super(t, e, n, s, r), this._firestore = t, this._firestoreImpl = t, this.metadata = i;
@@ -18005,7 +18004,7 @@ function Ih(t, e, n, s, i) {
  * `DocumentSnapshot`. Since query results contain only existing documents, the
  * `exists` property will always be true and `data()` will never return
  * 'undefined'.
- */ class Vh extends bh {
+ */ class Vh extends Ph {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -18033,7 +18032,7 @@ function Ih(t, e, n, s, i) {
  */ class vh {
     /** @hideconstructor */
     constructor(t, e, n, s) {
-        this._firestore = t, this._userDataWriter = e, this._snapshot = s, this.metadata = new Ph(s.hasPendingWrites, s.fromCache), 
+        this._firestore = t, this._userDataWriter = e, this._snapshot = s, this.metadata = new bh(s.hasPendingWrites, s.fromCache), 
         this.query = n;
     }
     /** An array of all the documents in the `QuerySnapshot`. */    get docs() {
@@ -18054,7 +18053,7 @@ function Ih(t, e, n, s, i) {
      * @param thisArg - The `this` binding for the callback.
      */    forEach(t, e) {
         this._snapshot.docs.forEach((n => {
-            t.call(e, new Vh(this._firestore, this._userDataWriter, n.key, n, new Ph(this._snapshot.mutatedKeys.has(n.key), this._snapshot.fromCache), this.query.converter));
+            t.call(e, new Vh(this._firestore, this._userDataWriter, n.key, n, new bh(this._snapshot.mutatedKeys.has(n.key), this._snapshot.fromCache), this.query.converter));
         }));
     }
     /**
@@ -18075,7 +18074,7 @@ function Ih(t, e, n, s, i) {
                 let e = 0;
                 return t._snapshot.docChanges.map((n => ({
                     type: "added",
-                    doc: new Vh(t._firestore, t._userDataWriter, n.doc.key, n.doc, new Ph(t._snapshot.mutatedKeys.has(n.doc.key), t._snapshot.fromCache), t.query.converter),
+                    doc: new Vh(t._firestore, t._userDataWriter, n.doc.key, n.doc, new bh(t._snapshot.mutatedKeys.has(n.doc.key), t._snapshot.fromCache), t.query.converter),
                     oldIndex: -1,
                     newIndex: e++
                 })));
@@ -18085,7 +18084,7 @@ function Ih(t, e, n, s, i) {
                 // to lookup the index of a document.
                 let n = t._snapshot.oldDocs;
                 return t._snapshot.docChanges.filter((t => e || 3 /* Metadata */ !== t.type)).map((e => {
-                    const s = new Vh(t._firestore, t._userDataWriter, e.doc.key, e.doc, new Ph(t._snapshot.mutatedKeys.has(e.doc.key), t._snapshot.fromCache), t.query.converter);
+                    const s = new Vh(t._firestore, t._userDataWriter, e.doc.key, e.doc, new bh(t._snapshot.mutatedKeys.has(e.doc.key), t._snapshot.fromCache), t.query.converter);
                     let i = -1, r = -1;
                     return 0 /* Added */ !== e.type && (i = n.indexOf(e.doc.key), n = n.delete(e.doc.key)), 
                     1 /* Removed */ !== e.type && (n = n.add(e.doc), r = n.indexOf(e.doc.key)), {
@@ -18126,7 +18125,7 @@ function Sh(t) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */ function Dh(t, e) {
-    return t instanceof bh && e instanceof bh ? 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 vh && e instanceof vh && (t._firestore === e._firestore && Rc(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
+    return t instanceof Ph && e instanceof Ph ? 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 vh && e instanceof vh && (t._firestore === e._firestore && Rc(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
 }
 
 /**
@@ -18399,7 +18398,7 @@ function jh(...t) {
         // results.
                 for (const n of Je(t)) if (n.field.isKeyField()) r.push(Gt(e, s.key)); else {
             const t = s.data.field(n.field);
-            if (bt(t)) throw new j(Q.INVALID_ARGUMENT, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+            if (Pt(t)) throw new j(Q.INVALID_ARGUMENT, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
             if (null === t) {
                 const t = n.field.canonicalString();
                 throw new j(Q.INVALID_ARGUMENT, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
@@ -18466,6 +18465,25 @@ function Jh(t, e, n) {
     if (!n.isEqual(e)) throw new j(Q.INVALID_ARGUMENT, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${e.toString()}' and so you must also use '${e.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${n.toString()}' instead.`);
 }
 
+/**
+ * @license
+ * Copyright 2022 Google LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * 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.
+ */ const Yh = {
+    maxAttempts: 5
+};
+
 /**
  * @license
  * Copyright 2020 Google LLC
@@ -18487,7 +18505,8 @@ function Jh(t, e, n) {
  * to the user.
  *
  * @internal
- */ class Yh {
+ */
+class Xh {
     convertValue(t, e = "none") {
         switch (Ft(t)) {
           case 0 /* NullValue */ :
@@ -18509,7 +18528,7 @@ function Jh(t, e, n) {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(Pt(t.bytesValue));
+            return this.convertBytes(bt(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -18591,7 +18610,7 @@ function Jh(t, e, n) {
  * because we want to provide the user with a more specific error message if
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
- */ function Xh(t, e, n) {
+ */ function Zh(t, e, n) {
     let s;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -18600,7 +18619,7 @@ function Jh(t, e, n) {
     s;
 }
 
-class Zh extends Yh {
+class tl extends Xh {
     constructor(t) {
         super(), this.firestore = t;
     }
@@ -18636,7 +18655,7 @@ class Zh extends Yh {
  * 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.
- */ class tl {
+ */ class el {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
@@ -18644,17 +18663,17 @@ class Zh extends Yh {
     }
     set(t, e, n) {
         this._verifyNotCommitted();
-        const s = el(t, this._firestore), i = Xh(s.converter, e, n), r = sh(this._dataReader, "WriteBatch.set", s._key, i, null !== s.converter, n);
-        return this._mutations.push(r.toMutation(s._key, Pn.none())), this;
+        const s = nl(t, this._firestore), i = Zh(s.converter, e, n), r = sh(this._dataReader, "WriteBatch.set", s._key, i, null !== s.converter, n);
+        return this._mutations.push(r.toMutation(s._key, bn.none())), this;
     }
     update(t, e, n, ...s) {
         this._verifyNotCommitted();
-        const i = el(t, this._firestore);
+        const i = nl(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let r;
         return r = "string" == typeof (e = I(e)) || e instanceof Qc ? lh(this._dataReader, "WriteBatch.update", i._key, e, n, s) : hh(this._dataReader, "WriteBatch.update", i._key, e), 
-        this._mutations.push(r.toMutation(i._key, Pn.exists(!0))), this;
+        this._mutations.push(r.toMutation(i._key, bn.exists(!0))), this;
     }
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -18663,8 +18682,8 @@ class Zh extends Yh {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const e = el(t, this._firestore);
-        return this._mutations = this._mutations.concat(new $n(e._key, Pn.none())), this;
+        const e = nl(t, this._firestore);
+        return this._mutations = this._mutations.concat(new $n(e._key, bn.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -18685,7 +18704,7 @@ class Zh extends Yh {
     }
 }
 
-function el(t, e) {
+function nl(t, e) {
     if ((t = I(t)).firestore !== e) throw new j(Q.INVALID_ARGUMENT, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -18743,13 +18762,13 @@ function el(t, e) {
  * @returns A Promise resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */
-function nl(t) {
+function sl(t) {
     t = fc(t, gc);
     const e = fc(t.firestore, Sc);
-    return Za(xc(e), t._key).then((n => ml(e, t, n)));
+    return Za(xc(e), t._key).then((n => gl(e, t, n)));
 }
 
-class sl extends Yh {
+class il extends Xh {
     constructor(t) {
         super(), this.firestore = t;
     }
@@ -18768,10 +18787,10 @@ class sl extends Yh {
  *
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
- */ function il(t) {
+ */ function rl(t) {
     t = fc(t, gc);
-    const e = fc(t.firestore, Sc), n = xc(e), s = new sl(e);
-    return Xa(n, t._key).then((n => new bh(e, s, t._key, n, new Ph(null !== n && n.hasLocalMutations, 
+    const e = fc(t.firestore, Sc), n = xc(e), s = new il(e);
+    return Xa(n, t._key).then((n => new Ph(e, s, t._key, n, new bh(null !== n && n.hasLocalMutations, 
     /* fromCache= */ !0), t.converter)));
 }
 
@@ -18781,12 +18800,12 @@ class sl extends Yh {
  *
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
- */ function rl(t) {
+ */ function ol(t) {
     t = fc(t, gc);
     const e = fc(t.firestore, Sc);
     return Za(xc(e), t._key, {
         source: "server"
-    }).then((n => ml(e, t, n)));
+    }).then((n => gl(e, t, n)));
 }
 
 /**
@@ -18798,9 +18817,9 @@ class sl extends Yh {
  * invoke {@link getDocsFromCache} or {@link getDocsFromServer}.
  *
  * @returns A `Promise` that will be resolved with the results of the query.
- */ function ol(t) {
+ */ function ul(t) {
     t = fc(t, yc);
-    const e = fc(t.firestore, Sc), n = xc(e), s = new sl(e);
+    const e = fc(t.firestore, Sc), n = xc(e), s = new il(e);
     return Ch(t._query), ec(n, t._query).then((n => new vh(e, s, t, n)));
 }
 
@@ -18809,9 +18828,9 @@ class sl extends Yh {
  * Returns an error if the document is not currently cached.
  *
  * @returns A `Promise` that will be resolved with the results of the query.
- */ function ul(t) {
+ */ function al(t) {
     t = fc(t, yc);
-    const e = fc(t.firestore, Sc), n = xc(e), s = new sl(e);
+    const e = fc(t.firestore, Sc), n = xc(e), s = new il(e);
     return tc(n, t._query).then((n => new vh(e, s, t, n)));
 }
 
@@ -18820,21 +18839,21 @@ class sl extends Yh {
  * server. Returns an error if the network is not available.
  *
  * @returns A `Promise` that will be resolved with the results of the query.
- */ function al(t) {
+ */ function cl(t) {
     t = fc(t, yc);
-    const e = fc(t.firestore, Sc), n = xc(e), s = new sl(e);
+    const e = fc(t.firestore, Sc), n = xc(e), s = new il(e);
     return ec(n, t._query, {
         source: "server"
     }).then((n => new vh(e, s, t, n)));
 }
 
-function cl(t, e, n) {
+function hl(t, e, n) {
     t = fc(t, gc);
-    const s = fc(t.firestore, Sc), i = Xh(t.converter, e, n);
-    return wl(s, [ sh(nh(s), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Pn.none()) ]);
+    const s = fc(t.firestore, Sc), i = Zh(t.converter, e, n);
+    return ml(s, [ sh(nh(s), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, bn.none()) ]);
 }
 
-function hl(t, e, n, ...s) {
+function ll(t, e, n, ...s) {
     t = fc(t, gc);
     const i = fc(t.firestore, Sc), r = nh(i);
     let o;
@@ -18842,7 +18861,7 @@ function hl(t, e, n, ...s) {
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
     e = I(e)) || e instanceof Qc ? lh(r, "updateDoc", t._key, e, n, s) : hh(r, "updateDoc", t._key, e);
-    return wl(i, [ o.toMutation(t._key, Pn.exists(!0)) ]);
+    return ml(i, [ o.toMutation(t._key, bn.exists(!0)) ]);
 }
 
 /**
@@ -18851,8 +18870,8 @@ function hl(t, e, n, ...s) {
  * @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 ll(t) {
-    return wl(fc(t.firestore, Sc), [ new $n(t._key, Pn.none()) ]);
+ */ function fl(t) {
+    return ml(fc(t.firestore, Sc), [ new $n(t._key, bn.none()) ]);
 }
 
 /**
@@ -18864,22 +18883,22 @@ function hl(t, e, n, ...s) {
  * @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 fl(t, e) {
-    const n = fc(t.firestore, Sc), s = Ec(t), i = Xh(t.converter, e);
-    return wl(n, [ sh(nh(t.firestore), "addDoc", s._key, i, null !== t.converter, {}).toMutation(s._key, Pn.exists(!1)) ]).then((() => s));
+ */ function dl(t, e) {
+    const n = fc(t.firestore, Sc), s = Ec(t), i = Zh(t.converter, e);
+    return ml(n, [ sh(nh(t.firestore), "addDoc", s._key, i, null !== t.converter, {}).toMutation(s._key, bn.exists(!1)) ]).then((() => s));
 }
 
-function dl(t, ...e) {
+function _l(t, ...e) {
     var n, s, i;
     t = I(t);
     let r = {
         includeMetadataChanges: !1
     }, o = 0;
-    "object" != typeof e[o] || bc(e[o]) || (r = e[o], o++);
+    "object" != typeof e[o] || Pc(e[o]) || (r = e[o], o++);
     const u = {
         includeMetadataChanges: r.includeMetadataChanges
     };
-    if (bc(e[o])) {
+    if (Pc(e[o])) {
         const t = e[o];
         e[o] = null === (n = t.next) || void 0 === n ? void 0 : n.bind(t), e[o + 1] = null === (s = t.error) || void 0 === s ? void 0 : s.bind(t), 
         e[o + 2] = null === (i = t.complete) || void 0 === i ? void 0 : i.bind(t);
@@ -18887,14 +18906,14 @@ function dl(t, ...e) {
     let a, c, h;
     if (t instanceof gc) c = fc(t.firestore, Sc), h = Qe(t._key.path), a = {
         next: n => {
-            e[o] && e[o](ml(c, t, n));
+            e[o] && e[o](gl(c, t, n));
         },
         error: e[o + 1],
         complete: e[o + 2]
     }; else {
         const n = fc(t, yc);
         c = fc(n.firestore, Sc), h = n._query;
-        const s = new sl(c);
+        const s = new il(c);
         a = {
             next: t => {
                 e[o] && e[o](new vh(c, s, n, t));
@@ -18911,8 +18930,8 @@ function dl(t, ...e) {
     }(xc(c), h, u, a);
 }
 
-function _l(t, e) {
-    return nc(xc(t = fc(t, Sc)), bc(e) ? e : {
+function wl(t, e) {
+    return nc(xc(t = fc(t, Sc)), Pc(e) ? e : {
         next: e
     });
 }
@@ -18920,7 +18939,7 @@ function _l(t, e) {
 /**
  * Locally writes `mutations` on the async queue.
  * @internal
- */ function wl(t, e) {
+ */ function ml(t, e) {
     return function(t, e) {
         const n = new W;
         return t.asyncQueue.enqueueAndForget((async () => na(await za(t), e, n))), n.promise;
@@ -18930,9 +18949,9 @@ function _l(t, e) {
 /**
  * Converts a {@link ViewSnapshot} that contains the single document specified by `ref`
  * to a {@link DocumentSnapshot}.
- */ function ml(t, e, n) {
-    const s = n.docs.get(e._key), i = new sl(t);
-    return new bh(t, i, e._key, s, new Ph(n.hasPendingWrites, n.fromCache), e.converter);
+ */ function gl(t, e, n) {
+    const s = n.docs.get(e._key), i = new il(t);
+    return new Ph(t, i, e._key, s, new bh(n.hasPendingWrites, n.fromCache), e.converter);
 }
 
 /**
@@ -18957,7 +18976,7 @@ function _l(t, e) {
  * The `Transaction` object passed to a transaction's `updateFunction` provides
  * the methods to read and write data within the transaction context. See
  * {@link runTransaction}.
- */ class gl extends class {
+ */ class yl extends class {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._transaction = e, this._dataReader = nh(t);
@@ -18968,7 +18987,7 @@ function _l(t, e) {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const e = el(t, this._firestore), n = new Zh(this._firestore);
+        const e = nl(t, this._firestore), n = new tl(this._firestore);
         return this._transaction.lookup([ e._key ]).then((t => {
             if (!t || 1 !== t.length) return U();
             const s = t[0];
@@ -18978,11 +18997,11 @@ function _l(t, e) {
         }));
     }
     set(t, e, n) {
-        const s = el(t, this._firestore), i = Xh(s.converter, e, n), r = sh(this._dataReader, "Transaction.set", s._key, i, null !== s.converter, n);
+        const s = nl(t, this._firestore), i = Zh(s.converter, e, n), r = sh(this._dataReader, "Transaction.set", s._key, i, null !== s.converter, n);
         return this._transaction.set(s._key, r), this;
     }
     update(t, e, n, ...s) {
-        const i = el(t, this._firestore);
+        const i = nl(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let r;
@@ -18995,7 +19014,7 @@ function _l(t, e) {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const e = el(t, this._firestore);
+        const e = nl(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }
 } {
@@ -19011,8 +19030,8 @@ function _l(t, e) {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const e = el(t, this._firestore), n = new sl(this._firestore);
-        return super.get(t).then((t => new bh(this._firestore, n, e._key, t._document, new Ph(
+        const e = nl(t, this._firestore), n = new il(this._firestore);
+        return super.get(t).then((t => new Ph(this._firestore, n, e._key, t._document, new bh(
         /* hasPendingWrites= */ !1, 
         /* fromCache= */ !1), e.converter)));
     }
@@ -19034,8 +19053,13 @@ function _l(t, e) {
  * (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 yl(t, e) {
-    return sc(xc(t = fc(t, Sc)), (n => e(new gl(t, n))));
+ */ function pl(t, e, n) {
+    t = fc(t, Sc);
+    const s = Object.assign(Object.assign({}, Yh), n);
+    !function(t) {
+        if (t.maxAttempts < 1) throw new j(Q.INVALID_ARGUMENT, "Max attempts must be at least 1");
+    }(s);
+    return sc(xc(t), (n => e(new yl(t, n))), s);
 }
 
 /**
@@ -19057,14 +19081,14 @@ function _l(t, e) {
 /**
  * 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 pl() {
+ */ function Il() {
     return new ih("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 Il() {
+ */ function Tl() {
     return new oh("serverTimestamp");
 }
 
@@ -19079,7 +19103,7 @@ function _l(t, e) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function Tl(...t) {
+ */ function El(...t) {
     // 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 uh("arrayUnion", t);
@@ -19095,7 +19119,7 @@ function _l(t, e) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function El(...t) {
+ */ function Al(...t) {
     // 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("arrayRemove", t);
@@ -19119,7 +19143,7 @@ function _l(t, e) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Al(t) {
+ */ function Rl(t) {
     return new ch("increment", t);
 }
 
@@ -19149,8 +19173,8 @@ function _l(t, e) {
  *
  * @returns A {@link WriteBatch} that can be used to atomically execute multiple
  * writes.
- */ function Rl(t) {
-    return xc(t = fc(t, Sc)), new tl(t, (e => wl(t, e)));
+ */ function bl(t) {
+    return xc(t = fc(t, Sc)), new el(t, (e => ml(t, e)));
 }
 
 /**
@@ -19180,9 +19204,9 @@ function _l(t, e) {
     // PORTING NOTE: We don't return an error if the user has not enabled
     // persistence since `enableIndexeddbPersistence()` can fail on the Web.
     if (Array.isArray(n.indexes)) for (const t of n.indexes) {
-        const e = bl(t, "collectionGroup"), n = [];
+        const e = Vl(t, "collectionGroup"), n = [];
         if (Array.isArray(t.fields)) for (const e of t.fields) {
-            const t = ph("setIndexConfiguration", bl(e, "fieldPath"));
+            const t = ph("setIndexConfiguration", Vl(e, "fieldPath"));
             "CONTAINS" === e.arrayConfig ? n.push(new ae(t, 2 /* CONTAINS */)) : "ASCENDING" === e.order ? n.push(new ae(t, 0 /* ASCENDING */)) : "DESCENDING" === e.order && n.push(new ae(t, 1 /* DESCENDING */));
         }
         s.push(new re(re.UNKNOWN_ID, e, n, ce.empty()));
@@ -19191,7 +19215,7 @@ function _l(t, e) {
         return Promise.resolve();
 }
 
-function bl(t, e) {
+function Vl(t, e) {
     if ("string" != typeof t[e]) throw new j(Q.INVALID_ARGUMENT, "Missing string value for: " + e);
     return t[e];
 }
@@ -19219,10 +19243,10 @@ function bl(t, e) {
         return n = Object.assign({
             useFetchStreams: e
         }, n), i._setSettings(n), i;
-    }), "PUBLIC")), s(C, "3.4.8-canary.69baecadd", t), 
+    }), "PUBLIC")), s(C, "3.4.8-canary.6ceff4db0", t), 
     // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-    s(C, "3.4.8-canary.69baecadd", "esm2017");
+    s(C, "3.4.8-canary.6ceff4db0", "esm2017");
 }("rn", /* useFetchStreams= */ !1);
 
-export { Yh as AbstractUserDataWriter, Wc as Bytes, vc as CACHE_SIZE_UNLIMITED, pc as CollectionReference, gc as DocumentReference, bh as DocumentSnapshot, Qc as FieldPath, zc as FieldValue, Sc as Firestore, j as FirestoreError, Hc as GeoPoint, Vc as LoadBundleTask, yc as Query, xh as QueryConstraint, Vh as QueryDocumentSnapshot, vh as QuerySnapshot, Ph as SnapshotMetadata, ct as Timestamp, gl as Transaction, tl as WriteBatch, Dt as _DatabaseId, kt as _DocumentKey, nt as _EmptyAppCheckTokenProvider, H as _EmptyAuthCredentialsProvider, gt as _FieldPath, fc as _cast, K as _debugAssert, It as _isBase64Available, B as _logWarn, Pl as _setIndexConfiguration, ac as _validateIsNotUsedTogether, fl as addDoc, El as arrayRemove, Tl as arrayUnion, Fc as clearIndexedDbPersistence, Ic as collection, Tc as collectionGroup, mc as connectFirestoreEmulator, ll as deleteDoc, pl as deleteField, Lc as disableNetwork, Ec as doc, jc as documentId, kc as enableIndexedDbPersistence, Mc as enableMultiTabIndexedDbPersistence, Bc as enableNetwork, jh as endAt, Qh as endBefore, xc as ensureFirestoreConfigured, wl as executeWrite, nl as getDoc, il as getDocFromCache, rl as getDocFromServer, ol as getDocs, ul as getDocsFromCache, al as getDocsFromServer, Cc as getFirestore, Al as increment, Dc as initializeFirestore, Bh as limit, Lh as limitToLast, qc as loadBundle, Kc as namedQuery, dl as onSnapshot, _l as onSnapshotsInSync, Fh as orderBy, Nh as query, Rc as queryEqual, Ac as refEqual, yl as runTransaction, Il as serverTimestamp, cl as setDoc, O as setLogLevel, Dh as snapshotEqual, Kh as startAfter, qh as startAt, Uc as terminate, hl as updateDoc, $c as waitForPendingWrites, Mh as where, Rl as writeBatch };
+export { Xh as AbstractUserDataWriter, Wc as Bytes, vc as CACHE_SIZE_UNLIMITED, pc as CollectionReference, gc as DocumentReference, Ph as DocumentSnapshot, Qc as FieldPath, zc as FieldValue, Sc as Firestore, j as FirestoreError, Hc as GeoPoint, Vc as LoadBundleTask, yc as Query, xh as QueryConstraint, Vh as QueryDocumentSnapshot, vh as QuerySnapshot, bh as SnapshotMetadata, ct as Timestamp, yl as Transaction, el as WriteBatch, Dt as _DatabaseId, kt as _DocumentKey, nt as _EmptyAppCheckTokenProvider, H as _EmptyAuthCredentialsProvider, gt as _FieldPath, fc as _cast, K as _debugAssert, It as _isBase64Available, B as _logWarn, Pl as _setIndexConfiguration, ac as _validateIsNotUsedTogether, dl as addDoc, Al as arrayRemove, El as arrayUnion, Fc as clearIndexedDbPersistence, Ic as collection, Tc as collectionGroup, mc as connectFirestoreEmulator, fl as deleteDoc, Il as deleteField, Lc as disableNetwork, Ec as doc, jc as documentId, kc as enableIndexedDbPersistence, Mc as enableMultiTabIndexedDbPersistence, Bc as enableNetwork, jh as endAt, Qh as endBefore, xc as ensureFirestoreConfigured, ml as executeWrite, sl as getDoc, rl as getDocFromCache, ol as getDocFromServer, ul as getDocs, al as getDocsFromCache, cl as getDocsFromServer, Cc as getFirestore, Rl as increment, Dc as initializeFirestore, Bh as limit, Lh as limitToLast, qc as loadBundle, Kc as namedQuery, _l as onSnapshot, wl as onSnapshotsInSync, Fh as orderBy, Nh as query, Rc as queryEqual, Ac as refEqual, pl as runTransaction, Tl as serverTimestamp, hl as setDoc, O as setLogLevel, Dh as snapshotEqual, Kh as startAfter, qh as startAt, Uc as terminate, ll as updateDoc, $c as waitForPendingWrites, Mh as where, bl as writeBatch };
 //# sourceMappingURL=index.rn.js.map