@firebase/firestore 3.0.2-canary.456d664ae → 3.0.2-canary.46d26ff96

package/dist/firestore/compat/api/database.d.ts

@@ -30,15 +30,6 @@ export interface PersistenceProvider {
     enableMultiTabIndexedDbPersistence(firestore: Firestore): Promise<void>;
     clearIndexedDbPersistence(firestore: Firestore): Promise<void>;
 }
-/**
- * The persistence provider included with the memory-only SDK. This provider
- * errors for all attempts to access persistence.
- */
-export declare class MemoryPersistenceProvider implements PersistenceProvider {
-    enableIndexedDbPersistence(firestore: Firestore, forceOwnership: boolean): Promise<void>;
-    enableMultiTabIndexedDbPersistence(firestore: Firestore): Promise<void>;
-    clearIndexedDbPersistence(firestore: Firestore): Promise<void>;
-}
 /**
  * The persistence provider included with the full Firestore SDK.
  */

package/dist/firestore/compat/index.console.d.ts

@@ -16,7 +16,7 @@
  */
 import { FirebaseAuthInternalName } from '@firebase/auth-interop-types';
 import { Provider } from '@firebase/component';
-import { Firestore as FirestoreCompat } from './api/database';
+import { Firestore as FirestoreCompat, PersistenceProvider } from './api/database';
 export { CollectionReference, DocumentReference, DocumentSnapshot, QuerySnapshot } from './api/database';
 export { Blob } from './api/blob';
 export { GeoPoint } from './api/geo_point';
@@ -27,6 +27,15 @@ export interface FirestoreDatabase {
     projectId: string;
     database?: string;
 }
+/**
+ * The persistence provider included with the memory-only SDK. This provider
+ * errors for all attempts to access persistence.
+ */
+export declare class MemoryPersistenceProvider implements PersistenceProvider {
+    enableIndexedDbPersistence(firestore: FirestoreCompat, forceOwnership: boolean): Promise<void>;
+    enableMultiTabIndexedDbPersistence(firestore: Firestore): Promise<void>;
+    clearIndexedDbPersistence(firestore: Firestore): Promise<void>;
+}
 /** Firestore class that exposes the constructor expected by the Console. */
 export declare class Firestore extends FirestoreCompat {
     constructor(firestoreDatabase: FirestoreDatabase, authProvider: Provider<FirebaseAuthInternalName>);

package/dist/index.esm2017.js

@@ -68,7 +68,7 @@ V.MOCK_USER = new V("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let S = "9.0.2-canary.456d664ae";
+let S = "9.0.2-canary.46d26ff96";
 
 /**
  * @license
@@ -17780,7 +17780,7 @@ function gh(t, e) {
     return e = Object.assign({
         useFetchStreams: !0
     }, e), s._setSettings(e), s;
-}), "PUBLIC" /* PUBLIC */)), s("@firebase/firestore", "3.0.2-canary.456d664ae", Vh);
+}), "PUBLIC" /* PUBLIC */)), s("@firebase/firestore", "3.0.2-canary.46d26ff96", Vh);
 
 export { th as AbstractUserDataWriter, Jc as Bytes, Cc as CACHE_SIZE_UNLIMITED, Ic as CollectionReference, Ec as DocumentReference, Su as DocumentSnapshot, zc as FieldPath, Yc as FieldValue, Nc as Firestore, q as FirestoreError, Xc as GeoPoint, Dc as LoadBundleTask, Tc as Query, $u as QueryConstraint, Du as QueryDocumentSnapshot, Cu as QuerySnapshot, Vu as SnapshotMetadata, nt as Timestamp, Eh as Transaction, sh as WriteBatch, cc as _DatabaseId, Rt as _DocumentKey, Q as _EmptyCredentialsProvider, ht as _FieldPath, _c as _cast, L as _debugAssert, ft as _isBase64Available, $ as _logWarn, lc as _validateIsNotUsedTogether, _h as addDoc, bh as arrayRemove, Rh as arrayUnion, Bc as clearIndexedDbPersistence, Ac as collection, Rc as collectionGroup, pc as connectFirestoreEmulator, wh as deleteDoc, Ih as deleteField, Kc as disableNetwork, bc as doc, Hc as documentId, Fc as enableIndexedDbPersistence, Mc as enableMultiTabIndexedDbPersistence, qc as enableNetwork, Hu as endAt, zu as endBefore, $c as ensureFirestoreConfigured, yh as executeWrite, rh as getDoc, ah as getDocFromCache, ch as getDocFromServer, uh as getDocs, hh as getDocsFromCache, lh as getDocsFromServer, kc as getFirestore, Ph as increment, xc as initializeFirestore, qu as limit, Ku as limitToLast, Qc as loadBundle, Wc as namedQuery, mh as onSnapshot, gh as onSnapshotsInSync, Bu as orderBy, Ou as query, vc as queryEqual, Pc as refEqual, Th as runTransaction, Ah as serverTimestamp, fh as setDoc, N as setLogLevel, xu as snapshotEqual, Wu as startAfter, Qu as startAt, jc as terminate, dh as updateDoc, Uc as waitForPendingWrites, Mu as where, vh as writeBatch };
 //# sourceMappingURL=index.esm2017.js.map

package/dist/index.esm5.js

@@ -69,7 +69,7 @@ L.MOCK_USER = new L("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var R = "9.0.2-canary.456d664ae", O = new h("@firebase/firestore");
+var R = "9.0.2-canary.46d26ff96", O = new h("@firebase/firestore");
 
 /**
  * @license
@@ -18379,7 +18379,7 @@ R = i, o(new c("firestore", (function(t, e) {
     return n = Object.assign({
         useFetchStreams: !0
     }, n), i._setSettings(n), i;
-}), "PUBLIC" /* PUBLIC */)), s("@firebase/firestore", "3.0.2-canary.456d664ae", undefined);
+}), "PUBLIC" /* PUBLIC */)), s("@firebase/firestore", "3.0.2-canary.46d26ff96", undefined);
 
 export { Bc as AbstractUserDataWriter, Mu as Bytes, gu as CACHE_SIZE_UNLIMITED, cu as CollectionReference, au as DocumentReference, vc as DocumentSnapshot, Pu as FieldPath, Vu as FieldValue, wu as Firestore, Q as FirestoreError, qu as GeoPoint, mu as LoadBundleTask, uu as Query, Tc as QueryConstraint, mc as QueryDocumentSnapshot, gc as QuerySnapshot, yc as SnapshotMetadata, st as Timestamp, ah as Transaction, zc as WriteBatch, Ya as _DatabaseId, At as _DocumentKey, Y as _EmptyCredentialsProvider, pt as _FieldPath, nu as _cast, j as _debugAssert, vt as _isBase64Available, q as _logWarn, $a as _validateIsNotUsedTogether, nh as addDoc, lh as arrayRemove, fh as arrayUnion, Du as clearIndexedDbPersistence, hu as collection, fu as collectionGroup, su as connectFirestoreEmulator, eh as deleteDoc, ch as deleteField, Cu as disableNetwork, lu as doc, Fu as documentId, Su as enableIndexedDbPersistence, Nu as enableMultiTabIndexedDbPersistence, ku as enableNetwork, Fc as endAt, Pc as endBefore, Tu as ensureFirestoreConfigured, oh as executeWrite, Qc as getDoc, Wc as getDocFromCache, Yc as getDocFromServer, Jc as getDocs, Xc as getDocsFromCache, $c as getDocsFromServer, Iu as getFirestore, dh as increment, bu as initializeFirestore, kc as limit, Cc as limitToLast, Lu as loadBundle, Ru as namedQuery, rh as onSnapshot, ih as onSnapshotsInSync, Dc as orderBy, Ec as query, pu as queryEqual, du as refEqual, uh as runTransaction, hh as serverTimestamp, Zc as setDoc, F as setLogLevel, bc as snapshotEqual, Rc as startAfter, Lc as startAt, xu as terminate, th as updateDoc, Au as waitForPendingWrites, Nc as where, ph as writeBatch };
 //# sourceMappingURL=index.esm5.js.map

package/dist/index.node.cjs.esm2017.js

@@ -10,7 +10,7 @@ import { resolve, join } from 'path';
 import { loadSync } from '@grpc/proto-loader';
 
 const name = "@firebase/firestore";
-const version$1 = "3.0.2-canary.456d664ae";
+const version$1 = "3.0.2-canary.46d26ff96";
 
 /**
  * @license
@@ -63,7 +63,7 @@ User.GOOGLE_CREDENTIALS = new User('google-credentials-uid');
 User.FIRST_PARTY = new User('first-party-uid');
 User.MOCK_USER = new User('mock-user');
 
-const version = "9.0.2-canary.456d664ae";
+const version = "9.0.2-canary.46d26ff96";
 
 /**
  * @license

package/dist/index.node.cjs.js

@@ -15,7 +15,7 @@ var path = require('path');
 var protoLoader = require('@grpc/proto-loader');
 
 var name = "@firebase/firestore";
-var version$1 = "3.0.2-canary.456d664ae";
+var version$1 = "3.0.2-canary.46d26ff96";
 /**
  * @license
  * Copyright 2017 Google LLC
@@ -67,7 +67,7 @@ User.UNAUTHENTICATED = new User(null);
 User.GOOGLE_CREDENTIALS = new User('google-credentials-uid');
 User.FIRST_PARTY = new User('first-party-uid');
 User.MOCK_USER = new User('mock-user');
-var version = "9.0.2-canary.456d664ae";
+var version = "9.0.2-canary.46d26ff96";
 /**
  * @license
  * Copyright 2017 Google LLC

package/dist/index.rn.js

@@ -2,9 +2,9 @@ import { _getProvider, getApp as t, _removeServiceInstance as e, _registerCompon
 
 import { Component as r } from "@firebase/component";
 
-import { Logger as o, LogLevel as a } from "@firebase/logger";
+import { Logger as o, LogLevel as c } from "@firebase/logger";
 
-import { base64 as c, getUA as u, isSafari as h, isMobileCordova as l, isReactNative as f, isElectron as d, isIE as w, isUWP as _, isBrowserExtension as m, createMockUserToken as g, getModularInstance as y, deepEqual as p } from "@firebase/util";
+import { base64 as a, getUA as u, isSafari as h, isMobileCordova as l, isReactNative as f, isElectron as d, isIE as w, isUWP as _, isBrowserExtension as m, createMockUserToken as g, getModularInstance as y, deepEqual as p } from "@firebase/util";
 
 import { XhrIo as E, EventType as T, ErrorCode as I, createWebChannelTransport as A, getStatEventTarget as R, FetchXmlHttpFactory as b, WebChannel as P, Event as v, Stat as V } from "@firebase/webchannel-wrapper";
 
@@ -68,7 +68,7 @@ S.MOCK_USER = new S("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let D = "9.0.2-canary.456d664ae";
+let D = "9.0.2-canary.46d26ff96";
 
 /**
  * @license
@@ -110,14 +110,14 @@ function N() {
 }
 
 function k(t, ...e) {
-    if (C.logLevel <= a.DEBUG) {
+    if (C.logLevel <= c.DEBUG) {
         const n = e.map(F);
         C.debug(`Firestore (${D}): ${t}`, ...n);
     }
 }
 
 function $(t, ...e) {
-    if (C.logLevel <= a.ERROR) {
+    if (C.logLevel <= c.ERROR) {
         const n = e.map(F);
         C.error(`Firestore (${D}): ${t}`, ...n);
     }
@@ -126,7 +126,7 @@ function $(t, ...e) {
 /**
  * @internal
  */ function O(t, ...e) {
-    if (C.logLevel <= a.WARN) {
+    if (C.logLevel <= c.WARN) {
         const n = e.map(F);
         C.warn(`Firestore (${D}): ${t}`, ...n);
     }
@@ -910,7 +910,7 @@ function ot(t, e) {
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
-function at(t) {
+function ct(t) {
     for (const e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
     return !0;
 }
@@ -934,7 +934,7 @@ function at(t) {
 /**
  * Path represents an ordered sequence of string segments.
  */
-class ct {
+class at {
     constructor(t, e, n) {
         void 0 === e ? e = 0 : e > t.length && M(), void 0 === n ? n = t.length - e : n > t.length - e && M(), 
         this.segments = t, this.offset = e, this.len = n;
@@ -943,11 +943,11 @@ class ct {
         return this.len;
     }
     isEqual(t) {
-        return 0 === ct.comparator(this, t);
+        return 0 === at.comparator(this, t);
     }
     child(t) {
         const e = this.segments.slice(this.offset, this.limit());
-        return t instanceof ct ? t.forEach((t => {
+        return t instanceof at ? t.forEach((t => {
             e.push(t);
         })) : e.push(t), this.construct(e);
     }
@@ -1004,7 +1004,7 @@ class ct {
  * within Firestore.
  *
  * @internal
- */ class ut extends ct {
+ */ class ut extends at {
     construct(t, e, n) {
         return new ut(t, e, n);
     }
@@ -1043,7 +1043,7 @@ const ht = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
 /**
  * A dot-separated path for navigating sub-objects within a document.
  * @internal
- */ class lt extends ct {
+ */ class lt extends at {
     construct(t, e, n) {
         return new lt(t, e, n);
     }
@@ -1174,7 +1174,7 @@ function dt(t) {
     // We use `decodeStringToByteArray()` instead of `decodeString()` since
     // `decodeString()` returns Unicode strings, which doesn't match the values
     // returned by `atob()`'s Latin1 representation.
-    c.decodeStringToByteArray(t, false));
+    a.decodeStringToByteArray(t, false));
 }
 
 /** Converts a binary string to a Base64 encoded string. */
@@ -1234,7 +1234,7 @@ function wt() {
         return function(t) {
             const e = [];
             for (let n = 0; n < t.length; n++) e[n] = t.charCodeAt(n);
-            return c.encodeByteArray(e, !1);
+            return a.encodeByteArray(e, !1);
         }(this.binaryString);
     }
     toUint8Array() {
@@ -2019,7 +2019,7 @@ function Wt(t) {
             // TODO(b/29183165): Make this collision robust.
             return t.field.canonicalString() + t.dir;
         }(t))).join(","), At(e.limit) || (t += "|l:", t += e.limit), e.startAt && (t += "|lb:", 
-        t += ae(e.startAt)), e.endAt && (t += "|ub:", t += ae(e.endAt)), e.A = t;
+        t += ce(e.startAt)), e.endAt && (t += "|ub:", t += ce(e.endAt)), e.A = t;
     }
     return e.A;
 }
@@ -2034,7 +2034,7 @@ function Gt(t) {
         /** Filter that matches on key fields (i.e. '__name__'). */    })).join(", ")}]`), 
     At(t.limit) || (e += ", limit: " + t.limit), t.orderBy.length > 0 && (e += `, orderBy: [${t.orderBy.map((t => function(t) {
         return `${t.field.canonicalString()} (${t.dir})`;
-    }(t))).join(", ")}]`), t.startAt && (e += ", startAt: " + ae(t.startAt)), t.endAt && (e += ", endAt: " + ae(t.endAt)), 
+    }(t))).join(", ")}]`), t.startAt && (e += ", startAt: " + ce(t.startAt)), t.endAt && (e += ", endAt: " + ce(t.endAt)), 
     `Target(${e})`;
 }
 
@@ -2202,14 +2202,14 @@ function ee(t, e) {
     }
 }
 
-function ae(t) {
+function ce(t) {
     // TODO(b/29183165): Make this collision robust.
     return `${t.before ? "b" : "a"}:${t.position.map((t => Nt(t))).join(",")}`;
 }
 
 /**
  * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
- */ class ce {
+ */ class ae {
     constructor(t, e = "asc" /* ASCENDING */) {
         this.field = t, this.dir = e;
     }
@@ -2271,16 +2271,16 @@ function le(t, e) {
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
      */
-    constructor(t, e = null, n = [], s = [], i = null, r = "F" /* First */ , o = null, a = null) {
+    constructor(t, e = null, n = [], s = [], i = null, r = "F" /* First */ , o = null, c = null) {
         this.path = t, this.collectionGroup = e, this.explicitOrderBy = n, this.filters = s, 
-        this.limit = i, this.limitType = r, this.startAt = o, this.endAt = a, this.V = null, 
+        this.limit = i, this.limitType = r, this.startAt = o, this.endAt = c, this.V = null, 
         // The corresponding `Target` of this `Query` instance.
         this.S = null, this.startAt, this.endAt;
     }
 }
 
-/** Creates a new Query instance with the options provided. */ function de(t, e, n, s, i, r, o, a) {
-    return new fe(t, e, n, s, i, r, o, a);
+/** Creates a new Query instance with the options provided. */ function de(t, e, n, s, i, r, o, c) {
+    return new fe(t, e, n, s, i, r, o, c);
 }
 
 /** Creates a new Query for a query that matches all documents at `path` */ function we(t) {
@@ -2334,14 +2334,14 @@ function pe(t) {
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
         // Note that the default inequality field and key ordering is ascending.
-        t.isKeyField() || e.V.push(new ce(t)), e.V.push(new ce(lt.keyField(), "asc" /* ASCENDING */)); else {
+        t.isKeyField() || e.V.push(new ae(t)), e.V.push(new ae(lt.keyField(), "asc" /* ASCENDING */)); else {
             let t = !1;
             for (const n of e.explicitOrderBy) e.V.push(n), n.field.isKeyField() && (t = !0);
             if (!t) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 const t = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* ASCENDING */;
-                e.V.push(new ce(lt.keyField(), t));
+                e.V.push(new ae(lt.keyField(), t));
             }
         }
     }
@@ -2357,7 +2357,7 @@ function pe(t) {
         const t = [];
         for (const n of Ee(e)) {
             const e = "desc" /* DESCENDING */ === n.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            t.push(new ce(n.field, e));
+            t.push(new ae(n.field, e));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
                 const n = e.endAt ? new oe(e.endAt.position, !e.endAt.before) : null, s = e.startAt ? new oe(e.startAt.position, !e.startAt.before) : null;
@@ -2934,8 +2934,8 @@ function sn(t) {
     const s = new Map;
     L(t.length === n.length);
     for (let i = 0; i < n.length; i++) {
-        const r = t[i], o = r.transform, a = e.data.field(r.field);
-        s.set(r.field, ke(o, a, n[i]));
+        const r = t[i], o = r.transform, c = e.data.field(r.field);
+        s.set(r.field, ke(o, c, n[i]));
     }
     return s;
 }
@@ -2960,13 +2960,13 @@ function sn(t) {
     return s;
 }
 
-/** A mutation that deletes the document at the given key. */ class an extends He {
+/** A mutation that deletes the document at the given key. */ class cn extends He {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 2 /* Delete */ , this.fieldTransforms = [];
     }
 }
 
-class cn extends He {
+class an extends He {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 3 /* Verify */ , this.fieldTransforms = [];
     }
@@ -3951,10 +3951,10 @@ class $n {
     /**
      * Processes and adds the DocumentWatchChange to the current set of changes.
      */    rt(t) {
-        for (const e of t.k) t.$ && t.$.isFoundDocument() ? this.ot(e, t.$) : this.at(e, t.key, t.$);
-        for (const e of t.removedTargetIds) this.at(e, t.key, t.$);
+        for (const e of t.k) t.$ && t.$.isFoundDocument() ? this.ot(e, t.$) : this.ct(e, t.key, t.$);
+        for (const e of t.removedTargetIds) this.ct(e, t.key, t.$);
     }
-    /** Processes and adds the WatchTargetChange to the current set of changes. */    ct(t) {
+    /** Processes and adds the WatchTargetChange to the current set of changes. */    at(t) {
         this.forEachTarget(t, (e => {
             const n = this.ut(e);
             switch (t.state) {
@@ -4022,7 +4022,7 @@ class $n {
                 // until it is resolved, essentially exposing inconsistency between
                 // queries.
                 const n = new Pt(t.path);
-                this.at(e, n, Kt.newNoDocument(n, it.min()));
+                this.ct(e, n, Kt.newNoDocument(n, it.min()));
             } else L(1 === n); else {
                 this.wt(e) !== n && (
                 // Existence filter mismatch: We reset the mapping and raise a new
@@ -4049,7 +4049,7 @@ class $n {
                     // instead resulting in an explicit delete message and we could
                     // remove this special logic.
                     const e = new Pt(i.target.path);
-                    null !== this.nt.get(e) || this.gt(s, e) || this.at(s, e, Kt.newNoDocument(e, t));
+                    null !== this.nt.get(e) || this.gt(s, e) || this.ct(s, e, Kt.newNoDocument(e, t));
                 }
                 n.K && (e.set(s, n.W()), n.G());
             }
@@ -4088,7 +4088,7 @@ class $n {
      * to update the remote document cache.
      */
     // Visible for testing.
-    at(t, e, n) {
+    ct(t, e, n) {
         if (!this.ht(t)) return;
         const s = this.ut(t);
         this.gt(t, e) ? s.H(e, 1 /* Removed */) : 
@@ -4143,7 +4143,7 @@ class $n {
      */    lt(t) {
         this.et.set(t, new kn);
         this.tt.getRemoteKeysForTarget(t).forEach((e => {
-            this.at(t, e, /*updatedDocument=*/ null);
+            this.ct(t, e, /*updatedDocument=*/ null);
         }));
     }
     /**
@@ -4340,7 +4340,7 @@ function ns(t, e) {
         }(e.targetChange.targetChangeType || "NO_CHANGE"), i = e.targetChange.targetIds || [], r = function(t, e) {
             return t.D ? (L(void 0 === e || "string" == typeof e), _t.fromBase64String(e || "")) : (L(void 0 === e || e instanceof Uint8Array), 
             _t.fromUint8Array(e || new Uint8Array));
-        }(t, e.targetChange.resumeToken), o = e.targetChange.cause, a = o && function(t) {
+        }(t, e.targetChange.resumeToken), o = e.targetChange.cause, c = o && function(t) {
             const e = void 0 === t.code ? q.UNKNOWN : dn(t.code);
             return new K(e, t.message || "");
         }
@@ -4352,7 +4352,7 @@ function ns(t, e) {
  * our generated proto interfaces say Int32Value must be. But GRPC actually
  * expects a { value: <number> } struct.
  */ (o);
-        n = new xn(s, i, r, a || null);
+        n = new xn(s, i, r, c || null);
     } else if ("documentChange" in e) {
         e.documentChange;
         const s = e.documentChange;
@@ -4361,14 +4361,14 @@ function ns(t, e) {
             mapValue: {
                 fields: s.document.fields
             }
-        }), a = Kt.newFoundDocument(i, r, o), c = s.targetIds || [], u = s.removedTargetIds || [];
-        n = new Cn(c, u, a.key, a);
+        }), c = Kt.newFoundDocument(i, r, o), a = s.targetIds || [], u = s.removedTargetIds || [];
+        n = new Cn(a, u, c.key, c);
     } else if ("documentDelete" in e) {
         e.documentDelete;
         const s = e.documentDelete;
         s.document;
-        const i = zn(t, s.document), r = s.readTime ? jn(s.readTime) : it.min(), o = Kt.newNoDocument(i, r), a = s.removedTargetIds || [];
-        n = new Cn([], a, o.key, o);
+        const i = zn(t, s.document), r = s.readTime ? jn(s.readTime) : it.min(), o = Kt.newNoDocument(i, r), c = s.removedTargetIds || [];
+        n = new Cn([], c, o.key, o);
     } else if ("documentRemove" in e) {
         e.documentRemove;
         const s = e.documentRemove;
@@ -4392,13 +4392,13 @@ function ss(t, e) {
     let n;
     if (e instanceof en) n = {
         update: Zn(t, e.key, e.value)
-    }; else if (e instanceof an) n = {
+    }; else if (e instanceof cn) n = {
         delete: Gn(t, e.key)
     }; else if (e instanceof nn) n = {
         update: Zn(t, e.key, e.data),
         updateMask: ps(e.fieldMask)
     }; else {
-        if (!(e instanceof cn)) return M();
+        if (!(e instanceof an)) return M();
         n = {
             verify: Gn(t, e.key)
         };
@@ -4468,11 +4468,11 @@ function is(t, e) {
     }
     if (e.delete) {
         const s = zn(t, e.delete);
-        return new an(s, n);
+        return new cn(s, n);
     }
     if (e.verify) {
         const s = zn(t, e.verify);
-        return new cn(s, n);
+        return new an(s, n);
     }
     return M();
 }
@@ -4497,7 +4497,7 @@ function os(t, e) {
     };
 }
 
-function as(t, e) {
+function cs(t, e) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const n = {
         structuredQuery: {}
@@ -4581,7 +4581,7 @@ function as(t, e) {
     e.endAt && (n.structuredQuery.endAt = ls(e.endAt)), n;
 }
 
-function cs(t) {
+function as(t) {
     let e = Jn(t.parent);
     const n = t.structuredQuery, s = n.from ? n.from.length : 0;
     let i = null;
@@ -4594,7 +4594,7 @@ function cs(t) {
     n.where && (r = hs(n.where));
     let o = [];
     n.orderBy && (o = n.orderBy.map((t => function(t) {
-        return new ce(ms(t.field), 
+        return new ae(ms(t.field), 
         // visible for testing
         function(t) {
             switch (t) {
@@ -4611,15 +4611,15 @@ function cs(t) {
         // visible for testing
         (t.direction));
     }(t))));
-    let a = null;
-    n.limit && (a = function(t) {
+    let c = null;
+    n.limit && (c = function(t) {
         let e;
         return e = "object" == typeof t ? t.value : t, At(e) ? null : e;
     }(n.limit));
-    let c = null;
-    n.startAt && (c = fs(n.startAt));
+    let a = null;
+    n.startAt && (a = fs(n.startAt));
     let u = null;
-    return n.endAt && (u = fs(n.endAt)), de(e, i, o, r, a, "F" /* First */ , c, u);
+    return n.endAt && (u = fs(n.endAt)), de(e, i, o, r, c, "F" /* First */ , a, u);
 }
 
 function us(t, e) {
@@ -6219,8 +6219,8 @@ function ei(t, e) {
     return M();
 }
 
-/** Encodes a document for storage locally. */ function ai(t, e, n) {
-    const s = ci(n), i = e.key.path.popLast().toArray();
+/** Encodes a document for storage locally. */ function ci(t, e, n) {
+    const s = ai(n), i = e.key.path.popLast().toArray();
     if (e.isFoundDocument()) {
         const n = function(t, e) {
             return {
@@ -6249,7 +6249,7 @@ function ei(t, e) {
     return M();
 }
 
-function ci(t) {
+function ai(t) {
     const e = t.toTimestamp();
     return [ e.seconds, e.nanoseconds ];
 }
@@ -6296,14 +6296,14 @@ function fi(t, e) {
     var i;
     return void 0 !== t.query.documents ? (L(1 === (i = t.query).documents.length), 
     s = Te(we(Jn(i.documents[0])))) : s = function(t) {
-        return Te(cs(t));
+        return Te(as(t));
     }(t.query), new ii(s, t.targetId, 0 /* Listen */ , t.lastListenSequenceNumber, e, n, _t.fromBase64String(t.resumeToken));
 }
 
 /** Encodes TargetData into a DbTarget for storage locally. */ function wi(t, e) {
     const n = hi(e.snapshotVersion), s = hi(e.lastLimboFreeSnapshotVersion);
     let i;
-    i = Ht(e.target) ? os(t.Wt, e.target) : as(t.Wt, e.target);
+    i = Ht(e.target) ? os(t.Wt, e.target) : cs(t.Wt, e.target);
     // We can't store the resumeToken as a ByteString in IndexedDb, so we
     // convert it to a base64 string for storage.
         const r = e.resumeToken.toBase64();
@@ -6321,7 +6321,7 @@ function fi(t, e) {
  * including features exists only in SDKs (for example: limit-to-last).
  */
 function _i(t) {
-    const e = cs({
+    const e = as({
         parent: t.parent,
         structuredQuery: t.structuredQuery
     });
@@ -6587,12 +6587,12 @@ class Ri {
  */
 function bi(t, e, n) {
     const s = t.store(Vs.store), i = t.store(Ss.store), r = [], o = IDBKeyRange.only(n.batchId);
-    let a = 0;
-    const c = s.Kt({
+    let c = 0;
+    const a = s.Kt({
         range: o
-    }, ((t, e, n) => (a++, n.delete())));
-    r.push(c.next((() => {
-        L(1 === a);
+    }, ((t, e, n) => (c++, n.delete())));
+    r.push(a.next((() => {
+        L(1 === c);
     })));
     const u = [];
     for (const t of n.mutations) {
@@ -6692,20 +6692,20 @@ class vi {
         // eslint-disable-next-line @typescript-eslint/no-explicit-any
         return r.add({}).next((o => {
             L("number" == typeof o);
-            const a = new ni(o, e, n, s), c = function(t, e, n) {
+            const c = new ni(o, e, n, s), a = function(t, e, n) {
                 const s = n.baseMutations.map((e => ss(t.Wt, e))), i = n.mutations.map((e => ss(t.Wt, e)));
                 return new Vs(e, n.batchId, n.localWriteTime.toMillis(), s, i);
-            }(this.N, this.userId, a), u = [];
+            }(this.N, this.userId, c), u = [];
             let h = new gn(((t, e) => tt(t.canonicalString(), e.canonicalString())));
             for (const t of s) {
                 const e = Ss.key(this.userId, t.key.path, o);
-                h = h.add(t.key.path.popLast()), u.push(r.put(c)), u.push(i.put(e, Ss.PLACEHOLDER));
+                h = h.add(t.key.path.popLast()), u.push(r.put(a)), u.push(i.put(e, Ss.PLACEHOLDER));
             }
             return h.forEach((e => {
                 u.push(this.Ht.addToCollectionParentIndex(t, e));
             })), t.addOnCommittedListener((() => {
-                this.Jt[o] = a.keys();
-            })), js.waitFor(u).next((() => a));
+                this.Jt[o] = c.keys();
+            })), js.waitFor(u).next((() => c));
         }));
     }
     lookupMutationBatch(t, e) {
@@ -6759,7 +6759,7 @@ class vi {
         return Di(t).Kt({
             range: s
         }, ((n, s, r) => {
-            const [o, a, c] = n, u = Rs(a);
+            const [o, c, a] = n, u = Rs(c);
             // Only consider rows matching exactly the specific key of
             // interest. Note that because we order by path first, and we
             // order terminators before path separators, we'll encounter all
@@ -6769,7 +6769,7 @@ class vi {
             // 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 Si(t).get(c).next((t => {
+            return Si(t).get(a).next((t => {
                 if (!t) throw M();
                 L(t.userId === this.userId), i.push(fi(this.N, t));
             }));
@@ -6783,7 +6783,7 @@ class vi {
             const i = Ss.prefixForPath(this.userId, e.path), r = IDBKeyRange.lowerBound(i), o = Di(t).Kt({
                 range: r
             }, ((t, s, i) => {
-                const [r, o, a] = t, c = Rs(o);
+                const [r, o, c] = t, a = Rs(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
@@ -6791,7 +6791,7 @@ class vi {
                 // the rows for documentKey will occur before any rows for
                 // documents nested in a subcollection beneath documentKey so we
                 // can stop as soon as we hit any such row.
-                                r === this.userId && e.path.isEqual(c) ? n = n.add(a) : i.done();
+                                r === this.userId && e.path.isEqual(a) ? n = n.add(c) : i.done();
             }));
             s.push(o);
         })), js.waitFor(s).next((() => this.Zt(t, n)));
@@ -6805,14 +6805,14 @@ class vi {
         return Di(t).Kt({
             range: r
         }, ((t, e, i) => {
-            const [r, a, c] = t, u = Rs(a);
+            const [r, c, a] = t, u = Rs(c);
             r === this.userId && n.isPrefixOf(u) ? 
             // Rows with document keys more than one segment longer than the
             // query path can't be matches. For example, a query on 'rooms'
             // can't match the document /rooms/abc/messages/xyx.
             // TODO(mcg): we'll need a different scanner when we implement
             // ancestor queries.
-            u.length === s && (o = o.add(c)) : i.done();
+            u.length === s && (o = o.add(a)) : i.done();
         })).next((() => this.Zt(t, o)));
     }
     Zt(t, e) {
@@ -6881,8 +6881,8 @@ class vi {
         range: r,
         qt: !0
     }, ((t, n, s) => {
-        const [r, a, /*batchID*/ c] = t;
-        r === e && a === i && (o = !0), s.done();
+        const [r, c, /*batchID*/ a] = t;
+        r === e && c === i && (o = !0), s.done();
     })).next((() => o));
 }
 
@@ -6999,11 +6999,11 @@ class Ni {
         e > s.highestListenSequenceNumber && (s.highestListenSequenceNumber = e), this.oe(t, s))));
     }
     addTargetData(t, e) {
-        return this.ae(t, e).next((() => this.re(t).next((n => (n.targetCount += 1, this.ce(e, n), 
+        return this.ce(t, e).next((() => this.re(t).next((n => (n.targetCount += 1, this.ae(e, n), 
         this.oe(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((() => ki(t).delete(e.targetId))).next((() => this.re(t))).next((e => (L(e.targetCount > 0), 
@@ -7017,8 +7017,8 @@ class Ni {
         let s = 0;
         const i = [];
         return ki(t).Kt(((r, o) => {
-            const a = di(o);
-            a.sequenceNumber <= e && null === n.get(a.targetId) && (s++, i.push(this.removeTargetData(t, a)));
+            const c = di(o);
+            c.sequenceNumber <= e && null === n.get(c.targetId) && (s++, i.push(this.removeTargetData(t, c)));
         })).next((() => js.waitFor(i))).next((() => s));
     }
     /**
@@ -7035,14 +7035,14 @@ class Ni {
     oe(t, e) {
         return $i(t).put(Os.key, e);
     }
-    ae(t, e) {
+    ce(t, e) {
         return ki(t).put(wi(this.N, e));
     }
     /**
      * In-place updates the provided metadata to account for values in the given
      * TargetData. Saving is done separately. Returns true if there were any
      * changes to the metadata.
-     */    ce(t, e) {
+     */    ae(t, e) {
         let n = !1;
         return t.targetId > e.highestTargetId && (e.highestTargetId = t.targetId, n = !0), 
         t.sequenceNumber > e.highestListenSequenceNumber && (e.highestListenSequenceNumber = t.sequenceNumber, 
@@ -7287,16 +7287,16 @@ class Ni {
         return this.me.getCacheSize(t);
     }
     pe(t, e) {
-        let n, s, i, r, o, c, u;
+        let n, s, i, r, o, a, u;
         const h = Date.now();
         return this.calculateTargetCount(t, this.params.percentileToCollect).next((e => (
         // Cap at the configured max
         e > this.params.maximumSequenceNumbersToCollect ? (k("LruGarbageCollector", `Capping sequence numbers to collect down to the maximum of ${this.params.maximumSequenceNumbersToCollect} from ${e}`), 
         s = this.params.maximumSequenceNumbersToCollect) : s = e, r = Date.now(), this.nthSequenceNumber(t, s)))).next((s => (n = s, 
-        o = Date.now(), this.removeTargets(t, n, e)))).next((e => (i = e, c = Date.now(), 
+        o = Date.now(), this.removeTargets(t, n, e)))).next((e => (i = e, a = Date.now(), 
         this.removeOrphanedDocuments(t, n)))).next((t => {
-            if (u = Date.now(), N() <= a.DEBUG) {
-                k("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`);
+            if (u = Date.now(), N() <= c.DEBUG) {
+                k("LruGarbageCollector", `LRU Garbage Collection\n\tCounted targets in ${r - h}ms\n\tDetermined least recently used ${s} in ` + (o - r) + "ms\n" + `\tRemoved ${i} targets in ` + (a - o) + "ms\n" + `\tRemoved ${t} documents in ` + (u - a) + "ms\n" + `Total Duration: ${u - h}ms`);
             }
             return js.resolve({
                 didRun: !0,
@@ -7499,7 +7499,7 @@ function Ki(t, e) {
         }));
     }
     isEmpty() {
-        return at(this.inner);
+        return ct(this.inner);
     }
 }
 
@@ -7722,7 +7722,7 @@ function Ki(t, e) {
             // Execute an index-free query and filter by read time. This is safe
             // since all document changes to queries that have a
             // lastLimboFreeSnapshotVersion (`sinceReadTime`) have a read time set.
-            const t = e.path.toArray(), s = ci(n);
+            const t = e.path.toArray(), s = ai(n);
             r.range = IDBKeyRange.lowerBound([ t, s ], 
             /* open= */ !0), r.index = Ns.collectionReadTimeIndex;
         }
@@ -7793,16 +7793,16 @@ class Gi extends Qi {
         return this.changes.forEach(((i, r) => {
             const o = this.De.get(i);
             if (r.document.isValidDocument()) {
-                const a = ai(this.Se.N, r.document, this.getReadTime(i));
+                const c = ci(this.Se.N, r.document, this.getReadTime(i));
                 s = s.add(i.path.popLast());
-                const c = Pi(a);
-                n += c - o, e.push(this.Se.addEntry(t, i, a));
+                const a = Pi(c);
+                n += a - o, e.push(this.Se.addEntry(t, i, c));
             } else if (n -= o, this.trackRemovals) {
                 // In order to track removals, we store a "sentinel delete" in the
                 // RemoteDocumentCache. This entry is represented by a NoDocument
                 // with a version of 0 and ignored by `maybeDecodeDocument()` but
                 // preserved in `getNewDocumentChanges()`.
-                const n = ai(this.Se.N, Kt.newNoDocument(i, it.min()), this.getReadTime(i));
+                const n = ci(this.Se.N, Kt.newNoDocument(i, it.min()), this.getReadTime(i));
                 e.push(this.Se.addEntry(t, i, n));
             } else e.push(this.Se.removeEntry(t, i));
         })), s.forEach((n => {
@@ -8126,14 +8126,14 @@ class tr {
      * Whether to synchronize the in-memory state of multiple tabs and share
      * access to local persistence.
      */
-    t, e, n, s, i, r, o, a, c, 
+    t, e, n, s, i, r, o, c, a, 
     /**
      * If set to true, forcefully obtains database access. Existing tabs will
      * no longer be able to access IndexedDB.
      */
     u) {
         if (this.allowTabSynchronization = t, this.persistenceKey = e, this.clientId = n, 
-        this.Oe = i, this.window = r, this.document = o, this.Fe = c, this.Me = u, this.Le = null, 
+        this.Oe = i, this.window = r, this.document = o, this.Fe = a, this.Me = u, this.Le = null, 
         this.Be = !1, this.isPrimary = !1, this.networkEnabled = !0, 
         /** Our window.unload handler, if registered. */
         this.Ue = null, this.inForeground = !1, 
@@ -8145,7 +8145,7 @@ class tr {
         this.je = Number.NEGATIVE_INFINITY, 
         /** A listener to notify on primary state changes. */
         this.Qe = t => Promise.resolve(), !tr.bt()) throw new K(q.UNIMPLEMENTED, "This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.");
-        this.referenceDelegate = new qi(this, s), this.We = e + "main", this.N = new ri(a), 
+        this.referenceDelegate = new qi(this, s), this.We = e + "main", this.N = new ri(c), 
         this.Ge = new Ws(this.We, 11, new Yi(this.N)), this.ze = new xi(this.referenceDelegate, this.N), 
         this.Ht = new Ti, this.He = function(t, e) {
             return new Wi(t, e);
@@ -8223,7 +8223,7 @@ class tr {
             if (this.isPrimary) return this.sn(t).next((t => {
                 t || (this.isPrimary = !1, this.Oe.enqueueRetryable((() => this.Qe(!1))));
             }));
-        })).next((() => this.rn(t))).next((e => this.isPrimary && !e ? this.on(t).next((() => !1)) : !!e && this.an(t).next((() => !0)))))).catch((t => {
+        })).next((() => this.rn(t))).next((e => this.isPrimary && !e ? this.on(t).next((() => !1)) : !!e && this.cn(t).next((() => !0)))))).catch((t => {
             if (Hs(t)) 
             // Proceed with the existing state. Any subsequent access to
             // IndexedDB will verify the lease.
@@ -8236,7 +8236,7 @@ class tr {
         }));
     }
     sn(t) {
-        return er(t).get(Ps.key).next((t => js.resolve(this.cn(t))));
+        return er(t).get(Ps.key).next((t => js.resolve(this.an(t))));
     }
     un(t) {
         return nr(t).delete(this.clientId);
@@ -8270,7 +8270,7 @@ class tr {
      */    en() {
         this.Ke = this.Oe.enqueueAfterDelay("client_metadata_refresh" /* ClientMetadataRefresh */ , 4e3, (() => this.Xe().then((() => this.hn())).then((() => this.en()))));
     }
-    /** Checks whether `client` is the local client. */    cn(t) {
+    /** Checks whether `client` is the local client. */    an(t) {
         return !!t && t.ownerId === this.clientId;
     }
     /**
@@ -8292,8 +8292,8 @@ class tr {
             //   the foreground.
             // - the `forceOwningTab` setting was passed in.
             if (null !== e && this.ln(e.leaseTimestampMs, 5e3) && !this.wn(e.ownerId)) {
-                if (this.cn(e) && this.networkEnabled) return !0;
-                if (!this.cn(e)) {
+                if (this.an(e) && this.networkEnabled) return !0;
+                if (!this.an(e)) {
                     if (!e.allowTabSynchronization) 
                     // Fail the `canActAsPrimary` check if the current leaseholder has
                     // not opted into multi-tab synchronization. If this happens at
@@ -8379,7 +8379,7 @@ class tr {
             if (!e) throw $(`Failed to obtain primary lease for action '${t}'.`), this.isPrimary = !1, 
             this.Oe.enqueueRetryable((() => this.Qe(!1))), new K(q.FAILED_PRECONDITION, qs);
             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)));
     }
     /**
@@ -8390,13 +8390,13 @@ class tr {
     // be turned off.
     En(t) {
         return er(t).get(Ps.key).next((t => {
-            if (null !== t && this.ln(t.leaseTimestampMs, 5e3) && !this.wn(t.ownerId) && !this.cn(t) && !(this.Me || this.allowTabSynchronization && t.allowTabSynchronization)) throw new K(q.FAILED_PRECONDITION, Zi);
+            if (null !== t && this.ln(t.leaseTimestampMs, 5e3) && !this.wn(t.ownerId) && !this.an(t) && !(this.Me || this.allowTabSynchronization && t.allowTabSynchronization)) throw new K(q.FAILED_PRECONDITION, Zi);
         }));
     }
     /**
      * 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 Ps(this.clientId, this.allowTabSynchronization, Date.now());
         return er(t).put(Ps.key, e);
     }
@@ -8405,7 +8405,7 @@ class tr {
     }
     /** Checks the primary lease and removes it if we are the current primary. */    on(t) {
         const e = er(t);
-        return e.get(Ps.key).next((t => this.cn(t) ? (k("IndexedDbPersistence", "Releasing primary lease."), 
+        return e.get(Ps.key).next((t => this.an(t) ? (k("IndexedDbPersistence", "Releasing primary lease."), 
         e.delete(Ps.key)) : js.resolve()));
     }
     /** Verifies that `updateTimeMs` is within `maxAgeMs`. */    ln(t, e) {
@@ -8737,7 +8737,7 @@ class ir {
  *   another document that is in the local cache.
  *
  * - Queries that have never been CURRENT or free of limbo documents.
- */ class ar {
+ */ class cr {
     /** Sets the document view to query against. */
     $n(t) {
         this.On = t;
@@ -8750,7 +8750,7 @@ class ir {
             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(it.min()) ? this.Fn(t, e) : this.On.Pn(t, s).next((i => {
             const r = this.Mn(e, i);
-            return (_e(e) || me(e)) && this.Ln(e.limitType, r, s, n) ? this.Fn(t, e) : (N() <= a.DEBUG && k("QueryEngine", "Re-using previous result from %s to execute query: %s", n.toString(), be(e)), 
+            return (_e(e) || me(e)) && this.Ln(e.limitType, r, s, n) ? this.Fn(t, e) : (N() <= c.DEBUG && k("QueryEngine", "Re-using previous result from %s to execute query: %s", n.toString(), be(e)), 
             this.On.getDocumentsMatchingQuery(t, e, n).next((t => (
             // We merge `previousResults` into `updateResults`, since
             // `updateResults` is already a DocumentMap. If a document is
@@ -8796,7 +8796,7 @@ class ir {
         return !!i && (i.hasPendingWrites || i.version.compareTo(s) > 0);
     }
     Fn(t, e) {
-        return N() <= a.DEBUG && k("QueryEngine", "Using full collection scan to execute query:", be(e)), 
+        return N() <= c.DEBUG && k("QueryEngine", "Using full collection scan to execute query:", be(e)), 
         this.On.getDocumentsMatchingQuery(t, e, it.min());
     }
 }
@@ -8825,7 +8825,7 @@ class ir {
  * This is useful to implement optional features (like bundles) in free
  * functions, such that they are tree-shakeable.
  */
-class cr {
+class ar {
     constructor(
     /** Manages our in-memory or durable persistence. */
     t, e, n, s) {
@@ -8857,7 +8857,7 @@ class cr {
 function ur(
 /** Manages our in-memory or durable persistence. */
 t, e, n, s) {
-    return new cr(t, e, n, s);
+    return new ar(t, e, n, s);
 }
 
 /**
@@ -8976,16 +8976,16 @@ function fr(t) {
                 i = n.Un;
         const o = [];
         e.targetChanges.forEach(((e, r) => {
-            const a = i.get(r);
-            if (!a) return;
+            const c = i.get(r);
+            if (!c) return;
             // Only update the remote keys if the target is still active. This
             // ensures that we can persist the updated target data along with
             // the updated assignment.
                         o.push(n.ze.removeMatchingKeys(t, e.removedDocuments, r).next((() => n.ze.addMatchingKeys(t, e.addedDocuments, r))));
-            const c = e.resumeToken;
+            const a = e.resumeToken;
             // Update the resume token if the change includes one.
-                        if (c.approximateByteSize() > 0) {
-                const u = a.withResumeToken(c, s).withSequenceNumber(t.currentSequenceNumber);
+                        if (a.approximateByteSize() > 0) {
+                const u = c.withResumeToken(a, s).withSequenceNumber(t.currentSequenceNumber);
                 i = i.insert(r, u), 
                 // Update the target data if there are target changes (or if
                 // sufficient time has passed since the last update).
@@ -9018,10 +9018,10 @@ function fr(t) {
                 }
                 /**
  * Notifies local store of the changed views to locally pin documents.
- */ (a, u, e) && o.push(n.ze.updateTargetData(t, u));
+ */ (c, u, e) && o.push(n.ze.updateTargetData(t, u));
             }
         }));
-        let a = En();
+        let c = En();
         // 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
@@ -9032,12 +9032,12 @@ function fr(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(wr(t, r, e.documentUpdates, s, void 0).next((t => {
-            a = t;
+            c = t;
         }))), !s.isEqual(it.min())) {
             const e = n.ze.getLastRemoteSnapshotVersion(t).next((e => n.ze.setTargetsMetadata(t, t.currentSequenceNumber, s)));
             o.push(e);
         }
-        return js.waitFor(o).next((() => r.apply(t))).next((() => n.Qn.vn(t, a))).next((() => a));
+        return js.waitFor(o).next((() => r.apply(t))).next((() => n.Qn.vn(t, c))).next((() => c));
     })).then((t => (n.Un = i, t)));
 }
 
@@ -9064,7 +9064,7 @@ i) {
     return n.forEach((t => r = r.add(t))), e.getEntries(t, r).next((t => {
         let r = En();
         return n.forEach(((n, o) => {
-            const a = t.get(n), c = (null == i ? void 0 : i.get(n)) || s;
+            const c = t.get(n), a = (null == i ? void 0 : i.get(n)) || s;
             // Note: The order of the steps below is important, since we want
             // to ensure that rejected limbo resolutions (which fabricate
             // NoDocuments with SnapshotVersion.min()) never add documents to
@@ -9073,8 +9073,8 @@ i) {
             // NoDocuments with SnapshotVersion.min() are used in manufactured
             // events. We remove these documents from cache since we lost
             // access.
-            e.removeEntry(n, c), r = r.insert(n, o)) : !a.isValidDocument() || o.version.compareTo(a.version) > 0 || 0 === o.version.compareTo(a.version) && a.hasPendingWrites ? (e.addEntry(o, c), 
-            r = r.insert(n, o)) : k("LocalStore", "Ignoring outdated watch update for ", n, ". Current version:", a.version, " Watch version:", o.version);
+            e.removeEntry(n, a), r = r.insert(n, o)) : !c.isValidDocument() || o.version.compareTo(c.version) > 0 || 0 === o.version.compareTo(c.version) && c.hasPendingWrites ? (e.addEntry(o, a), 
+            r = r.insert(n, o)) : k("LocalStore", "Ignoring outdated watch update for ", n, ". Current version:", c.version, " Watch version:", o.version);
         })), r;
     }));
 }
@@ -9191,11 +9191,11 @@ function Er(t) {
     const e = U(t);
     return e.persistence.runTransaction("Get new document changes", "readonly", (t => function(t, e, n) {
         const s = U(t);
-        let i = En(), r = ci(n);
-        const o = Hi(e), a = IDBKeyRange.lowerBound(r, !0);
+        let i = En(), r = ai(n);
+        const o = Hi(e), c = IDBKeyRange.lowerBound(r, !0);
         return o.Kt({
             index: Ns.readTimeIndex,
-            range: a
+            range: c
         }, ((t, e) => {
             // Unlike `getEntry()` and others, `getNewDocumentChanges()` parses
             // the documents directly since we want to keep sentinel deletes.
@@ -9252,12 +9252,12 @@ async function Tr(t) {
  */
 async function Ir(t, e, n, s) {
     const i = U(t);
-    let r = Pn(), o = En(), a = Rn();
+    let r = Pn(), o = En(), c = Rn();
     for (const t of n) {
         const n = e.zn(t.metadata.name);
-        t.document && (r = r.add(n)), o = o.insert(n, e.Hn(t)), a = a.insert(n, e.Jn(t.metadata.readTime));
+        t.document && (r = r.add(n)), o = o.insert(n, e.Hn(t)), c = c.insert(n, e.Jn(t.metadata.readTime));
     }
-    const c = i.jn.newChangeBuffer({
+    const a = i.jn.newChangeBuffer({
         trackRemovals: !0
     }), u = await mr(i, function(t) {
         // It is OK that the path used for the query is not valid, because this will
@@ -9266,7 +9266,7 @@ async function Ir(t, e, n, s) {
     }(s));
     // Allocates a target to hold all document keys from the bundle, such that
     // they will not get garbage collected right away.
-        return i.persistence.runTransaction("Apply bundle documents", "readwrite", (t => wr(t, c, o, it.min(), a).next((e => (c.apply(t), 
+        return i.persistence.runTransaction("Apply bundle documents", "readwrite", (t => wr(t, a, o, it.min(), c).next((e => (a.apply(t), 
     e))).next((e => i.ze.removeMatchingKeysForTargetId(t, u.targetId).next((() => i.ze.addMatchingKeys(t, r, u.targetId))).next((() => i.Qn.vn(t, e))).next((() => e))))));
 }
 
@@ -9769,16 +9769,16 @@ class Sr extends Qi {
         return n && (this.lastRemoteSnapshotVersion = n), e > this.Is && (this.Is = e), 
         js.resolve();
     }
-    ae(t) {
+    ce(t) {
         this.Ts.set(t.target, t);
         const e = t.targetId;
         e > this.highestTargetId && (this.Rs = new Ni(e), this.highestTargetId = e), t.sequenceNumber > this.Is && (this.Is = t.sequenceNumber);
     }
     addTargetData(t, e) {
-        return this.ae(e), this.targetCount += 1, js.resolve();
+        return this.ce(e), this.targetCount += 1, js.resolve();
     }
     updateTargetData(t, e) {
-        return this.ae(e), js.resolve();
+        return this.ce(e), js.resolve();
     }
     removeTargetData(t, e) {
         return this.Ts.delete(e.target), this.As.cs(e.targetId), this.targetCount -= 1, 
@@ -10321,12 +10321,12 @@ class Ur {
                 if (this.started) {
                     if (null !== e.key) if (this.Ws.test(e.key)) {
                         if (null == e.newValue) {
-                            const t = this.ai(e.key);
-                            return this.ci(t, null);
+                            const t = this.ci(e.key);
+                            return this.ai(t, null);
                         }
                         {
                             const t = this.ui(e.key, e.newValue);
-                            if (t) return this.ci(t.clientId, t);
+                            if (t) return this.ai(t.clientId, t);
                         }
                     } else if (this.Gs.test(e.key)) {
                         if (null !== e.newValue) {
@@ -10396,7 +10396,7 @@ class Ur {
     /**
      * 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.Ws.exec(t);
         return e ? e[1] : null;
     }
@@ -10404,7 +10404,7 @@ class Ur {
      * Parses a client state in WebStorage. Returns 'null' if the value could not
      * be parsed.
      */    ui(t, e) {
-        const n = this.ai(t);
+        const n = this.ci(t);
         return Lr.$s(n, e);
     }
     /**
@@ -10434,7 +10434,7 @@ class Ur {
     di(t) {
         return this.syncEngine.mi(t.targetId, t.state, t.error);
     }
-    ci(t, e) {
+    ai(t, e) {
         const n = e ? this.qs.insert(t, e) : this.qs.remove(t), s = this.ti(this.qs), i = this.ti(n), r = [], o = [];
         return i.forEach((t => {
             s.has(t) || r.push(t);
@@ -10760,8 +10760,8 @@ class {
                     k("Connection", 'RPC "' + t + '" completed.');
                 }
             }));
-            const a = JSON.stringify(s);
-            o.send(e, "POST", a, n, 15);
+            const c = JSON.stringify(s);
+            o.send(e, "POST", c, n, 15);
         }));
     }
     ji(t, e) {
@@ -10808,22 +10808,22 @@ class {
         l() || f() || d() || w() || _() || m() || (r.httpHeadersOverwriteParam = "$httpHeaders");
         const o = n.join("");
         k("Connection", "Creating WebChannel: " + o, r);
-        const a = s.createWebChannel(o, r);
+        const c = s.createWebChannel(o, r);
         // WebChannel supports sending the first message with the handshake - saving
         // a network round trip. However, it will have to call send in the same
         // JS event loop as open. In order to enforce this, we delay actually
         // opening the WebChannel until send is called. Whether we have called
         // open is tracked with this variable.
-                let c = !1, u = !1;
+                let a = !1, u = !1;
         // A flag to determine whether the stream was closed (by us or through an
         // error/close event) to avoid delivering multiple close events or sending
         // on a closed stream
                 const h = new Gr({
             vi: t => {
-                u ? k("Connection", "Not sending because WebChannel is closed:", t) : (c || (k("Connection", "Opening WebChannel transport."), 
-                a.open(), c = !0), k("Connection", "WebChannel sending:", t), a.send(t));
+                u ? k("Connection", "Not sending because WebChannel is closed:", t) : (a || (k("Connection", "Opening WebChannel transport."), 
+                c.open(), a = !0), k("Connection", "WebChannel sending:", t), c.send(t));
             },
-            Vi: () => a.close()
+            Vi: () => c.close()
         }), g = (t, e, n) => {
             // TODO(dimond): closure typing seems broken because WebChannel does
             // not implement goog.events.Listenable
@@ -10841,13 +10841,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 g(a, P.EventType.OPEN, (() => {
+                return g(c, P.EventType.OPEN, (() => {
             u || k("Connection", "WebChannel transport opened.");
-        })), g(a, P.EventType.CLOSE, (() => {
+        })), g(c, P.EventType.CLOSE, (() => {
             u || (u = !0, k("Connection", "WebChannel transport closed"), h.$i());
-        })), g(a, P.EventType.ERROR, (t => {
+        })), g(c, P.EventType.ERROR, (t => {
             u || (u = !0, O("Connection", "WebChannel transport errored:", t), h.$i(new K(q.UNAVAILABLE, "The operation could not be completed")));
-        })), g(a, P.EventType.MESSAGE, (t => {
+        })), g(c, P.EventType.MESSAGE, (t => {
             var e;
             if (!u) {
                 const n = t.data[0];
@@ -10877,7 +10877,7 @@ class {
                     }(t), n = i.message;
                     void 0 === e && (e = q.INTERNAL, n = "Unknown error status: " + t + " with message " + i.message), 
                     // Mark closed so no further events are propagated
-                    u = !0, h.$i(new K(e, n)), a.close();
+                    u = !0, h.$i(new K(e, n)), c.close();
                 } else k("Connection", "WebChannel received:", n), h.Oi(n);
             }
         })), g(i, v.STAT_EVENT, (t => {
@@ -11108,13 +11108,13 @@ class Zr {
      * encompasses respecting backoff, getting auth tokens, and starting the
      * actual RPC). Use isOpen() to determine if the stream is open and ready for
      * outbound requests.
-     */    ar() {
+     */    cr() {
         return 1 /* Starting */ === this.state || 2 /* Open */ === this.state || 4 /* Backoff */ === this.state;
     }
     /**
      * Returns true if the underlying RPC is open (the onOpen() listener has been
      * called) and the stream is ready for outbound requests.
-     */    cr() {
+     */    ar() {
         return 2 /* Open */ === this.state;
     }
     /**
@@ -11132,7 +11132,7 @@ class Zr {
      *
      * When stop returns, isStarted() and isOpen() will both return false.
      */    async stop() {
-        this.ar() && await this.close(0 /* Initial */);
+        this.cr() && await this.close(0 /* Initial */);
     }
     /**
      * After an error the stream will usually back off on the next attempt to
@@ -11156,13 +11156,13 @@ class Zr {
      */    lr() {
         // 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.cr() && null === this.ir && (this.ir = this.Oe.enqueueAfterDelay(this.er, 6e4, (() => this.dr())));
+        this.ar() && null === this.ir && (this.ir = this.Oe.enqueueAfterDelay(this.er, 6e4, (() => this.dr())));
     }
     /** Sends a message to the underlying stream. */    wr(t) {
         this._r(), this.stream.send(t);
     }
     /** Called by the idle timer when the stream should close due to inactivity. */    async dr() {
-        if (this.cr()) 
+        if (this.ar()) 
         // When timing out an idle stream there's no reason to force the stream into backoff when
         // it restarts so set the stream state to Initial instead of Error.
         return this.close(0 /* Initial */);
@@ -11305,7 +11305,7 @@ class Zr {
             return n = Ht(s) ? {
                 documents: os(t, s)
             } : {
-                query: as(t, s)
+                query: cs(t, s)
             }, n.targetId = e.targetId, e.resumeToken.approximateByteSize() > 0 ? n.resumeToken = qn(t, e.resumeToken) : e.snapshotVersion.compareTo(it.min()) > 0 && (
             // TODO(wuandy): Consider removing above check because it is most likely true.
             // Right now, many tests depend on this behaviour though (leaving min() out
@@ -11620,21 +11620,21 @@ async function ro(t) {
  * Starts new listen for the given target. Uses resume token if provided. It
  * is a no-op if the target of given `TargetData` is already being listened to.
  */
-function ao(t, e) {
+function co(t, e) {
     const n = U(t);
     n.qr.has(e.targetId) || (
     // Mark this as something the client is currently listening for.
     n.qr.set(e.targetId, e), fo(n) ? 
     // The listen will be sent in onWatchStreamOpen
-    lo(n) : Co(n).cr() && uo(n, e));
+    lo(n) : Co(n).ar() && uo(n, e));
 }
 
 /**
  * Removes the listen from server. It is a no-op if the given target id is
  * not being listened to.
- */ function co(t, e) {
+ */ function ao(t, e) {
     const n = U(t), s = Co(n);
-    n.qr.delete(e), s.cr() && ho(n, e), 0 === n.qr.size && (s.cr() ? s.lr() : wo(n) && 
+    n.qr.delete(e), s.ar() && ho(n, e), 0 === n.qr.size && (s.ar() ? s.lr() : wo(n) && 
     // Revert to OnlineState.Unknown if the watch stream is not open and we
     // have no listeners, since without any listens to send we cannot
     // confirm if the stream is healthy and upgrade to OnlineState.Online.
@@ -11667,7 +11667,7 @@ function lo(t) {
  * Returns whether the watch stream should be started because it's necessary
  * and has not yet been started.
  */ function fo(t) {
-    return wo(t) && !Co(t).ar() && t.qr.size > 0;
+    return wo(t) && !Co(t).cr() && t.qr.size > 0;
 }
 
 function wo(t) {
@@ -11720,7 +11720,7 @@ async function yo(t, e, n) {
     } catch (n) {
         k("RemoteStore", "Failed to remove targets %s: %s ", e.targetIds.join(","), n), 
         await po(t, n);
-    } else if (e instanceof Cn ? t.Gr.rt(e) : e instanceof Nn ? t.Gr.ft(e) : t.Gr.ct(e), 
+    } else if (e instanceof Cn ? t.Gr.rt(e) : e instanceof Nn ? t.Gr.ft(e) : t.Gr.at(e), 
     !n.isEqual(it.min())) try {
         const e = await fr(t.localStore);
         n.compareTo(e) >= 0 && 
@@ -11829,11 +11829,11 @@ async function To(t) {
  */ function Ao(t, e) {
     t.Ur.push(e);
     const n = No(t);
-    n.cr() && n.br && n.Pr(e.mutations);
+    n.ar() && n.br && n.Pr(e.mutations);
 }
 
 function Ro(t) {
-    return wo(t) && !No(t).ar() && t.Ur.length > 0;
+    return wo(t) && !No(t).cr() && t.Ur.length > 0;
 }
 
 function bo(t) {
@@ -12206,9 +12206,9 @@ class xo {
 }
 
 class Fo {
-    constructor(t, e, n, s, i, r, o, a) {
+    constructor(t, e, n, s, i, r, o, c) {
         this.query = t, this.docs = e, this.oldDocs = n, this.docChanges = s, this.mutatedKeys = i, 
-        this.fromCache = r, this.syncStateChanged = o, this.excludesMetadataChanges = a;
+        this.fromCache = r, this.syncStateChanged = o, this.excludesMetadataChanges = c;
     }
     /** Returns a view snapshot as if all documents in the snapshot were added. */    static fromInitialDocuments(t, e, n, s) {
         const i = [];
@@ -12348,7 +12348,7 @@ function jo(t) {
             /* excludesMetadataChanges= */ !0);
         }
         let e = !1;
-        return this.io ? this.oo(t) && (this.so.next(t), e = !0) : this.ao(t, this.onlineState) && (this.co(t), 
+        return this.io ? this.oo(t) && (this.so.next(t), e = !0) : this.co(t, this.onlineState) && (this.ao(t), 
         e = !0), this.ro = t, e;
     }
     onError(t) {
@@ -12357,10 +12357,10 @@ function jo(t) {
     /** Returns whether a snapshot was raised. */    eo(t) {
         this.onlineState = t;
         let e = !1;
-        return this.ro && !this.io && this.ao(this.ro, t) && (this.co(this.ro), e = !0), 
+        return this.ro && !this.io && this.co(this.ro, t) && (this.ao(this.ro), e = !0), 
         e;
     }
-    ao(t, e) {
+    co(t, e) {
         // Always raise the first event when we're synced
         if (!t.fromCache) return !0;
         // NOTE: We consider OnlineState.Unknown as online (it should become Offline
@@ -12383,7 +12383,7 @@ function jo(t) {
         // to get here if there were only metadata docChanges and they got
         // stripped out.
         }
-    co(t) {
+    ao(t) {
         t = Fo.fromInitialDocuments(t.query, t.docs, t.mutatedKeys, t.fromCache), this.io = !0, 
         this.so.next(t);
     }
@@ -12591,7 +12591,7 @@ class Yo {
         // deletes. So we keep this doc at the old limit to compare the updates to.
         // Note that this should never get used in a refill (when previousChanges is
         // set), because there will only be adds -- no deletes or updates.
-        const a = _e(this.query) && s.size === this.query.limit ? s.last() : null, c = me(this.query) && s.size === this.query.limit ? s.first() : null;
+        const c = _e(this.query) && s.size === this.query.limit ? s.last() : null, a = me(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 = Pe(this.query, e) ? e : null, l = !!u && this.mutatedKeys.has(u.key), f = !!h && (h.hasLocalMutations || 
@@ -12607,7 +12607,7 @@ class Yo {
                 }), d = !0) : this.Ro(u, h) || (n.track({
                     type: 2 /* Modified */ ,
                     doc: h
-                }), d = !0, (a && this.po(h, a) > 0 || c && this.po(h, c) < 0) && (
+                }), d = !0, (c && this.po(h, c) > 0 || a && this.po(h, a) < 0) && (
                 // This doc moved from inside the limit to outside the limit.
                 // That means there may be some other doc in the local cache
                 // that should be included instead.
@@ -12618,7 +12618,7 @@ class Yo {
             }), d = !0) : u && !h && (n.track({
                 type: 1 /* Removed */ ,
                 doc: u
-            }), d = !0, (a || c) && (
+            }), d = !0, (c || a) && (
             // A doc was removed from a full limit query. We'll need to
             // requery from the local cache to see if we know about some other
             // doc that should be in the results.
@@ -12702,10 +12702,10 @@ class Yo {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */ (t.type, e.type) || this.po(t.doc, e.doc))), this.bo(n);
-        const r = e ? this.Po() : [], o = 0 === this.yo.size && this.current ? 1 /* Synced */ : 0 /* Local */ , a = o !== this.mo;
-        if (this.mo = o, 0 !== i.length || a) {
+        const r = e ? this.Po() : [], o = 0 === this.yo.size && this.current ? 1 /* Synced */ : 0 /* Local */ , c = o !== this.mo;
+        if (this.mo = o, 0 !== i.length || c) {
             return {
-                snapshot: new Fo(this.query, t.Eo, s, i, t.mutatedKeys, 0 /* Local */ === o, a, 
+                snapshot: new Fo(this.query, t.Eo, s, i, t.mutatedKeys, 0 /* Local */ === o, c, 
                 /* excludesMetadataChanges= */ !1),
                 vo: r
             };
@@ -12828,7 +12828,7 @@ class Zo {
     }
 }
 
-/** Tracks a limbo resolution. */ class ta {
+/** Tracks a limbo resolution. */ class tc {
     constructor(t) {
         this.key = t, 
         /**
@@ -12853,7 +12853,7 @@ class Zo {
  * 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 ea {
+ */ class ec {
     constructor(t, e, n, 
     // PORTING NOTE: Manages state synchronization in multi-tab environments.
     s, i, r) {
@@ -12899,8 +12899,8 @@ class Zo {
  * server. All the subsequent view snapshots or errors are sent to the
  * subscribed handlers. Returns the initial snapshot.
  */
-async function na(t, e) {
-    const n = Ca(t);
+async function nc(t, e) {
+    const n = Cc(t);
     let s, i;
     const r = n.xo.get(e);
     if (r) 
@@ -12912,7 +12912,7 @@ async function na(t, e) {
     // case and calls `listen` to obtain this ID.
     s = r.targetId, n.sharedClientState.addLocalQueryTarget(s), i = r.view.Do(); else {
         const t = await mr(n.localStore, Te(e)), r = n.sharedClientState.addLocalQueryTarget(t.targetId);
-        s = t.targetId, i = await sa(n, e, s, "current" === r), n.isPrimaryClient && ao(n.remoteStore, t);
+        s = t.targetId, i = await sc(n, e, s, "current" === r), n.isPrimaryClient && co(n.remoteStore, t);
     }
     return i;
 }
@@ -12920,7 +12920,7 @@ async function na(t, e) {
 /**
  * Registers a view for a previously unknown query and computes its initial
  * snapshot.
- */ async function sa(t, e, n, s) {
+ */ async function sc(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.
@@ -12934,17 +12934,17 @@ async function na(t, e) {
         /* usePreviousResults= */ !1).then((({documents: t}) => e.view.Io(t, i))));
         const r = s && s.targetChanges.get(e.targetId), o = e.view.applyChanges(i, 
         /* updateLimboDocuments= */ t.isPrimaryClient, r);
-        return ma(t, e.targetId, o.vo), o.snapshot;
+        return mc(t, e.targetId, o.vo), o.snapshot;
     }(t, e, n, s);
     const i = await yr(t.localStore, e, 
-    /* usePreviousResults= */ !0), r = new Xo(e, i.Gn), o = r.Io(i.documents), a = Dn.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), c = r.applyChanges(o, 
-    /* updateLimboDocuments= */ t.isPrimaryClient, a);
-    ma(t, n, c.vo);
+    /* usePreviousResults= */ !0), r = new Xo(e, i.Gn), o = r.Io(i.documents), c = Dn.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), a = r.applyChanges(o, 
+    /* updateLimboDocuments= */ t.isPrimaryClient, c);
+    mc(t, n, a.vo);
     const u = new Zo(e, n, r);
-    return t.xo.set(e, u), t.ko.has(n) ? t.ko.get(n).push(e) : t.ko.set(n, [ e ]), c.snapshot;
+    return t.xo.set(e, u), t.ko.has(n) ? t.ko.get(n).push(e) : t.ko.set(n, [ e ]), a.snapshot;
 }
 
-/** Stops listening to the query. */ async function ia(t, e) {
+/** Stops listening to the query. */ async function ic(t, e) {
     const n = U(t), s = n.xo.get(e), i = n.ko.get(s.targetId);
     if (i.length > 1) return n.ko.set(s.targetId, i.filter((t => !Ae(t, e)))), void n.xo.delete(e);
     // No other queries are mapped to the target, clean up the query and the target.
@@ -12954,10 +12954,10 @@ async function na(t, e) {
         n.sharedClientState.removeLocalQueryTarget(s.targetId);
         n.sharedClientState.isActiveQueryTarget(s.targetId) || await gr(n.localStore, s.targetId, 
         /*keepPersistedTargetData=*/ !1).then((() => {
-            n.sharedClientState.clearQueryState(s.targetId), co(n.remoteStore, s.targetId), 
-            wa(n, s.targetId);
+            n.sharedClientState.clearQueryState(s.targetId), ao(n.remoteStore, s.targetId), 
+            wc(n, s.targetId);
         })).catch(Fi);
-    } else wa(n, s.targetId), await gr(n.localStore, s.targetId, 
+    } else wc(n, s.targetId), await gr(n.localStore, s.targetId, 
     /*keepPersistedTargetData=*/ !0);
 }
 
@@ -12970,8 +12970,8 @@ async function na(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 ra(t, e, n) {
-    const s = Na(t);
+ */ async function rc(t, e, n) {
+    const s = Nc(t);
     try {
         const t = await function(t, e) {
             const n = U(t), s = st.now(), i = e.reduce(((t, e) => t.add(e.key)), Pn());
@@ -13006,7 +13006,7 @@ async function na(t, e) {
         /**
  * Resolves or rejects the user callback for the given batch and then discards
  * it.
- */ (s, t.batchId, n), await pa(s, t.changes), await To(s.remoteStore);
+ */ (s, t.batchId, n), await pc(s, t.changes), await To(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.
@@ -13019,7 +13019,7 @@ async function na(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 oa(t, e) {
+ */ async function oc(t, e) {
     const n = U(t);
     try {
         const t = await dr(n.localStore, e);
@@ -13032,7 +13032,7 @@ async function na(t, e) {
             L(t.addedDocuments.size + t.modifiedDocuments.size + t.removedDocuments.size <= 1), 
             t.addedDocuments.size > 0 ? s.Co = !0 : t.modifiedDocuments.size > 0 ? L(s.Co) : t.removedDocuments.size > 0 && (L(s.Co), 
             s.Co = !1));
-        })), await pa(n, t, e);
+        })), await pc(n, t, e);
     } catch (t) {
         await Fi(t);
     }
@@ -13041,7 +13041,7 @@ async function na(t, e) {
 /**
  * Applies an OnlineState change to the sync engine and notifies any views of
  * the change.
- */ function aa(t, e, n) {
+ */ function cc(t, e, n) {
     const s = U(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
@@ -13075,7 +13075,7 @@ async function na(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 ca(t, e, n) {
+ */ async function ac(t, e, n) {
     const s = U(t);
     // PORTING NOTE: Multi-tab only.
         s.sharedClientState.updateQueryState(e, "rejected", n);
@@ -13092,18 +13092,18 @@ async function na(t, e) {
         const n = Pn().add(r), i = new Sn(it.min(), 
         /* targetChanges= */ new Map, 
         /* targetMismatches= */ new gn(tt), t, n);
-        await oa(s, i), 
+        await oc(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.Oo = s.Oo.remove(r), s.Fo.delete(e), ya(s);
+        s.Oo = s.Oo.remove(r), s.Fo.delete(e), yc(s);
     } else await gr(s.localStore, e, 
-    /* keepPersistedTargetData */ !1).then((() => wa(s, e, n))).catch(Fi);
+    /* keepPersistedTargetData */ !1).then((() => wc(s, e, n))).catch(Fi);
 }
 
-async function ua(t, e) {
+async function uc(t, e) {
     const n = U(t), s = e.batch.batchId;
     try {
         const t = await lr(n.localStore, e);
@@ -13111,14 +13111,14 @@ async function ua(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.
-                da(n, s, /*error=*/ null), fa(n, s), n.sharedClientState.updateMutationState(s, "acknowledged"), 
-        await pa(n, t);
+                dc(n, s, /*error=*/ null), fc(n, s), n.sharedClientState.updateMutationState(s, "acknowledged"), 
+        await pc(n, t);
     } catch (t) {
         await Fi(t);
     }
 }
 
-async function ha(t, e, n) {
+async function hc(t, e, n) {
     const s = U(t);
     try {
         const t = await function(t, e) {
@@ -13138,8 +13138,8 @@ async function ha(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.
-                da(s, e, n), fa(s, e), s.sharedClientState.updateMutationState(e, "rejected", n), 
-        await pa(s, t);
+                dc(s, e, n), fc(s, e), s.sharedClientState.updateMutationState(e, "rejected", n), 
+        await pc(s, t);
     } catch (n) {
         await Fi(n);
     }
@@ -13148,7 +13148,7 @@ async function ha(t, e, n) {
 /**
  * Registers a user callback that resolves when all pending mutations at the moment of calling
  * are acknowledged .
- */ async function la(t, e) {
+ */ async function lc(t, e) {
     const n = U(t);
     wo(n.remoteStore) || k("SyncEngine", "The network is disabled. The task returned by 'awaitPendingWrites()' will not complete until the network is enabled.");
     try {
@@ -13170,13 +13170,13 @@ async function ha(t, e, n) {
 /**
  * Triggers the callbacks that are waiting for this batch id to get acknowledged by server,
  * if there are any.
- */ function fa(t, e) {
+ */ function fc(t, e) {
     (t.Bo.get(e) || []).forEach((t => {
         t.resolve();
     })), t.Bo.delete(e);
 }
 
-/** Reject all outstanding callbacks waiting for pending writes to complete. */ function da(t, e, n) {
+/** Reject all outstanding callbacks waiting for pending writes to complete. */ function dc(t, e, n) {
     const s = U(t);
     let i = s.Lo[s.currentUser.toKey()];
     // NOTE: Mutations restored from persistence won't have callbacks, so it's
@@ -13187,39 +13187,39 @@ async function ha(t, e, n) {
     }
 }
 
-function wa(t, e, n = null) {
+function wc(t, e, n = null) {
     t.sharedClientState.removeLocalQueryTarget(e);
     for (const s of t.ko.get(e)) t.xo.delete(s), n && t.No.jo(s, n);
     if (t.ko.delete(e), t.isPrimaryClient) {
         t.Mo.cs(e).forEach((e => {
             t.Mo.containsKey(e) || 
             // We removed the last reference for this key
-            _a(t, e);
+            _c(t, e);
         }));
     }
 }
 
-function _a(t, e) {
+function _c(t, e) {
     t.$o.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.Oo.get(e);
-    null !== n && (co(t.remoteStore, n), t.Oo = t.Oo.remove(e), t.Fo.delete(n), ya(t));
+    null !== n && (ao(t.remoteStore, n), t.Oo = t.Oo.remove(e), t.Fo.delete(n), yc(t));
 }
 
-function ma(t, e, n) {
-    for (const s of n) if (s instanceof Jo) t.Mo.addReference(s.key, e), ga(t, s); else if (s instanceof Yo) {
+function mc(t, e, n) {
+    for (const s of n) if (s instanceof Jo) t.Mo.addReference(s.key, e), gc(t, s); else if (s instanceof Yo) {
         k("SyncEngine", "Document no longer in limbo: " + s.key), t.Mo.removeReference(s.key, e);
         t.Mo.containsKey(s.key) || 
         // We removed the last reference for this key
-        _a(t, s.key);
+        _c(t, s.key);
     } else M();
 }
 
-function ga(t, e) {
+function gc(t, e) {
     const n = e.key, s = n.path.canonicalString();
     t.Oo.get(n) || t.$o.has(s) || (k("SyncEngine", "New document in limbo: " + n), t.$o.add(s), 
-    ya(t));
+    yc(t));
 }
 
 /**
@@ -13229,23 +13229,23 @@ function ga(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 ya(t) {
+ */ function yc(t) {
     for (;t.$o.size > 0 && t.Oo.size < t.maxConcurrentLimboResolutions; ) {
         const e = t.$o.values().next().value;
         t.$o.delete(e);
         const n = new Pt(ut.fromString(e)), s = t.Uo.next();
-        t.Fo.set(s, new ta(n)), t.Oo = t.Oo.insert(n, s), ao(t.remoteStore, new ii(Te(we(n.path)), s, 2 /* LimboResolution */ , Y.T));
+        t.Fo.set(s, new tc(n)), t.Oo = t.Oo.insert(n, s), co(t.remoteStore, new ii(Te(we(n.path)), s, 2 /* LimboResolution */ , Y.T));
     }
 }
 
-async function pa(t, e, n) {
+async function pc(t, e, n) {
     const s = U(t), i = [], r = [], o = [];
-    s.xo.isEmpty() || (s.xo.forEach(((t, a) => {
-        o.push(s.Ko(a, e, n).then((t => {
+    s.xo.isEmpty() || (s.xo.forEach(((t, c) => {
+        o.push(s.Ko(c, e, n).then((t => {
             if (t) {
-                s.isPrimaryClient && s.sharedClientState.updateQueryState(a.targetId, t.fromCache ? "not-current" : "current"), 
+                s.isPrimaryClient && s.sharedClientState.updateQueryState(c.targetId, t.fromCache ? "not-current" : "current"), 
                 i.push(t);
-                const e = or.kn(a.targetId, t);
+                const e = or.kn(c.targetId, t);
                 r.push(e);
             }
         })));
@@ -13272,7 +13272,7 @@ async function pa(t, e, n) {
     }(s.localStore, r));
 }
 
-async function Ea(t, e) {
+async function Ec(t, e) {
     const n = U(t);
     if (!n.currentUser.isEqual(e)) {
         k("SyncEngine", "User change. New user:", e.toKey());
@@ -13287,11 +13287,11 @@ async function Ea(t, e) {
             })), t.Bo.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 pa(n, t.Wn);
+        n.sharedClientState.handleUserChange(e, t.removedBatchIds, t.addedBatchIds), await pc(n, t.Wn);
     }
 }
 
-function Ta(t, e) {
+function Tc(t, e) {
     const n = U(t), s = n.Fo.get(e);
     if (s && s.Co) return Pn().add(s.key);
     {
@@ -13309,10 +13309,10 @@ function Ta(t, e) {
 /**
  * Reconcile the list of synced documents in an existing view with those
  * from persistence.
- */ async function Ia(t, e) {
+ */ async function Ic(t, e) {
     const n = U(t), s = await yr(n.localStore, e.query, 
     /* usePreviousResults= */ !0), i = e.view.So(s);
-    return n.isPrimaryClient && ma(n, e.targetId, i.vo), i;
+    return n.isPrimaryClient && mc(n, e.targetId, i.vo), i;
 }
 
 /**
@@ -13320,14 +13320,14 @@ function Ta(t, e) {
  * snapshots if needed.
  */
 // PORTING NOTE: Multi-Tab only.
-async function Aa(t) {
+async function Ac(t) {
     const e = U(t);
-    return Er(e.localStore).then((t => pa(e, t)));
+    return Er(e.localStore).then((t => pc(e, t)));
 }
 
 /** Applies a mutation state to an existing batch.  */
 // PORTING NOTE: Multi-Tab only.
-async function Ra(t, e, n, s) {
+async function Rc(t, e, n, s) {
     const i = U(t), r = await function(t, e) {
         const n = U(t), s = U(n.In);
         return n.persistence.runTransaction("Lookup mutation documents", "readonly", (t => s.Xt(t, e).next((e => e ? n.Qn.Pn(t, e) : js.resolve(null)))));
@@ -13341,11 +13341,11 @@ async function Ra(t, e, n, s) {
     await To(i.remoteStore) : "acknowledged" === n || "rejected" === n ? (
     // NOTE: Both these methods are no-ops for batches that originated from
     // other clients.
-    da(i, e, s || null), fa(i, e), function(t, e) {
+    dc(i, e, s || null), fc(i, e), function(t, e) {
         U(U(t).In).te(e);
     }
     // PORTING NOTE: Multi-Tab only.
-    (i.localStore, e)) : M(), await pa(i, r)) : 
+    (i.localStore, e)) : M(), await pc(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
@@ -13358,31 +13358,31 @@ async function Ra(t, e, n, s) {
 
 /** Applies a query target change from a different tab. */
 // PORTING NOTE: Multi-Tab only.
-async function ba(t, e) {
+async function bc(t, e) {
     const n = U(t);
-    if (Ca(n), Na(n), !0 === e && !0 !== n.qo) {
+    if (Cc(n), Nc(n), !0 === e && !0 !== n.qo) {
         // 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 Pa(n, t.toArray());
+        const t = n.sharedClientState.getAllActiveQueryTargets(), e = await Pc(n, t.toArray());
         n.qo = !0, await Do(n.remoteStore, !0);
-        for (const t of e) ao(n.remoteStore, t);
+        for (const t of e) co(n.remoteStore, t);
     } else if (!1 === e && !1 !== n.qo) {
         const t = [];
         let e = Promise.resolve();
         n.ko.forEach(((s, i) => {
-            n.sharedClientState.isLocalQueryTarget(i) ? t.push(i) : e = e.then((() => (wa(n, i), 
+            n.sharedClientState.isLocalQueryTarget(i) ? t.push(i) : e = e.then((() => (wc(n, i), 
             gr(n.localStore, i, 
-            /*keepPersistedTargetData=*/ !0)))), co(n.remoteStore, i);
-        })), await e, await Pa(n, t), 
+            /*keepPersistedTargetData=*/ !0)))), ao(n.remoteStore, i);
+        })), await e, await Pc(n, t), 
         // PORTING NOTE: Multi-Tab only.
         function(t) {
             const e = U(t);
             e.Fo.forEach(((t, n) => {
-                co(e.remoteStore, n);
+                ao(e.remoteStore, n);
             })), e.Mo.us(), e.Fo = new Map, e.Oo = new wn(Pt.comparator);
         }
         /**
@@ -13400,7 +13400,7 @@ async function ba(t, e) {
     }
 }
 
-async function Pa(t, e, n) {
+async function Pc(t, e, n) {
     const s = U(t), i = [], r = [];
     for (const t of e) {
         let e;
@@ -13412,14 +13412,14 @@ async function Pa(t, e, n) {
             // state (the list of syncedDocuments may have gotten out of sync).
             e = await mr(s.localStore, Te(n[0]));
             for (const t of n) {
-                const e = s.xo.get(t), n = await Ia(s, e);
+                const e = s.xo.get(t), n = await Ic(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 pr(s.localStore, t);
-            e = await mr(s.localStore, n), await sa(s, va(n), t, 
+            e = await mr(s.localStore, n), await sc(s, vc(n), t, 
             /*current=*/ !1);
         }
         i.push(e);
@@ -13438,20 +13438,20 @@ async function Pa(t, e, n) {
  * difference will not cause issues.
  */
 // PORTING NOTE: Multi-Tab only.
-function va(t) {
+function vc(t) {
     return de(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 Va(t) {
+function Vc(t) {
     const e = U(t);
     return U(U(e.localStore).persistence).pn();
 }
 
 /** Applies a query target change from a different tab. */
 // PORTING NOTE: Multi-Tab only.
-async function Sa(t, e, n, s) {
+async function Sc(t, e, n, s) {
     const i = U(t);
     if (i.qo) 
     // If we receive a target state notification via WebStorage, we are
@@ -13461,13 +13461,13 @@ async function Sa(t, e, n, s) {
       case "not-current":
         {
             const t = await Er(i.localStore), s = Sn.createSynthesizedRemoteEventForCurrentChange(e, "current" === n);
-            await pa(i, t, s);
+            await pc(i, t, s);
             break;
         }
 
       case "rejected":
         await gr(i.localStore, e, 
-        /* keepPersistedTargetData */ !0), wa(i, e, s);
+        /* keepPersistedTargetData */ !0), wc(i, e, s);
         break;
 
       default:
@@ -13475,8 +13475,8 @@ async function Sa(t, e, n, s) {
     }
 }
 
-/** Adds or removes Watch targets for queries from different tabs. */ async function Da(t, e, n) {
-    const s = Ca(t);
+/** Adds or removes Watch targets for queries from different tabs. */ async function Dc(t, e, n) {
+    const s = Cc(t);
     if (s.qo) {
         for (const t of e) {
             if (s.ko.has(t)) {
@@ -13485,8 +13485,8 @@ async function Sa(t, e, n, s) {
                 continue;
             }
             const e = await pr(s.localStore, t), n = await mr(s.localStore, e);
-            await sa(s, va(e), n.targetId, 
-            /*current=*/ !1), ao(s.remoteStore, n);
+            await sc(s, vc(e), n.targetId, 
+            /*current=*/ !1), co(s.remoteStore, n);
         }
         for (const t of n) 
         // Check that the target is still active since the target might have been
@@ -13495,21 +13495,21 @@ async function Sa(t, e, n, s) {
         // Release queries that are still active.
         await gr(s.localStore, t, 
         /* keepPersistedTargetData */ !1).then((() => {
-            co(s.remoteStore, t), wa(s, t);
+            ao(s.remoteStore, t), wc(s, t);
         })).catch(Fi);
     }
 }
 
-function Ca(t) {
+function Cc(t) {
     const e = U(t);
-    return e.remoteStore.remoteSyncer.applyRemoteEvent = oa.bind(null, e), e.remoteStore.remoteSyncer.getRemoteKeysForTarget = Ta.bind(null, e), 
-    e.remoteStore.remoteSyncer.rejectListen = ca.bind(null, e), e.No.Tr = qo.bind(null, e.eventManager), 
+    return e.remoteStore.remoteSyncer.applyRemoteEvent = oc.bind(null, e), e.remoteStore.remoteSyncer.getRemoteKeysForTarget = Tc.bind(null, e), 
+    e.remoteStore.remoteSyncer.rejectListen = ac.bind(null, e), e.No.Tr = qo.bind(null, e.eventManager), 
     e.No.jo = Ko.bind(null, e.eventManager), e;
 }
 
-function Na(t) {
+function Nc(t) {
     const e = U(t);
-    return e.remoteStore.remoteSyncer.applySuccessfulWrite = ua.bind(null, e), e.remoteStore.remoteSyncer.rejectFailedWrite = ha.bind(null, e), 
+    return e.remoteStore.remoteSyncer.applySuccessfulWrite = uc.bind(null, e), e.remoteStore.remoteSyncer.rejectFailedWrite = hc.bind(null, e), 
     e;
 }
 
@@ -13520,7 +13520,7 @@ function Na(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 xa(t, e, n) {
+ */ function xc(t, e, n) {
     const s = U(t);
     // eslint-disable-next-line @typescript-eslint/no-floating-promises
         (async function(t, e, n) {
@@ -13552,7 +13552,7 @@ function Na(t) {
             // TODO(b/160876443): This currently raises snapshots with
             // `fromCache=false` if users already listen to some queries and bundles
             // has newer version.
-                        await pa(t, o.Tn, 
+                        await pc(t, o.Tn, 
             /* remoteEvent */ void 0), 
             // Save metadata, so loading the same bundle will skip.
             await function(t, e) {
@@ -13591,7 +13591,7 @@ function Na(t) {
     }));
 }
 
-class ka {
+class kc {
     constructor() {
         this.synchronizeTabs = !1;
     }
@@ -13603,7 +13603,7 @@ class ka {
         return null;
     }
     Ho(t) {
-        return ur(this.persistence, new ar, t.initialUser, this.N);
+        return ur(this.persistence, new cr, t.initialUser, this.N);
     }
     Go(t) {
         return new Cr(xr.Ns, this.N);
@@ -13619,21 +13619,21 @@ class ka {
 
 /**
  * Provides all components needed for Firestore with IndexedDB persistence.
- */ class $a extends ka {
+ */ class $c extends kc {
     constructor(t, e, n) {
         super(), this.Jo = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;
     }
     async initialize(t) {
         await super.initialize(t), await Tr(this.localStore), await this.Jo.initialize(this, t), 
         // Enqueue writes from a previous session
-        await Na(this.Jo.syncEngine), await To(this.Jo.remoteStore), 
+        await Nc(this.Jo.syncEngine), await To(this.Jo.remoteStore), 
         // NOTE: This will immediately call the listener, so we make sure to
         // set it after localStore / remoteStore are started.
         await this.persistence.nn((() => (this.gcScheduler && !this.gcScheduler.started && this.gcScheduler.start(this.localStore), 
         Promise.resolve())));
     }
     Ho(t) {
-        return ur(this.persistence, new ar, t.initialUser, this.N);
+        return ur(this.persistence, new cr, t.initialUser, this.N);
     }
     zo(t) {
         const e = this.persistence.referenceDelegate.garbageCollector;
@@ -13655,7 +13655,7 @@ class ka {
  * 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 Oa extends $a {
+ */ class Oc extends $c {
     constructor(t, e) {
         super(t, e, /* forceOwnership= */ !1), this.Jo = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;
     }
@@ -13663,16 +13663,16 @@ class ka {
         await super.initialize(t);
         const e = this.Jo.syncEngine;
         this.sharedClientState instanceof qr && (this.sharedClientState.syncEngine = {
-            _i: Ra.bind(null, e),
-            mi: Sa.bind(null, e),
-            gi: Da.bind(null, e),
-            pn: Va.bind(null, e),
-            wi: Aa.bind(null, e)
+            _i: Rc.bind(null, e),
+            mi: Sc.bind(null, e),
+            gi: Dc.bind(null, e),
+            pn: Vc.bind(null, e),
+            wi: Ac.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.nn((async t => {
-            await ba(this.Jo.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start(this.localStore) : t || this.gcScheduler.stop());
+            await bc(this.Jo.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start(this.localStore) : t || this.gcScheduler.stop());
         }));
     }
     Wo(t) {
@@ -13686,13 +13686,13 @@ class ka {
 /**
  * Initializes and wires the components that are needed to interface with the
  * network.
- */ class Fa {
+ */ class Fc {
     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 => aa(this.syncEngine, t, 1 /* SharedClientState */), 
-        this.remoteStore.remoteSyncer.handleCredentialChange = Ea.bind(null, this.syncEngine), 
+        /* startAsPrimary=*/ !t.synchronizeTabs), this.sharedClientState.onlineStateHandler = t => cc(this.syncEngine, t, 1 /* SharedClientState */), 
+        this.remoteStore.remoteSyncer.handleCredentialChange = Ec.bind(null, this.syncEngine), 
         await Do(this.remoteStore, this.syncEngine.isPrimaryClient));
     }
     createEventManager(t) {
@@ -13706,7 +13706,7 @@ class ka {
         }(t.credentials, n, e);
     }
     createRemoteStore(t) {
-        return e = this.localStore, n = this.datastore, s = t.asyncQueue, i = t => aa(this.syncEngine, t, 0 /* RemoteStore */), 
+        return e = this.localStore, n = this.datastore, s = t.asyncQueue, i = t => cc(this.syncEngine, t, 0 /* RemoteStore */), 
         r = Qr.bt() ? new Qr : new jr, new io(e, n, s, i, r);
         var e, n, s, i, r;
         /** Re-enables the network. Idempotent. */    }
@@ -13714,8 +13714,8 @@ class ka {
         return function(t, e, n, 
         // PORTING NOTE: Manages state synchronization in multi-tab environments.
         s, i, r, o) {
-            const a = new ea(t, e, n, s, i, r);
-            return o && (a.qo = !0), a;
+            const c = new ec(t, e, n, s, i, r);
+            return o && (c.qo = !0), c;
         }(this.localStore, this.remoteStore, this.eventManager, this.sharedClientState, t.initialUser, t.maxConcurrentLimboResolutions, e);
     }
     terminate() {
@@ -13757,7 +13757,7 @@ class ka {
  * @param bytesPerRead - How many bytes each `read()` from the returned reader
  *        will read.
  */
-function Ma(t, e = 10240) {
+function Mc(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.
@@ -13823,7 +13823,7 @@ function Ma(t, e = 10240) {
  * asynchronously. To allow immediate silencing, a mute call is added which
  * causes events scheduled to no longer be raised.
  */
-class La {
+class Lc {
     constructor(t) {
         this.observer = t, 
         /**
@@ -13869,7 +13869,7 @@ class La {
  *
  * Takes a bundle stream or buffer, and presents abstractions to read bundled
  * elements out of the underlying content.
- */ class Ba {
+ */ class Bc {
     constructor(
     /** The reader to read from underlying binary bundle data source. */
     t, e) {
@@ -13880,9 +13880,9 @@ class La {
          * Internal buffer to hold bundle content, accumulating incomplete element
          * content.
          */
-        this.buffer = new Uint8Array, this.ta = new TextDecoder("utf-8"), 
+        this.buffer = new Uint8Array, this.tc = new TextDecoder("utf-8"), 
         // Read the metadata (which is the first element).
-        this.ea().then((t => {
+        this.ec().then((t => {
             t && t.ho() ? 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)));
     }
@@ -13894,7 +13894,7 @@ class La {
     }
     async Qo() {
         // Makes sure metadata is read before proceeding.
-        return await this.getMetadata(), this.ea();
+        return await this.getMetadata(), this.ec();
     }
     /**
      * Reads from the head of internal buffer, and pulling more data from
@@ -13905,15 +13905,15 @@ class La {
      *
      * Returns either the bundled element, or null if we have reached the end of
      * the stream.
-     */    async ea() {
-        const t = await this.na();
+     */    async ec() {
+        const t = await this.nc();
         if (null === t) return null;
-        const e = this.ta.decode(t), n = Number(e);
-        isNaN(n) && this.sa(`length string (${e}) is not valid number`);
-        const s = await this.ia(n);
+        const e = this.tc.decode(t), n = Number(e);
+        isNaN(n) && this.sc(`length string (${e}) is not valid number`);
+        const s = await this.ic(n);
         return new Wo(JSON.parse(s), t.length + n);
     }
-    /** First index of '{' from the underlying buffer. */    ra() {
+    /** First index of '{' from the underlying buffer. */    rc() {
         return this.buffer.findIndex((t => t === "{".charCodeAt(0)));
     }
     /**
@@ -13921,17 +13921,17 @@ class La {
      * return the content.
      *
      * If reached end of the stream, returns a null.
-     */    async na() {
-        for (;this.ra() < 0; ) {
-            if (await this.oa()) break;
+     */    async nc() {
+        for (;this.rc() < 0; ) {
+            if (await this.oc()) 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.ra();
+        const t = this.rc();
         // Broke out of the loop because underlying stream is closed, but still
         // cannot find an open bracket.
-                t < 0 && this.sa("Reached the end of bundle when a length string is expected.");
+                t < 0 && this.sc("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;
@@ -13941,22 +13941,22 @@ class La {
      * number of bytes, pulling more data from the underlying stream if needed.
      *
      * Returns a string decoded from the read bytes.
-     */    async ia(t) {
+     */    async ic(t) {
         for (;this.buffer.length < t; ) {
-            await this.oa() && this.sa("Reached the end of bundle when more is expected.");
+            await this.oc() && this.sc("Reached the end of bundle when more is expected.");
         }
-        const e = this.ta.decode(this.buffer.slice(0, t));
+        const e = this.tc.decode(this.buffer.slice(0, t));
         // Update the internal buffer to drop the read json string.
                 return this.buffer = this.buffer.slice(t), e;
     }
-    sa(t) {
+    sc(t) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
         throw this.Zo.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 oa() {
+     */    async oc() {
         const t = await this.Zo.read();
         if (!t.done) {
             const e = new Uint8Array(this.buffer.length + t.value.length);
@@ -13986,7 +13986,7 @@ class La {
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
  */
-class Ua {
+class Uc {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -14014,11 +14014,11 @@ class Ua {
                 const e = es(n.N, t);
                 o.set(e.key.toString(), e);
             }));
-            const a = [];
+            const c = [];
             return e.forEach((t => {
                 const e = o.get(t.toString());
-                L(!!e), a.push(e);
-            })), a;
+                L(!!e), c.push(e);
+            })), c;
         }(this.datastore, t);
         return e.forEach((t => this.recordVersion(t))), e;
     }
@@ -14034,7 +14034,7 @@ class Ua {
         this.writtenDocs.add(t.toString());
     }
     delete(t) {
-        this.write(new an(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new cn(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }
     async commit() {
         if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
@@ -14047,7 +14047,7 @@ class Ua {
         // a `verify` operation.
         t.forEach(((t, e) => {
             const n = Pt.fromPath(e);
-            this.mutations.push(new cn(n, this.precondition(n)));
+            this.mutations.push(new an(n, this.precondition(n)));
         })), await async function(t, e) {
             const n = U(t), s = Yn(n.N) + "/documents", i = {
                 writes: e.map((t => ss(n.N, t)))
@@ -14127,29 +14127,29 @@ class Ua {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class qa {
+class qc {
     constructor(t, e, n, s) {
         this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = s, 
-        this.aa = 5, this.rr = new Xr(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.cc = 5, this.rr = new Xr(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
-        this.aa -= 1, this.ca();
+        this.cc -= 1, this.ac();
     }
-    ca() {
+    ac() {
         this.rr.Xi((async () => {
-            const t = new Ua(this.datastore), e = this.ua(t);
+            const t = new Uc(this.datastore), e = this.uc(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
                 })).catch((t => {
-                    this.ha(t);
+                    this.hc(t);
                 }))));
             })).catch((t => {
-                this.ha(t);
+                this.hc(t);
             }));
         }));
     }
-    ua(t) {
+    uc(t) {
         try {
             const e = this.updateFunction(t);
             return !At(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
@@ -14159,11 +14159,11 @@ class qa {
             return this.deferred.reject(t), null;
         }
     }
-    ha(t) {
-        this.aa > 0 && this.la(t) ? (this.aa -= 1, this.asyncQueue.enqueueAndForget((() => (this.ca(), 
+    hc(t) {
+        this.cc > 0 && this.lc(t) ? (this.cc -= 1, this.asyncQueue.enqueueAndForget((() => (this.ac(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
-    la(t) {
+    lc(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.
@@ -14195,7 +14195,7 @@ class qa {
  * pieces of the client SDK architecture. It is responsible for creating the
  * async queue that is shared by all of the other components in the system.
  */
-class Ka {
+class Kc {
     constructor(t, 
     /**
      * Asynchronous queue responsible for all of our internal processing. When
@@ -14249,7 +14249,7 @@ class Ka {
     }
 }
 
-async function ja(t, e) {
+async function jc(t, e) {
     t.asyncQueue.verifyOperationInProgress(), k("FirestoreClient", "Initializing OfflineComponentProvider");
     const n = await t.getConfiguration();
     await e.initialize(n);
@@ -14262,9 +14262,9 @@ async function ja(t, e) {
     e.persistence.setDatabaseDeletedListener((() => t.terminate())), t.offlineComponents = e;
 }
 
-async function Qa(t, e) {
+async function Qc(t, e) {
     t.asyncQueue.verifyOperationInProgress();
-    const n = await Wa(t);
+    const n = await Wc(t);
     k("FirestoreClient", "Initializing OnlineComponentProvider");
     const s = await t.getConfiguration();
     await e.initialize(n, s), 
@@ -14284,41 +14284,41 @@ async function Qa(t, e) {
     }(e.remoteStore, t))), t.onlineComponents = e;
 }
 
-async function Wa(t) {
+async function Wc(t) {
     return t.offlineComponents || (k("FirestoreClient", "Using default OfflineComponentProvider"), 
-    await ja(t, new ka)), t.offlineComponents;
+    await jc(t, new kc)), t.offlineComponents;
 }
 
-async function Ga(t) {
+async function Gc(t) {
     return t.onlineComponents || (k("FirestoreClient", "Using default OnlineComponentProvider"), 
-    await Qa(t, new Fa)), t.onlineComponents;
+    await Qc(t, new Fc)), t.onlineComponents;
 }
 
-function za(t) {
-    return Wa(t).then((t => t.persistence));
+function zc(t) {
+    return Wc(t).then((t => t.persistence));
 }
 
-function Ha(t) {
-    return Wa(t).then((t => t.localStore));
+function Hc(t) {
+    return Wc(t).then((t => t.localStore));
 }
 
-function Ja(t) {
-    return Ga(t).then((t => t.remoteStore));
+function Jc(t) {
+    return Gc(t).then((t => t.remoteStore));
 }
 
-function Ya(t) {
-    return Ga(t).then((t => t.syncEngine));
+function Yc(t) {
+    return Gc(t).then((t => t.syncEngine));
 }
 
-async function Xa(t) {
-    const e = await Ga(t), n = e.eventManager;
-    return n.onListen = na.bind(null, e.syncEngine), n.onUnlisten = ia.bind(null, e.syncEngine), 
+async function Xc(t) {
+    const e = await Gc(t), n = e.eventManager;
+    return n.onListen = nc.bind(null, e.syncEngine), n.onUnlisten = ic.bind(null, e.syncEngine), 
     n;
 }
 
-/** Enables the network connection and re-enqueues all pending operations. */ function Za(t) {
+/** Enables the network connection and re-enqueues all pending operations. */ function Zc(t) {
     return t.asyncQueue.enqueue((async () => {
-        const e = await za(t), n = await Ja(t);
+        const e = await zc(t), n = await Jc(t);
         return e.setNetworkEnabled(!0), function(t) {
             const e = U(t);
             return e.Kr.delete(0 /* UserDisabled */), ro(e);
@@ -14326,9 +14326,9 @@ async function Xa(t) {
     }));
 }
 
-/** Disables the network connection. Pending operations will not complete. */ function tc(t) {
+/** Disables the network connection. Pending operations will not complete. */ function ta(t) {
     return t.asyncQueue.enqueue((async () => {
-        const e = await za(t), n = await Ja(t);
+        const e = await zc(t), n = await Jc(t);
         return e.setNetworkEnabled(!1), async function(t) {
             const e = U(t);
             e.Kr.add(0 /* UserDisabled */), await oo(e), 
@@ -14342,7 +14342,7 @@ async function Xa(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 ec(t, e) {
+ */ function ea(t, e) {
     const n = new j;
     return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {
         try {
@@ -14359,19 +14359,19 @@ async function Xa(t) {
     /**
  * Retrieves a latency-compensated document from the backend via a
  * SnapshotListener.
- */ (await Ha(t), e, n))), n.promise;
+ */ (await Hc(t), e, n))), n.promise;
 }
 
-function nc(t, e, n = {}) {
+function na(t, e, n = {}) {
     const s = new j;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new La({
+        const r = new Lc({
             next: r => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
                 e.enqueueAndForget((() => Uo(t, o)));
-                const a = r.docs.has(n);
-                !a && r.fromCache ? 
+                const c = r.docs.has(n);
+                !c && r.fromCache ? 
                 // TODO(dimond): If we're online and the document doesn't
                 // exist then we resolve with a doc.exists set to false. If
                 // we're offline however, we reject the Promise in this
@@ -14379,7 +14379,7 @@ function nc(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 K(q.UNAVAILABLE, "Failed to get document because the client is offline.")) : a && r.fromCache && s && "server" === s.source ? i.reject(new K(q.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 K(q.UNAVAILABLE, "Failed to get document because the client is offline.")) : c && r.fromCache && s && "server" === s.source ? i.reject(new K(q.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 Qo(we(n.path), r, {
@@ -14387,10 +14387,10 @@ function nc(t, e, n = {}) {
             uo: !0
         });
         return Bo(t, o);
-    }(await Xa(t), t.asyncQueue, e, n, s))), s.promise;
+    }(await Xc(t), t.asyncQueue, e, n, s))), s.promise;
 }
 
-function sc(t, e) {
+function sa(t, e) {
     const n = new j;
     return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {
         try {
@@ -14406,13 +14406,13 @@ function sc(t, e) {
     /**
  * Retrieves a latency-compensated query snapshot from the backend via a
  * SnapshotListener.
- */ (await Ha(t), e, n))), n.promise;
+ */ (await Hc(t), e, n))), n.promise;
 }
 
-function ic(t, e, n = {}) {
+function ia(t, e, n = {}) {
     const s = new j;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new La({
+        const r = new Lc({
             next: n => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
@@ -14424,20 +14424,20 @@ function ic(t, e, n = {}) {
             uo: !0
         });
         return Bo(t, o);
-    }(await Xa(t), t.asyncQueue, e, n, s))), s.promise;
+    }(await Xc(t), t.asyncQueue, e, n, s))), s.promise;
 }
 
-function rc(t, e) {
-    const n = new La(e);
+function ra(t, e) {
+    const n = new Lc(e);
     return t.asyncQueue.enqueueAndForget((async () => function(t, e) {
         U(t).Zr.add(e), 
         // Immediately fire an initial event, indicating all existing listeners
         // are in-sync.
         e.next();
-    }(await Xa(t), n))), () => {
+    }(await Xc(t), n))), () => {
         n.Xo(), t.asyncQueue.enqueueAndForget((async () => function(t, e) {
             U(t).Zr.delete(e);
-        }(await Xa(t), n)));
+        }(await Xc(t), n)));
     };
 }
 
@@ -14455,25 +14455,25 @@ function rc(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 oc(t, e) {
+ */ function oa(t, e) {
     const n = new j;
     return t.asyncQueue.enqueueAndForget((async () => {
         const s = await function(t) {
-            return Ga(t).then((t => t.datastore));
+            return Gc(t).then((t => t.datastore));
         }(t);
-        new qa(t.asyncQueue, s, e, n).run();
+        new qc(t.asyncQueue, s, e, n).run();
     })), n.promise;
 }
 
-function ac(t, e, n, s) {
+function ca(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 Ba(t, e);
+            return new Bc(t, e);
         }(function(t, e) {
-            if (t instanceof Uint8Array) return Ma(t, e);
-            if (t instanceof ArrayBuffer) return Ma(new Uint8Array(t), e);
+            if (t instanceof Uint8Array) return Mc(t, e);
+            if (t instanceof ArrayBuffer) return Mc(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);
@@ -14495,18 +14495,18 @@ function ac(t, e, n, s) {
  * limitations under the License.
  */ (n, Yr(e));
     t.asyncQueue.enqueueAndForget((async () => {
-        xa(await Ya(t), i, s);
+        xc(await Yc(t), i, s);
     }));
 }
 
-function cc(t, e) {
+function aa(t, e) {
     return t.asyncQueue.enqueue((async () => function(t, e) {
         const n = U(t);
         return n.persistence.runTransaction("Get named query", "readonly", (t => n.Je.getNamedQuery(t, e)));
-    }(await Ha(t), e)));
+    }(await Hc(t), e)));
 }
 
-class uc {
+class ua {
     /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -14524,9 +14524,9 @@ class uc {
      * @param useFetchStreams Whether to use the Fetch API instead of
      * XMLHTTPRequest
      */
-    constructor(t, e, n, s, i, r, o, a) {
+    constructor(t, e, n, s, i, r, o, c) {
         this.databaseId = t, this.appId = e, this.persistenceKey = n, this.host = s, this.ssl = i, 
-        this.forceLongPolling = r, this.autoDetectLongPolling = o, this.useFetchStreams = a;
+        this.forceLongPolling = r, this.autoDetectLongPolling = o, this.useFetchStreams = c;
     }
 }
 
@@ -14535,7 +14535,7 @@ class uc {
  * Represents the database ID a Firestore client is associated with.
  * @internal
  */
-class hc {
+class ha {
     constructor(t, e) {
         this.projectId = t, this.database = e || "(default)";
     }
@@ -14543,7 +14543,7 @@ class hc {
         return "(default)" === this.database;
     }
     isEqual(t) {
-        return t instanceof hc && t.projectId === this.projectId && t.database === this.database;
+        return t instanceof ha && t.projectId === this.projectId && t.database === this.database;
     }
 }
 
@@ -14562,7 +14562,7 @@ class hc {
  * 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 lc = new Map;
+ */ const la = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -14584,28 +14584,28 @@ class hc {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function fc(t, e, n) {
+function fa(t, e, n) {
     if (!n) throw new K(q.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 dc(t, e, n, s) {
+ */ function da(t, e, n, s) {
     if (!0 === e && !0 === s) throw new K(q.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 wc(t) {
+ */ function wa(t) {
     if (!Pt.isDocumentKey(t)) throw new K(q.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 _c(t) {
+ */ function _a(t) {
     if (Pt.isDocumentKey(t)) throw new K(q.INVALID_ARGUMENT, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
@@ -14614,7 +14614,7 @@ function fc(t, e, n) {
  * (i.e. excludes Array, Date, etc.).
  */
 /** Returns a string describing the type / value of the provided input. */
-function mc(t) {
+function ma(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)}...`), 
@@ -14646,7 +14646,7 @@ function mc(t) {
     return "function" == typeof t ? "a function" : M();
 }
 
-function gc(t, 
+function ga(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     if ("_delegate" in t && (
@@ -14655,14 +14655,14 @@ e) {
     t = t._delegate), !(t instanceof e)) {
         if (e.name === t.constructor.name) throw new K(q.INVALID_ARGUMENT, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
-            const n = mc(t);
+            const n = ma(t);
             throw new K(q.INVALID_ARGUMENT, `Expected type '${e.name}', but it was: ${n}`);
         }
     }
     return t;
 }
 
-function yc(t, e) {
+function ya(t, e) {
     if (e <= 0) throw new K(q.INVALID_ARGUMENT, `Function ${t}() requires a positive number, but it was: ${e}.`);
 }
 
@@ -14688,7 +14688,7 @@ function yc(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 pc {
+class pa {
     constructor(t) {
         var e;
         if (void 0 === t.host) {
@@ -14701,7 +14701,7 @@ class pc {
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
-        this.useFetchStreams = !!t.useFetchStreams, dc("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
+        this.useFetchStreams = !!t.useFetchStreams, da("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;
@@ -14728,18 +14728,18 @@ class pc {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class Ec {
+ */ class Ea {
     /** @hideconstructor */
     constructor(t, e) {
         this._credentials = e, 
         /**
          * Whether it's a Firestore or Firestore Lite instance.
          */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new pc({}), 
-        this._settingsFrozen = !1, t instanceof hc ? this._databaseId = t : (this._app = t, 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new pa({}), 
+        this._settingsFrozen = !1, t instanceof ha ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
             if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new K(q.INVALID_ARGUMENT, '"projectId" not provided in firebase.initializeApp.');
-            return new hc(t.options.projectId);
+            return new ha(t.options.projectId);
         }
         /**
  * Modify this instance to communicate with the Cloud Firestore emulator.
@@ -14770,7 +14770,7 @@ class pc {
     }
     _setSettings(t) {
         if (this._settingsFrozen) throw new K(q.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 pc(t), void 0 !== t.credentials && (this._credentials = function(t) {
+        this._settings = new pa(t), void 0 !== t.credentials && (this._credentials = function(t) {
             if (!t) return new W;
             switch (t.type) {
               case "gapi":
@@ -14815,15 +14815,15 @@ class pc {
  * when the `Firestore` instance is terminated.
  */
         return function(t) {
-            const e = lc.get(t);
-            e && (k("ComponentProvider", "Removing Datastore"), lc.delete(t), e.terminate());
+            const e = la.get(t);
+            e && (k("ComponentProvider", "Removing Datastore"), la.delete(t), e.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function Tc(t, e, n, s = {}) {
+function Ta(t, e, n, s = {}) {
     var i;
-    const r = (t = gc(t, Ec))._getSettings();
+    const r = (t = ga(t, Ea))._getSettings();
     if ("firestore.googleapis.com" !== r.host && r.host !== e && O("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, r), {
         host: `${e}:${n}`,
@@ -14862,7 +14862,7 @@ function Tc(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 Ic {
+ */ class Ia {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -14890,17 +14890,17 @@ function Tc(t, e, n, s = {}) {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new Rc(this.firestore, this.converter, this._key.path.popLast());
+        return new Ra(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new Ic(this.firestore, t, this._key);
+        return new Ia(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 Ac {
+ */ class Aa {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -14913,14 +14913,14 @@ function Tc(t, e, n, s = {}) {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new Ac(this.firestore, t, this._query);
+        return new Aa(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 Rc extends Ac {
+ */ class Ra extends Aa {
     /** @hideconstructor */
     constructor(t, e, n) {
         super(t, e, we(n)), this._path = n, 
@@ -14941,23 +14941,23 @@ function Tc(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 Ic(this.firestore, 
+        return t.isEmpty() ? null : new Ia(this.firestore, 
         /* converter= */ null, new Pt(t));
     }
     withConverter(t) {
-        return new Rc(this.firestore, t, this._path);
+        return new Ra(this.firestore, t, this._path);
     }
 }
 
-function bc(t, e, ...n) {
-    if (t = y(t), fc("collection", "path", e), t instanceof Ec) {
+function ba(t, e, ...n) {
+    if (t = y(t), fa("collection", "path", e), t instanceof Ea) {
         const s = ut.fromString(e, ...n);
-        return _c(s), new Rc(t, /* converter= */ null, s);
+        return _a(s), new Ra(t, /* converter= */ null, s);
     }
     {
-        if (!(t instanceof Ic || t instanceof Rc)) throw new K(q.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof Ia || t instanceof Ra)) throw new K(q.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(ut.fromString(e, ...n));
-        return _c(s), new Rc(t.firestore, 
+        return _a(s), new Ra(t.firestore, 
         /* converter= */ null, s);
     }
 }
@@ -14974,9 +14974,9 @@ function bc(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 Pc(t, e) {
-    if (t = gc(t, Ec), fc("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new K(q.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new Ac(t, 
+ */ function Pa(t, e) {
+    if (t = ga(t, Ea), fa("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new K(q.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new Aa(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
@@ -14987,19 +14987,19 @@ function bc(t, e, ...n) {
     }(e));
 }
 
-function vc(t, e, ...n) {
+function va(t, e, ...n) {
     if (t = y(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = Z.I()), fc("doc", "path", e), t instanceof Ec) {
+    1 === arguments.length && (e = Z.I()), fa("doc", "path", e), t instanceof Ea) {
         const s = ut.fromString(e, ...n);
-        return wc(s), new Ic(t, 
+        return wa(s), new Ia(t, 
         /* converter= */ null, new Pt(s));
     }
     {
-        if (!(t instanceof Ic || t instanceof Rc)) throw new K(q.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof Ia || t instanceof Ra)) throw new K(q.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(ut.fromString(e, ...n));
-        return wc(s), new Ic(t.firestore, t instanceof Rc ? t.converter : null, new Pt(s));
+        return wa(s), new Ia(t.firestore, t instanceof Ra ? t.converter : null, new Pt(s));
     }
 }
 
@@ -15010,8 +15010,8 @@ function vc(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 Vc(t, e) {
-    return t = y(t), e = y(e), (t instanceof Ic || t instanceof Rc) && (e instanceof Ic || e instanceof Rc) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+ */ function Va(t, e) {
+    return t = y(t), e = y(e), (t instanceof Ia || t instanceof Ra) && (e instanceof Ia || e instanceof Ra) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -15022,8 +15022,8 @@ function vc(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 Sc(t, e) {
-    return t = y(t), e = y(e), t instanceof Ac && e instanceof Ac && (t.firestore === e.firestore && Ae(t._query, e._query) && t.converter === e.converter);
+ */ function Sa(t, e) {
+    return t = y(t), e = y(e), t instanceof Aa && e instanceof Aa && (t.firestore === e.firestore && Ae(t._query, e._query) && t.converter === e.converter);
 }
 
 /**
@@ -15041,42 +15041,42 @@ function vc(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 Dc {
+ */ class Da {
     constructor() {
         // The last promise in the queue.
-        this.fa = Promise.resolve(), 
+        this.fc = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.da = [], 
+        this.dc = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.wa = !1, 
+        this.wc = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this._a = [], 
+        this._c = [], 
         // visible for testing
-        this.ma = null, 
+        this.mc = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.ga = !1, 
+        this.gc = !1, 
         // Enabled during shutdown on Safari to prevent future access to IndexedDB.
-        this.ya = !1, 
+        this.yc = !1, 
         // List of TimerIds to fast-forward delays for.
-        this.pa = [], 
+        this.Ec = [], 
         // Backoff timer used to schedule retries for retryable operations
         this.rr = new Xr(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.Ea = () => {
+        this.Tc = () => {
             const t = Jr();
             t && k("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.rr.tr();
         };
         const t = Jr();
-        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ea);
+        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Tc);
     }
     get isShuttingDown() {
-        return this.wa;
+        return this.wc;
     }
     /**
      * Adds a new operation to the queue without waiting for it to complete (i.e.
@@ -15086,44 +15086,44 @@ function vc(t, e, ...n) {
         this.enqueue(t);
     }
     enqueueAndForgetEvenWhileRestricted(t) {
-        this.Ta(), 
+        this.Ic(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.Ia(t);
+        this.Ac(t);
     }
     enterRestrictedMode(t) {
-        if (!this.wa) {
-            this.wa = !0, this.ya = t || !1;
+        if (!this.wc) {
+            this.wc = !0, this.yc = t || !1;
             const e = Jr();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ea);
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Tc);
         }
     }
     enqueue(t) {
-        if (this.Ta(), this.wa) 
+        if (this.Ic(), this.wc) 
         // Return a Promise which never resolves.
         return new Promise((() => {}));
         // Create a deferred Promise that we can return to the callee. This
         // allows us to return a "hanging Promise" only to the callee and still
         // advance the queue even when the operation is not run.
                 const e = new j;
-        return this.Ia((() => this.wa && this.ya ? Promise.resolve() : (t().then(e.resolve, e.reject), 
+        return this.Ac((() => this.wc && this.yc ? Promise.resolve() : (t().then(e.resolve, e.reject), 
         e.promise))).then((() => e.promise));
     }
     enqueueRetryable(t) {
-        this.enqueueAndForget((() => (this.da.push(t), this.Aa())));
+        this.enqueueAndForget((() => (this.dc.push(t), this.Rc())));
     }
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
-     */    async Aa() {
-        if (0 !== this.da.length) {
+     */    async Rc() {
+        if (0 !== this.dc.length) {
             try {
-                await this.da[0](), this.da.shift(), this.rr.reset();
+                await this.dc[0](), this.dc.shift(), this.rr.reset();
             } catch (t) {
                 if (!Hs(t)) throw t;
  // Failure will be handled by AsyncQueue
                                 k("AsyncQueue", "Operation failed with retryable error: " + t);
             }
-            this.da.length > 0 && 
+            this.dc.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
@@ -15134,12 +15134,12 @@ function vc(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.rr.Xi((() => this.Aa()));
+            this.rr.Xi((() => this.Rc()));
         }
     }
-    Ia(t) {
-        const e = this.fa.then((() => (this.ga = !0, t().catch((t => {
-            this.ma = t, this.ga = !1;
+    Ac(t) {
+        const e = this.fc.then((() => (this.gc = !0, t().catch((t => {
+            this.mc = t, this.gc = !1;
             // Re-throw the error so that this.tail becomes a rejected Promise and
             // all further attempts to chain (via .then) will just short-circuit
             // and return the rejected Promise.
@@ -15170,38 +15170,38 @@ function vc(t, e, ...n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */ (t)), t;
-        })).then((t => (this.ga = !1, t))))));
-        return this.fa = e, e;
+        })).then((t => (this.gc = !1, t))))));
+        return this.fc = e, e;
     }
     enqueueAfterDelay(t, e, n) {
-        this.Ta(), 
+        this.Ic(), 
         // Fast-forward delays for timerIds that have been overriden.
-        this.pa.indexOf(t) > -1 && (e = 0);
-        const s = xo.createAndSchedule(this, t, e, n, (t => this.Ra(t)));
-        return this._a.push(s), s;
+        this.Ec.indexOf(t) > -1 && (e = 0);
+        const s = xo.createAndSchedule(this, t, e, n, (t => this.bc(t)));
+        return this._c.push(s), s;
     }
-    Ta() {
-        this.ma && M();
+    Ic() {
+        this.mc && M();
     }
     verifyOperationInProgress() {}
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
-     */    async ba() {
+     */    async Pc() {
         // 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.fa, await t;
-        } while (t !== this.fa);
+            t = this.fc, await t;
+        } while (t !== this.fc);
     }
     /**
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
-     */    Pa(t) {
-        for (const e of this._a) if (e.timerId === t) return !0;
+     */    vc(t) {
+        for (const e of this._c) if (e.timerId === t) return !0;
         return !1;
     }
     /**
@@ -15210,28 +15210,28 @@ function vc(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.
-     */    va(t) {
+     */    Vc(t) {
         // Note that draining may generate more delayed ops, so we do that first.
-        return this.ba().then((() => {
+        return this.Pc().then((() => {
             // Run ops in the same order they'd run if they ran naturally.
-            this._a.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
-            for (const e of this._a) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
-            return this.ba();
+            this._c.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
+            for (const e of this._c) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
+            return this.Pc();
         }));
     }
     /**
      * For Tests: Skip all subsequent delays for a timer id.
-     */    Va(t) {
-        this.pa.push(t);
+     */    Sc(t) {
+        this.Ec.push(t);
     }
-    /** Called once a DelayedOperation is run or canceled. */    Ra(t) {
+    /** Called once a DelayedOperation is run or canceled. */    bc(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        const e = this._a.indexOf(t);
-        this._a.splice(e, 1);
+        const e = this._c.indexOf(t);
+        this._c.splice(e, 1);
     }
 }
 
-function Cc(t) {
+function Ca(t) {
     /**
  * Returns true if obj is an object and contains at least one of the specified
  * methods.
@@ -15266,7 +15266,7 @@ function Cc(t) {
  */ (t, [ "next", "error", "complete" ]);
 }
 
-class Nc {
+class Na {
     constructor() {
         this._progressObserver = {}, this._taskCompletionResolver = new j, this._lastProgress = {
             taskState: "Running",
@@ -15350,27 +15350,27 @@ class Nc {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** DOMException error code constants. */ const xc = -1;
+/** DOMException error code constants. */ const xa = -1;
 
 /**
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
  */
-class kc extends Ec {
+class ka extends Ea {
     /** @hideconstructor */
     constructor(t, e) {
         super(t, e), 
         /**
          * Whether it's a {@link Firestore} or Firestore Lite instance.
          */
-        this.type = "firestore", this._queue = new Dc, this._persistenceKey = "name" in t ? t.name : "[DEFAULT]";
+        this.type = "firestore", this._queue = new Da, 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.
-        Mc(this), this._firestoreClient.terminate();
+        Ma(this), this._firestoreClient.terminate();
     }
 }
 
@@ -15384,7 +15384,7 @@ class kc extends Ec {
  * be associated.
  * @param settings - A settings object to configure the {@link Firestore} instance.
  * @returns A newly initialized {@link Firestore} instance.
- */ function $c(t, e) {
+ */ function $a(t, e) {
     const n = _getProvider(t, "firestore");
     if (n.isInitialized()) {
         const t = n.getImmediate(), s = n.getOptions();
@@ -15405,22 +15405,22 @@ class kc extends Ec {
  * @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 Oc(e = t()) {
+ */ function Oa(e = t()) {
     return _getProvider(e, "firestore").getImmediate();
 }
 
 /**
  * @internal
- */ function Fc(t) {
-    return t._firestoreClient || Mc(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;
+ */ function Fa(t) {
+    return t._firestoreClient || Ma(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;
 }
 
-function Mc(t) {
+function Ma(t) {
     var e;
     const n = t._freezeSettings(), s = function(t, e, n, s) {
-        return new uc(t, e, n, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams);
+        return new ua(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 Ka(t._credentials, t._queue, s);
+    t._firestoreClient = new Kc(t._credentials, t._queue, s);
 }
 
 /**
@@ -15445,10 +15445,10 @@ function Mc(t) {
  * @param persistenceSettings - Optional settings object to configure
  * persistence.
  * @returns A `Promise` that represents successfully enabling persistent storage.
- */ function Lc(t, e) {
-    Hc(t = gc(t, kc));
-    const n = Fc(t), s = t._freezeSettings(), i = new Fa;
-    return Uc(n, i, new $a(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
+ */ function La(t, e) {
+    Ha(t = ga(t, ka));
+    const n = Fa(t), s = t._freezeSettings(), i = new Fc;
+    return Ua(n, i, new $c(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
 }
 
 /**
@@ -15472,10 +15472,10 @@ function Mc(t) {
  * @param firestore - The {@link Firestore} instance to enable persistence for.
  * @returns A `Promise` that represents successfully enabling persistent
  * storage.
- */ function Bc(t) {
-    Hc(t = gc(t, kc));
-    const e = Fc(t), n = t._freezeSettings(), s = new Fa;
-    return Uc(e, s, new Oa(s, n.cacheSizeBytes));
+ */ function Ba(t) {
+    Ha(t = ga(t, ka));
+    const e = Fa(t), n = t._freezeSettings(), s = new Fc;
+    return Ua(e, s, new Oc(s, n.cacheSizeBytes));
 }
 
 /**
@@ -15483,11 +15483,11 @@ function Mc(t) {
  * If the operation fails with a recoverable error (see
  * `canRecoverFromIndexedDbError()` below), the returned Promise is rejected
  * but the client remains usable.
- */ function Uc(t, e, n) {
+ */ function Ua(t, e, n) {
     const s = new j;
     return t.asyncQueue.enqueue((async () => {
         try {
-            await ja(t, n), await Qa(t, e), s.resolve();
+            await jc(t, n), await Qc(t, e), s.resolve();
         } catch (t) {
             if (!
             /**
@@ -15541,7 +15541,7 @@ function Mc(t) {
     })).then((() => s.promise));
 }
 
-function qc(t) {
+function qa(t) {
     if (t._initialized && !t._terminated) throw new K(q.FAILED_PRECONDITION, "Persistence can only be cleared before a Firestore instance is initialized or after it is terminated.");
     const e = new j;
     return t._queue.enqueueAndForgetEvenWhileRestricted((async () => {
@@ -15572,11 +15572,11 @@ function qc(t) {
  *
  * @returns A `Promise` which resolves when all currently pending writes have been
  * acknowledged by the backend.
- */ function Kc(t) {
+ */ function Ka(t) {
     return function(t) {
         const e = new j;
-        return t.asyncQueue.enqueueAndForget((async () => la(await Ya(t), e))), e.promise;
-    }(Fc(t = gc(t, kc)));
+        return t.asyncQueue.enqueueAndForget((async () => lc(await Yc(t), e))), e.promise;
+    }(Fa(t = ga(t, ka)));
 }
 
 /**
@@ -15584,8 +15584,8 @@ function qc(t) {
  * call to {@link disableNetwork}.
  *
  * @returns A `Promise` that is resolved once the network has been enabled.
- */ function jc(t) {
-    return Za(Fc(t = gc(t, kc)));
+ */ function ja(t) {
+    return Zc(Fa(t = ga(t, ka)));
 }
 
 /**
@@ -15595,8 +15595,8 @@ function qc(t) {
  * operations will be queued until the network is restored.
  *
  * @returns A `Promise` that is resolved once the network has been disabled.
- */ function Qc(t) {
-    return tc(Fc(t = gc(t, kc)));
+ */ function Qa(t) {
+    return ta(Fa(t = ga(t, ka)));
 }
 
 /**
@@ -15620,7 +15620,7 @@ function qc(t) {
  *
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function Wc(t) {
+ */ function Wa(t) {
     return e(t.app, "firestore"), t._delete();
 }
 
@@ -15634,9 +15634,9 @@ function qc(t) {
  * @returns
  *   A `LoadBundleTask` object, which notifies callers with progress updates, and completion
  *   or error events. It can be used as a `Promise<LoadBundleTaskProgress>`.
- */ function Gc(t, e) {
-    const n = Fc(t = gc(t, kc)), s = new Nc;
-    return ac(n, t._databaseId, e, s), s;
+ */ function Ga(t, e) {
+    const n = Fa(t = ga(t, ka)), s = new Na;
+    return ca(n, t._databaseId, e, s), s;
 }
 
 /**
@@ -15645,11 +15645,11 @@ function qc(t) {
  * The named queries are packaged  into bundles on the server side (along
  * with resulting documents), and loaded to local cache using `loadBundle`. Once in local
  * cache, use this method to extract a {@link Query} by name.
- */ function zc(t, e) {
-    return cc(Fc(t = gc(t, kc)), e).then((e => e ? new Ac(t, null, e.query) : null));
+ */ function za(t, e) {
+    return aa(Fa(t = ga(t, ka)), e).then((e => e ? new Aa(t, null, e.query) : null));
 }
 
-function Hc(t) {
+function Ha(t) {
     if (t._initialized || t._terminated) throw new K(q.FAILED_PRECONDITION, "Firestore has already been started and persistence can no longer be enabled. You can only enable persistence before calling any other methods on a Firestore object.");
 }
 
@@ -15693,7 +15693,7 @@ function Hc(t) {
  * Create a `FieldPath` by providing field names. If more than one field
  * name is provided, the path will point to a nested field in a document.
  */
-class Jc {
+class Ja {
     /**
      * Creates a `FieldPath` from the provided field names. If more than one field
      * name is provided, the path will point to a nested field in a document.
@@ -15717,8 +15717,8 @@ class Jc {
 /**
  * Returns a special sentinel `FieldPath` to refer to the ID of a document.
  * It can be used in queries to sort or filter by the document ID.
- */ function Yc() {
-    return new Jc("__name__");
+ */ function Ya() {
+    return new Ja("__name__");
 }
 
 /**
@@ -15739,7 +15739,7 @@ class Jc {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class Xc {
+ */ class Xa {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -15751,7 +15751,7 @@ class Jc {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new Xc(_t.fromBase64String(t));
+            return new Xa(_t.fromBase64String(t));
         } catch (t) {
             throw new K(q.INVALID_ARGUMENT, "Failed to construct data from Base64 string: " + t);
         }
@@ -15761,7 +15761,7 @@ class Jc {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new Xc(_t.fromUint8Array(t));
+        return new Xa(_t.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -15813,7 +15813,7 @@ class Jc {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class Zc {
+ */ class Za {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -15967,55 +15967,55 @@ function iu(t) {
         this.settings = t, this.databaseId = e, this.N = 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.Sa(), this.fieldTransforms = i || [], this.fieldMask = r || [];
+        void 0 === i && this.Dc(), this.fieldTransforms = i || [], this.fieldMask = r || [];
     }
     get path() {
         return this.settings.path;
     }
-    get Da() {
-        return this.settings.Da;
+    get Cc() {
+        return this.settings.Cc;
     }
-    /** Returns a new context with the specified settings overwritten. */    Ca(t) {
+    /** Returns a new context with the specified settings overwritten. */    Nc(t) {
         return new ru(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.N, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
-    Na(t) {
+    xc(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.Ca({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.Nc({
             path: n,
-            xa: !1
+            kc: !1
         });
-        return s.ka(t), s;
+        return s.$c(t), s;
     }
-    $a(t) {
+    Oc(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.Ca({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.Nc({
             path: n,
-            xa: !1
+            kc: !1
         });
-        return s.Sa(), s;
+        return s.Dc(), s;
     }
-    Oa(t) {
+    Fc(t) {
         // TODO(b/34871131): We don't support array paths right now; so make path
         // undefined.
-        return this.Ca({
+        return this.Nc({
             path: void 0,
-            xa: !0
+            kc: !0
         });
     }
-    Fa(t) {
-        return bu(t, this.settings.methodName, this.settings.Ma || !1, this.path, this.settings.La);
+    Mc(t) {
+        return bu(t, this.settings.methodName, this.settings.Lc || !1, this.path, this.settings.Bc);
     }
     /** 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)));
     }
-    Sa() {
+    Dc() {
         // 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.ka(this.path.get(t));
+        if (this.path) for (let t = 0; t < this.path.length; t++) this.$c(this.path.get(t));
     }
-    ka(t) {
-        if (0 === t.length) throw this.Fa("Document fields must not be empty");
-        if (iu(this.Da) && eu.test(t)) throw this.Fa('Document fields cannot begin and end with "__"');
+    $c(t) {
+        if (0 === t.length) throw this.Mc("Document fields must not be empty");
+        if (iu(this.Cc) && eu.test(t)) throw this.Mc('Document fields cannot begin and end with "__"');
     }
 }
 
@@ -16026,43 +16026,43 @@ function iu(t) {
     constructor(t, e, n) {
         this.databaseId = t, this.ignoreUndefinedProperties = e, this.N = n || Yr(t);
     }
-    /** Creates a new top-level parse context. */    Ba(t, e, n, s = !1) {
+    /** Creates a new top-level parse context. */    Uc(t, e, n, s = !1) {
         return new ru({
-            Da: t,
+            Cc: t,
             methodName: e,
-            La: n,
+            Bc: n,
             path: lt.emptyPath(),
-            xa: !1,
-            Ma: s
+            kc: !1,
+            Lc: s
         }, this.databaseId, this.N, this.ignoreUndefinedProperties);
     }
 }
 
-function au(t) {
+function cu(t) {
     const e = t._freezeSettings(), n = Yr(t._databaseId);
     return new ou(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function cu(t, e, n, s, i, r = {}) {
-    const o = t.Ba(r.merge || r.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
+/** Parse document data from a set() call. */ function au(t, e, n, s, i, r = {}) {
+    const o = t.Uc(r.merge || r.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
     Tu("Data must be an object, but it was:", o, s);
-    const a = pu(s, o);
-    let c, u;
-    if (r.merge) c = new ft(o.fieldMask), u = o.fieldTransforms; else if (r.mergeFields) {
+    const c = pu(s, o);
+    let a, u;
+    if (r.merge) a = new ft(o.fieldMask), u = o.fieldTransforms; else if (r.mergeFields) {
         const t = [];
         for (const s of r.mergeFields) {
             const i = Iu(e, s, n);
             if (!o.contains(i)) throw new K(q.INVALID_ARGUMENT, `Field '${i}' is specified in your field mask but missing from your input data.`);
             Pu(t, i) || t.push(i);
         }
-        c = new ft(t), u = o.fieldTransforms.filter((t => c.covers(t.field)));
-    } else c = null, u = o.fieldTransforms;
-    return new nu(new Ut(a), c, u);
+        a = new ft(t), u = o.fieldTransforms.filter((t => a.covers(t.field)));
+    } else a = null, u = o.fieldTransforms;
+    return new nu(new Ut(c), a, u);
 }
 
-class uu extends Zc {
+class uu extends Za {
     _toFieldTransform(t) {
-        if (2 /* MergeSet */ !== t.Da) throw 1 /* Update */ === t.Da ? t.Fa(`${this._methodName}() can only appear at the top level of your update data`) : t.Fa(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
+        if (2 /* MergeSet */ !== t.Cc) throw 1 /* Update */ === t.Cc ? t.Mc(`${this._methodName}() can only appear at the top level of your update data`) : t.Mc(`${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;
@@ -16089,14 +16089,14 @@ class uu extends Zc {
  * @param arrayElement - Whether or not the FieldValue has an array.
  */ function hu(t, e, n) {
     return new ru({
-        Da: 3 /* Argument */ ,
-        La: e.settings.La,
+        Cc: 3 /* Argument */ ,
+        Bc: e.settings.Bc,
         methodName: t._methodName,
-        xa: n
+        kc: n
     }, e.databaseId, e.N, e.ignoreUndefinedProperties);
 }
 
-class lu extends Zc {
+class lu extends Za {
     _toFieldTransform(t) {
         return new je(t.path, new Oe);
     }
@@ -16105,13 +16105,13 @@ class lu extends Zc {
     }
 }
 
-class fu extends Zc {
+class fu extends Za {
     constructor(t, e) {
-        super(t), this.Ua = e;
+        super(t), this.qc = e;
     }
     _toFieldTransform(t) {
         const e = hu(this, t, 
-        /*array=*/ !0), n = this.Ua.map((t => yu(t, e))), s = new Fe(n);
+        /*array=*/ !0), n = this.qc.map((t => yu(t, e))), s = new Fe(n);
         return new je(t.path, s);
     }
     isEqual(t) {
@@ -16120,13 +16120,13 @@ class fu extends Zc {
     }
 }
 
-class du extends Zc {
+class du extends Za {
     constructor(t, e) {
-        super(t), this.Ua = e;
+        super(t), this.qc = e;
     }
     _toFieldTransform(t) {
         const e = hu(this, t, 
-        /*array=*/ !0), n = this.Ua.map((t => yu(t, e))), s = new Le(n);
+        /*array=*/ !0), n = this.qc.map((t => yu(t, e))), s = new Le(n);
         return new je(t.path, s);
     }
     isEqual(t) {
@@ -16135,12 +16135,12 @@ class du extends Zc {
     }
 }
 
-class wu extends Zc {
+class wu extends Za {
     constructor(t, e) {
-        super(t), this.qa = e;
+        super(t), this.Kc = e;
     }
     _toFieldTransform(t) {
-        const e = new Ue(t.N, Ce(t.N, this.qa));
+        const e = new Ue(t.N, Ce(t.N, this.Kc));
         return new je(t.path, e);
     }
     isEqual(t) {
@@ -16150,40 +16150,40 @@ class wu extends Zc {
 }
 
 /** Parse update data from an update() call. */ function _u(t, e, n, s) {
-    const i = t.Ba(1 /* Update */ , e, n);
+    const i = t.Uc(1 /* Update */ , e, n);
     Tu("Data must be an object, but it was:", i, s);
     const r = [], o = Ut.empty();
     ot(s, ((t, s) => {
-        const a = Ru(e, t, n);
+        const c = Ru(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 s = y(s);
-        const c = i.$a(a);
+        const a = i.Oc(c);
         if (s instanceof uu) 
         // Add it to the field mask, but don't add anything to updateData.
-        r.push(a); else {
-            const t = yu(s, c);
-            null != t && (r.push(a), o.set(a, t));
+        r.push(c); else {
+            const t = yu(s, a);
+            null != t && (r.push(c), o.set(c, t));
         }
     }));
-    const a = new ft(r);
-    return new su(o, a, i.fieldTransforms);
+    const c = new ft(r);
+    return new su(o, c, i.fieldTransforms);
 }
 
 /** Parse update data from a list of field/value arguments. */ function mu(t, e, n, s, i, r) {
-    const o = t.Ba(1 /* Update */ , e, n), a = [ Iu(e, s, n) ], c = [ i ];
+    const o = t.Uc(1 /* Update */ , e, n), c = [ Iu(e, s, n) ], a = [ i ];
     if (r.length % 2 != 0) throw new K(q.INVALID_ARGUMENT, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
-    for (let t = 0; t < r.length; t += 2) a.push(Iu(e, r[t])), c.push(r[t + 1]);
+    for (let t = 0; t < r.length; t += 2) c.push(Iu(e, r[t])), a.push(r[t + 1]);
     const u = [], h = Ut.empty();
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
-    for (let t = a.length - 1; t >= 0; --t) if (!Pu(u, a[t])) {
-        const e = a[t];
-        let n = c[t];
+    for (let t = c.length - 1; t >= 0; --t) if (!Pu(u, c[t])) {
+        const e = c[t];
+        let n = a[t];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 n = y(n);
-        const s = o.$a(e);
+        const s = o.Oc(e);
         if (n instanceof uu) 
         // Add it to the field mask, but don't add anything to updateData.
         u.push(e); else {
@@ -16202,7 +16202,7 @@ class wu extends Zc {
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
  */ function gu(t, e, n, s = !1) {
-    return yu(n, t.Ba(s ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+    return yu(n, t.Uc(s ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -16218,7 +16218,7 @@ class wu extends Zc {
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
     t = y(t))) return Tu("Unsupported field value:", e, t), pu(t, e);
-    if (t instanceof Zc) 
+    if (t instanceof Za) 
     // FieldValues usually parse into transforms (except FieldValue.delete())
     // in which case we do not want to include this field in our parsed data
     // (as doing so will overwrite the field directly prior to the transform
@@ -16230,8 +16230,8 @@ class wu extends Zc {
  */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!iu(e.Da)) throw e.Fa(`${t._methodName}() can only be used with update() and set()`);
-        if (!e.path) throw e.Fa(`${t._methodName}() is not currently supported inside arrays`);
+        if (!iu(e.Cc)) throw e.Mc(`${t._methodName}() can only be used with update() and set()`);
+        if (!e.path) throw e.Mc(`${t._methodName}() is not currently supported inside arrays`);
         const n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
     }
@@ -16255,12 +16255,12 @@ class wu extends Zc {
         // 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.xa && 4 /* ArrayArgument */ !== e.Da) throw e.Fa("Nested arrays are not supported");
+        if (e.settings.kc && 4 /* ArrayArgument */ !== e.Cc) throw e.Mc("Nested arrays are not supported");
         return function(t, e) {
             const n = [];
             let s = 0;
             for (const i of t) {
-                let t = yu(i, e.Oa(s));
+                let t = yu(i, e.Fc(s));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -16307,17 +16307,17 @@ class wu extends Zc {
                 longitude: t.longitude
             }
         };
-        if (t instanceof Xc) return {
+        if (t instanceof Xa) return {
             bytesValue: qn(e.N, t._byteString)
         };
-        if (t instanceof Ic) {
+        if (t instanceof Ia) {
             const n = e.databaseId, s = t.firestore._databaseId;
-            if (!s.isEqual(n)) throw e.Fa(`Document reference is for database ${s.projectId}/${s.database} but should be for database ${n.projectId}/${n.database}`);
+            if (!s.isEqual(n)) throw e.Mc(`Document reference is for database ${s.projectId}/${s.database} but should be for database ${n.projectId}/${n.database}`);
             return {
                 referenceValue: Qn(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.Fa(`Unsupported field value: ${mc(t)}`);
+        throw e.Mc(`Unsupported field value: ${ma(t)}`);
     }
     /**
  * Checks whether an object looks like a JSON object that should be converted
@@ -16330,11 +16330,11 @@ class wu extends Zc {
 
 function pu(t, e) {
     const n = {};
-    return at(t) ? 
+    return ct(t) ? 
     // 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) : ot(t, ((t, s) => {
-        const i = yu(s, e.Na(t));
+        const i = yu(s, e.xc(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -16344,15 +16344,15 @@ function pu(t, e) {
 }
 
 function Eu(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof st || t instanceof tu || t instanceof Xc || t instanceof Ic || t instanceof Zc);
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof st || t instanceof tu || t instanceof Xa || t instanceof Ia || t instanceof Za);
 }
 
 function Tu(t, e, n) {
     if (!Eu(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
-        const s = mc(n);
-        throw "an object" === s ? e.Fa(t + " a custom object") : e.Fa(t + " " + s);
+        const s = ma(n);
+        throw "an object" === s ? e.Mc(t + " a custom object") : e.Mc(t + " " + s);
     }
 }
 
@@ -16362,7 +16362,7 @@ function Tu(t, e, n) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    e = y(e)) instanceof Jc) return e._internalPath;
+    e = y(e)) instanceof Ja) return e._internalPath;
     if ("string" == typeof e) return Ru(t, e);
     throw bu("Field path arguments must be of type string or FieldPath.", t, 
     /* hasConverter= */ !1, 
@@ -16386,7 +16386,7 @@ function Tu(t, e, n) {
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return new Jc(...e.split("."))._internalPath;
+        return new Ja(...e.split("."))._internalPath;
     } catch (s) {
         throw bu(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
@@ -16396,11 +16396,11 @@ function Tu(t, e, n) {
 
 function bu(t, e, n, s, i) {
     const r = s && !s.isEmpty(), o = void 0 !== i;
-    let a = `Function ${e}() called with invalid data`;
-    n && (a += " (via `toFirestore()`)"), a += ". ";
-    let c = "";
-    return (r || o) && (c += " (found", r && (c += ` in field ${s}`), o && (c += ` in document ${i}`), 
-    c += ")"), new K(q.INVALID_ARGUMENT, a + t + c);
+    let c = `Function ${e}() called with invalid data`;
+    n && (c += " (via `toFirestore()`)"), c += ". ";
+    let a = "";
+    return (r || o) && (a += " (found", r && (a += ` in field ${s}`), o && (a += ` in document ${i}`), 
+    a += ")"), new K(q.INVALID_ARGUMENT, c + t + a);
 }
 
 /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Pu(t, e) {
@@ -16447,7 +16447,7 @@ function bu(t, e, n, s, i) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new Ic(this._firestore, this._converter, this._key);
+        return new Ia(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -16518,7 +16518,7 @@ function bu(t, e, n, s, i) {
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */ function Su(t, e) {
-    return "string" == typeof e ? Ru(t, e) : e instanceof Jc ? e._internalPath : e._delegate._internalPath;
+    return "string" == typeof e ? Ru(t, e) : e instanceof Ja ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -16755,7 +16755,7 @@ function ku(t) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */ function $u(t, e) {
-    return t instanceof Cu && e instanceof Cu ? 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 xu && e instanceof xu && (t._firestore === e._firestore && Sc(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
+    return t instanceof Cu && e instanceof Cu ? 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 xu && e instanceof xu && (t._firestore === e._firestore && Sa(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
 }
 
 /**
@@ -16801,27 +16801,27 @@ function ku(t) {
 
 class Lu extends Fu {
     constructor(t, e, n) {
-        super(), this.Ka = t, this.ja = e, this.Qa = n, this.type = "where";
+        super(), this.jc = t, this.Qc = e, this.Wc = n, this.type = "where";
     }
     _apply(t) {
-        const e = au(t.firestore), n = function(t, e, n, s, i, r, o) {
-            let a;
+        const e = cu(t.firestore), n = function(t, e, n, s, i, r, o) {
+            let c;
             if (i.isKeyField()) {
                 if ("array-contains" /* ARRAY_CONTAINS */ === r || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === r) throw new K(q.INVALID_ARGUMENT, `Invalid Query. You can't perform '${r}' queries on FieldPath.documentId().`);
                 if ("in" /* IN */ === r || "not-in" /* NOT_IN */ === r) {
                     th(o, r);
                     const e = [];
                     for (const n of o) e.push(Zu(s, t, n));
-                    a = {
+                    c = {
                         arrayValue: {
                             values: e
                         }
                     };
-                } else a = Zu(s, t, o);
+                } else c = Zu(s, t, o);
             } else "in" /* IN */ !== r && "not-in" /* NOT_IN */ !== r && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== r || th(o, r), 
-            a = gu(n, e, o, 
+            c = gu(n, e, o, 
             /* allowArrays= */ "in" /* IN */ === r || "not-in" /* NOT_IN */ === r);
-            const c = Jt.create(i, r, a);
+            const a = Jt.create(i, r, c);
             return function(t, e) {
                 if (e.v()) {
                     const n = ye(t);
@@ -16869,9 +16869,9 @@ class Lu extends Fu {
                 if (null !== n) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
                 throw n === e.op ? new K(q.INVALID_ARGUMENT, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new K(q.INVALID_ARGUMENT, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
-            }(t, c), c;
-        }(t._query, "where", e, t.firestore._databaseId, this.Ka, this.ja, this.Qa);
-        return new Ac(t.firestore, t.converter, function(t, e) {
+            }(t, a), a;
+        }(t._query, "where", e, t.firestore._databaseId, this.jc, this.Qc, this.Wc);
+        return new Aa(t.firestore, t.converter, function(t, e) {
             const n = t.filters.concat([ e ]);
             return new fe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
@@ -16895,13 +16895,13 @@ class Lu extends Fu {
 
 class Uu extends Fu {
     constructor(t, e) {
-        super(), this.Ka = t, this.Wa = e, this.type = "orderBy";
+        super(), this.jc = t, this.Gc = e, this.type = "orderBy";
     }
     _apply(t) {
         const e = function(t, e, n) {
             if (null !== t.startAt) throw new K(q.INVALID_ARGUMENT, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
             if (null !== t.endAt) throw new K(q.INVALID_ARGUMENT, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            const s = new ce(e, n);
+            const s = new ae(e, n);
             return function(t, e) {
                 if (null === ge(t)) {
                     // This is the first order by. It must match any inequality.
@@ -16920,8 +16920,8 @@ class Uu extends Fu {
  * 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.Ka, this.Wa);
-        return new Ac(t.firestore, t.converter, function(t, e) {
+ */ (t._query, this.jc, this.Gc);
+        return new Aa(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 fe(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
@@ -16944,10 +16944,10 @@ class Uu extends Fu {
 
 class Ku extends Fu {
     constructor(t, e, n) {
-        super(), this.type = t, this.Ga = e, this.za = n;
+        super(), this.type = t, this.zc = e, this.Hc = n;
     }
     _apply(t) {
-        return new Ac(t.firestore, t.converter, Ie(t._query, this.Ga, this.za));
+        return new Aa(t.firestore, t.converter, Ie(t._query, this.zc, this.Hc));
     }
 }
 
@@ -16957,7 +16957,7 @@ class Ku extends Fu {
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
  */ function ju(t) {
-    return yc("limit", t), new Ku("limit", t, "F" /* First */);
+    return ya("limit", t), new Ku("limit", t, "F" /* First */);
 }
 
 /**
@@ -16969,16 +16969,16 @@ class Ku extends Fu {
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
  */ function Qu(t) {
-    return yc("limitToLast", t), new Ku("limitToLast", t, "L" /* Last */);
+    return ya("limitToLast", t), new Ku("limitToLast", t, "L" /* Last */);
 }
 
 class Wu extends Fu {
     constructor(t, e, n) {
-        super(), this.type = t, this.Ha = e, this.Ja = n;
+        super(), this.type = t, this.Jc = e, this.Yc = n;
     }
     _apply(t) {
-        const e = Xu(t, this.type, this.Ha, this.Ja);
-        return new Ac(t.firestore, t.converter, function(t, e) {
+        const e = Xu(t, this.type, this.Jc, this.Yc);
+        return new Aa(t.firestore, t.converter, function(t, e) {
             return new fe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
@@ -16995,11 +16995,11 @@ function zu(...t) {
 
 class Hu extends Fu {
     constructor(t, e, n) {
-        super(), this.type = t, this.Ha = e, this.Ja = n;
+        super(), this.type = t, this.Jc = e, this.Yc = n;
     }
     _apply(t) {
-        const e = Xu(t, this.type, this.Ha, this.Ja);
-        return new Ac(t.firestore, t.converter, function(t, e) {
+        const e = Xu(t, this.type, this.Jc, this.Yc);
+        return new Aa(t.firestore, t.converter, function(t, e) {
             return new fe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
@@ -17039,27 +17039,27 @@ function Yu(...t) {
  * Converts a list of field values to a `Bound` for the given query.
  */ (t._query, t.firestore._databaseId, e, n[0]._document, s);
     {
-        const i = au(t.firestore);
+        const i = cu(t.firestore);
         return function(t, e, n, s, i, r) {
             // 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 K(q.INVALID_ARGUMENT, `Too many arguments provided to ${s}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
-            const a = [];
+            const c = [];
             for (let r = 0; r < i.length; r++) {
-                const c = i[r];
+                const a = i[r];
                 if (o[r].field.isKeyField()) {
-                    if ("string" != typeof c) throw new K(q.INVALID_ARGUMENT, `Invalid query. Expected a string for document ID in ${s}(), but got a ${typeof c}`);
-                    if (!pe(t) && -1 !== c.indexOf("/")) throw new K(q.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(ut.fromString(c));
+                    if ("string" != typeof a) throw new K(q.INVALID_ARGUMENT, `Invalid query. Expected a string for document ID in ${s}(), but got a ${typeof a}`);
+                    if (!pe(t) && -1 !== a.indexOf("/")) throw new K(q.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(ut.fromString(a));
                     if (!Pt.isDocumentKey(n)) throw new K(q.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 Pt(n);
-                    a.push(kt(e, i));
+                    c.push(kt(e, i));
                 } else {
-                    const t = gu(n, s, c);
-                    a.push(t);
+                    const t = gu(n, s, a);
+                    c.push(t);
                 }
             }
-            return new oe(a, r);
+            return new oe(c, r);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -17077,8 +17077,8 @@ function Zu(t, e, n) {
         if (!Pt.isDocumentKey(s)) throw new K(q.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 kt(t, new Pt(s));
     }
-    if (n instanceof Ic) return kt(t, n._key);
-    throw new K(q.INVALID_ARGUMENT, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${mc(n)}.`);
+    if (n instanceof Ia) return kt(t, n._key);
+    throw new K(q.INVALID_ARGUMENT, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${ma(n)}.`);
 }
 
 /**
@@ -17186,7 +17186,7 @@ function eh(t, e, n) {
     convertDocumentKey(t, e) {
         const n = ut.fromString(t);
         L(Es(n));
-        const s = new hc(n.get(1), n.get(3)), i = new Pt(n.popFirst(5));
+        const s = new ha(n.get(1), n.get(3)), i = new Pt(n.popFirst(5));
         return s.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
         $(`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.`), 
@@ -17232,11 +17232,11 @@ class ih extends nh {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new Xc(t);
+        return new Xa(t);
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new Ic(this.firestore, /* converter= */ null, e);
+        return new Ia(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -17267,11 +17267,11 @@ class ih extends nh {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = au(t);
+        this._dataReader = cu(t);
     }
     set(t, e, n) {
         this._verifyNotCommitted();
-        const s = oh(t, this._firestore), i = sh(s.converter, e, n), r = cu(this._dataReader, "WriteBatch.set", s._key, i, null !== s.converter, n);
+        const s = oh(t, this._firestore), i = sh(s.converter, e, n), r = au(this._dataReader, "WriteBatch.set", s._key, i, null !== s.converter, n);
         return this._mutations.push(r.toMutation(s._key, Ge.none())), this;
     }
     update(t, e, n, ...s) {
@@ -17280,7 +17280,7 @@ class ih extends nh {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let r;
-        return r = "string" == typeof (e = y(e)) || e instanceof Jc ? mu(this._dataReader, "WriteBatch.update", i._key, e, n, s) : _u(this._dataReader, "WriteBatch.update", i._key, e), 
+        return r = "string" == typeof (e = y(e)) || e instanceof Ja ? mu(this._dataReader, "WriteBatch.update", i._key, e, n, s) : _u(this._dataReader, "WriteBatch.update", i._key, e), 
         this._mutations.push(r.toMutation(i._key, Ge.exists(!0))), this;
     }
     /**
@@ -17291,7 +17291,7 @@ class ih extends nh {
      */    delete(t) {
         this._verifyNotCommitted();
         const e = oh(t, this._firestore);
-        return this._mutations = this._mutations.concat(new an(e._key, Ge.none())), this;
+        return this._mutations = this._mutations.concat(new cn(e._key, Ge.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -17370,22 +17370,22 @@ function oh(t, e) {
  * @returns A Promise resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */
-function ah(t) {
-    t = gc(t, Ic);
-    const e = gc(t.firestore, kc);
-    return nc(Fc(e), t._key).then((n => Th(e, t, n)));
+function ch(t) {
+    t = ga(t, Ia);
+    const e = ga(t.firestore, ka);
+    return na(Fa(e), t._key).then((n => Th(e, t, n)));
 }
 
-class ch extends nh {
+class ah extends nh {
     constructor(t) {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new Xc(t);
+        return new Xa(t);
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new Ic(this.firestore, /* converter= */ null, e);
+        return new Ia(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -17396,9 +17396,9 @@ class ch extends nh {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function uh(t) {
-    t = gc(t, Ic);
-    const e = gc(t.firestore, kc), n = Fc(e), s = new ch(e);
-    return ec(n, t._key).then((n => new Cu(e, s, t._key, n, new Du(null !== n && n.hasLocalMutations, 
+    t = ga(t, Ia);
+    const e = ga(t.firestore, ka), n = Fa(e), s = new ah(e);
+    return ea(n, t._key).then((n => new Cu(e, s, t._key, n, new Du(null !== n && n.hasLocalMutations, 
     /* fromCache= */ !0), t.converter)));
 }
 
@@ -17409,9 +17409,9 @@ class ch extends nh {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function hh(t) {
-    t = gc(t, Ic);
-    const e = gc(t.firestore, kc);
-    return nc(Fc(e), t._key, {
+    t = ga(t, Ia);
+    const e = ga(t.firestore, ka);
+    return na(Fa(e), t._key, {
         source: "server"
     }).then((n => Th(e, t, n)));
 }
@@ -17426,9 +17426,9 @@ class ch extends nh {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function lh(t) {
-    t = gc(t, Ac);
-    const e = gc(t.firestore, kc), n = Fc(e), s = new ch(e);
-    return Ou(t._query), ic(n, t._query).then((n => new xu(e, s, t, n)));
+    t = ga(t, Aa);
+    const e = ga(t.firestore, ka), n = Fa(e), s = new ah(e);
+    return Ou(t._query), ia(n, t._query).then((n => new xu(e, s, t, n)));
 }
 
 /**
@@ -17437,9 +17437,9 @@ class ch extends nh {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function fh(t) {
-    t = gc(t, Ac);
-    const e = gc(t.firestore, kc), n = Fc(e), s = new ch(e);
-    return sc(n, t._query).then((n => new xu(e, s, t, n)));
+    t = ga(t, Aa);
+    const e = ga(t.firestore, ka), n = Fa(e), s = new ah(e);
+    return sa(n, t._query).then((n => new xu(e, s, t, n)));
 }
 
 /**
@@ -17448,27 +17448,27 @@ class ch extends nh {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function dh(t) {
-    t = gc(t, Ac);
-    const e = gc(t.firestore, kc), n = Fc(e), s = new ch(e);
-    return ic(n, t._query, {
+    t = ga(t, Aa);
+    const e = ga(t.firestore, ka), n = Fa(e), s = new ah(e);
+    return ia(n, t._query, {
         source: "server"
     }).then((n => new xu(e, s, t, n)));
 }
 
 function wh(t, e, n) {
-    t = gc(t, Ic);
-    const s = gc(t.firestore, kc), i = sh(t.converter, e, n);
-    return Eh(s, [ cu(au(s), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Ge.none()) ]);
+    t = ga(t, Ia);
+    const s = ga(t.firestore, ka), i = sh(t.converter, e, n);
+    return Eh(s, [ au(cu(s), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Ge.none()) ]);
 }
 
 function _h(t, e, n, ...s) {
-    t = gc(t, Ic);
-    const i = gc(t.firestore, kc), r = au(i);
+    t = ga(t, Ia);
+    const i = ga(t.firestore, ka), r = cu(i);
     let o;
     o = "string" == typeof (
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-    e = y(e)) || e instanceof Jc ? mu(r, "updateDoc", t._key, e, n, s) : _u(r, "updateDoc", t._key, e);
+    e = y(e)) || e instanceof Ja ? mu(r, "updateDoc", t._key, e, n, s) : _u(r, "updateDoc", t._key, e);
     return Eh(i, [ o.toMutation(t._key, Ge.exists(!0)) ]);
 }
 
@@ -17479,7 +17479,7 @@ function _h(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 mh(t) {
-    return Eh(gc(t.firestore, kc), [ new an(t._key, Ge.none()) ]);
+    return Eh(ga(t.firestore, ka), [ new cn(t._key, Ge.none()) ]);
 }
 
 /**
@@ -17492,8 +17492,8 @@ function _h(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 gh(t, e) {
-    const n = gc(t.firestore, kc), s = vc(t), i = sh(t.converter, e);
-    return Eh(n, [ cu(au(t.firestore), "addDoc", s._key, i, null !== t.converter, {}).toMutation(s._key, Ge.exists(!1)) ]).then((() => s));
+    const n = ga(t.firestore, ka), s = va(t), i = sh(t.converter, e);
+    return Eh(n, [ au(cu(t.firestore), "addDoc", s._key, i, null !== t.converter, {}).toMutation(s._key, Ge.exists(!1)) ]).then((() => s));
 }
 
 function yh(t, ...e) {
@@ -17502,27 +17502,27 @@ function yh(t, ...e) {
     let r = {
         includeMetadataChanges: !1
     }, o = 0;
-    "object" != typeof e[o] || Cc(e[o]) || (r = e[o], o++);
-    const a = {
+    "object" != typeof e[o] || Ca(e[o]) || (r = e[o], o++);
+    const c = {
         includeMetadataChanges: r.includeMetadataChanges
     };
-    if (Cc(e[o])) {
+    if (Ca(e[o])) {
         const t = e[o];
         e[o] = null === (n = t.next) || void 0 === n ? void 0 : n.bind(t), e[o + 1] = null === (s = t.error) || void 0 === s ? void 0 : s.bind(t), 
         e[o + 2] = null === (i = t.complete) || void 0 === i ? void 0 : i.bind(t);
     }
-    let c, u, h;
-    if (t instanceof Ic) u = gc(t.firestore, kc), h = we(t._key.path), c = {
+    let a, u, h;
+    if (t instanceof Ia) u = ga(t.firestore, ka), h = we(t._key.path), a = {
         next: n => {
             e[o] && e[o](Th(u, t, n));
         },
         error: e[o + 1],
         complete: e[o + 2]
     }; else {
-        const n = gc(t, Ac);
-        u = gc(n.firestore, kc), h = n._query;
-        const s = new ch(u);
-        c = {
+        const n = ga(t, Aa);
+        u = ga(n.firestore, ka), h = n._query;
+        const s = new ah(u);
+        a = {
             next: t => {
                 e[o] && e[o](new xu(u, s, n, t));
             },
@@ -17531,15 +17531,15 @@ function yh(t, ...e) {
         }, Ou(t._query);
     }
     return function(t, e, n, s) {
-        const i = new La(s), r = new Qo(e, i, n);
-        return t.asyncQueue.enqueueAndForget((async () => Bo(await Xa(t), r))), () => {
-            i.Xo(), t.asyncQueue.enqueueAndForget((async () => Uo(await Xa(t), r)));
+        const i = new Lc(s), r = new Qo(e, i, n);
+        return t.asyncQueue.enqueueAndForget((async () => Bo(await Xc(t), r))), () => {
+            i.Xo(), t.asyncQueue.enqueueAndForget((async () => Uo(await Xc(t), r)));
         };
-    }(Fc(u), h, a, c);
+    }(Fa(u), h, c, a);
 }
 
 function ph(t, e) {
-    return rc(Fc(t = gc(t, kc)), Cc(e) ? e : {
+    return ra(Fa(t = ga(t, ka)), Ca(e) ? e : {
         next: e
     });
 }
@@ -17550,15 +17550,15 @@ function ph(t, e) {
  */ function Eh(t, e) {
     return function(t, e) {
         const n = new j;
-        return t.asyncQueue.enqueueAndForget((async () => ra(await Ya(t), e, n))), n.promise;
-    }(Fc(t), e);
+        return t.asyncQueue.enqueueAndForget((async () => rc(await Yc(t), e, n))), n.promise;
+    }(Fa(t), e);
 }
 
 /**
  * Converts a {@link ViewSnapshot} that contains the single document specified by `ref`
  * to a {@link DocumentSnapshot}.
  */ function Th(t, e, n) {
-    const s = n.docs.get(e._key), i = new ch(t);
+    const s = n.docs.get(e._key), i = new ah(t);
     return new Cu(t, i, e._key, s, new Du(n.hasPendingWrites, n.fromCache), e.converter);
 }
 
@@ -17587,7 +17587,7 @@ function ph(t, e) {
  */ class Ih extends class {
     /** @hideconstructor */
     constructor(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = au(t);
+        this._firestore = t, this._transaction = e, this._dataReader = cu(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -17605,7 +17605,7 @@ function ph(t, e) {
         }));
     }
     set(t, e, n) {
-        const s = oh(t, this._firestore), i = sh(s.converter, e, n), r = cu(this._dataReader, "Transaction.set", s._key, i, null !== s.converter, n);
+        const s = oh(t, this._firestore), i = sh(s.converter, e, n), r = au(this._dataReader, "Transaction.set", s._key, i, null !== s.converter, n);
         return this._transaction.set(s._key, r), this;
     }
     update(t, e, n, ...s) {
@@ -17613,7 +17613,7 @@ function ph(t, e) {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let r;
-        return r = "string" == typeof (e = y(e)) || e instanceof Jc ? mu(this._dataReader, "Transaction.update", i._key, e, n, s) : _u(this._dataReader, "Transaction.update", i._key, e), 
+        return r = "string" == typeof (e = y(e)) || e instanceof Ja ? mu(this._dataReader, "Transaction.update", i._key, e, n, s) : _u(this._dataReader, "Transaction.update", i._key, e), 
         this._transaction.update(i._key, r), this;
     }
     /**
@@ -17638,7 +17638,7 @@ function ph(t, e) {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const e = oh(t, this._firestore), n = new ch(this._firestore);
+        const e = oh(t, this._firestore), n = new ah(this._firestore);
         return super.get(t).then((t => new Cu(this._firestore, n, e._key, t._document, new Du(
         /* hasPendingWrites= */ !1, 
         /* fromCache= */ !1), e.converter)));
@@ -17662,7 +17662,7 @@ function ph(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */ function Ah(t, e) {
-    return oc(Fc(t), (n => e(new Ih(t, n))));
+    return oa(Fa(t), (n => e(new Ih(t, n))));
 }
 
 /**
@@ -17777,7 +17777,7 @@ function ph(t, e) {
  * @returns A {@link WriteBatch} that can be used to atomically execute multiple
  * writes.
  */ function Sh(t) {
-    return Fc(t = gc(t, kc)), new rh(t, (e => Eh(t, e)));
+    return Fa(t = ga(t, ka)), new rh(t, (e => Eh(t, e)));
 }
 
 /**
@@ -17800,11 +17800,11 @@ function ph(t, e) {
 Dh = "rn", function(t) {
     D = t;
 }(i), n(new r("firestore", ((t, {options: e}) => {
-    const n = t.getProvider("app").getImmediate(), s = new kc(n, new z(t.getProvider("auth-internal")));
+    const n = t.getProvider("app").getImmediate(), s = new ka(n, new z(t.getProvider("auth-internal")));
     return e = Object.assign({
         useFetchStreams: !0
     }, e), s._setSettings(e), s;
-}), "PUBLIC" /* PUBLIC */)), s("@firebase/firestore", "3.0.2-canary.456d664ae", Dh);
+}), "PUBLIC" /* PUBLIC */)), s("@firebase/firestore", "3.0.2-canary.46d26ff96", Dh);
 
-export { nh as AbstractUserDataWriter, Xc as Bytes, xc as CACHE_SIZE_UNLIMITED, Rc as CollectionReference, Ic as DocumentReference, Cu as DocumentSnapshot, Jc as FieldPath, Zc as FieldValue, kc as Firestore, K as FirestoreError, tu as GeoPoint, Nc as LoadBundleTask, Ac as Query, Fu as QueryConstraint, Nu as QueryDocumentSnapshot, xu as QuerySnapshot, Du as SnapshotMetadata, st as Timestamp, Ih as Transaction, rh as WriteBatch, hc as _DatabaseId, Pt as _DocumentKey, W as _EmptyCredentialsProvider, lt as _FieldPath, gc as _cast, B as _debugAssert, wt as _isBase64Available, O as _logWarn, dc as _validateIsNotUsedTogether, gh as addDoc, vh as arrayRemove, Ph as arrayUnion, qc as clearIndexedDbPersistence, bc as collection, Pc as collectionGroup, Tc as connectFirestoreEmulator, mh as deleteDoc, Rh as deleteField, Qc as disableNetwork, vc as doc, Yc as documentId, Lc as enableIndexedDbPersistence, Bc as enableMultiTabIndexedDbPersistence, jc as enableNetwork, Yu as endAt, Ju as endBefore, Fc as ensureFirestoreConfigured, Eh as executeWrite, ah as getDoc, uh as getDocFromCache, hh as getDocFromServer, lh as getDocs, fh as getDocsFromCache, dh as getDocsFromServer, Oc as getFirestore, Vh as increment, $c as initializeFirestore, ju as limit, Qu as limitToLast, Gc as loadBundle, zc as namedQuery, yh as onSnapshot, ph as onSnapshotsInSync, qu as orderBy, Mu as query, Sc as queryEqual, Vc as refEqual, Ah as runTransaction, bh as serverTimestamp, wh as setDoc, x as setLogLevel, $u as snapshotEqual, zu as startAfter, Gu as startAt, Wc as terminate, _h as updateDoc, Kc as waitForPendingWrites, Bu as where, Sh as writeBatch };
+export { nh as AbstractUserDataWriter, Xa as Bytes, xa as CACHE_SIZE_UNLIMITED, Ra as CollectionReference, Ia as DocumentReference, Cu as DocumentSnapshot, Ja as FieldPath, Za as FieldValue, ka as Firestore, K as FirestoreError, tu as GeoPoint, Na as LoadBundleTask, Aa as Query, Fu as QueryConstraint, Nu as QueryDocumentSnapshot, xu as QuerySnapshot, Du as SnapshotMetadata, st as Timestamp, Ih as Transaction, rh as WriteBatch, ha as _DatabaseId, Pt as _DocumentKey, W as _EmptyCredentialsProvider, lt as _FieldPath, ga as _cast, B as _debugAssert, wt as _isBase64Available, O as _logWarn, da as _validateIsNotUsedTogether, gh as addDoc, vh as arrayRemove, Ph as arrayUnion, qa as clearIndexedDbPersistence, ba as collection, Pa as collectionGroup, Ta as connectFirestoreEmulator, mh as deleteDoc, Rh as deleteField, Qa as disableNetwork, va as doc, Ya as documentId, La as enableIndexedDbPersistence, Ba as enableMultiTabIndexedDbPersistence, ja as enableNetwork, Yu as endAt, Ju as endBefore, Fa as ensureFirestoreConfigured, Eh as executeWrite, ch as getDoc, uh as getDocFromCache, hh as getDocFromServer, lh as getDocs, fh as getDocsFromCache, dh as getDocsFromServer, Oa as getFirestore, Vh as increment, $a as initializeFirestore, ju as limit, Qu as limitToLast, Ga as loadBundle, za as namedQuery, yh as onSnapshot, ph as onSnapshotsInSync, qu as orderBy, Mu as query, Sa as queryEqual, Va as refEqual, Ah as runTransaction, bh as serverTimestamp, wh as setDoc, x as setLogLevel, $u as snapshotEqual, zu as startAfter, Gu as startAt, Wa as terminate, _h as updateDoc, Ka as waitForPendingWrites, Bu as where, Sh as writeBatch };
 //# sourceMappingURL=index.rn.js.map