@firebase/firestore 3.4.0-canary.8d9a09e18 → 3.4.0-canary.fd8cd3ec4

package/dist/index.esm2017.js

@@ -66,7 +66,7 @@ D.MOCK_USER = new D("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let C = "9.6.0-canary.8d9a09e18";
+let C = "9.6.0-canary.fd8cd3ec4";
 
 /**
  * @license
@@ -774,7 +774,7 @@ function it(t, e) {
  * For examples and further specifications, refer to the
  * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
  */
-class at {
+class ct {
     /**
      * Creates a new timestamp.
      *
@@ -806,7 +806,7 @@ class at {
      *
      * @returns a new timestamp representing the current date.
      */    static now() {
-        return at.fromMillis(Date.now());
+        return ct.fromMillis(Date.now());
     }
     /**
      * Creates a new timestamp from the given date.
@@ -815,7 +815,7 @@ class at {
      * @returns A new `Timestamp` representing the same point in time as the given
      *     date.
      */    static fromDate(t) {
-        return at.fromMillis(t.getTime());
+        return ct.fromMillis(t.getTime());
     }
     /**
      * Creates a new timestamp from the given number of milliseconds.
@@ -826,7 +826,7 @@ class at {
      *     number of milliseconds.
      */    static fromMillis(t) {
         const e = Math.floor(t / 1e3), n = Math.floor(1e6 * (t - 1e3 * e));
-        return new at(e, n);
+        return new ct(e, n);
     }
     /**
      * Converts a `Timestamp` to a JavaScript `Date` object. This conversion
@@ -904,15 +904,15 @@ class at {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ class ct {
+ */ class at {
     constructor(t) {
         this.timestamp = t;
     }
     static fromTimestamp(t) {
-        return new ct(t);
+        return new at(t);
     }
     static min() {
-        return new ct(new at(0, 0));
+        return new at(new ct(0, 0));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -1410,7 +1410,7 @@ function Rt(t) {
  * Returns the local time at which this timestamp was first set.
  */ function Pt(t) {
     const e = Tt(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new at(e.seconds, e.nanos);
+    return new ct(e.seconds, e.nanos);
 }
 
 /**
@@ -1927,7 +1927,7 @@ function Lt(t) {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new Wt(t, 0 /* INVALID */ , ct.min(), jt.empty(), 0 /* SYNCED */);
+        return new Wt(t, 0 /* INVALID */ , at.min(), jt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist with the given data at the
@@ -2094,7 +2094,7 @@ class Zt 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.P(t, e, n) : new ee(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new re(t, n) : "in" /* IN */ === e ? new oe(t, n) : "not-in" /* NOT_IN */ === e ? new ae(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ce(t, n) : new Zt(t, e, n);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.P(t, e, n) : new ee(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new re(t, n) : "in" /* IN */ === e ? new oe(t, n) : "not-in" /* NOT_IN */ === e ? new ce(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ae(t, n) : new Zt(t, e, n);
     }
     static P(t, e, n) {
         return "in" /* IN */ === e ? new ne(t, n) : new se(t, n);
@@ -2194,7 +2194,7 @@ function ie(t, e) {
     }
 }
 
-/** A Filter that implements the not-in operator. */ class ae extends Zt {
+/** A Filter that implements the not-in operator. */ class ce extends Zt {
     constructor(t, e) {
         super(t, "not-in" /* NOT_IN */ , e);
     }
@@ -2207,7 +2207,7 @@ function ie(t, e) {
     }
 }
 
-/** A Filter that implements the array-contains-any operator. */ class ce extends Zt {
+/** A Filter that implements the array-contains-any operator. */ class ae extends Zt {
     constructor(t, e) {
         super(t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , e);
     }
@@ -2305,16 +2305,16 @@ function we(t, e) {
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
      */
-    constructor(t, e = null, n = [], s = [], i = null, r = "F" /* First */ , o = null, a = null) {
+    constructor(t, e = null, n = [], s = [], i = null, r = "F" /* First */ , o = null, c = null) {
         this.path = t, this.collectionGroup = e, this.explicitOrderBy = n, this.filters = s, 
-        this.limit = i, this.limitType = r, this.startAt = o, this.endAt = a, this.S = null, 
+        this.limit = i, this.limitType = r, this.startAt = o, this.endAt = c, this.S = null, 
         // The corresponding `Target` of this `Query` instance.
         this.D = null, this.startAt, this.endAt;
     }
 }
 
-/** Creates a new Query instance with the options provided. */ function me(t, e, n, s, i, r, o, a) {
-    return new _e(t, e, n, s, i, r, o, a);
+/** Creates a new Query instance with the options provided. */ function me(t, e, n, s, i, r, o, c) {
+    return new _e(t, e, n, s, i, r, o, c);
 }
 
 /** Creates a new Query for a query that matches all documents at `path` */ function ge(t) {
@@ -2815,7 +2815,7 @@ class He {
         // Unlike setMutationApplyToLocalView, if we're applying a mutation to a
         // remote document the server has accepted the mutation so the precondition
         // must have held.
-        const s = t.value.clone(), i = cn(t.fieldTransforms, e, n.transformResults);
+        const s = t.value.clone(), i = an(t.fieldTransforms, e, n.transformResults);
         s.setAll(i), e.convertToFoundDocument(n.version, s).setHasCommittedMutations();
     }(t, e, n) : t instanceof on ? function(t, e, n) {
         if (!Ye(t.precondition, e)) 
@@ -2824,8 +2824,8 @@ class He {
         // of the document in our cache and convert to an UnknownDocument with a
         // known updateTime.
         return void e.convertToUnknownDocument(n.version);
-        const s = cn(t.fieldTransforms, e, n.transformResults), i = e.data;
-        i.setAll(an(t)), i.setAll(s), e.convertToFoundDocument(n.version, i).setHasCommittedMutations();
+        const s = an(t.fieldTransforms, e, n.transformResults), i = e.data;
+        i.setAll(cn(t)), i.setAll(s), e.convertToFoundDocument(n.version, i).setHasCommittedMutations();
     }(t, e, n) : function(t, e, n) {
         // Unlike applyToLocalView, if we're applying a mutation to a remote
         // document the server has accepted the mutation so the precondition must
@@ -2869,7 +2869,7 @@ class He {
  */ (t, e, n) : t instanceof on ? function(t, e, n) {
         if (!Ye(t.precondition, e)) return;
         const s = un(t.fieldTransforms, n, e), i = e.data;
-        i.setAll(an(t)), i.setAll(s), e.convertToFoundDocument(sn(e), i).setHasLocalMutations();
+        i.setAll(cn(t)), i.setAll(s), e.convertToFoundDocument(sn(e), i).setHasLocalMutations();
     }
     /**
  * Returns a FieldPath/Value map with the content of the PatchMutation.
@@ -2877,7 +2877,7 @@ class He {
         Ye(t.precondition, e) && 
         // We don't call `setHasLocalMutations()` since we want to be backwards
         // compatible with the existing SDK behavior.
-        e.convertToNoDocument(ct.min());
+        e.convertToNoDocument(at.min());
     }
     /**
  * A mutation that verifies the existence of the document at the given key with
@@ -2924,7 +2924,7 @@ function nn(t, e) {
  * only if it is an existing document. Deleted and unknown documents have a
  * post-mutation version of SnapshotVersion.min().
  */ function sn(t) {
-    return t.isFoundDocument() ? t.version : ct.min();
+    return t.isFoundDocument() ? t.version : at.min();
 }
 
 /**
@@ -2944,7 +2944,7 @@ class on extends Xe {
     }
 }
 
-function an(t) {
+function cn(t) {
     const e = new Map;
     return t.fieldMask.fields.forEach((n => {
         if (!n.isEmpty()) {
@@ -2964,12 +2964,12 @@ function an(t) {
  * previous mutations.
  * @param serverTransformResults - The transform results received by the server.
  * @returns The transform results list.
- */ function cn(t, e, n) {
+ */ function an(t, e, n) {
     const s = new Map;
     B(t.length === n.length);
     for (let i = 0; i < n.length; i++) {
-        const r = t[i], o = r.transform, a = e.data.field(r.field);
-        s.set(r.field, Oe(o, a, n[i]));
+        const r = t[i], o = r.transform, c = e.data.field(r.field);
+        s.set(r.field, Oe(o, c, n[i]));
     }
     return s;
 }
@@ -3749,7 +3749,7 @@ function Cn() {
     // PORTING NOTE: Multi-tab only
     static createSynthesizedRemoteEventForCurrentChange(t, e) {
         const n = new Map;
-        return n.set(t, kn.createSynthesizedTargetChangeForCurrentChange(t, e)), new Nn(ct.min(), n, Cn(), An(), Sn());
+        return n.set(t, kn.createSynthesizedTargetChangeForCurrentChange(t, e)), new Nn(at.min(), n, Cn(), An(), Sn());
     }
 }
 
@@ -3982,8 +3982,8 @@ class Mn {
     /**
      * Processes and adds the DocumentWatchChange to the current set of changes.
      */    ot(t) {
-        for (const e of t.$) t.F && t.F.isFoundDocument() ? this.at(e, t.F) : this.ct(e, t.key, t.F);
-        for (const e of t.removedTargetIds) this.ct(e, t.key, t.F);
+        for (const e of t.$) t.F && t.F.isFoundDocument() ? this.ct(e, t.F) : this.at(e, t.key, t.F);
+        for (const e of t.removedTargetIds) this.at(e, t.key, t.F);
     }
     /** Processes and adds the WatchTargetChange to the current set of changes. */    ut(t) {
         this.forEachTarget(t, (e => {
@@ -4053,7 +4053,7 @@ class Mn {
                 // until it is resolved, essentially exposing inconsistency between
                 // queries.
                 const n = new St(t.path);
-                this.ct(e, n, Wt.newNoDocument(n, ct.min()));
+                this.at(e, n, Wt.newNoDocument(n, at.min()));
             } else B(1 === n); else {
                 this._t(e) !== n && (
                 // Existence filter mismatch: We reset the mapping and raise a new
@@ -4080,7 +4080,7 @@ class Mn {
                     // instead resulting in an explicit delete message and we could
                     // remove this special logic.
                     const e = new St(i.target.path);
-                    null !== this.st.get(e) || this.yt(s, e) || this.ct(s, e, Wt.newNoDocument(e, t));
+                    null !== this.st.get(e) || this.yt(s, e) || this.at(s, e, Wt.newNoDocument(e, t));
                 }
                 n.j && (e.set(s, n.G()), n.H());
             }
@@ -4106,7 +4106,7 @@ class Mn {
      * its document key to the given target's mapping.
      */
     // Visible for testing.
-    at(t, e) {
+    ct(t, e) {
         if (!this.lt(t)) return;
         const n = this.yt(t, e.key) ? 2 /* Modified */ : 0 /* Added */;
         this.ht(t).J(e.key, n), this.st = this.st.insert(e.key, e), this.it = this.it.insert(e.key, this.Tt(e.key).add(t));
@@ -4119,7 +4119,7 @@ class Mn {
      * to update the remote document cache.
      */
     // Visible for testing.
-    ct(t, e, n) {
+    at(t, e, n) {
         if (!this.lt(t)) return;
         const s = this.ht(t);
         this.yt(t, e) ? s.J(e, 1 /* Removed */) : 
@@ -4174,7 +4174,7 @@ class Mn {
      */    ft(t) {
         this.nt.set(t, new On);
         this.et.getRemoteKeysForTarget(t).forEach((e => {
-            this.ct(t, e, /*updatedDocument=*/ null);
+            this.at(t, e, /*updatedDocument=*/ null);
         }));
     }
     /**
@@ -4279,9 +4279,9 @@ function Qn(t, e) {
 }
 
 function Gn(t) {
-    return B(!!t), ct.fromTimestamp(function(t) {
+    return B(!!t), at.fromTimestamp(function(t) {
         const e = Tt(t);
-        return new at(e.seconds, e.nanos);
+        return new ct(e.seconds, e.nanos);
     }(t));
 }
 
@@ -4371,7 +4371,7 @@ function rs(t, e) {
         }(e.targetChange.targetChangeType || "NO_CHANGE"), i = e.targetChange.targetIds || [], r = function(t, e) {
             return t.C ? (B(void 0 === e || "string" == typeof e), yt.fromBase64String(e || "")) : (B(void 0 === e || e instanceof Uint8Array), 
             yt.fromUint8Array(e || new Uint8Array));
-        }(t, e.targetChange.resumeToken), o = e.targetChange.cause, a = o && function(t) {
+        }(t, e.targetChange.resumeToken), o = e.targetChange.cause, c = o && function(t) {
             const e = void 0 === t.code ? K.UNKNOWN : mn(t.code);
             return new j(e, t.message || "");
         }
@@ -4383,7 +4383,7 @@ function rs(t, e) {
  * our generated proto interfaces say Int32Value must be. But GRPC actually
  * expects a { value: <number> } struct.
  */ (o);
-        n = new Fn(s, i, r, a || null);
+        n = new Fn(s, i, r, c || null);
     } else if ("documentChange" in e) {
         e.documentChange;
         const s = e.documentChange;
@@ -4392,14 +4392,14 @@ function rs(t, e) {
             mapValue: {
                 fields: s.document.fields
             }
-        }), a = Wt.newFoundDocument(i, r, o), c = s.targetIds || [], u = s.removedTargetIds || [];
-        n = new xn(c, u, a.key, a);
+        }), c = Wt.newFoundDocument(i, r, o), a = s.targetIds || [], u = s.removedTargetIds || [];
+        n = new xn(a, u, c.key, c);
     } else if ("documentDelete" in e) {
         e.documentDelete;
         const s = e.documentDelete;
         s.document;
-        const i = Yn(t, s.document), r = s.readTime ? Gn(s.readTime) : ct.min(), o = Wt.newNoDocument(i, r), a = s.removedTargetIds || [];
-        n = new xn([], a, o.key, o);
+        const i = Yn(t, s.document), r = s.readTime ? Gn(s.readTime) : at.min(), o = Wt.newNoDocument(i, r), c = s.removedTargetIds || [];
+        n = new xn([], c, o.key, o);
     } else if ("documentRemove" in e) {
         e.documentRemove;
         const s = e.documentRemove;
@@ -4466,7 +4466,7 @@ function os(t, e) {
     }(t, e.precondition)), n;
 }
 
-function as(t, e) {
+function cs(t, e) {
     const n = e.currentDocument ? function(t) {
         return void 0 !== t.updateTime ? Je.updateTime(Gn(t.updateTime)) : void 0 !== t.exists ? Je.exists(t.exists) : Je.none();
     }(e.currentDocument) : Je.none(), s = e.updateTransforms ? e.updateTransforms.map((e => function(t, e) {
@@ -4508,11 +4508,11 @@ function as(t, e) {
     return L();
 }
 
-function cs(t, e) {
+function as(t, e) {
     return t && t.length > 0 ? (B(void 0 !== e), t.map((t => function(t, e) {
         // NOTE: Deletes don't have an updateTime.
         let n = t.updateTime ? Gn(t.updateTime) : Gn(e);
-        return n.isEqual(ct.min()) && (
+        return n.isEqual(at.min()) && (
         // The Firestore Emulator currently returns an update time of 0 for
         // deletes of non-existing documents (rather than null). This breaks the
         // test "get deleted doc while offline with source=cache" as NoDocuments
@@ -4642,15 +4642,15 @@ function ls(t) {
         // visible for testing
         (t.direction));
     }(t))));
-    let a = null;
-    n.limit && (a = function(t) {
+    let c = null;
+    n.limit && (c = function(t) {
         let e;
         return e = "object" == typeof t ? t.value : t, bt(e) ? null : e;
     }(n.limit));
-    let c = null;
-    n.startAt && (c = _s(n.startAt));
+    let a = null;
+    n.startAt && (a = _s(n.startAt));
     let u = null;
-    return n.endAt && (u = _s(n.endAt)), me(e, i, o, r, a, "F" /* First */ , c, u);
+    return n.endAt && (u = _s(n.endAt)), me(e, i, o, r, c, "F" /* First */ , a, u);
 }
 
 function fs(t, e) {
@@ -6114,7 +6114,7 @@ function ii(t, e) {
             const n = t.get(e.key), s = n;
             // TODO(mutabledocuments): This method should take a MutableDocumentMap
             // and we should remove this cast.
-                        this.applyToLocalView(s), n.isValidDocument() || s.convertToNoDocument(ct.min());
+                        this.applyToLocalView(s), n.isValidDocument() || s.convertToNoDocument(at.min());
         }));
     }
     keys() {
@@ -6165,7 +6165,7 @@ function ii(t, e) {
  */
 /**
  * An immutable set of metadata that the local store tracks for each target.
- */ class ai {
+ */ class ci {
     constructor(
     /** The target being listened to. */
     t, 
@@ -6182,11 +6182,11 @@ function ii(t, e) {
      */
     s, 
     /** The latest snapshot version seen for this target. */
-    i = ct.min()
+    i = at.min()
     /**
      * The maximum snapshot version at which the associated view
      * contained no limbo documents.
-     */ , r = ct.min()
+     */ , r = at.min()
     /**
      * An opaque, server-assigned token that allows watching a target to be
      * resumed after disconnecting without retransmitting all the data that
@@ -6197,19 +6197,19 @@ function ii(t, e) {
         this.lastLimboFreeSnapshotVersion = r, this.resumeToken = o;
     }
     /** Creates a new target data instance with an updated sequence number. */    withSequenceNumber(t) {
-        return new ai(this.target, this.targetId, this.purpose, t, this.snapshotVersion, this.lastLimboFreeSnapshotVersion, this.resumeToken);
+        return new ci(this.target, this.targetId, this.purpose, t, this.snapshotVersion, this.lastLimboFreeSnapshotVersion, this.resumeToken);
     }
     /**
      * Creates a new target data instance with an updated resume token and
      * snapshot version.
      */    withResumeToken(t, e) {
-        return new ai(this.target, this.targetId, this.purpose, this.sequenceNumber, e, this.lastLimboFreeSnapshotVersion, t);
+        return new ci(this.target, this.targetId, this.purpose, this.sequenceNumber, e, this.lastLimboFreeSnapshotVersion, t);
     }
     /**
      * Creates a new target data instance with an updated last limbo free
      * snapshot version number.
      */    withLastLimboFreeSnapshotVersion(t) {
-        return new ai(this.target, this.targetId, this.purpose, this.sequenceNumber, this.snapshotVersion, t, this.resumeToken);
+        return new ci(this.target, this.targetId, this.purpose, this.sequenceNumber, this.snapshotVersion, t, this.resumeToken);
     }
 }
 
@@ -6229,7 +6229,7 @@ function ii(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Serializer for values stored in the LocalStore. */ class ci {
+/** Serializer for values stored in the LocalStore. */ class ai {
     constructor(t) {
         this.Gt = t;
     }
@@ -6284,8 +6284,8 @@ function li(t) {
 }
 
 function fi(t) {
-    const e = new at(t[0], t[1]);
-    return ct.fromTimestamp(e);
+    const e = new ct(t[0], t[1]);
+    return at.fromTimestamp(e);
 }
 
 function di(t) {
@@ -6294,14 +6294,14 @@ function di(t) {
 }
 
 function wi(t) {
-    const e = new at(t.seconds, t.nanoseconds);
-    return ct.fromTimestamp(e);
+    const e = new ct(t.seconds, t.nanoseconds);
+    return at.fromTimestamp(e);
 }
 
 /** Encodes a batch of mutations into a DbMutationBatch for local storage. */
 /** Decodes a DbMutationBatch into a MutationBatch */
 function _i(t, e) {
-    const n = (e.baseMutations || []).map((e => as(t.Gt, e)));
+    const n = (e.baseMutations || []).map((e => cs(t.Gt, e)));
     // Squash old transform mutations into existing patch or set mutations.
     // The replacement of representing `transforms` with `update_transforms`
     // on the SDK means that old `transform` mutations stored in IndexedDB need
@@ -6315,18 +6315,18 @@ function _i(t, e) {
             ++t;
         }
     }
-    const s = e.mutations.map((e => as(t.Gt, e))), i = at.fromMillis(e.localWriteTimeMs);
+    const s = e.mutations.map((e => cs(t.Gt, e))), i = ct.fromMillis(e.localWriteTimeMs);
     return new ri(e.batchId, i, n, s);
 }
 
 /** Decodes a DbTarget into TargetData */ function mi(t) {
-    const e = wi(t.readTime), n = void 0 !== t.lastLimboFreeSnapshotVersion ? wi(t.lastLimboFreeSnapshotVersion) : ct.min();
+    const e = wi(t.readTime), n = void 0 !== t.lastLimboFreeSnapshotVersion ? wi(t.lastLimboFreeSnapshotVersion) : at.min();
     let s;
     var i;
     return void 0 !== t.query.documents ? (B(1 === (i = t.query).documents.length), 
     s = Re(ge(Zn(i.documents[0])))) : s = function(t) {
         return Re(ls(t));
-    }(t.query), new ai(s, t.targetId, 0 /* Listen */ , t.lastListenSequenceNumber, e, n, yt.fromBase64String(t.resumeToken));
+    }(t.query), new ci(s, t.targetId, 0 /* Listen */ , t.lastListenSequenceNumber, e, n, yt.fromBase64String(t.resumeToken));
 }
 
 /** Encodes TargetData into a DbTarget for storage locally. */ function gi(t, e) {
@@ -6616,12 +6616,12 @@ class vi {
  */
 function Vi(t, e, n) {
     const s = t.store(Cs.store), i = t.store(Ns.store), r = [], o = IDBKeyRange.only(n.batchId);
-    let a = 0;
-    const c = s.jt({
+    let c = 0;
+    const a = s.jt({
         range: o
-    }, ((t, e, n) => (a++, n.delete())));
-    r.push(c.next((() => {
-        B(1 === a);
+    }, ((t, e, n) => (c++, n.delete())));
+    r.push(a.next((() => {
+        B(1 === c);
     })));
     const u = [];
     for (const t of n.mutations) {
@@ -6721,20 +6721,20 @@ class Di {
         // eslint-disable-next-line @typescript-eslint/no-explicit-any
         return r.add({}).next((o => {
             B("number" == typeof o);
-            const a = new ri(o, e, n, s), c = function(t, e, n) {
+            const c = new ri(o, e, n, s), a = function(t, e, n) {
                 const s = n.baseMutations.map((e => os(t.Gt, e))), i = n.mutations.map((e => os(t.Gt, e)));
                 return new Cs(e, n.batchId, n.localWriteTime.toMillis(), s, i);
-            }(this.k, this.userId, a), u = [];
+            }(this.k, this.userId, c), u = [];
             let h = new Tn(((t, e) => it(t.canonicalString(), e.canonicalString())));
             for (const t of s) {
                 const e = Ns.key(this.userId, t.key.path, o);
-                h = h.add(t.key.path.popLast()), u.push(r.put(c)), u.push(i.put(e, Ns.PLACEHOLDER));
+                h = h.add(t.key.path.popLast()), u.push(r.put(a)), u.push(i.put(e, Ns.PLACEHOLDER));
             }
             return h.forEach((e => {
                 u.push(this.Jt.addToCollectionParentIndex(t, e));
             })), t.addOnCommittedListener((() => {
-                this.Yt[o] = a.keys();
-            })), Gs.waitFor(u).next((() => a));
+                this.Yt[o] = c.keys();
+            })), Gs.waitFor(u).next((() => c));
         }));
     }
     lookupMutationBatch(t, e) {
@@ -6788,7 +6788,7 @@ class Di {
         return ki(t).jt({
             range: s
         }, ((n, s, r) => {
-            const [o, a, c] = n, u = vs(a);
+            const [o, c, a] = n, u = vs(c);
             // Only consider rows matching exactly the specific key of
             // interest. Note that because we order by path first, and we
             // order terminators before path separators, we'll encounter all
@@ -6798,7 +6798,7 @@ class Di {
             // can stop as soon as we hit any such row.
                         if (o === this.userId && e.path.isEqual(u)) 
             // Look up the mutation batch in the store.
-            return Ni(t).get(c).next((t => {
+            return Ni(t).get(a).next((t => {
                 if (!t) throw L();
                 B(t.userId === this.userId), i.push(_i(this.k, t));
             }));
@@ -6812,7 +6812,7 @@ class Di {
             const i = Ns.prefixForPath(this.userId, e.path), r = IDBKeyRange.lowerBound(i), o = ki(t).jt({
                 range: r
             }, ((t, s, i) => {
-                const [r, o, a] = t, c = vs(o);
+                const [r, o, c] = t, a = vs(o);
                 // Only consider rows matching exactly the specific key of
                 // interest. Note that because we order by path first, and we
                 // order terminators before path separators, we'll encounter all
@@ -6820,7 +6820,7 @@ class Di {
                 // the rows for documentKey will occur before any rows for
                 // documents nested in a subcollection beneath documentKey so we
                 // can stop as soon as we hit any such row.
-                                r === this.userId && e.path.isEqual(c) ? n = n.add(a) : i.done();
+                                r === this.userId && e.path.isEqual(a) ? n = n.add(c) : i.done();
             }));
             s.push(o);
         })), Gs.waitFor(s).next((() => this.te(t, n)));
@@ -6834,14 +6834,14 @@ class Di {
         return ki(t).jt({
             range: r
         }, ((t, e, i) => {
-            const [r, a, c] = t, u = vs(a);
+            const [r, c, a] = t, u = vs(c);
             r === this.userId && n.isPrefixOf(u) ? 
             // Rows with document keys more than one segment longer than the
             // query path can't be matches. For example, a query on 'rooms'
             // can't match the document /rooms/abc/messages/xyx.
             // TODO(mcg): we'll need a different scanner when we implement
             // ancestor queries.
-            u.length === s && (o = o.add(c)) : i.done();
+            u.length === s && (o = o.add(a)) : i.done();
         })).next((() => this.te(t, o)));
     }
     te(t, e) {
@@ -6910,8 +6910,8 @@ class Di {
         range: r,
         Kt: !0
     }, ((t, n, s) => {
-        const [r, a, /*batchID*/ c] = t;
-        r === e && a === i && (o = !0), s.done();
+        const [r, c, /*batchID*/ a] = t;
+        r === e && c === i && (o = !0), s.done();
     })).next((() => o));
 }
 
@@ -7014,29 +7014,29 @@ class $i {
     allocateTargetId(t) {
         return this.oe(t).next((e => {
             const n = new $i(e.highestTargetId);
-            return e.highestTargetId = n.next(), this.ae(t, e).next((() => e.highestTargetId));
+            return e.highestTargetId = n.next(), this.ce(t, e).next((() => e.highestTargetId));
         }));
     }
     getLastRemoteSnapshotVersion(t) {
-        return this.oe(t).next((t => ct.fromTimestamp(new at(t.lastRemoteSnapshotVersion.seconds, t.lastRemoteSnapshotVersion.nanoseconds))));
+        return this.oe(t).next((t => at.fromTimestamp(new ct(t.lastRemoteSnapshotVersion.seconds, t.lastRemoteSnapshotVersion.nanoseconds))));
     }
     getHighestSequenceNumber(t) {
         return this.oe(t).next((t => t.highestListenSequenceNumber));
     }
     setTargetsMetadata(t, e, n) {
         return this.oe(t).next((s => (s.highestListenSequenceNumber = e, n && (s.lastRemoteSnapshotVersion = n.toTimestamp()), 
-        e > s.highestListenSequenceNumber && (s.highestListenSequenceNumber = e), this.ae(t, s))));
+        e > s.highestListenSequenceNumber && (s.highestListenSequenceNumber = e), this.ce(t, s))));
     }
     addTargetData(t, e) {
-        return this.ce(t, e).next((() => this.oe(t).next((n => (n.targetCount += 1, this.ue(e, n), 
-        this.ae(t, n))))));
+        return this.ae(t, e).next((() => this.oe(t).next((n => (n.targetCount += 1, this.ue(e, n), 
+        this.ce(t, n))))));
     }
     updateTargetData(t, e) {
-        return this.ce(t, e);
+        return this.ae(t, e);
     }
     removeTargetData(t, e) {
         return this.removeMatchingKeysForTargetId(t, e.targetId).next((() => Oi(t).delete(e.targetId))).next((() => this.oe(t))).next((e => (B(e.targetCount > 0), 
-        e.targetCount -= 1, this.ae(t, e))));
+        e.targetCount -= 1, this.ce(t, e))));
     }
     /**
      * Drops any targets with sequence number less than or equal to the upper bound, excepting those
@@ -7046,8 +7046,8 @@ class $i {
         let s = 0;
         const i = [];
         return Oi(t).jt(((r, o) => {
-            const a = mi(o);
-            a.sequenceNumber <= e && null === n.get(a.targetId) && (s++, i.push(this.removeTargetData(t, a)));
+            const c = mi(o);
+            c.sequenceNumber <= e && null === n.get(c.targetId) && (s++, i.push(this.removeTargetData(t, c)));
         })).next((() => Gs.waitFor(i))).next((() => s));
     }
     /**
@@ -7061,10 +7061,10 @@ class $i {
     oe(t) {
         return Mi(t).get(Ls.key).next((t => (B(null !== t), t)));
     }
-    ae(t, e) {
+    ce(t, e) {
         return Mi(t).put(Ls.key, e);
     }
-    ce(t, e) {
+    ae(t, e) {
         return Oi(t).put(gi(this.k, e));
     }
     /**
@@ -7316,16 +7316,16 @@ class $i {
         return this.ge.getCacheSize(t);
     }
     Te(t, e) {
-        let n, s, i, r, o, c, u;
+        let n, s, i, r, o, a, u;
         const h = Date.now();
         return this.calculateTargetCount(t, this.params.percentileToCollect).next((e => (
         // Cap at the configured max
         e > this.params.maximumSequenceNumbersToCollect ? ($("LruGarbageCollector", `Capping sequence numbers to collect down to the maximum of ${this.params.maximumSequenceNumbersToCollect} from ${e}`), 
         s = this.params.maximumSequenceNumbersToCollect) : s = e, r = Date.now(), this.nthSequenceNumber(t, s)))).next((s => (n = s, 
-        o = Date.now(), this.removeTargets(t, n, e)))).next((e => (i = e, c = Date.now(), 
+        o = Date.now(), this.removeTargets(t, n, e)))).next((e => (i = e, a = Date.now(), 
         this.removeOrphanedDocuments(t, n)))).next((t => {
             if (u = Date.now(), k() <= LogLevel.DEBUG) {
-                $("LruGarbageCollector", `LRU Garbage Collection\n\tCounted targets in ${r - h}ms\n\tDetermined least recently used ${s} in ` + (o - r) + "ms\n" + `\tRemoved ${i} targets in ` + (c - o) + "ms\n" + `\tRemoved ${t} documents in ` + (u - c) + "ms\n" + `Total Duration: ${u - h}ms`);
+                $("LruGarbageCollector", `LRU Garbage Collection\n\tCounted targets in ${r - h}ms\n\tDetermined least recently used ${s} in ` + (o - r) + "ms\n" + `\tRemoved ${i} targets in ` + (a - o) + "ms\n" + `\tRemoved ${t} documents in ` + (u - a) + "ms\n" + `Total Duration: ${u - h}ms`);
             }
             return Gs.resolve({
                 didRun: !0,
@@ -7569,7 +7569,7 @@ function Wi(t, e) {
     }
     getReadTime(t) {
         const e = this.changes.get(t);
-        return e ? e.readTime : ct.min();
+        return e ? e.readTime : at.min();
     }
     /**
      * Buffers a `RemoteDocumentCache.addEntry()` call.
@@ -7742,7 +7742,7 @@ function Wi(t, e) {
     getDocumentsMatchingQuery(t, e, n) {
         let s = An();
         const i = e.path.length + 1, r = {};
-        if (n.isEqual(ct.min())) {
+        if (n.isEqual(at.min())) {
             // Documents are ordered by key, so we can use a prefix scan to narrow
             // down the documents we need to match the query against.
             const t = e.path.toArray();
@@ -7786,7 +7786,7 @@ function Wi(t, e) {
             const t = ui(this.k, e);
             // Whether the document is a sentinel removal and should only be used in the
             // `getNewDocumentChanges()`
-                        if (!(t.isNoDocument() && t.version.isEqual(ct.min()))) return t;
+                        if (!(t.isNoDocument() && t.version.isEqual(at.min()))) return t;
         }
         return Wt.newInvalidDocument(t);
     }
@@ -7822,16 +7822,16 @@ class Ji extends zi {
         return this.changes.forEach(((i, r) => {
             const o = this.Ce.get(i);
             if (r.document.isValidDocument()) {
-                const a = hi(this.De.k, r.document, this.getReadTime(i));
+                const c = hi(this.De.k, r.document, this.getReadTime(i));
                 s = s.add(i.path.popLast());
-                const c = Si(a);
-                n += c - o, e.push(this.De.addEntry(t, i, a));
+                const a = Si(c);
+                n += a - o, e.push(this.De.addEntry(t, i, c));
             } else if (n -= o, this.trackRemovals) {
                 // In order to track removals, we store a "sentinel delete" in the
                 // RemoteDocumentCache. This entry is represented by a NoDocument
                 // with a version of 0 and ignored by `maybeDecodeDocument()` but
                 // preserved in `getNewDocumentChanges()`.
-                const n = hi(this.De.k, Wt.newNoDocument(i, ct.min()), this.getReadTime(i));
+                const n = hi(this.De.k, Wt.newNoDocument(i, at.min()), this.getReadTime(i));
                 e.push(this.De.addEntry(t, i, n));
             } else e.push(this.De.removeEntry(t, i));
         })), s.forEach((n => {
@@ -7934,7 +7934,7 @@ function Zi(t) {
         function(t) {
             const e = t.store(Ls.store), n = new Ls(
             /*highestTargetId=*/ 0, 
-            /*lastListenSequenceNumber=*/ 0, ct.min().toTimestamp(), 
+            /*lastListenSequenceNumber=*/ 0, at.min().toTimestamp(), 
             /*targetCount=*/ 0);
             return e.put(Ls.key, n);
         }
@@ -8155,14 +8155,14 @@ class sr {
      * Whether to synchronize the in-memory state of multiple tabs and share
      * access to local persistence.
      */
-    t, e, n, s, i, r, o, a, c, 
+    t, e, n, s, i, r, o, c, a, 
     /**
      * If set to true, forcefully obtains database access. Existing tabs will
      * no longer be able to access IndexedDB.
      */
     u) {
         if (this.allowTabSynchronization = t, this.persistenceKey = e, this.clientId = n, 
-        this.Oe = i, this.window = r, this.document = o, this.Me = c, this.Le = u, this.Be = null, 
+        this.Oe = i, this.window = r, this.document = o, this.Me = a, this.Le = u, this.Be = null, 
         this.Ue = !1, this.isPrimary = !1, this.networkEnabled = !0, 
         /** Our window.unload handler, if registered. */
         this.qe = null, this.inForeground = !1, 
@@ -8174,7 +8174,7 @@ class sr {
         this.Qe = Number.NEGATIVE_INFINITY, 
         /** A listener to notify on primary state changes. */
         this.We = t => Promise.resolve(), !sr.bt()) throw new j(K.UNIMPLEMENTED, "This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.");
-        this.referenceDelegate = new Qi(this, s), this.Ge = e + "main", this.k = new ci(a), 
+        this.referenceDelegate = new Qi(this, s), this.Ge = e + "main", this.k = new ai(c), 
         this.ze = new Hs(this.Ge, 11, new tr(this.k)), this.He = new Fi(this.referenceDelegate, this.k), 
         this.Jt = new Ri, this.Je = function(t, e) {
             return new Hi(t, e);
@@ -8252,7 +8252,7 @@ class sr {
             if (this.isPrimary) return this.rn(t).next((t => {
                 t || (this.isPrimary = !1, this.Oe.enqueueRetryable((() => this.We(!1))));
             }));
-        })).next((() => this.on(t))).next((e => this.isPrimary && !e ? this.an(t).next((() => !1)) : !!e && this.cn(t).next((() => !0)))))).catch((t => {
+        })).next((() => this.on(t))).next((e => this.isPrimary && !e ? this.cn(t).next((() => !1)) : !!e && this.an(t).next((() => !0)))))).catch((t => {
             if (Xs(t)) 
             // Proceed with the existing state. Any subsequent access to
             // IndexedDB will verify the lease.
@@ -8358,7 +8358,7 @@ class sr {
         // has obtained the primary lease.
         await this.ze.runTransaction("shutdown", "readwrite", [ Ss.store, Us.store ], (t => {
             const e = new si(t, et.I);
-            return this.an(e).next((() => this.hn(e)));
+            return this.cn(e).next((() => this.hn(e)));
         })), this.ze.close(), 
         // Remove the entry marking the client as zombied from LocalStorage since
         // we successfully deleted its metadata from IndexedDb.
@@ -8408,7 +8408,7 @@ class sr {
             if (!e) throw F(`Failed to obtain primary lease for action '${t}'.`), this.isPrimary = !1, 
             this.Oe.enqueueRetryable((() => this.We(!1))), new j(K.FAILED_PRECONDITION, Qs);
             return n(i);
-        })).next((t => this.cn(i).next((() => t)))) : this.En(i).next((() => n(i)))))).then((t => (i.raiseOnCommittedEvent(), 
+        })).next((t => this.an(i).next((() => t)))) : this.En(i).next((() => n(i)))))).then((t => (i.raiseOnCommittedEvent(), 
         t)));
     }
     /**
@@ -8425,14 +8425,14 @@ class sr {
     /**
      * Obtains or extends the new primary lease for the local client. This
      * method does not verify that the client is eligible for this lease.
-     */    cn(t) {
+     */    an(t) {
         const e = new Ss(this.clientId, this.allowTabSynchronization, Date.now());
         return ir(t).put(Ss.key, e);
     }
     static bt() {
         return Hs.bt();
     }
-    /** Checks the primary lease and removes it if we are the current primary. */    an(t) {
+    /** Checks the primary lease and removes it if we are the current primary. */    cn(t) {
         const e = ir(t);
         return e.get(Ss.key).next((t => this.un(t) ? ($("IndexedDbPersistence", "Releasing primary lease."), 
         e.delete(Ss.key)) : Gs.resolve()));
@@ -8556,7 +8556,7 @@ class sr {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-class ar {
+class cr {
     constructor(t, e) {
         this.progress = t, this.In = e;
     }
@@ -8583,7 +8583,7 @@ class ar {
  * have a cached version in remoteDocumentCache or local mutations for the
  * document). The view is computed by applying the mutations in the
  * MutationQueue to the RemoteDocumentCache.
- */ class cr {
+ */ class ar {
     constructor(t, e, n) {
         this.Je = t, this.An = e, this.Jt = n;
     }
@@ -8777,7 +8777,7 @@ class ar {
         // collection, rather than to perform individual lookups.
         return function(t) {
             return 0 === t.filters.length && null === t.limit && null == t.startAt && null == t.endAt && (0 === t.explicitOrderBy.length || 1 === t.explicitOrderBy.length && t.explicitOrderBy[0].field.isKeyField());
-        }(e) || n.isEqual(ct.min()) ? this.Mn(t, e) : this.On.vn(t, s).next((i => {
+        }(e) || n.isEqual(at.min()) ? this.Mn(t, e) : this.On.vn(t, s).next((i => {
             const r = this.Ln(e, i);
             return (ye(e) || pe(e)) && this.Bn(e.limitType, r, s, n) ? this.Mn(t, e) : (k() <= LogLevel.DEBUG && $("QueryEngine", "Re-using previous result from %s to execute query: %s", n.toString(), Ve(e)), 
             this.On.getDocumentsMatchingQuery(t, e, n).next((t => (
@@ -8826,7 +8826,7 @@ class ar {
     }
     Mn(t, e) {
         return k() <= LogLevel.DEBUG && $("QueryEngine", "Using full collection scan to execute query:", Ve(e)), 
-        this.On.getDocumentsMatchingQuery(t, e, ct.min());
+        this.On.getDocumentsMatchingQuery(t, e, at.min());
     }
 }
 
@@ -8874,8 +8874,8 @@ class lr {
          *
          * PORTING NOTE: This is only used for multi-tab synchronization.
          */
-        this.jn = ct.min(), this.An = t.getMutationQueue(n), this.Qn = t.getRemoteDocumentCache(), 
-        this.He = t.getTargetCache(), this.Wn = new cr(this.Qn, this.An, this.persistence.getIndexManager()), 
+        this.jn = at.min(), this.An = t.getMutationQueue(n), this.Qn = t.getRemoteDocumentCache(), 
+        this.He = t.getTargetCache(), this.Wn = new ar(this.Qn, this.An, this.persistence.getIndexManager()), 
         this.Ye = t.getBundleCache(), this.Un.Fn(this.Wn);
     }
     collectGarbage(t) {
@@ -8907,7 +8907,7 @@ async function dr(t, e) {
         return n.An.getAllMutationBatches(t).next((o => (r = o, s = n.persistence.getMutationQueue(e), 
         // Recreate our LocalDocumentsView using the new
         // MutationQueue.
-        i = new cr(n.Qn, s, n.persistence.getIndexManager()), s.getAllMutationBatches(t)))).next((e => {
+        i = new ar(n.Qn, s, n.persistence.getIndexManager()), s.getAllMutationBatches(t)))).next((e => {
             const n = [], s = [];
             // Union the old/new changed keys.
             let o = Sn();
@@ -9005,16 +9005,16 @@ function _r(t) {
                 i = n.qn;
         const o = [];
         e.targetChanges.forEach(((e, r) => {
-            const a = i.get(r);
-            if (!a) return;
+            const c = i.get(r);
+            if (!c) return;
             // Only update the remote keys if the target is still active. This
             // ensures that we can persist the updated target data along with
             // the updated assignment.
                         o.push(n.He.removeMatchingKeys(t, e.removedDocuments, r).next((() => n.He.addMatchingKeys(t, e.addedDocuments, r))));
-            const c = e.resumeToken;
+            const a = e.resumeToken;
             // Update the resume token if the change includes one.
-                        if (c.approximateByteSize() > 0) {
-                const u = a.withResumeToken(c, s).withSequenceNumber(t.currentSequenceNumber);
+                        if (a.approximateByteSize() > 0) {
+                const u = c.withResumeToken(a, s).withSequenceNumber(t.currentSequenceNumber);
                 i = i.insert(r, u), 
                 // Update the target data if there are target changes (or if
                 // sufficient time has passed since the last update).
@@ -9047,10 +9047,10 @@ function _r(t) {
                 }
                 /**
  * Notifies local store of the changed views to locally pin documents.
- */ (a, u, e) && o.push(n.He.updateTargetData(t, u));
+ */ (c, u, e) && o.push(n.He.updateTargetData(t, u));
             }
         }));
-        let a = An();
+        let c = An();
         // HACK: The only reason we allow a null snapshot version is so that we
         // can synthesize remote events when we get permission denied errors while
         // trying to resolve the state of a locally cached document that is in
@@ -9061,12 +9061,12 @@ function _r(t) {
         // Each loop iteration only affects its "own" doc, so it's safe to get all the remote
         // documents in advance in a single call.
         o.push(gr(t, r, e.documentUpdates, s, void 0).next((t => {
-            a = t;
-        }))), !s.isEqual(ct.min())) {
+            c = t;
+        }))), !s.isEqual(at.min())) {
             const e = n.He.getLastRemoteSnapshotVersion(t).next((e => n.He.setTargetsMetadata(t, t.currentSequenceNumber, s)));
             o.push(e);
         }
-        return Gs.waitFor(o).next((() => r.apply(t))).next((() => n.Wn.Vn(t, a))).next((() => a));
+        return Gs.waitFor(o).next((() => r.apply(t))).next((() => n.Wn.Vn(t, c))).next((() => c));
     })).then((t => (n.qn = i, t)));
 }
 
@@ -9093,17 +9093,17 @@ i) {
     return n.forEach((t => r = r.add(t))), e.getEntries(t, r).next((t => {
         let r = An();
         return n.forEach(((n, o) => {
-            const a = t.get(n), c = (null == i ? void 0 : i.get(n)) || s;
+            const c = t.get(n), a = (null == i ? void 0 : i.get(n)) || s;
             // Note: The order of the steps below is important, since we want
             // to ensure that rejected limbo resolutions (which fabricate
             // NoDocuments with SnapshotVersion.min()) never add documents to
             // cache.
-            o.isNoDocument() && o.version.isEqual(ct.min()) ? (
+            o.isNoDocument() && o.version.isEqual(at.min()) ? (
             // NoDocuments with SnapshotVersion.min() are used in manufactured
             // events. We remove these documents from cache since we lost
             // access.
-            e.removeEntry(n, c), r = r.insert(n, o)) : !a.isValidDocument() || o.version.compareTo(a.version) > 0 || 0 === o.version.compareTo(a.version) && a.hasPendingWrites ? (e.addEntry(o, c), 
-            r = r.insert(n, o)) : $("LocalStore", "Ignoring outdated watch update for ", n, ". Current version:", a.version, " Watch version:", o.version);
+            e.removeEntry(n, a), r = r.insert(n, o)) : !c.isValidDocument() || o.version.compareTo(c.version) > 0 || 0 === o.version.compareTo(c.version) && c.hasPendingWrites ? (e.addEntry(o, a), 
+            r = r.insert(n, o)) : $("LocalStore", "Ignoring outdated watch update for ", n, ". Current version:", c.version, " Watch version:", o.version);
         })), r;
     }));
 }
@@ -9140,7 +9140,7 @@ function pr(t, e) {
         // This target has been listened to previously, so reuse the
         // previous targetID.
         // TODO(mcg): freshen last accessed date?
-        s = i, Gs.resolve(s)) : n.He.allocateTargetId(t).next((i => (s = new ai(e, i, 0 /* Listen */ , t.currentSequenceNumber), 
+        s = i, Gs.resolve(s)) : n.He.allocateTargetId(t).next((i => (s = new ci(e, i, 0 /* Listen */ , t.currentSequenceNumber), 
         n.He.addTargetData(t, s).next((() => s)))))));
     })).then((t => {
         // If Multi-Tab is enabled, the existing target data may be newer than
@@ -9189,7 +9189,7 @@ async function Tr(t, e, n) {
  * be used to optimize this query execution.
  */ function Er(t, e, n) {
     const s = q(t);
-    let i = ct.min(), r = Sn();
+    let i = at.min(), r = Sn();
     return s.persistence.runTransaction("Execute query", "readonly", (t => function(t, e, n) {
         const s = q(t), i = s.Kn.get(n);
         return void 0 !== i ? Gs.resolve(s.qn.get(i)) : s.He.getTargetData(e, n);
@@ -9197,7 +9197,7 @@ async function Tr(t, e, n) {
         if (e) return i = e.lastLimboFreeSnapshotVersion, s.He.getMatchingKeysForTargetId(t, e.targetId).next((t => {
             r = t;
         }));
-    })).next((() => s.Un.getDocumentsMatchingQuery(t, e, n ? i : ct.min(), n ? r : Sn()))).next((t => ({
+    })).next((() => s.Un.getDocumentsMatchingQuery(t, e, n ? i : at.min(), n ? r : Sn()))).next((t => ({
         documents: t,
         zn: r
     })))));
@@ -9221,10 +9221,10 @@ function Ar(t) {
     return e.persistence.runTransaction("Get new document changes", "readonly", (t => function(t, e, n) {
         const s = q(t);
         let i = An(), r = li(n);
-        const o = Xi(e), a = IDBKeyRange.lowerBound(r, !0);
+        const o = Xi(e), c = IDBKeyRange.lowerBound(r, !0);
         return o.jt({
             index: $s.readTimeIndex,
-            range: a
+            range: c
         }, ((t, e) => {
             // Unlike `getEntry()` and others, `getNewDocumentChanges()` parses
             // the documents directly since we want to keep sentinel deletes.
@@ -9254,7 +9254,7 @@ async function Rr(t) {
     return e.persistence.runTransaction("Synchronize last document change read time", "readonly", (t => function(t) {
         const e = Xi(t);
         // If there are no existing entries, we return SnapshotVersion.min().
-                let n = ct.min();
+                let n = at.min();
         return e.jt({
             index: $s.readTimeIndex,
             reverse: !0
@@ -9281,12 +9281,12 @@ async function Rr(t) {
  */
 async function Pr(t, e, n, s) {
     const i = q(t);
-    let r = Sn(), o = An(), a = vn();
+    let r = Sn(), o = An(), c = vn();
     for (const t of n) {
         const n = e.Hn(t.metadata.name);
-        t.document && (r = r.add(n)), o = o.insert(n, e.Jn(t)), a = a.insert(n, e.Yn(t.metadata.readTime));
+        t.document && (r = r.add(n)), o = o.insert(n, e.Jn(t)), c = c.insert(n, e.Yn(t.metadata.readTime));
     }
-    const c = i.Qn.newChangeBuffer({
+    const a = i.Qn.newChangeBuffer({
         trackRemovals: !0
     }), u = await pr(i, function(t) {
         // It is OK that the path used for the query is not valid, because this will
@@ -9295,7 +9295,7 @@ async function Pr(t, e, n, s) {
     }(s));
     // Allocates a target to hold all document keys from the bundle, such that
     // they will not get garbage collected right away.
-        return i.persistence.runTransaction("Apply bundle documents", "readwrite", (t => gr(t, c, o, ct.min(), a).next((e => (c.apply(t), 
+        return i.persistence.runTransaction("Apply bundle documents", "readwrite", (t => gr(t, a, o, at.min(), c).next((e => (a.apply(t), 
     e))).next((e => i.He.removeMatchingKeysForTargetId(t, u.targetId).next((() => i.He.addMatchingKeys(t, r, u.targetId))).next((() => i.Wn.Vn(t, e))).next((() => e))))));
 }
 
@@ -9771,7 +9771,7 @@ class Nr extends zi {
          */
         this.Is = new Gi((t => Ht(t)), Yt), 
         /** The last received snapshot version. */
-        this.lastRemoteSnapshotVersion = ct.min(), 
+        this.lastRemoteSnapshotVersion = at.min(), 
         /** The highest numbered target ID encountered. */
         this.highestTargetId = 0, 
         /** The highest sequence number encountered. */
@@ -9798,16 +9798,16 @@ class Nr extends zi {
         return n && (this.lastRemoteSnapshotVersion = n), e > this.As && (this.As = e), 
         Gs.resolve();
     }
-    ce(t) {
+    ae(t) {
         this.Is.set(t.target, t);
         const e = t.targetId;
         e > this.highestTargetId && (this.Ps = new $i(e), this.highestTargetId = e), t.sequenceNumber > this.As && (this.As = t.sequenceNumber);
     }
     addTargetData(t, e) {
-        return this.ce(e), this.targetCount += 1, Gs.resolve();
+        return this.ae(e), this.targetCount += 1, Gs.resolve();
     }
     updateTargetData(t, e) {
-        return this.ce(e), Gs.resolve();
+        return this.ae(e), Gs.resolve();
     }
     removeTargetData(t, e) {
         return this.Is.delete(e.target), this.Rs.us(e.targetId), this.targetCount -= 1, 
@@ -9882,7 +9882,7 @@ class xr {
         this.He = new kr(this);
         this.Jt = new Ii, this.Je = function(t, e) {
             return new Cr(t, e);
-        }(this.Jt, (t => this.referenceDelegate.vs(t))), this.k = new ci(e), this.Ye = new vr(this.k);
+        }(this.Jt, (t => this.referenceDelegate.vs(t))), this.k = new ai(e), this.Ye = new vr(this.k);
     }
     start() {
         return Promise.resolve();
@@ -10324,7 +10324,7 @@ class jr {
         this.oi(t);
     }
     notifyBundleLoaded() {
-        this.ai();
+        this.ci();
     }
     shutdown() {
         this.started && (this.window.removeEventListener("storage", this.Us), this.removeItem(this.Qs), 
@@ -10350,7 +10350,7 @@ class jr {
                 if (this.started) {
                     if (null !== e.key) if (this.Gs.test(e.key)) {
                         if (null == e.newValue) {
-                            const t = this.ci(e.key);
+                            const t = this.ai(e.key);
                             return this.ui(t, null);
                         }
                         {
@@ -10419,13 +10419,13 @@ class jr {
         const s = Lr(this.persistenceKey, t), i = new Ur(t, e, n);
         this.setItem(s, i.Os());
     }
-    ai() {
+    ci() {
         this.setItem(this.Ys, "value-not-used");
     }
     /**
      * Parses a client state key in WebStorage. Returns null if the key does not
      * match the expected key format.
-     */    ci(t) {
+     */    ai(t) {
         const e = this.Gs.exec(t);
         return e ? e[1] : null;
     }
@@ -10433,7 +10433,7 @@ class jr {
      * Parses a client state in WebStorage. Returns 'null' if the value could not
      * be parsed.
      */    hi(t, e) {
-        const n = this.ci(t);
+        const n = this.ai(t);
         return qr.Fs(n, e);
     }
     /**
@@ -10789,8 +10789,8 @@ class {
                     $("Connection", 'RPC "' + t + '" completed.');
                 }
             }));
-            const a = JSON.stringify(s);
-            o.send(e, "POST", a, n, 15);
+            const c = JSON.stringify(s);
+            o.send(e, "POST", c, n, 15);
         }));
     }
     Qi(t, e, n) {
@@ -10835,9 +10835,9 @@ class {
         // known to (sometimes) not include an Origin. See
         // https://github.com/firebase/firebase-js-sdk/issues/1491.
         isMobileCordova() || isReactNative() || isElectron() || isIE() || isUWP() || isBrowserExtension() || (o.httpHeadersOverwriteParam = "$httpHeaders");
-        const a = s.join("");
-        $("Connection", "Creating WebChannel: " + a, o);
-        const c = i.createWebChannel(a, o);
+        const c = s.join("");
+        $("Connection", "Creating WebChannel: " + c, o);
+        const a = i.createWebChannel(c, o);
         // WebChannel supports sending the first message with the handshake - saving
         // a network round trip. However, it will have to call send in the same
         // JS event loop as open. In order to enforce this, we delay actually
@@ -10850,9 +10850,9 @@ class {
                 const g = new Jr({
             Vi: t => {
                 h ? $("Connection", "Not sending because WebChannel is closed:", t) : (u || ($("Connection", "Opening WebChannel transport."), 
-                c.open(), u = !0), $("Connection", "WebChannel sending:", t), c.send(t));
+                a.open(), u = !0), $("Connection", "WebChannel sending:", t), a.send(t));
             },
-            Si: () => c.close()
+            Si: () => a.close()
         }), y = (t, e, n) => {
             // TODO(dimond): closure typing seems broken because WebChannel does
             // not implement goog.events.Listenable
@@ -10870,13 +10870,13 @@ class {
         // exception and rethrow using a setTimeout so they become visible again.
         // Note that eventually this function could go away if we are confident
         // enough the code is exception free.
-                return y(c, WebChannel.EventType.OPEN, (() => {
+                return y(a, WebChannel.EventType.OPEN, (() => {
             h || $("Connection", "WebChannel transport opened.");
-        })), y(c, WebChannel.EventType.CLOSE, (() => {
+        })), y(a, WebChannel.EventType.CLOSE, (() => {
             h || (h = !0, $("Connection", "WebChannel transport closed"), g.Fi());
-        })), y(c, WebChannel.EventType.ERROR, (t => {
+        })), y(a, WebChannel.EventType.ERROR, (t => {
             h || (h = !0, O("Connection", "WebChannel transport errored:", t), g.Fi(new j(K.UNAVAILABLE, "The operation could not be completed")));
-        })), y(c, WebChannel.EventType.MESSAGE, (t => {
+        })), y(a, WebChannel.EventType.MESSAGE, (t => {
             var e;
             if (!h) {
                 const n = t.data[0];
@@ -10906,7 +10906,7 @@ class {
                     }(t), n = i.message;
                     void 0 === e && (e = K.INTERNAL, n = "Unknown error status: " + t + " with message " + i.message), 
                     // Mark closed so no further events are propagated
-                    h = !0, g.Fi(new j(e, n)), c.close();
+                    h = !0, g.Fi(new j(e, n)), a.close();
                 } else $("Connection", "WebChannel received:", n), g.Oi(n);
             }
         })), y(r, Event.STAT_EVENT, (t => {
@@ -11121,15 +11121,15 @@ class eo {
  *  ListenerType: The type of the listener that will be used for callbacks
  */
 class no {
-    constructor(t, e, n, s, i, r, o, a) {
+    constructor(t, e, n, s, i, r, o, c) {
         this.Oe = t, this.nr = n, this.sr = s, this.ir = i, this.authCredentialsProvider = r, 
-        this.appCheckCredentialsProvider = o, this.listener = a, this.state = 0 /* Initial */ , 
+        this.appCheckCredentialsProvider = o, this.listener = c, this.state = 0 /* Initial */ , 
         /**
          * A close count that's incremented every time the stream is closed; used by
          * getCloseGuardedDispatcher() to invalidate callbacks that happen after
          * close.
          */
-        this.rr = 0, this.ar = null, this.cr = null, this.stream = null, this.ur = new eo(t, e);
+        this.rr = 0, this.cr = null, this.ar = null, this.stream = null, this.ur = new eo(t, e);
     }
     /**
      * Returns true if start() has been called and no error has occurred. True
@@ -11185,7 +11185,7 @@ class no {
      */    _r() {
         // Starts the idle time if we are in state 'Open' and are not yet already
         // running a timer (in which case the previous idle timeout still applies).
-        this.lr() && null === this.ar && (this.ar = this.Oe.enqueueAfterDelay(this.nr, 6e4, (() => this.mr())));
+        this.lr() && null === this.cr && (this.cr = this.Oe.enqueueAfterDelay(this.nr, 6e4, (() => this.mr())));
     }
     /** Sends a message to the underlying stream. */    gr(t) {
         this.yr(), this.stream.send(t);
@@ -11197,10 +11197,10 @@ class no {
         return this.close(0 /* Initial */);
     }
     /** Marks the stream as active again. */    yr() {
-        this.ar && (this.ar.cancel(), this.ar = null);
+        this.cr && (this.cr.cancel(), this.cr = null);
     }
     /** Cancels the health check delayed operation. */    pr() {
-        this.cr && (this.cr.cancel(), this.cr = null);
+        this.ar && (this.ar.cancel(), this.ar = null);
     }
     /**
      * Closes the stream and cleans up as necessary:
@@ -11268,7 +11268,7 @@ class no {
     Ir(t, e) {
         const n = this.Er(this.rr);
         this.stream = this.Rr(t, e), this.stream.Di((() => {
-            n((() => (this.state = 2 /* Open */ , this.cr = this.Oe.enqueueAfterDelay(this.sr, 1e4, (() => (this.lr() && (this.state = 3 /* Healthy */), 
+            n((() => (this.state = 2 /* Open */ , this.ar = this.Oe.enqueueAfterDelay(this.sr, 1e4, (() => (this.lr() && (this.state = 3 /* Healthy */), 
             Promise.resolve()))), this.listener.Di())));
         })), this.stream.Ni((t => {
             n((() => this.Ar(t)));
@@ -11323,9 +11323,9 @@ class no {
             // We have only reached a consistent snapshot for the entire stream if there
             // is a read_time set and it applies to all targets (i.e. the list of
             // targets is empty). The backend is guaranteed to send such responses.
-            if (!("targetChange" in t)) return ct.min();
+            if (!("targetChange" in t)) return at.min();
             const e = t.targetChange;
-            return e.targetIds && e.targetIds.length ? ct.min() : e.readTime ? Gn(e.readTime) : ct.min();
+            return e.targetIds && e.targetIds.length ? at.min() : e.readTime ? Gn(e.readTime) : at.min();
         }(t);
         return this.listener.Pr(e, n);
     }
@@ -11343,7 +11343,7 @@ class no {
                 documents: us(t, s)
             } : {
                 query: hs(t, s)
-            }, n.targetId = e.targetId, e.resumeToken.approximateByteSize() > 0 ? n.resumeToken = Qn(t, e.resumeToken) : e.snapshotVersion.compareTo(ct.min()) > 0 && (
+            }, n.targetId = e.targetId, e.resumeToken.approximateByteSize() > 0 ? n.resumeToken = Qn(t, e.resumeToken) : e.snapshotVersion.compareTo(at.min()) > 0 && (
             // TODO(wuandy): Consider removing above check because it is most likely true.
             // Right now, many tests depend on this behaviour though (leaving min() out
             // of serialization).
@@ -11406,7 +11406,7 @@ class no {
             // Note, that we could consider a successful handshake healthy, however,
             // the write itself might be causing an error we want to back off from.
             this.ur.reset();
-            const e = cs(t.writeResults, t.commitTime), n = Gn(t.commitTime);
+            const e = as(t.writeResults, t.commitTime), n = Gn(t.commitTime);
             return this.listener.Cr(n, e);
         }
         // The first response is always the handshake response
@@ -11578,7 +11578,7 @@ class oo {
  * 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 ao {
+ */ class co {
     constructor(
     /**
      * The local store, used to fill the write pipeline with outbound mutations.
@@ -11636,14 +11636,14 @@ class oo {
                 await async function(t) {
                     const e = q(t);
                     e.Gr.add(4 /* ConnectivityChange */), await uo(e), e.Jr.set("Unknown" /* Unknown */), 
-                    e.Gr.delete(4 /* ConnectivityChange */), await co(e);
+                    e.Gr.delete(4 /* ConnectivityChange */), await ao(e);
                 }(this));
             }));
         })), this.Jr = new oo(n, s);
     }
 }
 
-async function co(t) {
+async function ao(t) {
     if (go(t)) for (const e of t.zr) await e(/* enabled= */ !0);
 }
 
@@ -11759,7 +11759,7 @@ async function Eo(t, e, n) {
         $("RemoteStore", "Failed to remove targets %s: %s ", e.targetIds.join(","), n), 
         await Io(t, n);
     } else if (e instanceof xn ? t.Yr.ot(e) : e instanceof $n ? t.Yr.dt(e) : t.Yr.ut(e), 
-    !n.isEqual(ct.min())) try {
+    !n.isEqual(at.min())) try {
         const e = await _r(t.localStore);
         n.compareTo(e) >= 0 && 
         // We have received a target change with a global snapshot if the snapshot
@@ -11798,7 +11798,7 @@ async function Eo(t, e, n) {
                 // mismatch, but don't actually retain that in listenTargets. This ensures
                 // that we flag the first re-listen this way without impacting future
                 // listens of this target (that might happen e.g. on reconnect).
-                const s = new ai(n.target, e, 1 /* ExistenceFilterMismatch */ , n.sequenceNumber);
+                const s = new ci(n.target, e, 1 /* ExistenceFilterMismatch */ , n.sequenceNumber);
                 fo(t, s);
             })), t.remoteSyncer.applyRemoteEvent(n);
         }(t, n);
@@ -11827,7 +11827,7 @@ async function Eo(t, e, n) {
     // Probe IndexedDB periodically and re-enable network
     t.asyncQueue.enqueueRetryable((async () => {
         $("RemoteStore", "Retrying IndexedDB access"), await n(), t.Gr.delete(1 /* IndexedDbFailed */), 
-        await co(t);
+        await ao(t);
     }));
 }
 
@@ -11928,7 +11928,7 @@ async function No(t, e) {
  */
 async function ko(t, e) {
     const n = q(t);
-    e ? (n.Gr.delete(2 /* IsSecondary */), await co(n)) : e || (n.Gr.add(2 /* IsSecondary */), 
+    e ? (n.Gr.delete(2 /* IsSecondary */), await ao(n)) : e || (n.Gr.add(2 /* IsSecondary */), 
     await uo(n), n.Jr.set("Unknown" /* Unknown */));
 }
 
@@ -12244,9 +12244,9 @@ class Fo {
 }
 
 class Bo {
-    constructor(t, e, n, s, i, r, o, a) {
+    constructor(t, e, n, s, i, r, o, c) {
         this.query = t, this.docs = e, this.oldDocs = n, this.docChanges = s, this.mutatedKeys = i, 
-        this.fromCache = r, this.syncStateChanged = o, this.excludesMetadataChanges = a;
+        this.fromCache = r, this.syncStateChanged = o, this.excludesMetadataChanges = c;
     }
     /** Returns a view snapshot as if all documents in the snapshot were added. */    static fromInitialDocuments(t, e, n, s) {
         const i = [];
@@ -12365,12 +12365,12 @@ function Go(t) {
  * It uses an Observer to dispatch events.
  */ class zo {
     constructor(t, e, n) {
-        this.query = t, this.ao = e, 
+        this.query = t, this.co = 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.co = !1, this.uo = null, this.onlineState = "Unknown" /* Unknown */ , this.options = n || {};
+        this.ao = !1, this.uo = null, this.onlineState = "Unknown" /* Unknown */ , this.options = n || {};
     }
     /**
      * Applies the new ViewSnapshot to this listener, raising a user-facing event
@@ -12386,16 +12386,16 @@ function Go(t) {
             /* excludesMetadataChanges= */ !0);
         }
         let e = !1;
-        return this.co ? this.ho(t) && (this.ao.next(t), e = !0) : this.lo(t, this.onlineState) && (this.fo(t), 
+        return this.ao ? this.ho(t) && (this.co.next(t), e = !0) : this.lo(t, this.onlineState) && (this.fo(t), 
         e = !0), this.uo = t, e;
     }
     onError(t) {
-        this.ao.error(t);
+        this.co.error(t);
     }
     /** Returns whether a snapshot was raised. */    ro(t) {
         this.onlineState = t;
         let e = !1;
-        return this.uo && !this.co && this.lo(this.uo, t) && (this.fo(this.uo), e = !0), 
+        return this.uo && !this.ao && this.lo(this.uo, t) && (this.fo(this.uo), e = !0), 
         e;
     }
     lo(t, e) {
@@ -12422,8 +12422,8 @@ function Go(t) {
         // stripped out.
         }
     fo(t) {
-        t = Bo.fromInitialDocuments(t.query, t.docs, t.mutatedKeys, t.fromCache), this.co = !0, 
-        this.ao.next(t);
+        t = Bo.fromInitialDocuments(t.query, t.docs, t.mutatedKeys, t.fromCache), this.ao = !0, 
+        this.co.next(t);
     }
 }
 
@@ -12533,7 +12533,7 @@ function Go(t) {
      */    async complete() {
         const t = await Pr(this.localStore, new Jo(this.k), this.documents, this.mo.id), e = this.po(this.documents);
         for (const t of this.queries) await br(this.localStore, t, e.get(t.name));
-        return this.progress.taskState = "Success", new ar(Object.assign({}, this.progress), t);
+        return this.progress.taskState = "Success", new cr(Object.assign({}, this.progress), t);
     }
 }
 
@@ -12576,7 +12576,7 @@ class Zo {
     }
 }
 
-class ta {
+class tc {
     constructor(t) {
         this.key = t;
     }
@@ -12586,7 +12586,7 @@ class ta {
  * View is responsible for computing the final merged truth of what docs are in
  * a query. It gets notified of local and remote changes to docs, and applies
  * the query filters and limits to determine the most correct possible results.
- */ class ea {
+ */ class ec {
     constructor(t, 
     /** Documents included in the remote target */
     e) {
@@ -12629,7 +12629,7 @@ class ta {
         // deletes. So we keep this doc at the old limit to compare the updates to.
         // Note that this should never get used in a refill (when previousChanges is
         // set), because there will only be adds -- no deletes or updates.
-        const a = ye(this.query) && s.size === this.query.limit ? s.last() : null, c = pe(this.query) && s.size === this.query.limit ? s.first() : null;
+        const c = ye(this.query) && s.size === this.query.limit ? s.last() : null, a = pe(this.query) && s.size === this.query.limit ? s.first() : null;
         // Drop documents out to meet limit/limitToLast requirement.
         if (t.inorderTraversal(((t, e) => {
             const u = s.get(t), h = Se(this.query, e) ? e : null, l = !!u && this.mutatedKeys.has(u.key), f = !!h && (h.hasLocalMutations || 
@@ -12645,7 +12645,7 @@ class ta {
                 }), d = !0) : this.Vo(u, h) || (n.track({
                     type: 2 /* Modified */ ,
                     doc: h
-                }), d = !0, (a && this.Ao(h, a) > 0 || c && this.Ao(h, c) < 0) && (
+                }), d = !0, (c && this.Ao(h, c) > 0 || a && this.Ao(h, a) < 0) && (
                 // This doc moved from inside the limit to outside the limit.
                 // That means there may be some other doc in the local cache
                 // that should be included instead.
@@ -12656,7 +12656,7 @@ class ta {
             }), d = !0) : u && !h && (n.track({
                 type: 1 /* Removed */ ,
                 doc: u
-            }), d = !0, (a || c) && (
+            }), d = !0, (c || a) && (
             // A doc was removed from a full limit query. We'll need to
             // requery from the local cache to see if we know about some other
             // doc that should be in the results.
@@ -12740,10 +12740,10 @@ class ta {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */ (t.type, e.type) || this.Ao(t.doc, e.doc))), this.So(n);
-        const r = e ? this.Do() : [], o = 0 === this.Io.size && this.current ? 1 /* Synced */ : 0 /* Local */ , a = o !== this.Eo;
-        if (this.Eo = o, 0 !== i.length || a) {
+        const r = e ? this.Do() : [], o = 0 === this.Io.size && this.current ? 1 /* Synced */ : 0 /* Local */ , c = o !== this.Eo;
+        if (this.Eo = o, 0 !== i.length || c) {
             return {
-                snapshot: new Bo(this.query, t.Ro, s, i, t.mutatedKeys, 0 /* Local */ === o, a, 
+                snapshot: new Bo(this.query, t.Ro, s, i, t.mutatedKeys, 0 /* Local */ === o, c, 
                 /* excludesMetadataChanges= */ !1),
                 Co: r
             };
@@ -12799,7 +12799,7 @@ class ta {
         // Diff the new limbo docs with the old limbo docs.
         const e = [];
         return t.forEach((t => {
-            this.Io.has(t) || e.push(new ta(t));
+            this.Io.has(t) || e.push(new tc(t));
         })), this.Io.forEach((n => {
             t.has(n) || e.push(new Zo(n));
         })), e;
@@ -12844,7 +12844,7 @@ class ta {
  * QueryView contains all of the data that SyncEngine needs to keep track of for
  * a particular query.
  */
-class na {
+class nc {
     constructor(
     /**
      * The query itself.
@@ -12866,7 +12866,7 @@ class na {
     }
 }
 
-/** Tracks a limbo resolution. */ class sa {
+/** Tracks a limbo resolution. */ class sc {
     constructor(t) {
         this.key = t, 
         /**
@@ -12891,7 +12891,7 @@ class na {
  * the class is not exported so they are only accessible from this module.
  * This is useful to implement optional features (like bundles) in free
  * functions, such that they are tree-shakeable.
- */ class ia {
+ */ class ic {
     constructor(t, e, n, 
     // PORTING NOTE: Manages state synchronization in multi-tab environments.
     s, i, r) {
@@ -12937,8 +12937,8 @@ class na {
  * server. All the subsequent view snapshots or errors are sent to the
  * subscribed handlers. Returns the initial snapshot.
  */
-async function ra(t, e) {
-    const n = xa(t);
+async function rc(t, e) {
+    const n = xc(t);
     let s, i;
     const r = n.Oo.get(e);
     if (r) 
@@ -12950,7 +12950,7 @@ async function ra(t, e) {
     // case and calls `listen` to obtain this ID.
     s = r.targetId, n.sharedClientState.addLocalQueryTarget(s), i = r.view.xo(); else {
         const t = await pr(n.localStore, Re(e)), r = n.sharedClientState.addLocalQueryTarget(t.targetId);
-        s = t.targetId, i = await oa(n, e, s, "current" === r), n.isPrimaryClient && ho(n.remoteStore, t);
+        s = t.targetId, i = await oc(n, e, s, "current" === r), n.isPrimaryClient && ho(n.remoteStore, t);
     }
     return i;
 }
@@ -12958,7 +12958,7 @@ async function ra(t, e) {
 /**
  * Registers a view for a previously unknown query and computes its initial
  * snapshot.
- */ async function oa(t, e, n, s) {
+ */ async function oc(t, e, n, s) {
     // PORTING NOTE: On Web only, we inject the code that registers new Limbo
     // targets based on view changes. This allows us to only depend on Limbo
     // changes when user code includes queries.
@@ -12972,17 +12972,17 @@ async function ra(t, e) {
         /* usePreviousResults= */ !1).then((({documents: t}) => e.view.bo(t, i))));
         const r = s && s.targetChanges.get(e.targetId), o = e.view.applyChanges(i, 
         /* updateLimboDocuments= */ t.isPrimaryClient, r);
-        return pa(t, e.targetId, o.Co), o.snapshot;
+        return pc(t, e.targetId, o.Co), o.snapshot;
     }(t, e, n, s);
     const i = await Er(t.localStore, e, 
-    /* usePreviousResults= */ !0), r = new ea(e, i.zn), o = r.bo(i.documents), a = kn.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), c = r.applyChanges(o, 
-    /* updateLimboDocuments= */ t.isPrimaryClient, a);
-    pa(t, n, c.Co);
-    const u = new na(e, n, r);
-    return t.Oo.set(e, u), t.Mo.has(n) ? t.Mo.get(n).push(e) : t.Mo.set(n, [ e ]), c.snapshot;
+    /* usePreviousResults= */ !0), r = new ec(e, i.zn), o = r.bo(i.documents), c = kn.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), a = r.applyChanges(o, 
+    /* updateLimboDocuments= */ t.isPrimaryClient, c);
+    pc(t, n, a.Co);
+    const u = new nc(e, n, r);
+    return t.Oo.set(e, u), t.Mo.has(n) ? t.Mo.get(n).push(e) : t.Mo.set(n, [ e ]), a.snapshot;
 }
 
-/** Stops listening to the query. */ async function aa(t, e) {
+/** Stops listening to the query. */ async function cc(t, e) {
     const n = q(t), s = n.Oo.get(e), i = n.Mo.get(s.targetId);
     if (i.length > 1) return n.Mo.set(s.targetId, i.filter((t => !be(t, e)))), void n.Oo.delete(e);
     // No other queries are mapped to the target, clean up the query and the target.
@@ -12993,9 +12993,9 @@ async function ra(t, e) {
         n.sharedClientState.isActiveQueryTarget(s.targetId) || await Tr(n.localStore, s.targetId, 
         /*keepPersistedTargetData=*/ !1).then((() => {
             n.sharedClientState.clearQueryState(s.targetId), lo(n.remoteStore, s.targetId), 
-            ga(n, s.targetId);
+            gc(n, s.targetId);
         })).catch(Bi);
-    } else ga(n, s.targetId), await Tr(n.localStore, s.targetId, 
+    } else gc(n, s.targetId), await Tr(n.localStore, s.targetId, 
     /*keepPersistedTargetData=*/ !0);
 }
 
@@ -13008,11 +13008,11 @@ async function ra(t, e) {
  * have completed, *not* when the write was acked by the backend. The
  * userCallback is resolved once the write was acked/rejected by the
  * backend (or failed locally for any other reason).
- */ async function ca(t, e, n) {
-    const s = $a(t);
+ */ async function ac(t, e, n) {
+    const s = $c(t);
     try {
         const t = await function(t, e) {
-            const n = q(t), s = at.now(), i = e.reduce(((t, e) => t.add(e.key)), Sn());
+            const n = q(t), s = ct.now(), i = e.reduce(((t, e) => t.add(e.key)), Sn());
             let r;
             return n.persistence.runTransaction("Locally write mutations", "readwrite", (t => n.Wn.vn(t, i).next((i => {
                 r = i;
@@ -13044,7 +13044,7 @@ async function ra(t, e) {
         /**
  * Resolves or rejects the user callback for the given batch and then discards
  * it.
- */ (s, t.batchId, n), await Ia(s, t.changes), await Ro(s.remoteStore);
+ */ (s, t.batchId, n), await Ic(s, t.changes), await Ro(s.remoteStore);
     } catch (t) {
         // If we can't persist the mutation, we reject the user callback and
         // don't send the mutation. The user can then retry the write.
@@ -13057,7 +13057,7 @@ async function ra(t, e) {
  * Applies one remote event to the sync engine, notifying any views of the
  * changes, and releasing any pending mutation batches that would become
  * visible because of the snapshot version the remote event contains.
- */ async function ua(t, e) {
+ */ async function uc(t, e) {
     const n = q(t);
     try {
         const t = await mr(n.localStore, e);
@@ -13070,7 +13070,7 @@ async function ra(t, e) {
             B(t.addedDocuments.size + t.modifiedDocuments.size + t.removedDocuments.size <= 1), 
             t.addedDocuments.size > 0 ? s.$o = !0 : t.modifiedDocuments.size > 0 ? B(s.$o) : t.removedDocuments.size > 0 && (B(s.$o), 
             s.$o = !1));
-        })), await Ia(n, t, e);
+        })), await Ic(n, t, e);
     } catch (t) {
         await Bi(t);
     }
@@ -13079,7 +13079,7 @@ async function ra(t, e) {
 /**
  * Applies an OnlineState change to the sync engine and notifies any views of
  * the change.
- */ function ha(t, e, n) {
+ */ function hc(t, e, n) {
     const s = q(t);
     // If we are the secondary client, we explicitly ignore the remote store's
     // online state (the local client may go offline, even though the primary
@@ -13113,7 +13113,7 @@ async function ra(t, e) {
  * @param err - A description of the condition that has forced the rejection.
  * Nearly always this will be an indication that the user is no longer
  * authorized to see the data matching the target.
- */ async function la(t, e, n) {
+ */ async function lc(t, e, n) {
     const s = q(t);
     // PORTING NOTE: Multi-tab only.
         s.sharedClientState.updateQueryState(e, "rejected", n);
@@ -13126,22 +13126,22 @@ async function ra(t, e) {
         // store to purge a document. However, it would be tricky to keep all of
         // the local store's invariants with another method.
         let t = new gn(St.comparator);
-        t = t.insert(r, Wt.newNoDocument(r, ct.min()));
-        const n = Sn().add(r), i = new Nn(ct.min(), 
+        t = t.insert(r, Wt.newNoDocument(r, at.min()));
+        const n = Sn().add(r), i = new Nn(at.min(), 
         /* targetChanges= */ new Map, 
         /* targetMismatches= */ new Tn(it), t, n);
-        await ua(s, i), 
+        await uc(s, i), 
         // Since this query failed, we won't want to manually unlisten to it.
         // We only remove it from bookkeeping after we successfully applied the
         // RemoteEvent. If `applyRemoteEvent()` throws, we want to re-listen to
         // this query when the RemoteStore restarts the Watch stream, which should
         // re-trigger the target failure.
-        s.Bo = s.Bo.remove(r), s.Uo.delete(e), Ea(s);
+        s.Bo = s.Bo.remove(r), s.Uo.delete(e), Ec(s);
     } else await Tr(s.localStore, e, 
-    /* keepPersistedTargetData */ !1).then((() => ga(s, e, n))).catch(Bi);
+    /* keepPersistedTargetData */ !1).then((() => gc(s, e, n))).catch(Bi);
 }
 
-async function fa(t, e) {
+async function fc(t, e) {
     const n = q(t), s = e.batch.batchId;
     try {
         const t = await wr(n.localStore, e);
@@ -13149,14 +13149,14 @@ async function fa(t, e) {
         // raise events immediately (depending on whether the watcher is caught
         // up), so we raise user callbacks first so that they consistently happen
         // before listen events.
-                ma(n, s, /*error=*/ null), _a(n, s), n.sharedClientState.updateMutationState(s, "acknowledged"), 
-        await Ia(n, t);
+                mc(n, s, /*error=*/ null), _c(n, s), n.sharedClientState.updateMutationState(s, "acknowledged"), 
+        await Ic(n, t);
     } catch (t) {
         await Bi(t);
     }
 }
 
-async function da(t, e, n) {
+async function dc(t, e, n) {
     const s = q(t);
     try {
         const t = await function(t, e) {
@@ -13176,8 +13176,8 @@ async function da(t, e, n) {
         // raise events immediately (depending on whether the watcher is caught up),
         // so we raise user callbacks first so that they consistently happen before
         // listen events.
-                ma(s, e, n), _a(s, e), s.sharedClientState.updateMutationState(e, "rejected", n), 
-        await Ia(s, t);
+                mc(s, e, n), _c(s, e), s.sharedClientState.updateMutationState(e, "rejected", n), 
+        await Ic(s, t);
     } catch (n) {
         await Bi(n);
     }
@@ -13186,7 +13186,7 @@ async function da(t, e, n) {
 /**
  * Registers a user callback that resolves when all pending mutations at the moment of calling
  * are acknowledged .
- */ async function wa(t, e) {
+ */ async function wc(t, e) {
     const n = q(t);
     go(n.remoteStore) || $("SyncEngine", "The network is disabled. The task returned by 'awaitPendingWrites()' will not complete until the network is enabled.");
     try {
@@ -13208,13 +13208,13 @@ async function da(t, e, n) {
 /**
  * Triggers the callbacks that are waiting for this batch id to get acknowledged by server,
  * if there are any.
- */ function _a(t, e) {
+ */ function _c(t, e) {
     (t.jo.get(e) || []).forEach((t => {
         t.resolve();
     })), t.jo.delete(e);
 }
 
-/** Reject all outstanding callbacks waiting for pending writes to complete. */ function ma(t, e, n) {
+/** Reject all outstanding callbacks waiting for pending writes to complete. */ function mc(t, e, n) {
     const s = q(t);
     let i = s.Ko[s.currentUser.toKey()];
     // NOTE: Mutations restored from persistence won't have callbacks, so it's
@@ -13225,39 +13225,39 @@ async function da(t, e, n) {
     }
 }
 
-function ga(t, e, n = null) {
+function gc(t, e, n = null) {
     t.sharedClientState.removeLocalQueryTarget(e);
     for (const s of t.Mo.get(e)) t.Oo.delete(s), n && t.Fo.zo(s, n);
     if (t.Mo.delete(e), t.isPrimaryClient) {
         t.qo.us(e).forEach((e => {
             t.qo.containsKey(e) || 
             // We removed the last reference for this key
-            ya(t, e);
+            yc(t, e);
         }));
     }
 }
 
-function ya(t, e) {
+function yc(t, e) {
     t.Lo.delete(e.path.canonicalString());
     // It's possible that the target already got removed because the query failed. In that case,
     // the key won't exist in `limboTargetsByKey`. Only do the cleanup if we still have the target.
     const n = t.Bo.get(e);
-    null !== n && (lo(t.remoteStore, n), t.Bo = t.Bo.remove(e), t.Uo.delete(n), Ea(t));
+    null !== n && (lo(t.remoteStore, n), t.Bo = t.Bo.remove(e), t.Uo.delete(n), Ec(t));
 }
 
-function pa(t, e, n) {
-    for (const s of n) if (s instanceof Zo) t.qo.addReference(s.key, e), Ta(t, s); else if (s instanceof ta) {
+function pc(t, e, n) {
+    for (const s of n) if (s instanceof Zo) t.qo.addReference(s.key, e), Tc(t, s); else if (s instanceof tc) {
         $("SyncEngine", "Document no longer in limbo: " + s.key), t.qo.removeReference(s.key, e);
         t.qo.containsKey(s.key) || 
         // We removed the last reference for this key
-        ya(t, s.key);
+        yc(t, s.key);
     } else L();
 }
 
-function Ta(t, e) {
+function Tc(t, e) {
     const n = e.key, s = n.path.canonicalString();
     t.Bo.get(n) || t.Lo.has(s) || ($("SyncEngine", "New document in limbo: " + n), t.Lo.add(s), 
-    Ea(t));
+    Ec(t));
 }
 
 /**
@@ -13267,23 +13267,23 @@ function Ta(t, e) {
  * Without bounding the number of concurrent resolutions, the server can fail
  * with "resource exhausted" errors which can lead to pathological client
  * behavior as seen in https://github.com/firebase/firebase-js-sdk/issues/2683.
- */ function Ea(t) {
+ */ function Ec(t) {
     for (;t.Lo.size > 0 && t.Bo.size < t.maxConcurrentLimboResolutions; ) {
         const e = t.Lo.values().next().value;
         t.Lo.delete(e);
         const n = new St(dt.fromString(e)), s = t.Qo.next();
-        t.Uo.set(s, new sa(n)), t.Bo = t.Bo.insert(n, s), ho(t.remoteStore, new ai(Re(ge(n.path)), s, 2 /* LimboResolution */ , et.I));
+        t.Uo.set(s, new sc(n)), t.Bo = t.Bo.insert(n, s), ho(t.remoteStore, new ci(Re(ge(n.path)), s, 2 /* LimboResolution */ , et.I));
     }
 }
 
-async function Ia(t, e, n) {
+async function Ic(t, e, n) {
     const s = q(t), i = [], r = [], o = [];
-    s.Oo.isEmpty() || (s.Oo.forEach(((t, a) => {
-        o.push(s.Go(a, e, n).then((t => {
+    s.Oo.isEmpty() || (s.Oo.forEach(((t, c) => {
+        o.push(s.Go(c, e, n).then((t => {
             if (t) {
-                s.isPrimaryClient && s.sharedClientState.updateQueryState(a.targetId, t.fromCache ? "not-current" : "current"), 
+                s.isPrimaryClient && s.sharedClientState.updateQueryState(c.targetId, t.fromCache ? "not-current" : "current"), 
                 i.push(t);
-                const e = ur.$n(a.targetId, t);
+                const e = ur.$n(c.targetId, t);
                 r.push(e);
             }
         })));
@@ -13310,7 +13310,7 @@ async function Ia(t, e, n) {
     }(s.localStore, r));
 }
 
-async function Aa(t, e) {
+async function Ac(t, e) {
     const n = q(t);
     if (!n.currentUser.isEqual(e)) {
         $("SyncEngine", "User change. New user:", e.toKey());
@@ -13325,11 +13325,11 @@ async function Aa(t, e) {
             })), t.jo.clear();
         }(n, "'waitForPendingWrites' promise is rejected due to a user change."), 
         // TODO(b/114226417): Consider calling this only in the primary tab.
-        n.sharedClientState.handleUserChange(e, t.removedBatchIds, t.addedBatchIds), await Ia(n, t.Gn);
+        n.sharedClientState.handleUserChange(e, t.removedBatchIds, t.addedBatchIds), await Ic(n, t.Gn);
     }
 }
 
-function Ra(t, e) {
+function Rc(t, e) {
     const n = q(t), s = n.Uo.get(e);
     if (s && s.$o) return Sn().add(s.key);
     {
@@ -13347,10 +13347,10 @@ function Ra(t, e) {
 /**
  * Reconcile the list of synced documents in an existing view with those
  * from persistence.
- */ async function Pa(t, e) {
+ */ async function Pc(t, e) {
     const n = q(t), s = await Er(n.localStore, e.query, 
     /* usePreviousResults= */ !0), i = e.view.ko(s);
-    return n.isPrimaryClient && pa(n, e.targetId, i.Co), i;
+    return n.isPrimaryClient && pc(n, e.targetId, i.Co), i;
 }
 
 /**
@@ -13358,14 +13358,14 @@ function Ra(t, e) {
  * snapshots if needed.
  */
 // PORTING NOTE: Multi-Tab only.
-async function ba(t) {
+async function bc(t) {
     const e = q(t);
-    return Ar(e.localStore).then((t => Ia(e, t)));
+    return Ar(e.localStore).then((t => Ic(e, t)));
 }
 
 /** Applies a mutation state to an existing batch.  */
 // PORTING NOTE: Multi-Tab only.
-async function va(t, e, n, s) {
+async function vc(t, e, n, s) {
     const i = q(t), r = await function(t, e) {
         const n = q(t), s = q(n.An);
         return n.persistence.runTransaction("Lookup mutation documents", "readonly", (t => s.Zt(t, e).next((e => e ? n.Wn.vn(t, e) : Gs.resolve(null)))));
@@ -13379,11 +13379,11 @@ async function va(t, e, n, s) {
     await Ro(i.remoteStore) : "acknowledged" === n || "rejected" === n ? (
     // NOTE: Both these methods are no-ops for batches that originated from
     // other clients.
-    ma(i, e, s || null), _a(i, e), function(t, e) {
+    mc(i, e, s || null), _c(i, e), function(t, e) {
         q(q(t).An).ee(e);
     }
     // PORTING NOTE: Multi-Tab only.
-    (i.localStore, e)) : L(), await Ia(i, r)) : 
+    (i.localStore, e)) : L(), await Ic(i, r)) : 
     // A throttled tab may not have seen the mutation before it was completed
     // and removed from the mutation queue, in which case we won't have cached
     // the affected documents. In this case we can safely ignore the update
@@ -13396,26 +13396,26 @@ async function va(t, e, n, s) {
 
 /** Applies a query target change from a different tab. */
 // PORTING NOTE: Multi-Tab only.
-async function Va(t, e) {
+async function Vc(t, e) {
     const n = q(t);
-    if (xa(n), $a(n), !0 === e && !0 !== n.Wo) {
+    if (xc(n), $c(n), !0 === e && !0 !== n.Wo) {
         // Secondary tabs only maintain Views for their local listeners and the
         // Views internal state may not be 100% populated (in particular
         // secondary tabs don't track syncedDocuments, the set of documents the
         // server considers to be in the target). So when a secondary becomes
         // 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 Sa(n, t.toArray());
+        const t = n.sharedClientState.getAllActiveQueryTargets(), e = await Sc(n, t.toArray());
         n.Wo = !0, await ko(n.remoteStore, !0);
         for (const t of e) ho(n.remoteStore, t);
     } else if (!1 === e && !1 !== n.Wo) {
         const t = [];
         let e = Promise.resolve();
         n.Mo.forEach(((s, i) => {
-            n.sharedClientState.isLocalQueryTarget(i) ? t.push(i) : e = e.then((() => (ga(n, i), 
+            n.sharedClientState.isLocalQueryTarget(i) ? t.push(i) : e = e.then((() => (gc(n, i), 
             Tr(n.localStore, i, 
             /*keepPersistedTargetData=*/ !0)))), lo(n.remoteStore, i);
-        })), await e, await Sa(n, t), 
+        })), await e, await Sc(n, t), 
         // PORTING NOTE: Multi-Tab only.
         function(t) {
             const e = q(t);
@@ -13438,7 +13438,7 @@ async function Va(t, e) {
     }
 }
 
-async function Sa(t, e, n) {
+async function Sc(t, e, n) {
     const s = q(t), i = [], r = [];
     for (const t of e) {
         let e;
@@ -13450,14 +13450,14 @@ async function Sa(t, e, n) {
             // state (the list of syncedDocuments may have gotten out of sync).
             e = await pr(s.localStore, Re(n[0]));
             for (const t of n) {
-                const e = s.Oo.get(t), n = await Pa(s, e);
+                const e = s.Oo.get(t), n = await Pc(s, e);
                 n.snapshot && r.push(n.snapshot);
             }
         } else {
             // For queries that never executed on this client, we need to
             // allocate the target in LocalStore and initialize a new View.
             const n = await Ir(s.localStore, t);
-            e = await pr(s.localStore, n), await oa(s, Da(n), t, 
+            e = await pr(s.localStore, n), await oc(s, Dc(n), t, 
             /*current=*/ !1);
         }
         i.push(e);
@@ -13476,20 +13476,20 @@ async function Sa(t, e, n) {
  * difference will not cause issues.
  */
 // PORTING NOTE: Multi-Tab only.
-function Da(t) {
+function Dc(t) {
     return me(t.path, t.collectionGroup, t.orderBy, t.filters, t.limit, "F" /* First */ , t.startAt, t.endAt);
 }
 
 /** Returns the IDs of the clients that are currently active. */
 // PORTING NOTE: Multi-Tab only.
-function Ca(t) {
+function Cc(t) {
     const e = q(t);
     return q(q(e.localStore).persistence).Tn();
 }
 
 /** Applies a query target change from a different tab. */
 // PORTING NOTE: Multi-Tab only.
-async function Na(t, e, n, s) {
+async function Nc(t, e, n, s) {
     const i = q(t);
     if (i.Wo) 
     // If we receive a target state notification via WebStorage, we are
@@ -13499,13 +13499,13 @@ async function Na(t, e, n, s) {
       case "not-current":
         {
             const t = await Ar(i.localStore), s = Nn.createSynthesizedRemoteEventForCurrentChange(e, "current" === n);
-            await Ia(i, t, s);
+            await Ic(i, t, s);
             break;
         }
 
       case "rejected":
         await Tr(i.localStore, e, 
-        /* keepPersistedTargetData */ !0), ga(i, e, s);
+        /* keepPersistedTargetData */ !0), gc(i, e, s);
         break;
 
       default:
@@ -13513,8 +13513,8 @@ async function Na(t, e, n, s) {
     }
 }
 
-/** Adds or removes Watch targets for queries from different tabs. */ async function ka(t, e, n) {
-    const s = xa(t);
+/** Adds or removes Watch targets for queries from different tabs. */ async function kc(t, e, n) {
+    const s = xc(t);
     if (s.Wo) {
         for (const t of e) {
             if (s.Mo.has(t)) {
@@ -13523,7 +13523,7 @@ async function Na(t, e, n, s) {
                 continue;
             }
             const e = await Ir(s.localStore, t), n = await pr(s.localStore, e);
-            await oa(s, Da(e), n.targetId, 
+            await oc(s, Dc(e), n.targetId, 
             /*current=*/ !1), ho(s.remoteStore, n);
         }
         for (const t of n) 
@@ -13533,21 +13533,21 @@ async function Na(t, e, n, s) {
         // Release queries that are still active.
         await Tr(s.localStore, t, 
         /* keepPersistedTargetData */ !1).then((() => {
-            lo(s.remoteStore, t), ga(s, t);
+            lo(s.remoteStore, t), gc(s, t);
         })).catch(Bi);
     }
 }
 
-function xa(t) {
+function xc(t) {
     const e = q(t);
-    return e.remoteStore.remoteSyncer.applyRemoteEvent = ua.bind(null, e), e.remoteStore.remoteSyncer.getRemoteKeysForTarget = Ra.bind(null, e), 
-    e.remoteStore.remoteSyncer.rejectListen = la.bind(null, e), e.Fo.Pr = Qo.bind(null, e.eventManager), 
+    return e.remoteStore.remoteSyncer.applyRemoteEvent = uc.bind(null, e), e.remoteStore.remoteSyncer.getRemoteKeysForTarget = Rc.bind(null, e), 
+    e.remoteStore.remoteSyncer.rejectListen = lc.bind(null, e), e.Fo.Pr = Qo.bind(null, e.eventManager), 
     e.Fo.zo = Wo.bind(null, e.eventManager), e;
 }
 
-function $a(t) {
+function $c(t) {
     const e = q(t);
-    return e.remoteStore.remoteSyncer.applySuccessfulWrite = fa.bind(null, e), e.remoteStore.remoteSyncer.rejectFailedWrite = da.bind(null, e), 
+    return e.remoteStore.remoteSyncer.applySuccessfulWrite = fc.bind(null, e), e.remoteStore.remoteSyncer.rejectFailedWrite = dc.bind(null, e), 
     e;
 }
 
@@ -13558,7 +13558,7 @@ function $a(t) {
  * @param syncEngine - SyncEngine to use.
  * @param bundleReader - Bundle to load into the SDK.
  * @param task - LoadBundleTask used to update the loading progress to public API.
- */ function Fa(t, e, n) {
+ */ function Fc(t, e, n) {
     const s = q(t);
     // eslint-disable-next-line @typescript-eslint/no-floating-promises
         (async function(t, e, n) {
@@ -13590,7 +13590,7 @@ function $a(t) {
             // TODO(b/160876443): This currently raises snapshots with
             // `fromCache=false` if users already listen to some queries and bundles
             // has newer version.
-                        await Ia(t, o.In, 
+                        await Ic(t, o.In, 
             /* remoteEvent */ void 0), 
             // Save metadata, so loading the same bundle will skip.
             await function(t, e) {
@@ -13629,7 +13629,7 @@ function $a(t) {
     }));
 }
 
-class Oa {
+class Oc {
     constructor() {
         this.synchronizeTabs = !1;
     }
@@ -13657,14 +13657,14 @@ class Oa {
 
 /**
  * Provides all components needed for Firestore with IndexedDB persistence.
- */ class Ma extends Oa {
+ */ class Mc extends Oc {
     constructor(t, e, n) {
-        super(), this.ta = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;
+        super(), this.tc = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;
     }
     async initialize(t) {
-        await super.initialize(t), await Rr(this.localStore), await this.ta.initialize(this, t), 
+        await super.initialize(t), await Rr(this.localStore), await this.tc.initialize(this, t), 
         // Enqueue writes from a previous session
-        await $a(this.ta.syncEngine), await Ro(this.ta.remoteStore), 
+        await $c(this.tc.syncEngine), await Ro(this.tc.remoteStore), 
         // NOTE: This will immediately call the listener, so we make sure to
         // set it after localStore / remoteStore are started.
         await this.persistence.sn((() => (this.gcScheduler && !this.gcScheduler.started && this.gcScheduler.start(this.localStore), 
@@ -13693,24 +13693,24 @@ class Oa {
  * In the legacy client, this provider is used to provide both multi-tab and
  * non-multi-tab persistence since we cannot tell at build time whether
  * `synchronizeTabs` will be enabled.
- */ class La extends Ma {
+ */ class Lc extends Mc {
     constructor(t, e) {
-        super(t, e, /* forceOwnership= */ !1), this.ta = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;
+        super(t, e, /* forceOwnership= */ !1), this.tc = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;
     }
     async initialize(t) {
         await super.initialize(t);
-        const e = this.ta.syncEngine;
+        const e = this.tc.syncEngine;
         this.sharedClientState instanceof Qr && (this.sharedClientState.syncEngine = {
-            mi: va.bind(null, e),
-            gi: Na.bind(null, e),
-            yi: ka.bind(null, e),
-            Tn: Ca.bind(null, e),
-            _i: ba.bind(null, e)
+            mi: vc.bind(null, e),
+            gi: Nc.bind(null, e),
+            yi: kc.bind(null, e),
+            Tn: Cc.bind(null, e),
+            _i: bc.bind(null, e)
         }, await this.sharedClientState.start()), 
         // NOTE: This will immediately call the listener, so we make sure to
         // set it after localStore / remoteStore are started.
         await this.persistence.sn((async t => {
-            await Va(this.ta.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start(this.localStore) : t || this.gcScheduler.stop());
+            await Vc(this.tc.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start(this.localStore) : t || this.gcScheduler.stop());
         }));
     }
     Jo(t) {
@@ -13724,13 +13724,13 @@ class Oa {
 /**
  * Initializes and wires the components that are needed to interface with the
  * network.
- */ class Ba {
+ */ class Bc {
     async initialize(t, e) {
         this.localStore || (this.localStore = t.localStore, this.sharedClientState = t.sharedClientState, 
         this.datastore = this.createDatastore(e), this.remoteStore = this.createRemoteStore(e), 
         this.eventManager = this.createEventManager(e), this.syncEngine = this.createSyncEngine(e, 
-        /* startAsPrimary=*/ !t.synchronizeTabs), this.sharedClientState.onlineStateHandler = t => ha(this.syncEngine, t, 1 /* SharedClientState */), 
-        this.remoteStore.remoteSyncer.handleCredentialChange = Aa.bind(null, this.syncEngine), 
+        /* startAsPrimary=*/ !t.synchronizeTabs), this.sharedClientState.onlineStateHandler = t => hc(this.syncEngine, t, 1 /* SharedClientState */), 
+        this.remoteStore.remoteSyncer.handleCredentialChange = Ac.bind(null, this.syncEngine), 
         await ko(this.remoteStore, this.syncEngine.isPrimaryClient));
     }
     createEventManager(t) {
@@ -13744,16 +13744,16 @@ class Oa {
         }(t.authCredentials, t.appCheckCredentials, n, e);
     }
     createRemoteStore(t) {
-        return e = this.localStore, n = this.datastore, s = t.asyncQueue, i = t => ha(this.syncEngine, t, 0 /* RemoteStore */), 
-        r = zr.bt() ? new zr : new Gr, new ao(e, n, s, i, r);
+        return e = this.localStore, n = this.datastore, s = t.asyncQueue, i = t => hc(this.syncEngine, t, 0 /* RemoteStore */), 
+        r = zr.bt() ? new zr : new Gr, new co(e, n, s, i, r);
         var e, n, s, i, r;
         /** Re-enables the network. Idempotent. */    }
     createSyncEngine(t, e) {
         return function(t, e, n, 
         // PORTING NOTE: Manages state synchronization in multi-tab environments.
         s, i, r, o) {
-            const a = new ia(t, e, n, s, i, r);
-            return o && (a.Wo = !0), a;
+            const c = new ic(t, e, n, s, i, r);
+            return o && (c.Wo = !0), c;
         }(this.localStore, this.remoteStore, this.eventManager, this.sharedClientState, t.initialUser, t.maxConcurrentLimboResolutions, e);
     }
     terminate() {
@@ -13795,7 +13795,7 @@ class Oa {
  * @param bytesPerRead - How many bytes each `read()` from the returned reader
  *        will read.
  */
-function Ua(t, e = 10240) {
+function Uc(t, e = 10240) {
     let n = 0;
     // The TypeScript definition for ReadableStreamReader changed. We use
     // `any` here to allow this code to compile with different versions.
@@ -13861,7 +13861,7 @@ function Ua(t, e = 10240) {
  * asynchronously. To allow immediate silencing, a mute call is added which
  * causes events scheduled to no longer be raised.
  */
-class qa {
+class qc {
     constructor(t) {
         this.observer = t, 
         /**
@@ -13871,15 +13871,15 @@ class qa {
         this.muted = !1;
     }
     next(t) {
-        this.observer.next && this.ea(this.observer.next, t);
+        this.observer.next && this.ec(this.observer.next, t);
     }
     error(t) {
-        this.observer.error ? this.ea(this.observer.error, t) : console.error("Uncaught Error in snapshot listener:", t);
+        this.observer.error ? this.ec(this.observer.error, t) : console.error("Uncaught Error in snapshot listener:", t);
     }
-    na() {
+    nc() {
         this.muted = !0;
     }
-    ea(t, e) {
+    ec(t, e) {
         this.muted || setTimeout((() => {
             this.muted || t(e);
         }), 0);
@@ -13907,32 +13907,32 @@ class qa {
  *
  * Takes a bundle stream or buffer, and presents abstractions to read bundled
  * elements out of the underlying content.
- */ class Ka {
+ */ class Kc {
     constructor(
     /** The reader to read from underlying binary bundle data source. */
     t, e) {
-        this.sa = t, this.k = e, 
+        this.sc = t, this.k = e, 
         /** Cached bundle metadata. */
         this.metadata = new Q, 
         /**
          * Internal buffer to hold bundle content, accumulating incomplete element
          * content.
          */
-        this.buffer = new Uint8Array, this.ia = new TextDecoder("utf-8"), 
+        this.buffer = new Uint8Array, this.ic = new TextDecoder("utf-8"), 
         // Read the metadata (which is the first element).
-        this.ra().then((t => {
+        this.rc().then((t => {
             t && t._o() ? 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)));
     }
     close() {
-        return this.sa.cancel();
+        return this.sc.cancel();
     }
     async getMetadata() {
         return this.metadata.promise;
     }
     async Ho() {
         // Makes sure metadata is read before proceeding.
-        return await this.getMetadata(), this.ra();
+        return await this.getMetadata(), this.rc();
     }
     /**
      * Reads from the head of internal buffer, and pulling more data from
@@ -13943,15 +13943,15 @@ class qa {
      *
      * Returns either the bundled element, or null if we have reached the end of
      * the stream.
-     */    async ra() {
-        const t = await this.oa();
+     */    async rc() {
+        const t = await this.oc();
         if (null === t) return null;
-        const e = this.ia.decode(t), n = Number(e);
-        isNaN(n) && this.aa(`length string (${e}) is not valid number`);
-        const s = await this.ca(n);
+        const e = this.ic.decode(t), n = Number(e);
+        isNaN(n) && this.cc(`length string (${e}) is not valid number`);
+        const s = await this.ac(n);
         return new Ho(JSON.parse(s), t.length + n);
     }
-    /** First index of '{' from the underlying buffer. */    ua() {
+    /** First index of '{' from the underlying buffer. */    uc() {
         return this.buffer.findIndex((t => t === "{".charCodeAt(0)));
     }
     /**
@@ -13959,17 +13959,17 @@ class qa {
      * return the content.
      *
      * If reached end of the stream, returns a null.
-     */    async oa() {
-        for (;this.ua() < 0; ) {
-            if (await this.ha()) break;
+     */    async oc() {
+        for (;this.uc() < 0; ) {
+            if (await this.hc()) break;
         }
         // Broke out of the loop because underlying stream is closed, and there
         // happens to be no more data to process.
                 if (0 === this.buffer.length) return null;
-        const t = this.ua();
+        const t = this.uc();
         // Broke out of the loop because underlying stream is closed, but still
         // cannot find an open bracket.
-                t < 0 && this.aa("Reached the end of bundle when a length string is expected.");
+                t < 0 && this.cc("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;
@@ -13979,23 +13979,23 @@ class qa {
      * number of bytes, pulling more data from the underlying stream if needed.
      *
      * Returns a string decoded from the read bytes.
-     */    async ca(t) {
+     */    async ac(t) {
         for (;this.buffer.length < t; ) {
-            await this.ha() && this.aa("Reached the end of bundle when more is expected.");
+            await this.hc() && this.cc("Reached the end of bundle when more is expected.");
         }
-        const e = this.ia.decode(this.buffer.slice(0, t));
+        const e = this.ic.decode(this.buffer.slice(0, t));
         // Update the internal buffer to drop the read json string.
                 return this.buffer = this.buffer.slice(t), e;
     }
-    aa(t) {
+    cc(t) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        throw this.sa.cancel(), new Error(`Invalid bundle format: ${t}`);
+        throw this.sc.cancel(), new Error(`Invalid bundle format: ${t}`);
     }
     /**
      * Pulls more data from underlying stream to internal buffer.
      * Returns a boolean indicating whether the stream is finished.
-     */    async ha() {
-        const t = await this.sa.read();
+     */    async hc() {
+        const t = await this.sc.read();
         if (!t.done) {
             const e = new Uint8Array(this.buffer.length + t.value.length);
             e.set(this.buffer), e.set(t.value, this.buffer.length), this.buffer = e;
@@ -14024,7 +14024,7 @@ class qa {
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
  */
-class ja {
+class jc {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -14052,11 +14052,11 @@ class ja {
                 const e = is(n.k, t);
                 o.set(e.key.toString(), e);
             }));
-            const a = [];
+            const c = [];
             return e.forEach((t => {
                 const e = o.get(t.toString());
-                B(!!e), a.push(e);
-            })), a;
+                B(!!e), c.push(e);
+            })), c;
         }(this.datastore, t);
         return e.forEach((t => this.recordVersion(t))), e;
     }
@@ -14098,7 +14098,7 @@ class ja {
         if (t.isFoundDocument()) e = t.version; else {
             if (!t.isNoDocument()) throw L();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
-            e = ct.min();
+            e = at.min();
         }
         const n = this.readVersions.get(t.key.toString());
         if (n) {
@@ -14121,7 +14121,7 @@ class ja {
         // The first time a document is written, we want to take into account the
         // read time and existence
                 if (!this.writtenDocs.has(t.toString()) && e) {
-            if (e.isEqual(ct.min())) 
+            if (e.isEqual(at.min())) 
             // The document doesn't exist, so fail the transaction.
             // This has to be validated locally because you can't send a
             // precondition that a document does not exist without changing the
@@ -14165,29 +14165,29 @@ class ja {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class Qa {
+class Qc {
     constructor(t, e, n, s) {
         this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = s, 
-        this.la = 5, this.ur = new eo(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.lc = 5, this.ur = new eo(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
-        this.la -= 1, this.fa();
+        this.lc -= 1, this.fc();
     }
-    fa() {
+    fc() {
         this.ur.Zi((async () => {
-            const t = new ja(this.datastore), e = this.da(t);
+            const t = new jc(this.datastore), e = this.dc(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
                 })).catch((t => {
-                    this.wa(t);
+                    this.wc(t);
                 }))));
             })).catch((t => {
-                this.wa(t);
+                this.wc(t);
             }));
         }));
     }
-    da(t) {
+    dc(t) {
         try {
             const e = this.updateFunction(t);
             return !bt(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
@@ -14197,11 +14197,11 @@ class Qa {
             return this.deferred.reject(t), null;
         }
     }
-    wa(t) {
-        this.la > 0 && this._a(t) ? (this.la -= 1, this.asyncQueue.enqueueAndForget((() => (this.fa(), 
+    wc(t) {
+        this.lc > 0 && this._c(t) ? (this.lc -= 1, this.asyncQueue.enqueueAndForget((() => (this.fc(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
-    _a(t) {
+    _c(t) {
         if ("FirebaseError" === t.name) {
             // In transactions, the backend will fail outdated reads with FAILED_PRECONDITION and
             // non-matching document versions with ABORTED. These errors should be retried.
@@ -14233,7 +14233,7 @@ class Qa {
  * pieces of the client SDK architecture. It is responsible for creating the
  * async queue that is shared by all of the other components in the system.
  */
-class Wa {
+class Wc {
     constructor(t, e, 
     /**
      * Asynchronous queue responsible for all of our internal processing. When
@@ -14291,7 +14291,7 @@ class Wa {
     }
 }
 
-async function Ga(t, e) {
+async function Gc(t, e) {
     t.asyncQueue.verifyOperationInProgress(), $("FirestoreClient", "Initializing OfflineComponentProvider");
     const n = await t.getConfiguration();
     await e.initialize(n);
@@ -14304,9 +14304,9 @@ async function Ga(t, e) {
     e.persistence.setDatabaseDeletedListener((() => t.terminate())), t.offlineComponents = e;
 }
 
-async function za(t, e) {
+async function zc(t, e) {
     t.asyncQueue.verifyOperationInProgress();
-    const n = await Ha(t);
+    const n = await Hc(t);
     $("FirestoreClient", "Initializing OnlineComponentProvider");
     const s = await t.getConfiguration();
     await e.initialize(n, s), 
@@ -14322,55 +14322,55 @@ async function za(t, e) {
                 n.Gr.add(3 /* CredentialChange */), await uo(n), s && 
         // Don't set the network status to Unknown if we are offline.
         n.Jr.set("Unknown" /* Unknown */), await n.remoteSyncer.handleCredentialChange(e), 
-        n.Gr.delete(3 /* CredentialChange */), await co(n);
+        n.Gr.delete(3 /* CredentialChange */), await ao(n);
     }(e.remoteStore, t))), t.onlineComponents = e;
 }
 
-async function Ha(t) {
+async function Hc(t) {
     return t.offlineComponents || ($("FirestoreClient", "Using default OfflineComponentProvider"), 
-    await Ga(t, new Oa)), t.offlineComponents;
+    await Gc(t, new Oc)), t.offlineComponents;
 }
 
-async function Ja(t) {
+async function Jc(t) {
     return t.onlineComponents || ($("FirestoreClient", "Using default OnlineComponentProvider"), 
-    await za(t, new Ba)), t.onlineComponents;
+    await zc(t, new Bc)), t.onlineComponents;
 }
 
-function Ya(t) {
-    return Ha(t).then((t => t.persistence));
+function Yc(t) {
+    return Hc(t).then((t => t.persistence));
 }
 
-function Xa(t) {
-    return Ha(t).then((t => t.localStore));
+function Xc(t) {
+    return Hc(t).then((t => t.localStore));
 }
 
-function Za(t) {
-    return Ja(t).then((t => t.remoteStore));
+function Zc(t) {
+    return Jc(t).then((t => t.remoteStore));
 }
 
-function tc(t) {
-    return Ja(t).then((t => t.syncEngine));
+function ta(t) {
+    return Jc(t).then((t => t.syncEngine));
 }
 
-async function ec(t) {
-    const e = await Ja(t), n = e.eventManager;
-    return n.onListen = ra.bind(null, e.syncEngine), n.onUnlisten = aa.bind(null, e.syncEngine), 
+async function ea(t) {
+    const e = await Jc(t), n = e.eventManager;
+    return n.onListen = rc.bind(null, e.syncEngine), n.onUnlisten = cc.bind(null, e.syncEngine), 
     n;
 }
 
-/** Enables the network connection and re-enqueues all pending operations. */ function nc(t) {
+/** Enables the network connection and re-enqueues all pending operations. */ function na(t) {
     return t.asyncQueue.enqueue((async () => {
-        const e = await Ya(t), n = await Za(t);
+        const e = await Yc(t), n = await Zc(t);
         return e.setNetworkEnabled(!0), function(t) {
             const e = q(t);
-            return e.Gr.delete(0 /* UserDisabled */), co(e);
+            return e.Gr.delete(0 /* UserDisabled */), ao(e);
         }(n);
     }));
 }
 
-/** Disables the network connection. Pending operations will not complete. */ function sc(t) {
+/** Disables the network connection. Pending operations will not complete. */ function sa(t) {
     return t.asyncQueue.enqueue((async () => {
-        const e = await Ya(t), n = await Za(t);
+        const e = await Yc(t), n = await Zc(t);
         return e.setNetworkEnabled(!1), async function(t) {
             const e = q(t);
             e.Gr.add(0 /* UserDisabled */), await uo(e), 
@@ -14384,7 +14384,7 @@ async function ec(t) {
  * Returns a Promise that resolves when all writes that were pending at the time
  * this method was called received server acknowledgement. An acknowledgement
  * can be either acceptance or rejection.
- */ function ic(t, e) {
+ */ function ia(t, e) {
     const n = new Q;
     return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {
         try {
@@ -14401,19 +14401,19 @@ async function ec(t) {
     /**
  * Retrieves a latency-compensated document from the backend via a
  * SnapshotListener.
- */ (await Xa(t), e, n))), n.promise;
+ */ (await Xc(t), e, n))), n.promise;
 }
 
-function rc(t, e, n = {}) {
+function ra(t, e, n = {}) {
     const s = new Q;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new qa({
+        const r = new qc({
             next: r => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
                 e.enqueueAndForget((() => jo(t, o)));
-                const a = r.docs.has(n);
-                !a && r.fromCache ? 
+                const c = r.docs.has(n);
+                !c && r.fromCache ? 
                 // TODO(dimond): If we're online and the document doesn't
                 // exist then we resolve with a doc.exists set to false. If
                 // we're offline however, we reject the Promise in this
@@ -14421,7 +14421,7 @@ function rc(t, e, n = {}) {
                 // the server so we can deliver that even when you're
                 // offline 2) Actually reject the Promise in the online case
                 // if the document doesn't exist.
-                i.reject(new j(K.UNAVAILABLE, "Failed to get document because the client is offline.")) : a && r.fromCache && s && "server" === s.source ? i.reject(new j(K.UNAVAILABLE, 'Failed to get document from server. (However, this document does exist in the local cache. Run again without setting source to "server" to retrieve the cached document.)')) : i.resolve(r);
+                i.reject(new j(K.UNAVAILABLE, "Failed to get document because the client is offline.")) : c && r.fromCache && s && "server" === s.source ? i.reject(new j(K.UNAVAILABLE, 'Failed to get document from server. (However, this document does exist in the local cache. Run again without setting source to "server" to retrieve the cached document.)')) : i.resolve(r);
             },
             error: t => i.reject(t)
         }), o = new zo(ge(n.path), r, {
@@ -14429,15 +14429,15 @@ function rc(t, e, n = {}) {
             wo: !0
         });
         return Ko(t, o);
-    }(await ec(t), t.asyncQueue, e, n, s))), s.promise;
+    }(await ea(t), t.asyncQueue, e, n, s))), s.promise;
 }
 
-function oc(t, e) {
+function oa(t, e) {
     const n = new Q;
     return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {
         try {
             const s = await Er(t, e, 
-            /* usePreviousResults= */ !0), i = new ea(e, s.zn), r = i.bo(s.documents), o = i.applyChanges(r, 
+            /* usePreviousResults= */ !0), i = new ec(e, s.zn), r = i.bo(s.documents), o = i.applyChanges(r, 
             /* updateLimboDocuments= */ !1);
             n.resolve(o.snapshot);
         } catch (t) {
@@ -14448,13 +14448,13 @@ function oc(t, e) {
     /**
  * Retrieves a latency-compensated query snapshot from the backend via a
  * SnapshotListener.
- */ (await Xa(t), e, n))), n.promise;
+ */ (await Xc(t), e, n))), n.promise;
 }
 
-function ac(t, e, n = {}) {
+function ca(t, e, n = {}) {
     const s = new Q;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new qa({
+        const r = new qc({
             next: n => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
@@ -14466,20 +14466,20 @@ function ac(t, e, n = {}) {
             wo: !0
         });
         return Ko(t, o);
-    }(await ec(t), t.asyncQueue, e, n, s))), s.promise;
+    }(await ea(t), t.asyncQueue, e, n, s))), s.promise;
 }
 
-function cc(t, e) {
-    const n = new qa(e);
+function aa(t, e) {
+    const n = new qc(e);
     return t.asyncQueue.enqueueAndForget((async () => function(t, e) {
         q(t).io.add(e), 
         // Immediately fire an initial event, indicating all existing listeners
         // are in-sync.
         e.next();
-    }(await ec(t), n))), () => {
-        n.na(), t.asyncQueue.enqueueAndForget((async () => function(t, e) {
+    }(await ea(t), n))), () => {
+        n.nc(), t.asyncQueue.enqueueAndForget((async () => function(t, e) {
             q(t).io.delete(e);
-        }(await ec(t), n)));
+        }(await ea(t), n)));
     };
 }
 
@@ -14497,25 +14497,25 @@ function cc(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 uc(t, e) {
+ */ function ua(t, e) {
     const n = new Q;
     return t.asyncQueue.enqueueAndForget((async () => {
         const s = await function(t) {
-            return Ja(t).then((t => t.datastore));
+            return Jc(t).then((t => t.datastore));
         }(t);
-        new Qa(t.asyncQueue, s, e, n).run();
+        new Qc(t.asyncQueue, s, e, n).run();
     })), n.promise;
 }
 
-function hc(t, e, n, s) {
+function ha(t, e, n, s) {
     const i = function(t, e) {
         let n;
         n = "string" == typeof t ? (new TextEncoder).encode(t) : t;
         return function(t, e) {
-            return new Ka(t, e);
+            return new Kc(t, e);
         }(function(t, e) {
-            if (t instanceof Uint8Array) return Ua(t, e);
-            if (t instanceof ArrayBuffer) return Ua(new Uint8Array(t), e);
+            if (t instanceof Uint8Array) return Uc(t, e);
+            if (t instanceof ArrayBuffer) return Uc(new Uint8Array(t), e);
             if (t instanceof ReadableStream) return t.getReader();
             throw new Error("Source of `toByteStreamReader` has to be a ArrayBuffer or ReadableStream");
         }(n), e);
@@ -14537,18 +14537,18 @@ function hc(t, e, n, s) {
  * limitations under the License.
  */ (n, to(e));
     t.asyncQueue.enqueueAndForget((async () => {
-        Fa(await tc(t), i, s);
+        Fc(await ta(t), i, s);
     }));
 }
 
-function lc(t, e) {
+function la(t, e) {
     return t.asyncQueue.enqueue((async () => function(t, e) {
         const n = q(t);
         return n.persistence.runTransaction("Get named query", "readonly", (t => n.Ye.getNamedQuery(t, e)));
-    }(await Xa(t), e)));
+    }(await Xc(t), e)));
 }
 
-class fc {
+class fa {
     /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -14566,9 +14566,9 @@ class fc {
      * @param useFetchStreams Whether to use the Fetch API instead of
      * XMLHTTPRequest
      */
-    constructor(t, e, n, s, i, r, o, a) {
+    constructor(t, e, n, s, i, r, o, c) {
         this.databaseId = t, this.appId = e, this.persistenceKey = n, this.host = s, this.ssl = i, 
-        this.forceLongPolling = r, this.autoDetectLongPolling = o, this.useFetchStreams = a;
+        this.forceLongPolling = r, this.autoDetectLongPolling = o, this.useFetchStreams = c;
     }
 }
 
@@ -14577,7 +14577,7 @@ class fc {
  * Represents the database ID a Firestore client is associated with.
  * @internal
  */
-class dc {
+class da {
     constructor(t, e) {
         this.projectId = t, this.database = e || "(default)";
     }
@@ -14585,7 +14585,7 @@ class dc {
         return "(default)" === this.database;
     }
     isEqual(t) {
-        return t instanceof dc && t.projectId === this.projectId && t.database === this.database;
+        return t instanceof da && t.projectId === this.projectId && t.database === this.database;
     }
 }
 
@@ -14604,7 +14604,7 @@ class dc {
  * 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 wc = new Map;
+ */ const wa = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -14626,28 +14626,28 @@ class dc {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function _c(t, e, n) {
+function _a(t, e, n) {
     if (!n) throw new j(K.INVALID_ARGUMENT, `Function ${t}() cannot be called with an empty ${e}.`);
 }
 
 /**
  * Validates that two boolean options are not set at the same time.
  * @internal
- */ function mc(t, e, n, s) {
+ */ function ma(t, e, n, s) {
     if (!0 === e && !0 === s) throw new j(K.INVALID_ARGUMENT, `${t} and ${n} cannot be used together.`);
 }
 
 /**
  * Validates that `path` refers to a document (indicated by the fact it contains
  * an even numbers of segments).
- */ function gc(t) {
+ */ function ga(t) {
     if (!St.isDocumentKey(t)) throw new j(K.INVALID_ARGUMENT, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
  * Validates that `path` refers to a collection (indicated by the fact it
  * contains an odd numbers of segments).
- */ function yc(t) {
+ */ function ya(t) {
     if (St.isDocumentKey(t)) throw new j(K.INVALID_ARGUMENT, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
@@ -14656,7 +14656,7 @@ function _c(t, e, n) {
  * (i.e. excludes Array, Date, etc.).
  */
 /** Returns a string describing the type / value of the provided input. */
-function pc(t) {
+function pa(t) {
     if (void 0 === t) return "undefined";
     if (null === t) return "null";
     if ("string" == typeof t) return t.length > 20 && (t = `${t.substring(0, 20)}...`), 
@@ -14685,7 +14685,7 @@ function pc(t) {
     return "function" == typeof t ? "a function" : L();
 }
 
-function Tc(t, 
+function Ta(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     if ("_delegate" in t && (
@@ -14694,14 +14694,14 @@ e) {
     t = t._delegate), !(t instanceof e)) {
         if (e.name === t.constructor.name) throw new j(K.INVALID_ARGUMENT, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
-            const n = pc(t);
+            const n = pa(t);
             throw new j(K.INVALID_ARGUMENT, `Expected type '${e.name}', but it was: ${n}`);
         }
     }
     return t;
 }
 
-function Ec(t, e) {
+function Ea(t, e) {
     if (e <= 0) throw new j(K.INVALID_ARGUMENT, `Function ${t}() requires a positive number, but it was: ${e}.`);
 }
 
@@ -14727,7 +14727,7 @@ function Ec(t, e) {
  * user-supplied `FirestoreSettings` object. This is a separate type so that
  * defaults can be supplied and the value can be checked for equality.
  */
-class Ic {
+class Ia {
     constructor(t) {
         var e;
         if (void 0 === t.host) {
@@ -14740,7 +14740,7 @@ class Ic {
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
-        this.useFetchStreams = !!t.useFetchStreams, mc("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
+        this.useFetchStreams = !!t.useFetchStreams, ma("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
     }
     isEqual(t) {
         return this.host === t.host && this.ssl === t.ssl && this.credentials === t.credentials && this.cacheSizeBytes === t.cacheSizeBytes && this.experimentalForceLongPolling === t.experimentalForceLongPolling && this.experimentalAutoDetectLongPolling === t.experimentalAutoDetectLongPolling && this.ignoreUndefinedProperties === t.ignoreUndefinedProperties && this.useFetchStreams === t.useFetchStreams;
@@ -14767,18 +14767,18 @@ class Ic {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class Ac {
+ */ class Aa {
     /** @hideconstructor */
     constructor(t, e, n) {
         this._authCredentials = e, this._appCheckCredentials = n, 
         /**
          * Whether it's a Firestore or Firestore Lite instance.
          */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new Ic({}), 
-        this._settingsFrozen = !1, t instanceof dc ? this._databaseId = t : (this._app = t, 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new Ia({}), 
+        this._settingsFrozen = !1, t instanceof da ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
             if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new j(K.INVALID_ARGUMENT, '"projectId" not provided in firebase.initializeApp.');
-            return new dc(t.options.projectId);
+            return new da(t.options.projectId);
         }
         /**
  * Modify this instance to communicate with the Cloud Firestore emulator.
@@ -14809,7 +14809,7 @@ class Ic {
     }
     _setSettings(t) {
         if (this._settingsFrozen) throw new j(K.FAILED_PRECONDITION, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
-        this._settings = new Ic(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new Ia(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new G;
             switch (t.type) {
               case "gapi":
@@ -14854,15 +14854,15 @@ class Ic {
  * when the `Firestore` instance is terminated.
  */
         return function(t) {
-            const e = wc.get(t);
-            e && ($("ComponentProvider", "Removing Datastore"), wc.delete(t), e.terminate());
+            const e = wa.get(t);
+            e && ($("ComponentProvider", "Removing Datastore"), wa.delete(t), e.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function Rc(t, e, n, s = {}) {
+function Ra(t, e, n, s = {}) {
     var i;
-    const r = (t = Tc(t, Ac))._getSettings();
+    const r = (t = Ta(t, Aa))._getSettings();
     if ("firestore.googleapis.com" !== r.host && r.host !== e && O("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, r), {
         host: `${e}:${n}`,
@@ -14901,7 +14901,7 @@ function Rc(t, e, n, s = {}) {
  * A `DocumentReference` refers to a document location in a Firestore database
  * and can be used to write, read, or listen to the location. The document at
  * the referenced location may or may not exist.
- */ class Pc {
+ */ class Pa {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -14929,17 +14929,17 @@ function Rc(t, e, n, s = {}) {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new vc(this.firestore, this.converter, this._key.path.popLast());
+        return new va(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new Pc(this.firestore, t, this._key);
+        return new Pa(this.firestore, t, this._key);
     }
 }
 
 /**
  * A `Query` refers to a query which you can read or listen to. You can also
  * construct refined `Query` objects by adding filters and ordering.
- */ class bc {
+ */ class ba {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -14952,14 +14952,14 @@ function Rc(t, e, n, s = {}) {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new bc(this.firestore, t, this._query);
+        return new ba(this.firestore, t, this._query);
     }
 }
 
 /**
  * A `CollectionReference` object can be used for adding documents, getting
  * document references, and querying for documents (using {@link query}).
- */ class vc extends bc {
+ */ class va extends ba {
     /** @hideconstructor */
     constructor(t, e, n) {
         super(t, e, ge(n)), this._path = n, 
@@ -14980,23 +14980,23 @@ function Rc(t, e, n, s = {}) {
      * subcollection. If this isn't a subcollection, the reference is null.
      */    get parent() {
         const t = this._path.popLast();
-        return t.isEmpty() ? null : new Pc(this.firestore, 
+        return t.isEmpty() ? null : new Pa(this.firestore, 
         /* converter= */ null, new St(t));
     }
     withConverter(t) {
-        return new vc(this.firestore, t, this._path);
+        return new va(this.firestore, t, this._path);
     }
 }
 
-function Vc(t, e, ...n) {
-    if (t = getModularInstance(t), _c("collection", "path", e), t instanceof Ac) {
+function Va(t, e, ...n) {
+    if (t = getModularInstance(t), _a("collection", "path", e), t instanceof Aa) {
         const s = dt.fromString(e, ...n);
-        return yc(s), new vc(t, /* converter= */ null, s);
+        return ya(s), new va(t, /* converter= */ null, s);
     }
     {
-        if (!(t instanceof Pc || t instanceof vc)) throw new j(K.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof Pa || t instanceof va)) throw new j(K.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(dt.fromString(e, ...n));
-        return yc(s), new vc(t.firestore, 
+        return ya(s), new va(t.firestore, 
         /* converter= */ null, s);
     }
 }
@@ -15013,9 +15013,9 @@ function Vc(t, e, ...n) {
  * collection or subcollection with this ID as the last segment of its path
  * will be included. Cannot contain a slash.
  * @returns The created `Query`.
- */ function Sc(t, e) {
-    if (t = Tc(t, Ac), _c("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new j(K.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new bc(t, 
+ */ function Sa(t, e) {
+    if (t = Ta(t, Aa), _a("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new j(K.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new ba(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
@@ -15026,19 +15026,19 @@ function Vc(t, e, ...n) {
     }(e));
 }
 
-function Dc(t, e, ...n) {
+function Da(t, e, ...n) {
     if (t = getModularInstance(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = st.A()), _c("doc", "path", e), t instanceof Ac) {
+    1 === arguments.length && (e = st.A()), _a("doc", "path", e), t instanceof Aa) {
         const s = dt.fromString(e, ...n);
-        return gc(s), new Pc(t, 
+        return ga(s), new Pa(t, 
         /* converter= */ null, new St(s));
     }
     {
-        if (!(t instanceof Pc || t instanceof vc)) throw new j(K.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof Pa || t instanceof va)) throw new j(K.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(dt.fromString(e, ...n));
-        return gc(s), new Pc(t.firestore, t instanceof vc ? t.converter : null, new St(s));
+        return ga(s), new Pa(t.firestore, t instanceof va ? t.converter : null, new St(s));
     }
 }
 
@@ -15049,8 +15049,8 @@ function Dc(t, e, ...n) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function Cc(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof Pc || t instanceof vc) && (e instanceof Pc || e instanceof vc) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+ */ function Ca(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof Pa || t instanceof va) && (e instanceof Pa || e instanceof va) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -15061,8 +15061,8 @@ function Dc(t, e, ...n) {
  * @param right - A `Query` to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function Nc(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), t instanceof bc && e instanceof bc && (t.firestore === e.firestore && be(t._query, e._query) && t.converter === e.converter);
+ */ function Na(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), t instanceof ba && e instanceof ba && (t.firestore === e.firestore && be(t._query, e._query) && t.converter === e.converter);
 }
 
 /**
@@ -15080,42 +15080,42 @@ function Dc(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 kc {
+ */ class ka {
     constructor() {
         // The last promise in the queue.
-        this.ma = Promise.resolve(), 
+        this.mc = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.ga = [], 
+        this.gc = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.ya = !1, 
+        this.yc = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.pa = [], 
+        this.Tc = [], 
         // visible for testing
-        this.Ta = null, 
+        this.Ec = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.Ea = !1, 
+        this.Ic = !1, 
         // Enabled during shutdown on Safari to prevent future access to IndexedDB.
-        this.Ia = !1, 
+        this.Ac = !1, 
         // List of TimerIds to fast-forward delays for.
-        this.Aa = [], 
+        this.Rc = [], 
         // Backoff timer used to schedule retries for retryable operations
         this.ur = new eo(this, "async_queue_retry" /* AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
-        this.Ra = () => {
+        this.Pc = () => {
             const t = Zr();
             t && $("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.ur.er();
         };
         const t = Zr();
-        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ra);
+        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Pc);
     }
     get isShuttingDown() {
-        return this.ya;
+        return this.yc;
     }
     /**
      * Adds a new operation to the queue without waiting for it to complete (i.e.
@@ -15125,44 +15125,44 @@ function Dc(t, e, ...n) {
         this.enqueue(t);
     }
     enqueueAndForgetEvenWhileRestricted(t) {
-        this.Pa(), 
+        this.bc(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.ba(t);
+        this.vc(t);
     }
     enterRestrictedMode(t) {
-        if (!this.ya) {
-            this.ya = !0, this.Ia = t || !1;
+        if (!this.yc) {
+            this.yc = !0, this.Ac = t || !1;
             const e = Zr();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ra);
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Pc);
         }
     }
     enqueue(t) {
-        if (this.Pa(), this.ya) 
+        if (this.bc(), this.yc) 
         // Return a Promise which never resolves.
         return new Promise((() => {}));
         // Create a deferred Promise that we can return to the callee. This
         // allows us to return a "hanging Promise" only to the callee and still
         // advance the queue even when the operation is not run.
                 const e = new Q;
-        return this.ba((() => this.ya && this.Ia ? Promise.resolve() : (t().then(e.resolve, e.reject), 
+        return this.vc((() => this.yc && this.Ac ? Promise.resolve() : (t().then(e.resolve, e.reject), 
         e.promise))).then((() => e.promise));
     }
     enqueueRetryable(t) {
-        this.enqueueAndForget((() => (this.ga.push(t), this.va())));
+        this.enqueueAndForget((() => (this.gc.push(t), this.Vc())));
     }
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
-     */    async va() {
-        if (0 !== this.ga.length) {
+     */    async Vc() {
+        if (0 !== this.gc.length) {
             try {
-                await this.ga[0](), this.ga.shift(), this.ur.reset();
+                await this.gc[0](), this.gc.shift(), this.ur.reset();
             } catch (t) {
                 if (!Xs(t)) throw t;
  // Failure will be handled by AsyncQueue
                                 $("AsyncQueue", "Operation failed with retryable error: " + t);
             }
-            this.ga.length > 0 && 
+            this.gc.length > 0 && 
             // If there are additional operations, we re-schedule `retryNextOp()`.
             // This is necessary to run retryable operations that failed during
             // their initial attempt since we don't know whether they are already
@@ -15173,12 +15173,12 @@ function Dc(t, e, ...n) {
             // Since `backoffAndRun()` cancels an existing backoff and schedules a
             // new backoff on every call, there is only ever a single additional
             // operation in the queue.
-            this.ur.Zi((() => this.va()));
+            this.ur.Zi((() => this.Vc()));
         }
     }
-    ba(t) {
-        const e = this.ma.then((() => (this.Ea = !0, t().catch((t => {
-            this.Ta = t, this.Ea = !1;
+    vc(t) {
+        const e = this.mc.then((() => (this.Ic = !0, t().catch((t => {
+            this.Ec = t, this.Ic = !1;
             const e = 
             /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -15210,38 +15210,38 @@ function Dc(t, e, ...n) {
             // all further attempts to chain (via .then) will just short-circuit
             // and return the rejected Promise.
             throw F("INTERNAL UNHANDLED ERROR: ", e), t;
-        })).then((t => (this.Ea = !1, t))))));
-        return this.ma = e, e;
+        })).then((t => (this.Ic = !1, t))))));
+        return this.mc = e, e;
     }
     enqueueAfterDelay(t, e, n) {
-        this.Pa(), 
+        this.bc(), 
         // Fast-forward delays for timerIds that have been overriden.
-        this.Aa.indexOf(t) > -1 && (e = 0);
-        const s = Fo.createAndSchedule(this, t, e, n, (t => this.Va(t)));
-        return this.pa.push(s), s;
+        this.Rc.indexOf(t) > -1 && (e = 0);
+        const s = Fo.createAndSchedule(this, t, e, n, (t => this.Sc(t)));
+        return this.Tc.push(s), s;
     }
-    Pa() {
-        this.Ta && L();
+    bc() {
+        this.Ec && L();
     }
     verifyOperationInProgress() {}
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
-     */    async Sa() {
+     */    async Dc() {
         // Operations in the queue prior to draining may have enqueued additional
         // operations. Keep draining the queue until the tail is no longer advanced,
         // which indicates that no more new operations were enqueued and that all
         // operations were executed.
         let t;
         do {
-            t = this.ma, await t;
-        } while (t !== this.ma);
+            t = this.mc, await t;
+        } while (t !== this.mc);
     }
     /**
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
-     */    Da(t) {
-        for (const e of this.pa) if (e.timerId === t) return !0;
+     */    Cc(t) {
+        for (const e of this.Tc) if (e.timerId === t) return !0;
         return !1;
     }
     /**
@@ -15250,28 +15250,28 @@ function Dc(t, e, ...n) {
      * @param lastTimerId - Delayed operations up to and including this TimerId
      * will be drained. Pass TimerId.All to run all delayed operations.
      * @returns a Promise that resolves once all operations have been run.
-     */    Ca(t) {
+     */    Nc(t) {
         // Note that draining may generate more delayed ops, so we do that first.
-        return this.Sa().then((() => {
+        return this.Dc().then((() => {
             // Run ops in the same order they'd run if they ran naturally.
-            this.pa.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
-            for (const e of this.pa) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
-            return this.Sa();
+            this.Tc.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
+            for (const e of this.Tc) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
+            return this.Dc();
         }));
     }
     /**
      * For Tests: Skip all subsequent delays for a timer id.
-     */    Na(t) {
-        this.Aa.push(t);
+     */    kc(t) {
+        this.Rc.push(t);
     }
-    /** Called once a DelayedOperation is run or canceled. */    Va(t) {
+    /** Called once a DelayedOperation is run or canceled. */    Sc(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        const e = this.pa.indexOf(t);
-        this.pa.splice(e, 1);
+        const e = this.Tc.indexOf(t);
+        this.Tc.splice(e, 1);
     }
 }
 
-function xc(t) {
+function xa(t) {
     /**
  * Returns true if obj is an object and contains at least one of the specified
  * methods.
@@ -15306,7 +15306,7 @@ function xc(t) {
  */ (t, [ "next", "error", "complete" ]);
 }
 
-class $c {
+class $a {
     constructor() {
         this._progressObserver = {}, this._taskCompletionResolver = new Q, this._lastProgress = {
             taskState: "Running",
@@ -15390,27 +15390,27 @@ class $c {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** DOMException error code constants. */ const Fc = -1;
+/** DOMException error code constants. */ const Fa = -1;
 
 /**
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
  */
-class Oc extends Ac {
+class Oa extends Aa {
     /** @hideconstructor */
     constructor(t, e, n) {
         super(t, e, n), 
         /**
          * Whether it's a {@link Firestore} or Firestore Lite instance.
          */
-        this.type = "firestore", this._queue = new kc, this._persistenceKey = "name" in t ? t.name : "[DEFAULT]";
+        this.type = "firestore", this._queue = new ka, this._persistenceKey = "name" in t ? t.name : "[DEFAULT]";
     }
     _terminate() {
         return this._firestoreClient || 
         // The client must be initialized to ensure that all subsequent API
         // usage throws an exception.
-        Uc(this), this._firestoreClient.terminate();
+        Ua(this), this._firestoreClient.terminate();
     }
 }
 
@@ -15424,7 +15424,7 @@ class Oc extends Ac {
  * be associated.
  * @param settings - A settings object to configure the {@link Firestore} instance.
  * @returns A newly initialized {@link Firestore} instance.
- */ function Mc(t, e) {
+ */ function Ma(t, e) {
     const n = _getProvider(t, "firestore");
     if (n.isInitialized()) {
         const t = n.getImmediate(), s = n.getOptions();
@@ -15445,22 +15445,22 @@ class Oc extends Ac {
  * @param app - The {@link @firebase/app#FirebaseApp} instance that the returned {@link Firestore}
  * instance is associated with.
  * @returns The {@link Firestore} instance of the provided app.
- */ function Lc(e = getApp()) {
+ */ function La(e = getApp()) {
     return _getProvider(e, "firestore").getImmediate();
 }
 
 /**
  * @internal
- */ function Bc(t) {
-    return t._firestoreClient || Uc(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;
+ */ function Ba(t) {
+    return t._firestoreClient || Ua(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;
 }
 
-function Uc(t) {
+function Ua(t) {
     var e;
     const n = t._freezeSettings(), s = function(t, e, n, s) {
-        return new fc(t, e, n, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams);
+        return new fa(t, e, n, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams);
     }(t._databaseId, (null === (e = t._app) || void 0 === e ? void 0 : e.options.appId) || "", t._persistenceKey, n);
-    t._firestoreClient = new Wa(t._authCredentials, t._appCheckCredentials, t._queue, s);
+    t._firestoreClient = new Wc(t._authCredentials, t._appCheckCredentials, t._queue, s);
 }
 
 /**
@@ -15485,10 +15485,10 @@ function Uc(t) {
  * @param persistenceSettings - Optional settings object to configure
  * persistence.
  * @returns A `Promise` that represents successfully enabling persistent storage.
- */ function qc(t, e) {
-    Xc(t = Tc(t, Oc));
-    const n = Bc(t), s = t._freezeSettings(), i = new Ba;
-    return jc(n, i, new Ma(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
+ */ function qa(t, e) {
+    Xa(t = Ta(t, Oa));
+    const n = Ba(t), s = t._freezeSettings(), i = new Bc;
+    return ja(n, i, new Mc(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
 }
 
 /**
@@ -15512,10 +15512,10 @@ function Uc(t) {
  * @param firestore - The {@link Firestore} instance to enable persistence for.
  * @returns A `Promise` that represents successfully enabling persistent
  * storage.
- */ function Kc(t) {
-    Xc(t = Tc(t, Oc));
-    const e = Bc(t), n = t._freezeSettings(), s = new Ba;
-    return jc(e, s, new La(s, n.cacheSizeBytes));
+ */ function Ka(t) {
+    Xa(t = Ta(t, Oa));
+    const e = Ba(t), n = t._freezeSettings(), s = new Bc;
+    return ja(e, s, new Lc(s, n.cacheSizeBytes));
 }
 
 /**
@@ -15523,11 +15523,11 @@ function Uc(t) {
  * If the operation fails with a recoverable error (see
  * `canRecoverFromIndexedDbError()` below), the returned Promise is rejected
  * but the client remains usable.
- */ function jc(t, e, n) {
+ */ function ja(t, e, n) {
     const s = new Q;
     return t.asyncQueue.enqueue((async () => {
         try {
-            await Ga(t, n), await za(t, e), s.resolve();
+            await Gc(t, n), await zc(t, e), s.resolve();
         } catch (t) {
             if (!
             /**
@@ -15581,7 +15581,7 @@ function Uc(t) {
     })).then((() => s.promise));
 }
 
-function Qc(t) {
+function Qa(t) {
     if (t._initialized && !t._terminated) throw new j(K.FAILED_PRECONDITION, "Persistence can only be cleared before a Firestore instance is initialized or after it is terminated.");
     const e = new Q;
     return t._queue.enqueueAndForgetEvenWhileRestricted((async () => {
@@ -15612,11 +15612,11 @@ function Qc(t) {
  *
  * @returns A `Promise` which resolves when all currently pending writes have been
  * acknowledged by the backend.
- */ function Wc(t) {
+ */ function Wa(t) {
     return function(t) {
         const e = new Q;
-        return t.asyncQueue.enqueueAndForget((async () => wa(await tc(t), e))), e.promise;
-    }(Bc(t = Tc(t, Oc)));
+        return t.asyncQueue.enqueueAndForget((async () => wc(await ta(t), e))), e.promise;
+    }(Ba(t = Ta(t, Oa)));
 }
 
 /**
@@ -15624,8 +15624,8 @@ function Qc(t) {
  * call to {@link disableNetwork}.
  *
  * @returns A `Promise` that is resolved once the network has been enabled.
- */ function Gc(t) {
-    return nc(Bc(t = Tc(t, Oc)));
+ */ function Ga(t) {
+    return na(Ba(t = Ta(t, Oa)));
 }
 
 /**
@@ -15635,8 +15635,8 @@ function Qc(t) {
  * operations will be queued until the network is restored.
  *
  * @returns A `Promise` that is resolved once the network has been disabled.
- */ function zc(t) {
-    return sc(Bc(t = Tc(t, Oc)));
+ */ function za(t) {
+    return sa(Ba(t = Ta(t, Oa)));
 }
 
 /**
@@ -15660,7 +15660,7 @@ function Qc(t) {
  *
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function Hc(t) {
+ */ function Ha(t) {
     return _removeServiceInstance(t.app, "firestore"), t._delete();
 }
 
@@ -15674,9 +15674,9 @@ function Qc(t) {
  * @returns
  *   A `LoadBundleTask` object, which notifies callers with progress updates, and completion
  *   or error events. It can be used as a `Promise<LoadBundleTaskProgress>`.
- */ function Jc(t, e) {
-    const n = Bc(t = Tc(t, Oc)), s = new $c;
-    return hc(n, t._databaseId, e, s), s;
+ */ function Ja(t, e) {
+    const n = Ba(t = Ta(t, Oa)), s = new $a;
+    return ha(n, t._databaseId, e, s), s;
 }
 
 /**
@@ -15685,11 +15685,11 @@ function Qc(t) {
  * The named queries are packaged  into bundles on the server side (along
  * with resulting documents), and loaded to local cache using `loadBundle`. Once in local
  * cache, use this method to extract a {@link Query} by name.
- */ function Yc(t, e) {
-    return lc(Bc(t = Tc(t, Oc)), e).then((e => e ? new bc(t, null, e.query) : null));
+ */ function Ya(t, e) {
+    return la(Ba(t = Ta(t, Oa)), e).then((e => e ? new ba(t, null, e.query) : null));
 }
 
-function Xc(t) {
+function Xa(t) {
     if (t._initialized || t._terminated) throw new j(K.FAILED_PRECONDITION, "Firestore has already been started and persistence can no longer be enabled. You can only enable persistence before calling any other methods on a Firestore object.");
 }
 
@@ -15733,7 +15733,7 @@ function Xc(t) {
  * Create a `FieldPath` by providing field names. If more than one field
  * name is provided, the path will point to a nested field in a document.
  */
-class Zc {
+class Za {
     /**
      * Creates a `FieldPath` from the provided field names. If more than one field
      * name is provided, the path will point to a nested field in a document.
@@ -15758,7 +15758,7 @@ class Zc {
  * Returns a special sentinel `FieldPath` to refer to the ID of a document.
  * It can be used in queries to sort or filter by the document ID.
  */ function tu() {
-    return new Zc("__name__");
+    return new Za("__name__");
 }
 
 /**
@@ -15966,7 +15966,7 @@ class Zc {
     }
 }
 
-function au(t) {
+function cu(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -15984,7 +15984,7 @@ function au(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class cu {
+/** A "context" object passed around while parsing user data. */ class au {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -16007,55 +16007,55 @@ function au(t) {
         this.settings = t, this.databaseId = e, this.k = n, this.ignoreUndefinedProperties = s, 
         // Minor hack: If fieldTransforms is undefined, we assume this is an
         // external call and we need to validate the entire path.
-        void 0 === i && this.ka(), this.fieldTransforms = i || [], this.fieldMask = r || [];
+        void 0 === i && this.xc(), this.fieldTransforms = i || [], this.fieldMask = r || [];
     }
     get path() {
         return this.settings.path;
     }
-    get xa() {
-        return this.settings.xa;
+    get $c() {
+        return this.settings.$c;
     }
-    /** Returns a new context with the specified settings overwritten. */    $a(t) {
-        return new cu(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.k, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+    /** Returns a new context with the specified settings overwritten. */    Fc(t) {
+        return new au(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.k, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
-    Fa(t) {
+    Oc(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.$a({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.Fc({
             path: n,
-            Oa: !1
+            Mc: !1
         });
-        return s.Ma(t), s;
+        return s.Lc(t), s;
     }
-    La(t) {
+    Bc(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.$a({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.Fc({
             path: n,
-            Oa: !1
+            Mc: !1
         });
-        return s.ka(), s;
+        return s.xc(), s;
     }
-    Ba(t) {
+    Uc(t) {
         // TODO(b/34871131): We don't support array paths right now; so make path
         // undefined.
-        return this.$a({
+        return this.Fc({
             path: void 0,
-            Oa: !0
+            Mc: !0
         });
     }
-    Ua(t) {
-        return Vu(t, this.settings.methodName, this.settings.qa || !1, this.path, this.settings.Ka);
+    qc(t) {
+        return Vu(t, this.settings.methodName, this.settings.Kc || !1, this.path, this.settings.jc);
     }
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */    contains(t) {
         return void 0 !== this.fieldMask.find((e => t.isPrefixOf(e))) || void 0 !== this.fieldTransforms.find((e => t.isPrefixOf(e.field)));
     }
-    ka() {
+    xc() {
         // TODO(b/34871131): Remove null check once we have proper paths for fields
         // within arrays.
-        if (this.path) for (let t = 0; t < this.path.length; t++) this.Ma(this.path.get(t));
+        if (this.path) for (let t = 0; t < this.path.length; t++) this.Lc(this.path.get(t));
     }
-    Ma(t) {
-        if (0 === t.length) throw this.Ua("Document fields must not be empty");
-        if (au(this.xa) && iu.test(t)) throw this.Ua('Document fields cannot begin and end with "__"');
+    Lc(t) {
+        if (0 === t.length) throw this.qc("Document fields must not be empty");
+        if (cu(this.$c) && iu.test(t)) throw this.qc('Document fields cannot begin and end with "__"');
     }
 }
 
@@ -16066,14 +16066,14 @@ function au(t) {
     constructor(t, e, n) {
         this.databaseId = t, this.ignoreUndefinedProperties = e, this.k = n || to(t);
     }
-    /** Creates a new top-level parse context. */    ja(t, e, n, s = !1) {
-        return new cu({
-            xa: t,
+    /** Creates a new top-level parse context. */    Qc(t, e, n, s = !1) {
+        return new au({
+            $c: t,
             methodName: e,
-            Ka: n,
+            jc: n,
             path: _t.emptyPath(),
-            Oa: !1,
-            qa: s
+            Mc: !1,
+            Kc: s
         }, this.databaseId, this.k, this.ignoreUndefinedProperties);
     }
 }
@@ -16084,25 +16084,25 @@ function hu(t) {
 }
 
 /** Parse document data from a set() call. */ function lu(t, e, n, s, i, r = {}) {
-    const o = t.ja(r.merge || r.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
+    const o = t.Qc(r.merge || r.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
     Ru("Data must be an object, but it was:", o, s);
-    const a = Iu(s, o);
-    let c, u;
-    if (r.merge) c = new mt(o.fieldMask), u = o.fieldTransforms; else if (r.mergeFields) {
+    const c = Iu(s, o);
+    let a, u;
+    if (r.merge) a = new mt(o.fieldMask), u = o.fieldTransforms; else if (r.mergeFields) {
         const t = [];
         for (const s of r.mergeFields) {
             const i = Pu(e, s, n);
             if (!o.contains(i)) throw new j(K.INVALID_ARGUMENT, `Field '${i}' is specified in your field mask but missing from your input data.`);
             Su(t, i) || t.push(i);
         }
-        c = new mt(t), u = o.fieldTransforms.filter((t => c.covers(t.field)));
-    } else c = null, u = o.fieldTransforms;
-    return new ru(new jt(a), c, u);
+        a = new mt(t), u = o.fieldTransforms.filter((t => a.covers(t.field)));
+    } else a = null, u = o.fieldTransforms;
+    return new ru(new jt(c), a, u);
 }
 
 class fu extends nu {
     _toFieldTransform(t) {
-        if (2 /* MergeSet */ !== t.xa) throw 1 /* Update */ === t.xa ? t.Ua(`${this._methodName}() can only appear at the top level of your update data`) : t.Ua(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
+        if (2 /* MergeSet */ !== t.$c) throw 1 /* Update */ === t.$c ? t.qc(`${this._methodName}() can only appear at the top level of your update data`) : t.qc(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
         // No transform to add for a delete, but we need to add it to our
         // fieldMask so it gets deleted.
         return t.fieldMask.push(t.path), null;
@@ -16128,11 +16128,11 @@ class fu extends nu {
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
  */ function du(t, e, n) {
-    return new cu({
-        xa: 3 /* Argument */ ,
-        Ka: e.settings.Ka,
+    return new au({
+        $c: 3 /* Argument */ ,
+        jc: e.settings.jc,
         methodName: t._methodName,
-        Oa: n
+        Mc: n
     }, e.databaseId, e.k, e.ignoreUndefinedProperties);
 }
 
@@ -16147,11 +16147,11 @@ class wu extends nu {
 
 class _u extends nu {
     constructor(t, e) {
-        super(t), this.Qa = e;
+        super(t), this.Wc = e;
     }
     _toFieldTransform(t) {
         const e = du(this, t, 
-        /*array=*/ !0), n = this.Qa.map((t => Eu(t, e))), s = new Be(n);
+        /*array=*/ !0), n = this.Wc.map((t => Eu(t, e))), s = new Be(n);
         return new Ge(t.path, s);
     }
     isEqual(t) {
@@ -16162,11 +16162,11 @@ class _u extends nu {
 
 class mu extends nu {
     constructor(t, e) {
-        super(t), this.Qa = e;
+        super(t), this.Wc = e;
     }
     _toFieldTransform(t) {
         const e = du(this, t, 
-        /*array=*/ !0), n = this.Qa.map((t => Eu(t, e))), s = new qe(n);
+        /*array=*/ !0), n = this.Wc.map((t => Eu(t, e))), s = new qe(n);
         return new Ge(t.path, s);
     }
     isEqual(t) {
@@ -16177,10 +16177,10 @@ class mu extends nu {
 
 class gu extends nu {
     constructor(t, e) {
-        super(t), this.Wa = e;
+        super(t), this.Gc = e;
     }
     _toFieldTransform(t) {
-        const e = new je(t.k, xe(t.k, this.Wa));
+        const e = new je(t.k, xe(t.k, this.Gc));
         return new Ge(t.path, e);
     }
     isEqual(t) {
@@ -16190,40 +16190,40 @@ class gu extends nu {
 }
 
 /** Parse update data from an update() call. */ function yu(t, e, n, s) {
-    const i = t.ja(1 /* Update */ , e, n);
+    const i = t.Qc(1 /* Update */ , e, n);
     Ru("Data must be an object, but it was:", i, s);
     const r = [], o = jt.empty();
     ht(s, ((t, s) => {
-        const a = vu(e, t, n);
+        const c = vu(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 s = getModularInstance(s);
-        const c = i.La(a);
+        const a = i.Bc(c);
         if (s instanceof fu) 
         // Add it to the field mask, but don't add anything to updateData.
-        r.push(a); else {
-            const t = Eu(s, c);
-            null != t && (r.push(a), o.set(a, t));
+        r.push(c); else {
+            const t = Eu(s, a);
+            null != t && (r.push(c), o.set(c, t));
         }
     }));
-    const a = new mt(r);
-    return new ou(o, a, i.fieldTransforms);
+    const c = new mt(r);
+    return new ou(o, c, i.fieldTransforms);
 }
 
 /** Parse update data from a list of field/value arguments. */ function pu(t, e, n, s, i, r) {
-    const o = t.ja(1 /* Update */ , e, n), a = [ Pu(e, s, n) ], c = [ i ];
+    const o = t.Qc(1 /* Update */ , e, n), c = [ Pu(e, s, n) ], a = [ i ];
     if (r.length % 2 != 0) throw new j(K.INVALID_ARGUMENT, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
-    for (let t = 0; t < r.length; t += 2) a.push(Pu(e, r[t])), c.push(r[t + 1]);
+    for (let t = 0; t < r.length; t += 2) c.push(Pu(e, r[t])), a.push(r[t + 1]);
     const u = [], h = jt.empty();
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
-    for (let t = a.length - 1; t >= 0; --t) if (!Su(u, a[t])) {
-        const e = a[t];
-        let n = c[t];
+    for (let t = c.length - 1; t >= 0; --t) if (!Su(u, c[t])) {
+        const e = c[t];
+        let n = a[t];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 n = getModularInstance(n);
-        const s = o.La(e);
+        const s = o.Bc(e);
         if (n instanceof fu) 
         // Add it to the field mask, but don't add anything to updateData.
         u.push(e); else {
@@ -16242,7 +16242,7 @@ class gu extends nu {
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
  */ function Tu(t, e, n, s = !1) {
-    return Eu(n, t.ja(s ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+    return Eu(n, t.Qc(s ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -16270,8 +16270,8 @@ class gu extends nu {
  */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!au(e.xa)) throw e.Ua(`${t._methodName}() can only be used with update() and set()`);
-        if (!e.path) throw e.Ua(`${t._methodName}() is not currently supported inside arrays`);
+        if (!cu(e.$c)) throw e.qc(`${t._methodName}() can only be used with update() and set()`);
+        if (!e.path) throw e.qc(`${t._methodName}() is not currently supported inside arrays`);
         const n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
     }
@@ -16295,12 +16295,12 @@ class gu extends nu {
         // the set of values to be included for the IN query) that may directly
         // contain additional arrays (each representing an individual field
         // value), so we disable this validation.
-        if (e.settings.Oa && 4 /* ArrayArgument */ !== e.xa) throw e.Ua("Nested arrays are not supported");
+        if (e.settings.Mc && 4 /* ArrayArgument */ !== e.$c) throw e.qc("Nested arrays are not supported");
         return function(t, e) {
             const n = [];
             let s = 0;
             for (const i of t) {
-                let t = Eu(i, e.Ba(s));
+                let t = Eu(i, e.Uc(s));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -16327,16 +16327,16 @@ class gu extends nu {
             stringValue: t
         };
         if (t instanceof Date) {
-            const n = at.fromDate(t);
+            const n = ct.fromDate(t);
             return {
                 timestampValue: jn(e.k, n)
             };
         }
-        if (t instanceof at) {
+        if (t instanceof ct) {
             // Firestore backend truncates precision down to microseconds. To ensure
             // offline mode works the same with regards to truncation, perform the
             // truncation immediately without waiting for the backend to do that.
-            const n = new at(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            const n = new ct(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
                 timestampValue: jn(e.k, n)
             };
@@ -16350,14 +16350,14 @@ class gu extends nu {
         if (t instanceof eu) return {
             bytesValue: Qn(e.k, t._byteString)
         };
-        if (t instanceof Pc) {
+        if (t instanceof Pa) {
             const n = e.databaseId, s = t.firestore._databaseId;
-            if (!s.isEqual(n)) throw e.Ua(`Document reference is for database ${s.projectId}/${s.database} but should be for database ${n.projectId}/${n.database}`);
+            if (!s.isEqual(n)) throw e.qc(`Document reference is for database ${s.projectId}/${s.database} but should be for database ${n.projectId}/${n.database}`);
             return {
                 referenceValue: zn(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.Ua(`Unsupported field value: ${pc(t)}`);
+        throw e.qc(`Unsupported field value: ${pa(t)}`);
     }
     /**
  * Checks whether an object looks like a JSON object that should be converted
@@ -16374,7 +16374,7 @@ function Iu(t, e) {
     // If we encounter an empty object, we explicitly add it to the update
     // mask to ensure that the server creates a map entry.
     e.path && e.path.length > 0 && e.fieldMask.push(e.path) : ht(t, ((t, s) => {
-        const i = Eu(s, e.Fa(t));
+        const i = Eu(s, e.Oc(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -16384,15 +16384,15 @@ function Iu(t, e) {
 }
 
 function Au(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof at || t instanceof su || t instanceof eu || t instanceof Pc || t instanceof nu);
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof ct || t instanceof su || t instanceof eu || t instanceof Pa || t instanceof nu);
 }
 
 function Ru(t, e, n) {
     if (!Au(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
-        const s = pc(n);
-        throw "an object" === s ? e.Ua(t + " a custom object") : e.Ua(t + " " + s);
+        const s = pa(n);
+        throw "an object" === s ? e.qc(t + " a custom object") : e.qc(t + " " + s);
     }
 }
 
@@ -16402,7 +16402,7 @@ function Ru(t, e, n) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    e = getModularInstance(e)) instanceof Zc) return e._internalPath;
+    e = getModularInstance(e)) instanceof Za) return e._internalPath;
     if ("string" == typeof e) return vu(t, e);
     throw Vu("Field path arguments must be of type string or FieldPath.", t, 
     /* hasConverter= */ !1, 
@@ -16426,7 +16426,7 @@ function Ru(t, e, n) {
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return new Zc(...e.split("."))._internalPath;
+        return new Za(...e.split("."))._internalPath;
     } catch (s) {
         throw Vu(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
@@ -16436,11 +16436,11 @@ function Ru(t, e, n) {
 
 function Vu(t, e, n, s, i) {
     const r = s && !s.isEmpty(), o = void 0 !== i;
-    let a = `Function ${e}() called with invalid data`;
-    n && (a += " (via `toFirestore()`)"), a += ". ";
-    let c = "";
-    return (r || o) && (c += " (found", r && (c += ` in field ${s}`), o && (c += ` in document ${i}`), 
-    c += ")"), new j(K.INVALID_ARGUMENT, a + t + c);
+    let c = `Function ${e}() called with invalid data`;
+    n && (c += " (via `toFirestore()`)"), c += ". ";
+    let a = "";
+    return (r || o) && (a += " (found", r && (a += ` in field ${s}`), o && (a += ` in document ${i}`), 
+    a += ")"), new j(K.INVALID_ARGUMENT, c + t + a);
 }
 
 /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Su(t, e) {
@@ -16487,7 +16487,7 @@ function Vu(t, e, n, s, i) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new Pc(this._firestore, this._converter, this._key);
+        return new Pa(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -16558,7 +16558,7 @@ function Vu(t, e, n, s, i) {
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */ function Nu(t, e) {
-    return "string" == typeof e ? vu(t, e) : e instanceof Zc ? e._internalPath : e._delegate._internalPath;
+    return "string" == typeof e ? vu(t, e) : e instanceof Za ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -16795,7 +16795,7 @@ function Ou(t) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */ function Mu(t, e) {
-    return t instanceof xu && e instanceof xu ? 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 Fu && e instanceof Fu && (t._firestore === e._firestore && Nc(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
+    return t instanceof xu && e instanceof xu ? 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 Fu && e instanceof Fu && (t._firestore === e._firestore && Na(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
 }
 
 /**
@@ -16841,27 +16841,27 @@ function Ou(t) {
 
 class qu extends Bu {
     constructor(t, e, n) {
-        super(), this.Ga = t, this.za = e, this.Ha = n, this.type = "where";
+        super(), this.zc = t, this.Hc = e, this.Jc = n, this.type = "where";
     }
     _apply(t) {
         const e = hu(t.firestore), n = function(t, e, n, s, i, r, o) {
-            let a;
+            let c;
             if (i.isKeyField()) {
                 if ("array-contains" /* ARRAY_CONTAINS */ === r || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === r) throw new j(K.INVALID_ARGUMENT, `Invalid Query. You can't perform '${r}' queries on FieldPath.documentId().`);
                 if ("in" /* IN */ === r || "not-in" /* NOT_IN */ === r) {
                     sh(o, r);
                     const e = [];
                     for (const n of o) e.push(nh(s, t, n));
-                    a = {
+                    c = {
                         arrayValue: {
                             values: e
                         }
                     };
-                } else a = nh(s, t, o);
+                } else c = nh(s, t, o);
             } else "in" /* IN */ !== r && "not-in" /* NOT_IN */ !== r && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== r || sh(o, r), 
-            a = Tu(n, e, o, 
+            c = Tu(n, e, o, 
             /* allowArrays= */ "in" /* IN */ === r || "not-in" /* NOT_IN */ === r);
-            const c = Zt.create(i, r, a);
+            const a = Zt.create(i, r, c);
             return function(t, e) {
                 if (e.V()) {
                     const n = Ee(t);
@@ -16909,9 +16909,9 @@ class qu extends Bu {
                 if (null !== n) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
                 throw n === e.op ? new j(K.INVALID_ARGUMENT, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new j(K.INVALID_ARGUMENT, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
-            }(t, c), c;
-        }(t._query, "where", e, t.firestore._databaseId, this.Ga, this.za, this.Ha);
-        return new bc(t.firestore, t.converter, function(t, e) {
+            }(t, a), a;
+        }(t._query, "where", e, t.firestore._databaseId, this.zc, this.Hc, this.Jc);
+        return new ba(t.firestore, t.converter, function(t, e) {
             const n = t.filters.concat([ e ]);
             return new _e(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
@@ -16935,7 +16935,7 @@ class qu extends Bu {
 
 class ju extends Bu {
     constructor(t, e) {
-        super(), this.Ga = t, this.Ja = e, this.type = "orderBy";
+        super(), this.zc = t, this.Yc = e, this.type = "orderBy";
     }
     _apply(t) {
         const e = function(t, e, n) {
@@ -16960,8 +16960,8 @@ class ju extends Bu {
  * Will throw if the document does not contain all fields of the order by
  * of the query or if any of the fields in the order by are an uncommitted
  * server timestamp.
- */ (t._query, this.Ga, this.Ja);
-        return new bc(t.firestore, t.converter, function(t, e) {
+ */ (t._query, this.zc, this.Yc);
+        return new ba(t.firestore, t.converter, function(t, e) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             const n = t.explicitOrderBy.concat([ e ]);
             return new _e(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
@@ -16984,10 +16984,10 @@ class ju extends Bu {
 
 class Wu extends Bu {
     constructor(t, e, n) {
-        super(), this.type = t, this.Ya = e, this.Xa = n;
+        super(), this.type = t, this.Xc = e, this.Zc = n;
     }
     _apply(t) {
-        return new bc(t.firestore, t.converter, Pe(t._query, this.Ya, this.Xa));
+        return new ba(t.firestore, t.converter, Pe(t._query, this.Xc, this.Zc));
     }
 }
 
@@ -16997,7 +16997,7 @@ class Wu extends Bu {
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
  */ function Gu(t) {
-    return Ec("limit", t), new Wu("limit", t, "F" /* First */);
+    return Ea("limit", t), new Wu("limit", t, "F" /* First */);
 }
 
 /**
@@ -17009,16 +17009,16 @@ class Wu extends Bu {
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
  */ function zu(t) {
-    return Ec("limitToLast", t), new Wu("limitToLast", t, "L" /* Last */);
+    return Ea("limitToLast", t), new Wu("limitToLast", t, "L" /* Last */);
 }
 
 class Hu extends Bu {
     constructor(t, e, n) {
-        super(), this.type = t, this.Za = e, this.tc = n;
+        super(), this.type = t, this.ta = e, this.ea = n;
     }
     _apply(t) {
-        const e = eh(t, this.type, this.Za, this.tc);
-        return new bc(t.firestore, t.converter, function(t, e) {
+        const e = eh(t, this.type, this.ta, this.ea);
+        return new ba(t.firestore, t.converter, function(t, e) {
             return new _e(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
@@ -17035,11 +17035,11 @@ function Yu(...t) {
 
 class Xu extends Bu {
     constructor(t, e, n) {
-        super(), this.type = t, this.Za = e, this.tc = n;
+        super(), this.type = t, this.ta = e, this.ea = n;
     }
     _apply(t) {
-        const e = eh(t, this.type, this.Za, this.tc);
-        return new bc(t.firestore, t.converter, function(t, e) {
+        const e = eh(t, this.type, this.ta, this.ea);
+        return new ba(t.firestore, t.converter, function(t, e) {
             return new _e(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
@@ -17084,22 +17084,22 @@ function th(...t) {
             // Use explicit order by's because it has to match the query the user made
             const o = t.explicitOrderBy;
             if (i.length > o.length) throw new j(K.INVALID_ARGUMENT, `Too many arguments provided to ${s}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
-            const a = [];
+            const c = [];
             for (let r = 0; r < i.length; r++) {
-                const c = i[r];
+                const a = i[r];
                 if (o[r].field.isKeyField()) {
-                    if ("string" != typeof c) throw new j(K.INVALID_ARGUMENT, `Invalid query. Expected a string for document ID in ${s}(), but got a ${typeof c}`);
-                    if (!Ie(t) && -1 !== c.indexOf("/")) throw new j(K.INVALID_ARGUMENT, `Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to ${s}() must be a plain document ID, but '${c}' contains a slash.`);
-                    const n = t.path.child(dt.fromString(c));
+                    if ("string" != typeof a) throw new j(K.INVALID_ARGUMENT, `Invalid query. Expected a string for document ID in ${s}(), but got a ${typeof a}`);
+                    if (!Ie(t) && -1 !== a.indexOf("/")) throw new j(K.INVALID_ARGUMENT, `Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to ${s}() must be a plain document ID, but '${a}' contains a slash.`);
+                    const n = t.path.child(dt.fromString(a));
                     if (!St.isDocumentKey(n)) throw new j(K.INVALID_ARGUMENT, `Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to ${s}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
                     const i = new St(n);
-                    a.push(Ot(e, i));
+                    c.push(Ot(e, i));
                 } else {
-                    const t = Tu(n, s, c);
-                    a.push(t);
+                    const t = Tu(n, s, a);
+                    c.push(t);
                 }
             }
-            return new ue(a, r);
+            return new ue(c, r);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -17117,8 +17117,8 @@ function nh(t, e, n) {
         if (!St.isDocumentKey(s)) throw new j(K.INVALID_ARGUMENT, `Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '${s}' is not because it has an odd number of segments (${s.length}).`);
         return Ot(t, new St(s));
     }
-    if (n instanceof Pc) return Ot(t, n._key);
-    throw new j(K.INVALID_ARGUMENT, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${pc(n)}.`);
+    if (n instanceof Pa) return Ot(t, n._key);
+    throw new j(K.INVALID_ARGUMENT, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${pa(n)}.`);
 }
 
 /**
@@ -17221,12 +17221,12 @@ function ih(t, e, n) {
     }
     convertTimestamp(t) {
         const e = Tt(t);
-        return new at(e.seconds, e.nanos);
+        return new ct(e.seconds, e.nanos);
     }
     convertDocumentKey(t, e) {
         const n = dt.fromString(t);
         B(As(n));
-        const s = new dc(n.get(1), n.get(3)), i = new St(n.popFirst(5));
+        const s = new da(n.get(1), n.get(3)), i = new St(n.popFirst(5));
         return s.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
         F(`Document ${i} contains a document reference within a different database (${s.projectId}/${s.database}) which is not supported. It will be treated as a reference in the current database (${e.projectId}/${e.database}) instead.`), 
@@ -17267,7 +17267,7 @@ function ih(t, e, n) {
     s;
 }
 
-class ah extends rh {
+class ch extends rh {
     constructor(t) {
         super(), this.firestore = t;
     }
@@ -17276,7 +17276,7 @@ class ah extends rh {
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new Pc(this.firestore, /* converter= */ null, e);
+        return new Pa(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -17303,7 +17303,7 @@ class ah extends rh {
  * 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 ch {
+ */ class ah {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
@@ -17320,7 +17320,7 @@ class ah extends rh {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let r;
-        return r = "string" == typeof (e = getModularInstance(e)) || e instanceof Zc ? pu(this._dataReader, "WriteBatch.update", i._key, e, n, s) : yu(this._dataReader, "WriteBatch.update", i._key, e), 
+        return r = "string" == typeof (e = getModularInstance(e)) || e instanceof Za ? pu(this._dataReader, "WriteBatch.update", i._key, e, n, s) : yu(this._dataReader, "WriteBatch.update", i._key, e), 
         this._mutations.push(r.toMutation(i._key, Je.exists(!0))), this;
     }
     /**
@@ -17411,9 +17411,9 @@ function uh(t, e) {
  * current document contents.
  */
 function hh(t) {
-    t = Tc(t, Pc);
-    const e = Tc(t.firestore, Oc);
-    return rc(Bc(e), t._key).then((n => Rh(e, t, n)));
+    t = Ta(t, Pa);
+    const e = Ta(t.firestore, Oa);
+    return ra(Ba(e), t._key).then((n => Rh(e, t, n)));
 }
 
 class lh extends rh {
@@ -17425,7 +17425,7 @@ class lh extends rh {
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new Pc(this.firestore, /* converter= */ null, e);
+        return new Pa(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -17436,9 +17436,9 @@ class lh extends rh {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function fh(t) {
-    t = Tc(t, Pc);
-    const e = Tc(t.firestore, Oc), n = Bc(e), s = new lh(e);
-    return ic(n, t._key).then((n => new xu(e, s, t._key, n, new ku(null !== n && n.hasLocalMutations, 
+    t = Ta(t, Pa);
+    const e = Ta(t.firestore, Oa), n = Ba(e), s = new lh(e);
+    return ia(n, t._key).then((n => new xu(e, s, t._key, n, new ku(null !== n && n.hasLocalMutations, 
     /* fromCache= */ !0), t.converter)));
 }
 
@@ -17449,9 +17449,9 @@ class lh extends rh {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function dh(t) {
-    t = Tc(t, Pc);
-    const e = Tc(t.firestore, Oc);
-    return rc(Bc(e), t._key, {
+    t = Ta(t, Pa);
+    const e = Ta(t.firestore, Oa);
+    return ra(Ba(e), t._key, {
         source: "server"
     }).then((n => Rh(e, t, n)));
 }
@@ -17466,9 +17466,9 @@ class lh extends rh {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function wh(t) {
-    t = Tc(t, bc);
-    const e = Tc(t.firestore, Oc), n = Bc(e), s = new lh(e);
-    return Lu(t._query), ac(n, t._query).then((n => new Fu(e, s, t, n)));
+    t = Ta(t, ba);
+    const e = Ta(t.firestore, Oa), n = Ba(e), s = new lh(e);
+    return Lu(t._query), ca(n, t._query).then((n => new Fu(e, s, t, n)));
 }
 
 /**
@@ -17477,9 +17477,9 @@ class lh extends rh {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function _h(t) {
-    t = Tc(t, bc);
-    const e = Tc(t.firestore, Oc), n = Bc(e), s = new lh(e);
-    return oc(n, t._query).then((n => new Fu(e, s, t, n)));
+    t = Ta(t, ba);
+    const e = Ta(t.firestore, Oa), n = Ba(e), s = new lh(e);
+    return oa(n, t._query).then((n => new Fu(e, s, t, n)));
 }
 
 /**
@@ -17488,27 +17488,27 @@ class lh extends rh {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function mh(t) {
-    t = Tc(t, bc);
-    const e = Tc(t.firestore, Oc), n = Bc(e), s = new lh(e);
-    return ac(n, t._query, {
+    t = Ta(t, ba);
+    const e = Ta(t.firestore, Oa), n = Ba(e), s = new lh(e);
+    return ca(n, t._query, {
         source: "server"
     }).then((n => new Fu(e, s, t, n)));
 }
 
 function gh(t, e, n) {
-    t = Tc(t, Pc);
-    const s = Tc(t.firestore, Oc), i = oh(t.converter, e, n);
+    t = Ta(t, Pa);
+    const s = Ta(t.firestore, Oa), i = oh(t.converter, e, n);
     return Ah(s, [ lu(hu(s), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Je.none()) ]);
 }
 
 function yh(t, e, n, ...s) {
-    t = Tc(t, Pc);
-    const i = Tc(t.firestore, Oc), r = hu(i);
+    t = Ta(t, Pa);
+    const i = Ta(t.firestore, Oa), r = hu(i);
     let o;
     o = "string" == typeof (
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-    e = getModularInstance(e)) || e instanceof Zc ? pu(r, "updateDoc", t._key, e, n, s) : yu(r, "updateDoc", t._key, e);
+    e = getModularInstance(e)) || e instanceof Za ? pu(r, "updateDoc", t._key, e, n, s) : yu(r, "updateDoc", t._key, e);
     return Ah(i, [ o.toMutation(t._key, Je.exists(!0)) ]);
 }
 
@@ -17519,7 +17519,7 @@ function yh(t, e, n, ...s) {
  * @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 ph(t) {
-    return Ah(Tc(t.firestore, Oc), [ new hn(t._key, Je.none()) ]);
+    return Ah(Ta(t.firestore, Oa), [ new hn(t._key, Je.none()) ]);
 }
 
 /**
@@ -17532,7 +17532,7 @@ function yh(t, e, n, ...s) {
  * newly created document after it has been written to the backend (Note that it
  * won't resolve while you're offline).
  */ function Th(t, e) {
-    const n = Tc(t.firestore, Oc), s = Dc(t), i = oh(t.converter, e);
+    const n = Ta(t.firestore, Oa), s = Da(t), i = oh(t.converter, e);
     return Ah(n, [ lu(hu(t.firestore), "addDoc", s._key, i, null !== t.converter, {}).toMutation(s._key, Je.exists(!1)) ]).then((() => s));
 }
 
@@ -17542,27 +17542,27 @@ function Eh(t, ...e) {
     let r = {
         includeMetadataChanges: !1
     }, o = 0;
-    "object" != typeof e[o] || xc(e[o]) || (r = e[o], o++);
-    const a = {
+    "object" != typeof e[o] || xa(e[o]) || (r = e[o], o++);
+    const c = {
         includeMetadataChanges: r.includeMetadataChanges
     };
-    if (xc(e[o])) {
+    if (xa(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);
     }
-    let c, u, h;
-    if (t instanceof Pc) u = Tc(t.firestore, Oc), h = ge(t._key.path), c = {
+    let a, u, h;
+    if (t instanceof Pa) u = Ta(t.firestore, Oa), h = ge(t._key.path), a = {
         next: n => {
             e[o] && e[o](Rh(u, t, n));
         },
         error: e[o + 1],
         complete: e[o + 2]
     }; else {
-        const n = Tc(t, bc);
-        u = Tc(n.firestore, Oc), h = n._query;
+        const n = Ta(t, ba);
+        u = Ta(n.firestore, Oa), h = n._query;
         const s = new lh(u);
-        c = {
+        a = {
             next: t => {
                 e[o] && e[o](new Fu(u, s, n, t));
             },
@@ -17571,15 +17571,15 @@ function Eh(t, ...e) {
         }, Lu(t._query);
     }
     return function(t, e, n, s) {
-        const i = new qa(s), r = new zo(e, i, n);
-        return t.asyncQueue.enqueueAndForget((async () => Ko(await ec(t), r))), () => {
-            i.na(), t.asyncQueue.enqueueAndForget((async () => jo(await ec(t), r)));
+        const i = new qc(s), r = new zo(e, i, n);
+        return t.asyncQueue.enqueueAndForget((async () => Ko(await ea(t), r))), () => {
+            i.nc(), t.asyncQueue.enqueueAndForget((async () => jo(await ea(t), r)));
         };
-    }(Bc(u), h, a, c);
+    }(Ba(u), h, c, a);
 }
 
 function Ih(t, e) {
-    return cc(Bc(t = Tc(t, Oc)), xc(e) ? e : {
+    return aa(Ba(t = Ta(t, Oa)), xa(e) ? e : {
         next: e
     });
 }
@@ -17590,8 +17590,8 @@ function Ih(t, e) {
  */ function Ah(t, e) {
     return function(t, e) {
         const n = new Q;
-        return t.asyncQueue.enqueueAndForget((async () => ca(await tc(t), e, n))), n.promise;
-    }(Bc(t), e);
+        return t.asyncQueue.enqueueAndForget((async () => ac(await ta(t), e, n))), n.promise;
+    }(Ba(t), e);
 }
 
 /**
@@ -17635,7 +17635,7 @@ function Ih(t, e) {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const e = uh(t, this._firestore), n = new ah(this._firestore);
+        const e = uh(t, this._firestore), n = new ch(this._firestore);
         return this._transaction.lookup([ e._key ]).then((t => {
             if (!t || 1 !== t.length) return L();
             const s = t[0];
@@ -17653,7 +17653,7 @@ function Ih(t, e) {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let r;
-        return r = "string" == typeof (e = getModularInstance(e)) || e instanceof Zc ? pu(this._dataReader, "Transaction.update", i._key, e, n, s) : yu(this._dataReader, "Transaction.update", i._key, e), 
+        return r = "string" == typeof (e = getModularInstance(e)) || e instanceof Za ? pu(this._dataReader, "Transaction.update", i._key, e, n, s) : yu(this._dataReader, "Transaction.update", i._key, e), 
         this._transaction.update(i._key, r), this;
     }
     /**
@@ -17702,7 +17702,7 @@ function Ih(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */ function bh(t, e) {
-    return uc(Bc(t = Tc(t, Oc)), (n => e(new Ph(t, n))));
+    return ua(Ba(t = Ta(t, Oa)), (n => e(new Ph(t, n))));
 }
 
 /**
@@ -17817,7 +17817,7 @@ function Ih(t, e) {
  * @returns A {@link WriteBatch} that can be used to atomically execute multiple
  * writes.
  */ function Nh(t) {
-    return Bc(t = Tc(t, Oc)), new ch(t, (e => Ah(t, e)));
+    return Ba(t = Ta(t, Oa)), new ah(t, (e => Ah(t, e)));
 }
 
 /**
@@ -17828,14 +17828,14 @@ function Ih(t, e) {
     !function(t) {
         C = t;
     }(SDK_VERSION), _registerComponent(new Component("firestore", ((t, {options: n}) => {
-        const s = t.getProvider("app").getImmediate(), i = new Oc(s, new H(t.getProvider("auth-internal")), new Z(t.getProvider("app-check-internal")));
+        const s = t.getProvider("app").getImmediate(), i = new Oa(s, new H(t.getProvider("auth-internal")), new Z(t.getProvider("app-check-internal")));
         return n = Object.assign({
             useFetchStreams: e
         }, n), i._setSettings(n), i;
-    }), "PUBLIC")), registerVersion(S, "3.4.0-canary.8d9a09e18", t), 
+    }), "PUBLIC")), registerVersion(S, "3.4.0-canary.fd8cd3ec4", t), 
     // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-    registerVersion(S, "3.4.0-canary.8d9a09e18", "esm2017");
+    registerVersion(S, "3.4.0-canary.fd8cd3ec4", "esm2017");
 }();
 
-export { rh as AbstractUserDataWriter, eu as Bytes, Fc as CACHE_SIZE_UNLIMITED, vc as CollectionReference, Pc as DocumentReference, xu as DocumentSnapshot, Zc as FieldPath, nu as FieldValue, Oc as Firestore, j as FirestoreError, su as GeoPoint, $c as LoadBundleTask, bc as Query, Bu as QueryConstraint, $u as QueryDocumentSnapshot, Fu as QuerySnapshot, ku as SnapshotMetadata, at as Timestamp, Ph as Transaction, ch as WriteBatch, dc as _DatabaseId, St as _DocumentKey, tt as _EmptyAppCheckTokenProvider, G as _EmptyAuthCredentialsProvider, _t as _FieldPath, Tc as _cast, U as _debugAssert, gt as _isBase64Available, O as _logWarn, mc as _validateIsNotUsedTogether, Th as addDoc, Dh as arrayRemove, Sh as arrayUnion, Qc as clearIndexedDbPersistence, Vc as collection, Sc as collectionGroup, Rc as connectFirestoreEmulator, ph as deleteDoc, vh as deleteField, zc as disableNetwork, Dc as doc, tu as documentId, qc as enableIndexedDbPersistence, Kc as enableMultiTabIndexedDbPersistence, Gc as enableNetwork, th as endAt, Zu as endBefore, Bc as ensureFirestoreConfigured, Ah as executeWrite, hh as getDoc, fh as getDocFromCache, dh as getDocFromServer, wh as getDocs, _h as getDocsFromCache, mh as getDocsFromServer, Lc as getFirestore, Ch as increment, Mc as initializeFirestore, Gu as limit, zu as limitToLast, Jc as loadBundle, Yc as namedQuery, Eh as onSnapshot, Ih as onSnapshotsInSync, Qu as orderBy, Uu as query, Nc as queryEqual, Cc as refEqual, bh as runTransaction, Vh as serverTimestamp, gh as setDoc, x as setLogLevel, Mu as snapshotEqual, Yu as startAfter, Ju as startAt, Hc as terminate, yh as updateDoc, Wc as waitForPendingWrites, Ku as where, Nh as writeBatch };
+export { rh as AbstractUserDataWriter, eu as Bytes, Fa as CACHE_SIZE_UNLIMITED, va as CollectionReference, Pa as DocumentReference, xu as DocumentSnapshot, Za as FieldPath, nu as FieldValue, Oa as Firestore, j as FirestoreError, su as GeoPoint, $a as LoadBundleTask, ba as Query, Bu as QueryConstraint, $u as QueryDocumentSnapshot, Fu as QuerySnapshot, ku as SnapshotMetadata, ct as Timestamp, Ph as Transaction, ah as WriteBatch, da as _DatabaseId, St as _DocumentKey, tt as _EmptyAppCheckTokenProvider, G as _EmptyAuthCredentialsProvider, _t as _FieldPath, Ta as _cast, U as _debugAssert, gt as _isBase64Available, O as _logWarn, ma as _validateIsNotUsedTogether, Th as addDoc, Dh as arrayRemove, Sh as arrayUnion, Qa as clearIndexedDbPersistence, Va as collection, Sa as collectionGroup, Ra as connectFirestoreEmulator, ph as deleteDoc, vh as deleteField, za as disableNetwork, Da as doc, tu as documentId, qa as enableIndexedDbPersistence, Ka as enableMultiTabIndexedDbPersistence, Ga as enableNetwork, th as endAt, Zu as endBefore, Ba as ensureFirestoreConfigured, Ah as executeWrite, hh as getDoc, fh as getDocFromCache, dh as getDocFromServer, wh as getDocs, _h as getDocsFromCache, mh as getDocsFromServer, La as getFirestore, Ch as increment, Ma as initializeFirestore, Gu as limit, zu as limitToLast, Ja as loadBundle, Ya as namedQuery, Eh as onSnapshot, Ih as onSnapshotsInSync, Qu as orderBy, Uu as query, Na as queryEqual, Ca as refEqual, bh as runTransaction, Vh as serverTimestamp, gh as setDoc, x as setLogLevel, Mu as snapshotEqual, Yu as startAfter, Ju as startAt, Ha as terminate, yh as updateDoc, Wa as waitForPendingWrites, Ku as where, Nh as writeBatch };
 //# sourceMappingURL=index.esm2017.js.map