@firebase/firestore 3.4.12-canary.39f4635eb → 3.4.12-canary.f36d627af

package/dist/index.esm2017.js

@@ -66,7 +66,7 @@ C.MOCK_USER = new C("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let x = "9.9.0-canary.39f4635eb";
+let x = "9.9.0-canary.f36d627af";
 
 /**
  * @license
@@ -870,18 +870,18 @@ class ut {
 /**
  * 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 ut(0, 0));
+        return new at(new ut(0, 0));
     }
     static max() {
-        return new ct(new ut(253402300799, 999999999));
+        return new at(new ut(253402300799, 999999999));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -920,7 +920,7 @@ class ut {
 /**
  * Path represents an ordered sequence of string segments.
  */
-class at {
+class ct {
     constructor(t, e, n) {
         void 0 === e ? e = 0 : e > t.length && L(), void 0 === n ? n = t.length - e : n > t.length - e && L(), 
         this.segments = t, this.offset = e, this.len = n;
@@ -929,11 +929,11 @@ class at {
         return this.len;
     }
     isEqual(t) {
-        return 0 === at.comparator(this, t);
+        return 0 === ct.comparator(this, t);
     }
     child(t) {
         const e = this.segments.slice(this.offset, this.limit());
-        return t instanceof at ? t.forEach((t => {
+        return t instanceof ct ? t.forEach((t => {
             e.push(t);
         })) : e.push(t), this.construct(e);
     }
@@ -990,7 +990,7 @@ class at {
  * within Firestore.
  *
  * @internal
- */ class ht extends at {
+ */ class ht extends ct {
     construct(t, e, n) {
         return new ht(t, e, n);
     }
@@ -1029,7 +1029,7 @@ const lt = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
 /**
  * A dot-separated path for navigating sub-objects within a document.
  * @internal
- */ class ft extends at {
+ */ class ft extends ct {
     construct(t, e, n) {
         return new ft(t, e, n);
     }
@@ -1258,7 +1258,7 @@ class gt {
     // Unicode codepoints to generate MAX_DOCUMENT_KEY, it is much easier to use
     // `(readTime + 1, DocumentKey.empty())` since `> DocumentKey.empty()` matches
     // all valid document IDs.
-    const n = t.toTimestamp().seconds, s = t.toTimestamp().nanoseconds + 1, i = ct.fromTimestamp(1e9 === s ? new ut(n + 1, 0) : new ut(n, s));
+    const n = t.toTimestamp().seconds, s = t.toTimestamp().nanoseconds + 1, i = at.fromTimestamp(1e9 === s ? new ut(n + 1, 0) : new ut(n, s));
     return new Tt(i, dt.empty(), e);
 }
 
@@ -1288,10 +1288,10 @@ class gt {
         this.readTime = t, this.documentKey = e, this.largestBatchId = n;
     }
     /** Returns an offset that sorts before all regular offsets. */    static min() {
-        return new Tt(ct.min(), dt.empty(), -1);
+        return new Tt(at.min(), dt.empty(), -1);
     }
     /** Returns an offset that sorts after all regular offsets. */    static max() {
-        return new Tt(ct.max(), dt.empty(), -1);
+        return new Tt(at.max(), dt.empty(), -1);
     }
 }
 
@@ -1492,9 +1492,9 @@ class Rt {
             const i = t.length, r = new Array(i);
             let o = 0;
             for (let u = 0; u < i; u++) {
-                const c = u;
-                e(t[c]).next((t => {
-                    r[c] = t, ++o, o === i && n(r);
+                const a = u;
+                e(t[a]).next((t => {
+                    r[a] = t, ++o, o === i && n(r);
                 }), (t => s(t)));
             }
         }));
@@ -2962,7 +2962,7 @@ function oe(t) {
 /**
  * Returns whether a value is an integer and in the safe integer range
  * @param value - The value to test for being an integer and in the safe range
- */ function ce(t) {
+ */ function ae(t) {
     return "number" == typeof t && Number.isInteger(t) && !ue(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
 }
 
@@ -2981,7 +2981,7 @@ function oe(t) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const ae = {
+ */ const ce = {
     mapValue: {
         fields: {
             __type__: {
@@ -3133,9 +3133,9 @@ function _e(t, e) {
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
-            if (t === ae.mapValue && e === ae.mapValue) return 0;
-            if (t === ae.mapValue) return 1;
-            if (e === ae.mapValue) return -1;
+            if (t === ce.mapValue && e === ce.mapValue) return 0;
+            if (t === ce.mapValue) return 1;
+            if (e === ce.mapValue) return -1;
             const n = t.fields || {}, s = Object.keys(n), i = e.fields || {}, r = Object.keys(i);
             // Even though MapValues are likely sorted correctly based on their insertion
             // order (e.g. when received from the backend), local modifications can bring
@@ -3297,7 +3297,7 @@ function Ie(t) {
         arrayValue: {}
     } : "arrayValue" in t ? {
         mapValue: {}
-    } : "mapValue" in t ? ae : L();
+    } : "mapValue" in t ? ce : L();
 }
 
 function Ve(t, e) {
@@ -3474,23 +3474,23 @@ function Se(t, e) {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new xe(t, 0 /* INVALID */ , ct.min(), ct.min(), De.empty(), 0 /* SYNCED */);
+        return new xe(t, 0 /* INVALID */ , at.min(), at.min(), De.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist with the given data at the
      * given version.
      */    static newFoundDocument(t, e, n) {
-        return new xe(t, 1 /* FOUND_DOCUMENT */ , e, ct.min(), n, 0 /* SYNCED */);
+        return new xe(t, 1 /* FOUND_DOCUMENT */ , e, at.min(), n, 0 /* SYNCED */);
     }
     /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, e) {
-        return new xe(t, 2 /* NO_DOCUMENT */ , e, ct.min(), De.empty(), 0 /* SYNCED */);
+        return new xe(t, 2 /* NO_DOCUMENT */ , e, at.min(), De.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist at the given version but
      * whose data is not known (e.g. a document that was updated without a known
      * base document).
      */    static newUnknownDocument(t, e) {
-        return new xe(t, 3 /* UNKNOWN_DOCUMENT */ , e, ct.min(), De.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new xe(t, 3 /* UNKNOWN_DOCUMENT */ , e, at.min(), De.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -3518,7 +3518,7 @@ function Se(t, e) {
         return this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasLocalMutations() {
-        return this.documentState = 1 /* HAS_LOCAL_MUTATIONS */ , this.version = ct.min(), 
+        return this.documentState = 1 /* HAS_LOCAL_MUTATIONS */ , this.version = at.min(), 
         this;
     }
     setReadTime(t) {
@@ -3715,10 +3715,10 @@ function Le(t, e, n) {
  * Returns the value to use as the upper bound for ascending index segment at
  * the provided `fieldPath` (or the lower bound for a descending segment).
  */ function Ue(t, e, n) {
-    let s = ae, i = !0;
+    let s = ce, i = !0;
     // Process all filters to find a value for the current field segment
     for (const n of Be(t, e)) {
-        let t = ae, e = !0;
+        let t = ce, e = !0;
         switch (n.op) {
           case ">=" /* GREATER_THAN_OR_EQUAL */ :
           case ">" /* GREATER_THAN */ :
@@ -3737,7 +3737,7 @@ function Le(t, e, n) {
 
           case "!=" /* NOT_EQUAL */ :
           case "not-in" /* NOT_IN */ :
-            t = ae;
+            t = ce;
  // Remaining filters cannot be used as upper bounds.
                 }
         Se({
@@ -3776,18 +3776,18 @@ function Le(t, e, n) {
     /**
      * 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.ct(t, e, n) : new Ke(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new We(t, n) : "in" /* IN */ === e ? new ze(t, n) : "not-in" /* NOT_IN */ === e ? new He(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new Je(t, n) : new qe(t, e, n);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.at(t, e, n) : new Ke(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new We(t, n) : "in" /* IN */ === e ? new ze(t, n) : "not-in" /* NOT_IN */ === e ? new He(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new Je(t, n) : new qe(t, e, n);
     }
-    static ct(t, e, n) {
+    static at(t, e, n) {
         return "in" /* IN */ === e ? new Ge(t, n) : new Qe(t, n);
     }
     matches(t) {
         const e = t.data.field(this.field);
         // Types do not have to match in NOT_EQUAL filters.
-                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.at(_e(e, this.value)) : null !== e && le(this.value) === le(e) && this.at(_e(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.ct(_e(e, this.value)) : null !== e && le(this.value) === le(e) && this.ct(_e(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
-    at(t) {
+    ct(t) {
         switch (this.op) {
           case "<" /* LESS_THAN */ :
             return t < 0;
@@ -3822,7 +3822,7 @@ class Ke extends qe {
     }
     matches(t) {
         const e = dt.comparator(t.key, this.key);
-        return this.at(e);
+        return this.ct(e);
     }
 }
 
@@ -4009,7 +4009,7 @@ function un(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function cn(t) {
+function an(t) {
     for (const e of t.filters) if (e.ht()) return e.field;
     return null;
 }
@@ -4022,7 +4022,7 @@ function cn(t) {
  * Returns whether the query matches a collection group rather than a specific
  * collection.
  */
-function an(t) {
+function cn(t) {
     return null !== t.collectionGroup;
 }
 
@@ -4034,7 +4034,7 @@ function an(t) {
     const e = K(t);
     if (null === e.lt) {
         e.lt = [];
-        const t = cn(e), n = un(e);
+        const t = an(e), n = un(e);
         if (null !== t && null === n) 
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
@@ -4217,7 +4217,7 @@ function pn(t, e, n) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */ function En(t, e) {
-    return ce(e) ? Tn(e) : In(t, e);
+    return ae(e) ? Tn(e) : In(t, e);
 }
 
 /**
@@ -5012,13 +5012,13 @@ function os() {
 
 const us = new qt(dt.comparator);
 
-function cs(...t) {
+function as(...t) {
     let e = us;
     for (const n of t) e = e.insert(n.key, n);
     return e;
 }
 
-function as(t) {
+function cs(t) {
     let e = us;
     return t.forEach(((t, n) => e = e.insert(t, n.overlayedDocument))), e;
 }
@@ -5107,7 +5107,7 @@ function gs() {
     // PORTING NOTE: Multi-tab only
     static createSynthesizedRemoteEventForCurrentChange(t, e) {
         const n = new Map;
-        return n.set(t, ps.createSynthesizedTargetChangeForCurrentChange(t, e)), new ys(ct.min(), n, gs(), os(), ws());
+        return n.set(t, ps.createSynthesizedTargetChangeForCurrentChange(t, e)), new ys(at.min(), n, gs(), os(), ws());
     }
 }
 
@@ -5411,7 +5411,7 @@ class Rs {
                 // until it is resolved, essentially exposing inconsistency between
                 // queries.
                 const n = new dt(t.path);
-                this.Kt(e, n, xe.newNoDocument(n, ct.min()));
+                this.Kt(e, n, xe.newNoDocument(n, at.min()));
             } else U(1 === n); else {
                 this.Jt(e) !== n && (
                 // Existence filter mismatch: We reset the mapping and raise a new
@@ -5637,7 +5637,7 @@ function Cs(t, e) {
 }
 
 function Ns(t) {
-    return U(!!t), ct.fromTimestamp(function(t) {
+    return U(!!t), at.fromTimestamp(function(t) {
         const e = Xt(t);
         return new ut(e.seconds, e.nanos);
     }(t));
@@ -5750,13 +5750,13 @@ function Qs(t, e) {
             mapValue: {
                 fields: s.document.fields
             }
-        }), u = xe.newFoundDocument(i, r, o), c = s.targetIds || [], a = s.removedTargetIds || [];
-        n = new Is(c, a, u.key, u);
+        }), u = xe.newFoundDocument(i, r, o), a = s.targetIds || [], c = s.removedTargetIds || [];
+        n = new Is(a, c, u.key, u);
     } else if ("documentDelete" in e) {
         e.documentDelete;
         const s = e.documentDelete;
         s.document;
-        const i = Fs(t, s.document), r = s.readTime ? Ns(s.readTime) : ct.min(), o = xe.newNoDocument(i, r), u = s.removedTargetIds || [];
+        const i = Fs(t, s.document), r = s.readTime ? Ns(s.readTime) : at.min(), o = xe.newNoDocument(i, r), u = s.removedTargetIds || [];
         n = new Is([], u, o.key, o);
     } else if ("documentRemove" in e) {
         e.documentRemove;
@@ -5870,7 +5870,7 @@ function zs(t, e) {
     return t && t.length > 0 ? (U(void 0 !== e), t.map((t => function(t, e) {
         // NOTE: Deletes don't have an updateTime.
         let n = t.updateTime ? Ns(t.updateTime) : Ns(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
@@ -6013,18 +6013,18 @@ function Ys(t) {
         let e;
         return e = "object" == typeof t ? t.value : t, oe(e) ? null : e;
     }(n.limit));
-    let c = null;
-    n.startAt && (c = function(t) {
+    let a = null;
+    n.startAt && (a = function(t) {
         const e = !!t.before, n = t.values || [];
         return new Ye(n, e);
     }(n.startAt));
-    let a = null;
-    return n.endAt && (a = function(t) {
+    let c = null;
+    return n.endAt && (c = function(t) {
         const e = !t.before, n = t.values || [];
         return new Ye(n, e);
     }
     // visible for testing
-    (n.endAt)), sn(e, i, o, r, u, "F" /* First */ , c, a);
+    (n.endAt)), sn(e, i, o, r, u, "F" /* First */ , a, c);
 }
 
 function Xs(t, e) {
@@ -6171,13 +6171,13 @@ function ui(t) {
 /**
  * Encodes a resource path into a IndexedDb-compatible string form.
  */
-function ci(t) {
+function ai(t) {
     let e = "";
-    for (let n = 0; n < t.length; n++) e.length > 0 && (e = hi(e)), e = ai(t.get(n), e);
+    for (let n = 0; n < t.length; n++) e.length > 0 && (e = hi(e)), e = ci(t.get(n), e);
     return hi(e);
 }
 
-/** Encodes a single segment of a resource path into the given result */ function ai(t, e) {
+/** Encodes a single segment of a resource path into the given result */ function ci(t, e) {
     let n = e;
     const s = t.length;
     for (let e = 0; e < s; e++) {
@@ -6293,14 +6293,14 @@ function ci(t) {
  * index to iterate over all at document mutations for a given path or lower.
  */
 function di(t, e) {
-    return [ t, ci(e) ];
+    return [ t, ai(e) ];
 }
 
 /**
  * Creates a full index key of [userId, encodedPath, batchId] for inserting
  * and deleting into the DbDocumentMutations index.
  */ function _i(t, e, n) {
-    return [ t, ci(e), n ];
+    return [ t, ai(e), n ];
 }
 
 /**
@@ -6420,7 +6420,7 @@ function Mi(t, e) {
             // patch mutation as the overlay.
                         o = e.has(s.key) ? null : o;
             const u = Un(r, o);
-            null !== u && n.set(s.key, u), r.isValidDocument() || r.convertToNoDocument(ct.min());
+            null !== u && n.set(s.key, u), r.isValidDocument() || r.convertToNoDocument(at.min());
         })), n;
     }
     keys() {
@@ -6524,11 +6524,11 @@ function Mi(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
@@ -6591,7 +6591,7 @@ function Mi(t, e) {
     }
     return e.readTime && n.setReadTime(function(t) {
         const e = new ut(t[0], t[1]);
-        return ct.fromTimestamp(e);
+        return at.fromTimestamp(e);
     }(e.readTime)), n;
 }
 
@@ -6637,7 +6637,7 @@ function Qi(t) {
 
 function ji(t) {
     const e = new ut(t.seconds, t.nanoseconds);
-    return ct.fromTimestamp(e);
+    return at.fromTimestamp(e);
 }
 
 /** Encodes a batch of mutations into a DbMutationBatch for local storage. */
@@ -6662,7 +6662,7 @@ function Wi(t, e) {
 }
 
 /** Decodes a DbTarget into TargetData */ function zi(t) {
-    const e = ji(t.readTime), n = void 0 !== t.lastLimboFreeSnapshotVersion ? ji(t.lastLimboFreeSnapshotVersion) : ct.min();
+    const e = ji(t.readTime), n = void 0 !== t.lastLimboFreeSnapshotVersion ? ji(t.lastLimboFreeSnapshotVersion) : at.min();
     let s;
     var i;
     return void 0 !== t.query.documents ? (U(1 === (i = t.query).documents.length), 
@@ -6720,7 +6720,7 @@ function Yi(t, e) {
  */
 function Xi(t, e) {
     const n = e.path.lastSegment();
-    return [ t, ci(e.path.popLast()), n ];
+    return [ t, ai(e.path.popLast()), n ];
 }
 
 function Zi(t, e, n, s) {
@@ -6729,7 +6729,7 @@ function Zi(t, e, n, s) {
         uid: e.uid || "",
         sequenceNumber: n,
         readTime: Qi(s.readTime),
-        documentKey: ci(s.documentKey.path),
+        documentKey: ai(s.documentKey.path),
         largestBatchId: s.largestBatchId
     };
 }
@@ -6851,7 +6851,7 @@ function Zi(t, e, n, s) {
     removeOverlaysForBatchId(t, e, n) {
         const s = new Set;
         // Get the set of unique collection paths.
-                e.forEach((t => s.add(ci(t.getCollectionPath()))));
+                e.forEach((t => s.add(ai(t.getCollectionPath()))));
         const i = [];
         return s.forEach((e => {
             const s = IDBKeyRange.bound([ this.userId, e, n ], [ this.userId, e, n + 1 ], 
@@ -6861,7 +6861,7 @@ function Zi(t, e, n, s) {
         })), Pt.waitFor(i);
     }
     getOverlaysForCollection(t, e, n) {
-        const s = hs(), i = ci(e), r = IDBKeyRange.bound([ this.userId, i, n ], [ this.userId, i, Number.POSITIVE_INFINITY ], 
+        const s = hs(), i = ai(e), r = IDBKeyRange.bound([ this.userId, i, n ], [ this.userId, i, Number.POSITIVE_INFINITY ], 
         /*lowerOpen=*/ !0);
         return ir(t).K("collectionPathOverlayIndex", r).next((t => {
             for (const e of t) {
@@ -6946,52 +6946,52 @@ class rr {
         e.ue();
     }
     oe(t, e) {
-        if ("nullValue" in t) this.ce(e, 5); else if ("booleanValue" in t) this.ce(e, 10), 
-        e.ae(t.booleanValue ? 1 : 0); else if ("integerValue" in t) this.ce(e, 15), e.ae(Zt(t.integerValue)); else if ("doubleValue" in t) {
+        if ("nullValue" in t) this.ae(e, 5); else if ("booleanValue" in t) this.ae(e, 10), 
+        e.ce(t.booleanValue ? 1 : 0); else if ("integerValue" in t) this.ae(e, 15), e.ce(Zt(t.integerValue)); else if ("doubleValue" in t) {
             const n = Zt(t.doubleValue);
-            isNaN(n) ? this.ce(e, 13) : (this.ce(e, 15), ue(n) ? 
+            isNaN(n) ? this.ae(e, 13) : (this.ae(e, 15), ue(n) ? 
             // -0.0, 0 and 0.0 are all considered the same
-            e.ae(0) : e.ae(n));
+            e.ce(0) : e.ce(n));
         } else if ("timestampValue" in t) {
             const n = t.timestampValue;
-            this.ce(e, 20), "string" == typeof n ? e.he(n) : (e.he(`${n.seconds || ""}`), e.ae(n.nanos || 0));
-        } else if ("stringValue" in t) this.le(t.stringValue, e), this.fe(e); else if ("bytesValue" in t) this.ce(e, 30), 
+            this.ae(e, 20), "string" == typeof n ? e.he(n) : (e.he(`${n.seconds || ""}`), e.ce(n.nanos || 0));
+        } else if ("stringValue" in t) this.le(t.stringValue, e), this.fe(e); else if ("bytesValue" in t) this.ae(e, 30), 
         e.de(te(t.bytesValue)), this.fe(e); else if ("referenceValue" in t) this._e(t.referenceValue, e); else if ("geoPointValue" in t) {
             const n = t.geoPointValue;
-            this.ce(e, 45), e.ae(n.latitude || 0), e.ae(n.longitude || 0);
-        } else "mapValue" in t ? be(t) ? this.ce(e, Number.MAX_SAFE_INTEGER) : (this.we(t.mapValue, e), 
+            this.ae(e, 45), e.ce(n.latitude || 0), e.ce(n.longitude || 0);
+        } else "mapValue" in t ? be(t) ? this.ae(e, Number.MAX_SAFE_INTEGER) : (this.we(t.mapValue, e), 
         this.fe(e)) : "arrayValue" in t ? (this.me(t.arrayValue, e), this.fe(e)) : L();
     }
     le(t, e) {
-        this.ce(e, 25), this.ge(t, e);
+        this.ae(e, 25), this.ge(t, e);
     }
     ge(t, e) {
         e.he(t);
     }
     we(t, e) {
         const n = t.fields || {};
-        this.ce(e, 55);
+        this.ae(e, 55);
         for (const t of Object.keys(n)) this.le(t, e), this.oe(n[t], e);
     }
     me(t, e) {
         const n = t.values || [];
-        this.ce(e, 50);
+        this.ae(e, 50);
         for (const t of n) this.oe(t, e);
     }
     _e(t, e) {
-        this.ce(e, 37);
+        this.ae(e, 37);
         dt.fromName(t).path.forEach((t => {
-            this.ce(e, 60), this.ge(t, e);
+            this.ae(e, 60), this.ge(t, e);
         }));
     }
-    ce(t, e) {
-        t.ae(e);
+    ae(t, e) {
+        t.ce(e);
     }
     fe(t) {
         // While the SDK does not implement truncation, the truncation marker is
         // used to terminate all variable length values (which are strings, bytes,
         // references, arrays and maps).
-        t.ae(2);
+        t.ce(2);
     }
 }
 
@@ -7037,7 +7037,7 @@ function ur(t) {
  * behavior defined by the backend.
  *
  * The code is ported from its Java counterpart.
- */ class cr {
+ */ class ar {
     constructor() {
         this.buffer = new Uint8Array(1024), this.position = 0;
     }
@@ -7171,7 +7171,7 @@ function ur(t) {
     }
 }
 
-class ar {
+class cr {
     constructor(t) {
         this.Me = t;
     }
@@ -7181,7 +7181,7 @@ class ar {
     he(t) {
         this.Me.be(t);
     }
-    ae(t) {
+    ce(t) {
         this.Me.ve(t);
     }
     ue() {
@@ -7199,7 +7199,7 @@ class hr {
     he(t) {
         this.Me.Pe(t);
     }
-    ae(t) {
+    ce(t) {
         this.Me.De(t);
     }
     ue() {
@@ -7212,7 +7212,7 @@ class hr {
  * actual encoding.
  */ class lr {
     constructor() {
-        this.Me = new cr, this.Fe = new ar(this.Me), this.$e = new hr(this.Me);
+        this.Me = new ar, this.Fe = new cr(this.Me), this.$e = new hr(this.Me);
     }
     seed(t) {
         this.Me.seed(t);
@@ -7523,7 +7523,7 @@ class pr {
             }));
             const i = {
                 collectionId: n,
-                parent: ci(s)
+                parent: ai(s)
             };
             return Ir(t).put(i);
         }
@@ -7604,7 +7604,7 @@ class pr {
                     /**
  * Returns the list of values that are used in != or NOT_IN filters. Returns
  * `null` if there are no such filters.
- */ (r, i), c = function(t, e) {
+ */ (r, i), a = function(t, e) {
                         const n = new Map;
                         for (const s of mt(e)) for (const e of Be(t, s.fieldPath)) switch (e.op) {
                           case "==" /* EQUAL */ :
@@ -7628,7 +7628,7 @@ class pr {
  * Returns a lower bound of field values that can be used as a starting point to
  * scan the index defined by `fieldIndex`. Returns `MIN_VALUE` if no lower bound
  * exists.
- */ (r, i), a = function(t, e) {
+ */ (r, i), c = function(t, e) {
                         const n = [];
                         let s = !0;
                         // For each segment, retrieve a lower bound if there is a suitable filter or
@@ -7653,7 +7653,7 @@ class pr {
                             n.push(e.value), s && (s = e.inclusive);
                         }
                         return new Ye(n, s);
-                    }(r, i), l = this.Ze(i, r, a), f = this.Ze(i, r, h), d = this.tn(i, r, c), _ = this.en(i.indexId, u, l, a.inclusive, f, h.inclusive, d);
+                    }(r, i), l = this.Ze(i, r, c), f = this.Ze(i, r, h), d = this.tn(i, r, a), _ = this.en(i.indexId, u, l, c.inclusive, f, h.inclusive, d);
                     return Pt.forEach(_, (i => n.j(i, e.limit).next((e => {
                         e.forEach((e => {
                             const n = dt.fromSegments(e.documentKey);
@@ -7679,13 +7679,13 @@ class pr {
         // distributed normal form, but adapted for array values. We create a single
         // index range per value in an ARRAY_CONTAINS or ARRAY_CONTAINS_ANY filter
         // combined with the values from the query bounds.
-        const u = (null != e ? e.length : 1) * Math.max(n.length, i.length), c = u / (null != e ? e.length : 1), a = [];
+        const u = (null != e ? e.length : 1) * Math.max(n.length, i.length), a = u / (null != e ? e.length : 1), c = [];
         for (let h = 0; h < u; ++h) {
-            const u = e ? this.nn(e[h / c]) : yr, l = this.sn(t, u, n[h % c], s), f = this.rn(t, u, i[h % c], r), d = o.map((e => this.sn(t, u, e, 
+            const u = e ? this.nn(e[h / a]) : yr, l = this.sn(t, u, n[h % a], s), f = this.rn(t, u, i[h % a], r), d = o.map((e => this.sn(t, u, e, 
             /* inclusive= */ !0)));
-            a.push(...this.createRange(l, f, d));
+            c.push(...this.createRange(l, f, d));
         }
-        return a;
+        return c;
     }
     /** Generates the lower bound for `arrayValue` and `directionalValue`. */    sn(t, e, n, s) {
         const i = new fr(t, dt.empty(), e, n);
@@ -7769,7 +7769,7 @@ class pr {
         let i = 0;
         for (const r of mt(t)) {
             const t = n[i++];
-            for (const n of s) if (this.cn(e, r.fieldPath) && Ie(t)) s = this.an(s, r, t); else {
+            for (const n of s) if (this.an(e, r.fieldPath) && Ie(t)) s = this.cn(s, r, t); else {
                 const e = n.Be(r.kind);
                 rr.ye.re(t, e);
             }
@@ -7793,7 +7793,7 @@ class pr {
      * The method appends each value to all existing encoders (e.g. filter("a",
      * "==", "a1").filter("b", "in", ["b1", "b2"]) becomes ["a1,b1", "a1,b2"]). A
      * list of new encoders is returned.
-     */    an(t, e, n) {
+     */    cn(t, e, n) {
         const s = [ ...t ], i = [];
         for (const t of n.arrayValue.values || []) for (const n of s) {
             const s = new lr;
@@ -7801,7 +7801,7 @@ class pr {
         }
         return i;
     }
-    cn(t, e) {
+    an(t, e) {
         return !!t.filters.find((t => t instanceof qe && t.field.isEqual(e) && ("in" /* IN */ === t.op || "not-in" /* NOT_IN */ === t.op)));
     }
     getFieldIndexes(t, e) {
@@ -7885,13 +7885,13 @@ class pr {
         const r = [];
         return function(t, e, n, s, i) {
             const r = t.getIterator(), o = e.getIterator();
-            let u = Wt(r), c = Wt(o);
+            let u = Wt(r), a = Wt(o);
             // Walk through the two sets at the same time, using the ordering defined by
             // `comparator`.
-            for (;u || c; ) {
+            for (;u || a; ) {
                 let t = !1, e = !1;
-                if (u && c) {
-                    const s = n(u, c);
+                if (u && a) {
+                    const s = n(u, a);
                     s < 0 ? 
                     // The element was removed if the next element in our ordered
                     // walkthrough is only in `before`.
@@ -7900,7 +7900,7 @@ class pr {
                     // is only in `after`.
                     t = !0);
                 } else null != u ? e = !0 : t = !0;
-                t ? (s(c), c = Wt(o)) : e ? (i(u), u = Wt(r)) : (u = Wt(r), c = Wt(o));
+                t ? (s(a), a = Wt(o)) : e ? (i(u), u = Wt(r)) : (u = Wt(r), a = Wt(o));
             }
         }(s, i, dr, (
         /* onAdd= */ s => {
@@ -8051,18 +8051,18 @@ class Pr {
 function vr(t, e, n) {
     const s = t.store("mutations"), i = t.store("documentMutations"), r = [], o = IDBKeyRange.only(n.batchId);
     let u = 0;
-    const c = s.J({
+    const a = s.J({
         range: o
     }, ((t, e, n) => (u++, n.delete())));
-    r.push(c.next((() => {
+    r.push(a.next((() => {
         U(1 === u);
     })));
-    const a = [];
+    const c = [];
     for (const t of n.mutations) {
         const s = _i(e, t.key.path, n.batchId);
-        r.push(i.delete(s)), a.push(t.key);
+        r.push(i.delete(s)), c.push(t.key);
     }
-    return Pt.waitFor(r).next((() => a));
+    return Pt.waitFor(r).next((() => c));
 }
 
 /**
@@ -8155,7 +8155,7 @@ class Sr {
         // eslint-disable-next-line @typescript-eslint/no-explicit-any
         return r.add({}).next((o => {
             U("number" == typeof o);
-            const u = new Fi(o, e, n, s), c = function(t, e, n) {
+            const u = new Fi(o, e, n, s), a = function(t, e, n) {
                 const s = n.baseMutations.map((e => js(t.ne, e))), i = n.mutations.map((e => js(t.ne, e)));
                 return {
                     userId: e,
@@ -8164,17 +8164,17 @@ class Sr {
                     baseMutations: s,
                     mutations: i
                 };
-            }(this.wt, this.userId, u), a = [];
+            }(this.wt, this.userId, u), c = [];
             let h = new Qt(((t, e) => it(t.canonicalString(), e.canonicalString())));
             for (const t of s) {
                 const e = _i(this.userId, t.key.path, o);
-                h = h.add(t.key.path.popLast()), a.push(r.put(c)), a.push(i.put(e, wi));
+                h = h.add(t.key.path.popLast()), c.push(r.put(a)), c.push(i.put(e, wi));
             }
             return h.forEach((e => {
-                a.push(this.indexManager.addToCollectionParentIndex(t, e));
+                c.push(this.indexManager.addToCollectionParentIndex(t, e));
             })), t.addOnCommittedListener((() => {
                 this.gn[o] = u.keys();
-            })), Pt.waitFor(a).next((() => u));
+            })), Pt.waitFor(c).next((() => u));
         }));
     }
     lookupMutationBatch(t, e) {
@@ -8228,7 +8228,7 @@ class Sr {
         return xr(t).J({
             range: s
         }, ((n, s, r) => {
-            const [o, u, c] = n, a = li(u);
+            const [o, u, a] = n, c = li(u);
             // 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
@@ -8236,9 +8236,9 @@ class Sr {
             // 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.
-                        if (o === this.userId && e.path.isEqual(a)) 
+                        if (o === this.userId && e.path.isEqual(c)) 
             // Look up the mutation batch in the store.
-            return Cr(t).get(c).next((t => {
+            return Cr(t).get(a).next((t => {
                 if (!t) throw L();
                 U(t.userId === this.userId), i.push(Wi(this.wt, t));
             }));
@@ -8252,7 +8252,7 @@ class Sr {
             const i = di(this.userId, e.path), r = IDBKeyRange.lowerBound(i), o = xr(t).J({
                 range: r
             }, ((t, s, i) => {
-                const [r, o, u] = t, c = li(o);
+                const [r, o, u] = t, a = li(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
@@ -8260,7 +8260,7 @@ class Sr {
                 // 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(u) : i.done();
+                                r === this.userId && e.path.isEqual(a) ? n = n.add(u) : i.done();
             }));
             s.push(o);
         })), Pt.waitFor(s).next((() => this.pn(t, n)));
@@ -8274,14 +8274,14 @@ class Sr {
         return xr(t).J({
             range: r
         }, ((t, e, i) => {
-            const [r, u, c] = t, a = li(u);
-            r === this.userId && n.isPrefixOf(a) ? 
+            const [r, u, a] = t, c = li(u);
+            r === this.userId && n.isPrefixOf(c) ? 
             // 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.
-            a.length === s && (o = o.add(c)) : i.done();
+            c.length === s && (o = o.add(a)) : i.done();
         })).next((() => this.pn(t, o)));
     }
     pn(t, e) {
@@ -8354,7 +8354,7 @@ class Sr {
         range: r,
         H: !0
     }, ((t, n, s) => {
-        const [r, u, /*batchID*/ c] = t;
+        const [r, u, /*batchID*/ a] = t;
         r === e && u === i && (o = !0), s.done();
     })).next((() => o));
 }
@@ -8462,7 +8462,7 @@ class kr {
         }));
     }
     getLastRemoteSnapshotVersion(t) {
-        return this.bn(t).next((t => ct.fromTimestamp(new ut(t.lastRemoteSnapshotVersion.seconds, t.lastRemoteSnapshotVersion.nanoseconds))));
+        return this.bn(t).next((t => at.fromTimestamp(new ut(t.lastRemoteSnapshotVersion.seconds, t.lastRemoteSnapshotVersion.nanoseconds))));
     }
     getHighestSequenceNumber(t) {
         return this.bn(t).next((t => t.highestListenSequenceNumber));
@@ -8545,7 +8545,7 @@ class kr {
         // IndexedDb.
         const s = [], i = $r(t);
         return e.forEach((e => {
-            const r = ci(e.path);
+            const r = ai(e.path);
             s.push(i.put({
                 targetId: n,
                 path: r
@@ -8557,7 +8557,7 @@ class kr {
         // IndexedDb.
         const s = $r(t);
         return Pt.forEach(e, (e => {
-            const i = ci(e.path);
+            const i = ai(e.path);
             return Pt.waitFor([ s.delete([ n, i ]), this.referenceDelegate.removeReference(t, n, e) ]);
         }));
     }
@@ -8581,7 +8581,7 @@ class kr {
         })).next((() => i));
     }
     containsKey(t, e) {
-        const n = ci(e.path), s = IDBKeyRange.bound([ n ], [ ot(n) ], 
+        const n = ai(e.path), s = IDBKeyRange.bound([ n ], [ ot(n) ], 
         /*lowerOpen=*/ !1, 
         /*upperOpen=*/ !0);
         let i = 0;
@@ -8732,16 +8732,16 @@ class kr {
         return this.On.getCacheSize(t);
     }
     $n(t, e) {
-        let n, s, i, r, o, c, a;
+        let n, s, i, r, o, a, c;
         const h = Date.now();
         return this.calculateTargetCount(t, this.params.percentileToCollect).next((e => (
         // Cap at the configured max
         e > this.params.maximumSequenceNumbersToCollect ? (M("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 (a = Date.now(), k() <= LogLevel.DEBUG) {
-                M("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 ` + (a - c) + "ms\n" + `Total Duration: ${a - h}ms`);
+            if (c = Date.now(), k() <= LogLevel.DEBUG) {
+                M("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 ` + (c - a) + "ms\n" + `Total Duration: ${c - h}ms`);
             }
             return Pt.resolve({
                 didRun: !0,
@@ -8824,7 +8824,7 @@ class Kr {
                     if (!e) 
                     // Our size accounting requires us to read all documents before
                     // removing them.
-                    return i++, n.getEntry(t, r).next((() => (n.removeEntry(r, ct.min()), $r(t).delete([ 0, ci(r.path) ]))));
+                    return i++, n.getEntry(t, r).next((() => (n.removeEntry(r, at.min()), $r(t).delete([ 0, ai(r.path) ]))));
                 }));
                 s.push(e);
             }
@@ -8881,7 +8881,7 @@ function Gr(t, e) {
     function(t, e) {
         return {
             targetId: 0,
-            path: ci(t.path),
+            path: ai(t.path),
             sequenceNumber: e
         };
     }(e, t.currentSequenceNumber));
@@ -9156,7 +9156,7 @@ function Gr(t, e) {
             const t = qi(this.wt, 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 xe.newInvalidDocument(t);
     }
@@ -9192,14 +9192,14 @@ function Gr(t, e) {
             if (e.push(this.zn.removeEntry(t, i, o.readTime)), r.isValidDocument()) {
                 const u = Ki(this.zn.wt, r);
                 s = s.add(i.path.popLast());
-                const c = Vr(u);
-                n += c - o.size, e.push(this.zn.addEntry(t, i, u));
+                const a = Vr(u);
+                n += a - o.size, e.push(this.zn.addEntry(t, i, u));
             } else if (n -= o.size, 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 = Ki(this.zn.wt, r.convertToNoDocument(ct.min()));
+                const n = Ki(this.zn.wt, r.convertToNoDocument(at.min()));
                 e.push(this.zn.addEntry(t, i, n));
             }
         })), s.forEach((n => {
@@ -9360,7 +9360,7 @@ function Xr(t, e) {
      */    getLocalViewOfDocuments(t, e, n = ws()) {
         const s = hs();
         return this.populateOverlays(t, s, e).next((() => this.computeViews(t, e, s, n).next((t => {
-            let e = cs();
+            let e = as();
             return t.forEach(((t, n) => {
                 e = e.insert(t, n.overlayedDocument);
             })), e;
@@ -9436,13 +9436,13 @@ function Xr(t, e) {
             // Iterate in descending order of batch IDs, and skip documents that are
             // already saved.
                         for (;o.hasNext(); ) {
-                const s = o.getNext(), u = s.key, c = s.value, a = ls();
-                c.forEach((t => {
+                const s = o.getNext(), u = s.key, a = s.value, c = ls();
+                a.forEach((t => {
                     if (!i.has(t)) {
                         const s = Un(e.get(t), n.get(t));
-                        null !== s && a.set(t, s), i = i.add(t);
+                        null !== s && c.set(t, s), i = i.add(t);
                     }
-                })), r.push(this.documentOverlayCache.saveOverlays(t, u, a));
+                })), r.push(this.documentOverlayCache.saveOverlays(t, u, c));
             }
             return Pt.waitFor(r);
         })).next((() => n));
@@ -9466,7 +9466,7 @@ function Xr(t, e) {
  */
         return function(t) {
             return dt.isDocumentKey(t.path) && null === t.collectionGroup && 0 === t.filters.length;
-        }(e) ? this.getDocumentsMatchingDocumentQuery(t, e.path) : an(e) ? this.getDocumentsMatchingCollectionGroupQuery(t, e, n) : this.getDocumentsMatchingCollectionQuery(t, e, n);
+        }(e) ? this.getDocumentsMatchingDocumentQuery(t, e.path) : cn(e) ? this.getDocumentsMatchingCollectionGroupQuery(t, e, n) : this.getDocumentsMatchingCollectionQuery(t, e, n);
     }
     /**
      * Given a collection group, returns the next documents that follow the provided offset, along
@@ -9495,20 +9495,20 @@ function Xr(t, e) {
                 u = u.insert(e, t);
             }))))).next((() => this.populateOverlays(t, e, i))).next((() => this.computeViews(t, u, e, ws()))).next((t => ({
                 batchId: o,
-                changes: as(t)
+                changes: cs(t)
             })))));
         }));
     }
     getDocumentsMatchingDocumentQuery(t, e) {
         // Just do a simple document lookup.
         return this.getDocument(t, new dt(e)).next((t => {
-            let e = cs();
+            let e = as();
             return t.isFoundDocument() && (e = e.insert(t.key, t)), e;
         }));
     }
     getDocumentsMatchingCollectionGroupQuery(t, e, n) {
         const s = e.collectionGroup;
-        let i = cs();
+        let i = as();
         return this.indexManager.getCollectionParents(t, s).next((r => Pt.forEach(r, (r => {
             const o = function(t, e) {
                 return new nn(e, 
@@ -9533,7 +9533,7 @@ function Xr(t, e) {
                 null === s.get(n) && (s = s.insert(n, xe.newInvalidDocument(n)));
             }));
             // Apply the overlays and match against the query.
-            let n = cs();
+            let n = as();
             return s.forEach(((s, i) => {
                 const r = t.get(s);
                 void 0 !== r && Kn(r.mutation, i, zt.empty(), ut.now()), 
@@ -10025,7 +10025,7 @@ class uo {
     newChangeBuffer(t) {
         // `trackRemovals` is ignores since the MemoryRemoteDocumentCache keeps
         // a separate changelog and does not need special handling for removals.
-        return new co(this);
+        return new ao(this);
     }
     getSize(t) {
         return Pt.resolve(this.size);
@@ -10042,7 +10042,7 @@ class uo {
 /**
  * Handles the details of adding and updating documents in the MemoryRemoteDocumentCache.
  */
-class co extends Qr {
+class ao extends Qr {
     constructor(t) {
         super(), this.zn = t;
     }
@@ -10075,7 +10075,7 @@ class co extends Qr {
  * 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(t) {
         this.persistence = t, 
         /**
@@ -10083,7 +10083,7 @@ class co extends Qr {
          */
         this.Ts = new is((t => Oe(t)), Fe), 
         /** 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. */
@@ -10191,7 +10191,7 @@ class ho {
      */
     constructor(t, e) {
         this.bs = {}, this.overlays = {}, this.Ps = new $t(0), this.vs = !1, this.vs = !0, 
-        this.referenceDelegate = t(this), this.Vs = new ao(this);
+        this.referenceDelegate = t(this), this.Vs = new co(this);
         this.indexManager = new mr, this.remoteDocumentCache = function(t) {
             return new uo(t);
         }((t => this.referenceDelegate.Ss(t))), this.wt = new Ui(e), this.Ds = new no(this.wt);
@@ -10294,7 +10294,7 @@ class fo {
         return Pt.forEach(this.Fs, (n => {
             const s = dt.fromPath(n);
             return this.$s(t, s).next((t => {
-                t || e.removeEntry(s, ct.min());
+                t || e.removeEntry(s, at.min());
             }));
         })).next((() => (this.Os = null, e.apply(t))));
     }
@@ -10377,7 +10377,7 @@ class fo {
             const e = t.store("targetGlobal"), n = {
                 highestTargetId: 0,
                 highestListenSequenceNumber: 0,
-                lastRemoteSnapshotVersion: ct.min().toTimestamp(),
+                lastRemoteSnapshotVersion: at.min().toTimestamp(),
                 targetCount: 0
             };
             return e.put("targetGlobalKey", n);
@@ -10495,11 +10495,11 @@ class fo {
             const s = [];
             return n.J(((n, i) => {
                 const r = new ht(n), o = function(t) {
-                    return [ 0, ci(t) ];
+                    return [ 0, ai(t) ];
                 }(r);
                 s.push(e.get(o).next((n => n ? Pt.resolve() : (n => e.put({
                     targetId: 0,
-                    path: ci(n),
+                    path: ai(n),
                     sequenceNumber: t.highestListenSequenceNumber
                 }))(r))));
             })).next((() => Pt.waitFor(s)));
@@ -10515,7 +10515,7 @@ class fo {
                 const e = t.lastSegment(), s = t.popLast();
                 return n.put({
                     collectionId: e,
-                    parent: ci(s)
+                    parent: ai(s)
                 });
             }
         };
@@ -10582,8 +10582,8 @@ class fo {
                 let s = null !== (e = n.get(t.userId)) && void 0 !== e ? e : ws();
                 Wi(this.wt, t).keys().forEach((t => s = s.add(t))), n.set(t.userId, s);
             })), Pt.forEach(n, ((t, n) => {
-                const r = new C(n), o = sr.se(this.wt, r), u = i.getIndexManager(r), c = Sr.se(r, this.wt, u, i.referenceDelegate);
-                return new eo(s, c, o, u).recalculateAndSaveOverlaysForDocumentKeys(new Oi(e, $t.ot), t).next();
+                const r = new C(n), o = sr.se(this.wt, r), u = i.getIndexManager(r), a = Sr.se(r, this.wt, u, i.referenceDelegate);
+                return new eo(s, a, o, u).recalculateAndSaveOverlaysForDocumentKeys(new Oi(e, $t.ot), t).next();
             }));
         }));
     }
@@ -10661,14 +10661,14 @@ class go {
      * Whether to synchronize the in-memory state of multiple tabs and share
      * access to local persistence.
      */
-    t, e, n, s, i, r, o, u, c, 
+    t, e, n, s, i, r, o, u, a, 
     /**
      * If set to true, forcefully obtains database access. Existing tabs will
      * no longer be able to access IndexedDB.
      */
-    a, h = 14) {
+    c, h = 14) {
         if (this.allowTabSynchronization = t, this.persistenceKey = e, this.clientId = n, 
-        this.js = i, this.window = r, this.document = o, this.Ws = c, this.zs = a, this.Hs = h, 
+        this.js = i, this.window = r, this.document = o, this.Ws = a, this.zs = c, this.Hs = h, 
         this.Ps = null, this.vs = !1, this.isPrimary = !1, this.networkEnabled = !0, 
         /** Our window.unload handler, if registered. */
         this.Js = null, this.inForeground = !1, 
@@ -10683,7 +10683,7 @@ class go {
         this.referenceDelegate = new Kr(this, s), this.ei = e + "main", this.wt = new Ui(u), 
         this.ni = new Vt(this.ei, this.Hs, new _o(this.wt)), this.Vs = new Or(this.referenceDelegate, this.wt), 
         this.remoteDocumentCache = Wr(this.wt), this.Ds = new tr, this.window && this.window.localStorage ? this.si = this.window.localStorage : (this.si = null, 
-        !1 === a && F("IndexedDbPersistence", "LocalStorage is unavailable. As a result, persistence may not work reliably. In particular enablePersistence() could fail immediately after refreshing the page."));
+        !1 === c && F("IndexedDbPersistence", "LocalStorage is unavailable. As a result, persistence may not work reliably. In particular enablePersistence() could fail immediately after refreshing the page."));
     }
     /**
      * Attempt to start IndexedDb persistence.
@@ -10711,7 +10711,7 @@ class go {
      * with the current primary state.
      *
      * PORTING NOTE: This is only used for Web multi-tab.
-     */    ci(t) {
+     */    ai(t) {
         return this.ti = async e => {
             if (this.started) return t(e);
         }, t(this.isPrimary);
@@ -10752,7 +10752,7 @@ class go {
             networkEnabled: this.networkEnabled,
             inForeground: this.inForeground
         }).next((() => {
-            if (this.isPrimary) return this.ai(t).next((t => {
+            if (this.isPrimary) return this.ci(t).next((t => {
                 t || (this.isPrimary = !1, this.js.enqueueRetryable((() => this.ti(!1))));
             }));
         })).next((() => this.hi(t))).next((e => this.isPrimary && !e ? this.li(t).next((() => !1)) : !!e && this.fi(t).next((() => !0)))))).catch((t => {
@@ -10767,7 +10767,7 @@ class go {
             this.isPrimary !== t && this.js.enqueueRetryable((() => this.ti(t))), this.isPrimary = t;
         }));
     }
-    ai(t) {
+    ci(t) {
         return yo(t).get("owner").next((t => Pt.resolve(this.di(t))));
     }
     _i(t) {
@@ -10912,7 +10912,7 @@ class go {
         // Do all transactions as readwrite against all object stores, since we
         // are the only reader/writer.
                 return this.ni.runTransaction(t, s, i, (s => (o = new Oi(s, this.Ps ? this.Ps.next() : $t.ot), 
-        "readwrite-primary" === e ? this.ai(o).next((t => !!t || this.hi(o))).next((e => {
+        "readwrite-primary" === e ? this.ci(o).next((t => !!t || this.hi(o))).next((e => {
             if (!e) throw F(`Failed to obtain primary lease for action '${t}'.`), this.isPrimary = !1, 
             this.js.enqueueRetryable((() => this.ti(!1))), new Q(G.FAILED_PRECONDITION, At);
             return n(o);
@@ -11165,7 +11165,7 @@ class To {
      * Performs a query based on the target's persisted query mapping. Returns
      * `null` if the mapping is not available or cannot be used.
      */    xi(t, e, n, s) {
-        return on(e) || s.isEqual(ct.min()) ? this.Ni(t, e) : this.Di.getDocuments(t, n).next((i => {
+        return on(e) || s.isEqual(at.min()) ? this.Ni(t, e) : this.Di.getDocuments(t, n).next((i => {
             const r = this.ki(e, i);
             return this.Oi(e, r, n, s) ? this.Ni(t, e) : (k() <= LogLevel.DEBUG && M("QueryEngine", "Re-using previous result from %s to execute query: %s", s.toString(), wn(e)), 
             this.Mi(t, r, e, pt(s, -1)));
@@ -11411,15 +11411,15 @@ function vo(t) {
                 i = n.$i;
         const o = [];
         e.targetChanges.forEach(((r, u) => {
-            const c = i.get(u);
-            if (!c) return;
+            const a = i.get(u);
+            if (!a) 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.Vs.removeMatchingKeys(t, r.removedDocuments, u).next((() => n.Vs.addMatchingKeys(t, r.addedDocuments, u))));
-            let a = c.withSequenceNumber(t.currentSequenceNumber);
-            e.targetMismatches.has(u) ? a = a.withResumeToken(Jt.EMPTY_BYTE_STRING, ct.min()).withLastLimboFreeSnapshotVersion(ct.min()) : r.resumeToken.approximateByteSize() > 0 && (a = a.withResumeToken(r.resumeToken, s)), 
-            i = i.insert(u, a), 
+            let c = a.withSequenceNumber(t.currentSequenceNumber);
+            e.targetMismatches.has(u) ? c = c.withResumeToken(Jt.EMPTY_BYTE_STRING, at.min()).withLastLimboFreeSnapshotVersion(at.min()) : r.resumeToken.approximateByteSize() > 0 && (c = c.withResumeToken(r.resumeToken, s)), 
+            i = i.insert(u, c), 
             // Update the target data if there are target changes (or if
             // sufficient time has passed since the last update).
             /**
@@ -11451,9 +11451,9 @@ function vo(t) {
             }
             /**
  * Notifies local store of the changed views to locally pin documents.
- */ (c, a, r) && o.push(n.Vs.updateTargetData(t, a));
+ */ (a, c, r) && o.push(n.Vs.updateTargetData(t, c));
         }));
-        let u = os(), c = ws();
+        let u = os(), a = ws();
         // 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
@@ -11464,12 +11464,12 @@ function vo(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(So(t, r, e.documentUpdates).next((t => {
-            u = t.Gi, c = t.Qi;
-        }))), !s.isEqual(ct.min())) {
+            u = t.Gi, a = t.Qi;
+        }))), !s.isEqual(at.min())) {
             const e = n.Vs.getLastRemoteSnapshotVersion(t).next((e => n.Vs.setTargetsMetadata(t, t.currentSequenceNumber, s)));
             o.push(e);
         }
-        return Pt.waitFor(o).next((() => r.apply(t))).next((() => n.localDocuments.getLocalViewOfDocuments(t, u, c))).next((() => u));
+        return Pt.waitFor(o).next((() => r.apply(t))).next((() => n.localDocuments.getLocalViewOfDocuments(t, u, a))).next((() => u));
     })).then((t => (n.$i = i, t)));
 }
 
@@ -11494,7 +11494,7 @@ function vo(t) {
             // to ensure that rejected limbo resolutions (which fabricate
             // NoDocuments with SnapshotVersion.min()) never add documents to
             // cache.
-            r.isNoDocument() && r.version.isEqual(ct.min()) ? (
+            r.isNoDocument() && r.version.isEqual(at.min()) ? (
             // NoDocuments with SnapshotVersion.min() are used in manufactured
             // events. We remove these documents from cache since we lost
             // access.
@@ -11588,7 +11588,7 @@ async function xo(t, e, n) {
  * be used to optimize this query execution.
  */ function No(t, e, n) {
     const s = K(t);
-    let i = ct.min(), r = ws();
+    let i = at.min(), r = ws();
     return s.persistence.runTransaction("Execute query", "readonly", (t => function(t, e, n) {
         const s = K(t), i = s.Bi.get(n);
         return void 0 !== i ? Pt.resolve(s.$i.get(i)) : s.Vs.getTargetData(e, n);
@@ -11596,7 +11596,7 @@ async function xo(t, e, n) {
         if (e) return i = e.lastLimboFreeSnapshotVersion, s.Vs.getMatchingKeysForTargetId(t, e.targetId).next((t => {
             r = t;
         }));
-    })).next((() => s.Fi.getDocumentsMatchingQuery(t, e, n ? i : ct.min(), n ? r : ws()))).next((t => (Mo(s, gn(e), t), 
+    })).next((() => s.Fi.getDocumentsMatchingQuery(t, e, n ? i : at.min(), n ? r : ws()))).next((t => (Mo(s, gn(e), t), 
     {
         documents: t,
         ji: r
@@ -11617,7 +11617,7 @@ function ko(t, e) {
  */
 // PORTING NOTE: Multi-Tab only.
 function Oo(t, e) {
-    const n = K(t), s = n.Li.get(e) || ct.min();
+    const n = K(t), s = n.Li.get(e) || at.min();
     // Get the current maximum read time for the collection. This should always
     // exist, but to reduce the chance for regressions we default to
     // SnapshotVersion.Min()
@@ -11629,7 +11629,7 @@ function Oo(t, e) {
 /** Sets the collection group's maximum read time from the given documents. */
 // PORTING NOTE: Multi-Tab only.
 function Mo(t, e, n) {
-    let s = ct.min();
+    let s = at.min();
     n.forEach(((t, e) => {
         e.readTime.compareTo(s) > 0 && (s = e.readTime);
     })), t.Li.set(e, s);
@@ -11659,7 +11659,7 @@ async function Fo(t, e, n, s) {
     }
     const u = i.Ui.newChangeBuffer({
         trackRemovals: !0
-    }), c = await Co(i, function(t) {
+    }), a = await Co(i, function(t) {
         // It is OK that the path used for the query is not valid, because this will
         // not be read and queried.
         return ln(rn(ht.fromString(`__bundle__/docs/${t}`)));
@@ -11667,7 +11667,7 @@ async function Fo(t, e, n, 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 => So(t, u, o).next((e => (u.apply(t), 
-    e))).next((e => i.Vs.removeMatchingKeysForTargetId(t, c.targetId).next((() => i.Vs.addMatchingKeys(t, r, c.targetId))).next((() => i.localDocuments.getLocalViewOfDocuments(t, e.Gi, e.Qi))).next((() => e.Gi))))));
+    e))).next((e => i.Vs.removeMatchingKeysForTargetId(t, a.targetId).next((() => i.Vs.addMatchingKeys(t, r, a.targetId))).next((() => i.localDocuments.getLocalViewOfDocuments(t, e.Gi, e.Qi))).next((() => e.Gi))))));
 }
 
 /**
@@ -11816,7 +11816,7 @@ class Ko {
      */    static Ji(t, e) {
         const n = JSON.parse(e);
         let s = "object" == typeof n && n.activeTargetIds instanceof Array, i = gs();
-        for (let t = 0; s && t < n.activeTargetIds.length; ++t) s = ce(n.activeTargetIds[t]), 
+        for (let t = 0; s && t < n.activeTargetIds.length; ++t) s = ae(n.activeTargetIds[t]), 
         i = i.add(n.activeTargetIds[t]);
         return s ? new Go(t, i) : (F("SharedClientState", `Failed to parse client data for instance '${t}': ${e}`), 
         null);
@@ -11912,8 +11912,8 @@ class jo {
  * 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.
- */ (this.persistenceKey), this.sr = this.sr.insert(this.tr, new jo), this.cr = new RegExp(`^firestore_clients_${r}_([^_]*)$`), 
-        this.ar = new RegExp(`^firestore_mutations_${r}_(\\d+)(?:_(.*))?$`), this.hr = new RegExp(`^firestore_targets_${r}_(\\d+)$`), 
+ */ (this.persistenceKey), this.sr = this.sr.insert(this.tr, new jo), this.ar = new RegExp(`^firestore_clients_${r}_([^_]*)$`), 
+        this.cr = new RegExp(`^firestore_mutations_${r}_(\\d+)(?:_(.*))?$`), this.hr = new RegExp(`^firestore_targets_${r}_(\\d+)$`), 
         this.lr = 
         /** Assembles the key for the online state of the primary tab. */
         function(t) {
@@ -12049,7 +12049,7 @@ class jo {
             if (M("SharedClientState", "EVENT", e.key, e.newValue), e.key === this.rr) return void F("Received WebStorage notification for local change. Another client might have garbage-collected our state");
             this.js.enqueueRetryable((async () => {
                 if (this.started) {
-                    if (null !== e.key) if (this.cr.test(e.key)) {
+                    if (null !== e.key) if (this.ar.test(e.key)) {
                         if (null == e.newValue) {
                             const t = this.Rr(e.key);
                             return this.br(t, null);
@@ -12058,7 +12058,7 @@ class jo {
                             const t = this.Pr(e.key, e.newValue);
                             if (t) return this.br(t.clientId, t);
                         }
-                    } else if (this.ar.test(e.key)) {
+                    } else if (this.cr.test(e.key)) {
                         if (null !== e.newValue) {
                             const t = this.vr(e.key, e.newValue);
                             if (t) return this.Vr(t);
@@ -12131,7 +12131,7 @@ class jo {
      * Parses a client state key in WebStorage. Returns null if the key does not
      * match the expected key format.
      */    Rr(t) {
-        const e = this.cr.exec(t);
+        const e = this.ar.exec(t);
         return e ? e[1] : null;
     }
     /**
@@ -12145,7 +12145,7 @@ class jo {
      * Parses a mutation batch state in WebStorage. Returns 'null' if the value
      * could not be parsed.
      */    vr(t, e) {
-        const n = this.ar.exec(t), s = Number(n[1]), i = void 0 !== n[2] ? n[2] : null;
+        const n = this.cr.exec(t), s = Number(n[1]), i = void 0 !== n[2] ? n[2] : null;
         return qo.Ji(new C(i), s, e);
     }
     /**
@@ -12425,13 +12425,13 @@ class {
         const r = this.oo(t, e);
         M("RestConnection", "Sending: ", r, n);
         const o = {};
-        return this.uo(o, s, i), this.co(t, r, o, n).then((t => (M("RestConnection", "Received: ", t), 
+        return this.uo(o, s, i), this.ao(t, r, o, n).then((t => (M("RestConnection", "Received: ", t), 
         t)), (e => {
             throw $("RestConnection", `${t} failed with error: `, e, "url: ", r, "request:", n), 
             e;
         }));
     }
-    ao(t, e, n, s, i, r) {
+    co(t, e, n, s, i, r) {
         // The REST API automatically aggregates all of the streamed results, so we
         // can just use the normal invoke() method.
         return this.ro(t, e, n, s, i);
@@ -12457,7 +12457,7 @@ class {
         super(t), this.forceLongPolling = t.forceLongPolling, this.autoDetectLongPolling = t.autoDetectLongPolling, 
         this.useFetchStreams = t.useFetchStreams;
     }
-    co(t, e, n, s) {
+    ao(t, e, n, s) {
         return new Promise(((i, r) => {
             const o = new XhrIo;
             o.listenOnce(EventType.COMPLETE, (() => {
@@ -12545,22 +12545,22 @@ class {
         isMobileCordova() || isReactNative() || isElectron() || isIE() || isUWP() || isBrowserExtension() || (o.httpHeadersOverwriteParam = "$httpHeaders");
         const u = s.join("");
         M("Connection", "Creating WebChannel: " + u, o);
-        const c = i.createWebChannel(u, o);
+        const a = i.createWebChannel(u, 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
         // opening the WebChannel until send is called. Whether we have called
         // open is tracked with this variable.
-                let a = !1, h = !1;
+                let c = !1, h = !1;
         // A flag to determine whether the stream was closed (by us or through an
         // error/close event) to avoid delivering multiple close events or sending
         // on a closed stream
                 const l = new Xo({
             jr: t => {
-                h ? M("Connection", "Not sending because WebChannel is closed:", t) : (a || (M("Connection", "Opening WebChannel transport."), 
-                c.open(), a = !0), M("Connection", "WebChannel sending:", t), c.send(t));
+                h ? M("Connection", "Not sending because WebChannel is closed:", t) : (c || (M("Connection", "Opening WebChannel transport."), 
+                a.open(), c = !0), M("Connection", "WebChannel sending:", t), a.send(t));
             },
-            Wr: () => c.close()
+            Wr: () => a.close()
         }), y = (t, e, n) => {
             // TODO(dimond): closure typing seems broken because WebChannel does
             // not implement goog.events.Listenable
@@ -12578,13 +12578,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 || M("Connection", "WebChannel transport opened.");
-        })), y(c, WebChannel.EventType.CLOSE, (() => {
+        })), y(a, WebChannel.EventType.CLOSE, (() => {
             h || (h = !0, M("Connection", "WebChannel transport closed"), l.eo());
-        })), y(c, WebChannel.EventType.ERROR, (t => {
+        })), y(a, WebChannel.EventType.ERROR, (t => {
             h || (h = !0, $("Connection", "WebChannel transport errored:", t), l.eo(new Q(G.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];
@@ -12614,7 +12614,7 @@ class {
                     }(t), n = i.message;
                     void 0 === e && (e = G.INTERNAL, n = "Unknown error status: " + t + " with message " + i.message), 
                     // Mark closed so no further events are propagated
-                    h = !0, l.eo(new Q(e, n)), c.close();
+                    h = !0, l.eo(new Q(e, n)), a.close();
                 } else M("Connection", "WebChannel received:", n), l.no(n);
             }
         })), y(r, Event.STAT_EVENT, (t => {
@@ -13031,9 +13031,9 @@ class iu {
             // 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 ? Ns(e.readTime) : ct.min();
+            return e.targetIds && e.targetIds.length ? at.min() : e.readTime ? Ns(e.readTime) : at.min();
         }(t);
         return this.listener.Go(e, n);
     }
@@ -13051,7 +13051,7 @@ class iu {
                 documents: Hs(t, s)
             } : {
                 query: Js(t, s)
-            }, n.targetId = e.targetId, e.resumeToken.approximateByteSize() > 0 ? n.resumeToken = Cs(t, e.resumeToken) : e.snapshotVersion.compareTo(ct.min()) > 0 && (
+            }, n.targetId = e.targetId, e.resumeToken.approximateByteSize() > 0 ? n.resumeToken = Cs(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).
@@ -13178,8 +13178,8 @@ class uu extends class {} {
             this.appCheckCredentials.invalidateToken()), t) : new Q(G.UNKNOWN, t.toString());
         }));
     }
-    /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */    ao(t, e, n, s) {
-        return this.tu(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([i, r]) => this.bo.ao(t, e, n, i, r, s))).catch((t => {
+    /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */    co(t, e, n, s) {
+        return this.tu(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([i, r]) => this.bo.co(t, e, n, i, r, s))).catch((t => {
             throw "FirebaseError" === t.name ? (t.code === G.UNAUTHENTICATED && (this.authCredentials.invalidateToken(), 
             this.appCheckCredentials.invalidateToken()), t) : new Q(G.UNKNOWN, t.toString());
         }));
@@ -13202,7 +13202,7 @@ class uu extends class {} {
  * then we set the OnlineState to Offline, and the client will behave as if
  * it is offline (get()s will return cached data, etc.).
  */
-class cu {
+class au {
     constructor(t, e) {
         this.asyncQueue = t, this.onlineStateHandler = e, 
         /** The current OnlineState. */
@@ -13244,7 +13244,7 @@ class cu {
      * actually transition to the 'Offline' state.
      */    uu(t) {
         "Online" /* Online */ === this.state ? this.ru("Unknown" /* Unknown */) : (this.eu++, 
-        this.eu >= 1 && (this.cu(), this.ou(`Connection failed 1 times. Most recent error: ${t.toString()}`), 
+        this.eu >= 1 && (this.au(), this.ou(`Connection failed 1 times. Most recent error: ${t.toString()}`), 
         this.ru("Offline" /* Offline */)));
     }
     /**
@@ -13254,7 +13254,7 @@ class cu {
      * Offline heuristics, so must not be used in place of
      * handleWatchStreamStart() and handleWatchStreamFailure().
      */    set(t) {
-        this.cu(), this.eu = 0, "Online" /* Online */ === t && (
+        this.au(), this.eu = 0, "Online" /* Online */ === t && (
         // We've connected to watch at least once. Don't warn the developer
         // about being offline going forward.
         this.su = !1), this.ru(t);
@@ -13266,7 +13266,7 @@ class cu {
         const e = `Could not reach Cloud Firestore backend. ${t}\nThis typically indicates that your device does not have a healthy Internet connection at the moment. The client will operate in offline mode until it is able to successfully connect to the backend.`;
         this.su ? (F(e), this.su = !1) : M("OnlineStateTracker", e);
     }
-    cu() {
+    au() {
         null !== this.nu && (this.nu.cancel(), this.nu = null);
     }
 }
@@ -13286,7 +13286,7 @@ class cu {
  * 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 au {
+ */ class cu {
     constructor(
     /**
      * The local store, used to fill the write pipeline with outbound mutations.
@@ -13312,7 +13312,7 @@ class cu {
          * purely based on order, and so we can just shift() writes from the front of
          * the writePipeline as we receive responses.
          */
-        this.au = [], 
+        this.cu = [], 
         /**
          * A mapping of watched targets that the client cares about tracking and the
          * user has explicitly called a 'listen' for this target.
@@ -13347,7 +13347,7 @@ class cu {
                     e.lu.delete(4 /* ConnectivityChange */), await hu(e);
                 }(this));
             }));
-        })), this._u = new cu(n, s);
+        })), this._u = new au(n, s);
     }
 }
 
@@ -13467,7 +13467,7 @@ async function Eu(t, e, n) {
         M("RemoteStore", "Failed to remove targets %s: %s ", e.targetIds.join(","), n), 
         await Au(t, n);
     } else if (e instanceof Is ? t.wu.Ut(e) : e instanceof Ts ? t.wu.zt(e) : t.wu.Gt(e), 
-    !n.isEqual(ct.min())) try {
+    !n.isEqual(at.min())) try {
         const e = await vo(t.localStore);
         n.compareTo(e) >= 0 && 
         // We have received a target change with a global snapshot if the snapshot
@@ -13548,11 +13548,11 @@ async function Eu(t, e, n) {
 
 async function bu(t) {
     const e = K(t), n = Fu(e);
-    let s = e.au.length > 0 ? e.au[e.au.length - 1].batchId : -1;
+    let s = e.cu.length > 0 ? e.cu[e.cu.length - 1].batchId : -1;
     for (;Pu(e); ) try {
         const t = await Do(e.localStore, s);
         if (null === t) {
-            0 === e.au.length && n.ko();
+            0 === e.cu.length && n.ko();
             break;
         }
         s = t.batchId, vu(e, t);
@@ -13566,20 +13566,20 @@ async function bu(t) {
  * Returns true if we can add to the write pipeline (i.e. the network is
  * enabled and the write pipeline is not full).
  */ function Pu(t) {
-    return yu(t) && t.au.length < 10;
+    return yu(t) && t.cu.length < 10;
 }
 
 /**
  * Queues additional writes to be sent to the write stream, sending them
  * immediately if the write stream is established.
  */ function vu(t, e) {
-    t.au.push(e);
+    t.cu.push(e);
     const n = Fu(t);
     n.Co() && n.zo && n.Ho(e.mutations);
 }
 
 function Vu(t) {
-    return yu(t) && !Fu(t).Do() && t.au.length > 0;
+    return yu(t) && !Fu(t).Do() && t.cu.length > 0;
 }
 
 function Su(t) {
@@ -13593,11 +13593,11 @@ async function Du(t) {
 async function Cu(t) {
     const e = Fu(t);
     // Send the write pipeline now that the stream is established.
-        for (const n of t.au) e.Ho(n.mutations);
+        for (const n of t.cu) e.Ho(n.mutations);
 }
 
 async function xu(t, e, n) {
-    const s = t.au.shift(), i = $i.from(s, e, n);
+    const s = t.cu.shift(), i = $i.from(s, e, n);
     await Ru(t, (() => t.remoteSyncer.applySuccessfulWrite(i))), 
     // It's possible that with the completion of this mutation another
     // slot has freed up.
@@ -13615,7 +13615,7 @@ async function Nu(t, e) {
         if (n = e.code, ns(n) && n !== G.ABORTED) {
             // This was a permanent error, the request itself was the problem
             // so it's not going to succeed if we resend it.
-            const n = t.au.shift();
+            const n = t.cu.shift();
             // In this case it's also unlikely that the server itself is melting
             // down -- this was just a bad request so inhibit backoff on the next
             // restart.
@@ -13712,8 +13712,8 @@ async function ku(t, e) {
     }), t.fu.push((async e => {
         e ? (t.gu.No(), 
         // This will start the write stream if necessary.
-        await bu(t)) : (await t.gu.stop(), t.au.length > 0 && (M("RemoteStore", `Stopping write stream with ${t.au.length} pending writes`), 
-        t.au = []));
+        await bu(t)) : (await t.gu.stop(), t.cu.length > 0 && (M("RemoteStore", `Stopping write stream with ${t.cu.length} pending writes`), 
+        t.cu = []));
     }))), t.gu;
 }
 
@@ -13836,7 +13836,7 @@ class $u {
         // We are adding document key comparator to the end as it's the only
         // guaranteed unique property of a document.
         this.comparator = t ? (e, n) => t(e, n) || dt.comparator(e.key, n.key) : (t, e) => dt.comparator(t.key, e.key), 
-        this.keyedMap = cs(), this.sortedSet = new qt(this.comparator);
+        this.keyedMap = as(), this.sortedSet = new qt(this.comparator);
     }
     /**
      * Returns an empty copy of the existing DocumentSet, using the same
@@ -14223,7 +14223,7 @@ function Hu(t) {
         /** Batched documents to be saved into storage */
         this.documents = [], 
         /** The collection groups affected by this bundle. */
-        this.collectionGroups = new Set, this.progress = tc(t);
+        this.collectionGroups = new Set, this.progress = ta(t);
     }
     /**
      * Adds an element from the bundle to the loader.
@@ -14271,7 +14271,7 @@ function Hu(t) {
 /**
  * Returns a `LoadBundleTaskProgress` representing the initial progress of
  * loading a bundle.
- */ function tc(t) {
+ */ function ta(t) {
     return {
         taskState: "Running",
         documentsLoaded: 0,
@@ -14301,13 +14301,13 @@ function Hu(t) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-class ec {
+class ea {
     constructor(t) {
         this.key = t;
     }
 }
 
-class nc {
+class na {
     constructor(t) {
         this.key = t;
     }
@@ -14317,7 +14317,7 @@ class nc {
  * 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 sc {
+ */ class sa {
     constructor(t, 
     /** Documents included in the remote target */
     e) {
@@ -14360,34 +14360,34 @@ class nc {
         // 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 u = "F" /* First */ === this.query.limitType && s.size === this.query.limit ? s.last() : null, c = "L" /* Last */ === this.query.limitType && s.size === this.query.limit ? s.first() : null;
+        const u = "F" /* First */ === this.query.limitType && s.size === this.query.limit ? s.last() : null, a = "L" /* Last */ === this.query.limitType && s.size === this.query.limit ? s.first() : null;
         // Drop documents out to meet limit/limitToLast requirement.
         if (t.inorderTraversal(((t, e) => {
-            const a = s.get(t), h = mn(this.query, e) ? e : null, l = !!a && this.mutatedKeys.has(a.key), f = !!h && (h.hasLocalMutations || 
+            const c = s.get(t), h = mn(this.query, e) ? e : null, l = !!c && this.mutatedKeys.has(c.key), f = !!h && (h.hasLocalMutations || 
             // We only consider committed mutations for documents that were
             // mutated during the lifetime of the view.
             this.mutatedKeys.has(h.key) && h.hasCommittedMutations);
             let d = !1;
             // Calculate change
-                        if (a && h) {
-                a.data.isEqual(h.data) ? l !== f && (n.track({
+                        if (c && h) {
+                c.data.isEqual(h.data) ? l !== f && (n.track({
                     type: 3 /* Metadata */ ,
                     doc: h
-                }), d = !0) : this.Qu(a, h) || (n.track({
+                }), d = !0) : this.Qu(c, h) || (n.track({
                     type: 2 /* Modified */ ,
                     doc: h
-                }), d = !0, (u && this.Lu(h, u) > 0 || c && this.Lu(h, c) < 0) && (
+                }), d = !0, (u && this.Lu(h, u) > 0 || a && this.Lu(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.
                 o = !0));
-            } else !a && h ? (n.track({
+            } else !c && h ? (n.track({
                 type: 0 /* Added */ ,
                 doc: h
-            }), d = !0) : a && !h && (n.track({
+            }), d = !0) : c && !h && (n.track({
                 type: 1 /* Removed */ ,
-                doc: a
-            }), d = !0, (u || c) && (
+                doc: c
+            }), d = !0, (u || 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.
@@ -14530,9 +14530,9 @@ class nc {
         // Diff the new limbo docs with the old limbo docs.
         const e = [];
         return t.forEach((t => {
-            this.Bu.has(t) || e.push(new nc(t));
+            this.Bu.has(t) || e.push(new na(t));
         })), this.Bu.forEach((n => {
-            t.has(n) || e.push(new ec(n));
+            t.has(n) || e.push(new ea(n));
         })), e;
     }
     /**
@@ -14575,7 +14575,7 @@ class nc {
  * QueryView contains all of the data that SyncEngine needs to keep track of for
  * a particular query.
  */
-class ic {
+class ia {
     constructor(
     /**
      * The query itself.
@@ -14597,7 +14597,7 @@ class ic {
     }
 }
 
-/** Tracks a limbo resolution. */ class rc {
+/** Tracks a limbo resolution. */ class ra {
     constructor(t) {
         this.key = t, 
         /**
@@ -14622,13 +14622,13 @@ class ic {
  * 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 oc {
+ */ class oa {
     constructor(t, e, n, 
     // PORTING NOTE: Manages state synchronization in multi-tab environments.
     s, i, r) {
         this.localStore = t, this.remoteStore = e, this.eventManager = n, this.sharedClientState = s, 
-        this.currentUser = i, this.maxConcurrentLimboResolutions = r, this.Zu = {}, this.tc = new is((t => _n(t)), dn), 
-        this.ec = new Map, 
+        this.currentUser = i, this.maxConcurrentLimboResolutions = r, this.Zu = {}, this.ta = new is((t => _n(t)), dn), 
+        this.ea = new Map, 
         /**
          * The keys of documents that are in limbo for which we haven't yet started a
          * limbo resolution query. The strings in this set are the result of calling
@@ -14638,28 +14638,28 @@ class ic {
          * of arbitrary elements and it also maintains insertion order, providing the
          * desired queue-like FIFO semantics.
          */
-        this.nc = new Set, 
+        this.na = new Set, 
         /**
          * Keeps track of the target ID for each document that is in limbo with an
          * active target.
          */
-        this.sc = new qt(dt.comparator), 
+        this.sa = new qt(dt.comparator), 
         /**
          * Keeps track of the information about an active limbo resolution for each
          * active target ID that was started for the purpose of limbo resolution.
          */
-        this.ic = new Map, this.rc = new io, 
+        this.ia = new Map, this.ra = new io, 
         /** Stores user completion handlers, indexed by User and BatchId. */
-        this.oc = {}, 
+        this.oa = {}, 
         /** Stores user callbacks waiting for all pending writes to be acknowledged. */
-        this.uc = new Map, this.cc = kr.Rn(), this.onlineState = "Unknown" /* Unknown */ , 
+        this.ua = new Map, this.aa = kr.Rn(), this.onlineState = "Unknown" /* Unknown */ , 
         // The primary state is set to `true` or `false` immediately after Firestore
         // startup. In the interim, a client should only be considered primary if
         // `isPrimary` is true.
-        this.ac = void 0;
+        this.ca = void 0;
     }
     get isPrimaryClient() {
-        return !0 === this.ac;
+        return !0 === this.ca;
     }
 }
 
@@ -14668,10 +14668,10 @@ class ic {
  * server. All the subsequent view snapshots or errors are sent to the
  * subscribed handlers. Returns the initial snapshot.
  */
-async function uc(t, e) {
-    const n = Mc(t);
+async function ua(t, e) {
+    const n = Ma(t);
     let s, i;
-    const r = n.tc.get(e);
+    const r = n.ta.get(e);
     if (r) 
     // PORTING NOTE: With Multi-Tab Web, it is possible that a query view
     // already exists when EventManager calls us for the first time. This
@@ -14683,7 +14683,7 @@ async function uc(t, e) {
         const t = await Co(n.localStore, ln(e));
         n.isPrimaryClient && fu(n.remoteStore, t);
         const r = n.sharedClientState.addLocalQueryTarget(t.targetId);
-        s = t.targetId, i = await cc(n, e, s, "current" === r);
+        s = t.targetId, i = await aa(n, e, s, "current" === r);
     }
     return i;
 }
@@ -14691,11 +14691,11 @@ async function uc(t, e) {
 /**
  * Registers a view for a previously unknown query and computes its initial
  * snapshot.
- */ async function cc(t, e, n, s) {
+ */ async function aa(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.
-    t.hc = (e, n, s) => async function(t, e, n, s) {
+    t.ha = (e, n, s) => async function(t, e, n, s) {
         let i = e.view.Ku(n);
         i.Oi && (
         // The query has a limit and some docs were removed, so we need
@@ -14705,19 +14705,19 @@ async function uc(t, e) {
         /* usePreviousResults= */ !1).then((({documents: t}) => e.view.Ku(t, i))));
         const r = s && s.targetChanges.get(e.targetId), o = e.view.applyChanges(i, 
         /* updateLimboDocuments= */ t.isPrimaryClient, r);
-        return Tc(t, e.targetId, o.zu), o.snapshot;
+        return Ta(t, e.targetId, o.zu), o.snapshot;
     }(t, e, n, s);
     const i = await No(t.localStore, e, 
-    /* usePreviousResults= */ !0), r = new sc(e, i.ji), o = r.Ku(i.documents), u = ps.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), c = r.applyChanges(o, 
+    /* usePreviousResults= */ !0), r = new sa(e, i.ji), o = r.Ku(i.documents), u = ps.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), a = r.applyChanges(o, 
     /* updateLimboDocuments= */ t.isPrimaryClient, u);
-    Tc(t, n, c.zu);
-    const a = new ic(e, n, r);
-    return t.tc.set(e, a), t.ec.has(n) ? t.ec.get(n).push(e) : t.ec.set(n, [ e ]), c.snapshot;
+    Ta(t, n, a.zu);
+    const c = new ia(e, n, r);
+    return t.ta.set(e, c), t.ea.has(n) ? t.ea.get(n).push(e) : t.ea.set(n, [ e ]), a.snapshot;
 }
 
-/** Stops listening to the query. */ async function ac(t, e) {
-    const n = K(t), s = n.tc.get(e), i = n.ec.get(s.targetId);
-    if (i.length > 1) return n.ec.set(s.targetId, i.filter((t => !dn(t, e)))), void n.tc.delete(e);
+/** Stops listening to the query. */ async function ca(t, e) {
+    const n = K(t), s = n.ta.get(e), i = n.ea.get(s.targetId);
+    if (i.length > 1) return n.ea.set(s.targetId, i.filter((t => !dn(t, e)))), void n.ta.delete(e);
     // No other queries are mapped to the target, clean up the query and the target.
         if (n.isPrimaryClient) {
         // We need to remove the local query target first to allow us to verify
@@ -14726,9 +14726,9 @@ async function uc(t, e) {
         n.sharedClientState.isActiveQueryTarget(s.targetId) || await xo(n.localStore, s.targetId, 
         /*keepPersistedTargetData=*/ !1).then((() => {
             n.sharedClientState.clearQueryState(s.targetId), du(n.remoteStore, s.targetId), 
-            pc(n, s.targetId);
+            pa(n, s.targetId);
         })).catch(bt);
-    } else pc(n, s.targetId), await xo(n.localStore, s.targetId, 
+    } else pa(n, s.targetId), await xo(n.localStore, s.targetId, 
     /*keepPersistedTargetData=*/ !0);
 }
 
@@ -14741,8 +14741,8 @@ async function uc(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 hc(t, e, n) {
-    const s = Fc(t);
+ */ async function ha(t, e, n) {
+    const s = Fa(t);
     try {
         const t = await function(t, e) {
             const n = K(t), s = ut.now(), i = e.reduce(((t, e) => t.add(e.key)), ws());
@@ -14754,10 +14754,10 @@ async function uc(t, e) {
                 // TODO(Overlay): Is there a better way to determine this? Using the
                 //  document version does not work because local mutations set them back
                 //  to 0.
-                let u = os(), c = ws();
+                let u = os(), a = ws();
                 return n.Ui.getEntries(t, i).next((t => {
                     u = t, u.forEach(((t, e) => {
-                        e.isValidDocument() || (c = c.add(t));
+                        e.isValidDocument() || (a = a.add(t));
                     }));
                 })).next((() => n.localDocuments.getOverlayedDocuments(t, u))).next((i => {
                     r = i;
@@ -14778,23 +14778,23 @@ async function uc(t, e) {
                     return n.mutationQueue.addMutationBatch(t, s, o, e);
                 })).next((e => {
                     o = e;
-                    const s = e.applyToLocalDocumentSet(r, c);
+                    const s = e.applyToLocalDocumentSet(r, a);
                     return n.documentOverlayCache.saveOverlays(t, e.batchId, s);
                 }));
             })).then((() => ({
                 batchId: o.batchId,
-                changes: as(r)
+                changes: cs(r)
             })));
         }(s.localStore, e);
         s.sharedClientState.addPendingMutation(t.batchId), function(t, e, n) {
-            let s = t.oc[t.currentUser.toKey()];
+            let s = t.oa[t.currentUser.toKey()];
             s || (s = new qt(it));
-            s = s.insert(e, n), t.oc[t.currentUser.toKey()] = s;
+            s = s.insert(e, n), t.oa[t.currentUser.toKey()] = s;
         }
         /**
  * Resolves or rejects the user callback for the given batch and then discards
  * it.
- */ (s, t.batchId, n), await Rc(s, t.changes), await bu(s.remoteStore);
+ */ (s, t.batchId, n), await Ra(s, t.changes), await bu(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.
@@ -14807,20 +14807,20 @@ async function uc(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 lc(t, e) {
+ */ async function la(t, e) {
     const n = K(t);
     try {
         const t = await Vo(n.localStore, e);
         // Update `receivedDocument` as appropriate for any limbo targets.
                 e.targetChanges.forEach(((t, e) => {
-            const s = n.ic.get(e);
+            const s = n.ia.get(e);
             s && (
             // Since this is a limbo resolution lookup, it's for a single document
             // and it could be added, modified, or removed, but not a combination.
             U(t.addedDocuments.size + t.modifiedDocuments.size + t.removedDocuments.size <= 1), 
             t.addedDocuments.size > 0 ? s.Xu = !0 : t.modifiedDocuments.size > 0 ? U(s.Xu) : t.removedDocuments.size > 0 && (U(s.Xu), 
             s.Xu = !1));
-        })), await Rc(n, t, e);
+        })), await Ra(n, t, e);
     } catch (t) {
         await bt(t);
     }
@@ -14829,7 +14829,7 @@ async function uc(t, e) {
 /**
  * Applies an OnlineState change to the sync engine and notifies any views of
  * the change.
- */ function fc(t, e, n) {
+ */ function fa(t, e, n) {
     const s = K(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
@@ -14837,7 +14837,7 @@ async function uc(t, e) {
     // SharedClientState.
         if (s.isPrimaryClient && 0 /* RemoteStore */ === n || !s.isPrimaryClient && 1 /* SharedClientState */ === n) {
         const t = [];
-        s.tc.forEach(((n, s) => {
+        s.ta.forEach(((n, s) => {
             const i = s.view.Eu(e);
             i.snapshot && t.push(i.snapshot);
         })), function(t, e) {
@@ -14863,11 +14863,11 @@ async function uc(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 dc(t, e, n) {
+ */ async function da(t, e, n) {
     const s = K(t);
     // PORTING NOTE: Multi-tab only.
         s.sharedClientState.updateQueryState(e, "rejected", n);
-    const i = s.ic.get(e), r = i && i.key;
+    const i = s.ia.get(e), r = i && i.key;
     if (r) {
         // TODO(klimt): We really only should do the following on permission
         // denied errors, but we don't have the cause code here.
@@ -14879,22 +14879,22 @@ async function uc(t, e) {
         // TODO(b/217189216): This limbo document should ideally have a read time,
         // so that it is picked up by any read-time based scans. The backend,
         // however, does not send a read time for target removals.
-                t = t.insert(r, xe.newNoDocument(r, ct.min()));
-        const n = ws().add(r), i = new ys(ct.min(), 
+                t = t.insert(r, xe.newNoDocument(r, at.min()));
+        const n = ws().add(r), i = new ys(at.min(), 
         /* targetChanges= */ new Map, 
         /* targetMismatches= */ new Qt(it), t, n);
-        await lc(s, i), 
+        await la(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.sc = s.sc.remove(r), s.ic.delete(e), Ac(s);
+        s.sa = s.sa.remove(r), s.ia.delete(e), Aa(s);
     } else await xo(s.localStore, e, 
-    /* keepPersistedTargetData */ !1).then((() => pc(s, e, n))).catch(bt);
+    /* keepPersistedTargetData */ !1).then((() => pa(s, e, n))).catch(bt);
 }
 
-async function _c(t, e) {
+async function _a(t, e) {
     const n = K(t), s = e.batch.batchId;
     try {
         const t = await Po(n.localStore, e);
@@ -14902,14 +14902,14 @@ async function _c(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.
-                yc(n, s, /*error=*/ null), gc(n, s), n.sharedClientState.updateMutationState(s, "acknowledged"), 
-        await Rc(n, t);
+                ya(n, s, /*error=*/ null), ga(n, s), n.sharedClientState.updateMutationState(s, "acknowledged"), 
+        await Ra(n, t);
     } catch (t) {
         await bt(t);
     }
 }
 
-async function wc(t, e, n) {
+async function wa(t, e, n) {
     const s = K(t);
     try {
         const t = await function(t, e) {
@@ -14930,8 +14930,8 @@ async function wc(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.
-                yc(s, e, n), gc(s, e), s.sharedClientState.updateMutationState(e, "rejected", n), 
-        await Rc(s, t);
+                ya(s, e, n), ga(s, e), s.sharedClientState.updateMutationState(e, "rejected", n), 
+        await Ra(s, t);
     } catch (n) {
         await bt(n);
     }
@@ -14940,7 +14940,7 @@ async function wc(t, e, n) {
 /**
  * Registers a user callback that resolves when all pending mutations at the moment of calling
  * are acknowledged .
- */ async function mc(t, e) {
+ */ async function ma(t, e) {
     const n = K(t);
     yu(n.remoteStore) || M("SyncEngine", "The network is disabled. The task returned by 'awaitPendingWrites()' will not complete until the network is enabled.");
     try {
@@ -14951,8 +14951,8 @@ async function wc(t, e, n) {
         if (-1 === t) 
         // Trigger the callback right away if there is no pending writes at the moment.
         return void e.resolve();
-        const s = n.uc.get(t) || [];
-        s.push(e), n.uc.set(t, s);
+        const s = n.ua.get(t) || [];
+        s.push(e), n.ua.set(t, s);
     } catch (t) {
         const n = Bu(t, "Initialization of waitForPendingWrites() operation failed");
         e.reject(n);
@@ -14962,56 +14962,56 @@ async function wc(t, e, n) {
 /**
  * Triggers the callbacks that are waiting for this batch id to get acknowledged by server,
  * if there are any.
- */ function gc(t, e) {
-    (t.uc.get(e) || []).forEach((t => {
+ */ function ga(t, e) {
+    (t.ua.get(e) || []).forEach((t => {
         t.resolve();
-    })), t.uc.delete(e);
+    })), t.ua.delete(e);
 }
 
-/** Reject all outstanding callbacks waiting for pending writes to complete. */ function yc(t, e, n) {
+/** Reject all outstanding callbacks waiting for pending writes to complete. */ function ya(t, e, n) {
     const s = K(t);
-    let i = s.oc[s.currentUser.toKey()];
+    let i = s.oa[s.currentUser.toKey()];
     // NOTE: Mutations restored from persistence won't have callbacks, so it's
     // okay for there to be no callback for this ID.
         if (i) {
         const t = i.get(e);
-        t && (n ? t.reject(n) : t.resolve(), i = i.remove(e)), s.oc[s.currentUser.toKey()] = i;
+        t && (n ? t.reject(n) : t.resolve(), i = i.remove(e)), s.oa[s.currentUser.toKey()] = i;
     }
 }
 
-function pc(t, e, n = null) {
+function pa(t, e, n = null) {
     t.sharedClientState.removeLocalQueryTarget(e);
-    for (const s of t.ec.get(e)) t.tc.delete(s), n && t.Zu.lc(s, n);
-    if (t.ec.delete(e), t.isPrimaryClient) {
-        t.rc.us(e).forEach((e => {
-            t.rc.containsKey(e) || 
+    for (const s of t.ea.get(e)) t.ta.delete(s), n && t.Zu.la(s, n);
+    if (t.ea.delete(e), t.isPrimaryClient) {
+        t.ra.us(e).forEach((e => {
+            t.ra.containsKey(e) || 
             // We removed the last reference for this key
-            Ic(t, e);
+            Ia(t, e);
         }));
     }
 }
 
-function Ic(t, e) {
-    t.nc.delete(e.path.canonicalString());
+function Ia(t, e) {
+    t.na.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.sc.get(e);
-    null !== n && (du(t.remoteStore, n), t.sc = t.sc.remove(e), t.ic.delete(n), Ac(t));
+    const n = t.sa.get(e);
+    null !== n && (du(t.remoteStore, n), t.sa = t.sa.remove(e), t.ia.delete(n), Aa(t));
 }
 
-function Tc(t, e, n) {
-    for (const s of n) if (s instanceof ec) t.rc.addReference(s.key, e), Ec(t, s); else if (s instanceof nc) {
-        M("SyncEngine", "Document no longer in limbo: " + s.key), t.rc.removeReference(s.key, e);
-        t.rc.containsKey(s.key) || 
+function Ta(t, e, n) {
+    for (const s of n) if (s instanceof ea) t.ra.addReference(s.key, e), Ea(t, s); else if (s instanceof na) {
+        M("SyncEngine", "Document no longer in limbo: " + s.key), t.ra.removeReference(s.key, e);
+        t.ra.containsKey(s.key) || 
         // We removed the last reference for this key
-        Ic(t, s.key);
+        Ia(t, s.key);
     } else L();
 }
 
-function Ec(t, e) {
+function Ea(t, e) {
     const n = e.key, s = n.path.canonicalString();
-    t.sc.get(n) || t.nc.has(s) || (M("SyncEngine", "New document in limbo: " + n), t.nc.add(s), 
-    Ac(t));
+    t.sa.get(n) || t.na.has(s) || (M("SyncEngine", "New document in limbo: " + n), t.na.add(s), 
+    Aa(t));
 }
 
 /**
@@ -15021,19 +15021,19 @@ function Ec(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 Ac(t) {
-    for (;t.nc.size > 0 && t.sc.size < t.maxConcurrentLimboResolutions; ) {
-        const e = t.nc.values().next().value;
-        t.nc.delete(e);
-        const n = new dt(ht.fromString(e)), s = t.cc.next();
-        t.ic.set(s, new rc(n)), t.sc = t.sc.insert(n, s), fu(t.remoteStore, new Li(ln(rn(n.path)), s, 2 /* LimboResolution */ , $t.ot));
+ */ function Aa(t) {
+    for (;t.na.size > 0 && t.sa.size < t.maxConcurrentLimboResolutions; ) {
+        const e = t.na.values().next().value;
+        t.na.delete(e);
+        const n = new dt(ht.fromString(e)), s = t.aa.next();
+        t.ia.set(s, new ra(n)), t.sa = t.sa.insert(n, s), fu(t.remoteStore, new Li(ln(rn(n.path)), s, 2 /* LimboResolution */ , $t.ot));
     }
 }
 
-async function Rc(t, e, n) {
+async function Ra(t, e, n) {
     const s = K(t), i = [], r = [], o = [];
-    s.tc.isEmpty() || (s.tc.forEach(((t, u) => {
-        o.push(s.hc(u, e, n).then((t => {
+    s.ta.isEmpty() || (s.ta.forEach(((t, u) => {
+        o.push(s.ha(u, e, n).then((t => {
             if (t) {
                 s.isPrimaryClient && s.sharedClientState.updateQueryState(u.targetId, t.fromCache ? "not-current" : "current"), 
                 i.push(t);
@@ -15064,7 +15064,7 @@ async function Rc(t, e, n) {
     }(s.localStore, r));
 }
 
-async function bc(t, e) {
+async function ba(t, e) {
     const n = K(t);
     if (!n.currentUser.isEqual(e)) {
         M("SyncEngine", "User change. New user:", e.toKey());
@@ -15072,26 +15072,26 @@ async function bc(t, e) {
         n.currentUser = e, 
         // Fails tasks waiting for pending writes requested by previous user.
         function(t, e) {
-            t.uc.forEach((t => {
+            t.ua.forEach((t => {
                 t.forEach((t => {
                     t.reject(new Q(G.CANCELLED, e));
                 }));
-            })), t.uc.clear();
+            })), t.ua.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 Rc(n, t.Ki);
+        n.sharedClientState.handleUserChange(e, t.removedBatchIds, t.addedBatchIds), await Ra(n, t.Ki);
     }
 }
 
-function Pc(t, e) {
-    const n = K(t), s = n.ic.get(e);
+function Pa(t, e) {
+    const n = K(t), s = n.ia.get(e);
     if (s && s.Xu) return ws().add(s.key);
     {
         let t = ws();
-        const s = n.ec.get(e);
+        const s = n.ea.get(e);
         if (!s) return t;
         for (const e of s) {
-            const s = n.tc.get(e);
+            const s = n.ta.get(e);
             t = t.unionWith(s.view.qu);
         }
         return t;
@@ -15101,10 +15101,10 @@ function Pc(t, e) {
 /**
  * Reconcile the list of synced documents in an existing view with those
  * from persistence.
- */ async function vc(t, e) {
+ */ async function va(t, e) {
     const n = K(t), s = await No(n.localStore, e.query, 
     /* usePreviousResults= */ !0), i = e.view.Ju(s);
-    return n.isPrimaryClient && Tc(n, e.targetId, i.zu), i;
+    return n.isPrimaryClient && Ta(n, e.targetId, i.zu), i;
 }
 
 /**
@@ -15112,14 +15112,14 @@ function Pc(t, e) {
  * snapshots if needed.
  */
 // PORTING NOTE: Multi-Tab only.
-async function Vc(t, e) {
+async function Va(t, e) {
     const n = K(t);
-    return Oo(n.localStore, e).then((t => Rc(n, t)));
+    return Oo(n.localStore, e).then((t => Ra(n, t)));
 }
 
 /** Applies a mutation state to an existing batch.  */
 // PORTING NOTE: Multi-Tab only.
-async function Sc(t, e, n, s) {
+async function Sa(t, e, n, s) {
     const i = K(t), r = await function(t, e) {
         const n = K(t), s = K(n.mutationQueue);
         return n.persistence.runTransaction("Lookup mutation documents", "readonly", (t => s.yn(t, e).next((e => e ? n.localDocuments.getDocuments(t, e) : Pt.resolve(null)))));
@@ -15133,11 +15133,11 @@ async function Sc(t, e, n, s) {
     await bu(i.remoteStore) : "acknowledged" === n || "rejected" === n ? (
     // NOTE: Both these methods are no-ops for batches that originated from
     // other clients.
-    yc(i, e, s || null), gc(i, e), function(t, e) {
+    ya(i, e, s || null), ga(i, e), function(t, e) {
         K(K(t).mutationQueue).In(e);
     }
     // PORTING NOTE: Multi-Tab only.
-    (i.localStore, e)) : L(), await Rc(i, r)) : 
+    (i.localStore, e)) : L(), await Ra(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
@@ -15150,32 +15150,32 @@ async function Sc(t, e, n, s) {
 
 /** Applies a query target change from a different tab. */
 // PORTING NOTE: Multi-Tab only.
-async function Dc(t, e) {
+async function Da(t, e) {
     const n = K(t);
-    if (Mc(n), Fc(n), !0 === e && !0 !== n.ac) {
+    if (Ma(n), Fa(n), !0 === e && !0 !== n.ca) {
         // 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 Cc(n, t.toArray());
-        n.ac = !0, await Ou(n.remoteStore, !0);
+        const t = n.sharedClientState.getAllActiveQueryTargets(), e = await Ca(n, t.toArray());
+        n.ca = !0, await Ou(n.remoteStore, !0);
         for (const t of e) fu(n.remoteStore, t);
-    } else if (!1 === e && !1 !== n.ac) {
+    } else if (!1 === e && !1 !== n.ca) {
         const t = [];
         let e = Promise.resolve();
-        n.ec.forEach(((s, i) => {
-            n.sharedClientState.isLocalQueryTarget(i) ? t.push(i) : e = e.then((() => (pc(n, i), 
+        n.ea.forEach(((s, i) => {
+            n.sharedClientState.isLocalQueryTarget(i) ? t.push(i) : e = e.then((() => (pa(n, i), 
             xo(n.localStore, i, 
             /*keepPersistedTargetData=*/ !0)))), du(n.remoteStore, i);
-        })), await e, await Cc(n, t), 
+        })), await e, await Ca(n, t), 
         // PORTING NOTE: Multi-Tab only.
         function(t) {
             const e = K(t);
-            e.ic.forEach(((t, n) => {
+            e.ia.forEach(((t, n) => {
                 du(e.remoteStore, n);
-            })), e.rc.cs(), e.ic = new Map, e.sc = new qt(dt.comparator);
+            })), e.ra.cs(), e.ia = new Map, e.sa = new qt(dt.comparator);
         }
         /**
  * Reconcile the query views of the provided query targets with the state from
@@ -15188,15 +15188,15 @@ async function Dc(t, e) {
  * tab to a primary tab
  */
         // PORTING NOTE: Multi-Tab only.
-        (n), n.ac = !1, await Ou(n.remoteStore, !1);
+        (n), n.ca = !1, await Ou(n.remoteStore, !1);
     }
 }
 
-async function Cc(t, e, n) {
+async function Ca(t, e, n) {
     const s = K(t), i = [], r = [];
     for (const t of e) {
         let e;
-        const n = s.ec.get(t);
+        const n = s.ea.get(t);
         if (n && 0 !== n.length) {
             // For queries that have a local View, we fetch their current state
             // from LocalStore (as the resume token and the snapshot version
@@ -15204,14 +15204,14 @@ async function Cc(t, e, n) {
             // state (the list of syncedDocuments may have gotten out of sync).
             e = await Co(s.localStore, ln(n[0]));
             for (const t of n) {
-                const e = s.tc.get(t), n = await vc(s, e);
+                const e = s.ta.get(t), n = await va(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 ko(s.localStore, t);
-            e = await Co(s.localStore, n), await cc(s, xc(n), t, 
+            e = await Co(s.localStore, n), await aa(s, xa(n), t, 
             /*current=*/ !1);
         }
         i.push(e);
@@ -15230,38 +15230,38 @@ async function Cc(t, e, n) {
  * difference will not cause issues.
  */
 // PORTING NOTE: Multi-Tab only.
-function xc(t) {
+function xa(t) {
     return sn(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 Nc(t) {
+function Na(t) {
     const e = K(t);
     return K(K(e.localStore).persistence).Ri();
 }
 
 /** Applies a query target change from a different tab. */
 // PORTING NOTE: Multi-Tab only.
-async function kc(t, e, n, s) {
+async function ka(t, e, n, s) {
     const i = K(t);
-    if (i.ac) 
+    if (i.ca) 
     // If we receive a target state notification via WebStorage, we are
     // either already secondary or another tab has taken the primary lease.
     return void M("SyncEngine", "Ignoring unexpected query state notification.");
-    const r = i.ec.get(e);
+    const r = i.ea.get(e);
     if (r && r.length > 0) switch (n) {
       case "current":
       case "not-current":
         {
             const t = await Oo(i.localStore, gn(r[0])), s = ys.createSynthesizedRemoteEventForCurrentChange(e, "current" === n);
-            await Rc(i, t, s);
+            await Ra(i, t, s);
             break;
         }
 
       case "rejected":
         await xo(i.localStore, e, 
-        /* keepPersistedTargetData */ !0), pc(i, e, s);
+        /* keepPersistedTargetData */ !0), pa(i, e, s);
         break;
 
       default:
@@ -15269,41 +15269,41 @@ async function kc(t, e, n, s) {
     }
 }
 
-/** Adds or removes Watch targets for queries from different tabs. */ async function Oc(t, e, n) {
-    const s = Mc(t);
-    if (s.ac) {
+/** Adds or removes Watch targets for queries from different tabs. */ async function Oa(t, e, n) {
+    const s = Ma(t);
+    if (s.ca) {
         for (const t of e) {
-            if (s.ec.has(t)) {
+            if (s.ea.has(t)) {
                 // A target might have been added in a previous attempt
                 M("SyncEngine", "Adding an already active target " + t);
                 continue;
             }
             const e = await ko(s.localStore, t), n = await Co(s.localStore, e);
-            await cc(s, xc(e), n.targetId, 
+            await aa(s, xa(e), n.targetId, 
             /*current=*/ !1), fu(s.remoteStore, n);
         }
         for (const t of n) 
         // Check that the target is still active since the target might have been
         // removed if it has been rejected by the backend.
-        s.ec.has(t) && 
+        s.ea.has(t) && 
         // Release queries that are still active.
         await xo(s.localStore, t, 
         /* keepPersistedTargetData */ !1).then((() => {
-            du(s.remoteStore, t), pc(s, t);
+            du(s.remoteStore, t), pa(s, t);
         })).catch(bt);
     }
 }
 
-function Mc(t) {
+function Ma(t) {
     const e = K(t);
-    return e.remoteStore.remoteSyncer.applyRemoteEvent = lc.bind(null, e), e.remoteStore.remoteSyncer.getRemoteKeysForTarget = Pc.bind(null, e), 
-    e.remoteStore.remoteSyncer.rejectListen = dc.bind(null, e), e.Zu.Go = Wu.bind(null, e.eventManager), 
-    e.Zu.lc = zu.bind(null, e.eventManager), e;
+    return e.remoteStore.remoteSyncer.applyRemoteEvent = la.bind(null, e), e.remoteStore.remoteSyncer.getRemoteKeysForTarget = Pa.bind(null, e), 
+    e.remoteStore.remoteSyncer.rejectListen = da.bind(null, e), e.Zu.Go = Wu.bind(null, e.eventManager), 
+    e.Zu.la = zu.bind(null, e.eventManager), e;
 }
 
-function Fc(t) {
+function Fa(t) {
     const e = K(t);
-    return e.remoteStore.remoteSyncer.applySuccessfulWrite = _c.bind(null, e), e.remoteStore.remoteSyncer.rejectFailedWrite = wc.bind(null, e), 
+    return e.remoteStore.remoteSyncer.applySuccessfulWrite = _a.bind(null, e), e.remoteStore.remoteSyncer.rejectFailedWrite = wa.bind(null, e), 
     e;
 }
 
@@ -15314,7 +15314,7 @@ function Fc(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 $c(t, e, n) {
+ */ function $a(t, e, n) {
     const s = K(t);
     // eslint-disable-next-line @typescript-eslint/no-floating-promises
         (
@@ -15337,15 +15337,15 @@ function Fc(t) {
                     totalBytes: t.totalBytes
                 };
             }(s)), Promise.resolve(new Set);
-            n._updateProgress(tc(s));
+            n._updateProgress(ta(s));
             const i = new Zu(s, t.localStore, e.wt);
-            let r = await e.fc();
+            let r = await e.fa();
             for (;r; ) {
                 const t = await i.Nu(r);
-                t && n._updateProgress(t), r = await e.fc();
+                t && n._updateProgress(t), r = await e.fa();
             }
             const o = await i.complete();
-            return await Rc(t, o.Mu, 
+            return await Ra(t, o.Mu, 
             /* remoteEvent */ void 0), 
             // Save metadata, so loading the same bundle will skip.
             await function(t, e) {
@@ -15384,28 +15384,28 @@ function Fc(t) {
     }));
 }
 
-class Bc {
+class Ba {
     constructor() {
         this.synchronizeTabs = !1;
     }
     async initialize(t) {
-        this.wt = nu(t.databaseInfo.databaseId), this.sharedClientState = this.dc(t), this.persistence = this._c(t), 
-        await this.persistence.start(), this.localStore = this.wc(t), this.gcScheduler = this.mc(t, this.localStore), 
-        this.indexBackfillerScheduler = this.gc(t, this.localStore);
+        this.wt = nu(t.databaseInfo.databaseId), this.sharedClientState = this.da(t), this.persistence = this._a(t), 
+        await this.persistence.start(), this.localStore = this.wa(t), this.gcScheduler = this.ma(t, this.localStore), 
+        this.indexBackfillerScheduler = this.ga(t, this.localStore);
     }
-    mc(t, e) {
+    ma(t, e) {
         return null;
     }
-    gc(t, e) {
+    ga(t, e) {
         return null;
     }
-    wc(t) {
+    wa(t) {
         return Ro(this.persistence, new Eo, t.initialUser, this.wt);
     }
-    _c(t) {
+    _a(t) {
         return new ho(fo.Ms, this.wt);
     }
-    dc(t) {
+    da(t) {
         return new zo;
     }
     async terminate() {
@@ -15416,36 +15416,36 @@ class Bc {
 
 /**
  * Provides all components needed for Firestore with IndexedDB persistence.
- */ class Lc extends Bc {
+ */ class La extends Ba {
     constructor(t, e, n) {
-        super(), this.yc = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;
+        super(), this.ya = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;
     }
     async initialize(t) {
-        await super.initialize(t), await this.yc.initialize(this, t), 
+        await super.initialize(t), await this.ya.initialize(this, t), 
         // Enqueue writes from a previous session
-        await Fc(this.yc.syncEngine), await bu(this.yc.remoteStore), 
+        await Fa(this.ya.syncEngine), await bu(this.ya.remoteStore), 
         // NOTE: This will immediately call the listener, so we make sure to
         // set it after localStore / remoteStore are started.
-        await this.persistence.ci((() => (this.gcScheduler && !this.gcScheduler.started && this.gcScheduler.start(), 
+        await this.persistence.ai((() => (this.gcScheduler && !this.gcScheduler.started && this.gcScheduler.start(), 
         this.indexBackfillerScheduler && !this.indexBackfillerScheduler.started && this.indexBackfillerScheduler.start(), 
         Promise.resolve())));
     }
-    wc(t) {
+    wa(t) {
         return Ro(this.persistence, new Eo, t.initialUser, this.wt);
     }
-    mc(t, e) {
+    ma(t, e) {
         const n = this.persistence.referenceDelegate.garbageCollector;
         return new Ur(n, t.asyncQueue, e);
     }
-    gc(t, e) {
+    ga(t, e) {
         const n = new Ft(e, this.persistence);
         return new Mt(t.asyncQueue, n);
     }
-    _c(t) {
+    _a(t) {
         const e = Io(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey), n = void 0 !== this.cacheSizeBytes ? Pr.withCacheSize(this.cacheSizeBytes) : Pr.DEFAULT;
         return new go(this.synchronizeTabs, e, t.clientId, n, t.asyncQueue, tu(), eu(), this.wt, this.sharedClientState, !!this.forceOwnership);
     }
-    dc(t) {
+    da(t) {
         return new zo;
     }
 }
@@ -15457,28 +15457,28 @@ class Bc {
  * 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 Uc extends Lc {
+ */ class Ua extends La {
     constructor(t, e) {
-        super(t, e, /* forceOwnership= */ !1), this.yc = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;
+        super(t, e, /* forceOwnership= */ !1), this.ya = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;
     }
     async initialize(t) {
         await super.initialize(t);
-        const e = this.yc.syncEngine;
+        const e = this.ya.syncEngine;
         this.sharedClientState instanceof Wo && (this.sharedClientState.syncEngine = {
-            kr: Sc.bind(null, e),
-            Or: kc.bind(null, e),
-            Mr: Oc.bind(null, e),
-            Ri: Nc.bind(null, e),
-            Nr: Vc.bind(null, e)
+            kr: Sa.bind(null, e),
+            Or: ka.bind(null, e),
+            Mr: Oa.bind(null, e),
+            Ri: Na.bind(null, e),
+            Nr: Va.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.ci((async t => {
-            await Dc(this.yc.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start() : t || this.gcScheduler.stop()), 
+        await this.persistence.ai((async t => {
+            await Da(this.ya.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start() : t || this.gcScheduler.stop()), 
             this.indexBackfillerScheduler && (t && !this.indexBackfillerScheduler.started ? this.indexBackfillerScheduler.start() : t || this.indexBackfillerScheduler.stop());
         }));
     }
-    dc(t) {
+    da(t) {
         const e = tu();
         if (!Wo.V(e)) throw new Q(G.UNIMPLEMENTED, "IndexedDB persistence is only available on platforms that support LocalStorage.");
         const n = Io(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey);
@@ -15489,13 +15489,13 @@ class Bc {
 /**
  * Initializes and wires the components that are needed to interface with the
  * network.
- */ class qc {
+ */ class qa {
     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 => fc(this.syncEngine, t, 1 /* SharedClientState */), 
-        this.remoteStore.remoteSyncer.handleCredentialChange = bc.bind(null, this.syncEngine), 
+        /* startAsPrimary=*/ !t.synchronizeTabs), this.sharedClientState.onlineStateHandler = t => fa(this.syncEngine, t, 1 /* SharedClientState */), 
+        this.remoteStore.remoteSyncer.handleCredentialChange = ba.bind(null, this.syncEngine), 
         await Ou(this.remoteStore, this.syncEngine.isPrimaryClient));
     }
     createEventManager(t) {
@@ -15509,16 +15509,16 @@ class Bc {
         }(t.authCredentials, t.appCheckCredentials, n, e);
     }
     createRemoteStore(t) {
-        return e = this.localStore, n = this.datastore, s = t.asyncQueue, i = t => fc(this.syncEngine, t, 0 /* RemoteStore */), 
-        r = Jo.V() ? new Jo : new Ho, new au(e, n, s, i, r);
+        return e = this.localStore, n = this.datastore, s = t.asyncQueue, i = t => fa(this.syncEngine, t, 0 /* RemoteStore */), 
+        r = Jo.V() ? new Jo : new Ho, new cu(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 u = new oc(t, e, n, s, i, r);
-            return o && (u.ac = !0), u;
+            const u = new oa(t, e, n, s, i, r);
+            return o && (u.ca = !0), u;
         }(this.localStore, this.remoteStore, this.eventManager, this.sharedClientState, t.initialUser, t.maxConcurrentLimboResolutions, e);
     }
     terminate() {
@@ -15560,7 +15560,7 @@ class Bc {
  * @param bytesPerRead - How many bytes each `read()` from the returned reader
  *        will read.
  */
-function Kc(t, e = 10240) {
+function Ka(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.
@@ -15626,7 +15626,7 @@ function Kc(t, e = 10240) {
  * asynchronously. To allow immediate silencing, a mute call is added which
  * causes events scheduled to no longer be raised.
  */
-class Gc {
+class Ga {
     constructor(t) {
         this.observer = t, 
         /**
@@ -15636,15 +15636,15 @@ class Gc {
         this.muted = !1;
     }
     next(t) {
-        this.observer.next && this.Ic(this.observer.next, t);
+        this.observer.next && this.pa(this.observer.next, t);
     }
     error(t) {
-        this.observer.error ? this.Ic(this.observer.error, t) : console.error("Uncaught Error in snapshot listener:", t);
+        this.observer.error ? this.pa(this.observer.error, t) : console.error("Uncaught Error in snapshot listener:", t);
     }
-    Tc() {
+    Ia() {
         this.muted = !0;
     }
-    Ic(t, e) {
+    pa(t, e) {
         this.muted || setTimeout((() => {
             this.muted || t(e);
         }), 0);
@@ -15672,32 +15672,32 @@ class Gc {
  *
  * Takes a bundle stream or buffer, and presents abstractions to read bundled
  * elements out of the underlying content.
- */ class Qc {
+ */ class Qa {
     constructor(
     /** The reader to read from underlying binary bundle data source. */
     t, e) {
-        this.Ec = t, this.wt = e, 
+        this.Ta = t, this.wt = e, 
         /** Cached bundle metadata. */
         this.metadata = new j, 
         /**
          * Internal buffer to hold bundle content, accumulating incomplete element
          * content.
          */
-        this.buffer = new Uint8Array, this.Ac = new TextDecoder("utf-8"), 
+        this.buffer = new Uint8Array, this.Ea = new TextDecoder("utf-8"), 
         // Read the metadata (which is the first element).
-        this.Rc().then((t => {
+        this.Aa().then((t => {
             t && t.Cu() ? 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.Ec.cancel();
+        return this.Ta.cancel();
     }
     async getMetadata() {
         return this.metadata.promise;
     }
-    async fc() {
+    async fa() {
         // Makes sure metadata is read before proceeding.
-        return await this.getMetadata(), this.Rc();
+        return await this.getMetadata(), this.Aa();
     }
     /**
      * Reads from the head of internal buffer, and pulling more data from
@@ -15708,15 +15708,15 @@ class Gc {
      *
      * Returns either the bundled element, or null if we have reached the end of
      * the stream.
-     */    async Rc() {
-        const t = await this.bc();
+     */    async Aa() {
+        const t = await this.Ra();
         if (null === t) return null;
-        const e = this.Ac.decode(t), n = Number(e);
-        isNaN(n) && this.Pc(`length string (${e}) is not valid number`);
-        const s = await this.vc(n);
+        const e = this.Ea.decode(t), n = Number(e);
+        isNaN(n) && this.ba(`length string (${e}) is not valid number`);
+        const s = await this.Pa(n);
         return new Yu(JSON.parse(s), t.length + n);
     }
-    /** First index of '{' from the underlying buffer. */    Vc() {
+    /** First index of '{' from the underlying buffer. */    va() {
         return this.buffer.findIndex((t => t === "{".charCodeAt(0)));
     }
     /**
@@ -15724,17 +15724,17 @@ class Gc {
      * return the content.
      *
      * If reached end of the stream, returns a null.
-     */    async bc() {
-        for (;this.Vc() < 0; ) {
-            if (await this.Sc()) break;
+     */    async Ra() {
+        for (;this.va() < 0; ) {
+            if (await this.Va()) 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.Vc();
+        const t = this.va();
         // Broke out of the loop because underlying stream is closed, but still
         // cannot find an open bracket.
-                t < 0 && this.Pc("Reached the end of bundle when a length string is expected.");
+                t < 0 && this.ba("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;
@@ -15744,23 +15744,23 @@ class Gc {
      * number of bytes, pulling more data from the underlying stream if needed.
      *
      * Returns a string decoded from the read bytes.
-     */    async vc(t) {
+     */    async Pa(t) {
         for (;this.buffer.length < t; ) {
-            await this.Sc() && this.Pc("Reached the end of bundle when more is expected.");
+            await this.Va() && this.ba("Reached the end of bundle when more is expected.");
         }
-        const e = this.Ac.decode(this.buffer.slice(0, t));
+        const e = this.Ea.decode(this.buffer.slice(0, t));
         // Update the internal buffer to drop the read json string.
                 return this.buffer = this.buffer.slice(t), e;
     }
-    Pc(t) {
+    ba(t) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        throw this.Ec.cancel(), new Error(`Invalid bundle format: ${t}`);
+        throw this.Ta.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 Sc() {
-        const t = await this.Ec.read();
+     */    async Va() {
+        const t = await this.Ta.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;
@@ -15789,7 +15789,7 @@ class Gc {
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
  */
-class jc {
+class ja {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -15812,7 +15812,7 @@ class jc {
         const e = await async function(t, e) {
             const n = K(t), s = Ls(n.wt) + "/documents", i = {
                 documents: e.map((t => Ms(n.wt, t)))
-            }, r = await n.ao("BatchGetDocuments", s, i, e.length), o = new Map;
+            }, r = await n.co("BatchGetDocuments", s, i, e.length), o = new Map;
             r.forEach((t => {
                 const e = Gs(n.wt, t);
                 o.set(e.key.toString(), e);
@@ -15863,7 +15863,7 @@ class jc {
         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) {
@@ -15886,7 +15886,7 @@ class jc {
         // 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
@@ -15929,29 +15929,29 @@ class jc {
 /**
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
- */ class Wc {
+ */ class Wa {
     constructor(t, e, n, s, i) {
         this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = s, 
-        this.deferred = i, this.Dc = n.maxAttempts, this.So = new su(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.deferred = i, this.Sa = n.maxAttempts, this.So = new su(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
-        this.Dc -= 1, this.Cc();
+        this.Sa -= 1, this.Da();
     }
-    Cc() {
+    Da() {
         this.So.Io((async () => {
-            const t = new jc(this.datastore), e = this.xc(t);
+            const t = new ja(this.datastore), e = this.Ca(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
                 })).catch((t => {
-                    this.Nc(t);
+                    this.xa(t);
                 }))));
             })).catch((t => {
-                this.Nc(t);
+                this.xa(t);
             }));
         }));
     }
-    xc(t) {
+    Ca(t) {
         try {
             const e = this.updateFunction(t);
             return !oe(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
@@ -15961,11 +15961,11 @@ class jc {
             return this.deferred.reject(t), null;
         }
     }
-    Nc(t) {
-        this.Dc > 0 && this.kc(t) ? (this.Dc -= 1, this.asyncQueue.enqueueAndForget((() => (this.Cc(), 
+    xa(t) {
+        this.Sa > 0 && this.Na(t) ? (this.Sa -= 1, this.asyncQueue.enqueueAndForget((() => (this.Da(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
-    kc(t) {
+    Na(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.
@@ -15997,7 +15997,7 @@ class jc {
  * 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 zc {
+class za {
     constructor(t, e, 
     /**
      * Asynchronous queue responsible for all of our internal processing. When
@@ -16057,7 +16057,7 @@ class zc {
     }
 }
 
-async function Hc(t, e) {
+async function Ha(t, e) {
     t.asyncQueue.verifyOperationInProgress(), M("FirestoreClient", "Initializing OfflineComponentProvider");
     const n = await t.getConfiguration();
     await e.initialize(n);
@@ -16070,9 +16070,9 @@ async function Hc(t, e) {
     e.persistence.setDatabaseDeletedListener((() => t.terminate())), t.offlineComponents = e;
 }
 
-async function Jc(t, e) {
+async function Ja(t, e) {
     t.asyncQueue.verifyOperationInProgress();
-    const n = await Yc(t);
+    const n = await Ya(t);
     M("FirestoreClient", "Initializing OnlineComponentProvider");
     const s = await t.getConfiguration();
     await e.initialize(n, s), 
@@ -16082,41 +16082,41 @@ async function Jc(t, e) {
     t.onlineComponents = e;
 }
 
-async function Yc(t) {
+async function Ya(t) {
     return t.offlineComponents || (M("FirestoreClient", "Using default OfflineComponentProvider"), 
-    await Hc(t, new Bc)), t.offlineComponents;
+    await Ha(t, new Ba)), t.offlineComponents;
 }
 
-async function Xc(t) {
+async function Xa(t) {
     return t.onlineComponents || (M("FirestoreClient", "Using default OnlineComponentProvider"), 
-    await Jc(t, new qc)), t.onlineComponents;
+    await Ja(t, new qa)), t.onlineComponents;
 }
 
-function Zc(t) {
-    return Yc(t).then((t => t.persistence));
+function Za(t) {
+    return Ya(t).then((t => t.persistence));
 }
 
-function ta(t) {
-    return Yc(t).then((t => t.localStore));
+function tc(t) {
+    return Ya(t).then((t => t.localStore));
 }
 
-function ea(t) {
-    return Xc(t).then((t => t.remoteStore));
+function ec(t) {
+    return Xa(t).then((t => t.remoteStore));
 }
 
-function na(t) {
-    return Xc(t).then((t => t.syncEngine));
+function nc(t) {
+    return Xa(t).then((t => t.syncEngine));
 }
 
-async function sa(t) {
-    const e = await Xc(t), n = e.eventManager;
-    return n.onListen = uc.bind(null, e.syncEngine), n.onUnlisten = ac.bind(null, e.syncEngine), 
+async function sc(t) {
+    const e = await Xa(t), n = e.eventManager;
+    return n.onListen = ua.bind(null, e.syncEngine), n.onUnlisten = ca.bind(null, e.syncEngine), 
     n;
 }
 
-/** Enables the network connection and re-enqueues all pending operations. */ function ia(t) {
+/** Enables the network connection and re-enqueues all pending operations. */ function ic(t) {
     return t.asyncQueue.enqueue((async () => {
-        const e = await Zc(t), n = await ea(t);
+        const e = await Za(t), n = await ec(t);
         return e.setNetworkEnabled(!0), function(t) {
             const e = K(t);
             return e.lu.delete(0 /* UserDisabled */), hu(e);
@@ -16124,9 +16124,9 @@ async function sa(t) {
     }));
 }
 
-/** Disables the network connection. Pending operations will not complete. */ function ra(t) {
+/** Disables the network connection. Pending operations will not complete. */ function rc(t) {
     return t.asyncQueue.enqueue((async () => {
-        const e = await Zc(t), n = await ea(t);
+        const e = await Za(t), n = await ec(t);
         return e.setNetworkEnabled(!1), async function(t) {
             const e = K(t);
             e.lu.add(0 /* UserDisabled */), await lu(e), 
@@ -16140,7 +16140,7 @@ async function sa(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 oa(t, e) {
+ */ function oc(t, e) {
     const n = new j;
     return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {
         try {
@@ -16157,13 +16157,13 @@ async function sa(t) {
     /**
  * Retrieves a latency-compensated document from the backend via a
  * SnapshotListener.
- */ (await ta(t), e, n))), n.promise;
+ */ (await tc(t), e, n))), n.promise;
 }
 
-function ua(t, e, n = {}) {
+function uc(t, e, n = {}) {
     const s = new j;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new Gc({
+        const r = new Ga({
             next: r => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
@@ -16185,15 +16185,15 @@ function ua(t, e, n = {}) {
             Du: !0
         });
         return Qu(t, o);
-    }(await sa(t), t.asyncQueue, e, n, s))), s.promise;
+    }(await sc(t), t.asyncQueue, e, n, s))), s.promise;
 }
 
-function ca(t, e) {
+function ac(t, e) {
     const n = new j;
     return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {
         try {
             const s = await No(t, e, 
-            /* usePreviousResults= */ !0), i = new sc(e, s.ji), r = i.Ku(s.documents), o = i.applyChanges(r, 
+            /* usePreviousResults= */ !0), i = new sa(e, s.ji), r = i.Ku(s.documents), o = i.applyChanges(r, 
             /* updateLimboDocuments= */ !1);
             n.resolve(o.snapshot);
         } catch (t) {
@@ -16204,13 +16204,13 @@ function ca(t, e) {
     /**
  * Retrieves a latency-compensated query snapshot from the backend via a
  * SnapshotListener.
- */ (await ta(t), e, n))), n.promise;
+ */ (await tc(t), e, n))), n.promise;
 }
 
-function aa(t, e, n = {}) {
+function cc(t, e, n = {}) {
     const s = new j;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new Gc({
+        const r = new Ga({
             next: n => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
@@ -16222,20 +16222,20 @@ function aa(t, e, n = {}) {
             Du: !0
         });
         return Qu(t, o);
-    }(await sa(t), t.asyncQueue, e, n, s))), s.promise;
+    }(await sc(t), t.asyncQueue, e, n, s))), s.promise;
 }
 
-function ha(t, e) {
-    const n = new Gc(e);
+function hc(t, e) {
+    const n = new Ga(e);
     return t.asyncQueue.enqueueAndForget((async () => function(t, e) {
         K(t).Tu.add(e), 
         // Immediately fire an initial event, indicating all existing listeners
         // are in-sync.
         e.next();
-    }(await sa(t), n))), () => {
-        n.Tc(), t.asyncQueue.enqueueAndForget((async () => function(t, e) {
+    }(await sc(t), n))), () => {
+        n.Ia(), t.asyncQueue.enqueueAndForget((async () => function(t, e) {
             K(t).Tu.delete(e);
-        }(await sa(t), n)));
+        }(await sc(t), n)));
     };
 }
 
@@ -16253,25 +16253,25 @@ function ha(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 la(t, e, n) {
+ */ function lc(t, e, n) {
     const s = new j;
     return t.asyncQueue.enqueueAndForget((async () => {
         const i = await function(t) {
-            return Xc(t).then((t => t.datastore));
+            return Xa(t).then((t => t.datastore));
         }(t);
-        new Wc(t.asyncQueue, i, n, e, s).run();
+        new Wa(t.asyncQueue, i, n, e, s).run();
     })), s.promise;
 }
 
-function fa(t, e, n, s) {
+function fc(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 Qc(t, e);
+            return new Qa(t, e);
         }(function(t, e) {
-            if (t instanceof Uint8Array) return Kc(t, e);
-            if (t instanceof ArrayBuffer) return Kc(new Uint8Array(t), e);
+            if (t instanceof Uint8Array) return Ka(t, e);
+            if (t instanceof ArrayBuffer) return Ka(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);
@@ -16293,18 +16293,18 @@ function fa(t, e, n, s) {
  * limitations under the License.
  */ (n, nu(e));
     t.asyncQueue.enqueueAndForget((async () => {
-        $c(await na(t), i, s);
+        $a(await nc(t), i, s);
     }));
 }
 
-function da(t, e) {
+function dc(t, e) {
     return t.asyncQueue.enqueue((async () => function(t, e) {
         const n = K(t);
         return n.persistence.runTransaction("Get named query", "readonly", (t => n.Ds.getNamedQuery(t, e)));
-    }(await ta(t), e)));
+    }(await tc(t), e)));
 }
 
-const _a = new Map;
+const _c = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -16326,28 +16326,28 @@ const _a = new Map;
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function wa(t, e, n) {
+function wc(t, e, n) {
     if (!n) throw new Q(G.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 ma(t, e, n, s) {
+ */ function mc(t, e, n, s) {
     if (!0 === e && !0 === s) throw new Q(G.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 ga(t) {
+ */ function gc(t) {
     if (!dt.isDocumentKey(t)) throw new Q(G.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 ya(t) {
+ */ function yc(t) {
     if (dt.isDocumentKey(t)) throw new Q(G.INVALID_ARGUMENT, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
@@ -16356,7 +16356,7 @@ function wa(t, e, n) {
  * (i.e. excludes Array, Date, etc.).
  */
 /** Returns a string describing the type / value of the provided input. */
-function pa(t) {
+function pc(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)}...`), 
@@ -16385,7 +16385,7 @@ function pa(t) {
     return "function" == typeof t ? "a function" : L();
 }
 
-function Ia(t, 
+function Ic(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     if ("_delegate" in t && (
@@ -16394,14 +16394,14 @@ e) {
     t = t._delegate), !(t instanceof e)) {
         if (e.name === t.constructor.name) throw new Q(G.INVALID_ARGUMENT, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
-            const n = pa(t);
+            const n = pc(t);
             throw new Q(G.INVALID_ARGUMENT, `Expected type '${e.name}', but it was: ${n}`);
         }
     }
     return t;
 }
 
-function Ta(t, e) {
+function Tc(t, e) {
     if (e <= 0) throw new Q(G.INVALID_ARGUMENT, `Function ${t}() requires a positive number, but it was: ${e}.`);
 }
 
@@ -16427,7 +16427,7 @@ function Ta(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 Ea {
+class Ec {
     constructor(t) {
         var e;
         if (void 0 === t.host) {
@@ -16440,7 +16440,7 @@ class Ea {
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
-        this.useFetchStreams = !!t.useFetchStreams, ma("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
+        this.useFetchStreams = !!t.useFetchStreams, mc("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;
@@ -16467,14 +16467,14 @@ class Ea {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class Aa {
+ */ class Ac {
     /** @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 Ea({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new Ec({}), 
         this._settingsFrozen = !1, t instanceof re ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
             if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new Q(G.INVALID_ARGUMENT, '"projectId" not provided in firebase.initializeApp.');
@@ -16509,7 +16509,7 @@ class Ea {
     }
     _setSettings(t) {
         if (this._settingsFrozen) throw new Q(G.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 Ea(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new Ec(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new z;
             switch (t.type) {
               case "gapi":
@@ -16554,15 +16554,15 @@ class Ea {
  * when the `Firestore` instance is terminated.
  */
         return function(t) {
-            const e = _a.get(t);
-            e && (M("ComponentProvider", "Removing Datastore"), _a.delete(t), e.terminate());
+            const e = _c.get(t);
+            e && (M("ComponentProvider", "Removing Datastore"), _c.delete(t), e.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function Ra(t, e, n, s = {}) {
+function Rc(t, e, n, s = {}) {
     var i;
-    const r = (t = Ia(t, Aa))._getSettings();
+    const r = (t = Ic(t, Ac))._getSettings();
     if ("firestore.googleapis.com" !== r.host && r.host !== e && $("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, r), {
         host: `${e}:${n}`,
@@ -16601,7 +16601,7 @@ function Ra(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 ba {
+ */ class bc {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -16629,17 +16629,17 @@ function Ra(t, e, n, s = {}) {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new va(this.firestore, this.converter, this._key.path.popLast());
+        return new vc(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new ba(this.firestore, t, this._key);
+        return new bc(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 Pa {
+ */ class Pc {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -16652,14 +16652,14 @@ function Ra(t, e, n, s = {}) {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new Pa(this.firestore, t, this._query);
+        return new Pc(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 va extends Pa {
+ */ class vc extends Pc {
     /** @hideconstructor */
     constructor(t, e, n) {
         super(t, e, rn(n)), this._path = n, 
@@ -16680,23 +16680,23 @@ function Ra(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 ba(this.firestore, 
+        return t.isEmpty() ? null : new bc(this.firestore, 
         /* converter= */ null, new dt(t));
     }
     withConverter(t) {
-        return new va(this.firestore, t, this._path);
+        return new vc(this.firestore, t, this._path);
     }
 }
 
-function Va(t, e, ...n) {
-    if (t = getModularInstance(t), wa("collection", "path", e), t instanceof Aa) {
+function Vc(t, e, ...n) {
+    if (t = getModularInstance(t), wc("collection", "path", e), t instanceof Ac) {
         const s = ht.fromString(e, ...n);
-        return ya(s), new va(t, /* converter= */ null, s);
+        return yc(s), new vc(t, /* converter= */ null, s);
     }
     {
-        if (!(t instanceof ba || t instanceof va)) throw new Q(G.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof bc || t instanceof vc)) throw new Q(G.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(ht.fromString(e, ...n));
-        return ya(s), new va(t.firestore, 
+        return yc(s), new vc(t.firestore, 
         /* converter= */ null, s);
     }
 }
@@ -16713,9 +16713,9 @@ function Va(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 Sa(t, e) {
-    if (t = Ia(t, Aa), wa("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new Q(G.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new Pa(t, 
+ */ function Sc(t, e) {
+    if (t = Ic(t, Ac), wc("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new Q(G.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new Pc(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
@@ -16726,19 +16726,19 @@ function Va(t, e, ...n) {
     }(e));
 }
 
-function Da(t, e, ...n) {
+function Dc(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.I()), wa("doc", "path", e), t instanceof Aa) {
+    1 === arguments.length && (e = st.I()), wc("doc", "path", e), t instanceof Ac) {
         const s = ht.fromString(e, ...n);
-        return ga(s), new ba(t, 
+        return gc(s), new bc(t, 
         /* converter= */ null, new dt(s));
     }
     {
-        if (!(t instanceof ba || t instanceof va)) throw new Q(G.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof bc || t instanceof vc)) throw new Q(G.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(ht.fromString(e, ...n));
-        return ga(s), new ba(t.firestore, t instanceof va ? t.converter : null, new dt(s));
+        return gc(s), new bc(t.firestore, t instanceof vc ? t.converter : null, new dt(s));
     }
 }
 
@@ -16749,8 +16749,8 @@ function Da(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 Ca(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof ba || t instanceof va) && (e instanceof ba || e instanceof va) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+ */ function Cc(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof bc || t instanceof vc) && (e instanceof bc || e instanceof vc) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -16761,8 +16761,8 @@ function Da(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 xa(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), t instanceof Pa && e instanceof Pa && (t.firestore === e.firestore && dn(t._query, e._query) && t.converter === e.converter);
+ */ function xc(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), t instanceof Pc && e instanceof Pc && (t.firestore === e.firestore && dn(t._query, e._query) && t.converter === e.converter);
 }
 
 /**
@@ -16780,42 +16780,42 @@ function Da(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 Na {
+ */ class Nc {
     constructor() {
         // The last promise in the queue.
-        this.Oc = Promise.resolve(), 
+        this.ka = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.Mc = [], 
+        this.Oa = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.Fc = !1, 
+        this.Ma = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.$c = [], 
+        this.Fa = [], 
         // visible for testing
-        this.Bc = null, 
+        this.$a = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.Lc = !1, 
+        this.Ba = !1, 
         // Enabled during shutdown on Safari to prevent future access to IndexedDB.
-        this.Uc = !1, 
+        this.La = !1, 
         // List of TimerIds to fast-forward delays for.
-        this.qc = [], 
+        this.Ua = [], 
         // Backoff timer used to schedule retries for retryable operations
         this.So = new su(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.Kc = () => {
+        this.qa = () => {
             const t = eu();
             t && M("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.So.Eo();
         };
         const t = eu();
-        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Kc);
+        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.qa);
     }
     get isShuttingDown() {
-        return this.Fc;
+        return this.Ma;
     }
     /**
      * Adds a new operation to the queue without waiting for it to complete (i.e.
@@ -16825,44 +16825,44 @@ function Da(t, e, ...n) {
         this.enqueue(t);
     }
     enqueueAndForgetEvenWhileRestricted(t) {
-        this.Gc(), 
+        this.Ka(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.Qc(t);
+        this.Ga(t);
     }
     enterRestrictedMode(t) {
-        if (!this.Fc) {
-            this.Fc = !0, this.Uc = t || !1;
+        if (!this.Ma) {
+            this.Ma = !0, this.La = t || !1;
             const e = eu();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Kc);
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.qa);
         }
     }
     enqueue(t) {
-        if (this.Gc(), this.Fc) 
+        if (this.Ka(), this.Ma) 
         // 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 j;
-        return this.Qc((() => this.Fc && this.Uc ? Promise.resolve() : (t().then(e.resolve, e.reject), 
+        return this.Ga((() => this.Ma && this.La ? Promise.resolve() : (t().then(e.resolve, e.reject), 
         e.promise))).then((() => e.promise));
     }
     enqueueRetryable(t) {
-        this.enqueueAndForget((() => (this.Mc.push(t), this.jc())));
+        this.enqueueAndForget((() => (this.Oa.push(t), this.Qa())));
     }
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
-     */    async jc() {
-        if (0 !== this.Mc.length) {
+     */    async Qa() {
+        if (0 !== this.Oa.length) {
             try {
-                await this.Mc[0](), this.Mc.shift(), this.So.reset();
+                await this.Oa[0](), this.Oa.shift(), this.So.reset();
             } catch (t) {
                 if (!Ct(t)) throw t;
  // Failure will be handled by AsyncQueue
                                 M("AsyncQueue", "Operation failed with retryable error: " + t);
             }
-            this.Mc.length > 0 && 
+            this.Oa.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
@@ -16873,12 +16873,12 @@ function Da(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.So.Io((() => this.jc()));
+            this.So.Io((() => this.Qa()));
         }
     }
-    Qc(t) {
-        const e = this.Oc.then((() => (this.Lc = !0, t().catch((t => {
-            this.Bc = t, this.Lc = !1;
+    Ga(t) {
+        const e = this.ka.then((() => (this.Ba = !0, t().catch((t => {
+            this.$a = t, this.Ba = !1;
             const e = 
             /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -16910,38 +16910,38 @@ function Da(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.Lc = !1, t))))));
-        return this.Oc = e, e;
+        })).then((t => (this.Ba = !1, t))))));
+        return this.ka = e, e;
     }
     enqueueAfterDelay(t, e, n) {
-        this.Gc(), 
+        this.Ka(), 
         // Fast-forward delays for timerIds that have been overriden.
-        this.qc.indexOf(t) > -1 && (e = 0);
-        const s = $u.createAndSchedule(this, t, e, n, (t => this.Wc(t)));
-        return this.$c.push(s), s;
+        this.Ua.indexOf(t) > -1 && (e = 0);
+        const s = $u.createAndSchedule(this, t, e, n, (t => this.ja(t)));
+        return this.Fa.push(s), s;
     }
-    Gc() {
-        this.Bc && L();
+    Ka() {
+        this.$a && L();
     }
     verifyOperationInProgress() {}
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
-     */    async zc() {
+     */    async Wa() {
         // 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.Oc, await t;
-        } while (t !== this.Oc);
+            t = this.ka, await t;
+        } while (t !== this.ka);
     }
     /**
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
-     */    Hc(t) {
-        for (const e of this.$c) if (e.timerId === t) return !0;
+     */    za(t) {
+        for (const e of this.Fa) if (e.timerId === t) return !0;
         return !1;
     }
     /**
@@ -16950,28 +16950,28 @@ function Da(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.
-     */    Jc(t) {
+     */    Ha(t) {
         // Note that draining may generate more delayed ops, so we do that first.
-        return this.zc().then((() => {
+        return this.Wa().then((() => {
             // Run ops in the same order they'd run if they ran naturally.
-            this.$c.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
-            for (const e of this.$c) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
-            return this.zc();
+            this.Fa.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
+            for (const e of this.Fa) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
+            return this.Wa();
         }));
     }
     /**
      * For Tests: Skip all subsequent delays for a timer id.
-     */    Yc(t) {
-        this.qc.push(t);
+     */    Ja(t) {
+        this.Ua.push(t);
     }
-    /** Called once a DelayedOperation is run or canceled. */    Wc(t) {
+    /** Called once a DelayedOperation is run or canceled. */    ja(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        const e = this.$c.indexOf(t);
-        this.$c.splice(e, 1);
+        const e = this.Fa.indexOf(t);
+        this.Fa.splice(e, 1);
     }
 }
 
-function ka(t) {
+function kc(t) {
     /**
  * Returns true if obj is an object and contains at least one of the specified
  * methods.
@@ -17006,7 +17006,7 @@ function ka(t) {
  */ (t, [ "next", "error", "complete" ]);
 }
 
-class Oa {
+class Oc {
     constructor() {
         this._progressObserver = {}, this._taskCompletionResolver = new j, this._lastProgress = {
             taskState: "Running",
@@ -17090,27 +17090,27 @@ class Oa {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** DOMException error code constants. */ const Ma = -1;
+/** DOMException error code constants. */ const Mc = -1;
 
 /**
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
  */
-class Fa extends Aa {
+class Fc extends Ac {
     /** @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 Na, this._persistenceKey = "name" in t ? t.name : "[DEFAULT]";
+        this.type = "firestore", this._queue = new Nc, 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.
-        Ua(this), this._firestoreClient.terminate();
+        Uc(this), this._firestoreClient.terminate();
     }
 }
 
@@ -17124,7 +17124,7 @@ class Fa extends Aa {
  * be associated.
  * @param settings - A settings object to configure the {@link Firestore} instance.
  * @returns A newly initialized {@link Firestore} instance.
- */ function $a(t, e) {
+ */ function $c(t, e) {
     const n = _getProvider(t, "firestore");
     if (n.isInitialized()) {
         const t = n.getImmediate(), s = n.getOptions();
@@ -17145,22 +17145,22 @@ class Fa extends Aa {
  * @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 Ba(e = getApp()) {
+ */ function Bc(e = getApp()) {
     return _getProvider(e, "firestore").getImmediate();
 }
 
 /**
  * @internal
- */ function La(t) {
-    return t._firestoreClient || Ua(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;
+ */ function Lc(t) {
+    return t._firestoreClient || Uc(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;
 }
 
-function Ua(t) {
+function Uc(t) {
     var e;
     const n = t._freezeSettings(), s = function(t, e, n, s) {
         return new ie(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 zc(t._authCredentials, t._appCheckCredentials, t._queue, s);
+    t._firestoreClient = new za(t._authCredentials, t._appCheckCredentials, t._queue, s);
 }
 
 /**
@@ -17185,10 +17185,10 @@ function Ua(t) {
  * @param persistenceSettings - Optional settings object to configure
  * persistence.
  * @returns A `Promise` that represents successfully enabling persistent storage.
- */ function qa(t, e) {
-    Xa(t = Ia(t, Fa));
-    const n = La(t), s = t._freezeSettings(), i = new qc;
-    return Ga(n, i, new Lc(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
+ */ function qc(t, e) {
+    Xc(t = Ic(t, Fc));
+    const n = Lc(t), s = t._freezeSettings(), i = new qa;
+    return Gc(n, i, new La(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
 }
 
 /**
@@ -17212,10 +17212,10 @@ function Ua(t) {
  * @param firestore - The {@link Firestore} instance to enable persistence for.
  * @returns A `Promise` that represents successfully enabling persistent
  * storage.
- */ function Ka(t) {
-    Xa(t = Ia(t, Fa));
-    const e = La(t), n = t._freezeSettings(), s = new qc;
-    return Ga(e, s, new Uc(s, n.cacheSizeBytes));
+ */ function Kc(t) {
+    Xc(t = Ic(t, Fc));
+    const e = Lc(t), n = t._freezeSettings(), s = new qa;
+    return Gc(e, s, new Ua(s, n.cacheSizeBytes));
 }
 
 /**
@@ -17223,11 +17223,11 @@ function Ua(t) {
  * If the operation fails with a recoverable error (see
  * `canRecoverFromIndexedDbError()` below), the returned Promise is rejected
  * but the client remains usable.
- */ function Ga(t, e, n) {
+ */ function Gc(t, e, n) {
     const s = new j;
     return t.asyncQueue.enqueue((async () => {
         try {
-            await Hc(t, n), await Jc(t, e), s.resolve();
+            await Ha(t, n), await Ja(t, e), s.resolve();
         } catch (t) {
             const e = t;
             if (!
@@ -17282,7 +17282,7 @@ function Ua(t) {
     })).then((() => s.promise));
 }
 
-function Qa(t) {
+function Qc(t) {
     if (t._initialized && !t._terminated) throw new Q(G.FAILED_PRECONDITION, "Persistence can only be cleared before a Firestore instance is initialized or after it is terminated.");
     const e = new j;
     return t._queue.enqueueAndForgetEvenWhileRestricted((async () => {
@@ -17313,11 +17313,11 @@ function Qa(t) {
  *
  * @returns A `Promise` which resolves when all currently pending writes have been
  * acknowledged by the backend.
- */ function ja(t) {
+ */ function jc(t) {
     return function(t) {
         const e = new j;
-        return t.asyncQueue.enqueueAndForget((async () => mc(await na(t), e))), e.promise;
-    }(La(t = Ia(t, Fa)));
+        return t.asyncQueue.enqueueAndForget((async () => ma(await nc(t), e))), e.promise;
+    }(Lc(t = Ic(t, Fc)));
 }
 
 /**
@@ -17325,8 +17325,8 @@ function Qa(t) {
  * call to {@link disableNetwork}.
  *
  * @returns A `Promise` that is resolved once the network has been enabled.
- */ function Wa(t) {
-    return ia(La(t = Ia(t, Fa)));
+ */ function Wc(t) {
+    return ic(Lc(t = Ic(t, Fc)));
 }
 
 /**
@@ -17336,8 +17336,8 @@ function Qa(t) {
  * operations will be queued until the network is restored.
  *
  * @returns A `Promise` that is resolved once the network has been disabled.
- */ function za(t) {
-    return ra(La(t = Ia(t, Fa)));
+ */ function zc(t) {
+    return rc(Lc(t = Ic(t, Fc)));
 }
 
 /**
@@ -17361,7 +17361,7 @@ function Qa(t) {
  *
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function Ha(t) {
+ */ function Hc(t) {
     return _removeServiceInstance(t.app, "firestore"), t._delete();
 }
 
@@ -17375,9 +17375,9 @@ function Qa(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 Ja(t, e) {
-    const n = La(t = Ia(t, Fa)), s = new Oa;
-    return fa(n, t._databaseId, e, s), s;
+ */ function Jc(t, e) {
+    const n = Lc(t = Ic(t, Fc)), s = new Oc;
+    return fc(n, t._databaseId, e, s), s;
 }
 
 /**
@@ -17391,11 +17391,11 @@ function Qa(t) {
  * @param firestore - The {@link Firestore} instance to read the query from.
  * @param name - The name of the query.
  * @returns A `Promise` that is resolved with the Query or `null`.
- */ function Ya(t, e) {
-    return da(La(t = Ia(t, Fa)), e).then((e => e ? new Pa(t, null, e.query) : null));
+ */ function Yc(t, e) {
+    return dc(Lc(t = Ic(t, Fc)), e).then((e => e ? new Pc(t, null, e.query) : null));
 }
 
-function Xa(t) {
+function Xc(t) {
     if (t._initialized || t._terminated) throw new Q(G.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.");
 }
 
@@ -17439,7 +17439,7 @@ function Xa(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 Za {
+class Zc {
     /**
      * 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.
@@ -17464,7 +17464,7 @@ class Za {
  * 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 th() {
-    return new Za("__name__");
+    return new Zc("__name__");
 }
 
 /**
@@ -17690,7 +17690,7 @@ function uh(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class ch {
+/** A "context" object passed around while parsing user data. */ class ah {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -17713,102 +17713,102 @@ function uh(t) {
         this.settings = t, this.databaseId = e, this.wt = 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.Xc(), this.fieldTransforms = i || [], this.fieldMask = r || [];
+        void 0 === i && this.Ya(), this.fieldTransforms = i || [], this.fieldMask = r || [];
     }
     get path() {
         return this.settings.path;
     }
-    get Zc() {
-        return this.settings.Zc;
+    get Xa() {
+        return this.settings.Xa;
     }
-    /** Returns a new context with the specified settings overwritten. */    ta(t) {
-        return new ch(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.wt, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+    /** Returns a new context with the specified settings overwritten. */    Za(t) {
+        return new ah(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.wt, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
-    ea(t) {
+    tc(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.ta({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.Za({
             path: n,
-            na: !1
+            ec: !1
         });
-        return s.sa(t), s;
+        return s.nc(t), s;
     }
-    ia(t) {
+    sc(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.ta({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.Za({
             path: n,
-            na: !1
+            ec: !1
         });
-        return s.Xc(), s;
+        return s.Ya(), s;
     }
-    ra(t) {
+    ic(t) {
         // TODO(b/34871131): We don't support array paths right now; so make path
         // undefined.
-        return this.ta({
+        return this.Za({
             path: void 0,
-            na: !0
+            ec: !0
         });
     }
-    oa(t) {
-        return Vh(t, this.settings.methodName, this.settings.ua || !1, this.path, this.settings.ca);
+    rc(t) {
+        return Vh(t, this.settings.methodName, this.settings.oc || !1, this.path, this.settings.uc);
     }
     /** 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)));
     }
-    Xc() {
+    Ya() {
         // 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.sa(this.path.get(t));
+        if (this.path) for (let t = 0; t < this.path.length; t++) this.nc(this.path.get(t));
     }
-    sa(t) {
-        if (0 === t.length) throw this.oa("Document fields must not be empty");
-        if (uh(this.Zc) && ih.test(t)) throw this.oa('Document fields cannot begin and end with "__"');
+    nc(t) {
+        if (0 === t.length) throw this.rc("Document fields must not be empty");
+        if (uh(this.Xa) && ih.test(t)) throw this.rc('Document fields cannot begin and end with "__"');
     }
 }
 
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ class ah {
+ */ class ch {
     constructor(t, e, n) {
         this.databaseId = t, this.ignoreUndefinedProperties = e, this.wt = n || nu(t);
     }
-    /** Creates a new top-level parse context. */    aa(t, e, n, s = !1) {
-        return new ch({
-            Zc: t,
+    /** Creates a new top-level parse context. */    ac(t, e, n, s = !1) {
+        return new ah({
+            Xa: t,
             methodName: e,
-            ca: n,
+            uc: n,
             path: ft.emptyPath(),
-            na: !1,
-            ua: s
+            ec: !1,
+            oc: s
         }, this.databaseId, this.wt, this.ignoreUndefinedProperties);
     }
 }
 
 function hh(t) {
     const e = t._freezeSettings(), n = nu(t._databaseId);
-    return new ah(t._databaseId, !!e.ignoreUndefinedProperties, n);
+    return new ch(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
 /** Parse document data from a set() call. */ function lh(t, e, n, s, i, r = {}) {
-    const o = t.aa(r.merge || r.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
+    const o = t.ac(r.merge || r.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
     Rh("Data must be an object, but it was:", o, s);
     const u = Eh(s, o);
-    let c, a;
-    if (r.merge) c = new zt(o.fieldMask), a = o.fieldTransforms; else if (r.mergeFields) {
+    let a, c;
+    if (r.merge) a = new zt(o.fieldMask), c = o.fieldTransforms; else if (r.mergeFields) {
         const t = [];
         for (const s of r.mergeFields) {
             const i = bh(e, s, n);
             if (!o.contains(i)) throw new Q(G.INVALID_ARGUMENT, `Field '${i}' is specified in your field mask but missing from your input data.`);
             Sh(t, i) || t.push(i);
         }
-        c = new zt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
-    } else c = null, a = o.fieldTransforms;
-    return new rh(new De(u), c, a);
+        a = new zt(t), c = o.fieldTransforms.filter((t => a.covers(t.field)));
+    } else a = null, c = o.fieldTransforms;
+    return new rh(new De(u), a, c);
 }
 
 class fh extends nh {
     _toFieldTransform(t) {
-        if (2 /* MergeSet */ !== t.Zc) throw 1 /* Update */ === t.Zc ? t.oa(`${this._methodName}() can only appear at the top level of your update data`) : t.oa(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
+        if (2 /* MergeSet */ !== t.Xa) throw 1 /* Update */ === t.Xa ? t.rc(`${this._methodName}() can only appear at the top level of your update data`) : t.rc(`${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;
@@ -17834,11 +17834,11 @@ class fh extends nh {
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
  */ function dh(t, e, n) {
-    return new ch({
-        Zc: 3 /* Argument */ ,
-        ca: e.settings.ca,
+    return new ah({
+        Xa: 3 /* Argument */ ,
+        uc: e.settings.uc,
         methodName: t._methodName,
-        na: n
+        ec: n
     }, e.databaseId, e.wt, e.ignoreUndefinedProperties);
 }
 
@@ -17853,11 +17853,11 @@ class _h extends nh {
 
 class wh extends nh {
     constructor(t, e) {
-        super(t), this.ha = e;
+        super(t), this.cc = e;
     }
     _toFieldTransform(t) {
         const e = dh(this, t, 
-        /*array=*/ !0), n = this.ha.map((t => Th(t, e))), s = new Vn(n);
+        /*array=*/ !0), n = this.cc.map((t => Th(t, e))), s = new Vn(n);
         return new On(t.path, s);
     }
     isEqual(t) {
@@ -17868,11 +17868,11 @@ class wh extends nh {
 
 class mh extends nh {
     constructor(t, e) {
-        super(t), this.ha = e;
+        super(t), this.cc = e;
     }
     _toFieldTransform(t) {
         const e = dh(this, t, 
-        /*array=*/ !0), n = this.ha.map((t => Th(t, e))), s = new Dn(n);
+        /*array=*/ !0), n = this.cc.map((t => Th(t, e))), s = new Dn(n);
         return new On(t.path, s);
     }
     isEqual(t) {
@@ -17883,10 +17883,10 @@ class mh extends nh {
 
 class gh extends nh {
     constructor(t, e) {
-        super(t), this.la = e;
+        super(t), this.hc = e;
     }
     _toFieldTransform(t) {
-        const e = new xn(t.wt, En(t.wt, this.la));
+        const e = new xn(t.wt, En(t.wt, this.hc));
         return new On(t.path, e);
     }
     isEqual(t) {
@@ -17896,7 +17896,7 @@ class gh extends nh {
 }
 
 /** Parse update data from an update() call. */ function yh(t, e, n, s) {
-    const i = t.aa(1 /* Update */ , e, n);
+    const i = t.ac(1 /* Update */ , e, n);
     Rh("Data must be an object, but it was:", i, s);
     const r = [], o = De.empty();
     Lt(s, ((t, s) => {
@@ -17904,11 +17904,11 @@ class gh extends nh {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 s = getModularInstance(s);
-        const c = i.ia(u);
+        const a = i.sc(u);
         if (s instanceof fh) 
         // Add it to the field mask, but don't add anything to updateData.
         r.push(u); else {
-            const t = Th(s, c);
+            const t = Th(s, a);
             null != t && (r.push(u), o.set(u, t));
         }
     }));
@@ -17917,27 +17917,27 @@ class gh extends nh {
 }
 
 /** Parse update data from a list of field/value arguments. */ function ph(t, e, n, s, i, r) {
-    const o = t.aa(1 /* Update */ , e, n), u = [ bh(e, s, n) ], c = [ i ];
+    const o = t.ac(1 /* Update */ , e, n), u = [ bh(e, s, n) ], a = [ i ];
     if (r.length % 2 != 0) throw new Q(G.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) u.push(bh(e, r[t])), c.push(r[t + 1]);
-    const a = [], h = De.empty();
+    for (let t = 0; t < r.length; t += 2) u.push(bh(e, r[t])), a.push(r[t + 1]);
+    const c = [], h = De.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 = u.length - 1; t >= 0; --t) if (!Sh(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!Sh(c, u[t])) {
         const e = u[t];
-        let n = 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.ia(e);
+        const s = o.sc(e);
         if (n instanceof fh) 
         // Add it to the field mask, but don't add anything to updateData.
-        a.push(e); else {
+        c.push(e); else {
             const t = Th(n, s);
-            null != t && (a.push(e), h.set(e, t));
+            null != t && (c.push(e), h.set(e, t));
         }
     }
-    const l = new zt(a);
+    const l = new zt(c);
     return new oh(h, l, o.fieldTransforms);
 }
 
@@ -17948,7 +17948,7 @@ class gh extends nh {
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
  */ function Ih(t, e, n, s = !1) {
-    return Th(n, t.aa(s ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+    return Th(n, t.ac(s ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -17976,8 +17976,8 @@ class gh extends nh {
  */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!uh(e.Zc)) throw e.oa(`${t._methodName}() can only be used with update() and set()`);
-        if (!e.path) throw e.oa(`${t._methodName}() is not currently supported inside arrays`);
+        if (!uh(e.Xa)) throw e.rc(`${t._methodName}() can only be used with update() and set()`);
+        if (!e.path) throw e.rc(`${t._methodName}() is not currently supported inside arrays`);
         const n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
     }
@@ -18001,12 +18001,12 @@ class gh extends nh {
         // 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.na && 4 /* ArrayArgument */ !== e.Zc) throw e.oa("Nested arrays are not supported");
+        if (e.settings.ec && 4 /* ArrayArgument */ !== e.Xa) throw e.rc("Nested arrays are not supported");
         return function(t, e) {
             const n = [];
             let s = 0;
             for (const i of t) {
-                let t = Th(i, e.ra(s));
+                let t = Th(i, e.ic(s));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -18056,14 +18056,14 @@ class gh extends nh {
         if (t instanceof eh) return {
             bytesValue: Cs(e.wt, t._byteString)
         };
-        if (t instanceof ba) {
+        if (t instanceof bc) {
             const n = e.databaseId, s = t.firestore._databaseId;
-            if (!s.isEqual(n)) throw e.oa(`Document reference is for database ${s.projectId}/${s.database} but should be for database ${n.projectId}/${n.database}`);
+            if (!s.isEqual(n)) throw e.rc(`Document reference is for database ${s.projectId}/${s.database} but should be for database ${n.projectId}/${n.database}`);
             return {
                 referenceValue: ks(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.oa(`Unsupported field value: ${pa(t)}`);
+        throw e.rc(`Unsupported field value: ${pc(t)}`);
     }
     /**
  * Checks whether an object looks like a JSON object that should be converted
@@ -18080,7 +18080,7 @@ function Eh(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) : Lt(t, ((t, s) => {
-        const i = Th(s, e.ea(t));
+        const i = Th(s, e.tc(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -18090,15 +18090,15 @@ function Eh(t, e) {
 }
 
 function Ah(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof ut || t instanceof sh || t instanceof eh || t instanceof ba || t instanceof nh);
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof ut || t instanceof sh || t instanceof eh || t instanceof bc || t instanceof nh);
 }
 
 function Rh(t, e, n) {
     if (!Ah(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
-        const s = pa(n);
-        throw "an object" === s ? e.oa(t + " a custom object") : e.oa(t + " " + s);
+        const s = pc(n);
+        throw "an object" === s ? e.rc(t + " a custom object") : e.rc(t + " " + s);
     }
 }
 
@@ -18108,7 +18108,7 @@ function Rh(t, e, n) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    e = getModularInstance(e)) instanceof Za) return e._internalPath;
+    e = getModularInstance(e)) instanceof Zc) return e._internalPath;
     if ("string" == typeof e) return vh(t, e);
     throw Vh("Field path arguments must be of type string or ", t, 
     /* hasConverter= */ !1, 
@@ -18132,7 +18132,7 @@ function Rh(t, e, n) {
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return new Za(...e.split("."))._internalPath;
+        return new Zc(...e.split("."))._internalPath;
     } catch (s) {
         throw Vh(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
@@ -18144,9 +18144,9 @@ function Vh(t, e, n, s, i) {
     const r = s && !s.isEmpty(), o = void 0 !== i;
     let u = `Function ${e}() called with invalid data`;
     n && (u += " (via `toFirestore()`)"), u += ". ";
-    let c = "";
-    return (r || o) && (c += " (found", r && (c += ` in field ${s}`), o && (c += ` in document ${i}`), 
-    c += ")"), new Q(G.INVALID_ARGUMENT, u + t + c);
+    let a = "";
+    return (r || o) && (a += " (found", r && (a += ` in field ${s}`), o && (a += ` in document ${i}`), 
+    a += ")"), new Q(G.INVALID_ARGUMENT, u + t + a);
 }
 
 /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Sh(t, e) {
@@ -18193,7 +18193,7 @@ function Vh(t, e, n, s, i) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new ba(this._firestore, this._converter, this._key);
+        return new bc(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -18264,7 +18264,7 @@ function Vh(t, e, n, s, i) {
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */ function xh(t, e) {
-    return "string" == typeof e ? vh(t, e) : e instanceof Za ? e._internalPath : e._delegate._internalPath;
+    return "string" == typeof e ? vh(t, e) : e instanceof Zc ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -18500,7 +18500,7 @@ function Fh(t) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */ function $h(t, e) {
-    return t instanceof kh && e instanceof kh ? 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 Mh && e instanceof Mh && (t._firestore === e._firestore && xa(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
+    return t instanceof kh && e instanceof kh ? 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 Mh && e instanceof Mh && (t._firestore === e._firestore && xc(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
 }
 
 /**
@@ -18546,7 +18546,7 @@ function Fh(t) {
 
 class qh extends Lh {
     constructor(t, e, n) {
-        super(), this.fa = t, this.da = e, this._a = n, this.type = "where";
+        super(), this.lc = t, this.fc = e, this.dc = n, this.type = "where";
     }
     _apply(t) {
         const e = hh(t.firestore), n = function(t, e, n, s, i, r, o) {
@@ -18566,10 +18566,10 @@ class qh extends Lh {
             } else "in" /* IN */ !== r && "not-in" /* NOT_IN */ !== r && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== r || sl(o, r), 
             u = Ih(n, e, o, 
             /* allowArrays= */ "in" /* IN */ === r || "not-in" /* NOT_IN */ === r);
-            const c = qe.create(i, r, u);
+            const a = qe.create(i, r, u);
             return function(t, e) {
                 if (e.ht()) {
-                    const n = cn(t);
+                    const n = an(t);
                     if (null !== n && !n.isEqual(e.field)) throw new Q(G.INVALID_ARGUMENT, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${n.toString()}' and '${e.field.toString()}'`);
                     const s = un(t);
                     null !== s && il(t, e.field, s);
@@ -18614,9 +18614,9 @@ class qh extends Lh {
                 if (null !== n) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
                 throw n === e.op ? new Q(G.INVALID_ARGUMENT, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new Q(G.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.fa, this.da, this._a);
-        return new Pa(t.firestore, t.converter, function(t, e) {
+            }(t, a), a;
+        }(t._query, "where", e, t.firestore._databaseId, this.lc, this.fc, this.dc);
+        return new Pc(t.firestore, t.converter, function(t, e) {
             const n = t.filters.concat([ e ]);
             return new nn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
@@ -18640,7 +18640,7 @@ class qh extends Lh {
 
 class Gh extends Lh {
     constructor(t, e) {
-        super(), this.fa = t, this.wa = e, this.type = "orderBy";
+        super(), this.lc = t, this._c = e, this.type = "orderBy";
     }
     _apply(t) {
         const e = function(t, e, n) {
@@ -18650,7 +18650,7 @@ class Gh extends Lh {
             return function(t, e) {
                 if (null === un(t)) {
                     // This is the first order by. It must match any inequality.
-                    const n = cn(t);
+                    const n = an(t);
                     null !== n && il(t, n, e.field);
                 }
             }(t, s), s;
@@ -18665,8 +18665,8 @@ class Gh extends Lh {
  * 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.fa, this.wa);
-        return new Pa(t.firestore, t.converter, function(t, e) {
+ */ (t._query, this.lc, this._c);
+        return new Pc(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 nn(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
@@ -18689,10 +18689,10 @@ class Gh extends Lh {
 
 class jh extends Lh {
     constructor(t, e, n) {
-        super(), this.type = t, this.ma = e, this.ga = n;
+        super(), this.type = t, this.wc = e, this.mc = n;
     }
     _apply(t) {
-        return new Pa(t.firestore, t.converter, fn(t._query, this.ma, this.ga));
+        return new Pc(t.firestore, t.converter, fn(t._query, this.wc, this.mc));
     }
 }
 
@@ -18702,7 +18702,7 @@ class jh extends Lh {
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
  */ function Wh(t) {
-    return Ta("limit", t), new jh("limit", t, "F" /* First */);
+    return Tc("limit", t), new jh("limit", t, "F" /* First */);
 }
 
 /**
@@ -18714,16 +18714,16 @@ class jh extends Lh {
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
  */ function zh(t) {
-    return Ta("limitToLast", t), new jh("limitToLast", t, "L" /* Last */);
+    return Tc("limitToLast", t), new jh("limitToLast", t, "L" /* Last */);
 }
 
 class Hh extends Lh {
     constructor(t, e, n) {
-        super(), this.type = t, this.ya = e, this.pa = n;
+        super(), this.type = t, this.gc = e, this.yc = n;
     }
     _apply(t) {
-        const e = el(t, this.type, this.ya, this.pa);
-        return new Pa(t.firestore, t.converter, function(t, e) {
+        const e = el(t, this.type, this.gc, this.yc);
+        return new Pc(t.firestore, t.converter, function(t, e) {
             return new nn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
@@ -18741,11 +18741,11 @@ function Yh(...t) {
 
 class Xh extends Lh {
     constructor(t, e, n) {
-        super(), this.type = t, this.ya = e, this.pa = n;
+        super(), this.type = t, this.gc = e, this.yc = n;
     }
     _apply(t) {
-        const e = el(t, this.type, this.ya, this.pa);
-        return new Pa(t.firestore, t.converter, function(t, e) {
+        const e = el(t, this.type, this.gc, this.yc);
+        return new Pc(t.firestore, t.converter, function(t, e) {
             return new nn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
@@ -18793,16 +18793,16 @@ function tl(...t) {
             if (i.length > o.length) throw new Q(G.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 u = [];
             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 Q(G.INVALID_ARGUMENT, `Invalid query. Expected a string for document ID in ${s}(), but got a ${typeof c}`);
-                    if (!an(t) && -1 !== c.indexOf("/")) throw new Q(G.INVALID_ARGUMENT, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${s}() must be a plain document ID, but '${c}' contains a slash.`);
-                    const n = t.path.child(ht.fromString(c));
+                    if ("string" != typeof a) throw new Q(G.INVALID_ARGUMENT, `Invalid query. Expected a string for document ID in ${s}(), but got a ${typeof a}`);
+                    if (!cn(t) && -1 !== a.indexOf("/")) throw new Q(G.INVALID_ARGUMENT, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${s}() must be a plain document ID, but '${a}' contains a slash.`);
+                    const n = t.path.child(ht.fromString(a));
                     if (!dt.isDocumentKey(n)) throw new Q(G.INVALID_ARGUMENT, `Invalid query. When querying a collection group and ordering by 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 dt(n);
                     u.push(ye(e, i));
                 } else {
-                    const t = Ih(n, s, c);
+                    const t = Ih(n, s, a);
                     u.push(t);
                 }
             }
@@ -18819,13 +18819,13 @@ function tl(...t) {
 function nl(t, e, n) {
     if ("string" == typeof (n = getModularInstance(n))) {
         if ("" === n) throw new Q(G.INVALID_ARGUMENT, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!an(e) && -1 !== n.indexOf("/")) throw new Q(G.INVALID_ARGUMENT, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
+        if (!cn(e) && -1 !== n.indexOf("/")) throw new Q(G.INVALID_ARGUMENT, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
         const s = e.path.child(ht.fromString(n));
         if (!dt.isDocumentKey(s)) throw new Q(G.INVALID_ARGUMENT, `Invalid query. When querying a collection group by 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 ye(t, new dt(s));
     }
-    if (n instanceof ba) return ye(t, n._key);
-    throw new Q(G.INVALID_ARGUMENT, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${pa(n)}.`);
+    if (n instanceof bc) return ye(t, n._key);
+    throw new Q(G.INVALID_ARGUMENT, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${pc(n)}.`);
 }
 
 /**
@@ -18994,7 +18994,7 @@ class ol {
     s;
 }
 
-class cl extends ol {
+class al extends ol {
     constructor(t) {
         super(), this.firestore = t;
     }
@@ -19003,7 +19003,7 @@ class cl extends ol {
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new ba(this.firestore, /* converter= */ null, e);
+        return new bc(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -19030,7 +19030,7 @@ class cl extends ol {
  * 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 al {
+ */ class cl {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
@@ -19047,7 +19047,7 @@ class cl extends ol {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let r;
-        return r = "string" == typeof (e = getModularInstance(e)) || e instanceof Za ? ph(this._dataReader, "WriteBatch.update", i._key, e, n, s) : yh(this._dataReader, "WriteBatch.update", i._key, e), 
+        return r = "string" == typeof (e = getModularInstance(e)) || e instanceof Zc ? ph(this._dataReader, "WriteBatch.update", i._key, e, n, s) : yh(this._dataReader, "WriteBatch.update", i._key, e), 
         this._mutations.push(r.toMutation(i._key, $n.exists(!0))), this;
     }
     /**
@@ -19138,9 +19138,9 @@ function hl(t, e) {
  * current document contents.
  */
 function ll(t) {
-    t = Ia(t, ba);
-    const e = Ia(t.firestore, Fa);
-    return ua(La(e), t._key).then((n => bl(e, t, n)));
+    t = Ic(t, bc);
+    const e = Ic(t.firestore, Fc);
+    return uc(Lc(e), t._key).then((n => bl(e, t, n)));
 }
 
 class fl extends ol {
@@ -19152,7 +19152,7 @@ class fl extends ol {
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new ba(this.firestore, /* converter= */ null, e);
+        return new bc(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -19163,9 +19163,9 @@ class fl extends ol {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function dl(t) {
-    t = Ia(t, ba);
-    const e = Ia(t.firestore, Fa), n = La(e), s = new fl(e);
-    return oa(n, t._key).then((n => new kh(e, s, t._key, n, new Nh(null !== n && n.hasLocalMutations, 
+    t = Ic(t, bc);
+    const e = Ic(t.firestore, Fc), n = Lc(e), s = new fl(e);
+    return oc(n, t._key).then((n => new kh(e, s, t._key, n, new Nh(null !== n && n.hasLocalMutations, 
     /* fromCache= */ !0), t.converter)));
 }
 
@@ -19176,9 +19176,9 @@ class fl extends ol {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function _l(t) {
-    t = Ia(t, ba);
-    const e = Ia(t.firestore, Fa);
-    return ua(La(e), t._key, {
+    t = Ic(t, bc);
+    const e = Ic(t.firestore, Fc);
+    return uc(Lc(e), t._key, {
         source: "server"
     }).then((n => bl(e, t, n)));
 }
@@ -19193,9 +19193,9 @@ class fl extends ol {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function wl(t) {
-    t = Ia(t, Pa);
-    const e = Ia(t.firestore, Fa), n = La(e), s = new fl(e);
-    return Bh(t._query), aa(n, t._query).then((n => new Mh(e, s, t, n)));
+    t = Ic(t, Pc);
+    const e = Ic(t.firestore, Fc), n = Lc(e), s = new fl(e);
+    return Bh(t._query), cc(n, t._query).then((n => new Mh(e, s, t, n)));
 }
 
 /**
@@ -19204,9 +19204,9 @@ class fl extends ol {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function ml(t) {
-    t = Ia(t, Pa);
-    const e = Ia(t.firestore, Fa), n = La(e), s = new fl(e);
-    return ca(n, t._query).then((n => new Mh(e, s, t, n)));
+    t = Ic(t, Pc);
+    const e = Ic(t.firestore, Fc), n = Lc(e), s = new fl(e);
+    return ac(n, t._query).then((n => new Mh(e, s, t, n)));
 }
 
 /**
@@ -19215,27 +19215,27 @@ class fl extends ol {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function gl(t) {
-    t = Ia(t, Pa);
-    const e = Ia(t.firestore, Fa), n = La(e), s = new fl(e);
-    return aa(n, t._query, {
+    t = Ic(t, Pc);
+    const e = Ic(t.firestore, Fc), n = Lc(e), s = new fl(e);
+    return cc(n, t._query, {
         source: "server"
     }).then((n => new Mh(e, s, t, n)));
 }
 
 function yl(t, e, n) {
-    t = Ia(t, ba);
-    const s = Ia(t.firestore, Fa), i = ul(t.converter, e, n);
+    t = Ic(t, bc);
+    const s = Ic(t.firestore, Fc), i = ul(t.converter, e, n);
     return Rl(s, [ lh(hh(s), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, $n.none()) ]);
 }
 
 function pl(t, e, n, ...s) {
-    t = Ia(t, ba);
-    const i = Ia(t.firestore, Fa), r = hh(i);
+    t = Ic(t, bc);
+    const i = Ic(t.firestore, Fc), r = hh(i);
     let o;
     o = "string" == typeof (
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-    e = getModularInstance(e)) || e instanceof Za ? ph(r, "updateDoc", t._key, e, n, s) : yh(r, "updateDoc", t._key, e);
+    e = getModularInstance(e)) || e instanceof Zc ? ph(r, "updateDoc", t._key, e, n, s) : yh(r, "updateDoc", t._key, e);
     return Rl(i, [ o.toMutation(t._key, $n.exists(!0)) ]);
 }
 
@@ -19246,7 +19246,7 @@ function pl(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 Il(t) {
-    return Rl(Ia(t.firestore, Fa), [ new Yn(t._key, $n.none()) ]);
+    return Rl(Ic(t.firestore, Fc), [ new Yn(t._key, $n.none()) ]);
 }
 
 /**
@@ -19259,7 +19259,7 @@ function pl(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 Tl(t, e) {
-    const n = Ia(t.firestore, Fa), s = Da(t), i = ul(t.converter, e);
+    const n = Ic(t.firestore, Fc), s = Dc(t), i = ul(t.converter, e);
     return Rl(n, [ lh(hh(t.firestore), "addDoc", s._key, i, null !== t.converter, {}).toMutation(s._key, $n.exists(!1)) ]).then((() => s));
 }
 
@@ -19269,44 +19269,44 @@ function El(t, ...e) {
     let r = {
         includeMetadataChanges: !1
     }, o = 0;
-    "object" != typeof e[o] || ka(e[o]) || (r = e[o], o++);
+    "object" != typeof e[o] || kc(e[o]) || (r = e[o], o++);
     const u = {
         includeMetadataChanges: r.includeMetadataChanges
     };
-    if (ka(e[o])) {
+    if (kc(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, a, h;
-    if (t instanceof ba) a = Ia(t.firestore, Fa), h = rn(t._key.path), c = {
+    let a, c, h;
+    if (t instanceof bc) c = Ic(t.firestore, Fc), h = rn(t._key.path), a = {
         next: n => {
-            e[o] && e[o](bl(a, t, n));
+            e[o] && e[o](bl(c, t, n));
         },
         error: e[o + 1],
         complete: e[o + 2]
     }; else {
-        const n = Ia(t, Pa);
-        a = Ia(n.firestore, Fa), h = n._query;
-        const s = new fl(a);
-        c = {
+        const n = Ic(t, Pc);
+        c = Ic(n.firestore, Fc), h = n._query;
+        const s = new fl(c);
+        a = {
             next: t => {
-                e[o] && e[o](new Mh(a, s, n, t));
+                e[o] && e[o](new Mh(c, s, n, t));
             },
             error: e[o + 1],
             complete: e[o + 2]
         }, Bh(t._query);
     }
     return function(t, e, n, s) {
-        const i = new Gc(s), r = new Ju(e, i, n);
-        return t.asyncQueue.enqueueAndForget((async () => Qu(await sa(t), r))), () => {
-            i.Tc(), t.asyncQueue.enqueueAndForget((async () => ju(await sa(t), r)));
+        const i = new Ga(s), r = new Ju(e, i, n);
+        return t.asyncQueue.enqueueAndForget((async () => Qu(await sc(t), r))), () => {
+            i.Ia(), t.asyncQueue.enqueueAndForget((async () => ju(await sc(t), r)));
         };
-    }(La(a), h, u, c);
+    }(Lc(c), h, u, a);
 }
 
 function Al(t, e) {
-    return ha(La(t = Ia(t, Fa)), ka(e) ? e : {
+    return hc(Lc(t = Ic(t, Fc)), kc(e) ? e : {
         next: e
     });
 }
@@ -19317,8 +19317,8 @@ function Al(t, e) {
  */ function Rl(t, e) {
     return function(t, e) {
         const n = new j;
-        return t.asyncQueue.enqueueAndForget((async () => hc(await na(t), e, n))), n.promise;
-    }(La(t), e);
+        return t.asyncQueue.enqueueAndForget((async () => ha(await nc(t), e, n))), n.promise;
+    }(Lc(t), e);
 }
 
 /**
@@ -19362,7 +19362,7 @@ function Al(t, e) {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const e = hl(t, this._firestore), n = new cl(this._firestore);
+        const e = hl(t, this._firestore), n = new al(this._firestore);
         return this._transaction.lookup([ e._key ]).then((t => {
             if (!t || 1 !== t.length) return L();
             const s = t[0];
@@ -19380,7 +19380,7 @@ function Al(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 Za ? ph(this._dataReader, "Transaction.update", i._key, e, n, s) : yh(this._dataReader, "Transaction.update", i._key, e), 
+        return r = "string" == typeof (e = getModularInstance(e)) || e instanceof Zc ? ph(this._dataReader, "Transaction.update", i._key, e, n, s) : yh(this._dataReader, "Transaction.update", i._key, e), 
         this._transaction.update(i._key, r), this;
     }
     /**
@@ -19431,12 +19431,12 @@ function Al(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */ function vl(t, e, n) {
-    t = Ia(t, Fa);
+    t = Ic(t, Fc);
     const s = Object.assign(Object.assign({}, rl), n);
     !function(t) {
         if (t.maxAttempts < 1) throw new Q(G.INVALID_ARGUMENT, "Max attempts must be at least 1");
     }(s);
-    return la(La(t), (n => e(new Pl(t, n))), s);
+    return lc(Lc(t), (n => e(new Pl(t, n))), s);
 }
 
 /**
@@ -19551,7 +19551,7 @@ function Al(t, e) {
  * @returns A {@link WriteBatch} that can be used to atomically execute multiple
  * writes.
  */ function Nl(t) {
-    return La(t = Ia(t, Fa)), new al(t, (e => Rl(t, e)));
+    return Lc(t = Ic(t, Fc)), new cl(t, (e => Rl(t, e)));
 }
 
 /**
@@ -19570,7 +19570,7 @@ function Al(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */ function kl(t, e) {
-    La(t = Ia(t, Fa));
+    Lc(t = Ic(t, Fc));
     const n = "string" == typeof e ? function(t) {
         var e;
         try {
@@ -19606,14 +19606,14 @@ function Ol(t, e) {
     !function(t) {
         x = t;
     }(SDK_VERSION), _registerComponent(new Component("firestore", ((t, {options: n}) => {
-        const s = t.getProvider("app").getImmediate(), i = new Fa(s, new J(t.getProvider("auth-internal")), new tt(t.getProvider("app-check-internal")));
+        const s = t.getProvider("app").getImmediate(), i = new Fc(s, new J(t.getProvider("auth-internal")), new tt(t.getProvider("app-check-internal")));
         return n = Object.assign({
             useFetchStreams: e
         }, n), i._setSettings(n), i;
-    }), "PUBLIC")), registerVersion(D, "3.4.12-canary.39f4635eb", t), 
+    }), "PUBLIC")), registerVersion(D, "3.4.12-canary.f36d627af", t), 
     // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-    registerVersion(D, "3.4.12-canary.39f4635eb", "esm2017");
+    registerVersion(D, "3.4.12-canary.f36d627af", "esm2017");
 }();
 
-export { ol as AbstractUserDataWriter, eh as Bytes, Ma as CACHE_SIZE_UNLIMITED, va as CollectionReference, ba as DocumentReference, kh as DocumentSnapshot, Za as FieldPath, nh as FieldValue, Fa as Firestore, Q as FirestoreError, sh as GeoPoint, Oa as LoadBundleTask, Pa as Query, Lh as QueryConstraint, Oh as QueryDocumentSnapshot, Mh as QuerySnapshot, Nh as SnapshotMetadata, ut as Timestamp, Pl as Transaction, al as WriteBatch, re as _DatabaseId, dt as _DocumentKey, et as _EmptyAppCheckTokenProvider, z as _EmptyAuthCredentialsProvider, ft as _FieldPath, Ia as _cast, q as _debugAssert, Ht as _isBase64Available, $ as _logWarn, kl as _setIndexConfiguration, ma as _validateIsNotUsedTogether, Tl as addDoc, Cl as arrayRemove, Dl as arrayUnion, Qa as clearIndexedDbPersistence, Va as collection, Sa as collectionGroup, Ra as connectFirestoreEmulator, Il as deleteDoc, Vl as deleteField, za as disableNetwork, Da as doc, th as documentId, qa as enableIndexedDbPersistence, Ka as enableMultiTabIndexedDbPersistence, Wa as enableNetwork, tl as endAt, Zh as endBefore, La as ensureFirestoreConfigured, Rl as executeWrite, ll as getDoc, dl as getDocFromCache, _l as getDocFromServer, wl as getDocs, ml as getDocsFromCache, gl as getDocsFromServer, Ba as getFirestore, xl as increment, $a as initializeFirestore, Wh as limit, zh as limitToLast, Ja as loadBundle, Ya as namedQuery, El as onSnapshot, Al as onSnapshotsInSync, Qh as orderBy, Uh as query, xa as queryEqual, Ca as refEqual, vl as runTransaction, Sl as serverTimestamp, yl as setDoc, O as setLogLevel, $h as snapshotEqual, Yh as startAfter, Jh as startAt, Ha as terminate, pl as updateDoc, ja as waitForPendingWrites, Kh as where, Nl as writeBatch };
+export { ol as AbstractUserDataWriter, eh as Bytes, Mc as CACHE_SIZE_UNLIMITED, vc as CollectionReference, bc as DocumentReference, kh as DocumentSnapshot, Zc as FieldPath, nh as FieldValue, Fc as Firestore, Q as FirestoreError, sh as GeoPoint, Oc as LoadBundleTask, Pc as Query, Lh as QueryConstraint, Oh as QueryDocumentSnapshot, Mh as QuerySnapshot, Nh as SnapshotMetadata, ut as Timestamp, Pl as Transaction, cl as WriteBatch, re as _DatabaseId, dt as _DocumentKey, et as _EmptyAppCheckTokenProvider, z as _EmptyAuthCredentialsProvider, ft as _FieldPath, Ic as _cast, q as _debugAssert, Ht as _isBase64Available, $ as _logWarn, kl as _setIndexConfiguration, mc as _validateIsNotUsedTogether, Tl as addDoc, Cl as arrayRemove, Dl as arrayUnion, Qc as clearIndexedDbPersistence, Vc as collection, Sc as collectionGroup, Rc as connectFirestoreEmulator, Il as deleteDoc, Vl as deleteField, zc as disableNetwork, Dc as doc, th as documentId, qc as enableIndexedDbPersistence, Kc as enableMultiTabIndexedDbPersistence, Wc as enableNetwork, tl as endAt, Zh as endBefore, Lc as ensureFirestoreConfigured, Rl as executeWrite, ll as getDoc, dl as getDocFromCache, _l as getDocFromServer, wl as getDocs, ml as getDocsFromCache, gl as getDocsFromServer, Bc as getFirestore, xl as increment, $c as initializeFirestore, Wh as limit, zh as limitToLast, Jc as loadBundle, Yc as namedQuery, El as onSnapshot, Al as onSnapshotsInSync, Qh as orderBy, Uh as query, xc as queryEqual, Cc as refEqual, vl as runTransaction, Sl as serverTimestamp, yl as setDoc, O as setLogLevel, $h as snapshotEqual, Yh as startAfter, Jh as startAt, Hc as terminate, pl as updateDoc, jc as waitForPendingWrites, Kh as where, Nl as writeBatch };
 //# sourceMappingURL=index.esm2017.js.map