@firebase/firestore 3.4.0 → 3.4.1-canary.0db840a09

package/dist/index.rn.js

@@ -2,11 +2,11 @@ import { _getProvider, getApp as t, _removeServiceInstance as e, _registerCompon
 
 import { Component as r } from "@firebase/component";
 
-import { Logger as o, LogLevel as c } from "@firebase/logger";
+import { Logger as o, LogLevel as a } from "@firebase/logger";
 
-import { base64 as a, getUA as u, isIndexedDBAvailable as h, isSafari as l, isMobileCordova as f, isReactNative as d, isElectron as w, isIE as _, isUWP as m, isBrowserExtension as g, createMockUserToken as y, getModularInstance as p, deepEqual as T } from "@firebase/util";
+import { base64 as c, getUA as u, isIndexedDBAvailable as h, isSafari as l, isMobileCordova as f, isReactNative as d, isElectron as w, isIE as _, isUWP as m, isBrowserExtension as g, createMockUserToken as y, getModularInstance as p, deepEqual as T } from "@firebase/util";
 
-import { XhrIo as E, EventType as I, ErrorCode as A, createWebChannelTransport as R, getStatEventTarget as P, FetchXmlHttpFactory as b, WebChannel as v, Event as V, Stat as S } from "@firebase/webchannel-wrapper";
+import { XhrIo as E, EventType as I, ErrorCode as A, createWebChannelTransport as R, getStatEventTarget as b, FetchXmlHttpFactory as P, WebChannel as v, Event as V, Stat as S } from "@firebase/webchannel-wrapper";
 
 const D = "@firebase/firestore";
 
@@ -70,7 +70,7 @@ C.MOCK_USER = new C("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let N = "9.6.0";
+let N = "9.6.1-canary.0db840a09";
 
 /**
  * @license
@@ -112,14 +112,14 @@ function x() {
 }
 
 function F(t, ...e) {
-    if (k.logLevel <= c.DEBUG) {
+    if (k.logLevel <= a.DEBUG) {
         const n = e.map(L);
         k.debug(`Firestore (${N}): ${t}`, ...n);
     }
 }
 
 function O(t, ...e) {
-    if (k.logLevel <= c.ERROR) {
+    if (k.logLevel <= a.ERROR) {
         const n = e.map(L);
         k.error(`Firestore (${N}): ${t}`, ...n);
     }
@@ -128,7 +128,7 @@ function O(t, ...e) {
 /**
  * @internal
  */ function M(t, ...e) {
-    if (k.logLevel <= c.WARN) {
+    if (k.logLevel <= a.WARN) {
         const n = e.map(L);
         k.warn(`Firestore (${N}): ${t}`, ...n);
     }
@@ -742,7 +742,7 @@ function rt(t, e) {
 /**
  * Returns the immediate lexicographically-following string. This is useful to
  * construct an inclusive range for indexeddb iterators.
- */ function ct(t) {
+ */ function at(t) {
     // Return the input string, with an additional NUL byte appended.
     return t + "\0";
 }
@@ -778,7 +778,7 @@ function rt(t, e) {
  * For examples and further specifications, refer to the
  * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
  */
-class at {
+class ct {
     /**
      * Creates a new timestamp.
      *
@@ -810,7 +810,7 @@ class at {
      *
      * @returns a new timestamp representing the current date.
      */    static now() {
-        return at.fromMillis(Date.now());
+        return ct.fromMillis(Date.now());
     }
     /**
      * Creates a new timestamp from the given date.
@@ -819,7 +819,7 @@ class at {
      * @returns A new `Timestamp` representing the same point in time as the given
      *     date.
      */    static fromDate(t) {
-        return at.fromMillis(t.getTime());
+        return ct.fromMillis(t.getTime());
     }
     /**
      * Creates a new timestamp from the given number of milliseconds.
@@ -830,7 +830,7 @@ class at {
      *     number of milliseconds.
      */    static fromMillis(t) {
         const e = Math.floor(t / 1e3), n = Math.floor(1e6 * (t - 1e3 * e));
-        return new at(e, n);
+        return new ct(e, n);
     }
     /**
      * Converts a `Timestamp` to a JavaScript `Date` object. This conversion
@@ -916,7 +916,7 @@ class at {
         return new ut(t);
     }
     static min() {
-        return new ut(new at(0, 0));
+        return new ut(new ct(0, 0));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -1225,7 +1225,7 @@ function yt(t) {
     // We use `decodeStringToByteArray()` instead of `decodeString()` since
     // `decodeString()` returns Unicode strings, which doesn't match the values
     // returned by `atob()`'s Latin1 representation.
-    a.decodeStringToByteArray(t, false));
+    c.decodeStringToByteArray(t, false));
 }
 
 /** Converts a binary string to a Base64 encoded string. */
@@ -1285,7 +1285,7 @@ function pt() {
         return function(t) {
             const e = [];
             for (let n = 0; n < t.length; n++) e[n] = t.charCodeAt(n);
-            return a.encodeByteArray(e, !1);
+            return c.encodeByteArray(e, !1);
         }(this.binaryString);
     }
     toUint8Array() {
@@ -1404,7 +1404,7 @@ const Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *   FieldValueOptions to value().
  * - With respect to other ServerTimestampValues, they sort by their
  *   localWriteTime.
- */ function Pt(t) {
+ */ function bt(t) {
     var e, n;
     return "server_timestamp" === (null === (n = ((null === (e = null == t ? void 0 : t.mapValue) || void 0 === e ? void 0 : e.fields) || {}).__type__) || void 0 === n ? void 0 : n.stringValue);
 }
@@ -1418,16 +1418,16 @@ const Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * Preserving the previous values allows the user to display the last resoled
  * value until the backend responds with the timestamp.
  */
-function bt(t) {
+function Pt(t) {
     const e = t.mapValue.fields.__previous_value__;
-    return Pt(e) ? bt(e) : e;
+    return bt(e) ? Pt(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
  */ function vt(t) {
     const e = It(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new at(e.seconds, e.nanos);
+    return new ct(e.seconds, e.nanos);
 }
 
 /**
@@ -1537,7 +1537,7 @@ function Vt(t) {
  * limitations under the License.
  */
 /** Extracts the backend's type order for the provided value. */ function Nt(t) {
-    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Pt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : B();
+    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? bt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : B();
 }
 
 /** Tests `left` and `right` for equality based on the backend semantics. */ function kt(t, e) {
@@ -2014,7 +2014,7 @@ function Ut(t) {
     isEqual(t) {
         return t instanceof zt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
     }
-    clone() {
+    mutableCopy() {
         return new zt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
     }
     toString() {
@@ -2111,7 +2111,7 @@ class ee extends class {} {
     /**
      * Creates a filter based on the provided arguments.
      */    static create(t, e, n) {
-        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.P(t, e, n) : new se(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new ce(t, n) : "in" /* IN */ === e ? new ae(t, n) : "not-in" /* NOT_IN */ === e ? new ue(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new he(t, n) : new ee(t, e, n);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.P(t, e, n) : new se(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new ae(t, n) : "in" /* IN */ === e ? new ce(t, n) : "not-in" /* NOT_IN */ === e ? new ue(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new he(t, n) : new ee(t, e, n);
     }
     static P(t, e, n) {
         return "in" /* IN */ === e ? new ie(t, n) : new re(t, n);
@@ -2191,7 +2191,7 @@ function oe(t, e) {
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => Ct.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class ce extends ee {
+/** A Filter that implements the array-contains operator. */ class ae extends ee {
     constructor(t, e) {
         super(t, "array-contains" /* ARRAY_CONTAINS */ , e);
     }
@@ -2201,7 +2201,7 @@ function oe(t, e) {
     }
 }
 
-/** A Filter that implements the IN operator. */ class ae extends ee {
+/** A Filter that implements the IN operator. */ class ce extends ee {
     constructor(t, e) {
         super(t, "in" /* IN */ , e);
     }
@@ -2322,16 +2322,16 @@ function me(t, e) {
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
      */
-    constructor(t, e = null, n = [], s = [], i = null, r = "F" /* First */ , o = null, c = null) {
+    constructor(t, e = null, n = [], s = [], i = null, r = "F" /* First */ , o = null, a = null) {
         this.path = t, this.collectionGroup = e, this.explicitOrderBy = n, this.filters = s, 
-        this.limit = i, this.limitType = r, this.startAt = o, this.endAt = c, this.S = null, 
+        this.limit = i, this.limitType = r, this.startAt = o, this.endAt = a, this.S = null, 
         // The corresponding `Target` of this `Query` instance.
         this.D = null, this.startAt, this.endAt;
     }
 }
 
-/** Creates a new Query instance with the options provided. */ function ye(t, e, n, s, i, r, o, c) {
-    return new ge(t, e, n, s, i, r, o, c);
+/** Creates a new Query instance with the options provided. */ function ye(t, e, n, s, i, r, o, a) {
+    return new ge(t, e, n, s, i, r, o, a);
 }
 
 /** Creates a new Query for a query that matches all documents at `path` */ function pe(t) {
@@ -2376,7 +2376,7 @@ function Re(t) {
  * Returns the implicit order by constraint that is used to execute the Query,
  * which can be different from the order by constraints the user provided (e.g.
  * the SDK and backend always orders by `__name__`).
- */ function Pe(t) {
+ */ function be(t) {
     const e = K(t);
     if (null === e.S) {
         e.S = [];
@@ -2401,12 +2401,12 @@ function Re(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function be(t) {
+ */ function Pe(t) {
     const e = K(t);
-    if (!e.D) if ("F" /* First */ === e.limitType) e.D = Jt(e.path, e.collectionGroup, Pe(e), e.filters, e.limit, e.startAt, e.endAt); else {
+    if (!e.D) if ("F" /* First */ === e.limitType) e.D = Jt(e.path, e.collectionGroup, be(e), e.filters, e.limit, e.startAt, e.endAt); else {
         // Flip the orderBy directions since we want the last results
         const t = [];
-        for (const n of Pe(e)) {
+        for (const n of be(e)) {
             const e = "desc" /* DESCENDING */ === n.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
             t.push(new de(n.field, e));
         }
@@ -2423,18 +2423,18 @@ function ve(t, e, n) {
 }
 
 function Ve(t, e) {
-    return Zt(be(t), be(e)) && t.limitType === e.limitType;
+    return Zt(Pe(t), Pe(e)) && t.limitType === e.limitType;
 }
 
 // TODO(b/29183165): This is used to get a unique string from a query to, for
 // example, use as a dictionary key, but the implementation is subject to
 // collisions. Make it collision-free.
 function Se(t) {
-    return `${Yt(be(t))}|lt:${t.limitType}`;
+    return `${Yt(Pe(t))}|lt:${t.limitType}`;
 }
 
 function De(t) {
-    return `Query(target=${Xt(be(t))}; limitType=${t.limitType})`;
+    return `Query(target=${Xt(Pe(t))}; limitType=${t.limitType})`;
 }
 
 /** Returns whether `doc` matches the constraints of `query`. */ function Ce(t, e) {
@@ -2455,8 +2455,8 @@ function De(t) {
         return !0;
     }
     /** Makes sure a document is within the bounds, if provided. */ (t, e) && function(t, e) {
-        if (t.startAt && !_e(t.startAt, Pe(t), e)) return !1;
-        if (t.endAt && _e(t.endAt, Pe(t), e)) return !1;
+        if (t.startAt && !_e(t.startAt, be(t), e)) return !1;
+        if (t.endAt && _e(t.endAt, be(t), e)) return !1;
         return !0;
     }
     /**
@@ -2468,7 +2468,7 @@ function De(t) {
 function Ne(t) {
     return (e, n) => {
         let s = !1;
-        for (const i of Pe(t)) {
+        for (const i of be(t)) {
             const t = ke(i, e, n);
             if (0 !== t) return t;
             s = s || i.field.isKeyField();
@@ -2828,13 +2828,13 @@ class Ye {
  *     of the document.
  * @param mutationResult - The result of applying the mutation from the backend.
  */ function en(t, e, n) {
-    t instanceof cn ? function(t, e, n) {
+    t instanceof an ? function(t, e, n) {
         // Unlike setMutationApplyToLocalView, if we're applying a mutation to a
         // remote document the server has accepted the mutation so the precondition
         // must have held.
         const s = t.value.clone(), i = hn(t.fieldTransforms, e, n.transformResults);
         s.setAll(i), e.convertToFoundDocument(n.version, s).setHasCommittedMutations();
-    }(t, e, n) : t instanceof an ? function(t, e, n) {
+    }(t, e, n) : t instanceof cn ? function(t, e, n) {
         if (!Ze(t.precondition, e)) 
         // Since the mutation was not rejected, we know that the precondition
         // matched on the backend. We therefore must not have the expected version
@@ -2863,7 +2863,7 @@ class Ye {
  * @param localWriteTime - A timestamp indicating the local write time of the
  *     batch this mutation is a part of.
  */ function nn(t, e, n) {
-    t instanceof cn ? function(t, e, n) {
+    t instanceof an ? function(t, e, n) {
         if (!Ze(t.precondition, e)) 
         // The mutation failed to apply (e.g. a document ID created with add()
         // caused a name collision).
@@ -2883,7 +2883,7 @@ class Ye {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ (t, e, n) : t instanceof an ? function(t, e, n) {
+ */ (t, e, n) : t instanceof cn ? function(t, e, n) {
         if (!Ze(t.precondition, e)) return;
         const s = ln(t.fieldTransforms, n, e), i = e.data;
         i.setAll(un(t)), i.setAll(s), e.convertToFoundDocument(on(e), i).setHasLocalMutations();
@@ -2947,14 +2947,14 @@ function rn(t, e) {
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class cn extends tn {
+ */ class an extends tn {
     constructor(t, e, n, s = []) {
         super(), this.key = t, this.value = e, this.precondition = n, this.fieldTransforms = s, 
         this.type = 0 /* Set */;
     }
 }
 
-class an extends tn {
+class cn extends tn {
     constructor(t, e, n, s, i = []) {
         super(), this.key = t, this.data = e, this.fieldMask = n, this.precondition = s, 
         this.fieldTransforms = i, this.type = 1 /* Patch */;
@@ -2985,8 +2985,8 @@ function un(t) {
     const s = new Map;
     U(t.length === n.length);
     for (let i = 0; i < n.length; i++) {
-        const r = t[i], o = r.transform, c = e.data.field(r.field);
-        s.set(r.field, Le(o, c, n[i]));
+        const r = t[i], o = r.transform, a = e.data.field(r.field);
+        s.set(r.field, Le(o, a, n[i]));
     }
     return s;
 }
@@ -3680,14 +3680,14 @@ class An {
  * limitations under the License.
  */ const Rn = new pn(Ct.comparator);
 
-function Pn() {
+function bn() {
     return Rn;
 }
 
-const bn = new pn(Ct.comparator);
+const Pn = new pn(Ct.comparator);
 
 function vn() {
-    return bn;
+    return Pn;
 }
 
 const Vn = new pn(Ct.comparator);
@@ -3766,7 +3766,7 @@ function kn() {
     // PORTING NOTE: Multi-tab only
     static createSynthesizedRemoteEventForCurrentChange(t, e) {
         const n = new Map;
-        return n.set(t, $n.createSynthesizedTargetChangeForCurrentChange(t, e)), new xn(ut.min(), n, kn(), Pn(), Cn());
+        return n.set(t, $n.createSynthesizedTargetChangeForCurrentChange(t, e)), new xn(ut.min(), n, kn(), bn(), Cn());
     }
 }
 
@@ -3986,7 +3986,7 @@ class Bn {
         /** The internal state of all tracked targets. */
         this.nt = new Map, 
         /** Keeps track of the documents to update since the last raised snapshot. */
-        this.st = Pn(), 
+        this.st = bn(), 
         /** A mapping of document keys to their set of target IDs. */
         this.it = Un(), 
         /**
@@ -3999,8 +3999,8 @@ class Bn {
     /**
      * Processes and adds the DocumentWatchChange to the current set of changes.
      */    ot(t) {
-        for (const e of t.$) t.F && t.F.isFoundDocument() ? this.ct(e, t.F) : this.at(e, t.key, t.F);
-        for (const e of t.removedTargetIds) this.at(e, t.key, t.F);
+        for (const e of t.$) t.F && t.F.isFoundDocument() ? this.at(e, t.F) : this.ct(e, t.key, t.F);
+        for (const e of t.removedTargetIds) this.ct(e, t.key, t.F);
     }
     /** Processes and adds the WatchTargetChange to the current set of changes. */    ut(t) {
         this.forEachTarget(t, (e => {
@@ -4070,7 +4070,7 @@ class Bn {
                 // until it is resolved, essentially exposing inconsistency between
                 // queries.
                 const n = new Ct(t.path);
-                this.at(e, n, zt.newNoDocument(n, ut.min()));
+                this.ct(e, n, zt.newNoDocument(n, ut.min()));
             } else U(1 === n); else {
                 this._t(e) !== n && (
                 // Existence filter mismatch: We reset the mapping and raise a new
@@ -4097,7 +4097,7 @@ class Bn {
                     // instead resulting in an explicit delete message and we could
                     // remove this special logic.
                     const e = new Ct(i.target.path);
-                    null !== this.st.get(e) || this.yt(s, e) || this.at(s, e, zt.newNoDocument(e, t));
+                    null !== this.st.get(e) || this.yt(s, e) || this.ct(s, e, zt.newNoDocument(e, t));
                 }
                 n.j && (e.set(s, n.G()), n.H());
             }
@@ -4116,14 +4116,14 @@ class Bn {
             })), s && (n = n.add(t));
         }));
         const s = new xn(t, e, this.rt, this.st, n);
-        return this.st = Pn(), this.it = Un(), this.rt = new In(rt), s;
+        return this.st = bn(), this.it = Un(), this.rt = new In(rt), s;
     }
     /**
      * Adds the provided document to the internal list of document updates and
      * its document key to the given target's mapping.
      */
     // Visible for testing.
-    ct(t, e) {
+    at(t, e) {
         if (!this.lt(t)) return;
         const n = this.yt(t, e.key) ? 2 /* Modified */ : 0 /* Added */;
         this.ht(t).J(e.key, n), this.st = this.st.insert(e.key, e), this.it = this.it.insert(e.key, this.Tt(e.key).add(t));
@@ -4136,7 +4136,7 @@ class Bn {
      * to update the remote document cache.
      */
     // Visible for testing.
-    at(t, e, n) {
+    ct(t, e, n) {
         if (!this.lt(t)) return;
         const s = this.ht(t);
         this.yt(t, e) ? s.J(e, 1 /* Removed */) : 
@@ -4191,7 +4191,7 @@ class Bn {
      */    ft(t) {
         this.nt.set(t, new Ln);
         this.et.getRemoteKeysForTarget(t).forEach((e => {
-            this.at(t, e, /*updatedDocument=*/ null);
+            this.ct(t, e, /*updatedDocument=*/ null);
         }));
     }
     /**
@@ -4298,7 +4298,7 @@ function Gn(t, e) {
 function Hn(t) {
     return U(!!t), ut.fromTimestamp(function(t) {
         const e = It(t);
-        return new at(e.seconds, e.nanos);
+        return new ct(e.seconds, e.nanos);
     }(t));
 }
 
@@ -4310,7 +4310,7 @@ function Jn(t, e) {
 
 function Yn(t) {
     const e = wt.fromString(t);
-    return U(Ps(e)), e;
+    return U(bs(e)), e;
 }
 
 function Xn(t, e) {
@@ -4377,7 +4377,7 @@ function os(t, e) {
     }(t, e) : B();
 }
 
-function cs(t, e) {
+function as(t, e) {
     let n;
     if ("targetChange" in e) {
         e.targetChange;
@@ -4388,7 +4388,7 @@ function cs(t, e) {
         }(e.targetChange.targetChangeType || "NO_CHANGE"), i = e.targetChange.targetIds || [], r = function(t, e) {
             return t.C ? (U(void 0 === e || "string" == typeof e), Tt.fromBase64String(e || "")) : (U(void 0 === e || e instanceof Uint8Array), 
             Tt.fromUint8Array(e || new Uint8Array));
-        }(t, e.targetChange.resumeToken), o = e.targetChange.cause, c = o && function(t) {
+        }(t, e.targetChange.resumeToken), o = e.targetChange.cause, a = o && function(t) {
             const e = void 0 === t.code ? j.UNKNOWN : yn(t.code);
             return new Q(e, t.message || "");
         }
@@ -4400,7 +4400,7 @@ function cs(t, e) {
  * our generated proto interfaces say Int32Value must be. But GRPC actually
  * expects a { value: <number> } struct.
  */ (o);
-        n = new Mn(s, i, r, c || null);
+        n = new Mn(s, i, r, a || null);
     } else if ("documentChange" in e) {
         e.documentChange;
         const s = e.documentChange;
@@ -4409,14 +4409,14 @@ function cs(t, e) {
             mapValue: {
                 fields: s.document.fields
             }
-        }), c = zt.newFoundDocument(i, r, o), a = s.targetIds || [], u = s.removedTargetIds || [];
-        n = new Fn(a, u, c.key, c);
+        }), a = zt.newFoundDocument(i, r, o), c = s.targetIds || [], u = s.removedTargetIds || [];
+        n = new Fn(c, u, a.key, a);
     } else if ("documentDelete" in e) {
         e.documentDelete;
         const s = e.documentDelete;
         s.document;
-        const i = Zn(t, s.document), r = s.readTime ? Hn(s.readTime) : ut.min(), o = zt.newNoDocument(i, r), c = s.removedTargetIds || [];
-        n = new Fn([], c, o.key, o);
+        const i = Zn(t, s.document), r = s.readTime ? Hn(s.readTime) : ut.min(), o = zt.newNoDocument(i, r), a = s.removedTargetIds || [];
+        n = new Fn([], a, o.key, o);
     } else if ("documentRemove" in e) {
         e.documentRemove;
         const s = e.documentRemove;
@@ -4436,13 +4436,13 @@ function cs(t, e) {
     return n;
 }
 
-function as(t, e) {
+function cs(t, e) {
     let n;
-    if (e instanceof cn) n = {
+    if (e instanceof an) n = {
         update: is(t, e.key, e.value)
     }; else if (e instanceof fn) n = {
         delete: Xn(t, e.key)
-    }; else if (e instanceof an) n = {
+    }; else if (e instanceof cn) n = {
         update: is(t, e.key, e.data),
         updateMask: Rs(e.fieldMask)
     }; else {
@@ -4510,9 +4510,9 @@ function us(t, e) {
                 const e = t.fieldPaths || [];
                 return new gt(e.map((t => mt.fromServerFormat(t))));
             }(e.updateMask);
-            return new an(i, r, t, n, s);
+            return new cn(i, r, t, n, s);
         }
-        return new cn(i, r, n, s);
+        return new an(i, r, n, s);
     }
     if (e.delete) {
         const s = Zn(t, e.delete);
@@ -4659,15 +4659,15 @@ function ds(t) {
         // visible for testing
         (t.direction));
     }(t))));
-    let c = null;
-    n.limit && (c = function(t) {
+    let a = null;
+    n.limit && (a = function(t) {
         let e;
         return e = "object" == typeof t ? t.value : t, Vt(e) ? null : e;
     }(n.limit));
-    let a = null;
-    n.startAt && (a = gs(n.startAt));
+    let c = null;
+    n.startAt && (c = gs(n.startAt));
     let u = null;
-    return n.endAt && (u = gs(n.endAt)), ye(e, i, o, r, c, "F" /* First */ , a, u);
+    return n.endAt && (u = gs(n.endAt)), ye(e, i, o, r, a, "F" /* First */ , c, u);
 }
 
 function ws(t, e) {
@@ -4803,7 +4803,7 @@ function Rs(t) {
     };
 }
 
-function Ps(t) {
+function bs(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -4827,7 +4827,7 @@ function Ps(t) {
 /**
  * Encodes a resource path into a IndexedDb-compatible string form.
  */
-function bs(t) {
+function Ps(t) {
     let e = "";
     for (let n = 0; n < t.length; n++) e.length > 0 && (e = Vs(e)), e = vs(t.get(n), e);
     return Vs(e);
@@ -5091,13 +5091,13 @@ class xs {
      * Creates a [userId, encodedPath] key for use in the DbDocumentMutations
      * index to iterate over all at document mutations for a given path or lower.
      */    static prefixForPath(t, e) {
-        return [ t, bs(e) ];
+        return [ t, Ps(e) ];
     }
     /**
      * Creates a full index key of [userId, encodedPath, batchId] for inserting
      * and deleting into the DbDocumentMutations index.
      */    static key(t, e, n) {
-        return [ t, bs(e), n ];
+        return [ t, Ps(e), n ];
     }
 }
 
@@ -5708,12 +5708,12 @@ class Js {
         // bug we're checking for should exist in iOS >= 12.2 and < 13, but for
         // whatever reason it's much harder to hit after 12.2 so we only proactively
         // log on 12.2.
-        12.2 === Ys.Pt(u()) && O("Firestore persistence suffers from a bug in iOS 12.2 Safari that may cause your app to stop working. See https://stackoverflow.com/q/56496296/110915 for details and a potential workaround.");
+        12.2 === Ys.bt(u()) && O("Firestore persistence suffers from a bug in iOS 12.2 Safari that may cause your app to stop working. See https://stackoverflow.com/q/56496296/110915 for details and a potential workaround.");
     }
     /** Deletes the specified database. */    static delete(t) {
         return F("SimpleDb", "Removing database:", t), ni(window.indexedDB.deleteDatabase(t)).toPromise();
     }
-    /** Returns true if IndexedDB is available in the current environment. */    static bt() {
+    /** Returns true if IndexedDB is available in the current environment. */    static Pt() {
         if (!h()) return !1;
         if (Ys.vt()) return !0;
         // We extensively use indexed array values and compound keys,
@@ -5723,7 +5723,7 @@ class Js {
         // For tracking support of this feature, see here:
         // https://developer.microsoft.com/en-us/microsoft-edge/platform/status/indexeddbarraysandmultientrysupport/
         // Check the UA string to find out the browser.
-                const t = u(), e = Ys.Pt(t), n = 0 < e && e < 10, s = Ys.Vt(t), i = 0 < s && s < 4.5;
+                const t = u(), e = Ys.bt(t), n = 0 < e && e < 10, s = Ys.Vt(t), i = 0 < s && s < 4.5;
         // IE 10
         // ua = 'Mozilla/5.0 (compatible; MSIE 10.0; Windows NT 6.2; Trident/6.0)';
         // IE 11
@@ -5746,7 +5746,7 @@ class Js {
     }
     // visible for testing
     /** Parse User Agent to determine iOS version. Returns -1 if not found. */
-    static Pt(t) {
+    static bt(t) {
         const e = t.match(/i(?:phone|pad|pod) os ([\d_]+)/i), n = e ? e[1].split("_").slice(0, 2).join(".") : "-1";
         return Number(n);
     }
@@ -6016,7 +6016,7 @@ class Js {
 let si = !1;
 
 function ii(t) {
-    const e = Ys.Pt(u());
+    const e = Ys.bt(u());
     if (e >= 12.2 && e < 13) {
         const e = "An internal error was encountered in the Indexed Database server";
         if (t.message.indexOf(e) >= 0) {
@@ -6077,7 +6077,7 @@ function oi(t, e) {
  */
 /**
  * A batch of mutations that will be sent as one unit to the backend.
- */ class ci {
+ */ class ai {
     /**
      * @param batchId - The unique ID of this mutation batch.
      * @param localWriteTime - The original write time of this mutation.
@@ -6142,7 +6142,7 @@ function oi(t, e) {
     }
 }
 
-/** The result of applying a mutation batch to the backend. */ class ai {
+/** The result of applying a mutation batch to the backend. */ class ci {
     constructor(t, e, n, 
     /**
      * A pre-computed mapping from each mutated document to the resulting
@@ -6160,7 +6160,7 @@ function oi(t, e) {
         let s = Sn();
         const i = t.mutations;
         for (let t = 0; t < i.length; t++) s = s.insert(i[t].key, n[t].version);
-        return new ai(t, e, n, s);
+        return new ci(t, e, n, s);
     }
 }
 
@@ -6301,7 +6301,7 @@ function di(t) {
 }
 
 function wi(t) {
-    const e = new at(t[0], t[1]);
+    const e = new ct(t[0], t[1]);
     return ut.fromTimestamp(e);
 }
 
@@ -6311,7 +6311,7 @@ function _i(t) {
 }
 
 function mi(t) {
-    const e = new at(t.seconds, t.nanoseconds);
+    const e = new ct(t.seconds, t.nanoseconds);
     return ut.fromTimestamp(e);
 }
 
@@ -6332,8 +6332,8 @@ function gi(t, e) {
             ++t;
         }
     }
-    const s = e.mutations.map((e => us(t.Gt, e))), i = at.fromMillis(e.localWriteTimeMs);
-    return new ci(e.batchId, i, n, s);
+    const s = e.mutations.map((e => us(t.Gt, e))), i = ct.fromMillis(e.localWriteTimeMs);
+    return new ai(e.batchId, i, n, s);
 }
 
 /** Decodes a DbTarget into TargetData */ function yi(t) {
@@ -6341,8 +6341,8 @@ function gi(t, e) {
     let s;
     var i;
     return void 0 !== t.query.documents ? (U(1 === (i = t.query).documents.length), 
-    s = be(pe(es(i.documents[0])))) : s = function(t) {
-        return be(ds(t));
+    s = Pe(pe(es(i.documents[0])))) : s = function(t) {
+        return Pe(ds(t));
     }(t.query), new ui(s, t.targetId, 0 /* Listen */ , t.lastListenSequenceNumber, e, n, Tt.fromBase64String(t.resumeToken));
 }
 
@@ -6464,7 +6464,7 @@ class Ei {
  * An in-memory implementation of IndexManager.
  */ class Ri {
     constructor() {
-        this.zt = new Pi;
+        this.zt = new bi;
     }
     addToCollectionParentIndex(t, e) {
         return this.zt.add(e), Hs.resolve();
@@ -6478,7 +6478,7 @@ class Ei {
  * Internal implementation of the collection-parent index exposed by MemoryIndexManager.
  * Also used for in-memory caching by IndexedDbIndexManager and initial index population
  * in indexeddb_schema.ts
- */ class Pi {
+ */ class bi {
     constructor() {
         this.index = {};
     }
@@ -6514,7 +6514,7 @@ class Ei {
  */
 /**
  * A persisted implementation of IndexManager.
- */ class bi {
+ */ class Pi {
     constructor() {
         /**
          * An in-memory copy of the index entries we've already written since the SDK
@@ -6523,7 +6523,7 @@ class Ei {
          * This is *NOT* a complete cache of what's in persistence and so can never be used to
          * satisfy reads.
          */
-        this.Ht = new Pi;
+        this.Ht = new bi;
     }
     /**
      * Adds a new entry to the collection parent index.
@@ -6541,14 +6541,14 @@ class Ei {
             }));
             const i = {
                 collectionId: n,
-                parent: bs(s)
+                parent: Ps(s)
             };
             return vi(t).put(i);
         }
         return Hs.resolve();
     }
     getCollectionParents(t, e) {
-        const n = [], s = IDBKeyRange.bound([ e, "" ], [ ct(e), "" ], 
+        const n = [], s = IDBKeyRange.bound([ e, "" ], [ at(e), "" ], 
         /*lowerOpen=*/ !1, 
         /*upperOpen=*/ !0);
         return vi(t).Bt(s).next((t => {
@@ -6633,12 +6633,12 @@ class Si {
  */
 function Di(t, e, n) {
     const s = t.store(ks.store), i = t.store(xs.store), r = [], o = IDBKeyRange.only(n.batchId);
-    let c = 0;
-    const a = s.jt({
+    let a = 0;
+    const c = s.jt({
         range: o
-    }, ((t, e, n) => (c++, n.delete())));
-    r.push(a.next((() => {
-        U(1 === c);
+    }, ((t, e, n) => (a++, n.delete())));
+    r.push(c.next((() => {
+        U(1 === a);
     })));
     const u = [];
     for (const t of n.mutations) {
@@ -6738,20 +6738,20 @@ class Ni {
         // eslint-disable-next-line @typescript-eslint/no-explicit-any
         return r.add({}).next((o => {
             U("number" == typeof o);
-            const c = new ci(o, e, n, s), a = function(t, e, n) {
-                const s = n.baseMutations.map((e => as(t.Gt, e))), i = n.mutations.map((e => as(t.Gt, e)));
+            const a = new ai(o, e, n, s), c = function(t, e, n) {
+                const s = n.baseMutations.map((e => cs(t.Gt, e))), i = n.mutations.map((e => cs(t.Gt, e)));
                 return new ks(e, n.batchId, n.localWriteTime.toMillis(), s, i);
-            }(this.k, this.userId, c), u = [];
+            }(this.k, this.userId, a), u = [];
             let h = new In(((t, e) => rt(t.canonicalString(), e.canonicalString())));
             for (const t of s) {
                 const e = xs.key(this.userId, t.key.path, o);
-                h = h.add(t.key.path.popLast()), u.push(r.put(a)), u.push(i.put(e, xs.PLACEHOLDER));
+                h = h.add(t.key.path.popLast()), u.push(r.put(c)), u.push(i.put(e, xs.PLACEHOLDER));
             }
             return h.forEach((e => {
                 u.push(this.Jt.addToCollectionParentIndex(t, e));
             })), t.addOnCommittedListener((() => {
-                this.Yt[o] = c.keys();
-            })), Hs.waitFor(u).next((() => c));
+                this.Yt[o] = a.keys();
+            })), Hs.waitFor(u).next((() => a));
         }));
     }
     lookupMutationBatch(t, e) {
@@ -6805,7 +6805,7 @@ class Ni {
         return $i(t).jt({
             range: s
         }, ((n, s, r) => {
-            const [o, c, a] = n, u = Ss(c);
+            const [o, a, c] = n, u = Ss(a);
             // 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
@@ -6815,7 +6815,7 @@ class Ni {
             // can stop as soon as we hit any such row.
                         if (o === this.userId && e.path.isEqual(u)) 
             // Look up the mutation batch in the store.
-            return xi(t).get(a).next((t => {
+            return xi(t).get(c).next((t => {
                 if (!t) throw B();
                 U(t.userId === this.userId), i.push(gi(this.k, t));
             }));
@@ -6829,7 +6829,7 @@ class Ni {
             const i = xs.prefixForPath(this.userId, e.path), r = IDBKeyRange.lowerBound(i), o = $i(t).jt({
                 range: r
             }, ((t, s, i) => {
-                const [r, o, c] = t, a = Ss(o);
+                const [r, o, a] = t, c = Ss(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
@@ -6837,7 +6837,7 @@ class Ni {
                 // 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(a) ? n = n.add(c) : i.done();
+                                r === this.userId && e.path.isEqual(c) ? n = n.add(a) : i.done();
             }));
             s.push(o);
         })), Hs.waitFor(s).next((() => this.te(t, n)));
@@ -6851,14 +6851,14 @@ class Ni {
         return $i(t).jt({
             range: r
         }, ((t, e, i) => {
-            const [r, c, a] = t, u = Ss(c);
+            const [r, a, c] = t, u = Ss(a);
             r === this.userId && n.isPrefixOf(u) ? 
             // Rows with document keys more than one segment longer than the
             // query path can't be matches. For example, a query on 'rooms'
             // can't match the document /rooms/abc/messages/xyx.
             // TODO(mcg): we'll need a different scanner when we implement
             // ancestor queries.
-            u.length === s && (o = o.add(a)) : i.done();
+            u.length === s && (o = o.add(c)) : i.done();
         })).next((() => this.te(t, o)));
     }
     te(t, e) {
@@ -6927,8 +6927,8 @@ class Ni {
         range: r,
         Kt: !0
     }, ((t, n, s) => {
-        const [r, c, /*batchID*/ a] = t;
-        r === e && c === i && (o = !0), s.done();
+        const [r, a, /*batchID*/ c] = t;
+        r === e && a === i && (o = !0), s.done();
     })).next((() => o));
 }
 
@@ -7031,29 +7031,29 @@ class Oi {
     allocateTargetId(t) {
         return this.oe(t).next((e => {
             const n = new Oi(e.highestTargetId);
-            return e.highestTargetId = n.next(), this.ce(t, e).next((() => e.highestTargetId));
+            return e.highestTargetId = n.next(), this.ae(t, e).next((() => e.highestTargetId));
         }));
     }
     getLastRemoteSnapshotVersion(t) {
-        return this.oe(t).next((t => ut.fromTimestamp(new at(t.lastRemoteSnapshotVersion.seconds, t.lastRemoteSnapshotVersion.nanoseconds))));
+        return this.oe(t).next((t => ut.fromTimestamp(new ct(t.lastRemoteSnapshotVersion.seconds, t.lastRemoteSnapshotVersion.nanoseconds))));
     }
     getHighestSequenceNumber(t) {
         return this.oe(t).next((t => t.highestListenSequenceNumber));
     }
     setTargetsMetadata(t, e, n) {
         return this.oe(t).next((s => (s.highestListenSequenceNumber = e, n && (s.lastRemoteSnapshotVersion = n.toTimestamp()), 
-        e > s.highestListenSequenceNumber && (s.highestListenSequenceNumber = e), this.ce(t, s))));
+        e > s.highestListenSequenceNumber && (s.highestListenSequenceNumber = e), this.ae(t, s))));
     }
     addTargetData(t, e) {
-        return this.ae(t, e).next((() => this.oe(t).next((n => (n.targetCount += 1, this.ue(e, n), 
-        this.ce(t, n))))));
+        return this.ce(t, e).next((() => this.oe(t).next((n => (n.targetCount += 1, this.ue(e, n), 
+        this.ae(t, n))))));
     }
     updateTargetData(t, e) {
-        return this.ae(t, e);
+        return this.ce(t, e);
     }
     removeTargetData(t, e) {
         return this.removeMatchingKeysForTargetId(t, e.targetId).next((() => Li(t).delete(e.targetId))).next((() => this.oe(t))).next((e => (U(e.targetCount > 0), 
-        e.targetCount -= 1, this.ce(t, e))));
+        e.targetCount -= 1, this.ae(t, e))));
     }
     /**
      * Drops any targets with sequence number less than or equal to the upper bound, excepting those
@@ -7063,8 +7063,8 @@ class Oi {
         let s = 0;
         const i = [];
         return Li(t).jt(((r, o) => {
-            const c = yi(o);
-            c.sequenceNumber <= e && null === n.get(c.targetId) && (s++, i.push(this.removeTargetData(t, c)));
+            const a = yi(o);
+            a.sequenceNumber <= e && null === n.get(a.targetId) && (s++, i.push(this.removeTargetData(t, a)));
         })).next((() => Hs.waitFor(i))).next((() => s));
     }
     /**
@@ -7078,10 +7078,10 @@ class Oi {
     oe(t) {
         return Bi(t).get(Us.key).next((t => (U(null !== t), t)));
     }
-    ce(t, e) {
+    ae(t, e) {
         return Bi(t).put(Us.key, e);
     }
-    ae(t, e) {
+    ce(t, e) {
         return Li(t).put(pi(this.k, e));
     }
     /**
@@ -7118,7 +7118,7 @@ class Oi {
         // IndexedDb.
         const s = [], i = Ui(t);
         return e.forEach((e => {
-            const r = bs(e.path);
+            const r = Ps(e.path);
             s.push(i.put(new Bs(n, r))), s.push(this.referenceDelegate.addReference(t, n, e));
         })), Hs.waitFor(s);
     }
@@ -7127,7 +7127,7 @@ class Oi {
         // IndexedDb.
         const s = Ui(t);
         return Hs.forEach(e, (e => {
-            const i = bs(e.path);
+            const i = Ps(e.path);
             return Hs.waitFor([ s.delete([ n, i ]), this.referenceDelegate.removeReference(t, n, e) ]);
         }));
     }
@@ -7151,7 +7151,7 @@ class Oi {
         })).next((() => i));
     }
     containsKey(t, e) {
-        const n = bs(e.path), s = IDBKeyRange.bound([ n ], [ ct(n) ], 
+        const n = Ps(e.path), s = IDBKeyRange.bound([ n ], [ at(n) ], 
         /*lowerOpen=*/ !1, 
         /*upperOpen=*/ !0);
         let i = 0;
@@ -7333,16 +7333,16 @@ class Oi {
         return this.ge.getCacheSize(t);
     }
     Te(t, e) {
-        let n, s, i, r, o, a, u;
+        let n, s, i, r, o, c, u;
         const h = Date.now();
         return this.calculateTargetCount(t, this.params.percentileToCollect).next((e => (
         // Cap at the configured max
         e > this.params.maximumSequenceNumbersToCollect ? (F("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, a = Date.now(), 
+        o = Date.now(), this.removeTargets(t, n, e)))).next((e => (i = e, c = Date.now(), 
         this.removeOrphanedDocuments(t, n)))).next((t => {
-            if (u = Date.now(), x() <= c.DEBUG) {
-                F("LruGarbageCollector", `LRU Garbage Collection\n\tCounted targets in ${r - h}ms\n\tDetermined least recently used ${s} in ` + (o - r) + "ms\n" + `\tRemoved ${i} targets in ` + (a - o) + "ms\n" + `\tRemoved ${t} documents in ` + (u - a) + "ms\n" + `Total Duration: ${u - h}ms`);
+            if (u = Date.now(), x() <= a.DEBUG) {
+                F("LruGarbageCollector", `LRU Garbage Collection\n\tCounted targets in ${r - h}ms\n\tDetermined least recently used ${s} in ` + (o - r) + "ms\n" + `\tRemoved ${i} targets in ` + (c - o) + "ms\n" + `\tRemoved ${t} documents in ` + (u - c) + "ms\n" + `Total Duration: ${u - h}ms`);
             }
             return Hs.resolve({
                 didRun: !0,
@@ -7425,7 +7425,7 @@ class Gi {
                     if (!e) 
                     // Our size accounting requires us to read all documents before
                     // removing them.
-                    return i++, n.getEntry(t, r).next((() => (n.removeEntry(r), Ui(t).delete([ 0, bs(r.path) ]))));
+                    return i++, n.getEntry(t, r).next((() => (n.removeEntry(r), Ui(t).delete([ 0, Ps(r.path) ]))));
                 }));
                 s.push(e);
             }
@@ -7480,7 +7480,7 @@ function zi(t, e) {
  * store.
  */
     function(t, e) {
-        return new Bs(0, bs(t.path), e);
+        return new Bs(0, Ps(t.path), e);
     }(e, t.currentSequenceNumber));
 }
 
@@ -7699,23 +7699,23 @@ function zi(t, e) {
         return this.getMetadata(t).next((n => (n.byteSize += e, this.Re(t, n))));
     }
     getEntry(t, e) {
-        return tr(t).get(er(e)).next((t => this.Pe(e, t)));
+        return tr(t).get(er(e)).next((t => this.be(e, t)));
     }
     /**
      * Looks up an entry in the cache.
      *
      * @param documentKey - The key of the entry to look up.
      * @returns The cached document entry and its size.
-     */    be(t, e) {
+     */    Pe(t, e) {
         return tr(t).get(er(e)).next((t => ({
-            document: this.Pe(e, t),
+            document: this.be(e, t),
             size: Ci(t)
         })));
     }
     getEntries(t, e) {
-        let n = Pn();
+        let n = bn();
         return this.ve(t, e, ((t, e) => {
-            const s = this.Pe(t, e);
+            const s = this.be(t, e);
             n = n.insert(t, s);
         })).next((() => n));
     }
@@ -7726,9 +7726,9 @@ function zi(t, e) {
      * @returns A map of documents indexed by key and a map of sizes indexed by
      *     key (zero if the document does not exist).
      */    Ve(t, e) {
-        let n = Pn(), s = new pn(Ct.comparator);
+        let n = bn(), s = new pn(Ct.comparator);
         return this.ve(t, e, ((t, e) => {
-            const i = this.Pe(t, e);
+            const i = this.be(t, e);
             n = n.insert(t, i), s = s.insert(t, Ci(e));
         })).next((() => ({
             documents: n,
@@ -7757,7 +7757,7 @@ function zi(t, e) {
         }));
     }
     getDocumentsMatchingQuery(t, e, n) {
-        let s = Pn();
+        let s = bn();
         const i = e.path.length + 1, r = {};
         if (n.isEqual(ut.min())) {
             // Documents are ordered by key, so we can use a prefix scan to narrow
@@ -7798,7 +7798,7 @@ function zi(t, e) {
     /**
      * Decodes `remoteDoc` and returns the document (or null, if the document
      * corresponds to the format used for sentinel deletes).
-     */    Pe(t, e) {
+     */    be(t, e) {
         if (e) {
             const t = li(this.k, e);
             // Whether the document is a sentinel removal and should only be used in the
@@ -7839,10 +7839,10 @@ class Xi extends Ji {
         return this.changes.forEach(((i, r) => {
             const o = this.Ce.get(i);
             if (r.document.isValidDocument()) {
-                const c = fi(this.De.k, r.document, this.getReadTime(i));
+                const a = fi(this.De.k, r.document, this.getReadTime(i));
                 s = s.add(i.path.popLast());
-                const a = Ci(c);
-                n += a - o, e.push(this.De.addEntry(t, i, c));
+                const c = Ci(a);
+                n += c - o, e.push(this.De.addEntry(t, i, a));
             } else if (n -= o, this.trackRemovals) {
                 // In order to track removals, we store a "sentinel delete" in the
                 // RemoteDocumentCache. This entry is represented by a NoDocument
@@ -7857,7 +7857,7 @@ class Xi extends Ji {
     }
     getFromCache(t, e) {
         // Record the size of everything we load from the cache so we can compute a delta later.
-        return this.De.be(t, e).next((t => (this.Ce.set(e, t.size), t.document)));
+        return this.De.Pe(t, e).next((t => (this.Ce.set(e, t.size), t.document)));
     }
     getAllFromCache(t, e) {
         // Record the size of everything we load from the cache so we can compute
@@ -8057,9 +8057,9 @@ function er(t) {
             const s = [];
             return n.jt(((n, i) => {
                 const r = new wt(n), o = function(t) {
-                    return [ 0, bs(t) ];
+                    return [ 0, Ps(t) ];
                 }(r);
-                s.push(e.get(o).next((n => n ? Hs.resolve() : (n => e.put(new Bs(0, bs(n), t.highestListenSequenceNumber)))(r))));
+                s.push(e.get(o).next((n => n ? Hs.resolve() : (n => e.put(new Bs(0, Ps(n), t.highestListenSequenceNumber)))(r))));
             })).next((() => Hs.waitFor(s)));
         }));
     }
@@ -8068,12 +8068,12 @@ function er(t) {
         t.createObjectStore(qs.store, {
             keyPath: qs.keyPath
         });
-        const n = e.store(qs.store), s = new Pi, i = t => {
+        const n = e.store(qs.store), s = new bi, i = t => {
             if (s.add(t)) {
                 const e = t.lastSegment(), s = t.popLast();
                 return n.put({
                     collectionId: e,
-                    parent: bs(s)
+                    parent: Ps(s)
                 });
             }
         };
@@ -8172,14 +8172,14 @@ class rr {
      * Whether to synchronize the in-memory state of multiple tabs and share
      * access to local persistence.
      */
-    t, e, n, s, i, r, o, c, a, 
+    t, e, n, s, i, r, o, a, c, 
     /**
      * If set to true, forcefully obtains database access. Existing tabs will
      * no longer be able to access IndexedDB.
      */
     u) {
         if (this.allowTabSynchronization = t, this.persistenceKey = e, this.clientId = n, 
-        this.Oe = i, this.window = r, this.document = o, this.Me = a, this.Le = u, this.Be = null, 
+        this.Oe = i, this.window = r, this.document = o, this.Me = c, this.Le = u, this.Be = null, 
         this.Ue = !1, this.isPrimary = !1, this.networkEnabled = !0, 
         /** Our window.unload handler, if registered. */
         this.qe = null, this.inForeground = !1, 
@@ -8190,10 +8190,10 @@ class rr {
         /** The last time we garbage collected the client metadata object store. */
         this.Qe = Number.NEGATIVE_INFINITY, 
         /** A listener to notify on primary state changes. */
-        this.We = t => Promise.resolve(), !rr.bt()) throw new Q(j.UNIMPLEMENTED, "This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.");
-        this.referenceDelegate = new Gi(this, s), this.Ge = e + "main", this.k = new hi(c), 
+        this.We = t => Promise.resolve(), !rr.Pt()) throw new Q(j.UNIMPLEMENTED, "This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.");
+        this.referenceDelegate = new Gi(this, s), this.Ge = e + "main", this.k = new hi(a), 
         this.ze = new Ys(this.Ge, 11, new nr(this.k)), this.He = new Mi(this.referenceDelegate, this.k), 
-        this.Jt = new bi, this.Je = function(t, e) {
+        this.Jt = new Pi, this.Je = function(t, e) {
             return new Yi(t, e);
         }
         /**
@@ -8265,11 +8265,11 @@ class rr {
      * primary state listener if the client either newly obtained or released its
      * primary lease.
      */    Ze() {
-        return this.runTransaction("updateClientMetadataAndTryBecomePrimary", "readwrite", (t => cr(t).put(new Ks(this.clientId, Date.now(), this.networkEnabled, this.inForeground)).next((() => {
+        return this.runTransaction("updateClientMetadataAndTryBecomePrimary", "readwrite", (t => ar(t).put(new Ks(this.clientId, Date.now(), this.networkEnabled, this.inForeground)).next((() => {
             if (this.isPrimary) return this.rn(t).next((t => {
                 t || (this.isPrimary = !1, this.Oe.enqueueRetryable((() => this.We(!1))));
             }));
-        })).next((() => this.on(t))).next((e => this.isPrimary && !e ? this.cn(t).next((() => !1)) : !!e && this.an(t).next((() => !0)))))).catch((t => {
+        })).next((() => this.on(t))).next((e => this.isPrimary && !e ? this.an(t).next((() => !1)) : !!e && this.cn(t).next((() => !0)))))).catch((t => {
             if (ti(t)) 
             // Proceed with the existing state. Any subsequent access to
             // IndexedDB will verify the lease.
@@ -8285,7 +8285,7 @@ class rr {
         return or(t).get(Cs.key).next((t => Hs.resolve(this.un(t))));
     }
     hn(t) {
-        return cr(t).delete(this.clientId);
+        return ar(t).delete(this.clientId);
     }
     /**
      * If the garbage collection threshold has passed, prunes the
@@ -8356,7 +8356,7 @@ class rr {
                     return !1;
                 }
             }
-            return !(!this.networkEnabled || !this.inForeground) || cr(t).Bt().next((t => void 0 === this.dn(t, 5e3).find((t => {
+            return !(!this.networkEnabled || !this.inForeground) || ar(t).Bt().next((t => void 0 === this.dn(t, 5e3).find((t => {
                 if (this.clientId !== t.clientId) {
                     const e = !this.networkEnabled && t.networkEnabled, n = !this.inForeground && t.inForeground, s = this.networkEnabled === t.networkEnabled;
                     if (e || n && s) return !0;
@@ -8375,7 +8375,7 @@ class rr {
         // has obtained the primary lease.
         await this.ze.runTransaction("shutdown", "readwrite", [ Cs.store, Ks.store ], (t => {
             const e = new ri(t, nt.I);
-            return this.cn(e).next((() => this.hn(e)));
+            return this.an(e).next((() => this.hn(e)));
         })), this.ze.close(), 
         // Remove the entry marking the client as zombied from LocalStorage since
         // we successfully deleted its metadata from IndexedDb.
@@ -8394,7 +8394,7 @@ class rr {
      *
      * PORTING NOTE: This is only used for Web multi-tab.
      */    Tn() {
-        return this.runTransaction("getActiveClients", "readonly", (t => cr(t).Bt().next((t => this.dn(t, 18e5).map((t => t.clientId))))));
+        return this.runTransaction("getActiveClients", "readonly", (t => ar(t).Bt().next((t => this.dn(t, 18e5).map((t => t.clientId))))));
     }
     get started() {
         return this.Ue;
@@ -8425,7 +8425,7 @@ class rr {
             if (!e) throw O(`Failed to obtain primary lease for action '${t}'.`), this.isPrimary = !1, 
             this.Oe.enqueueRetryable((() => this.We(!1))), new Q(j.FAILED_PRECONDITION, Gs);
             return n(i);
-        })).next((t => this.an(i).next((() => t)))) : this.En(i).next((() => n(i)))))).then((t => (i.raiseOnCommittedEvent(), 
+        })).next((t => this.cn(i).next((() => t)))) : this.En(i).next((() => n(i)))))).then((t => (i.raiseOnCommittedEvent(), 
         t)));
     }
     /**
@@ -8442,14 +8442,14 @@ class rr {
     /**
      * Obtains or extends the new primary lease for the local client. This
      * method does not verify that the client is eligible for this lease.
-     */    an(t) {
+     */    cn(t) {
         const e = new Cs(this.clientId, this.allowTabSynchronization, Date.now());
         return or(t).put(Cs.key, e);
     }
-    static bt() {
-        return Ys.bt();
+    static Pt() {
+        return Ys.Pt();
     }
-    /** Checks the primary lease and removes it if we are the current primary. */    cn(t) {
+    /** Checks the primary lease and removes it if we are the current primary. */    an(t) {
         const e = or(t);
         return e.get(Cs.key).next((t => this.un(t) ? (F("IndexedDbPersistence", "Releasing primary lease."), 
         e.delete(Cs.key)) : Hs.resolve()));
@@ -8540,14 +8540,14 @@ class rr {
 
 /**
  * Helper to get a typed SimpleDbStore for the client metadata object store.
- */ function cr(t) {
+ */ function ar(t) {
     return oi(t, Ks.store);
 }
 
 /**
  * Generates a string used as a prefix when storing data in IndexedDB and
  * LocalStorage.
- */ function ar(t, e) {
+ */ function cr(t, e) {
     // Use two different prefix formats:
     //   * firestore / persistenceKey / projectID . databaseID / ...
     //   * firestore / persistenceKey / projectID / ...
@@ -8610,9 +8610,9 @@ class ur {
      * @returns Local view of the document or null if we don't have any cached
      * state for it.
      */    Rn(t, e) {
-        return this.An.getAllMutationBatchesAffectingDocumentKey(t, e).next((n => this.Pn(t, e, n)));
+        return this.An.getAllMutationBatchesAffectingDocumentKey(t, e).next((n => this.bn(t, e, n)));
     }
-    /** Internal version of `getDocument` that allows reusing batches. */    Pn(t, e, n) {
+    /** Internal version of `getDocument` that allows reusing batches. */    bn(t, e, n) {
         return this.Je.getEntry(t, e).next((t => {
             for (const e of n) e.applyToLocalView(t);
             return t;
@@ -8620,7 +8620,7 @@ class ur {
     }
     // Returns the view of the given `docs` as they would appear after applying
     // all mutations in the given `batches`.
-    bn(t, e) {
+    Pn(t, e) {
         t.forEach(((t, n) => {
             for (const t of e) t.applyToLocalView(n);
         }));
@@ -8637,7 +8637,7 @@ class ur {
      * Applies the local view the given `baseDocs` without retrieving documents
      * from the local store.
      */    Vn(t, e) {
-        return this.An.getAllMutationBatchesAffectingDocumentKeys(t, e).next((t => this.bn(e, t)));
+        return this.An.getAllMutationBatchesAffectingDocumentKeys(t, e).next((t => this.Pn(e, t)));
     }
     /**
      * Performs a query against the local view of all documents.
@@ -8703,7 +8703,7 @@ class ur {
     }
     Nn(t, e, n) {
         let s = Cn();
-        for (const t of e) for (const e of t.mutations) e instanceof an && null === n.get(e.key) && (s = s.add(e.key));
+        for (const t of e) for (const e of t.mutations) e instanceof cn && null === n.get(e.key) && (s = s.add(e.key));
         let i = n;
         return this.Je.getEntries(t, s).next((t => (t.forEach(((t, e) => {
             e.isFoundDocument() && (i = i.insert(t, e));
@@ -8796,7 +8796,7 @@ class ur {
             return 0 === t.filters.length && null === t.limit && null == t.startAt && null == t.endAt && (0 === t.explicitOrderBy.length || 1 === t.explicitOrderBy.length && t.explicitOrderBy[0].field.isKeyField());
         }(e) || n.isEqual(ut.min()) ? this.Mn(t, e) : this.On.vn(t, s).next((i => {
             const r = this.Ln(e, i);
-            return (Te(e) || Ee(e)) && this.Bn(e.limitType, r, s, n) ? this.Mn(t, e) : (x() <= c.DEBUG && F("QueryEngine", "Re-using previous result from %s to execute query: %s", n.toString(), De(e)), 
+            return (Te(e) || Ee(e)) && this.Bn(e.limitType, r, s, n) ? this.Mn(t, e) : (x() <= a.DEBUG && F("QueryEngine", "Re-using previous result from %s to execute query: %s", n.toString(), De(e)), 
             this.On.getDocumentsMatchingQuery(t, e, n).next((t => (
             // We merge `previousResults` into `updateResults`, since
             // `updateResults` is already a DocumentMap. If a document is
@@ -8842,7 +8842,7 @@ class ur {
         return !!i && (i.hasPendingWrites || i.version.compareTo(s) > 0);
     }
     Mn(t, e) {
-        return x() <= c.DEBUG && F("QueryEngine", "Using full collection scan to execute query:", De(e)), 
+        return x() <= a.DEBUG && F("QueryEngine", "Using full collection scan to execute query:", De(e)), 
         this.On.getDocumentsMatchingQuery(t, e, ut.min());
     }
 }
@@ -9022,16 +9022,16 @@ function gr(t) {
                 i = n.qn;
         const o = [];
         e.targetChanges.forEach(((e, r) => {
-            const c = i.get(r);
-            if (!c) return;
+            const a = i.get(r);
+            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.He.removeMatchingKeys(t, e.removedDocuments, r).next((() => n.He.addMatchingKeys(t, e.addedDocuments, r))));
-            const a = e.resumeToken;
+            const c = e.resumeToken;
             // Update the resume token if the change includes one.
-                        if (a.approximateByteSize() > 0) {
-                const u = c.withResumeToken(a, s).withSequenceNumber(t.currentSequenceNumber);
+                        if (c.approximateByteSize() > 0) {
+                const u = a.withResumeToken(c, s).withSequenceNumber(t.currentSequenceNumber);
                 i = i.insert(r, u), 
                 // Update the target data if there are target changes (or if
                 // sufficient time has passed since the last update).
@@ -9064,10 +9064,10 @@ function gr(t) {
                 }
                 /**
  * Notifies local store of the changed views to locally pin documents.
- */ (c, u, e) && o.push(n.He.updateTargetData(t, u));
+ */ (a, u, e) && o.push(n.He.updateTargetData(t, u));
             }
         }));
-        let c = Pn();
+        let a = bn();
         // 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
@@ -9078,12 +9078,12 @@ function gr(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(pr(t, r, e.documentUpdates, s, void 0).next((t => {
-            c = t;
+            a = t;
         }))), !s.isEqual(ut.min())) {
             const e = n.He.getLastRemoteSnapshotVersion(t).next((e => n.He.setTargetsMetadata(t, t.currentSequenceNumber, s)));
             o.push(e);
         }
-        return Hs.waitFor(o).next((() => r.apply(t))).next((() => n.Wn.Vn(t, c))).next((() => c));
+        return Hs.waitFor(o).next((() => r.apply(t))).next((() => n.Wn.Vn(t, a))).next((() => a));
     })).then((t => (n.qn = i, t)));
 }
 
@@ -9108,9 +9108,9 @@ function gr(t) {
 i) {
     let r = Cn();
     return n.forEach((t => r = r.add(t))), e.getEntries(t, r).next((t => {
-        let r = Pn();
+        let r = bn();
         return n.forEach(((n, o) => {
-            const c = t.get(n), a = (null == i ? void 0 : i.get(n)) || s;
+            const a = t.get(n), c = (null == i ? void 0 : i.get(n)) || s;
             // Note: The order of the steps below is important, since we want
             // to ensure that rejected limbo resolutions (which fabricate
             // NoDocuments with SnapshotVersion.min()) never add documents to
@@ -9119,8 +9119,8 @@ i) {
             // NoDocuments with SnapshotVersion.min() are used in manufactured
             // events. We remove these documents from cache since we lost
             // access.
-            e.removeEntry(n, a), r = r.insert(n, o)) : !c.isValidDocument() || o.version.compareTo(c.version) > 0 || 0 === o.version.compareTo(c.version) && c.hasPendingWrites ? (e.addEntry(o, a), 
-            r = r.insert(n, o)) : F("LocalStore", "Ignoring outdated watch update for ", n, ". Current version:", c.version, " Watch version:", o.version);
+            e.removeEntry(n, c), r = r.insert(n, o)) : !a.isValidDocument() || o.version.compareTo(a.version) > 0 || 0 === o.version.compareTo(a.version) && a.hasPendingWrites ? (e.addEntry(o, c), 
+            r = r.insert(n, o)) : F("LocalStore", "Ignoring outdated watch update for ", n, ". Current version:", a.version, " Watch version:", o.version);
         })), r;
     }));
 }
@@ -9210,7 +9210,7 @@ async function Ir(t, e, n) {
     return s.persistence.runTransaction("Execute query", "readonly", (t => function(t, e, n) {
         const s = K(t), i = s.Kn.get(n);
         return void 0 !== i ? Hs.resolve(s.qn.get(i)) : s.He.getTargetData(e, n);
-    }(s, t, be(e)).next((e => {
+    }(s, t, Pe(e)).next((e => {
         if (e) return i = e.lastLimboFreeSnapshotVersion, s.He.getMatchingKeysForTargetId(t, e.targetId).next((t => {
             r = t;
         }));
@@ -9233,15 +9233,15 @@ function Rr(t, e) {
  * since the prior call.
  */
 // PORTING NOTE: Multi-Tab only.
-function Pr(t) {
+function br(t) {
     const e = K(t);
     return e.persistence.runTransaction("Get new document changes", "readonly", (t => function(t, e, n) {
         const s = K(t);
-        let i = Pn(), r = di(n);
-        const o = tr(e), c = IDBKeyRange.lowerBound(r, !0);
+        let i = bn(), r = di(n);
+        const o = tr(e), a = IDBKeyRange.lowerBound(r, !0);
         return o.jt({
             index: Os.readTimeIndex,
-            range: c
+            range: a
         }, ((t, e) => {
             // Unlike `getEntry()` and others, `getNewDocumentChanges()` parses
             // the documents directly since we want to keep sentinel deletes.
@@ -9266,7 +9266,7 @@ function Pr(t) {
  * only return changes that happened after client initialization.
  */
 // PORTING NOTE: Multi-Tab only.
-async function br(t) {
+async function Pr(t) {
     const e = K(t);
     return e.persistence.runTransaction("Synchronize last document change read time", "readonly", (t => function(t) {
         const e = tr(t);
@@ -9298,21 +9298,21 @@ async function br(t) {
  */
 async function vr(t, e, n, s) {
     const i = K(t);
-    let r = Cn(), o = Pn(), c = Sn();
+    let r = Cn(), o = bn(), a = Sn();
     for (const t of n) {
         const n = e.Hn(t.metadata.name);
-        t.document && (r = r.add(n)), o = o.insert(n, e.Jn(t)), c = c.insert(n, e.Yn(t.metadata.readTime));
+        t.document && (r = r.add(n)), o = o.insert(n, e.Jn(t)), a = a.insert(n, e.Yn(t.metadata.readTime));
     }
-    const a = i.Qn.newChangeBuffer({
+    const c = i.Qn.newChangeBuffer({
         trackRemovals: !0
     }), u = await Er(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 be(pe(wt.fromString(`__bundle__/docs/${t}`)));
+        return Pe(pe(wt.fromString(`__bundle__/docs/${t}`)));
     }(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 => pr(t, a, o, ut.min(), c).next((e => (a.apply(t), 
+        return i.persistence.runTransaction("Apply bundle documents", "readwrite", (t => pr(t, c, o, ut.min(), a).next((e => (c.apply(t), 
     e))).next((e => i.He.removeMatchingKeysForTargetId(t, u.targetId).next((() => i.He.addMatchingKeys(t, r, u.targetId))).next((() => i.Wn.Vn(t, e))).next((() => e))))));
 }
 
@@ -9329,7 +9329,7 @@ async function Vr(t, e, n = Cn()) {
     // NOTE: this also means if no corresponding target exists, the new target
     // will remain active and will not get collected, unless users happen to
     // unlisten the query somehow.
-    const s = await Er(t, be(Ti(e.bundledQuery))), i = K(t);
+    const s = await Er(t, Pe(Ti(e.bundledQuery))), i = K(t);
     return i.persistence.runTransaction("Save named query", "readwrite", (t => {
         const r = Hn(e.readTime);
         // Simply save the query itself if it is older than what the SDK already
@@ -9516,7 +9516,7 @@ class Cr {
     addMutationBatch(t, e, n, s) {
         const i = this.ds;
         this.ds++, this.An.length > 0 && this.An[this.An.length - 1];
-        const r = new ci(i, e, n, s);
+        const r = new ai(i, e, n, s);
         this.An.push(r);
         // Track references by document key and index collection parents.
         for (const e of s) this.ws = this.ws.add(new Cr(e.key, i)), this.Jt.addToCollectionParentIndex(t, e.key.path.popLast());
@@ -9686,7 +9686,7 @@ class kr {
      */    addEntry(t, e, n) {
         const s = e.key, i = this.docs.get(s), r = i ? i.size : 0, o = this.Ts(e);
         return this.docs = this.docs.insert(s, {
-            document: e.clone(),
+            document: e.mutableCopy(),
             size: o,
             readTime: n
         }), this.size += o - r, this.Jt.addToCollectionParentIndex(t, s.path.popLast());
@@ -9702,24 +9702,24 @@ class kr {
     }
     getEntry(t, e) {
         const n = this.docs.get(e);
-        return Hs.resolve(n ? n.document.clone() : zt.newInvalidDocument(e));
+        return Hs.resolve(n ? n.document.mutableCopy() : zt.newInvalidDocument(e));
     }
     getEntries(t, e) {
-        let n = Pn();
+        let n = bn();
         return e.forEach((t => {
             const e = this.docs.get(t);
-            n = n.insert(t, e ? e.document.clone() : zt.newInvalidDocument(t));
+            n = n.insert(t, e ? e.document.mutableCopy() : zt.newInvalidDocument(t));
         })), Hs.resolve(n);
     }
     getDocumentsMatchingQuery(t, e, n) {
-        let s = Pn();
+        let s = bn();
         // Documents are ordered by key, so we can use a prefix scan to narrow down
         // the documents we need to match the query against.
                 const i = new Ct(e.path.child("")), r = this.docs.getIteratorFrom(i);
         for (;r.hasNext(); ) {
             const {key: t, value: {document: i, readTime: o}} = r.getNext();
             if (!e.path.isPrefixOf(t.path)) break;
-            o.compareTo(n) <= 0 || Ce(e, i) && (s = s.insert(i.key, i.clone()));
+            o.compareTo(n) <= 0 || Ce(e, i) && (s = s.insert(i.key, i.mutableCopy()));
         }
         return Hs.resolve(s);
     }
@@ -9797,7 +9797,7 @@ class xr extends Ji {
          * A ordered bidirectional mapping between documents and the remote target
          * IDs.
          */
-        this.Rs = new Dr, this.targetCount = 0, this.Ps = Oi.ie();
+        this.Rs = new Dr, this.targetCount = 0, this.bs = Oi.ie();
     }
     forEachTarget(t, e) {
         return this.Is.forEach(((t, n) => e(n))), Hs.resolve();
@@ -9809,22 +9809,22 @@ class xr extends Ji {
         return Hs.resolve(this.As);
     }
     allocateTargetId(t) {
-        return this.highestTargetId = this.Ps.next(), Hs.resolve(this.highestTargetId);
+        return this.highestTargetId = this.bs.next(), Hs.resolve(this.highestTargetId);
     }
     setTargetsMetadata(t, e, n) {
         return n && (this.lastRemoteSnapshotVersion = n), e > this.As && (this.As = e), 
         Hs.resolve();
     }
-    ae(t) {
+    ce(t) {
         this.Is.set(t.target, t);
         const e = t.targetId;
-        e > this.highestTargetId && (this.Ps = new Oi(e), this.highestTargetId = e), t.sequenceNumber > this.As && (this.As = t.sequenceNumber);
+        e > this.highestTargetId && (this.bs = new Oi(e), this.highestTargetId = e), t.sequenceNumber > this.As && (this.As = t.sequenceNumber);
     }
     addTargetData(t, e) {
-        return this.ae(e), this.targetCount += 1, Hs.resolve();
+        return this.ce(e), this.targetCount += 1, Hs.resolve();
     }
     updateTargetData(t, e) {
-        return this.ae(e), Hs.resolve();
+        return this.ce(e), Hs.resolve();
     }
     removeTargetData(t, e) {
         return this.Is.delete(e.target), this.Rs.us(e.targetId), this.targetCount -= 1, 
@@ -9895,7 +9895,7 @@ class Fr {
      * checked or asserted on every access.
      */
     constructor(t, e) {
-        this.bs = {}, this.Be = new nt(0), this.Ue = !1, this.Ue = !0, this.referenceDelegate = t(this), 
+        this.Ps = {}, this.Be = new nt(0), this.Ue = !1, this.Ue = !0, this.referenceDelegate = t(this), 
         this.He = new $r(this);
         this.Jt = new Ri, this.Je = function(t, e) {
             return new kr(t, e);
@@ -9921,8 +9921,8 @@ class Fr {
         return this.Jt;
     }
     getMutationQueue(t) {
-        let e = this.bs[t.toKey()];
-        return e || (e = new Nr(this.Jt, this.referenceDelegate), this.bs[t.toKey()] = e), 
+        let e = this.Ps[t.toKey()];
+        return e || (e = new Nr(this.Jt, this.referenceDelegate), this.Ps[t.toKey()] = e), 
         e;
     }
     getTargetCache() {
@@ -9941,7 +9941,7 @@ class Fr {
         t)));
     }
     Ds(t, e) {
-        return Hs.or(Object.values(this.bs).map((n => () => n.containsKey(t, e))));
+        return Hs.or(Object.values(this.Ps).map((n => () => n.containsKey(t, e))));
     }
 }
 
@@ -10254,7 +10254,7 @@ class Wr {
         // mutations but before we observe WebStorage events.
         this.window.addEventListener("storage", this.Us);
     }
-    /** Returns 'true' if WebStorage is available in the current environment. */    static bt(t) {
+    /** Returns 'true' if WebStorage is available in the current environment. */    static Pt(t) {
         return !(!t || !t.localStorage);
     }
     async start() {
@@ -10341,7 +10341,7 @@ class Wr {
         this.oi(t);
     }
     notifyBundleLoaded() {
-        this.ci();
+        this.ai();
     }
     shutdown() {
         this.started && (this.window.removeEventListener("storage", this.Us), this.removeItem(this.Qs), 
@@ -10367,7 +10367,7 @@ class Wr {
                 if (this.started) {
                     if (null !== e.key) if (this.Gs.test(e.key)) {
                         if (null == e.newValue) {
-                            const t = this.ai(e.key);
+                            const t = this.ci(e.key);
                             return this.ui(t, null);
                         }
                         {
@@ -10436,13 +10436,13 @@ class Wr {
         const s = Ur(this.persistenceKey, t), i = new Kr(t, e, n);
         this.setItem(s, i.Os());
     }
-    ci() {
+    ai() {
         this.setItem(this.Ys, "value-not-used");
     }
     /**
      * Parses a client state key in WebStorage. Returns null if the key does not
      * match the expected key format.
-     */    ai(t) {
+     */    ci(t) {
         const e = this.Gs.exec(t);
         return e ? e[1] : null;
     }
@@ -10450,7 +10450,7 @@ class Wr {
      * Parses a client state in WebStorage. Returns 'null' if the value could not
      * be parsed.
      */    hi(t, e) {
-        const n = this.ai(t);
+        const n = this.ci(t);
         return jr.Fs(n, e);
     }
     /**
@@ -10600,10 +10600,10 @@ class zr {
  */
 class Jr {
     constructor() {
-        this.Ii = () => this.Ai(), this.Ri = () => this.Pi(), this.bi = [], this.vi();
+        this.Ii = () => this.Ai(), this.Ri = () => this.bi(), this.Pi = [], this.vi();
     }
     Ei(t) {
-        this.bi.push(t);
+        this.Pi.push(t);
     }
     shutdown() {
         window.removeEventListener("online", this.Ii), window.removeEventListener("offline", this.Ri);
@@ -10613,16 +10613,16 @@ class Jr {
     }
     Ai() {
         F("ConnectivityMonitor", "Network connectivity changed: AVAILABLE");
-        for (const t of this.bi) t(0 /* AVAILABLE */);
+        for (const t of this.Pi) t(0 /* AVAILABLE */);
     }
-    Pi() {
+    bi() {
         F("ConnectivityMonitor", "Network connectivity changed: UNAVAILABLE");
-        for (const t of this.bi) t(1 /* UNAVAILABLE */);
+        for (const t of this.Pi) t(1 /* UNAVAILABLE */);
     }
     // TODO(chenbrian): Consider passing in window either into this component or
     // here for testing via FakeWindow.
     /** Checks that all used attributes of window are available. */
-    static bt() {
+    static Pt() {
         return "undefined" != typeof window && void 0 !== window.addEventListener && void 0 !== window.removeEventListener;
     }
 }
@@ -10806,12 +10806,12 @@ class {
                     F("Connection", 'RPC "' + t + '" completed.');
                 }
             }));
-            const c = JSON.stringify(s);
-            o.send(e, "POST", c, n, 15);
+            const a = JSON.stringify(s);
+            o.send(e, "POST", a, n, 15);
         }));
     }
     Qi(t, e, n) {
-        const s = [ this.Mi, "/", "google.firestore.v1.Firestore", "/", t, "/channel" ], i = R(), r = P(), o = {
+        const s = [ this.Mi, "/", "google.firestore.v1.Firestore", "/", t, "/channel" ], i = R(), r = b(), o = {
             // Required for backend stickiness, routing behavior is based on this
             // parameter.
             httpSessionIdParam: "gsessionid",
@@ -10835,7 +10835,7 @@ class {
             forceLongPolling: this.forceLongPolling,
             detectBufferingProxy: this.autoDetectLongPolling
         };
-        this.useFetchStreams && (o.xmlHttpFactory = new b({})), this.qi(o.initMessageHeaders, e, n), 
+        this.useFetchStreams && (o.xmlHttpFactory = new P({})), this.qi(o.initMessageHeaders, e, n), 
         // Sending the custom headers we just added to request.initMessageHeaders
         // (Authorization, etc.) will trigger the browser to make a CORS preflight
         // request because the XHR will no longer meet the criteria for a "simple"
@@ -10852,9 +10852,9 @@ class {
         // known to (sometimes) not include an Origin. See
         // https://github.com/firebase/firebase-js-sdk/issues/1491.
         f() || d() || w() || _() || m() || g() || (o.httpHeadersOverwriteParam = "$httpHeaders");
-        const c = s.join("");
-        F("Connection", "Creating WebChannel: " + c, o);
-        const a = i.createWebChannel(c, o);
+        const a = s.join("");
+        F("Connection", "Creating WebChannel: " + a, o);
+        const c = i.createWebChannel(a, 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
@@ -10867,9 +10867,9 @@ class {
                 const l = new Xr({
             Vi: t => {
                 h ? F("Connection", "Not sending because WebChannel is closed:", t) : (u || (F("Connection", "Opening WebChannel transport."), 
-                a.open(), u = !0), F("Connection", "WebChannel sending:", t), a.send(t));
+                c.open(), u = !0), F("Connection", "WebChannel sending:", t), c.send(t));
             },
-            Si: () => a.close()
+            Si: () => c.close()
         }), y = (t, e, n) => {
             // TODO(dimond): closure typing seems broken because WebChannel does
             // not implement goog.events.Listenable
@@ -10887,13 +10887,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(a, v.EventType.OPEN, (() => {
+                return y(c, v.EventType.OPEN, (() => {
             h || F("Connection", "WebChannel transport opened.");
-        })), y(a, v.EventType.CLOSE, (() => {
+        })), y(c, v.EventType.CLOSE, (() => {
             h || (h = !0, F("Connection", "WebChannel transport closed"), l.Fi());
-        })), y(a, v.EventType.ERROR, (t => {
+        })), y(c, v.EventType.ERROR, (t => {
             h || (h = !0, M("Connection", "WebChannel transport errored:", t), l.Fi(new Q(j.UNAVAILABLE, "The operation could not be completed")));
-        })), y(a, v.EventType.MESSAGE, (t => {
+        })), y(c, v.EventType.MESSAGE, (t => {
             var e;
             if (!h) {
                 const n = t.data[0];
@@ -10923,7 +10923,7 @@ class {
                     }(t), n = i.message;
                     void 0 === e && (e = j.INTERNAL, n = "Unknown error status: " + t + " with message " + i.message), 
                     // Mark closed so no further events are propagated
-                    h = !0, l.Fi(new Q(e, n)), a.close();
+                    h = !0, l.Fi(new Q(e, n)), c.close();
                 } else F("Connection", "WebChannel received:", n), l.Oi(n);
             }
         })), y(r, V.STAT_EVENT, (t => {
@@ -11138,15 +11138,15 @@ class so {
  *  ListenerType: The type of the listener that will be used for callbacks
  */
 class io {
-    constructor(t, e, n, s, i, r, o, c) {
+    constructor(t, e, n, s, i, r, o, a) {
         this.Oe = t, this.nr = n, this.sr = s, this.ir = i, this.authCredentialsProvider = r, 
-        this.appCheckCredentialsProvider = o, this.listener = c, this.state = 0 /* Initial */ , 
+        this.appCheckCredentialsProvider = o, this.listener = a, this.state = 0 /* Initial */ , 
         /**
          * A close count that's incremented every time the stream is closed; used by
          * getCloseGuardedDispatcher() to invalidate callbacks that happen after
          * close.
          */
-        this.rr = 0, this.cr = null, this.ar = null, this.stream = null, this.ur = new so(t, e);
+        this.rr = 0, this.ar = null, this.cr = null, this.stream = null, this.ur = new so(t, e);
     }
     /**
      * Returns true if start() has been called and no error has occurred. True
@@ -11202,7 +11202,7 @@ class io {
      */    _r() {
         // Starts the idle time if we are in state 'Open' and are not yet already
         // running a timer (in which case the previous idle timeout still applies).
-        this.lr() && null === this.cr && (this.cr = this.Oe.enqueueAfterDelay(this.nr, 6e4, (() => this.mr())));
+        this.lr() && null === this.ar && (this.ar = this.Oe.enqueueAfterDelay(this.nr, 6e4, (() => this.mr())));
     }
     /** Sends a message to the underlying stream. */    gr(t) {
         this.yr(), this.stream.send(t);
@@ -11214,10 +11214,10 @@ class io {
         return this.close(0 /* Initial */);
     }
     /** Marks the stream as active again. */    yr() {
-        this.cr && (this.cr.cancel(), this.cr = null);
+        this.ar && (this.ar.cancel(), this.ar = null);
     }
     /** Cancels the health check delayed operation. */    pr() {
-        this.ar && (this.ar.cancel(), this.ar = null);
+        this.cr && (this.cr.cancel(), this.cr = null);
     }
     /**
      * Closes the stream and cleans up as necessary:
@@ -11285,7 +11285,7 @@ class io {
     Ir(t, e) {
         const n = this.Er(this.rr);
         this.stream = this.Rr(t, e), this.stream.Di((() => {
-            n((() => (this.state = 2 /* Open */ , this.ar = this.Oe.enqueueAfterDelay(this.sr, 1e4, (() => (this.lr() && (this.state = 3 /* Healthy */), 
+            n((() => (this.state = 2 /* Open */ , this.cr = this.Oe.enqueueAfterDelay(this.sr, 1e4, (() => (this.lr() && (this.state = 3 /* Healthy */), 
             Promise.resolve()))), this.listener.Di())));
         })), this.stream.Ni((t => {
             n((() => this.Ar(t)));
@@ -11336,7 +11336,7 @@ class io {
     onMessage(t) {
         // A successful response means the stream is healthy
         this.ur.reset();
-        const e = cs(this.k, t), n = function(t) {
+        const e = as(this.k, t), n = function(t) {
             // 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.
@@ -11344,14 +11344,14 @@ class io {
             const e = t.targetChange;
             return e.targetIds && e.targetIds.length ? ut.min() : e.readTime ? Hn(e.readTime) : ut.min();
         }(t);
-        return this.listener.Pr(e, n);
+        return this.listener.br(e, n);
     }
     /**
      * Registers interest in the results of the given target. If the target
      * includes a resumeToken it will be included in the request. Results that
      * affect the target will be streamed back as WatchChange messages that
      * reference the targetId.
-     */    br(t) {
+     */    Pr(t) {
         const e = {};
         e.database = ns(this.k), e.addTarget = function(t, e) {
             let n;
@@ -11442,7 +11442,7 @@ class io {
     /** Sends a group of mutations to the Firestore backend to apply. */    Dr(t) {
         const e = {
             streamToken: this.lastStreamToken,
-            writes: t.map((t => as(this.k, t)))
+            writes: t.map((t => cs(this.k, t)))
         };
         this.gr(e);
     }
@@ -11473,7 +11473,7 @@ class io {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class co extends class {} {
+class ao extends class {} {
     constructor(t, e, n, s) {
         super(), this.authCredentials = t, this.appCheckCredentials = e, this.ir = n, this.k = s, 
         this.$r = !1;
@@ -11511,7 +11511,7 @@ class co 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 ao {
+class co {
     constructor(t, e) {
         this.asyncQueue = t, this.onlineStateHandler = e, 
         /** The current OnlineState. */
@@ -11656,7 +11656,7 @@ class ao {
                     e.Gr.delete(4 /* ConnectivityChange */), await ho(e);
                 }(this));
             }));
-        })), this.Jr = new ao(n, s);
+        })), this.Jr = new co(n, s);
     }
 }
 
@@ -11700,7 +11700,7 @@ function fo(t, e) {
  * We need to increment the the expected number of pending responses we're due
  * from watch so we wait for the ack to process any messages from this target.
  */ function _o(t, e) {
-    t.Yr.X(e.targetId), Fo(t).br(e);
+    t.Yr.X(e.targetId), Fo(t).Pr(e);
 }
 
 /**
@@ -11851,11 +11851,11 @@ async function Ao(t, e, n) {
 /**
  * Executes `op`. If `op` fails, takes the network offline until `op`
  * succeeds. Returns after the first attempt.
- */ function Po(t, e) {
+ */ function bo(t, e) {
     return e().catch((n => Ro(t, n, e)));
 }
 
-async function bo(t) {
+async function Po(t) {
     const e = K(t), n = Oo(e);
     let s = e.Qr.length > 0 ? e.Qr[e.Qr.length - 1].batchId : -1;
     for (;vo(e); ) try {
@@ -11906,11 +11906,11 @@ async function No(t) {
 }
 
 async function ko(t, e, n) {
-    const s = t.Qr.shift(), i = ai.from(s, e, n);
-    await Po(t, (() => t.remoteSyncer.applySuccessfulWrite(i))), 
+    const s = t.Qr.shift(), i = ci.from(s, e, n);
+    await bo(t, (() => t.remoteSyncer.applySuccessfulWrite(i))), 
     // It's possible that with the completion of this mutation another
     // slot has freed up.
-    await bo(t);
+    await Po(t);
 }
 
 async function xo(t, e) {
@@ -11928,10 +11928,10 @@ async function xo(t, e) {
             // 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.
-                        Oo(t).wr(), await Po(t, (() => t.remoteSyncer.rejectFailedWrite(n.batchId, e))), 
+                        Oo(t).wr(), await bo(t, (() => t.remoteSyncer.rejectFailedWrite(n.batchId, e))), 
             // It's possible that with the completion of this mutation
             // another slot has freed up.
-            await bo(t);
+            await Po(t);
         }
         var n;
     }(t, e), 
@@ -11981,7 +11981,7 @@ async function $o(t, e) {
  */ (t.datastore, t.asyncQueue, {
         Di: Eo.bind(null, t),
         Ni: Io.bind(null, t),
-        Pr: Ao.bind(null, t)
+        br: Ao.bind(null, t)
     }), t.zr.push((async e => {
         e ? (t.Xr.wr(), yo(t) ? go(t) : t.Jr.set("Unknown" /* Unknown */)) : (await t.Xr.stop(), 
         To(t));
@@ -12009,7 +12009,7 @@ async function $o(t, e) {
     }), t.zr.push((async e => {
         e ? (t.Zr.wr(), 
         // This will start the write stream if necessary.
-        await bo(t)) : (await t.Zr.stop(), t.Qr.length > 0 && (F("RemoteStore", `Stopping write stream with ${t.Qr.length} pending writes`), 
+        await Po(t)) : (await t.Zr.stop(), t.Qr.length > 0 && (F("RemoteStore", `Stopping write stream with ${t.Qr.length} pending writes`), 
         t.Qr = []));
     }))), t.Zr;
 }
@@ -12261,9 +12261,9 @@ class Mo {
 }
 
 class qo {
-    constructor(t, e, n, s, i, r, o, c) {
+    constructor(t, e, n, s, i, r, o, a) {
         this.query = t, this.docs = e, this.oldDocs = n, this.docChanges = s, this.mutatedKeys = i, 
-        this.fromCache = r, this.syncStateChanged = o, this.excludesMetadataChanges = c;
+        this.fromCache = r, this.syncStateChanged = o, this.excludesMetadataChanges = a;
     }
     /** Returns a view snapshot as if all documents in the snapshot were added. */    static fromInitialDocuments(t, e, n, s) {
         const i = [];
@@ -12382,12 +12382,12 @@ function Ho(t) {
  * It uses an Observer to dispatch events.
  */ class Jo {
     constructor(t, e, n) {
-        this.query = t, this.co = e, 
+        this.query = t, this.ao = e, 
         /**
          * Initial snapshots (e.g. from cache) may not be propagated to the wrapped
          * observer. This flag is set to true once we've actually raised an event.
          */
-        this.ao = !1, this.uo = null, this.onlineState = "Unknown" /* Unknown */ , this.options = n || {};
+        this.co = !1, this.uo = null, this.onlineState = "Unknown" /* Unknown */ , this.options = n || {};
     }
     /**
      * Applies the new ViewSnapshot to this listener, raising a user-facing event
@@ -12403,16 +12403,16 @@ function Ho(t) {
             /* excludesMetadataChanges= */ !0);
         }
         let e = !1;
-        return this.ao ? this.ho(t) && (this.co.next(t), e = !0) : this.lo(t, this.onlineState) && (this.fo(t), 
+        return this.co ? this.ho(t) && (this.ao.next(t), e = !0) : this.lo(t, this.onlineState) && (this.fo(t), 
         e = !0), this.uo = t, e;
     }
     onError(t) {
-        this.co.error(t);
+        this.ao.error(t);
     }
     /** Returns whether a snapshot was raised. */    ro(t) {
         this.onlineState = t;
         let e = !1;
-        return this.uo && !this.ao && this.lo(this.uo, t) && (this.fo(this.uo), e = !0), 
+        return this.uo && !this.co && this.lo(this.uo, t) && (this.fo(this.uo), e = !0), 
         e;
     }
     lo(t, e) {
@@ -12439,8 +12439,8 @@ function Ho(t) {
         // stripped out.
         }
     fo(t) {
-        t = qo.fromInitialDocuments(t.query, t.docs, t.mutatedKeys, t.fromCache), this.ao = !0, 
-        this.co.next(t);
+        t = qo.fromInitialDocuments(t.query, t.docs, t.mutatedKeys, t.fromCache), this.co = !0, 
+        this.ao.next(t);
     }
 }
 
@@ -12518,7 +12518,7 @@ function Ho(t) {
         /** Batched queries to be saved into storage */
         this.queries = [], 
         /** Batched documents to be saved into storage */
-        this.documents = [], this.progress = tc(t);
+        this.documents = [], this.progress = ta(t);
     }
     /**
      * Adds an element from the bundle to the loader.
@@ -12557,7 +12557,7 @@ function Ho(t) {
 /**
  * Returns a `LoadBundleTaskProgress` representing the initial progress of
  * loading a bundle.
- */ function tc(t) {
+ */ function ta(t) {
     return {
         taskState: "Running",
         documentsLoaded: 0,
@@ -12587,13 +12587,13 @@ function Ho(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;
     }
@@ -12603,7 +12603,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) {
@@ -12623,7 +12623,7 @@ class nc {
     /**
      * The set of remote documents that the server has told us belongs to the target associated with
      * this view.
-     */    get Po() {
+     */    get bo() {
         return this.To;
     }
     /**
@@ -12635,7 +12635,7 @@ class nc {
      * @param previousChanges - If this is being called with a refill, then start
      *        with this set of docs and changes instead of the current view.
      * @returns a new set of docs, changes, and refill flag.
-     */    bo(t, e) {
+     */    Po(t, e) {
         const n = e ? e.vo : new Uo, s = e ? e.Ro : this.Ro;
         let i = e ? e.mutatedKeys : this.mutatedKeys, r = s, o = !1;
         // Track the last doc in a (full) limit. This is necessary, because some
@@ -12646,7 +12646,7 @@ 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 c = Te(this.query) && s.size === this.query.limit ? s.last() : null, a = Ee(this.query) && s.size === this.query.limit ? s.first() : null;
+        const a = Te(this.query) && s.size === this.query.limit ? s.last() : null, c = Ee(this.query) && s.size === this.query.limit ? s.first() : null;
         // Drop documents out to meet limit/limitToLast requirement.
         if (t.inorderTraversal(((t, e) => {
             const u = s.get(t), h = Ce(this.query, e) ? e : null, l = !!u && this.mutatedKeys.has(u.key), f = !!h && (h.hasLocalMutations || 
@@ -12662,7 +12662,7 @@ class nc {
                 }), d = !0) : this.Vo(u, h) || (n.track({
                     type: 2 /* Modified */ ,
                     doc: h
-                }), d = !0, (c && this.Ao(h, c) > 0 || a && this.Ao(h, a) < 0) && (
+                }), d = !0, (a && this.Ao(h, a) > 0 || c && this.Ao(h, c) < 0) && (
                 // This doc moved from inside the limit to outside the limit.
                 // That means there may be some other doc in the local cache
                 // that should be included instead.
@@ -12673,7 +12673,7 @@ class nc {
             }), d = !0) : u && !h && (n.track({
                 type: 1 /* Removed */ ,
                 doc: u
-            }), d = !0, (c || a) && (
+            }), d = !0, (a || c) && (
             // A doc was removed from a full limit query. We'll need to
             // requery from the local cache to see if we know about some other
             // doc that should be in the results.
@@ -12757,10 +12757,10 @@ class nc {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */ (t.type, e.type) || this.Ao(t.doc, e.doc))), this.So(n);
-        const r = e ? this.Do() : [], o = 0 === this.Io.size && this.current ? 1 /* Synced */ : 0 /* Local */ , c = o !== this.Eo;
-        if (this.Eo = o, 0 !== i.length || c) {
+        const r = e ? this.Do() : [], o = 0 === this.Io.size && this.current ? 1 /* Synced */ : 0 /* Local */ , a = o !== this.Eo;
+        if (this.Eo = o, 0 !== i.length || a) {
             return {
-                snapshot: new qo(this.query, t.Ro, s, i, t.mutatedKeys, 0 /* Local */ === o, c, 
+                snapshot: new qo(this.query, t.Ro, s, i, t.mutatedKeys, 0 /* Local */ === o, a, 
                 /* excludesMetadataChanges= */ !1),
                 Co: r
             };
@@ -12816,9 +12816,9 @@ class nc {
         // Diff the new limbo docs with the old limbo docs.
         const e = [];
         return t.forEach((t => {
-            this.Io.has(t) || e.push(new nc(t));
+            this.Io.has(t) || e.push(new na(t));
         })), this.Io.forEach((n => {
-            t.has(n) || e.push(new ec(n));
+            t.has(n) || e.push(new ea(n));
         })), e;
     }
     /**
@@ -12843,7 +12843,7 @@ class nc {
     // PORTING NOTE: Multi-tab only.
     ko(t) {
         this.To = t.zn, this.Io = Cn();
-        const e = this.bo(t.documents);
+        const e = this.Po(t.documents);
         return this.applyChanges(e, /*updateLimboDocuments=*/ !0);
     }
     /**
@@ -12861,7 +12861,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.
@@ -12883,7 +12883,7 @@ class ic {
     }
 }
 
-/** Tracks a limbo resolution. */ class rc {
+/** Tracks a limbo resolution. */ class ra {
     constructor(t) {
         this.key = t, 
         /**
@@ -12908,7 +12908,7 @@ 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) {
@@ -12954,8 +12954,8 @@ class ic {
  * server. All the subsequent view snapshots or errors are sent to the
  * subscribed handlers. Returns the initial snapshot.
  */
-async function cc(t, e) {
-    const n = Fc(t);
+async function aa(t, e) {
+    const n = Fa(t);
     let s, i;
     const r = n.Oo.get(e);
     if (r) 
@@ -12966,8 +12966,8 @@ async function cc(t, e) {
     // to the query. EventManager will not have an assigned target ID in this
     // case and calls `listen` to obtain this ID.
     s = r.targetId, n.sharedClientState.addLocalQueryTarget(s), i = r.view.xo(); else {
-        const t = await Er(n.localStore, be(e)), r = n.sharedClientState.addLocalQueryTarget(t.targetId);
-        s = t.targetId, i = await ac(n, e, s, "current" === r), n.isPrimaryClient && fo(n.remoteStore, t);
+        const t = await Er(n.localStore, Pe(e)), r = n.sharedClientState.addLocalQueryTarget(t.targetId);
+        s = t.targetId, i = await ca(n, e, s, "current" === r), n.isPrimaryClient && fo(n.remoteStore, t);
     }
     return i;
 }
@@ -12975,31 +12975,31 @@ async function cc(t, e) {
 /**
  * Registers a view for a previously unknown query and computes its initial
  * snapshot.
- */ async function ac(t, e, n, s) {
+ */ async function ca(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.Go = (e, n, s) => async function(t, e, n, s) {
-        let i = e.view.bo(n);
+        let i = e.view.Po(n);
         i.Bn && (
         // The query has a limit and some docs were removed, so we need
         // to re-run the query against the local store to make sure we
         // didn't lose any good docs that had been past the limit.
         i = await Ar(t.localStore, e.query, 
-        /* usePreviousResults= */ !1).then((({documents: t}) => e.view.bo(t, i))));
+        /* usePreviousResults= */ !1).then((({documents: t}) => e.view.Po(t, i))));
         const r = s && s.targetChanges.get(e.targetId), o = e.view.applyChanges(i, 
         /* updateLimboDocuments= */ t.isPrimaryClient, r);
-        return Ec(t, e.targetId, o.Co), o.snapshot;
+        return Ea(t, e.targetId, o.Co), o.snapshot;
     }(t, e, n, s);
     const i = await Ar(t.localStore, e, 
-    /* usePreviousResults= */ !0), r = new sc(e, i.zn), o = r.bo(i.documents), c = $n.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), a = r.applyChanges(o, 
-    /* updateLimboDocuments= */ t.isPrimaryClient, c);
-    Ec(t, n, a.Co);
-    const u = new ic(e, n, r);
-    return t.Oo.set(e, u), t.Mo.has(n) ? t.Mo.get(n).push(e) : t.Mo.set(n, [ e ]), a.snapshot;
+    /* usePreviousResults= */ !0), r = new sa(e, i.zn), o = r.Po(i.documents), a = $n.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), c = r.applyChanges(o, 
+    /* updateLimboDocuments= */ t.isPrimaryClient, a);
+    Ea(t, n, c.Co);
+    const u = new ia(e, n, r);
+    return t.Oo.set(e, u), t.Mo.has(n) ? t.Mo.get(n).push(e) : t.Mo.set(n, [ e ]), c.snapshot;
 }
 
-/** Stops listening to the query. */ async function uc(t, e) {
+/** Stops listening to the query. */ async function ua(t, e) {
     const n = K(t), s = n.Oo.get(e), i = n.Mo.get(s.targetId);
     if (i.length > 1) return n.Mo.set(s.targetId, i.filter((t => !Ve(t, e)))), void n.Oo.delete(e);
     // No other queries are mapped to the target, clean up the query and the target.
@@ -13010,9 +13010,9 @@ async function cc(t, e) {
         n.sharedClientState.isActiveQueryTarget(s.targetId) || await Ir(n.localStore, s.targetId, 
         /*keepPersistedTargetData=*/ !1).then((() => {
             n.sharedClientState.clearQueryState(s.targetId), wo(n.remoteStore, s.targetId), 
-            pc(n, s.targetId);
+            pa(n, s.targetId);
         })).catch(qi);
-    } else pc(n, s.targetId), await Ir(n.localStore, s.targetId, 
+    } else pa(n, s.targetId), await Ir(n.localStore, s.targetId, 
     /*keepPersistedTargetData=*/ !0);
 }
 
@@ -13025,11 +13025,11 @@ async function cc(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 = Oc(t);
+ */ async function ha(t, e, n) {
+    const s = Oa(t);
     try {
         const t = await function(t, e) {
-            const n = K(t), s = at.now(), i = e.reduce(((t, e) => t.add(e.key)), Cn());
+            const n = K(t), s = ct.now(), i = e.reduce(((t, e) => t.add(e.key)), Cn());
             let r;
             return n.persistence.runTransaction("Locally write mutations", "readwrite", (t => n.Wn.vn(t, i).next((i => {
                 r = i;
@@ -13045,7 +13045,7 @@ async function cc(t, e) {
                     // NOTE: The base state should only be applied if there's some
                     // existing document to override, so use a Precondition of
                     // exists=true
-                    o.push(new an(t.key, e, Gt(e.value.mapValue), Xe.exists(!0)));
+                    o.push(new cn(t.key, e, Gt(e.value.mapValue), Xe.exists(!0)));
                 }
                 return n.An.addMutationBatch(t, s, o, e);
             })))).then((t => (t.applyToLocalDocumentSet(r), {
@@ -13061,7 +13061,7 @@ async function cc(t, e) {
         /**
  * Resolves or rejects the user callback for the given batch and then discards
  * it.
- */ (s, t.batchId, n), await Rc(s, t.changes), await bo(s.remoteStore);
+ */ (s, t.batchId, n), await Ra(s, t.changes), await Po(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.
@@ -13074,7 +13074,7 @@ async function cc(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 yr(n.localStore, e);
@@ -13087,7 +13087,7 @@ async function cc(t, e) {
             U(t.addedDocuments.size + t.modifiedDocuments.size + t.removedDocuments.size <= 1), 
             t.addedDocuments.size > 0 ? s.$o = !0 : t.modifiedDocuments.size > 0 ? U(s.$o) : t.removedDocuments.size > 0 && (U(s.$o), 
             s.$o = !1));
-        })), await Rc(n, t, e);
+        })), await Ra(n, t, e);
     } catch (t) {
         await qi(t);
     }
@@ -13096,7 +13096,7 @@ async function cc(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
@@ -13116,7 +13116,7 @@ async function cc(t, e) {
                 // Run global snapshot listeners if a consistent snapshot has been emitted.
                 t.ro(e) && (s = !0);
             })), s && Ho(n);
-        }(s.eventManager, e), t.length && s.Fo.Pr(t), s.onlineState = e, s.isPrimaryClient && s.sharedClientState.setOnlineState(e);
+        }(s.eventManager, e), t.length && s.Fo.br(t), s.onlineState = e, s.isPrimaryClient && s.sharedClientState.setOnlineState(e);
     }
 }
 
@@ -13130,7 +13130,7 @@ async function cc(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);
@@ -13147,18 +13147,18 @@ async function cc(t, e) {
         const n = Cn().add(r), i = new xn(ut.min(), 
         /* targetChanges= */ new Map, 
         /* targetMismatches= */ new In(rt), 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.Bo = s.Bo.remove(r), s.Uo.delete(e), Ac(s);
+        s.Bo = s.Bo.remove(r), s.Uo.delete(e), Aa(s);
     } else await Ir(s.localStore, e, 
-    /* keepPersistedTargetData */ !1).then((() => pc(s, e, n))).catch(qi);
+    /* keepPersistedTargetData */ !1).then((() => pa(s, e, n))).catch(qi);
 }
 
-async function wc(t, e) {
+async function wa(t, e) {
     const n = K(t), s = e.batch.batchId;
     try {
         const t = await mr(n.localStore, e);
@@ -13166,14 +13166,14 @@ async function wc(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 qi(t);
     }
 }
 
-async function _c(t, e, n) {
+async function _a(t, e, n) {
     const s = K(t);
     try {
         const t = await function(t, e) {
@@ -13193,8 +13193,8 @@ async function _c(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 qi(n);
     }
@@ -13203,7 +13203,7 @@ async function _c(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);
     po(n.remoteStore) || F("SyncEngine", "The network is disabled. The task returned by 'awaitPendingWrites()' will not complete until the network is enabled.");
     try {
@@ -13225,13 +13225,13 @@ async function _c(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) {
+ */ function ga(t, e) {
     (t.jo.get(e) || []).forEach((t => {
         t.resolve();
     })), t.jo.delete(e);
 }
 
-/** Reject all outstanding callbacks waiting for pending writes to complete. */ function 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.Ko[s.currentUser.toKey()];
     // NOTE: Mutations restored from persistence won't have callbacks, so it's
@@ -13242,39 +13242,39 @@ async function _c(t, e, n) {
     }
 }
 
-function pc(t, e, n = null) {
+function pa(t, e, n = null) {
     t.sharedClientState.removeLocalQueryTarget(e);
     for (const s of t.Mo.get(e)) t.Oo.delete(s), n && t.Fo.zo(s, n);
     if (t.Mo.delete(e), t.isPrimaryClient) {
         t.qo.us(e).forEach((e => {
             t.qo.containsKey(e) || 
             // We removed the last reference for this key
-            Tc(t, e);
+            Ta(t, e);
         }));
     }
 }
 
-function Tc(t, e) {
+function Ta(t, e) {
     t.Lo.delete(e.path.canonicalString());
     // It's possible that the target already got removed because the query failed. In that case,
     // the key won't exist in `limboTargetsByKey`. Only do the cleanup if we still have the target.
     const n = t.Bo.get(e);
-    null !== n && (wo(t.remoteStore, n), t.Bo = t.Bo.remove(e), t.Uo.delete(n), Ac(t));
+    null !== n && (wo(t.remoteStore, n), t.Bo = t.Bo.remove(e), t.Uo.delete(n), Aa(t));
 }
 
-function Ec(t, e, n) {
-    for (const s of n) if (s instanceof ec) t.qo.addReference(s.key, e), Ic(t, s); else if (s instanceof nc) {
+function Ea(t, e, n) {
+    for (const s of n) if (s instanceof ea) t.qo.addReference(s.key, e), Ia(t, s); else if (s instanceof na) {
         F("SyncEngine", "Document no longer in limbo: " + s.key), t.qo.removeReference(s.key, e);
         t.qo.containsKey(s.key) || 
         // We removed the last reference for this key
-        Tc(t, s.key);
+        Ta(t, s.key);
     } else B();
 }
 
-function Ic(t, e) {
+function Ia(t, e) {
     const n = e.key, s = n.path.canonicalString();
     t.Bo.get(n) || t.Lo.has(s) || (F("SyncEngine", "New document in limbo: " + n), t.Lo.add(s), 
-    Ac(t));
+    Aa(t));
 }
 
 /**
@@ -13284,27 +13284,27 @@ function Ic(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) {
+ */ function Aa(t) {
     for (;t.Lo.size > 0 && t.Bo.size < t.maxConcurrentLimboResolutions; ) {
         const e = t.Lo.values().next().value;
         t.Lo.delete(e);
         const n = new Ct(wt.fromString(e)), s = t.Qo.next();
-        t.Uo.set(s, new rc(n)), t.Bo = t.Bo.insert(n, s), fo(t.remoteStore, new ui(be(pe(n.path)), s, 2 /* LimboResolution */ , nt.I));
+        t.Uo.set(s, new ra(n)), t.Bo = t.Bo.insert(n, s), fo(t.remoteStore, new ui(Pe(pe(n.path)), s, 2 /* LimboResolution */ , nt.I));
     }
 }
 
-async function Rc(t, e, n) {
+async function Ra(t, e, n) {
     const s = K(t), i = [], r = [], o = [];
-    s.Oo.isEmpty() || (s.Oo.forEach(((t, c) => {
-        o.push(s.Go(c, e, n).then((t => {
+    s.Oo.isEmpty() || (s.Oo.forEach(((t, a) => {
+        o.push(s.Go(a, e, n).then((t => {
             if (t) {
-                s.isPrimaryClient && s.sharedClientState.updateQueryState(c.targetId, t.fromCache ? "not-current" : "current"), 
+                s.isPrimaryClient && s.sharedClientState.updateQueryState(a.targetId, t.fromCache ? "not-current" : "current"), 
                 i.push(t);
-                const e = lr.$n(c.targetId, t);
+                const e = lr.$n(a.targetId, t);
                 r.push(e);
             }
         })));
-    })), await Promise.all(o), s.Fo.Pr(i), await async function(t, e) {
+    })), await Promise.all(o), s.Fo.br(i), await async function(t, e) {
         const n = K(t);
         try {
             await n.persistence.runTransaction("notifyLocalViewChanges", "readwrite", (t => Hs.forEach(e, (e => Hs.forEach(e.kn, (s => n.persistence.referenceDelegate.addReference(t, e.targetId, s))).next((() => Hs.forEach(e.xn, (s => n.persistence.referenceDelegate.removeReference(t, e.targetId, s)))))))));
@@ -13327,7 +13327,7 @@ async function Rc(t, e, n) {
     }(s.localStore, r));
 }
 
-async function Pc(t, e) {
+async function ba(t, e) {
     const n = K(t);
     if (!n.currentUser.isEqual(e)) {
         F("SyncEngine", "User change. New user:", e.toKey());
@@ -13342,11 +13342,11 @@ async function Pc(t, e) {
             })), t.jo.clear();
         }(n, "'waitForPendingWrites' promise is rejected due to a user change."), 
         // TODO(b/114226417): Consider calling this only in the primary tab.
-        n.sharedClientState.handleUserChange(e, t.removedBatchIds, t.addedBatchIds), await Rc(n, t.Gn);
+        n.sharedClientState.handleUserChange(e, t.removedBatchIds, t.addedBatchIds), await Ra(n, t.Gn);
     }
 }
 
-function bc(t, e) {
+function Pa(t, e) {
     const n = K(t), s = n.Uo.get(e);
     if (s && s.$o) return Cn().add(s.key);
     {
@@ -13355,7 +13355,7 @@ function bc(t, e) {
         if (!s) return t;
         for (const e of s) {
             const s = n.Oo.get(e);
-            t = t.unionWith(s.view.Po);
+            t = t.unionWith(s.view.bo);
         }
         return t;
     }
@@ -13364,10 +13364,10 @@ function bc(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 Ar(n.localStore, e.query, 
     /* usePreviousResults= */ !0), i = e.view.ko(s);
-    return n.isPrimaryClient && Ec(n, e.targetId, i.Co), i;
+    return n.isPrimaryClient && Ea(n, e.targetId, i.Co), i;
 }
 
 /**
@@ -13375,14 +13375,14 @@ function bc(t, e) {
  * snapshots if needed.
  */
 // PORTING NOTE: Multi-Tab only.
-async function Vc(t) {
+async function Va(t) {
     const e = K(t);
-    return Pr(e.localStore).then((t => Rc(e, t)));
+    return br(e.localStore).then((t => Ra(e, 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.An);
         return n.persistence.runTransaction("Lookup mutation documents", "readonly", (t => s.Zt(t, e).next((e => e ? n.Wn.vn(t, e) : Hs.resolve(null)))));
@@ -13393,14 +13393,14 @@ async function Sc(t, e, n, s) {
     // If we are the primary client, we need to send this write to the
     // backend. Secondary clients will ignore these writes since their remote
     // connection is disabled.
-    await bo(i.remoteStore) : "acknowledged" === n || "rejected" === n ? (
+    await Po(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).An).ee(e);
     }
     // PORTING NOTE: Multi-Tab only.
-    (i.localStore, e)) : B(), await Rc(i, r)) : 
+    (i.localStore, e)) : B(), 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
@@ -13413,26 +13413,26 @@ 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 (Fc(n), Oc(n), !0 === e && !0 !== n.Wo) {
+    if (Fa(n), Oa(n), !0 === e && !0 !== n.Wo) {
         // Secondary tabs only maintain Views for their local listeners and the
         // Views internal state may not be 100% populated (in particular
         // secondary tabs don't track syncedDocuments, the set of documents the
         // server considers to be in the target). So when a secondary becomes
         // primary, we need to need to make sure that all views for all targets
         // match the state on disk.
-        const t = n.sharedClientState.getAllActiveQueryTargets(), e = await Cc(n, t.toArray());
+        const t = n.sharedClientState.getAllActiveQueryTargets(), e = await Ca(n, t.toArray());
         n.Wo = !0, await $o(n.remoteStore, !0);
         for (const t of e) fo(n.remoteStore, t);
     } else if (!1 === e && !1 !== n.Wo) {
         const t = [];
         let e = Promise.resolve();
         n.Mo.forEach(((s, i) => {
-            n.sharedClientState.isLocalQueryTarget(i) ? t.push(i) : e = e.then((() => (pc(n, i), 
+            n.sharedClientState.isLocalQueryTarget(i) ? t.push(i) : e = e.then((() => (pa(n, i), 
             Ir(n.localStore, i, 
             /*keepPersistedTargetData=*/ !0)))), wo(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);
@@ -13455,7 +13455,7 @@ async function Dc(t, e) {
     }
 }
 
-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;
@@ -13465,21 +13465,21 @@ async function Cc(t, e, n) {
             // from LocalStore (as the resume token and the snapshot version
             // might have changed) and reconcile their views with the persisted
             // state (the list of syncedDocuments may have gotten out of sync).
-            e = await Er(s.localStore, be(n[0]));
+            e = await Er(s.localStore, Pe(n[0]));
             for (const t of n) {
-                const e = s.Oo.get(t), n = await vc(s, e);
+                const e = s.Oo.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 Rr(s.localStore, t);
-            e = await Er(s.localStore, n), await ac(s, Nc(n), t, 
+            e = await Er(s.localStore, n), await ca(s, Na(n), t, 
             /*current=*/ !1);
         }
         i.push(e);
     }
-    return s.Fo.Pr(r), i;
+    return s.Fo.br(r), i;
 }
 
 /**
@@ -13493,20 +13493,20 @@ async function Cc(t, e, n) {
  * difference will not cause issues.
  */
 // PORTING NOTE: Multi-Tab only.
-function Nc(t) {
+function Na(t) {
     return ye(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 kc(t) {
+function ka(t) {
     const e = K(t);
     return K(K(e.localStore).persistence).Tn();
 }
 
 /** Applies a query target change from a different tab. */
 // PORTING NOTE: Multi-Tab only.
-async function xc(t, e, n, s) {
+async function xa(t, e, n, s) {
     const i = K(t);
     if (i.Wo) 
     // If we receive a target state notification via WebStorage, we are
@@ -13515,14 +13515,14 @@ async function xc(t, e, n, s) {
       case "current":
       case "not-current":
         {
-            const t = await Pr(i.localStore), s = xn.createSynthesizedRemoteEventForCurrentChange(e, "current" === n);
-            await Rc(i, t, s);
+            const t = await br(i.localStore), s = xn.createSynthesizedRemoteEventForCurrentChange(e, "current" === n);
+            await Ra(i, t, s);
             break;
         }
 
       case "rejected":
         await Ir(i.localStore, e, 
-        /* keepPersistedTargetData */ !0), pc(i, e, s);
+        /* keepPersistedTargetData */ !0), pa(i, e, s);
         break;
 
       default:
@@ -13530,8 +13530,8 @@ async function xc(t, e, n, s) {
     }
 }
 
-/** Adds or removes Watch targets for queries from different tabs. */ async function $c(t, e, n) {
-    const s = Fc(t);
+/** Adds or removes Watch targets for queries from different tabs. */ async function $a(t, e, n) {
+    const s = Fa(t);
     if (s.Wo) {
         for (const t of e) {
             if (s.Mo.has(t)) {
@@ -13540,7 +13540,7 @@ async function xc(t, e, n, s) {
                 continue;
             }
             const e = await Rr(s.localStore, t), n = await Er(s.localStore, e);
-            await ac(s, Nc(e), n.targetId, 
+            await ca(s, Na(e), n.targetId, 
             /*current=*/ !1), fo(s.remoteStore, n);
         }
         for (const t of n) 
@@ -13550,21 +13550,21 @@ async function xc(t, e, n, s) {
         // Release queries that are still active.
         await Ir(s.localStore, t, 
         /* keepPersistedTargetData */ !1).then((() => {
-            wo(s.remoteStore, t), pc(s, t);
+            wo(s.remoteStore, t), pa(s, t);
         })).catch(qi);
     }
 }
 
-function Fc(t) {
+function Fa(t) {
     const e = K(t);
-    return e.remoteStore.remoteSyncer.applyRemoteEvent = lc.bind(null, e), e.remoteStore.remoteSyncer.getRemoteKeysForTarget = bc.bind(null, e), 
-    e.remoteStore.remoteSyncer.rejectListen = dc.bind(null, e), e.Fo.Pr = Go.bind(null, e.eventManager), 
+    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.Fo.br = Go.bind(null, e.eventManager), 
     e.Fo.zo = zo.bind(null, e.eventManager), e;
 }
 
-function Oc(t) {
+function Oa(t) {
     const e = K(t);
-    return e.remoteStore.remoteSyncer.applySuccessfulWrite = wc.bind(null, e), e.remoteStore.remoteSyncer.rejectFailedWrite = _c.bind(null, e), 
+    return e.remoteStore.remoteSyncer.applySuccessfulWrite = wa.bind(null, e), e.remoteStore.remoteSyncer.rejectFailedWrite = _a.bind(null, e), 
     e;
 }
 
@@ -13575,7 +13575,7 @@ function Oc(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 Mc(t, e, n) {
+ */ function Ma(t, e, n) {
     const s = K(t);
     // eslint-disable-next-line @typescript-eslint/no-floating-promises
         (async function(t, e, n) {
@@ -13596,7 +13596,7 @@ function Oc(t) {
                     totalBytes: t.totalBytes
                 };
             }(s));
-            n._updateProgress(tc(s));
+            n._updateProgress(ta(s));
             const i = new Zo(s, t.localStore, e.k);
             let r = await e.Ho();
             for (;r; ) {
@@ -13607,7 +13607,7 @@ function Oc(t) {
             // TODO(b/160876443): This currently raises snapshots with
             // `fromCache=false` if users already listen to some queries and bundles
             // has newer version.
-                        await Rc(t, o.In, 
+                        await Ra(t, o.In, 
             /* remoteEvent */ void 0), 
             // Save metadata, so loading the same bundle will skip.
             await function(t, e) {
@@ -13646,7 +13646,7 @@ function Oc(t) {
     }));
 }
 
-class Lc {
+class La {
     constructor() {
         this.synchronizeTabs = !1;
     }
@@ -13674,14 +13674,14 @@ class Lc {
 
 /**
  * Provides all components needed for Firestore with IndexedDB persistence.
- */ class Bc extends Lc {
+ */ class Ba extends La {
     constructor(t, e, n) {
-        super(), this.tc = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;
+        super(), this.ta = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;
     }
     async initialize(t) {
-        await super.initialize(t), await br(this.localStore), await this.tc.initialize(this, t), 
+        await super.initialize(t), await Pr(this.localStore), await this.ta.initialize(this, t), 
         // Enqueue writes from a previous session
-        await Oc(this.tc.syncEngine), await bo(this.tc.remoteStore), 
+        await Oa(this.ta.syncEngine), await Po(this.ta.remoteStore), 
         // NOTE: This will immediately call the listener, so we make sure to
         // set it after localStore / remoteStore are started.
         await this.persistence.sn((() => (this.gcScheduler && !this.gcScheduler.started && this.gcScheduler.start(this.localStore), 
@@ -13695,7 +13695,7 @@ class Lc {
         return new Qi(e, t.asyncQueue);
     }
     Yo(t) {
-        const e = ar(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey), n = void 0 !== this.cacheSizeBytes ? Si.withCacheSize(this.cacheSizeBytes) : Si.DEFAULT;
+        const e = cr(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey), n = void 0 !== this.cacheSizeBytes ? Si.withCacheSize(this.cacheSizeBytes) : Si.DEFAULT;
         return new rr(this.synchronizeTabs, e, t.clientId, n, t.asyncQueue, to(), eo(), this.k, this.sharedClientState, !!this.forceOwnership);
     }
     Jo(t) {
@@ -13710,30 +13710,30 @@ class Lc {
  * 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 Bc {
+ */ class Ua extends Ba {
     constructor(t, e) {
-        super(t, e, /* forceOwnership= */ !1), this.tc = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;
+        super(t, e, /* forceOwnership= */ !1), this.ta = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;
     }
     async initialize(t) {
         await super.initialize(t);
-        const e = this.tc.syncEngine;
+        const e = this.ta.syncEngine;
         this.sharedClientState instanceof Gr && (this.sharedClientState.syncEngine = {
-            mi: Sc.bind(null, e),
-            gi: xc.bind(null, e),
-            yi: $c.bind(null, e),
-            Tn: kc.bind(null, e),
-            _i: Vc.bind(null, e)
+            mi: Sa.bind(null, e),
+            gi: xa.bind(null, e),
+            yi: $a.bind(null, e),
+            Tn: ka.bind(null, e),
+            _i: 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.sn((async t => {
-            await Dc(this.tc.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start(this.localStore) : t || this.gcScheduler.stop());
+            await Da(this.ta.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start(this.localStore) : t || this.gcScheduler.stop());
         }));
     }
     Jo(t) {
         const e = to();
-        if (!Gr.bt(e)) throw new Q(j.UNIMPLEMENTED, "IndexedDB persistence is only available on platforms that support LocalStorage.");
-        const n = ar(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey);
+        if (!Gr.Pt(e)) throw new Q(j.UNIMPLEMENTED, "IndexedDB persistence is only available on platforms that support LocalStorage.");
+        const n = cr(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey);
         return new Gr(e, t.asyncQueue, n, t.clientId, t.initialUser);
     }
 }
@@ -13741,13 +13741,13 @@ class Lc {
 /**
  * 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 = Pc.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 $o(this.remoteStore, this.syncEngine.isPrimaryClient));
     }
     createEventManager(t) {
@@ -13757,20 +13757,20 @@ class Lc {
         const e = no(t.databaseInfo.databaseId), n = (s = t.databaseInfo, new Zr(s));
         var s;
         /** Return the Platform-specific connectivity monitor. */        return function(t, e, n, s) {
-            return new co(t, e, n, s);
+            return new ao(t, e, n, s);
         }(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 = Jr.bt() ? new Jr : new Hr, new uo(e, n, s, i, r);
+        return e = this.localStore, n = this.datastore, s = t.asyncQueue, i = t => fa(this.syncEngine, t, 0 /* RemoteStore */), 
+        r = Jr.Pt() ? new Jr : new Hr, new uo(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 c = new oc(t, e, n, s, i, r);
-            return o && (c.Wo = !0), c;
+            const a = new oa(t, e, n, s, i, r);
+            return o && (a.Wo = !0), a;
         }(this.localStore, this.remoteStore, this.eventManager, this.sharedClientState, t.initialUser, t.maxConcurrentLimboResolutions, e);
     }
     terminate() {
@@ -13812,7 +13812,7 @@ class Lc {
  * @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.
@@ -13878,7 +13878,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 jc {
+class ja {
     constructor(t) {
         this.observer = t, 
         /**
@@ -13888,15 +13888,15 @@ class jc {
         this.muted = !1;
     }
     next(t) {
-        this.observer.next && this.ec(this.observer.next, t);
+        this.observer.next && this.ea(this.observer.next, t);
     }
     error(t) {
-        this.observer.error ? this.ec(this.observer.error, t) : console.error("Uncaught Error in snapshot listener:", t);
+        this.observer.error ? this.ea(this.observer.error, t) : console.error("Uncaught Error in snapshot listener:", t);
     }
-    nc() {
+    na() {
         this.muted = !0;
     }
-    ec(t, e) {
+    ea(t, e) {
         this.muted || setTimeout((() => {
             this.muted || t(e);
         }), 0);
@@ -13924,32 +13924,32 @@ class jc {
  *
  * 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.sc = t, this.k = e, 
+        this.sa = t, this.k = e, 
         /** Cached bundle metadata. */
         this.metadata = new W, 
         /**
          * Internal buffer to hold bundle content, accumulating incomplete element
          * content.
          */
-        this.buffer = new Uint8Array, this.ic = new TextDecoder("utf-8"), 
+        this.buffer = new Uint8Array, this.ia = new TextDecoder("utf-8"), 
         // Read the metadata (which is the first element).
-        this.rc().then((t => {
+        this.ra().then((t => {
             t && t._o() ? this.metadata.resolve(t.payload.metadata) : this.metadata.reject(new Error(`The first element of the bundle is not a metadata, it is\n             ${JSON.stringify(null == t ? void 0 : t.payload)}`));
         }), (t => this.metadata.reject(t)));
     }
     close() {
-        return this.sc.cancel();
+        return this.sa.cancel();
     }
     async getMetadata() {
         return this.metadata.promise;
     }
     async Ho() {
         // Makes sure metadata is read before proceeding.
-        return await this.getMetadata(), this.rc();
+        return await this.getMetadata(), this.ra();
     }
     /**
      * Reads from the head of internal buffer, and pulling more data from
@@ -13960,15 +13960,15 @@ class jc {
      *
      * Returns either the bundled element, or null if we have reached the end of
      * the stream.
-     */    async rc() {
-        const t = await this.oc();
+     */    async ra() {
+        const t = await this.oa();
         if (null === t) return null;
-        const e = this.ic.decode(t), n = Number(e);
-        isNaN(n) && this.cc(`length string (${e}) is not valid number`);
-        const s = await this.ac(n);
+        const e = this.ia.decode(t), n = Number(e);
+        isNaN(n) && this.aa(`length string (${e}) is not valid number`);
+        const s = await this.ca(n);
         return new Yo(JSON.parse(s), t.length + n);
     }
-    /** First index of '{' from the underlying buffer. */    uc() {
+    /** First index of '{' from the underlying buffer. */    ua() {
         return this.buffer.findIndex((t => t === "{".charCodeAt(0)));
     }
     /**
@@ -13976,17 +13976,17 @@ class jc {
      * return the content.
      *
      * If reached end of the stream, returns a null.
-     */    async oc() {
-        for (;this.uc() < 0; ) {
-            if (await this.hc()) break;
+     */    async oa() {
+        for (;this.ua() < 0; ) {
+            if (await this.ha()) 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.uc();
+        const t = this.ua();
         // Broke out of the loop because underlying stream is closed, but still
         // cannot find an open bracket.
-                t < 0 && this.cc("Reached the end of bundle when a length string is expected.");
+                t < 0 && this.aa("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;
@@ -13996,23 +13996,23 @@ class jc {
      * number of bytes, pulling more data from the underlying stream if needed.
      *
      * Returns a string decoded from the read bytes.
-     */    async ac(t) {
+     */    async ca(t) {
         for (;this.buffer.length < t; ) {
-            await this.hc() && this.cc("Reached the end of bundle when more is expected.");
+            await this.ha() && this.aa("Reached the end of bundle when more is expected.");
         }
-        const e = this.ic.decode(this.buffer.slice(0, t));
+        const e = this.ia.decode(this.buffer.slice(0, t));
         // Update the internal buffer to drop the read json string.
                 return this.buffer = this.buffer.slice(t), e;
     }
-    cc(t) {
+    aa(t) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        throw this.sc.cancel(), new Error(`Invalid bundle format: ${t}`);
+        throw this.sa.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 hc() {
-        const t = await this.sc.read();
+     */    async ha() {
+        const t = await this.sa.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;
@@ -14041,7 +14041,7 @@ class jc {
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
  */
-class Wc {
+class Wa {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -14069,11 +14069,11 @@ class Wc {
                 const e = os(n.k, t);
                 o.set(e.key.toString(), e);
             }));
-            const c = [];
+            const a = [];
             return e.forEach((t => {
                 const e = o.get(t.toString());
-                U(!!e), c.push(e);
-            })), c;
+                U(!!e), a.push(e);
+            })), a;
         }(this.datastore, t);
         return e.forEach((t => this.recordVersion(t))), e;
     }
@@ -14105,7 +14105,7 @@ class Wc {
             this.mutations.push(new dn(n, this.precondition(n)));
         })), await async function(t, e) {
             const n = K(t), s = ns(n.k) + "/documents", i = {
-                writes: e.map((t => as(n.k, t)))
+                writes: e.map((t => cs(n.k, t)))
             };
             await n.Bi("Commit", s, i);
         }(this.datastore, this.mutations), this.committed = !0;
@@ -14182,29 +14182,29 @@ class Wc {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class Gc {
+class Ga {
     constructor(t, e, n, s) {
         this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = s, 
-        this.lc = 5, this.ur = new so(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.la = 5, this.ur = new so(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
-        this.lc -= 1, this.fc();
+        this.la -= 1, this.fa();
     }
-    fc() {
+    fa() {
         this.ur.Zi((async () => {
-            const t = new Wc(this.datastore), e = this.dc(t);
+            const t = new Wa(this.datastore), e = this.da(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
                 })).catch((t => {
-                    this.wc(t);
+                    this.wa(t);
                 }))));
             })).catch((t => {
-                this.wc(t);
+                this.wa(t);
             }));
         }));
     }
-    dc(t) {
+    da(t) {
         try {
             const e = this.updateFunction(t);
             return !Vt(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
@@ -14214,11 +14214,11 @@ class Gc {
             return this.deferred.reject(t), null;
         }
     }
-    wc(t) {
-        this.lc > 0 && this._c(t) ? (this.lc -= 1, this.asyncQueue.enqueueAndForget((() => (this.fc(), 
+    wa(t) {
+        this.la > 0 && this._a(t) ? (this.la -= 1, this.asyncQueue.enqueueAndForget((() => (this.fa(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
-    _c(t) {
+    _a(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.
@@ -14250,7 +14250,7 @@ class Gc {
  * 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
@@ -14308,7 +14308,7 @@ class zc {
     }
 }
 
-async function Hc(t, e) {
+async function Ha(t, e) {
     t.asyncQueue.verifyOperationInProgress(), F("FirestoreClient", "Initializing OfflineComponentProvider");
     const n = await t.getConfiguration();
     await e.initialize(n);
@@ -14321,9 +14321,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);
     F("FirestoreClient", "Initializing OnlineComponentProvider");
     const s = await t.getConfiguration();
     await e.initialize(n, s), 
@@ -14343,41 +14343,41 @@ async function Jc(t, e) {
     }(e.remoteStore, t))), t.onlineComponents = e;
 }
 
-async function Yc(t) {
+async function Ya(t) {
     return t.offlineComponents || (F("FirestoreClient", "Using default OfflineComponentProvider"), 
-    await Hc(t, new Lc)), t.offlineComponents;
+    await Ha(t, new La)), t.offlineComponents;
 }
 
-async function Xc(t) {
+async function Xa(t) {
     return t.onlineComponents || (F("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 = cc.bind(null, e.syncEngine), n.onUnlisten = uc.bind(null, e.syncEngine), 
+async function sc(t) {
+    const e = await Xa(t), n = e.eventManager;
+    return n.onListen = aa.bind(null, e.syncEngine), n.onUnlisten = ua.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.Gr.delete(0 /* UserDisabled */), ho(e);
@@ -14385,9 +14385,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.Gr.add(0 /* UserDisabled */), await lo(e), 
@@ -14401,7 +14401,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 W;
     return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {
         try {
@@ -14418,19 +14418,19 @@ 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 ca(t, e, n = {}) {
+function ac(t, e, n = {}) {
     const s = new W;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new jc({
+        const r = new ja({
             next: r => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
                 e.enqueueAndForget((() => Wo(t, o)));
-                const c = r.docs.has(n);
-                !c && r.fromCache ? 
+                const a = r.docs.has(n);
+                !a && r.fromCache ? 
                 // TODO(dimond): If we're online and the document doesn't
                 // exist then we resolve with a doc.exists set to false. If
                 // we're offline however, we reject the Promise in this
@@ -14438,7 +14438,7 @@ function ca(t, e, n = {}) {
                 // the server so we can deliver that even when you're
                 // offline 2) Actually reject the Promise in the online case
                 // if the document doesn't exist.
-                i.reject(new Q(j.UNAVAILABLE, "Failed to get document because the client is offline.")) : c && r.fromCache && s && "server" === s.source ? i.reject(new Q(j.UNAVAILABLE, 'Failed to get document from server. (However, this document does exist in the local cache. Run again without setting source to "server" to retrieve the cached document.)')) : i.resolve(r);
+                i.reject(new Q(j.UNAVAILABLE, "Failed to get document because the client is offline.")) : a && r.fromCache && s && "server" === s.source ? i.reject(new Q(j.UNAVAILABLE, 'Failed to get document from server. (However, this document does exist in the local cache. Run again without setting source to "server" to retrieve the cached document.)')) : i.resolve(r);
             },
             error: t => i.reject(t)
         }), o = new Jo(pe(n.path), r, {
@@ -14446,15 +14446,15 @@ function ca(t, e, n = {}) {
             wo: !0
         });
         return Qo(t, o);
-    }(await sa(t), t.asyncQueue, e, n, s))), s.promise;
+    }(await sc(t), t.asyncQueue, e, n, s))), s.promise;
 }
 
-function aa(t, e) {
+function cc(t, e) {
     const n = new W;
     return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {
         try {
             const s = await Ar(t, e, 
-            /* usePreviousResults= */ !0), i = new sc(e, s.zn), r = i.bo(s.documents), o = i.applyChanges(r, 
+            /* usePreviousResults= */ !0), i = new sa(e, s.zn), r = i.Po(s.documents), o = i.applyChanges(r, 
             /* updateLimboDocuments= */ !1);
             n.resolve(o.snapshot);
         } catch (t) {
@@ -14465,13 +14465,13 @@ function aa(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 ua(t, e, n = {}) {
+function uc(t, e, n = {}) {
     const s = new W;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new jc({
+        const r = new ja({
             next: n => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
@@ -14483,20 +14483,20 @@ function ua(t, e, n = {}) {
             wo: !0
         });
         return Qo(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 jc(e);
+function hc(t, e) {
+    const n = new ja(e);
     return t.asyncQueue.enqueueAndForget((async () => function(t, e) {
         K(t).io.add(e), 
         // Immediately fire an initial event, indicating all existing listeners
         // are in-sync.
         e.next();
-    }(await sa(t), n))), () => {
-        n.nc(), t.asyncQueue.enqueueAndForget((async () => function(t, e) {
+    }(await sc(t), n))), () => {
+        n.na(), t.asyncQueue.enqueueAndForget((async () => function(t, e) {
             K(t).io.delete(e);
-        }(await sa(t), n)));
+        }(await sc(t), n)));
     };
 }
 
@@ -14514,25 +14514,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) {
+ */ function lc(t, e) {
     const n = new W;
     return t.asyncQueue.enqueueAndForget((async () => {
         const s = await function(t) {
-            return Xc(t).then((t => t.datastore));
+            return Xa(t).then((t => t.datastore));
         }(t);
-        new Gc(t.asyncQueue, s, e, n).run();
+        new Ga(t.asyncQueue, s, e, n).run();
     })), n.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);
@@ -14554,18 +14554,18 @@ function fa(t, e, n, s) {
  * limitations under the License.
  */ (n, no(e));
     t.asyncQueue.enqueueAndForget((async () => {
-        Mc(await na(t), i, s);
+        Ma(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.Ye.getNamedQuery(t, e)));
-    }(await ta(t), e)));
+    }(await tc(t), e)));
 }
 
-class wa {
+class wc {
     /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -14583,9 +14583,9 @@ class wa {
      * @param useFetchStreams Whether to use the Fetch API instead of
      * XMLHTTPRequest
      */
-    constructor(t, e, n, s, i, r, o, c) {
+    constructor(t, e, n, s, i, r, o, a) {
         this.databaseId = t, this.appId = e, this.persistenceKey = n, this.host = s, this.ssl = i, 
-        this.forceLongPolling = r, this.autoDetectLongPolling = o, this.useFetchStreams = c;
+        this.forceLongPolling = r, this.autoDetectLongPolling = o, this.useFetchStreams = a;
     }
 }
 
@@ -14594,7 +14594,7 @@ class wa {
  * Represents the database ID a Firestore client is associated with.
  * @internal
  */
-class _a {
+class _c {
     constructor(t, e) {
         this.projectId = t, this.database = e || "(default)";
     }
@@ -14602,7 +14602,7 @@ class _a {
         return "(default)" === this.database;
     }
     isEqual(t) {
-        return t instanceof _a && t.projectId === this.projectId && t.database === this.database;
+        return t instanceof _c && t.projectId === this.projectId && t.database === this.database;
     }
 }
 
@@ -14621,7 +14621,7 @@ class _a {
  * 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 ma = new Map;
+ */ const mc = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -14643,28 +14643,28 @@ class _a {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function ga(t, e, n) {
+function gc(t, e, n) {
     if (!n) throw new Q(j.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 ya(t, e, n, s) {
+ */ function yc(t, e, n, s) {
     if (!0 === e && !0 === s) throw new Q(j.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 pa(t) {
+ */ function pc(t) {
     if (!Ct.isDocumentKey(t)) throw new Q(j.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 Ta(t) {
+ */ function Tc(t) {
     if (Ct.isDocumentKey(t)) throw new Q(j.INVALID_ARGUMENT, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
@@ -14673,7 +14673,7 @@ function ga(t, e, n) {
  * (i.e. excludes Array, Date, etc.).
  */
 /** Returns a string describing the type / value of the provided input. */
-function Ea(t) {
+function Ec(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)}...`), 
@@ -14702,7 +14702,7 @@ function Ea(t) {
     return "function" == typeof t ? "a function" : B();
 }
 
-function Ia(t, 
+function Ic(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     if ("_delegate" in t && (
@@ -14711,14 +14711,14 @@ e) {
     t = t._delegate), !(t instanceof e)) {
         if (e.name === t.constructor.name) throw new Q(j.INVALID_ARGUMENT, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
-            const n = Ea(t);
+            const n = Ec(t);
             throw new Q(j.INVALID_ARGUMENT, `Expected type '${e.name}', but it was: ${n}`);
         }
     }
     return t;
 }
 
-function Aa(t, e) {
+function Ac(t, e) {
     if (e <= 0) throw new Q(j.INVALID_ARGUMENT, `Function ${t}() requires a positive number, but it was: ${e}.`);
 }
 
@@ -14744,7 +14744,7 @@ function Aa(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 Ra {
+class Rc {
     constructor(t) {
         var e;
         if (void 0 === t.host) {
@@ -14757,7 +14757,7 @@ class Ra {
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
-        this.useFetchStreams = !!t.useFetchStreams, ya("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
+        this.useFetchStreams = !!t.useFetchStreams, yc("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;
@@ -14784,18 +14784,18 @@ class Ra {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class Pa {
+ */ class bc {
     /** @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 Ra({}), 
-        this._settingsFrozen = !1, t instanceof _a ? this._databaseId = t : (this._app = t, 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new Rc({}), 
+        this._settingsFrozen = !1, t instanceof _c ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
             if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new Q(j.INVALID_ARGUMENT, '"projectId" not provided in firebase.initializeApp.');
-            return new _a(t.options.projectId);
+            return new _c(t.options.projectId);
         }
         /**
  * Modify this instance to communicate with the Cloud Firestore emulator.
@@ -14826,7 +14826,7 @@ class Ra {
     }
     _setSettings(t) {
         if (this._settingsFrozen) throw new Q(j.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 Ra(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new Rc(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new z;
             switch (t.type) {
               case "gapi":
@@ -14871,15 +14871,15 @@ class Ra {
  * when the `Firestore` instance is terminated.
  */
         return function(t) {
-            const e = ma.get(t);
-            e && (F("ComponentProvider", "Removing Datastore"), ma.delete(t), e.terminate());
+            const e = mc.get(t);
+            e && (F("ComponentProvider", "Removing Datastore"), mc.delete(t), e.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function ba(t, e, n, s = {}) {
+function Pc(t, e, n, s = {}) {
     var i;
-    const r = (t = Ia(t, Pa))._getSettings();
+    const r = (t = Ic(t, bc))._getSettings();
     if ("firestore.googleapis.com" !== r.host && r.host !== e && M("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, r), {
         host: `${e}:${n}`,
@@ -14918,7 +14918,7 @@ function ba(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 va {
+ */ class vc {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -14946,17 +14946,17 @@ function ba(t, e, n, s = {}) {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new Sa(this.firestore, this.converter, this._key.path.popLast());
+        return new Sc(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new va(this.firestore, t, this._key);
+        return new vc(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 Va {
+ */ class Vc {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -14969,14 +14969,14 @@ function ba(t, e, n, s = {}) {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new Va(this.firestore, t, this._query);
+        return new Vc(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 Sa extends Va {
+ */ class Sc extends Vc {
     /** @hideconstructor */
     constructor(t, e, n) {
         super(t, e, pe(n)), this._path = n, 
@@ -14997,23 +14997,23 @@ function ba(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 va(this.firestore, 
+        return t.isEmpty() ? null : new vc(this.firestore, 
         /* converter= */ null, new Ct(t));
     }
     withConverter(t) {
-        return new Sa(this.firestore, t, this._path);
+        return new Sc(this.firestore, t, this._path);
     }
 }
 
-function Da(t, e, ...n) {
-    if (t = p(t), ga("collection", "path", e), t instanceof Pa) {
+function Dc(t, e, ...n) {
+    if (t = p(t), gc("collection", "path", e), t instanceof bc) {
         const s = wt.fromString(e, ...n);
-        return Ta(s), new Sa(t, /* converter= */ null, s);
+        return Tc(s), new Sc(t, /* converter= */ null, s);
     }
     {
-        if (!(t instanceof va || t instanceof Sa)) throw new Q(j.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof vc || t instanceof Sc)) throw new Q(j.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(wt.fromString(e, ...n));
-        return Ta(s), new Sa(t.firestore, 
+        return Tc(s), new Sc(t.firestore, 
         /* converter= */ null, s);
     }
 }
@@ -15030,9 +15030,9 @@ function Da(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 Ca(t, e) {
-    if (t = Ia(t, Pa), ga("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new Q(j.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new Va(t, 
+ */ function Cc(t, e) {
+    if (t = Ic(t, bc), gc("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new Q(j.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new Vc(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
@@ -15043,19 +15043,19 @@ function Da(t, e, ...n) {
     }(e));
 }
 
-function Na(t, e, ...n) {
+function Nc(t, e, ...n) {
     if (t = p(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = it.A()), ga("doc", "path", e), t instanceof Pa) {
+    1 === arguments.length && (e = it.A()), gc("doc", "path", e), t instanceof bc) {
         const s = wt.fromString(e, ...n);
-        return pa(s), new va(t, 
+        return pc(s), new vc(t, 
         /* converter= */ null, new Ct(s));
     }
     {
-        if (!(t instanceof va || t instanceof Sa)) throw new Q(j.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof vc || t instanceof Sc)) throw new Q(j.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(wt.fromString(e, ...n));
-        return pa(s), new va(t.firestore, t instanceof Sa ? t.converter : null, new Ct(s));
+        return pc(s), new vc(t.firestore, t instanceof Sc ? t.converter : null, new Ct(s));
     }
 }
 
@@ -15066,8 +15066,8 @@ function Na(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 ka(t, e) {
-    return t = p(t), e = p(e), (t instanceof va || t instanceof Sa) && (e instanceof va || e instanceof Sa) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+ */ function kc(t, e) {
+    return t = p(t), e = p(e), (t instanceof vc || t instanceof Sc) && (e instanceof vc || e instanceof Sc) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -15078,8 +15078,8 @@ function Na(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 = p(t), e = p(e), t instanceof Va && e instanceof Va && (t.firestore === e.firestore && Ve(t._query, e._query) && t.converter === e.converter);
+ */ function xc(t, e) {
+    return t = p(t), e = p(e), t instanceof Vc && e instanceof Vc && (t.firestore === e.firestore && Ve(t._query, e._query) && t.converter === e.converter);
 }
 
 /**
@@ -15097,42 +15097,42 @@ function Na(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 $a {
+ */ class $c {
     constructor() {
         // The last promise in the queue.
-        this.mc = Promise.resolve(), 
+        this.ma = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.gc = [], 
+        this.ga = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.yc = !1, 
+        this.ya = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.Tc = [], 
+        this.pa = [], 
         // visible for testing
-        this.Ec = null, 
+        this.Ta = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.Ic = !1, 
+        this.Ea = !1, 
         // Enabled during shutdown on Safari to prevent future access to IndexedDB.
-        this.Ac = !1, 
+        this.Ia = !1, 
         // List of TimerIds to fast-forward delays for.
-        this.Rc = [], 
+        this.Aa = [], 
         // Backoff timer used to schedule retries for retryable operations
         this.ur = new so(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.Pc = () => {
+        this.Ra = () => {
             const t = eo();
             t && F("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.ur.er();
         };
         const t = eo();
-        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Pc);
+        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ra);
     }
     get isShuttingDown() {
-        return this.yc;
+        return this.ya;
     }
     /**
      * Adds a new operation to the queue without waiting for it to complete (i.e.
@@ -15142,44 +15142,44 @@ function Na(t, e, ...n) {
         this.enqueue(t);
     }
     enqueueAndForgetEvenWhileRestricted(t) {
-        this.bc(), 
+        this.ba(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.vc(t);
+        this.Pa(t);
     }
     enterRestrictedMode(t) {
-        if (!this.yc) {
-            this.yc = !0, this.Ac = t || !1;
+        if (!this.ya) {
+            this.ya = !0, this.Ia = t || !1;
             const e = eo();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Pc);
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ra);
         }
     }
     enqueue(t) {
-        if (this.bc(), this.yc) 
+        if (this.ba(), this.ya) 
         // 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 W;
-        return this.vc((() => this.yc && this.Ac ? Promise.resolve() : (t().then(e.resolve, e.reject), 
+        return this.Pa((() => this.ya && this.Ia ? Promise.resolve() : (t().then(e.resolve, e.reject), 
         e.promise))).then((() => e.promise));
     }
     enqueueRetryable(t) {
-        this.enqueueAndForget((() => (this.gc.push(t), this.Vc())));
+        this.enqueueAndForget((() => (this.ga.push(t), this.va())));
     }
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
-     */    async Vc() {
-        if (0 !== this.gc.length) {
+     */    async va() {
+        if (0 !== this.ga.length) {
             try {
-                await this.gc[0](), this.gc.shift(), this.ur.reset();
+                await this.ga[0](), this.ga.shift(), this.ur.reset();
             } catch (t) {
                 if (!ti(t)) throw t;
  // Failure will be handled by AsyncQueue
                                 F("AsyncQueue", "Operation failed with retryable error: " + t);
             }
-            this.gc.length > 0 && 
+            this.ga.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
@@ -15190,12 +15190,12 @@ function Na(t, e, ...n) {
             // Since `backoffAndRun()` cancels an existing backoff and schedules a
             // new backoff on every call, there is only ever a single additional
             // operation in the queue.
-            this.ur.Zi((() => this.Vc()));
+            this.ur.Zi((() => this.va()));
         }
     }
-    vc(t) {
-        const e = this.mc.then((() => (this.Ic = !0, t().catch((t => {
-            this.Ec = t, this.Ic = !1;
+    Pa(t) {
+        const e = this.ma.then((() => (this.Ea = !0, t().catch((t => {
+            this.Ta = t, this.Ea = !1;
             const e = 
             /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -15227,38 +15227,38 @@ function Na(t, e, ...n) {
             // all further attempts to chain (via .then) will just short-circuit
             // and return the rejected Promise.
             throw O("INTERNAL UNHANDLED ERROR: ", e), t;
-        })).then((t => (this.Ic = !1, t))))));
-        return this.mc = e, e;
+        })).then((t => (this.Ea = !1, t))))));
+        return this.ma = e, e;
     }
     enqueueAfterDelay(t, e, n) {
-        this.bc(), 
+        this.ba(), 
         // Fast-forward delays for timerIds that have been overriden.
-        this.Rc.indexOf(t) > -1 && (e = 0);
-        const s = Mo.createAndSchedule(this, t, e, n, (t => this.Sc(t)));
-        return this.Tc.push(s), s;
+        this.Aa.indexOf(t) > -1 && (e = 0);
+        const s = Mo.createAndSchedule(this, t, e, n, (t => this.Va(t)));
+        return this.pa.push(s), s;
     }
-    bc() {
-        this.Ec && B();
+    ba() {
+        this.Ta && B();
     }
     verifyOperationInProgress() {}
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
-     */    async Dc() {
+     */    async Sa() {
         // 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.mc, await t;
-        } while (t !== this.mc);
+            t = this.ma, await t;
+        } while (t !== this.ma);
     }
     /**
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
-     */    Cc(t) {
-        for (const e of this.Tc) if (e.timerId === t) return !0;
+     */    Da(t) {
+        for (const e of this.pa) if (e.timerId === t) return !0;
         return !1;
     }
     /**
@@ -15267,28 +15267,28 @@ function Na(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.
-     */    Nc(t) {
+     */    Ca(t) {
         // Note that draining may generate more delayed ops, so we do that first.
-        return this.Dc().then((() => {
+        return this.Sa().then((() => {
             // Run ops in the same order they'd run if they ran naturally.
-            this.Tc.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
-            for (const e of this.Tc) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
-            return this.Dc();
+            this.pa.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
+            for (const e of this.pa) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
+            return this.Sa();
         }));
     }
     /**
      * For Tests: Skip all subsequent delays for a timer id.
-     */    kc(t) {
-        this.Rc.push(t);
+     */    Na(t) {
+        this.Aa.push(t);
     }
-    /** Called once a DelayedOperation is run or canceled. */    Sc(t) {
+    /** Called once a DelayedOperation is run or canceled. */    Va(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        const e = this.Tc.indexOf(t);
-        this.Tc.splice(e, 1);
+        const e = this.pa.indexOf(t);
+        this.pa.splice(e, 1);
     }
 }
 
-function Fa(t) {
+function Fc(t) {
     /**
  * Returns true if obj is an object and contains at least one of the specified
  * methods.
@@ -15323,7 +15323,7 @@ function Fa(t) {
  */ (t, [ "next", "error", "complete" ]);
 }
 
-class Oa {
+class Oc {
     constructor() {
         this._progressObserver = {}, this._taskCompletionResolver = new W, this._lastProgress = {
             taskState: "Running",
@@ -15407,27 +15407,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 La extends Pa {
+class Lc extends bc {
     /** @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 $a, this._persistenceKey = "name" in t ? t.name : "[DEFAULT]";
+        this.type = "firestore", this._queue = new $c, 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.
-        Ka(this), this._firestoreClient.terminate();
+        Kc(this), this._firestoreClient.terminate();
     }
 }
 
@@ -15441,7 +15441,7 @@ class La extends Pa {
  * be associated.
  * @param settings - A settings object to configure the {@link Firestore} instance.
  * @returns A newly initialized {@link Firestore} instance.
- */ function Ba(t, e) {
+ */ function Bc(t, e) {
     const n = _getProvider(t, "firestore");
     if (n.isInitialized()) {
         const t = n.getImmediate(), s = n.getOptions();
@@ -15462,22 +15462,22 @@ class La extends Pa {
  * @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 Ua(e = t()) {
+ */ function Uc(e = t()) {
     return _getProvider(e, "firestore").getImmediate();
 }
 
 /**
  * @internal
- */ function qa(t) {
-    return t._firestoreClient || Ka(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;
+ */ function qc(t) {
+    return t._firestoreClient || Kc(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;
 }
 
-function Ka(t) {
+function Kc(t) {
     var e;
     const n = t._freezeSettings(), s = function(t, e, n, s) {
-        return new wa(t, e, n, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams);
+        return new wc(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);
 }
 
 /**
@@ -15502,10 +15502,10 @@ function Ka(t) {
  * @param persistenceSettings - Optional settings object to configure
  * persistence.
  * @returns A `Promise` that represents successfully enabling persistent storage.
- */ function ja(t, e) {
-    tu(t = Ia(t, La));
-    const n = qa(t), s = t._freezeSettings(), i = new qc;
-    return Wa(n, i, new Bc(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
+ */ function jc(t, e) {
+    tu(t = Ic(t, Lc));
+    const n = qc(t), s = t._freezeSettings(), i = new qa;
+    return Wc(n, i, new Ba(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
 }
 
 /**
@@ -15529,10 +15529,10 @@ function Ka(t) {
  * @param firestore - The {@link Firestore} instance to enable persistence for.
  * @returns A `Promise` that represents successfully enabling persistent
  * storage.
- */ function Qa(t) {
-    tu(t = Ia(t, La));
-    const e = qa(t), n = t._freezeSettings(), s = new qc;
-    return Wa(e, s, new Uc(s, n.cacheSizeBytes));
+ */ function Qc(t) {
+    tu(t = Ic(t, Lc));
+    const e = qc(t), n = t._freezeSettings(), s = new qa;
+    return Wc(e, s, new Ua(s, n.cacheSizeBytes));
 }
 
 /**
@@ -15540,11 +15540,11 @@ function Ka(t) {
  * If the operation fails with a recoverable error (see
  * `canRecoverFromIndexedDbError()` below), the returned Promise is rejected
  * but the client remains usable.
- */ function Wa(t, e, n) {
+ */ function Wc(t, e, n) {
     const s = new W;
     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) {
             if (!
             /**
@@ -15598,16 +15598,16 @@ function Ka(t) {
     })).then((() => s.promise));
 }
 
-function Ga(t) {
+function Gc(t) {
     if (t._initialized && !t._terminated) throw new Q(j.FAILED_PRECONDITION, "Persistence can only be cleared before a Firestore instance is initialized or after it is terminated.");
     const e = new W;
     return t._queue.enqueueAndForgetEvenWhileRestricted((async () => {
         try {
             await async function(t) {
-                if (!Ys.bt()) return Promise.resolve();
+                if (!Ys.Pt()) return Promise.resolve();
                 const e = t + "main";
                 await Ys.delete(e);
-            }(ar(t._databaseId, t._persistenceKey)), e.resolve();
+            }(cr(t._databaseId, t._persistenceKey)), e.resolve();
         } catch (t) {
             e.reject(t);
         }
@@ -15629,11 +15629,11 @@ function Ga(t) {
  *
  * @returns A `Promise` which resolves when all currently pending writes have been
  * acknowledged by the backend.
- */ function za(t) {
+ */ function zc(t) {
     return function(t) {
         const e = new W;
-        return t.asyncQueue.enqueueAndForget((async () => mc(await na(t), e))), e.promise;
-    }(qa(t = Ia(t, La)));
+        return t.asyncQueue.enqueueAndForget((async () => ma(await nc(t), e))), e.promise;
+    }(qc(t = Ic(t, Lc)));
 }
 
 /**
@@ -15641,8 +15641,8 @@ function Ga(t) {
  * call to {@link disableNetwork}.
  *
  * @returns A `Promise` that is resolved once the network has been enabled.
- */ function Ha(t) {
-    return ia(qa(t = Ia(t, La)));
+ */ function Hc(t) {
+    return ic(qc(t = Ic(t, Lc)));
 }
 
 /**
@@ -15652,8 +15652,8 @@ function Ga(t) {
  * operations will be queued until the network is restored.
  *
  * @returns A `Promise` that is resolved once the network has been disabled.
- */ function Ja(t) {
-    return ra(qa(t = Ia(t, La)));
+ */ function Jc(t) {
+    return rc(qc(t = Ic(t, Lc)));
 }
 
 /**
@@ -15677,7 +15677,7 @@ function Ga(t) {
  *
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function Ya(t) {
+ */ function Yc(t) {
     return e(t.app, "firestore"), t._delete();
 }
 
@@ -15691,9 +15691,9 @@ function Ga(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 Xa(t, e) {
-    const n = qa(t = Ia(t, La)), s = new Oa;
-    return fa(n, t._databaseId, e, s), s;
+ */ function Xc(t, e) {
+    const n = qc(t = Ic(t, Lc)), s = new Oc;
+    return fc(n, t._databaseId, e, s), s;
 }
 
 /**
@@ -15702,8 +15702,8 @@ function Ga(t) {
  * The named queries are packaged  into bundles on the server side (along
  * with resulting documents), and loaded to local cache using `loadBundle`. Once in local
  * cache, use this method to extract a {@link Query} by name.
- */ function Za(t, e) {
-    return da(qa(t = Ia(t, La)), e).then((e => e ? new Va(t, null, e.query) : null));
+ */ function Zc(t, e) {
+    return dc(qc(t = Ic(t, Lc)), e).then((e => e ? new Vc(t, null, e.query) : null));
 }
 
 function tu(t) {
@@ -15963,23 +15963,23 @@ class eu {
  * limitations under the License.
  */ const ou = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class cu {
+/** The result of parsing document data (e.g. for a setData call). */ class au {
     constructor(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return null !== this.fieldMask ? new an(t, this.data, this.fieldMask, e, this.fieldTransforms) : new cn(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new cn(t, this.data, this.fieldMask, e, this.fieldTransforms) : new an(t, this.data, e, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class au {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class cu {
     constructor(t, 
     // The fieldMask does not include document transforms.
     e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return new an(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new cn(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }
 }
 
@@ -16024,55 +16024,55 @@ function uu(t) {
         this.settings = t, this.databaseId = e, this.k = n, this.ignoreUndefinedProperties = s, 
         // Minor hack: If fieldTransforms is undefined, we assume this is an
         // external call and we need to validate the entire path.
-        void 0 === i && this.xc(), this.fieldTransforms = i || [], this.fieldMask = r || [];
+        void 0 === i && this.ka(), this.fieldTransforms = i || [], this.fieldMask = r || [];
     }
     get path() {
         return this.settings.path;
     }
-    get $c() {
-        return this.settings.$c;
+    get xa() {
+        return this.settings.xa;
     }
-    /** Returns a new context with the specified settings overwritten. */    Fc(t) {
+    /** Returns a new context with the specified settings overwritten. */    $a(t) {
         return new hu(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.k, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
-    Oc(t) {
+    Fa(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.Fc({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.$a({
             path: n,
-            Mc: !1
+            Oa: !1
         });
-        return s.Lc(t), s;
+        return s.Ma(t), s;
     }
-    Bc(t) {
+    La(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.Fc({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.$a({
             path: n,
-            Mc: !1
+            Oa: !1
         });
-        return s.xc(), s;
+        return s.ka(), s;
     }
-    Uc(t) {
+    Ba(t) {
         // TODO(b/34871131): We don't support array paths right now; so make path
         // undefined.
-        return this.Fc({
+        return this.$a({
             path: void 0,
-            Mc: !0
+            Oa: !0
         });
     }
-    qc(t) {
-        return Du(t, this.settings.methodName, this.settings.Kc || !1, this.path, this.settings.jc);
+    Ua(t) {
+        return Du(t, this.settings.methodName, this.settings.qa || !1, this.path, this.settings.Ka);
     }
     /** 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() {
+    ka() {
         // 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.Lc(this.path.get(t));
+        if (this.path) for (let t = 0; t < this.path.length; t++) this.Ma(this.path.get(t));
     }
-    Lc(t) {
-        if (0 === t.length) throw this.qc("Document fields must not be empty");
-        if (uu(this.$c) && ou.test(t)) throw this.qc('Document fields cannot begin and end with "__"');
+    Ma(t) {
+        if (0 === t.length) throw this.Ua("Document fields must not be empty");
+        if (uu(this.xa) && ou.test(t)) throw this.Ua('Document fields cannot begin and end with "__"');
     }
 }
 
@@ -16083,14 +16083,14 @@ function uu(t) {
     constructor(t, e, n) {
         this.databaseId = t, this.ignoreUndefinedProperties = e, this.k = n || no(t);
     }
-    /** Creates a new top-level parse context. */    Qc(t, e, n, s = !1) {
+    /** Creates a new top-level parse context. */    ja(t, e, n, s = !1) {
         return new hu({
-            $c: t,
+            xa: t,
             methodName: e,
-            jc: n,
+            Ka: n,
             path: mt.emptyPath(),
-            Mc: !1,
-            Kc: s
+            Oa: !1,
+            qa: s
         }, this.databaseId, this.k, this.ignoreUndefinedProperties);
     }
 }
@@ -16101,25 +16101,25 @@ function fu(t) {
 }
 
 /** Parse document data from a set() call. */ function du(t, e, n, s, i, r = {}) {
-    const o = t.Qc(r.merge || r.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
-    bu("Data must be an object, but it was:", o, s);
-    const c = Ru(s, o);
-    let a, u;
-    if (r.merge) a = new gt(o.fieldMask), u = o.fieldTransforms; else if (r.mergeFields) {
+    const o = t.ja(r.merge || r.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
+    Pu("Data must be an object, but it was:", o, s);
+    const a = Ru(s, o);
+    let c, u;
+    if (r.merge) c = new gt(o.fieldMask), u = o.fieldTransforms; else if (r.mergeFields) {
         const t = [];
         for (const s of r.mergeFields) {
             const i = vu(e, s, n);
             if (!o.contains(i)) throw new Q(j.INVALID_ARGUMENT, `Field '${i}' is specified in your field mask but missing from your input data.`);
             Cu(t, i) || t.push(i);
         }
-        a = new gt(t), u = o.fieldTransforms.filter((t => a.covers(t.field)));
-    } else a = null, u = o.fieldTransforms;
-    return new cu(new Wt(c), a, u);
+        c = new gt(t), u = o.fieldTransforms.filter((t => c.covers(t.field)));
+    } else c = null, u = o.fieldTransforms;
+    return new au(new Wt(a), c, u);
 }
 
 class wu extends iu {
     _toFieldTransform(t) {
-        if (2 /* MergeSet */ !== t.$c) throw 1 /* Update */ === t.$c ? t.qc(`${this._methodName}() can only appear at the top level of your update data`) : t.qc(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
+        if (2 /* MergeSet */ !== t.xa) throw 1 /* Update */ === t.xa ? t.Ua(`${this._methodName}() can only appear at the top level of your update data`) : t.Ua(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
         // 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;
@@ -16146,10 +16146,10 @@ class wu extends iu {
  * @param arrayElement - Whether or not the FieldValue has an array.
  */ function _u(t, e, n) {
     return new hu({
-        $c: 3 /* Argument */ ,
-        jc: e.settings.jc,
+        xa: 3 /* Argument */ ,
+        Ka: e.settings.Ka,
         methodName: t._methodName,
-        Mc: n
+        Oa: n
     }, e.databaseId, e.k, e.ignoreUndefinedProperties);
 }
 
@@ -16164,11 +16164,11 @@ class mu extends iu {
 
 class gu extends iu {
     constructor(t, e) {
-        super(t), this.Wc = e;
+        super(t), this.Qa = e;
     }
     _toFieldTransform(t) {
         const e = _u(this, t, 
-        /*array=*/ !0), n = this.Wc.map((t => Au(t, e))), s = new qe(n);
+        /*array=*/ !0), n = this.Qa.map((t => Au(t, e))), s = new qe(n);
         return new He(t.path, s);
     }
     isEqual(t) {
@@ -16179,11 +16179,11 @@ class gu extends iu {
 
 class yu extends iu {
     constructor(t, e) {
-        super(t), this.Wc = e;
+        super(t), this.Qa = e;
     }
     _toFieldTransform(t) {
         const e = _u(this, t, 
-        /*array=*/ !0), n = this.Wc.map((t => Au(t, e))), s = new je(n);
+        /*array=*/ !0), n = this.Qa.map((t => Au(t, e))), s = new je(n);
         return new He(t.path, s);
     }
     isEqual(t) {
@@ -16194,10 +16194,10 @@ class yu extends iu {
 
 class pu extends iu {
     constructor(t, e) {
-        super(t), this.Gc = e;
+        super(t), this.Wa = e;
     }
     _toFieldTransform(t) {
-        const e = new We(t.k, Fe(t.k, this.Gc));
+        const e = new We(t.k, Fe(t.k, this.Wa));
         return new He(t.path, e);
     }
     isEqual(t) {
@@ -16207,40 +16207,40 @@ class pu extends iu {
 }
 
 /** Parse update data from an update() call. */ function Tu(t, e, n, s) {
-    const i = t.Qc(1 /* Update */ , e, n);
-    bu("Data must be an object, but it was:", i, s);
+    const i = t.ja(1 /* Update */ , e, n);
+    Pu("Data must be an object, but it was:", i, s);
     const r = [], o = Wt.empty();
     lt(s, ((t, s) => {
-        const c = Su(e, t, n);
+        const a = Su(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 s = p(s);
-        const a = i.Bc(c);
+        const c = i.La(a);
         if (s instanceof wu) 
         // Add it to the field mask, but don't add anything to updateData.
-        r.push(c); else {
-            const t = Au(s, a);
-            null != t && (r.push(c), o.set(c, t));
+        r.push(a); else {
+            const t = Au(s, c);
+            null != t && (r.push(a), o.set(a, t));
         }
     }));
-    const c = new gt(r);
-    return new au(o, c, i.fieldTransforms);
+    const a = new gt(r);
+    return new cu(o, a, i.fieldTransforms);
 }
 
 /** Parse update data from a list of field/value arguments. */ function Eu(t, e, n, s, i, r) {
-    const o = t.Qc(1 /* Update */ , e, n), c = [ vu(e, s, n) ], a = [ i ];
+    const o = t.ja(1 /* Update */ , e, n), a = [ vu(e, s, n) ], c = [ i ];
     if (r.length % 2 != 0) throw new Q(j.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) c.push(vu(e, r[t])), a.push(r[t + 1]);
+    for (let t = 0; t < r.length; t += 2) a.push(vu(e, r[t])), c.push(r[t + 1]);
     const u = [], h = Wt.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 = c.length - 1; t >= 0; --t) if (!Cu(u, c[t])) {
-        const e = c[t];
-        let n = a[t];
+    for (let t = a.length - 1; t >= 0; --t) if (!Cu(u, a[t])) {
+        const e = a[t];
+        let n = c[t];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 n = p(n);
-        const s = o.Bc(e);
+        const s = o.La(e);
         if (n instanceof wu) 
         // Add it to the field mask, but don't add anything to updateData.
         u.push(e); else {
@@ -16249,7 +16249,7 @@ class pu extends iu {
         }
     }
     const l = new gt(u);
-    return new au(h, l, o.fieldTransforms);
+    return new cu(h, l, o.fieldTransforms);
 }
 
 /**
@@ -16259,7 +16259,7 @@ class pu extends iu {
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
  */ function Iu(t, e, n, s = !1) {
-    return Au(n, t.Qc(s ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+    return Au(n, t.ja(s ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -16271,10 +16271,10 @@ class pu extends iu {
  * @returns The parsed value, or null if the value was a FieldValue sentinel
  * that should not be included in the resulting parsed data.
  */ function Au(t, e) {
-    if (Pu(
+    if (bu(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = p(t))) return bu("Unsupported field value:", e, t), Ru(t, e);
+    t = p(t))) return Pu("Unsupported field value:", e, t), Ru(t, e);
     if (t instanceof iu) 
     // FieldValues usually parse into transforms (except FieldValue.delete())
     // in which case we do not want to include this field in our parsed data
@@ -16287,8 +16287,8 @@ class pu extends iu {
  */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!uu(e.$c)) throw e.qc(`${t._methodName}() can only be used with update() and set()`);
-        if (!e.path) throw e.qc(`${t._methodName}() is not currently supported inside arrays`);
+        if (!uu(e.xa)) throw e.Ua(`${t._methodName}() can only be used with update() and set()`);
+        if (!e.path) throw e.Ua(`${t._methodName}() is not currently supported inside arrays`);
         const n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
     }
@@ -16312,12 +16312,12 @@ class pu extends iu {
         // 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.Mc && 4 /* ArrayArgument */ !== e.$c) throw e.qc("Nested arrays are not supported");
+        if (e.settings.Oa && 4 /* ArrayArgument */ !== e.xa) throw e.Ua("Nested arrays are not supported");
         return function(t, e) {
             const n = [];
             let s = 0;
             for (const i of t) {
-                let t = Au(i, e.Uc(s));
+                let t = Au(i, e.Ba(s));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -16344,16 +16344,16 @@ class pu extends iu {
             stringValue: t
         };
         if (t instanceof Date) {
-            const n = at.fromDate(t);
+            const n = ct.fromDate(t);
             return {
                 timestampValue: Wn(e.k, n)
             };
         }
-        if (t instanceof at) {
+        if (t instanceof ct) {
             // Firestore backend truncates precision down to microseconds. To ensure
             // offline mode works the same with regards to truncation, perform the
             // truncation immediately without waiting for the backend to do that.
-            const n = new at(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            const n = new ct(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
                 timestampValue: Wn(e.k, n)
             };
@@ -16367,14 +16367,14 @@ class pu extends iu {
         if (t instanceof su) return {
             bytesValue: Gn(e.k, t._byteString)
         };
-        if (t instanceof va) {
+        if (t instanceof vc) {
             const n = e.databaseId, s = t.firestore._databaseId;
-            if (!s.isEqual(n)) throw e.qc(`Document reference is for database ${s.projectId}/${s.database} but should be for database ${n.projectId}/${n.database}`);
+            if (!s.isEqual(n)) throw e.Ua(`Document reference is for database ${s.projectId}/${s.database} but should be for database ${n.projectId}/${n.database}`);
             return {
                 referenceValue: Jn(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.qc(`Unsupported field value: ${Ea(t)}`);
+        throw e.Ua(`Unsupported field value: ${Ec(t)}`);
     }
     /**
  * Checks whether an object looks like a JSON object that should be converted
@@ -16391,7 +16391,7 @@ function Ru(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 = Au(s, e.Oc(t));
+        const i = Au(s, e.Fa(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -16400,16 +16400,16 @@ function Ru(t, e) {
     };
 }
 
-function Pu(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof at || t instanceof ru || t instanceof su || t instanceof va || t instanceof iu);
+function bu(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof ct || t instanceof ru || t instanceof su || t instanceof vc || t instanceof iu);
 }
 
-function bu(t, e, n) {
-    if (!Pu(n) || !function(t) {
+function Pu(t, e, n) {
+    if (!bu(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
-        const s = Ea(n);
-        throw "an object" === s ? e.qc(t + " a custom object") : e.qc(t + " " + s);
+        const s = Ec(n);
+        throw "an object" === s ? e.Ua(t + " a custom object") : e.Ua(t + " " + s);
     }
 }
 
@@ -16453,11 +16453,11 @@ function bu(t, e, n) {
 
 function Du(t, e, n, s, i) {
     const r = s && !s.isEmpty(), o = void 0 !== i;
-    let c = `Function ${e}() called with invalid data`;
-    n && (c += " (via `toFirestore()`)"), c += ". ";
-    let a = "";
-    return (r || o) && (a += " (found", r && (a += ` in field ${s}`), o && (a += ` in document ${i}`), 
-    a += ")"), new Q(j.INVALID_ARGUMENT, c + t + a);
+    let a = `Function ${e}() called with invalid data`;
+    n && (a += " (via `toFirestore()`)"), a += ". ";
+    let c = "";
+    return (r || o) && (c += " (found", r && (c += ` in field ${s}`), o && (c += ` in document ${i}`), 
+    c += ")"), new Q(j.INVALID_ARGUMENT, a + t + c);
 }
 
 /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Cu(t, e) {
@@ -16504,7 +16504,7 @@ function Du(t, e, n, s, i) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new va(this._firestore, this._converter, this._key);
+        return new vc(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -16812,7 +16812,7 @@ function Lu(t) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */ function Bu(t, e) {
-    return t instanceof Fu && e instanceof Fu ? 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 Mu && e instanceof Mu && (t._firestore === e._firestore && xa(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
+    return t instanceof Fu && e instanceof Fu ? 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 Mu && e instanceof Mu && (t._firestore === e._firestore && xc(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
 }
 
 /**
@@ -16858,27 +16858,27 @@ function Lu(t) {
 
 class ju extends qu {
     constructor(t, e, n) {
-        super(), this.zc = t, this.Hc = e, this.Jc = n, this.type = "where";
+        super(), this.Ga = t, this.za = e, this.Ha = n, this.type = "where";
     }
     _apply(t) {
         const e = fu(t.firestore), n = function(t, e, n, s, i, r, o) {
-            let c;
+            let a;
             if (i.isKeyField()) {
                 if ("array-contains" /* ARRAY_CONTAINS */ === r || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === r) throw new Q(j.INVALID_ARGUMENT, `Invalid Query. You can't perform '${r}' queries on FieldPath.documentId().`);
                 if ("in" /* IN */ === r || "not-in" /* NOT_IN */ === r) {
                     rh(o, r);
                     const e = [];
                     for (const n of o) e.push(ih(s, t, n));
-                    c = {
+                    a = {
                         arrayValue: {
                             values: e
                         }
                     };
-                } else c = ih(s, t, o);
+                } else a = ih(s, t, o);
             } else "in" /* IN */ !== r && "not-in" /* NOT_IN */ !== r && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== r || rh(o, r), 
-            c = Iu(n, e, o, 
+            a = Iu(n, e, o, 
             /* allowArrays= */ "in" /* IN */ === r || "not-in" /* NOT_IN */ === r);
-            const a = ee.create(i, r, c);
+            const c = ee.create(i, r, a);
             return function(t, e) {
                 if (e.V()) {
                     const n = Ae(t);
@@ -16926,9 +16926,9 @@ class ju extends qu {
                 if (null !== n) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
                 throw n === e.op ? new Q(j.INVALID_ARGUMENT, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new Q(j.INVALID_ARGUMENT, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
-            }(t, a), a;
-        }(t._query, "where", e, t.firestore._databaseId, this.zc, this.Hc, this.Jc);
-        return new Va(t.firestore, t.converter, function(t, e) {
+            }(t, c), c;
+        }(t._query, "where", e, t.firestore._databaseId, this.Ga, this.za, this.Ha);
+        return new Vc(t.firestore, t.converter, function(t, e) {
             const n = t.filters.concat([ e ]);
             return new ge(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
@@ -16952,7 +16952,7 @@ class ju extends qu {
 
 class Wu extends qu {
     constructor(t, e) {
-        super(), this.zc = t, this.Yc = e, this.type = "orderBy";
+        super(), this.Ga = t, this.Ja = e, this.type = "orderBy";
     }
     _apply(t) {
         const e = function(t, e, n) {
@@ -16977,8 +16977,8 @@ class Wu extends qu {
  * 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.zc, this.Yc);
-        return new Va(t.firestore, t.converter, function(t, e) {
+ */ (t._query, this.Ga, this.Ja);
+        return new Vc(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 ge(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
@@ -17001,10 +17001,10 @@ class Wu extends qu {
 
 class zu extends qu {
     constructor(t, e, n) {
-        super(), this.type = t, this.Xc = e, this.Zc = n;
+        super(), this.type = t, this.Ya = e, this.Xa = n;
     }
     _apply(t) {
-        return new Va(t.firestore, t.converter, ve(t._query, this.Xc, this.Zc));
+        return new Vc(t.firestore, t.converter, ve(t._query, this.Ya, this.Xa));
     }
 }
 
@@ -17014,7 +17014,7 @@ class zu extends qu {
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
  */ function Hu(t) {
-    return Aa("limit", t), new zu("limit", t, "F" /* First */);
+    return Ac("limit", t), new zu("limit", t, "F" /* First */);
 }
 
 /**
@@ -17026,16 +17026,16 @@ class zu extends qu {
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
  */ function Ju(t) {
-    return Aa("limitToLast", t), new zu("limitToLast", t, "L" /* Last */);
+    return Ac("limitToLast", t), new zu("limitToLast", t, "L" /* Last */);
 }
 
 class Yu extends qu {
     constructor(t, e, n) {
-        super(), this.type = t, this.ta = e, this.ea = n;
+        super(), this.type = t, this.Za = e, this.tc = n;
     }
     _apply(t) {
-        const e = sh(t, this.type, this.ta, this.ea);
-        return new Va(t.firestore, t.converter, function(t, e) {
+        const e = sh(t, this.type, this.Za, this.tc);
+        return new Vc(t.firestore, t.converter, function(t, e) {
             return new ge(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
@@ -17052,11 +17052,11 @@ function Zu(...t) {
 
 class th extends qu {
     constructor(t, e, n) {
-        super(), this.type = t, this.ta = e, this.ea = n;
+        super(), this.type = t, this.Za = e, this.tc = n;
     }
     _apply(t) {
-        const e = sh(t, this.type, this.ta, this.ea);
-        return new Va(t.firestore, t.converter, function(t, e) {
+        const e = sh(t, this.type, this.Za, this.tc);
+        return new Vc(t.firestore, t.converter, function(t, e) {
             return new ge(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
@@ -17081,9 +17081,9 @@ function nh(...t) {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-                for (const n of Pe(t)) if (n.field.isKeyField()) r.push(Lt(e, s.key)); else {
+                for (const n of be(t)) if (n.field.isKeyField()) r.push(Lt(e, s.key)); else {
             const t = s.data.field(n.field);
-            if (Pt(t)) throw new Q(j.INVALID_ARGUMENT, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+            if (bt(t)) throw new Q(j.INVALID_ARGUMENT, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
             if (null === t) {
                 const t = n.field.canonicalString();
                 throw new Q(j.INVALID_ARGUMENT, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
@@ -17101,22 +17101,22 @@ function nh(...t) {
             // Use explicit order by's because it has to match the query the user made
             const o = t.explicitOrderBy;
             if (i.length > o.length) throw new Q(j.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 c = [];
+            const a = [];
             for (let r = 0; r < i.length; r++) {
-                const a = i[r];
+                const c = i[r];
                 if (o[r].field.isKeyField()) {
-                    if ("string" != typeof a) throw new Q(j.INVALID_ARGUMENT, `Invalid query. Expected a string for document ID in ${s}(), but got a ${typeof a}`);
-                    if (!Re(t) && -1 !== a.indexOf("/")) throw new Q(j.INVALID_ARGUMENT, `Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to ${s}() must be a plain document ID, but '${a}' contains a slash.`);
-                    const n = t.path.child(wt.fromString(a));
+                    if ("string" != typeof c) throw new Q(j.INVALID_ARGUMENT, `Invalid query. Expected a string for document ID in ${s}(), but got a ${typeof c}`);
+                    if (!Re(t) && -1 !== c.indexOf("/")) throw new Q(j.INVALID_ARGUMENT, `Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to ${s}() must be a plain document ID, but '${c}' contains a slash.`);
+                    const n = t.path.child(wt.fromString(c));
                     if (!Ct.isDocumentKey(n)) throw new Q(j.INVALID_ARGUMENT, `Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to ${s}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
                     const i = new Ct(n);
-                    c.push(Lt(e, i));
+                    a.push(Lt(e, i));
                 } else {
-                    const t = Iu(n, s, a);
-                    c.push(t);
+                    const t = Iu(n, s, c);
+                    a.push(t);
                 }
             }
-            return new le(c, r);
+            return new le(a, r);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -17134,8 +17134,8 @@ function ih(t, e, n) {
         if (!Ct.isDocumentKey(s)) throw new Q(j.INVALID_ARGUMENT, `Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '${s}' is not because it has an odd number of segments (${s.length}).`);
         return Lt(t, new Ct(s));
     }
-    if (n instanceof va) return Lt(t, n._key);
-    throw new Q(j.INVALID_ARGUMENT, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${Ea(n)}.`);
+    if (n instanceof vc) return Lt(t, n._key);
+    throw new Q(j.INVALID_ARGUMENT, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${Ec(n)}.`);
 }
 
 /**
@@ -17171,7 +17171,7 @@ function oh(t, e, n) {
  * to the user.
  *
  * @internal
- */ class ch {
+ */ class ah {
     convertValue(t, e = "none") {
         switch (Nt(t)) {
           case 0 /* NullValue */ :
@@ -17226,7 +17226,7 @@ function oh(t, e, n) {
     convertServerTimestamp(t, e) {
         switch (e) {
           case "previous":
-            const n = bt(t);
+            const n = Pt(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
@@ -17238,12 +17238,12 @@ function oh(t, e, n) {
     }
     convertTimestamp(t) {
         const e = It(t);
-        return new at(e.seconds, e.nanos);
+        return new ct(e.seconds, e.nanos);
     }
     convertDocumentKey(t, e) {
         const n = wt.fromString(t);
-        U(Ps(n));
-        const s = new _a(n.get(1), n.get(3)), i = new Ct(n.popFirst(5));
+        U(bs(n));
+        const s = new _c(n.get(1), n.get(3)), i = new Ct(n.popFirst(5));
         return s.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
         O(`Document ${i} contains a document reference within a different database (${s.projectId}/${s.database}) which is not supported. It will be treated as a reference in the current database (${e.projectId}/${e.database}) instead.`), 
@@ -17275,7 +17275,7 @@ function oh(t, e, n) {
  * because we want to provide the user with a more specific error message if
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
- */ function ah(t, e, n) {
+ */ function ch(t, e, n) {
     let s;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -17284,7 +17284,7 @@ function oh(t, e, n) {
     s;
 }
 
-class uh extends ch {
+class uh extends ah {
     constructor(t) {
         super(), this.firestore = t;
     }
@@ -17293,7 +17293,7 @@ class uh extends ch {
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new va(this.firestore, /* converter= */ null, e);
+        return new vc(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -17328,7 +17328,7 @@ class uh extends ch {
     }
     set(t, e, n) {
         this._verifyNotCommitted();
-        const s = lh(t, this._firestore), i = ah(s.converter, e, n), r = du(this._dataReader, "WriteBatch.set", s._key, i, null !== s.converter, n);
+        const s = lh(t, this._firestore), i = ch(s.converter, e, n), r = du(this._dataReader, "WriteBatch.set", s._key, i, null !== s.converter, n);
         return this._mutations.push(r.toMutation(s._key, Xe.none())), this;
     }
     update(t, e, n, ...s) {
@@ -17428,12 +17428,12 @@ function lh(t, e) {
  * current document contents.
  */
 function fh(t) {
-    t = Ia(t, va);
-    const e = Ia(t.firestore, La);
-    return ca(qa(e), t._key).then((n => bh(e, t, n)));
+    t = Ic(t, vc);
+    const e = Ic(t.firestore, Lc);
+    return ac(qc(e), t._key).then((n => Ph(e, t, n)));
 }
 
-class dh extends ch {
+class dh extends ah {
     constructor(t) {
         super(), this.firestore = t;
     }
@@ -17442,7 +17442,7 @@ class dh extends ch {
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new va(this.firestore, /* converter= */ null, e);
+        return new vc(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -17453,9 +17453,9 @@ class dh extends ch {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function wh(t) {
-    t = Ia(t, va);
-    const e = Ia(t.firestore, La), n = qa(e), s = new dh(e);
-    return oa(n, t._key).then((n => new Fu(e, s, t._key, n, new $u(null !== n && n.hasLocalMutations, 
+    t = Ic(t, vc);
+    const e = Ic(t.firestore, Lc), n = qc(e), s = new dh(e);
+    return oc(n, t._key).then((n => new Fu(e, s, t._key, n, new $u(null !== n && n.hasLocalMutations, 
     /* fromCache= */ !0), t.converter)));
 }
 
@@ -17466,11 +17466,11 @@ class dh extends ch {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function _h(t) {
-    t = Ia(t, va);
-    const e = Ia(t.firestore, La);
-    return ca(qa(e), t._key, {
+    t = Ic(t, vc);
+    const e = Ic(t.firestore, Lc);
+    return ac(qc(e), t._key, {
         source: "server"
-    }).then((n => bh(e, t, n)));
+    }).then((n => Ph(e, t, n)));
 }
 
 /**
@@ -17483,9 +17483,9 @@ class dh extends ch {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function mh(t) {
-    t = Ia(t, Va);
-    const e = Ia(t.firestore, La), n = qa(e), s = new dh(e);
-    return Uu(t._query), ua(n, t._query).then((n => new Mu(e, s, t, n)));
+    t = Ic(t, Vc);
+    const e = Ic(t.firestore, Lc), n = qc(e), s = new dh(e);
+    return Uu(t._query), uc(n, t._query).then((n => new Mu(e, s, t, n)));
 }
 
 /**
@@ -17494,9 +17494,9 @@ class dh extends ch {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function gh(t) {
-    t = Ia(t, Va);
-    const e = Ia(t.firestore, La), n = qa(e), s = new dh(e);
-    return aa(n, t._query).then((n => new Mu(e, s, t, n)));
+    t = Ic(t, Vc);
+    const e = Ic(t.firestore, Lc), n = qc(e), s = new dh(e);
+    return cc(n, t._query).then((n => new Mu(e, s, t, n)));
 }
 
 /**
@@ -17505,28 +17505,28 @@ class dh extends ch {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function yh(t) {
-    t = Ia(t, Va);
-    const e = Ia(t.firestore, La), n = qa(e), s = new dh(e);
-    return ua(n, t._query, {
+    t = Ic(t, Vc);
+    const e = Ic(t.firestore, Lc), n = qc(e), s = new dh(e);
+    return uc(n, t._query, {
         source: "server"
     }).then((n => new Mu(e, s, t, n)));
 }
 
 function ph(t, e, n) {
-    t = Ia(t, va);
-    const s = Ia(t.firestore, La), i = ah(t.converter, e, n);
-    return Ph(s, [ du(fu(s), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Xe.none()) ]);
+    t = Ic(t, vc);
+    const s = Ic(t.firestore, Lc), i = ch(t.converter, e, n);
+    return bh(s, [ du(fu(s), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Xe.none()) ]);
 }
 
 function Th(t, e, n, ...s) {
-    t = Ia(t, va);
-    const i = Ia(t.firestore, La), r = fu(i);
+    t = Ic(t, vc);
+    const i = Ic(t.firestore, Lc), r = fu(i);
     let o;
     o = "string" == typeof (
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
     e = p(e)) || e instanceof eu ? Eu(r, "updateDoc", t._key, e, n, s) : Tu(r, "updateDoc", t._key, e);
-    return Ph(i, [ o.toMutation(t._key, Xe.exists(!0)) ]);
+    return bh(i, [ o.toMutation(t._key, Xe.exists(!0)) ]);
 }
 
 /**
@@ -17536,7 +17536,7 @@ function Th(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 Eh(t) {
-    return Ph(Ia(t.firestore, La), [ new fn(t._key, Xe.none()) ]);
+    return bh(Ic(t.firestore, Lc), [ new fn(t._key, Xe.none()) ]);
 }
 
 /**
@@ -17549,8 +17549,8 @@ function Th(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 Ih(t, e) {
-    const n = Ia(t.firestore, La), s = Na(t), i = ah(t.converter, e);
-    return Ph(n, [ du(fu(t.firestore), "addDoc", s._key, i, null !== t.converter, {}).toMutation(s._key, Xe.exists(!1)) ]).then((() => s));
+    const n = Ic(t.firestore, Lc), s = Nc(t), i = ch(t.converter, e);
+    return bh(n, [ du(fu(t.firestore), "addDoc", s._key, i, null !== t.converter, {}).toMutation(s._key, Xe.exists(!1)) ]).then((() => s));
 }
 
 function Ah(t, ...e) {
@@ -17559,27 +17559,27 @@ function Ah(t, ...e) {
     let r = {
         includeMetadataChanges: !1
     }, o = 0;
-    "object" != typeof e[o] || Fa(e[o]) || (r = e[o], o++);
-    const c = {
+    "object" != typeof e[o] || Fc(e[o]) || (r = e[o], o++);
+    const a = {
         includeMetadataChanges: r.includeMetadataChanges
     };
-    if (Fa(e[o])) {
+    if (Fc(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 a, u, h;
-    if (t instanceof va) u = Ia(t.firestore, La), h = pe(t._key.path), a = {
+    let c, u, h;
+    if (t instanceof vc) u = Ic(t.firestore, Lc), h = pe(t._key.path), c = {
         next: n => {
-            e[o] && e[o](bh(u, t, n));
+            e[o] && e[o](Ph(u, t, n));
         },
         error: e[o + 1],
         complete: e[o + 2]
     }; else {
-        const n = Ia(t, Va);
-        u = Ia(n.firestore, La), h = n._query;
+        const n = Ic(t, Vc);
+        u = Ic(n.firestore, Lc), h = n._query;
         const s = new dh(u);
-        a = {
+        c = {
             next: t => {
                 e[o] && e[o](new Mu(u, s, n, t));
             },
@@ -17588,15 +17588,15 @@ function Ah(t, ...e) {
         }, Uu(t._query);
     }
     return function(t, e, n, s) {
-        const i = new jc(s), r = new Jo(e, i, n);
-        return t.asyncQueue.enqueueAndForget((async () => Qo(await sa(t), r))), () => {
-            i.nc(), t.asyncQueue.enqueueAndForget((async () => Wo(await sa(t), r)));
+        const i = new ja(s), r = new Jo(e, i, n);
+        return t.asyncQueue.enqueueAndForget((async () => Qo(await sc(t), r))), () => {
+            i.na(), t.asyncQueue.enqueueAndForget((async () => Wo(await sc(t), r)));
         };
-    }(qa(u), h, c, a);
+    }(qc(u), h, a, c);
 }
 
 function Rh(t, e) {
-    return ha(qa(t = Ia(t, La)), Fa(e) ? e : {
+    return hc(qc(t = Ic(t, Lc)), Fc(e) ? e : {
         next: e
     });
 }
@@ -17604,17 +17604,17 @@ function Rh(t, e) {
 /**
  * Locally writes `mutations` on the async queue.
  * @internal
- */ function Ph(t, e) {
+ */ function bh(t, e) {
     return function(t, e) {
         const n = new W;
-        return t.asyncQueue.enqueueAndForget((async () => hc(await na(t), e, n))), n.promise;
-    }(qa(t), e);
+        return t.asyncQueue.enqueueAndForget((async () => ha(await nc(t), e, n))), n.promise;
+    }(qc(t), e);
 }
 
 /**
  * Converts a {@link ViewSnapshot} that contains the single document specified by `ref`
  * to a {@link DocumentSnapshot}.
- */ function bh(t, e, n) {
+ */ function Ph(t, e, n) {
     const s = n.docs.get(e._key), i = new dh(t);
     return new Fu(t, i, e._key, s, new $u(n.hasPendingWrites, n.fromCache), e.converter);
 }
@@ -17662,7 +17662,7 @@ function Rh(t, e) {
         }));
     }
     set(t, e, n) {
-        const s = lh(t, this._firestore), i = ah(s.converter, e, n), r = du(this._dataReader, "Transaction.set", s._key, i, null !== s.converter, n);
+        const s = lh(t, this._firestore), i = ch(s.converter, e, n), r = du(this._dataReader, "Transaction.set", s._key, i, null !== s.converter, n);
         return this._transaction.set(s._key, r), this;
     }
     update(t, e, n, ...s) {
@@ -17719,7 +17719,7 @@ function Rh(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */ function Vh(t, e) {
-    return la(qa(t = Ia(t, La)), (n => e(new vh(t, n))));
+    return lc(qc(t = Ic(t, Lc)), (n => e(new vh(t, n))));
 }
 
 /**
@@ -17834,7 +17834,7 @@ function Rh(t, e) {
  * @returns A {@link WriteBatch} that can be used to atomically execute multiple
  * writes.
  */ function xh(t) {
-    return qa(t = Ia(t, La)), new hh(t, (e => Ph(t, e)));
+    return qc(t = Ic(t, Lc)), new hh(t, (e => bh(t, e)));
 }
 
 /**
@@ -17856,14 +17856,14 @@ function Rh(t, e) {
     !function(t) {
         N = t;
     }(i), n(new r("firestore", ((t, {options: n}) => {
-        const s = t.getProvider("app").getImmediate(), i = new La(s, new J(t.getProvider("auth-internal")), new tt(t.getProvider("app-check-internal")));
+        const s = t.getProvider("app").getImmediate(), i = new Lc(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" /* PUBLIC */)), s(D, "3.4.0", t), 
+    }), "PUBLIC")), s(D, "3.4.1-canary.0db840a09", t), 
     // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-    s(D, "3.4.0", "esm2017");
+    s(D, "3.4.1-canary.0db840a09", "esm2017");
 }("rn", /* useFetchStreams= */ !1);
 
-export { ch as AbstractUserDataWriter, su as Bytes, Ma as CACHE_SIZE_UNLIMITED, Sa as CollectionReference, va as DocumentReference, Fu as DocumentSnapshot, eu as FieldPath, iu as FieldValue, La as Firestore, Q as FirestoreError, ru as GeoPoint, Oa as LoadBundleTask, Va as Query, qu as QueryConstraint, Ou as QueryDocumentSnapshot, Mu as QuerySnapshot, $u as SnapshotMetadata, at as Timestamp, vh as Transaction, hh as WriteBatch, _a as _DatabaseId, Ct as _DocumentKey, et as _EmptyAppCheckTokenProvider, z as _EmptyAuthCredentialsProvider, mt as _FieldPath, Ia as _cast, q as _debugAssert, pt as _isBase64Available, M as _logWarn, ya as _validateIsNotUsedTogether, Ih as addDoc, Nh as arrayRemove, Ch as arrayUnion, Ga as clearIndexedDbPersistence, Da as collection, Ca as collectionGroup, ba as connectFirestoreEmulator, Eh as deleteDoc, Sh as deleteField, Ja as disableNetwork, Na as doc, nu as documentId, ja as enableIndexedDbPersistence, Qa as enableMultiTabIndexedDbPersistence, Ha as enableNetwork, nh as endAt, eh as endBefore, qa as ensureFirestoreConfigured, Ph as executeWrite, fh as getDoc, wh as getDocFromCache, _h as getDocFromServer, mh as getDocs, gh as getDocsFromCache, yh as getDocsFromServer, Ua as getFirestore, kh as increment, Ba as initializeFirestore, Hu as limit, Ju as limitToLast, Xa as loadBundle, Za as namedQuery, Ah as onSnapshot, Rh as onSnapshotsInSync, Gu as orderBy, Ku as query, xa as queryEqual, ka as refEqual, Vh as runTransaction, Dh as serverTimestamp, ph as setDoc, $ as setLogLevel, Bu as snapshotEqual, Zu as startAfter, Xu as startAt, Ya as terminate, Th as updateDoc, za as waitForPendingWrites, Qu as where, xh as writeBatch };
+export { ah as AbstractUserDataWriter, su as Bytes, Mc as CACHE_SIZE_UNLIMITED, Sc as CollectionReference, vc as DocumentReference, Fu as DocumentSnapshot, eu as FieldPath, iu as FieldValue, Lc as Firestore, Q as FirestoreError, ru as GeoPoint, Oc as LoadBundleTask, Vc as Query, qu as QueryConstraint, Ou as QueryDocumentSnapshot, Mu as QuerySnapshot, $u as SnapshotMetadata, ct as Timestamp, vh as Transaction, hh as WriteBatch, _c as _DatabaseId, Ct as _DocumentKey, et as _EmptyAppCheckTokenProvider, z as _EmptyAuthCredentialsProvider, mt as _FieldPath, Ic as _cast, q as _debugAssert, pt as _isBase64Available, M as _logWarn, yc as _validateIsNotUsedTogether, Ih as addDoc, Nh as arrayRemove, Ch as arrayUnion, Gc as clearIndexedDbPersistence, Dc as collection, Cc as collectionGroup, Pc as connectFirestoreEmulator, Eh as deleteDoc, Sh as deleteField, Jc as disableNetwork, Nc as doc, nu as documentId, jc as enableIndexedDbPersistence, Qc as enableMultiTabIndexedDbPersistence, Hc as enableNetwork, nh as endAt, eh as endBefore, qc as ensureFirestoreConfigured, bh as executeWrite, fh as getDoc, wh as getDocFromCache, _h as getDocFromServer, mh as getDocs, gh as getDocsFromCache, yh as getDocsFromServer, Uc as getFirestore, kh as increment, Bc as initializeFirestore, Hu as limit, Ju as limitToLast, Xc as loadBundle, Zc as namedQuery, Ah as onSnapshot, Rh as onSnapshotsInSync, Gu as orderBy, Ku as query, xc as queryEqual, kc as refEqual, Vh as runTransaction, Dh as serverTimestamp, ph as setDoc, $ as setLogLevel, Bu as snapshotEqual, Zu as startAfter, Xu as startAt, Yc as terminate, Th as updateDoc, zc as waitForPendingWrites, Qu as where, xh as writeBatch };
 //# sourceMappingURL=index.rn.js.map