@firebase/firestore 3.4.7-canary.e9e5f6b3c → 3.4.8

package/dist/index.esm2017.js

@@ -66,7 +66,7 @@ C.MOCK_USER = new C("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let x = "9.6.10-canary.e9e5f6b3c";
+let x = "9.6.11";
 
 /**
  * @license
@@ -1421,14 +1421,14 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * Preserving the previous values allows the user to display the last resoled
  * value until the backend responds with the timestamp.
  */
-function bt(t) {
+function Pt(t) {
     const e = t.mapValue.fields.__previous_value__;
-    return Rt(e) ? bt(e) : e;
+    return Rt(e) ? Pt(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Pt(t) {
+ */ function bt(t) {
     const e = Tt(t.mapValue.fields.__local_write_time__.timestampValue);
     return new at(e.seconds, e.nanos);
 }
@@ -1639,7 +1639,7 @@ function Mt(t) {
         return t.booleanValue === e.booleanValue;
 
       case 4 /* ServerTimestampValue */ :
-        return Pt(t).isEqual(Pt(e));
+        return bt(t).isEqual(bt(e));
 
       case 3 /* TimestampValue */ :
         return function(t, e) {
@@ -1721,7 +1721,7 @@ function $t(t, e) {
         return Bt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return Bt(Pt(t), Pt(e));
+        return Bt(bt(t), bt(e));
 
       case 5 /* StringValue */ :
         return rt(t.stringValue, e.stringValue);
@@ -2499,7 +2499,7 @@ class Te extends class {} {
     /**
      * Creates a filter based on the provided arguments.
      */    static create(t, e, n) {
-        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, n) : new Ee(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Pe(t, n) : "in" /* IN */ === e ? new Ve(t, n) : "not-in" /* NOT_IN */ === e ? new ve(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new Se(t, n) : new Te(t, e, n);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, n) : new Ee(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new be(t, n) : "in" /* IN */ === e ? new Ve(t, n) : "not-in" /* NOT_IN */ === e ? new ve(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new Se(t, n) : new Te(t, e, n);
     }
     static V(t, e, n) {
         return "in" /* IN */ === e ? new Ae(t, n) : new Re(t, n);
@@ -2551,7 +2551,7 @@ class Ee extends Te {
 
 /** Filter that matches on key fields within an array. */ class Ae extends Te {
     constructor(t, e) {
-        super(t, "in" /* IN */ , e), this.keys = be("in" /* IN */ , e);
+        super(t, "in" /* IN */ , e), this.keys = Pe("in" /* IN */ , e);
     }
     matches(t) {
         return this.keys.some((e => e.isEqual(t.key)));
@@ -2560,19 +2560,19 @@ class Ee extends Te {
 
 /** Filter that matches on key fields not present within an array. */ class Re extends Te {
     constructor(t, e) {
-        super(t, "not-in" /* NOT_IN */ , e), this.keys = be("not-in" /* NOT_IN */ , e);
+        super(t, "not-in" /* NOT_IN */ , e), this.keys = Pe("not-in" /* NOT_IN */ , e);
     }
     matches(t) {
         return !this.keys.some((e => e.isEqual(t.key)));
     }
 }
 
-function be(t, e) {
+function Pe(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => xt.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class Pe extends Te {
+/** A Filter that implements the array-contains operator. */ class be extends Te {
     constructor(t, e) {
         super(t, "array-contains" /* ARRAY_CONTAINS */ , e);
     }
@@ -3244,7 +3244,7 @@ class gn {
  *     of the document.
  * @param mutationResult - The result of applying the mutation from the backend.
  */ function Tn(t, e, n) {
-    t instanceof Pn ? function(t, e, n) {
+    t instanceof bn ? function(t, e, n) {
         // Unlike setMutationApplyToLocalView, if we're applying a mutation to a
         // remote document the server has accepted the mutation so the precondition
         // must have held.
@@ -3279,13 +3279,13 @@ class gn {
  * @param localWriteTime - A timestamp indicating the local write time of the
  *     batch this mutation is a part of.
  */ function En(t, e, n) {
-    t instanceof Pn ? function(t, e, n) {
+    t instanceof bn ? function(t, e, n) {
         if (!pn(t.precondition, e)) 
         // The mutation failed to apply (e.g. a document ID created with add()
         // caused a name collision).
         return;
         const s = t.value.clone(), i = Dn(t.fieldTransforms, n, e);
-        s.setAll(i), e.convertToFoundDocument(bn(e), s).setHasLocalMutations();
+        s.setAll(i), e.convertToFoundDocument(Pn(e), s).setHasLocalMutations();
     }
     /**
  * A mutation that modifies fields of the document at the given key with the
@@ -3302,7 +3302,7 @@ class gn {
  */ (t, e, n) : t instanceof Vn ? function(t, e, n) {
         if (!pn(t.precondition, e)) return;
         const s = Dn(t.fieldTransforms, n, e), i = e.data;
-        i.setAll(vn(t)), i.setAll(s), e.convertToFoundDocument(bn(e), i).setHasLocalMutations();
+        i.setAll(vn(t)), i.setAll(s), e.convertToFoundDocument(Pn(e), i).setHasLocalMutations();
     }
     /**
  * Returns a FieldPath/Value map with the content of the PatchMutation.
@@ -3356,14 +3356,14 @@ function Rn(t, e) {
  * mutation. Mutations are defined to return the version of the base document
  * only if it is an existing document. Deleted and unknown documents have a
  * post-mutation version of SnapshotVersion.min().
- */ function bn(t) {
+ */ function Pn(t) {
     return t.isFoundDocument() ? t.version : ct.min();
 }
 
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class Pn extends In {
+ */ class bn extends In {
     constructor(t, e, n, s = []) {
         super(), this.key = t, this.value = e, this.precondition = n, this.fieldTransforms = s, 
         this.type = 0 /* Set */;
@@ -4857,14 +4857,14 @@ function Rs(t) {
     return U(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: ps(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function Ps(t, e, n) {
+function bs(t, e, n) {
     const s = Is(t, e.name), i = ms(e.updateTime), r = new te({
         mapValue: {
             fields: e.fields
@@ -4950,12 +4950,12 @@ function vs(t, e) {
 
 function Ss(t, e) {
     let n;
-    if (e instanceof Pn) n = {
-        update: bs(t, e.key, e.value)
+    if (e instanceof bn) n = {
+        update: Ps(t, e.key, e.value)
     }; else if (e instanceof Cn) n = {
         delete: ps(t, e.key)
     }; else if (e instanceof Vn) n = {
-        update: bs(t, e.key, e.data),
+        update: Ps(t, e.key, e.data),
         updateMask: Ks(e.fieldMask)
     }; else {
         if (!(e instanceof xn)) return L();
@@ -5024,7 +5024,7 @@ function Ds(t, e) {
             }(e.updateMask);
             return new Vn(i, r, t, n, s);
         }
-        return new Pn(i, r, n, s);
+        return new bn(i, r, n, s);
     }
     if (e.delete) {
         const s = Is(t, e.delete);
@@ -5687,7 +5687,7 @@ class Ii {
         t && this.At.reject(t), this.aborted || (O("SimpleDb", "Aborting transaction:", t ? t.message : "Client-initiated abort"), 
         this.aborted = !0, this.transaction.abort());
     }
-    bt() {
+    Pt() {
         // 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
@@ -5704,7 +5704,7 @@ class Ii {
      * 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);
     }
 }
 
@@ -5725,7 +5725,7 @@ class Ii {
      * objectstores.
      */
     constructor(t, e, n) {
-        this.name = t, this.version = e, this.Pt = n;
+        this.name = t, this.version = e, this.bt = 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
@@ -5733,7 +5733,7 @@ class Ii {
         12.2 === Ti.Vt(getUA()) && F("Firestore persistence suffers from a bug in iOS 12.2 Safari that may cause your app to stop working. See https://stackoverflow.com/q/56496296/110915 for details and a potential workaround.");
     }
     /** Deletes the specified database. */    static delete(t) {
-        return O("SimpleDb", "Removing database:", t), Pi(window.indexedDB.deleteDatabase(t)).toPromise();
+        return O("SimpleDb", "Removing database:", t), bi(window.indexedDB.deleteDatabase(t)).toPromise();
     }
     /** Returns true if IndexedDB is available in the current environment. */    static vt() {
         if (!isIndexedDBAvailable()) return !1;
@@ -5799,7 +5799,7 @@ class Ii {
             }, s.onupgradeneeded = t => {
                 O("SimpleDb", 'Database "' + this.name + '" requires upgrade from version:', t.oldVersion);
                 const e = t.target.result;
-                this.Pt.kt(e, s.transaction, t.oldVersion, this.version).next((() => {
+                this.bt.kt(e, s.transaction, t.oldVersion, this.version).next((() => {
                     O("SimpleDb", "Database upgrade to version " + this.version + " complete");
                 }));
             };
@@ -5815,7 +5815,7 @@ class Ii {
             ++r;
             try {
                 this.db = await this.Nt(t);
-                const e = Ii.open(this.db, t, i ? "readonly" : "readwrite", n), r = s(e).next((t => (e.bt(), 
+                const e = Ii.open(this.db, t, i ? "readonly" : "readwrite", n), r = s(e).next((t => (e.Pt(), 
                 t))).catch((t => (
                 // Abort the transaction if there was an error.
                 e.abort(t), pi.reject(t)))).toPromise();
@@ -5876,7 +5876,7 @@ class Ii {
      *
      * NOTE: You CANNOT do this with a keysOnly query.
      */    delete() {
-        return Pi(this.Ft.delete());
+        return bi(this.Ft.delete());
     }
 }
 
@@ -5901,14 +5901,14 @@ class Ii {
  * 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;
     }
     put(t, e) {
         let n;
         return void 0 !== e ? (O("SimpleDb", "PUT", this.store.name, t, e), n = this.store.put(e, t)) : (O("SimpleDb", "PUT", this.store.name, "<auto-key>", t), 
-        n = this.store.put(t)), Pi(n);
+        n = this.store.put(t)), bi(n);
     }
     /**
      * Adds a new value into an Object Store and returns the new key. Similar to
@@ -5918,7 +5918,7 @@ class Ii {
      * @returns The key of the value to add.
      */    add(t) {
         O("SimpleDb", "ADD", this.store.name, t, t);
-        return Pi(this.store.add(t));
+        return bi(this.store.add(t));
     }
     /**
      * Gets the object with the specified key from the specified store, or null
@@ -5929,13 +5929,13 @@ class Ii {
      */    get(t) {
         // We're doing an unsafe cast to ValueType.
         // eslint-disable-next-line @typescript-eslint/no-explicit-any
-        return Pi(this.store.get(t)).next((e => (
+        return bi(this.store.get(t)).next((e => (
         // Normalize nonexistence to null.
         void 0 === e && (e = null), O("SimpleDb", "GET", this.store.name, t, e), e)));
     }
     delete(t) {
         O("SimpleDb", "DELETE", this.store.name, t);
-        return Pi(this.store.delete(t));
+        return bi(this.store.delete(t));
     }
     /**
      * If we ever need more of the count variants, we can add overloads. For now,
@@ -5944,7 +5944,7 @@ class Ii {
      * Returns the number of rows in the store.
      */    count() {
         O("SimpleDb", "COUNT", this.store.name);
-        return Pi(this.store.count());
+        return bi(this.store.count());
     }
     qt(t, e) {
         const n = this.options(t, e);
@@ -6051,7 +6051,7 @@ class Ii {
 /**
  * Wraps an IDBRequest in a PersistencePromise, using the onsuccess / onerror
  * handlers to resolve / reject the PersistencePromise as appropriate.
- */ function Pi(t) {
+ */ function bi(t) {
     return new pi(((e, n) => {
         t.onsuccess = t => {
             const n = t.target.result;
@@ -6341,7 +6341,7 @@ function Di(t, e) {
 
 /** Decodes a remote document from storage locally to a Document. */ function Oi(t, e) {
     let n;
-    if (e.document) n = Ps(t.Jt, e.document, !!e.hasCommittedMutations); else if (e.noDocument) {
+    if (e.document) n = bs(t.Jt, e.document, !!e.hasCommittedMutations); else if (e.noDocument) {
         const t = xt.fromSegments(e.noDocument.path), s = Li(e.noDocument.readTime);
         n = ne.newNoDocument(t, s), e.hasCommittedMutations && n.setHasCommittedMutations();
     } else {
@@ -6842,8 +6842,8 @@ function tr(t) {
     /**
      * Writes the "infinity" byte sequence that sorts after all other byte
      * sequences written in ascending order.
-     */    be() {
-        this.Pe(255), this.Pe(255);
+     */    Pe() {
+        this.be(255), this.be(255);
     }
     /**
      * Writes the "infinity" byte sequence that sorts before all other byte
@@ -6885,19 +6885,19 @@ function tr(t) {
     }
     /** Writes a single byte ascending to the buffer. */    _e(t) {
         const e = 255 & t;
-        0 === e ? (this.Pe(0), this.Pe(255)) : 255 === e ? (this.Pe(255), this.Pe(0)) : this.Pe(e);
+        0 === e ? (this.be(0), this.be(255)) : 255 === e ? (this.be(255), this.be(0)) : this.be(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.Pe(0), this.Pe(1);
+        this.be(0), this.be(1);
     }
     ye() {
         this.ve(0), this.ve(1);
     }
-    Pe(t) {
+    be(t) {
         this.Ae(1), this.buffer[this.position++] = t;
     }
     ve(t) {
@@ -6931,7 +6931,7 @@ class nr {
         this.De.Te(t);
     }
     ee() {
-        this.De.be();
+        this.De.Pe();
     }
 }
 
@@ -8045,7 +8045,7 @@ class Tr {
     // 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: ""
@@ -8084,7 +8084,7 @@ function Ar(t) {
 
 /**
  * Helper to get a typed SimpleDbStore for the mutationQueues object store.
- */ function br(t) {
+ */ function Pr(t) {
     return Di(t, "mutationQueues");
 }
 
@@ -8119,7 +8119,7 @@ function Ar(t) {
  * generate in-memory target IDs that are transient and can be reused after a
  * restart.
  */
-class Pr {
+class br {
     constructor(t) {
         this.mn = t;
     }
@@ -8131,11 +8131,11 @@ class Pr {
         // as there is no differentiation in the protocol layer between an unset
         // number and the number '0'. If we were to sent a target with target ID
         // '0', the backend would consider it unset and replace it with its own ID.
-        return new Pr(0);
+        return new br(0);
     }
     static yn() {
         // Sync engine assigns target IDs for limbo document detection.
-        return new Pr(-1);
+        return new br(-1);
     }
 }
 
@@ -8166,7 +8166,7 @@ class Pr {
     // out to have a meaningful performance impact.
     allocateTargetId(t) {
         return this.pn(t).next((e => {
-            const n = new Pr(e.highestTargetId);
+            const n = new br(e.highestTargetId);
             return e.highestTargetId = n.next(), this.In(t, e).next((() => e.highestTargetId));
         }));
     }
@@ -8394,11 +8394,11 @@ class Pr {
     constructor(t) {
         this.An = t, this.buffer = new qn(xr), this.Rn = 0;
     }
-    bn() {
+    Pn() {
         return ++this.Rn;
     }
-    Pn(t) {
-        const e = [ t, this.bn() ];
+    bn(t) {
+        const e = [ t, this.Pn() ];
         if (this.buffer.size < this.An) this.buffer = this.buffer.add(e); else {
             const t = this.buffer.last();
             xr(e, t) < 0 && (this.buffer = this.buffer.delete(t).add(e));
@@ -8455,7 +8455,7 @@ class Pr {
     nthSequenceNumber(t, e) {
         if (0 === e) return pi.resolve(nt.A);
         const n = new Nr(e);
-        return this.Dn.forEachTarget(t, (t => n.Pn(t.sequenceNumber))).next((() => this.Dn.xn(t, (t => n.Pn(t))))).next((() => n.maxValue));
+        return this.Dn.forEachTarget(t, (t => n.bn(t.sequenceNumber))).next((() => this.Dn.xn(t, (t => n.bn(t))))).next((() => n.maxValue));
     }
     removeTargets(t, e, n) {
         return this.Dn.removeTargets(t, e, n);
@@ -8552,7 +8552,7 @@ class Or {
      */    On(t, e) {
         return function(t, e) {
             let n = !1;
-            return br(t).zt((s => Er(t, s, e).next((t => (t && (n = !0), pi.resolve(!t)))))).next((() => n));
+            return Pr(t).zt((s => Er(t, s, e).next((t => (t && (n = !0), pi.resolve(!t)))))).next((() => n));
         }(t, e);
     }
     removeOrphanedDocuments(t, e) {
@@ -8998,11 +8998,18 @@ function Gr(t, e) {
 
 /**
  * Comparator that compares document keys according to the primary key sorting
- * used by the `DbRemoteDocumentDocument` store (by collection path and then
- * document ID).
+ * used by the `DbRemoteDocumentDocument` store (by prefix path, collection id
+ * and then document ID).
+ *
+ * Visible for testing.
  */ function Qr(t, e) {
-    const n = t.path.length - e.path.length;
-    return 0 !== n ? n : xt.comparator(t, e);
+    const n = t.path.toArray(), s = e.path.toArray();
+    // The ordering is based on https://chromium.googlesource.com/chromium/blink/+/fe5c21fef94dae71c1c3344775b8d8a7f7e6d9ec/Source/modules/indexeddb/IDBKey.cpp#74
+    let i = 0;
+    for (let t = 0; t < n.length - 2 && t < s.length - 2; ++t) if (i = rt(n[t], s[t]), 
+    i) return i;
+    return i = rt(n.length, s.length), i || (i = rt(n[n.length - 2], s[s.length - 2]), 
+    i || rt(n[n.length - 1], s[s.length - 1]));
 }
 
 /**
@@ -9456,7 +9463,7 @@ class Hr {
             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.bs(t).next((() => !0)))))).catch((t => {
+        })).next((() => this.As(t))).next((e => this.isPrimary && !e ? this.Rs(t).next((() => !1)) : !!e && this.Ps(t).next((() => !0)))))).catch((t => {
             if (Ri(t)) 
             // Proceed with the existing state. Any subsequent access to
             // IndexedDB will verify the lease.
@@ -9469,7 +9476,7 @@ class Hr {
         }));
     }
     Es(t) {
-        return Jr(t).get("owner").next((t => pi.resolve(this.Ps(t))));
+        return Jr(t).get("owner").next((t => pi.resolve(this.bs(t))));
     }
     Vs(t) {
         return Yr(t).delete(this.clientId);
@@ -9503,7 +9510,7 @@ class Hr {
      */    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. */    Ps(t) {
+    /** Checks whether `client` is the local client. */    bs(t) {
         return !!t && t.ownerId === this.clientId;
     }
     /**
@@ -9525,8 +9532,8 @@ class Hr {
             //   the foreground.
             // - the `forceOwningTab` setting was passed in.
             if (null !== e && this.Ss(e.leaseTimestampMs, 5e3) && !this.xs(e.ownerId)) {
-                if (this.Ps(e) && this.networkEnabled) return !0;
-                if (!this.Ps(e)) {
+                if (this.bs(e) && this.networkEnabled) return !0;
+                if (!this.bs(e)) {
                     if (!e.allowTabSynchronization) 
                     // Fail the `canActAsPrimary` check if the current leaseholder has
                     // not opted into multi-tab synchronization. If this happens at
@@ -9617,7 +9624,7 @@ class Hr {
             if (!e) throw F(`Failed to obtain primary lease for action '${t}'.`), this.isPrimary = !1, 
             this.Yn.enqueueRetryable((() => this.cs(!1))), new Q(G.FAILED_PRECONDITION, gi);
             return n(o);
-        })).next((t => this.bs(o).next((() => t)))) : this.$s(o).next((() => n(o)))))).then((t => (o.raiseOnCommittedEvent(), 
+        })).next((t => this.Ps(o).next((() => t)))) : this.$s(o).next((() => n(o)))))).then((t => (o.raiseOnCommittedEvent(), 
         t)));
     }
     /**
@@ -9628,13 +9635,13 @@ class Hr {
     // be turned off.
     $s(t) {
         return Jr(t).get("owner").next((t => {
-            if (null !== t && this.Ss(t.leaseTimestampMs, 5e3) && !this.xs(t.ownerId) && !this.Ps(t) && !(this.Zn || this.allowTabSynchronization && t.allowTabSynchronization)) throw new Q(G.FAILED_PRECONDITION, zr);
+            if (null !== t && this.Ss(t.leaseTimestampMs, 5e3) && !this.xs(t.ownerId) && !this.bs(t) && !(this.Zn || this.allowTabSynchronization && t.allowTabSynchronization)) throw new Q(G.FAILED_PRECONDITION, zr);
         }));
     }
     /**
      * Obtains or extends the new primary lease for the local client. This
      * method does not verify that the client is eligible for this lease.
-     */    bs(t) {
+     */    Ps(t) {
         const e = {
             ownerId: this.clientId,
             allowTabSynchronization: this.allowTabSynchronization,
@@ -9647,7 +9654,7 @@ class Hr {
     }
     /** Checks the primary lease and removes it if we are the current primary. */    Rs(t) {
         const e = Jr(t);
-        return e.get("owner").next((t => this.Ps(t) ? (O("IndexedDbPersistence", "Releasing primary lease."), 
+        return e.get("owner").next((t => this.bs(t) ? (O("IndexedDbPersistence", "Releasing primary lease."), 
         e.delete("owner")) : pi.resolve()));
     }
     /** Verifies that `updateTimeMs` is within `maxAgeMs`. */    Ss(t, e) {
@@ -10655,13 +10662,13 @@ async function yo(t, e, n = Xn()) {
     /**
      * Clears all references with a given ID. Calls removeRef() for each key
      * removed.
-     */    bi(t) {
+     */    Pi(t) {
         const e = new xt(new _t([])), n = new Eo(e, t), s = new Eo(e, t + 1), i = [];
         return this.Ii.forEachInRange([ n, s ], (t => {
             this.Ai(t), i.push(t.key);
         })), i;
     }
-    Pi() {
+    bi() {
         this.yi.forEach((t => this.Ai(t)));
     }
     Ai(t) {
@@ -10946,7 +10953,7 @@ class Ro {
     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 pi.resolve(this.size);
@@ -10963,7 +10970,7 @@ class Ro {
 /**
  * Handles the details of adding and updating documents in the MemoryRemoteDocumentCache.
  */
-class bo extends $r {
+class Po extends $r {
     constructor(t) {
         super(), this.Kn = t;
     }
@@ -10996,7 +11003,7 @@ class bo extends $r {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class Po {
+ */ class bo {
     constructor(t) {
         this.persistence = t, 
         /**
@@ -11013,7 +11020,7 @@ class bo extends $r {
          * A ordered bidirectional mapping between documents and the remote target
          * IDs.
          */
-        this.Bi = new To, this.targetCount = 0, this.Li = Pr.gn();
+        this.Bi = new To, this.targetCount = 0, this.Li = br.gn();
     }
     forEachTarget(t, e) {
         return this.Fi.forEach(((t, n) => e(n))), pi.resolve();
@@ -11034,7 +11041,7 @@ class bo extends $r {
     Tn(t) {
         this.Fi.set(t.target, t);
         const e = t.targetId;
-        e > this.highestTargetId && (this.Li = new Pr(e), this.highestTargetId = e), t.sequenceNumber > this.$i && (this.$i = t.sequenceNumber);
+        e > this.highestTargetId && (this.Li = new br(e), this.highestTargetId = e), t.sequenceNumber > this.$i && (this.$i = t.sequenceNumber);
     }
     addTargetData(t, e) {
         return this.Tn(e), this.targetCount += 1, pi.resolve();
@@ -11043,7 +11050,7 @@ class bo extends $r {
         return this.Tn(e), pi.resolve();
     }
     removeTargetData(t, e) {
-        return this.Fi.delete(e.target), this.Bi.bi(e.targetId), this.targetCount -= 1, 
+        return this.Fi.delete(e.target), this.Bi.Pi(e.targetId), this.targetCount -= 1, 
         pi.resolve();
     }
     removeTargets(t, e, n) {
@@ -11072,7 +11079,7 @@ class bo extends $r {
         })), pi.waitFor(i);
     }
     removeMatchingKeysForTargetId(t, e) {
-        return this.Bi.bi(e), pi.resolve();
+        return this.Bi.Pi(e), pi.resolve();
     }
     getMatchingKeysForTargetId(t, e) {
         const n = this.Bi.Vi(e);
@@ -11112,7 +11119,7 @@ class Vo {
      */
     constructor(t, e) {
         this.Ui = {}, this.overlays = {}, this.es = new nt(0), this.ns = !1, this.ns = !0, 
-        this.referenceDelegate = t(this), this.fs = new Po(this);
+        this.referenceDelegate = t(this), this.fs = new bo(this);
         this.indexManager = new cr, this.ds = function(t) {
             return new Ro(t);
         }((t => this.referenceDelegate.qi(t))), this.M = new Mi(e), this._s = new po(this.M);
@@ -11200,7 +11207,7 @@ class So {
         return this.Hi.add(e.toString()), pi.resolve();
     }
     removeTarget(t, e) {
-        this.ji.bi(e.targetId).forEach((t => this.Hi.add(t.toString())));
+        this.ji.Pi(e.targetId).forEach((t => this.Hi.add(t.toString())));
         const n = this.persistence.getTargetCache();
         return n.getMatchingKeysForTargetId(t, e.targetId).next((t => {
             t.forEach((t => this.Hi.add(t.toString())));
@@ -11589,12 +11596,12 @@ class Fo {
                 if (this.started) {
                     if (null !== e.key) if (this.cr.test(e.key)) {
                         if (null == e.newValue) {
-                            const t = this.br(e.key);
-                            return this.Pr(t, null);
+                            const t = this.Pr(e.key);
+                            return this.br(t, null);
                         }
                         {
                             const t = this.Vr(e.key, e.newValue);
-                            if (t) return this.Pr(t.clientId, t);
+                            if (t) return this.br(t.clientId, t);
                         }
                     } else if (this.hr.test(e.key)) {
                         if (null !== e.newValue) {
@@ -11668,7 +11675,7 @@ class Fo {
     /**
      * Parses a client state key in WebStorage. Returns null if the key does not
      * match the expected key format.
-     */    br(t) {
+     */    Pr(t) {
         const e = this.cr.exec(t);
         return e ? e[1] : null;
     }
@@ -11676,7 +11683,7 @@ class Fo {
      * Parses a client state in WebStorage. Returns 'null' if the value could not
      * be parsed.
      */    Vr(t, e) {
-        const n = this.br(t);
+        const n = this.Pr(t);
         return Mo.Yi(n, e);
     }
     /**
@@ -11709,7 +11716,7 @@ class Fo {
     Cr(t) {
         return this.syncEngine.Or(t.targetId, t.state, t.error);
     }
-    Pr(t, e) {
+    br(t, e) {
         const n = e ? this.ir.insert(t, e) : this.ir.remove(t), s = this.yr(this.ir), i = this.yr(n), r = [], o = [];
         return i.forEach((t => {
             s.has(t) || r.push(t);
@@ -12368,7 +12375,7 @@ class zo {
  */
 class Ho {
     constructor(t, e, n, s, i, r, o, u) {
-        this.Yn = t, this.Ro = n, this.bo = s, this.Po = i, this.authCredentialsProvider = r, 
+        this.Yn = t, this.Ro = n, this.Po = s, this.bo = i, this.authCredentialsProvider = r, 
         this.appCheckCredentialsProvider = o, this.listener = u, this.state = 0 /* Initial */ , 
         /**
          * A close count that's incremented every time the stream is closed; used by
@@ -12514,7 +12521,7 @@ class Ho {
     qo(t, e) {
         const n = this.Uo(this.Vo);
         this.stream = this.Go(t, e), this.stream.Hr((() => {
-            n((() => (this.state = 2 /* Open */ , this.So = this.Yn.enqueueAfterDelay(this.bo, 1e4, (() => (this.xo() && (this.state = 3 /* Healthy */), 
+            n((() => (this.state = 2 /* Open */ , this.So = this.Yn.enqueueAfterDelay(this.Po, 1e4, (() => (this.xo() && (this.state = 3 /* Healthy */), 
             Promise.resolve()))), this.listener.Hr())));
         })), this.stream.Yr((t => {
             n((() => this.Ko(t)));
@@ -12560,7 +12567,7 @@ class Ho {
         this.M = i;
     }
     Go(t, e) {
-        return this.Po.lo("Listen", t, e);
+        return this.bo.lo("Listen", t, e);
     }
     onMessage(t) {
         // A successful response means the stream is healthy
@@ -12642,7 +12649,7 @@ class Ho {
         this.zo && this.Jo([]);
     }
     Go(t, e) {
-        return this.Po.lo("Write", t, e);
+        return this.bo.lo("Write", t, e);
     }
     onMessage(t) {
         if (
@@ -12704,20 +12711,20 @@ class Ho {
  */
 class Xo extends class {} {
     constructor(t, e, n, s) {
-        super(), this.authCredentials = t, this.appCheckCredentials = e, this.Po = n, this.M = s, 
+        super(), this.authCredentials = t, this.appCheckCredentials = e, this.bo = n, this.M = s, 
         this.tu = !1;
     }
     eu() {
         if (this.tu) throw new Q(G.FAILED_PRECONDITION, "The client has already been terminated.");
     }
     /** Invokes the provided RPC with auth and AppCheck tokens. */    oo(t, e, n) {
-        return this.eu(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([s, i]) => this.Po.oo(t, e, n, s, i))).catch((t => {
+        return this.eu(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([s, i]) => this.bo.oo(t, e, n, s, i))).catch((t => {
             throw "FirebaseError" === t.name ? (t.code === G.UNAUTHENTICATED && (this.authCredentials.invalidateToken(), 
             this.appCheckCredentials.invalidateToken()), t) : new Q(G.UNKNOWN, t.toString());
         }));
     }
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */    ho(t, e, n) {
-        return this.eu(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([s, i]) => this.Po.ho(t, e, n, s, i))).catch((t => {
+        return this.eu(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([s, i]) => this.bo.ho(t, e, n, s, i))).catch((t => {
             throw "FirebaseError" === t.name ? (t.code === G.UNAUTHENTICATED && (this.authCredentials.invalidateToken(), 
             this.appCheckCredentials.invalidateToken()), t) : new Q(G.UNKNOWN, t.toString());
         }));
@@ -13169,7 +13176,7 @@ async function Ru(t, e) {
     pu(t) && Iu(t);
 }
 
-async function bu(t, e) {
+async function Pu(t, e) {
     const n = K(t);
     n.asyncQueue.verifyOperationInProgress(), O("RemoteStore", "RemoteStore received new credentials");
     const s = cu(n);
@@ -13184,7 +13191,7 @@ async function bu(t, e) {
 
 /**
  * Toggles the network state when the client gains or loses its primary lease.
- */ async function Pu(t, e) {
+ */ async function bu(t, e) {
     const n = K(t);
     e ? (n.fu.delete(2 /* IsSecondary */), await eu(n)) : e || (n.fu.add(2 /* IsSecondary */), 
     await nu(n), n.wu.set("Unknown" /* Unknown */));
@@ -13202,7 +13209,7 @@ async function bu(t, e) {
     // Create stream (but note that it is not started yet).
     t.gu = function(t, e, n) {
         const s = K(t);
-        return s.eu(), new Jo(e, s.Po, s.authCredentials, s.appCheckCredentials, s.M, n);
+        return s.eu(), new Jo(e, s.bo, s.authCredentials, s.appCheckCredentials, s.M, n);
     }
     /**
  * @license
@@ -13241,7 +13248,7 @@ async function bu(t, e) {
     // Create stream (but note that it is not started yet).
     t.yu = function(t, e, n) {
         const s = K(t);
-        return s.eu(), new Yo(e, s.Po, s.authCredentials, s.appCheckCredentials, s.M, n);
+        return s.eu(), new Yo(e, s.bo, s.authCredentials, s.appCheckCredentials, s.M, n);
     }(t.datastore, t.asyncQueue, {
         Hr: Tu.bind(null, t),
         Yr: Ru.bind(null, t),
@@ -13623,12 +13630,12 @@ function Lu(t) {
  * It uses an Observer to dispatch events.
  */ class Uu {
     constructor(t, e, n) {
-        this.query = t, this.bu = e, 
+        this.query = t, this.Pu = e, 
         /**
          * Initial snapshots (e.g. from cache) may not be propagated to the wrapped
          * observer. This flag is set to true once we've actually raised an event.
          */
-        this.Pu = !1, this.Vu = null, this.onlineState = "Unknown" /* Unknown */ , this.options = n || {};
+        this.bu = !1, this.Vu = null, this.onlineState = "Unknown" /* Unknown */ , this.options = n || {};
     }
     /**
      * Applies the new ViewSnapshot to this listener, raising a user-facing event
@@ -13644,16 +13651,16 @@ function Lu(t) {
             /* excludesMetadataChanges= */ !0);
         }
         let e = !1;
-        return this.Pu ? this.vu(t) && (this.bu.next(t), e = !0) : this.Su(t, this.onlineState) && (this.Du(t), 
+        return this.bu ? this.vu(t) && (this.Pu.next(t), e = !0) : this.Su(t, this.onlineState) && (this.Du(t), 
         e = !0), this.Vu = t, e;
     }
     onError(t) {
-        this.bu.error(t);
+        this.Pu.error(t);
     }
     /** Returns whether a snapshot was raised. */    Au(t) {
         this.onlineState = t;
         let e = !1;
-        return this.Vu && !this.Pu && this.Su(this.Vu, t) && (this.Du(this.Vu), e = !0), 
+        return this.Vu && !this.bu && this.Su(this.Vu, t) && (this.Du(this.Vu), e = !0), 
         e;
     }
     Su(t, e) {
@@ -13680,8 +13687,8 @@ function Lu(t) {
         // stripped out.
         }
     Du(t) {
-        t = Nu.fromInitialDocuments(t.query, t.docs, t.mutatedKeys, t.fromCache), this.Pu = !0, 
-        this.bu.next(t);
+        t = Nu.fromInitialDocuments(t.query, t.docs, t.mutatedKeys, t.fromCache), this.bu = !0, 
+        this.Pu.next(t);
     }
 }
 
@@ -13743,7 +13750,7 @@ function Lu(t) {
     /**
      * Converts a BundleDocument to a MutableDocument.
      */    di(t) {
-        return t.metadata.exists ? Ps(this.M, t.document, !1) : ne.newNoDocument(this.fi(t.metadata.name), this._i(t.metadata.readTime));
+        return t.metadata.exists ? bs(this.M, t.document, !1) : ne.newNoDocument(this.fi(t.metadata.name), this._i(t.metadata.readTime));
     }
     _i(t) {
         return ms(t);
@@ -14190,7 +14197,7 @@ class Hu {
         /** Stores user completion handlers, indexed by User and BatchId. */
         this.ua = {}, 
         /** Stores user callbacks waiting for all pending writes to be acknowledged. */
-        this.aa = new Map, this.ca = Pr.yn(), this.onlineState = "Unknown" /* Unknown */ , 
+        this.aa = new Map, this.ca = br.yn(), this.onlineState = "Unknown" /* Unknown */ , 
         // The primary state is set to `true` or `false` immediately after Firestore
         // startup. In the interim, a client should only be considered primary if
         // `isPrimary` is true.
@@ -14503,7 +14510,7 @@ function ha(t, e, n = null) {
     t.sharedClientState.removeLocalQueryTarget(e);
     for (const s of t.na.get(e)) t.ea.delete(s), n && t.ta.fa(s, n);
     if (t.na.delete(e), t.isPrimaryClient) {
-        t.oa.bi(e).forEach((e => {
+        t.oa.Pi(e).forEach((e => {
             t.oa.containsKey(e) || 
             // We removed the last reference for this key
             la(t, e);
@@ -14680,7 +14687,7 @@ async function Ta(t, e) {
         // primary, we need to need to make sure that all views for all targets
         // match the state on disk.
         const t = n.sharedClientState.getAllActiveQueryTargets(), e = await Ea(n, t.toArray());
-        n.ha = !0, await Pu(n.remoteStore, !0);
+        n.ha = !0, await bu(n.remoteStore, !0);
         for (const t of e) su(n.remoteStore, t);
     } else if (!1 === e && !1 !== n.ha) {
         const t = [];
@@ -14695,7 +14702,7 @@ async function Ta(t, e) {
             const e = K(t);
             e.ra.forEach(((t, n) => {
                 iu(e.remoteStore, n);
-            })), e.oa.Pi(), e.ra = new Map, e.ia = new Bn(xt.comparator);
+            })), e.oa.bi(), e.ra = new Map, e.ia = new Bn(xt.comparator);
         }
         /**
  * Reconcile the query views of the provided query targets with the state from
@@ -14708,7 +14715,7 @@ async function Ta(t, e) {
  * tab to a primary tab
  */
         // PORTING NOTE: Multi-Tab only.
-        (n), n.ha = !1, await Pu(n.remoteStore, !1);
+        (n), n.ha = !1, await bu(n.remoteStore, !1);
     }
 }
 
@@ -14763,7 +14770,7 @@ function Ra(t) {
 
 /** 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 = K(t);
     if (i.ha) 
     // If we receive a target state notification via WebStorage, we are
@@ -14789,7 +14796,7 @@ async function ba(t, e, n, s) {
     }
 }
 
-/** Adds or removes Watch targets for queries from different tabs. */ async function Pa(t, e, n) {
+/** Adds or removes Watch targets for queries from different tabs. */ async function ba(t, e, n) {
     const s = Va(t);
     if (s.ha) {
         for (const t of e) {
@@ -14977,8 +14984,8 @@ class Da {
         const e = this.ya.syncEngine;
         this.sharedClientState instanceof $o && (this.sharedClientState.syncEngine = {
             Mr: Ia.bind(null, e),
-            Or: ba.bind(null, e),
-            Fr: Pa.bind(null, e),
+            Or: Pa.bind(null, e),
+            Fr: ba.bind(null, e),
             Fs: Ra.bind(null, e),
             kr: pa.bind(null, e)
         }, await this.sharedClientState.start()), 
@@ -15006,7 +15013,7 @@ class Da {
         this.eventManager = this.createEventManager(e), this.syncEngine = this.createSyncEngine(e, 
         /* startAsPrimary=*/ !t.synchronizeTabs), this.sharedClientState.onlineStateHandler = t => sa(this.syncEngine, t, 1 /* SharedClientState */), 
         this.remoteStore.remoteSyncer.handleCredentialChange = ma.bind(null, this.syncEngine), 
-        await Pu(this.remoteStore, this.syncEngine.isPrimaryClient));
+        await bu(this.remoteStore, this.syncEngine.isPrimaryClient));
     }
     createEventManager(t) {
         return new Mu;
@@ -15222,8 +15229,8 @@ class Ma {
         const t = await this.Ra();
         if (null === t) return null;
         const e = this.Ea.decode(t), n = Number(e);
-        isNaN(n) && this.ba(`length string (${e}) is not valid number`);
-        const s = await this.Pa(n);
+        isNaN(n) && this.Pa(`length string (${e}) is not valid number`);
+        const s = await this.ba(n);
         return new qu(JSON.parse(s), t.length + n);
     }
     /** First index of '{' from the underlying buffer. */    Va() {
@@ -15244,7 +15251,7 @@ class Ma {
         const t = this.Va();
         // Broke out of the loop because underlying stream is closed, but still
         // cannot find an open bracket.
-                t < 0 && this.ba("Reached the end of bundle when a length string is expected.");
+                t < 0 && this.Pa("Reached the end of bundle when a length string is expected.");
         const e = this.buffer.slice(0, t);
         // Update the internal buffer to drop the read length.
                 return this.buffer = this.buffer.slice(t), e;
@@ -15254,15 +15261,15 @@ class Ma {
      * number of bytes, pulling more data from the underlying stream if needed.
      *
      * Returns a string decoded from the read bytes.
-     */    async Pa(t) {
+     */    async ba(t) {
         for (;this.buffer.length < t; ) {
-            await this.va() && this.ba("Reached the end of bundle when more is expected.");
+            await this.va() && this.Pa("Reached the end of bundle when more is expected.");
         }
         const e = this.Ea.decode(this.buffer.slice(0, t));
         // Update the internal buffer to drop the read json string.
                 return this.buffer = this.buffer.slice(t), e;
     }
-    ba(t) {
+    Pa(t) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
         throw this.Ta.cancel(), new Error(`Invalid bundle format: ${t}`);
     }
@@ -15589,7 +15596,7 @@ async function Ua(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;
 }
 
@@ -16482,7 +16489,7 @@ function Tc(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.
@@ -16517,7 +16524,7 @@ function bc(t) {
  */ (t, [ "next", "error", "complete" ]);
 }
 
-class Pc {
+class bc {
     constructor() {
         this._progressObserver = {}, this._taskCompletionResolver = new j, this._lastProgress = {
             taskState: "Running",
@@ -16886,7 +16893,7 @@ function Oc(t) {
  * updates, and completion or error events. It can be used as a
  * `Promise<LoadBundleTaskProgress>`.
  */ function Uc(t, e) {
-    const n = Cc(t = lc(t, vc)), s = new Pc;
+    const n = Cc(t = lc(t, vc)), s = new bc;
     return sc(n, t._databaseId, e, s), s;
 }
 
@@ -17167,7 +17174,7 @@ class Gc {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return null !== this.fieldMask ? new Vn(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Pn(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new Vn(t, this.data, this.fieldMask, e, this.fieldTransforms) : new bn(t, this.data, e, this.fieldTransforms);
     }
 }
 
@@ -17818,7 +17825,7 @@ function ph(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 Th {
+ */ class Ph extends Th {
     /** @hideconstructor protected */
     constructor(t, e, n, s, i, r) {
         super(t, e, n, s, r), this._firestore = t, this._firestoreImpl = t, this.metadata = i;
@@ -17846,7 +17853,7 @@ function ph(t, e, n, s, i) {
             if (this._converter) {
                 // We only want to use the converter and create a new DocumentSnapshot
                 // if a converter has been provided.
-                const e = new Ph(this._firestore, this._userDataWriter, this._key, this._document, this.metadata, 
+                const e = new bh(this._firestore, this._userDataWriter, this._key, this._document, this.metadata, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(e, t);
             }
@@ -17889,7 +17896,7 @@ function ph(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 Ph extends bh {
+ */ class bh extends Ph {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -17938,7 +17945,7 @@ function ph(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 Ph(this._firestore, this._userDataWriter, n.key, n, new Rh(this._snapshot.mutatedKeys.has(n.key), this._snapshot.fromCache), this.query.converter));
+            t.call(e, new bh(this._firestore, this._userDataWriter, n.key, n, new Rh(this._snapshot.mutatedKeys.has(n.key), this._snapshot.fromCache), this.query.converter));
         }));
     }
     /**
@@ -17959,7 +17966,7 @@ function ph(t, e, n, s, i) {
                 let e = 0;
                 return t._snapshot.docChanges.map((n => ({
                     type: "added",
-                    doc: new Ph(t._firestore, t._userDataWriter, n.doc.key, n.doc, new Rh(t._snapshot.mutatedKeys.has(n.doc.key), t._snapshot.fromCache), t.query.converter),
+                    doc: new bh(t._firestore, t._userDataWriter, n.doc.key, n.doc, new Rh(t._snapshot.mutatedKeys.has(n.doc.key), t._snapshot.fromCache), t.query.converter),
                     oldIndex: -1,
                     newIndex: e++
                 })));
@@ -17969,7 +17976,7 @@ function ph(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 Ph(t._firestore, t._userDataWriter, e.doc.key, e.doc, new Rh(t._snapshot.mutatedKeys.has(e.doc.key), t._snapshot.fromCache), t.query.converter);
+                    const s = new bh(t._firestore, t._userDataWriter, e.doc.key, e.doc, new Rh(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)), {
@@ -18010,7 +18017,7 @@ function vh(t) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */ function Sh(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 && Ac(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 && Ac(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
 }
 
 /**
@@ -18426,11 +18433,11 @@ function Hh(t, e, n) {
     convertServerTimestamp(t, e) {
         switch (e) {
           case "previous":
-            const n = bt(t);
+            const n = Pt(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Pt(t));
+            return this.convertTimestamp(bt(t));
 
           default:
             return null;
@@ -18655,7 +18662,7 @@ class nl extends Jh {
  */ function sl(t) {
     t = lc(t, mc);
     const e = lc(t.firestore, vc), n = Cc(e), s = new nl(e);
-    return Ya(n, t._key).then((n => new bh(e, s, t._key, n, new Rh(null !== n && n.hasLocalMutations, 
+    return Ya(n, t._key).then((n => new Ph(e, s, t._key, n, new Rh(null !== n && n.hasLocalMutations, 
     /* fromCache= */ !0), t.converter)));
 }
 
@@ -18759,11 +18766,11 @@ function fl(t, ...e) {
     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);
@@ -18796,7 +18803,7 @@ function fl(t, ...e) {
 }
 
 function dl(t, e) {
-    return ec(Cc(t = lc(t, vc)), bc(e) ? e : {
+    return ec(Cc(t = lc(t, vc)), Pc(e) ? e : {
         next: e
     });
 }
@@ -18816,7 +18823,7 @@ function dl(t, e) {
  * to a {@link DocumentSnapshot}.
  */ function wl(t, e, n) {
     const s = n.docs.get(e._key), i = new nl(t);
-    return new bh(t, i, e._key, s, new Rh(n.hasPendingWrites, n.fromCache), e.converter);
+    return new Ph(t, i, e._key, s, new Rh(n.hasPendingWrites, n.fromCache), e.converter);
 }
 
 /**
@@ -18896,7 +18903,7 @@ function dl(t, e) {
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
         const e = tl(t, this._firestore), n = new nl(this._firestore);
-        return super.get(t).then((t => new bh(this._firestore, n, e._key, t._document, new Rh(
+        return super.get(t).then((t => new Ph(this._firestore, n, e._key, t._document, new Rh(
         /* hasPendingWrites= */ !1, 
         /* fromCache= */ !1), e.converter)));
     }
@@ -19064,9 +19071,9 @@ function dl(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 = Pl(t, "collectionGroup"), n = [];
         if (Array.isArray(t.fields)) for (const e of t.fields) {
-            const t = yh("setIndexConfiguration", bl(e, "fieldPath"));
+            const t = yh("setIndexConfiguration", Pl(e, "fieldPath"));
             "CONTAINS" === e.arrayConfig ? n.push(new oe(t, 2 /* CONTAINS */)) : "ASCENDING" === e.order ? n.push(new oe(t, 0 /* ASCENDING */)) : "DESCENDING" === e.order && n.push(new oe(t, 1 /* DESCENDING */));
         }
         s.push(new se(se.UNKNOWN_ID, e, n, ue.empty()));
@@ -19075,7 +19082,7 @@ function dl(t, e) {
         return Promise.resolve();
 }
 
-function bl(t, e) {
+function Pl(t, e) {
     if ("string" != typeof t[e]) throw new Q(G.INVALID_ARGUMENT, "Missing string value for: " + e);
     return t[e];
 }
@@ -19092,10 +19099,10 @@ function bl(t, e) {
         return n = Object.assign({
             useFetchStreams: e
         }, n), i._setSettings(n), i;
-    }), "PUBLIC")), registerVersion(D, "3.4.7-canary.e9e5f6b3c", t), 
+    }), "PUBLIC")), registerVersion(D, "3.4.8", t), 
     // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-    registerVersion(D, "3.4.7-canary.e9e5f6b3c", "esm2017");
+    registerVersion(D, "3.4.8", "esm2017");
 }();
 
-export { Jh as AbstractUserDataWriter, jc as Bytes, Vc as CACHE_SIZE_UNLIMITED, yc as CollectionReference, mc as DocumentReference, bh as DocumentSnapshot, Gc as FieldPath, Wc as FieldValue, vc as Firestore, Q as FirestoreError, zc as GeoPoint, Pc as LoadBundleTask, gc as Query, Ch as QueryConstraint, Ph as QueryDocumentSnapshot, Vh as QuerySnapshot, Rh as SnapshotMetadata, at as Timestamp, ml as Transaction, Zh as WriteBatch, vt as _DatabaseId, xt as _DocumentKey, et as _EmptyAppCheckTokenProvider, z as _EmptyAuthCredentialsProvider, mt as _FieldPath, lc as _cast, q as _debugAssert, yt as _isBase64Available, $ as _logWarn, Rl as _setIndexConfiguration, uc as _validateIsNotUsedTogether, ll as addDoc, Tl as arrayRemove, Il as arrayUnion, Oc as clearIndexedDbPersistence, pc as collection, Ic as collectionGroup, wc as connectFirestoreEmulator, hl as deleteDoc, yl as deleteField, Bc as disableNetwork, Tc as doc, Qc as documentId, Nc as enableIndexedDbPersistence, kc as enableMultiTabIndexedDbPersistence, $c as enableNetwork, Qh as endAt, Gh as endBefore, Cc as ensureFirestoreConfigured, _l as executeWrite, el as getDoc, sl as getDocFromCache, il as getDocFromServer, rl as getDocs, ol as getDocsFromCache, ul as getDocsFromServer, Dc as getFirestore, El as increment, Sc as initializeFirestore, $h as limit, Bh as limitToLast, Uc as loadBundle, qc as namedQuery, fl as onSnapshot, dl as onSnapshotsInSync, Oh as orderBy, xh as query, Ac as queryEqual, Ec as refEqual, gl as runTransaction, pl as serverTimestamp, al as setDoc, M as setLogLevel, Sh as snapshotEqual, qh as startAfter, Uh as startAt, Lc as terminate, cl as updateDoc, Fc as waitForPendingWrites, kh as where, Al as writeBatch };
+export { Jh as AbstractUserDataWriter, jc as Bytes, Vc as CACHE_SIZE_UNLIMITED, yc as CollectionReference, mc as DocumentReference, Ph as DocumentSnapshot, Gc as FieldPath, Wc as FieldValue, vc as Firestore, Q as FirestoreError, zc as GeoPoint, bc as LoadBundleTask, gc as Query, Ch as QueryConstraint, bh as QueryDocumentSnapshot, Vh as QuerySnapshot, Rh as SnapshotMetadata, at as Timestamp, ml as Transaction, Zh as WriteBatch, vt as _DatabaseId, xt as _DocumentKey, et as _EmptyAppCheckTokenProvider, z as _EmptyAuthCredentialsProvider, mt as _FieldPath, lc as _cast, q as _debugAssert, yt as _isBase64Available, $ as _logWarn, Rl as _setIndexConfiguration, uc as _validateIsNotUsedTogether, ll as addDoc, Tl as arrayRemove, Il as arrayUnion, Oc as clearIndexedDbPersistence, pc as collection, Ic as collectionGroup, wc as connectFirestoreEmulator, hl as deleteDoc, yl as deleteField, Bc as disableNetwork, Tc as doc, Qc as documentId, Nc as enableIndexedDbPersistence, kc as enableMultiTabIndexedDbPersistence, $c as enableNetwork, Qh as endAt, Gh as endBefore, Cc as ensureFirestoreConfigured, _l as executeWrite, el as getDoc, sl as getDocFromCache, il as getDocFromServer, rl as getDocs, ol as getDocsFromCache, ul as getDocsFromServer, Dc as getFirestore, El as increment, Sc as initializeFirestore, $h as limit, Bh as limitToLast, Uc as loadBundle, qc as namedQuery, fl as onSnapshot, dl as onSnapshotsInSync, Oh as orderBy, xh as query, Ac as queryEqual, Ec as refEqual, gl as runTransaction, pl as serverTimestamp, al as setDoc, M as setLogLevel, Sh as snapshotEqual, qh as startAfter, Uh as startAt, Lc as terminate, cl as updateDoc, Fc as waitForPendingWrites, kh as where, Al as writeBatch };
 //# sourceMappingURL=index.esm2017.js.map