@firebase/firestore 3.4.9-canary.2cd1cc76f → 3.4.9-canary.2d6a4143d

package/dist/index.rn.js

@@ -4,7 +4,7 @@ import { Component as r } from "@firebase/component";
 
 import { Logger as o, LogLevel as u } from "@firebase/logger";
 
-import { FirebaseError as c, base64 as a, getUA as h, isIndexedDBAvailable as l, isSafari as f, isMobileCordova as d, isReactNative as _, isElectron as w, isIE as m, isUWP as g, isBrowserExtension as y, createMockUserToken as p, getModularInstance as I, deepEqual as T } from "@firebase/util";
+import { FirebaseError as a, base64 as c, getUA as h, isIndexedDBAvailable as l, isSafari as f, isMobileCordova as d, isReactNative as _, isElectron as w, isIE as m, isUWP as g, isBrowserExtension as y, createMockUserToken as p, getModularInstance as I, deepEqual as T } from "@firebase/util";
 
 import { XhrIo as E, EventType as A, ErrorCode as R, createWebChannelTransport as P, getStatEventTarget as b, FetchXmlHttpFactory as V, WebChannel as v, Event as S, Stat as D } from "@firebase/webchannel-wrapper";
 
@@ -70,7 +70,7 @@ x.MOCK_USER = new x("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let N = "9.8.2-canary.2cd1cc76f";
+let N = "9.8.2-canary.2d6a4143d";
 
 /**
  * @license
@@ -356,7 +356,7 @@ e) {
     DATA_LOSS: "data-loss"
 };
 
-/** An error returned by a Firestore operation. */ class j extends c {
+/** An error returned by a Firestore operation. */ class j extends a {
     /** @hideconstructor */
     constructor(
     /**
@@ -745,7 +745,7 @@ function ot(t, e) {
 /**
  * Returns the immediate lexicographically-following string. This is useful to
  * construct an inclusive range for indexeddb iterators.
- */ function ct(t) {
+ */ function at(t) {
     // Return the input string, with an additional NUL byte appended.
     return t + "\0";
 }
@@ -781,7 +781,7 @@ function ot(t, e) {
  * For examples and further specifications, refer to the
  * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
  */
-class at {
+class ct {
     /**
      * Creates a new timestamp.
      *
@@ -813,7 +813,7 @@ class at {
      *
      * @returns a new timestamp representing the current date.
      */    static now() {
-        return at.fromMillis(Date.now());
+        return ct.fromMillis(Date.now());
     }
     /**
      * Creates a new timestamp from the given date.
@@ -822,7 +822,7 @@ class at {
      * @returns A new `Timestamp` representing the same point in time as the given
      *     date.
      */    static fromDate(t) {
-        return at.fromMillis(t.getTime());
+        return ct.fromMillis(t.getTime());
     }
     /**
      * Creates a new timestamp from the given number of milliseconds.
@@ -833,7 +833,7 @@ class at {
      *     number of milliseconds.
      */    static fromMillis(t) {
         const e = Math.floor(t / 1e3), n = Math.floor(1e6 * (t - 1e3 * e));
-        return new at(e, n);
+        return new ct(e, n);
     }
     /**
      * Converts a `Timestamp` to a JavaScript `Date` object. This conversion
@@ -919,10 +919,10 @@ class at {
         return new ht(t);
     }
     static min() {
-        return new ht(new at(0, 0));
+        return new ht(new ct(0, 0));
     }
     static max() {
-        return new ht(new at(253402300799, 999999999));
+        return new ht(new ct(253402300799, 999999999));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -1723,7 +1723,7 @@ function Pt(t) {
     // We use `decodeStringToByteArray()` instead of `decodeString()` since
     // `decodeString()` returns Unicode strings, which doesn't match the values
     // returned by `atob()`'s Latin1 representation.
-    a.decodeStringToByteArray(t, false));
+    c.decodeStringToByteArray(t, false));
 }
 
 /** Converts a binary string to a Base64 encoded string. */
@@ -1797,7 +1797,7 @@ function bt() {
         return function(t) {
             const e = [];
             for (let n = 0; n < t.length; n++) e[n] = t.charCodeAt(n);
-            return a.encodeByteArray(e, !1);
+            return c.encodeByteArray(e, !1);
         }(this.binaryString);
     }
     toUint8Array() {
@@ -1939,7 +1939,7 @@ function Nt(t) {
  * Returns the local time at which this timestamp was first set.
  */ function kt(t) {
     const e = St(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new at(e.seconds, e.nanos);
+    return new ct(e.seconds, e.nanos);
 }
 
 /**
@@ -2466,12 +2466,12 @@ function ue(t, e) {
 /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ class ce {
+ */ class ae {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new ce({
+        return new ae({
             mapValue: {}
         });
     }
@@ -2552,18 +2552,18 @@ function ue(t, e) {
         for (const e of n) delete t[e];
     }
     clone() {
-        return new ce(ne(this.value));
+        return new ae(ne(this.value));
     }
 }
 
 /**
  * Returns a FieldMask built from all fields in a MapValue.
- */ function ae(t) {
+ */ function ce(t) {
     const e = [];
     return ft(t.fields, ((t, n) => {
         const s = new At([ t ]);
         if (ee(n)) {
-            const t = ae(n.mapValue).fields;
+            const t = ce(n.mapValue).fields;
             if (0 === t.length) 
             // Preserve the empty map by adding it to the FieldMask.
             e.push(s); else 
@@ -2611,7 +2611,7 @@ function ue(t, e) {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new he(t, 0 /* INVALID */ , ht.min(), ht.min(), ce.empty(), 0 /* SYNCED */);
+        return new he(t, 0 /* INVALID */ , ht.min(), ht.min(), ae.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist with the given data at the
@@ -2620,14 +2620,14 @@ function ue(t, e) {
         return new he(t, 1 /* FOUND_DOCUMENT */ , e, ht.min(), n, 0 /* SYNCED */);
     }
     /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, e) {
-        return new he(t, 2 /* NO_DOCUMENT */ , e, ht.min(), ce.empty(), 0 /* SYNCED */);
+        return new he(t, 2 /* NO_DOCUMENT */ , e, ht.min(), ae.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist at the given version but
      * whose data is not known (e.g. a document that was updated without a known
      * base document).
      */    static newUnknownDocument(t, e) {
-        return new he(t, 3 /* UNKNOWN_DOCUMENT */ , e, ht.min(), ce.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new he(t, 3 /* UNKNOWN_DOCUMENT */ , e, ht.min(), ae.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2640,7 +2640,7 @@ function ue(t, e) {
      * Changes the document type to indicate that it doesn't exist at the given
      * version.
      */    convertToNoDocument(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = ce.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = ae.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }
     /**
@@ -2648,7 +2648,7 @@ function ue(t, e) {
      * that its data is not known (e.g. a document that was updated without a known
      * base document).
      */    convertToUnknownDocument(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = ce.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = ae.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasCommittedMutations() {
@@ -2780,7 +2780,7 @@ class _e {
     // Unicode codepoints to generate MAX_DOCUMENT_KEY, it is much easier to use
     // `(readTime + 1, DocumentKey.empty())` since `> DocumentKey.empty()` matches
     // all valid document IDs.
-    const n = t.toTimestamp().seconds, s = t.toTimestamp().nanoseconds + 1, i = ht.fromTimestamp(1e9 === s ? new at(n + 1, 0) : new at(n, s));
+    const n = t.toTimestamp().seconds, s = t.toTimestamp().nanoseconds + 1, i = ht.fromTimestamp(1e9 === s ? new ct(n + 1, 0) : new ct(n, s));
     return new ye(i, Lt.empty(), e);
 }
 
@@ -3488,7 +3488,7 @@ function on(t, e, n) {
 
 /**
  * Returns an IntegerValue for `value`.
- */ function cn(t) {
+ */ function an(t) {
     return {
         integerValue: "" + t
     };
@@ -3498,8 +3498,8 @@ function on(t, e, n) {
  * Returns a value for a number that's appropriate to put into a proto.
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
- */ function an(t, e) {
-    return Bt(e) ? cn(e) : un(t, e);
+ */ function cn(t, e) {
+    return Bt(e) ? an(e) : un(t, e);
 }
 
 /**
@@ -3552,7 +3552,7 @@ function on(t, e, n) {
         // precision and resolves overflows by reducing precision, we do not
         // manually cap overflows at 2^63.
         const n = dn(t, e), s = In(n) + In(t.k);
-        return Yt(n) && Yt(t.k) ? cn(s) : un(t.O, s);
+        return Yt(n) && Yt(t.k) ? an(s) : un(t.O, s);
     }(t, e);
 }
 
@@ -3781,7 +3781,7 @@ class Rn {
     // mask is null when sets or deletes are applied to the current document.
         if (null === e) return t.isNoDocument() ? new $n(t.key, Pn.none()) : new Nn(t.key, t.data, Pn.none());
     {
-        const n = t.data, s = ce.empty();
+        const n = t.data, s = ae.empty();
         let i = new gt(At.comparator);
         for (let t of e.fields) if (!i.has(t)) {
             let e = n.field(t);
@@ -3914,7 +3914,7 @@ class Rn {
     let n = null;
     for (const s of t.fieldTransforms) {
         const t = e.data.field(s.field), i = dn(s.transform, t || null);
-        null != i && (null === n && (n = ce.empty()), n.set(s.field, i));
+        null != i && (null === n && (n = ae.empty()), n.set(s.field, i));
     }
     return n || null;
 }
@@ -4481,7 +4481,7 @@ class us {
     }
 }
 
-class cs {
+class as {
     constructor(
     /** What kind of change occurred to the watch target. */
     t, 
@@ -4499,7 +4499,7 @@ class cs {
     }
 }
 
-/** Tracks the internal state of a Watch target. */ class as {
+/** Tracks the internal state of a Watch target. */ class cs {
     constructor() {
         /**
          * The number of pending responses (adds or removes) that we are waiting on.
@@ -4617,8 +4617,8 @@ class hs {
     /**
      * Processes and adds the DocumentWatchChange to the current set of changes.
      */    ut(t) {
-        for (const e of t.M) t.F && t.F.isFoundDocument() ? this.ct(e, t.F) : this.at(e, t.key, t.F);
-        for (const e of t.removedTargetIds) this.at(e, t.key, t.F);
+        for (const e of t.M) t.F && t.F.isFoundDocument() ? this.at(e, t.F) : this.ct(e, t.key, t.F);
+        for (const e of t.removedTargetIds) this.ct(e, t.key, t.F);
     }
     /** Processes and adds the WatchTargetChange to the current set of changes. */    ht(t) {
         this.forEachTarget(t, (e => {
@@ -4688,7 +4688,7 @@ class hs {
                 // until it is resolved, essentially exposing inconsistency between
                 // queries.
                 const n = new Lt(t.path);
-                this.at(e, n, he.newNoDocument(n, ht.min()));
+                this.ct(e, n, he.newNoDocument(n, ht.min()));
             } else q(1 === n); else {
                 this.gt(e) !== n && (
                 // Existence filter mismatch: We reset the mapping and raise a new
@@ -4715,7 +4715,7 @@ class hs {
                     // instead resulting in an explicit delete message and we could
                     // remove this special logic.
                     const e = new Lt(i.target.path);
-                    null !== this.it.get(e) || this.It(s, e) || this.at(s, e, he.newNoDocument(e, t));
+                    null !== this.it.get(e) || this.It(s, e) || this.ct(s, e, he.newNoDocument(e, t));
                 }
                 n.j && (e.set(s, n.H()), n.J());
             }
@@ -4741,7 +4741,7 @@ class hs {
      * its document key to the given target's mapping.
      */
     // Visible for testing.
-    ct(t, e) {
+    at(t, e) {
         if (!this.ft(t)) return;
         const n = this.It(t, e.key) ? 2 /* Modified */ : 0 /* Added */;
         this.lt(t).Y(e.key, n), this.it = this.it.insert(e.key, e), this.rt = this.rt.insert(e.key, this.Tt(e.key).add(t));
@@ -4754,7 +4754,7 @@ class hs {
      * to update the remote document cache.
      */
     // Visible for testing.
-    at(t, e, n) {
+    ct(t, e, n) {
         if (!this.ft(t)) return;
         const s = this.lt(t);
         this.It(t, e) ? s.Y(e, 1 /* Removed */) : 
@@ -4781,7 +4781,7 @@ class hs {
     }
     lt(t) {
         let e = this.st.get(t);
-        return e || (e = new as, this.st.set(t, e)), e;
+        return e || (e = new cs, this.st.set(t, e)), e;
     }
     Tt(t) {
         let e = this.rt.get(t);
@@ -4807,9 +4807,9 @@ class hs {
      * 'current' to false, clears the resume token and removes its target mapping
      * from all documents).
      */    dt(t) {
-        this.st.set(t, new as);
+        this.st.set(t, new cs);
         this.nt.getRemoteKeysForTarget(t).forEach((e => {
-            this.at(t, e, /*updatedDocument=*/ null);
+            this.ct(t, e, /*updatedDocument=*/ null);
         }));
     }
     /**
@@ -4916,7 +4916,7 @@ function gs(t, e) {
 function ps(t) {
     return q(!!t), ht.fromTimestamp(function(t) {
         const e = St(t);
-        return new at(e.seconds, e.nanos);
+        return new ct(e.seconds, e.nanos);
     }(t));
 }
 
@@ -4971,7 +4971,7 @@ function Vs(t) {
 }
 
 function Ss(t, e, n) {
-    const s = As(t, e.name), i = ps(e.updateTime), r = new ce({
+    const s = As(t, e.name), i = ps(e.updateTime), r = new ae({
         mapValue: {
             fields: e.fields
         }
@@ -4982,7 +4982,7 @@ function Ss(t, e, n) {
 function Ds(t, e) {
     return "found" in e ? function(t, e) {
         q(!!e.found), e.found.name, e.found.updateTime;
-        const n = As(t, e.found.name), s = ps(e.found.updateTime), i = new ce({
+        const n = As(t, e.found.name), s = ps(e.found.updateTime), i = new ae({
             mapValue: {
                 fields: e.found.fields
             }
@@ -5018,17 +5018,17 @@ function Cs(t, e) {
  * our generated proto interfaces say Int32Value must be. But GRPC actually
  * expects a { value: <number> } struct.
  */ (o);
-        n = new cs(s, i, r, u || null);
+        n = new as(s, i, r, u || null);
     } else if ("documentChange" in e) {
         e.documentChange;
         const s = e.documentChange;
         s.document, s.document.name, s.document.updateTime;
-        const i = As(t, s.document.name), r = ps(s.document.updateTime), o = new ce({
+        const i = As(t, s.document.name), r = ps(s.document.updateTime), o = new ae({
             mapValue: {
                 fields: s.document.fields
             }
-        }), u = he.newFoundDocument(i, r, o), c = s.targetIds || [], a = s.removedTargetIds || [];
-        n = new os(c, a, u.key, u);
+        }), u = he.newFoundDocument(i, r, o), a = s.targetIds || [], c = s.removedTargetIds || [];
+        n = new os(a, c, u.key, u);
     } else if ("documentDelete" in e) {
         e.documentDelete;
         const s = e.documentDelete;
@@ -5118,7 +5118,7 @@ function Ns(t, e) {
     }(t, e))) : [];
     if (e.update) {
         e.update.name;
-        const i = As(t, e.update.name), r = new ce({
+        const i = As(t, e.update.name), r = new ae({
             mapValue: {
                 fields: e.update.fields
             }
@@ -5290,18 +5290,18 @@ function Fs(t) {
         let e;
         return e = "object" == typeof t ? t.value : t, Ft(e) ? null : e;
     }(n.limit));
-    let c = null;
-    n.startAt && (c = function(t) {
+    let a = null;
+    n.startAt && (a = function(t) {
         const e = !!t.before, n = t.values || [];
         return new $e(n, e);
     }(n.startAt));
-    let a = null;
-    return n.endAt && (a = function(t) {
+    let c = null;
+    return n.endAt && (c = function(t) {
         const e = !t.before, n = t.values || [];
         return new $e(n, e);
     }
     // visible for testing
-    (n.endAt)), Ge(e, i, o, r, u, "F" /* First */ , c, a);
+    (n.endAt)), Ge(e, i, o, r, u, "F" /* First */ , a, c);
 }
 
 function $s(t, e) {
@@ -5585,7 +5585,7 @@ function Zs(t, e) {
  * there is no useful information to store as the value. The raw (unencoded)
  * path cannot be stored because IndexedDb doesn't store prototype
  * information.
- */ const ei = {}, ni = [ "prefixPath", "collectionGroup", "readTime", "documentId" ], si = [ "prefixPath", "collectionGroup", "documentId" ], ii = [ "collectionGroup", "readTime", "prefixPath", "documentId" ], ri = [ "canonicalId", "targetId" ], oi = [ "targetId", "path" ], ui = [ "path", "targetId" ], ci = [ "collectionId", "parent" ], ai = [ "indexId", "uid" ], hi = [ "uid", "sequenceNumber" ], li = [ "indexId", "uid", "arrayValue", "directionalValue", "orderedDocumentKey", "documentKey" ], fi = [ "indexId", "uid", "orderedDocumentKey" ], di = [ "userId", "collectionPath", "documentId" ], _i = [ "userId", "collectionPath", "largestBatchId" ], wi = [ "userId", "collectionGroup", "largestBatchId" ], mi = [ ...[ ...[ ...[ ...[ "mutationQueues", "mutations", "documentMutations", "remoteDocuments", "targets", "owner", "targetGlobal", "targetDocuments" ], "clientMetadata" ], "remoteDocumentGlobal" ], "collectionParents" ], "bundles", "namedQueries" ], gi = [ ...mi, "documentOverlays" ], yi = [ "mutationQueues", "mutations", "documentMutations", "remoteDocumentsV14", "targets", "owner", "targetGlobal", "targetDocuments", "clientMetadata", "remoteDocumentGlobal", "collectionParents", "bundles", "namedQueries", "documentOverlays" ], pi = yi, Ii = [ ...pi, "indexConfiguration", "indexState", "indexEntries" ];
+ */ const ei = {}, ni = [ "prefixPath", "collectionGroup", "readTime", "documentId" ], si = [ "prefixPath", "collectionGroup", "documentId" ], ii = [ "collectionGroup", "readTime", "prefixPath", "documentId" ], ri = [ "canonicalId", "targetId" ], oi = [ "targetId", "path" ], ui = [ "path", "targetId" ], ai = [ "collectionId", "parent" ], ci = [ "indexId", "uid" ], hi = [ "uid", "sequenceNumber" ], li = [ "indexId", "uid", "arrayValue", "directionalValue", "orderedDocumentKey", "documentKey" ], fi = [ "indexId", "uid", "orderedDocumentKey" ], di = [ "userId", "collectionPath", "documentId" ], _i = [ "userId", "collectionPath", "largestBatchId" ], wi = [ "userId", "collectionGroup", "largestBatchId" ], mi = [ ...[ ...[ ...[ ...[ "mutationQueues", "mutations", "documentMutations", "remoteDocuments", "targets", "owner", "targetGlobal", "targetDocuments" ], "clientMetadata" ], "remoteDocumentGlobal" ], "collectionParents" ], "bundles", "namedQueries" ], gi = [ ...mi, "documentOverlays" ], yi = [ "mutationQueues", "mutations", "documentMutations", "remoteDocumentsV14", "targets", "owner", "targetGlobal", "targetDocuments", "clientMetadata", "remoteDocumentGlobal", "collectionParents", "bundles", "namedQueries", "documentOverlays" ], pi = yi, Ii = [ ...pi, "indexConfiguration", "indexState", "indexEntries" ];
 
 /**
  * @license
@@ -6469,7 +6469,7 @@ function ki(t, e) {
         }
     }
     return e.readTime && n.setReadTime(function(t) {
-        const e = new at(t[0], t[1]);
+        const e = new ct(t[0], t[1]);
         return ht.fromTimestamp(e);
     }(e.readTime)), n;
 }
@@ -6515,7 +6515,7 @@ function Ki(t) {
 }
 
 function Gi(t) {
-    const e = new at(t.seconds, t.nanoseconds);
+    const e = new ct(t.seconds, t.nanoseconds);
     return ht.fromTimestamp(e);
 }
 
@@ -6536,7 +6536,7 @@ function Qi(t, e) {
             ++t;
         }
     }
-    const s = e.mutations.map((e => Ns(t.Jt, e))), i = at.fromMillis(e.localWriteTimeMs);
+    const s = e.mutations.map((e => Ns(t.Jt, e))), i = ct.fromMillis(e.localWriteTimeMs);
     return new Oi(e.batchId, i, n, s);
 }
 
@@ -6827,10 +6827,10 @@ class nr {
             const n = t.timestampValue;
             this.ne(e, 20), "string" == typeof n ? e.ie(n) : (e.ie(`${n.seconds || ""}`), e.se(n.nanos || 0));
         } else if ("stringValue" in t) this.re(t.stringValue, e), this.oe(e); else if ("bytesValue" in t) this.ne(e, 30), 
-        e.ue(Ct(t.bytesValue)), this.oe(e); else if ("referenceValue" in t) this.ce(t.referenceValue, e); else if ("geoPointValue" in t) {
+        e.ue(Ct(t.bytesValue)), this.oe(e); else if ("referenceValue" in t) this.ae(t.referenceValue, e); else if ("geoPointValue" in t) {
             const n = t.geoPointValue;
             this.ne(e, 45), e.se(n.latitude || 0), e.se(n.longitude || 0);
-        } else "mapValue" in t ? se(t) ? this.ne(e, Number.MAX_SAFE_INTEGER) : (this.ae(t.mapValue, e), 
+        } else "mapValue" in t ? se(t) ? this.ne(e, Number.MAX_SAFE_INTEGER) : (this.ce(t.mapValue, e), 
         this.oe(e)) : "arrayValue" in t ? (this.he(t.arrayValue, e), this.oe(e)) : U();
     }
     re(t, e) {
@@ -6839,7 +6839,7 @@ class nr {
     le(t, e) {
         e.ie(t);
     }
-    ae(t, e) {
+    ce(t, e) {
         const n = t.fields || {};
         this.ne(e, 55);
         for (const t of Object.keys(n)) this.re(t, e), this.te(n[t], e);
@@ -6849,7 +6849,7 @@ class nr {
         this.ne(e, 50);
         for (const t of n) this.te(t, e);
     }
-    ce(t, e) {
+    ae(t, e) {
         this.ne(e, 37);
         Lt.fromName(t).path.forEach((t => {
             this.ne(e, 60), this.le(t, e);
@@ -7081,7 +7081,7 @@ class ur {
 /**
  * Implements `DirectionalIndexByteEncoder` using `OrderedCodeWriter` for the
  * actual encoding.
- */ class cr {
+ */ class ar {
     constructor() {
         this.De = new rr, this.Ce = new or(this.De), this.xe = new ur(this.De);
     }
@@ -7115,7 +7115,7 @@ class ur {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Represents an index entry saved by the SDK in persisted storage. */ class ar {
+/** Represents an index entry saved by the SDK in persisted storage. */ class cr {
     constructor(t, e, n, s) {
         this.indexId = t, this.documentKey = e, this.arrayValue = n, this.directionalValue = s;
     }
@@ -7125,7 +7125,7 @@ class ur {
      */    ke() {
         const t = this.directionalValue.length, e = 0 === t || 255 === this.directionalValue[t - 1] ? t + 1 : t, n = new Uint8Array(e);
         return n.set(this.directionalValue, 0), e !== t ? n.set([ 0 ], this.directionalValue.length) : ++n[n.length - 1], 
-        new ar(this.indexId, this.documentKey, this.arrayValue, n);
+        new cr(this.indexId, this.documentKey, this.arrayValue, n);
     }
 }
 
@@ -7398,7 +7398,7 @@ class mr {
         return Ai.resolve();
     }
     getCollectionParents(t, e) {
-        const n = [], s = IDBKeyRange.bound([ e, "" ], [ ct(e), "" ], 
+        const n = [], s = IDBKeyRange.bound([ e, "" ], [ at(e), "" ], 
         /*lowerOpen=*/ !1, 
         /*upperOpen=*/ !0);
         return gr(t).qt(s).next((t => {
@@ -7464,7 +7464,7 @@ class mr {
                     /**
  * Returns the list of values that are used in != or NOT_IN filters. Returns
  * `null` if there are no such filters.
- */ (r, i), c = function(t, e) {
+ */ (r, i), a = function(t, e) {
                         const n = new Map;
                         for (const s of de(e)) for (const e of be(t, s.fieldPath)) switch (e.op) {
                           case "==" /* EQUAL */ :
@@ -7488,7 +7488,7 @@ class mr {
  * Returns a lower bound of field values that can be used as a starting point to
  * scan the index defined by `fieldIndex`. Returns `MIN_VALUE` if no lower bound
  * exists.
- */ (r, i), a = function(t, e) {
+ */ (r, i), c = function(t, e) {
                         const n = [];
                         let s = !0;
                         // For each segment, retrieve a lower bound if there is a suitable filter or
@@ -7513,7 +7513,7 @@ class mr {
                             n.push(e.value), s && (s = e.inclusive);
                         }
                         return new $e(n, s);
-                    }(r, i), l = this.We(i, r, a), f = this.We(i, r, h), d = this.ze(i, r, c), _ = this.He(i.indexId, u, l, a.inclusive, f, h.inclusive, d);
+                    }(r, i), l = this.We(i, r, c), f = this.We(i, r, h), d = this.ze(i, r, a), _ = this.He(i.indexId, u, l, c.inclusive, f, h.inclusive, d);
                     return Ai.forEach(_, (i => n.Gt(i, e.limit).next((e => {
                         e.forEach((e => {
                             const n = Lt.fromSegments(e.documentKey);
@@ -7539,20 +7539,20 @@ class mr {
         // distributed normal form, but adapted for array values. We create a single
         // index range per value in an ARRAY_CONTAINS or ARRAY_CONTAINS_ANY filter
         // combined with the values from the query bounds.
-        const u = (null != e ? e.length : 1) * Math.max(n.length, i.length), c = u / (null != e ? e.length : 1), a = [];
+        const u = (null != e ? e.length : 1) * Math.max(n.length, i.length), a = u / (null != e ? e.length : 1), c = [];
         for (let h = 0; h < u; ++h) {
-            const u = e ? this.Je(e[h / c]) : wr, l = this.Ye(t, u, n[h % c], s), f = this.Xe(t, u, i[h % c], r), d = o.map((e => this.Ye(t, u, e, 
+            const u = e ? this.Je(e[h / a]) : wr, l = this.Ye(t, u, n[h % a], s), f = this.Xe(t, u, i[h % a], r), d = o.map((e => this.Ye(t, u, e, 
             /* inclusive= */ !0)));
-            a.push(...this.createRange(l, f, d));
+            c.push(...this.createRange(l, f, d));
         }
-        return a;
+        return c;
     }
     /** Generates the lower bound for `arrayValue` and `directionalValue`. */    Ye(t, e, n, s) {
-        const i = new ar(t, Lt.empty(), e, n);
+        const i = new cr(t, Lt.empty(), e, n);
         return s ? i : i.ke();
     }
     /** Generates the upper bound for `arrayValue` and `directionalValue`. */    Xe(t, e, n, s) {
-        const i = new ar(t, Lt.empty(), e, n);
+        const i = new cr(t, Lt.empty(), e, n);
         return s ? i.ke() : i;
     }
     je(t, e) {
@@ -7596,7 +7596,7 @@ class mr {
      * Returns `null` if the document does not have all fields specified in the
      * index.
      */    Ze(t, e) {
-        const n = new cr;
+        const n = new ar;
         for (const s of de(t)) {
             const t = e.data.field(s.fieldPath);
             if (null == t) return null;
@@ -7606,14 +7606,14 @@ class mr {
         return n.Se();
     }
     /** Encodes a single value to the ascending index format. */    Je(t) {
-        const e = new cr;
+        const e = new ar;
         return nr.fe.Zt(t, e.Ne(0 /* ASCENDING */)), e.Se();
     }
     /**
      * Returns an encoded form of the document key that sorts based on the key
      * ordering of the field index.
      */    tn(t, e) {
-        const n = new cr;
+        const n = new ar;
         return nr.fe.Zt(Jt(this.databaseId, e), n.Ne(function(t) {
             const e = de(t);
             return 0 === e.length ? 0 /* ASCENDING */ : e[e.length - 1].kind;
@@ -7625,7 +7625,7 @@ class mr {
      */    ze(t, e, n) {
         if (null === n) return [];
         let s = [];
-        s.push(new cr);
+        s.push(new ar);
         let i = 0;
         for (const r of de(t)) {
             const t = n[i++];
@@ -7656,7 +7656,7 @@ class mr {
      */    nn(t, e, n) {
         const s = [ ...t ], i = [];
         for (const t of n.arrayValue.values || []) for (const n of s) {
-            const s = new cr;
+            const s = new ar;
             s.seed(n.Se()), nr.fe.Zt(t, s.Ne(e.kind)), i.push(s);
         }
         return i;
@@ -7707,11 +7707,11 @@ class mr {
             return (i ? Ai.resolve(i) : this.getFieldIndexes(t, e.collectionGroup)).next((i => (n.set(e.collectionGroup, i), 
             Ai.forEach(i, (n => this.on(t, e, n).next((e => {
                 const i = this.un(s, n);
-                return e.isEqual(i) ? Ai.resolve() : this.cn(t, s, n, e, i);
+                return e.isEqual(i) ? Ai.resolve() : this.an(t, s, n, e, i);
             })))))));
         }));
     }
-    an(t, e, n, s) {
+    cn(t, e, n, s) {
         return yr(t).put({
             indexId: s.indexId,
             uid: this.uid,
@@ -7731,7 +7731,7 @@ class mr {
             index: "documentKeyIndex",
             range: IDBKeyRange.only([ n.indexId, this.uid, this.tn(n, e) ])
         }, ((t, s) => {
-            i = i.add(new ar(n.indexId, e, s.arrayValue, s.directionalValue));
+            i = i.add(new cr(n.indexId, e, s.arrayValue, s.directionalValue));
         })).next((() => i));
     }
     /** Creates the index entries for the given document. */    un(t, e) {
@@ -7741,26 +7741,26 @@ class mr {
         const i = fe(e);
         if (null != i) {
             const r = t.data.field(i.fieldPath);
-            if (Xt(r)) for (const i of r.arrayValue.values || []) n = n.add(new ar(e.indexId, t.key, this.Je(i), s));
-        } else n = n.add(new ar(e.indexId, t.key, wr, s));
+            if (Xt(r)) for (const i of r.arrayValue.values || []) n = n.add(new cr(e.indexId, t.key, this.Je(i), s));
+        } else n = n.add(new cr(e.indexId, t.key, wr, s));
         return n;
     }
     /**
      * Updates the index entries for the provided document by deleting entries
      * that are no longer referenced in `newEntries` and adding all newly added
      * entries.
-     */    cn(t, e, n, s, i) {
+     */    an(t, e, n, s, i) {
         F("IndexedDbIndexManager", "Updating index entries for document '%s'", e.key);
         const r = [];
         return function(t, e, n, s, i) {
             const r = t.getIterator(), o = e.getIterator();
-            let u = pt(r), c = pt(o);
+            let u = pt(r), a = pt(o);
             // Walk through the two sets at the same time, using the ordering defined by
             // `comparator`.
-            for (;u || c; ) {
+            for (;u || a; ) {
                 let t = !1, e = !1;
-                if (u && c) {
-                    const s = n(u, c);
+                if (u && a) {
+                    const s = n(u, a);
                     s < 0 ? 
                     // The element was removed if the next element in our ordered
                     // walkthrough is only in `before`.
@@ -7769,11 +7769,11 @@ class mr {
                     // is only in `after`.
                     t = !0);
                 } else null != u ? e = !0 : t = !0;
-                t ? (s(c), c = pt(o)) : e ? (i(u), u = pt(r)) : (u = pt(r), c = pt(o));
+                t ? (s(a), a = pt(o)) : e ? (i(u), u = pt(r)) : (u = pt(r), a = pt(o));
             }
         }(s, i, hr, (
         /* onAdd= */ s => {
-            r.push(this.an(t, e, n, s));
+            r.push(this.cn(t, e, n, s));
         }), (
         /* onRemove= */ s => {
             r.push(this.hn(t, e, n, s));
@@ -7910,18 +7910,18 @@ class Er {
 function Ar(t, e, n) {
     const s = t.store("mutations"), i = t.store("documentMutations"), r = [], o = IDBKeyRange.only(n.batchId);
     let u = 0;
-    const c = s.Wt({
+    const a = s.Wt({
         range: o
     }, ((t, e, n) => (u++, n.delete())));
-    r.push(c.next((() => {
+    r.push(a.next((() => {
         q(1 === u);
     })));
-    const a = [];
+    const c = [];
     for (const t of n.mutations) {
         const s = ti(e, t.key.path, n.batchId);
-        r.push(i.delete(s)), a.push(t.key);
+        r.push(i.delete(s)), c.push(t.key);
     }
-    return Ai.waitFor(r).next((() => a));
+    return Ai.waitFor(r).next((() => c));
 }
 
 /**
@@ -8014,7 +8014,7 @@ class Pr {
         // eslint-disable-next-line @typescript-eslint/no-explicit-any
         return r.add({}).next((o => {
             q("number" == typeof o);
-            const u = new Oi(o, e, n, s), c = function(t, e, n) {
+            const u = new Oi(o, e, n, s), a = function(t, e, n) {
                 const s = n.baseMutations.map((e => xs(t.Jt, e))), i = n.mutations.map((e => xs(t.Jt, e)));
                 return {
                     userId: e,
@@ -8023,17 +8023,17 @@ class Pr {
                     baseMutations: s,
                     mutations: i
                 };
-            }(this.O, this.userId, u), a = [];
+            }(this.O, this.userId, u), c = [];
             let h = new gt(((t, e) => ot(t.canonicalString(), e.canonicalString())));
             for (const t of s) {
                 const e = ti(this.userId, t.key.path, o);
-                h = h.add(t.key.path.popLast()), a.push(r.put(c)), a.push(i.put(e, ei));
+                h = h.add(t.key.path.popLast()), c.push(r.put(a)), c.push(i.put(e, ei));
             }
             return h.forEach((e => {
-                a.push(this.indexManager.addToCollectionParentIndex(t, e));
+                c.push(this.indexManager.addToCollectionParentIndex(t, e));
             })), t.addOnCommittedListener((() => {
                 this.ln[o] = u.keys();
-            })), Ai.waitFor(a).next((() => u));
+            })), Ai.waitFor(c).next((() => u));
         }));
     }
     lookupMutationBatch(t, e) {
@@ -8087,7 +8087,7 @@ class Pr {
         return vr(t).Wt({
             range: s
         }, ((n, s, r) => {
-            const [o, u, c] = n, a = Ys(u);
+            const [o, u, a] = n, c = Ys(u);
             // Only consider rows matching exactly the specific key of
             // interest. Note that because we order by path first, and we
             // order terminators before path separators, we'll encounter all
@@ -8095,9 +8095,9 @@ class Pr {
             // the rows for documentKey will occur before any rows for
             // documents nested in a subcollection beneath documentKey so we
             // can stop as soon as we hit any such row.
-                        if (o === this.userId && e.path.isEqual(a)) 
+                        if (o === this.userId && e.path.isEqual(c)) 
             // Look up the mutation batch in the store.
-            return Vr(t).get(c).next((t => {
+            return Vr(t).get(a).next((t => {
                 if (!t) throw U();
                 q(t.userId === this.userId), i.push(Qi(this.O, t));
             }));
@@ -8111,7 +8111,7 @@ class Pr {
             const i = Zs(this.userId, e.path), r = IDBKeyRange.lowerBound(i), o = vr(t).Wt({
                 range: r
             }, ((t, s, i) => {
-                const [r, o, u] = t, c = Ys(o);
+                const [r, o, u] = t, a = Ys(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
@@ -8119,7 +8119,7 @@ class Pr {
                 // the rows for documentKey will occur before any rows for
                 // documents nested in a subcollection beneath documentKey so we
                 // can stop as soon as we hit any such row.
-                                r === this.userId && e.path.isEqual(c) ? n = n.add(u) : i.done();
+                                r === this.userId && e.path.isEqual(a) ? n = n.add(u) : i.done();
             }));
             s.push(o);
         })), Ai.waitFor(s).next((() => this.dn(t, n)));
@@ -8133,14 +8133,14 @@ class Pr {
         return vr(t).Wt({
             range: r
         }, ((t, e, i) => {
-            const [r, u, c] = t, a = Ys(u);
-            r === this.userId && n.isPrefixOf(a) ? 
+            const [r, u, a] = t, c = Ys(u);
+            r === this.userId && n.isPrefixOf(c) ? 
             // Rows with document keys more than one segment longer than the
             // query path can't be matches. For example, a query on 'rooms'
             // can't match the document /rooms/abc/messages/xyx.
             // TODO(mcg): we'll need a different scanner when we implement
             // ancestor queries.
-            a.length === s && (o = o.add(c)) : i.done();
+            c.length === s && (o = o.add(a)) : i.done();
         })).next((() => this.dn(t, o)));
     }
     dn(t, e) {
@@ -8213,7 +8213,7 @@ class Pr {
         range: r,
         jt: !0
     }, ((t, n, s) => {
-        const [r, u, /*batchID*/ c] = t;
+        const [r, u, /*batchID*/ a] = t;
         r === e && u === i && (o = !0), s.done();
     })).next((() => o));
 }
@@ -8321,7 +8321,7 @@ class Dr {
         }));
     }
     getLastRemoteSnapshotVersion(t) {
-        return this.pn(t).next((t => ht.fromTimestamp(new at(t.lastRemoteSnapshotVersion.seconds, t.lastRemoteSnapshotVersion.nanoseconds))));
+        return this.pn(t).next((t => ht.fromTimestamp(new ct(t.lastRemoteSnapshotVersion.seconds, t.lastRemoteSnapshotVersion.nanoseconds))));
     }
     getHighestSequenceNumber(t) {
         return this.pn(t).next((t => t.highestListenSequenceNumber));
@@ -8440,7 +8440,7 @@ class Dr {
         })).next((() => i));
     }
     containsKey(t, e) {
-        const n = zs(e.path), s = IDBKeyRange.bound([ n ], [ ct(n) ], 
+        const n = zs(e.path), s = IDBKeyRange.bound([ n ], [ at(n) ], 
         /*lowerOpen=*/ !1, 
         /*upperOpen=*/ !0);
         let i = 0;
@@ -8622,16 +8622,16 @@ class Dr {
         return this.Dn.getCacheSize(t);
     }
     Nn(t, e) {
-        let n, s, i, r, o, c, a;
+        let n, s, i, r, o, a, c;
         const h = Date.now();
         return this.calculateTargetCount(t, this.params.percentileToCollect).next((e => (
         // Cap at the configured max
         e > this.params.maximumSequenceNumbersToCollect ? (F("LruGarbageCollector", `Capping sequence numbers to collect down to the maximum of ${this.params.maximumSequenceNumbersToCollect} from ${e}`), 
         s = this.params.maximumSequenceNumbersToCollect) : s = e, r = Date.now(), this.nthSequenceNumber(t, s)))).next((s => (n = s, 
-        o = Date.now(), this.removeTargets(t, n, e)))).next((e => (i = e, c = Date.now(), 
+        o = Date.now(), this.removeTargets(t, n, e)))).next((e => (i = e, a = Date.now(), 
         this.removeOrphanedDocuments(t, n)))).next((t => {
-            if (a = Date.now(), O() <= u.DEBUG) {
-                F("LruGarbageCollector", `LRU Garbage Collection\n\tCounted targets in ${r - h}ms\n\tDetermined least recently used ${s} in ` + (o - r) + "ms\n" + `\tRemoved ${i} targets in ` + (c - o) + "ms\n" + `\tRemoved ${t} documents in ` + (a - c) + "ms\n" + `Total Duration: ${a - h}ms`);
+            if (c = Date.now(), O() <= u.DEBUG) {
+                F("LruGarbageCollector", `LRU Garbage Collection\n\tCounted targets in ${r - h}ms\n\tDetermined least recently used ${s} in ` + (o - r) + "ms\n" + `\tRemoved ${i} targets in ` + (a - o) + "ms\n" + `\tRemoved ${t} documents in ` + (c - a) + "ms\n" + `Total Duration: ${c - h}ms`);
             }
             return Ai.resolve({
                 didRun: !0,
@@ -9082,8 +9082,8 @@ function Ur(t, e) {
             if (e.push(this.Kn.removeEntry(t, i, o.readTime)), r.isValidDocument()) {
                 const u = Ui(this.Kn.O, r);
                 s = s.add(i.path.popLast());
-                const c = Rr(u);
-                n += c - o.size, e.push(this.Kn.addEntry(t, i, u));
+                const a = Rr(u);
+                n += a - o.size, e.push(this.Kn.addEntry(t, i, u));
             } else if (n -= o.size, this.trackRemovals) {
                 // In order to track removals, we store a "sentinel delete" in the
                 // RemoteDocumentCache. This entry is represented by a NoDocument
@@ -9244,7 +9244,7 @@ class Yr {
      * state for it.
      */    zn(t, e) {
         let n = null;
-        return this.Wn.getOverlay(t, e).next((s => (n = s, this.Hn(t, e, n)))).next((t => (null !== n && Dn(n.mutation, t, Rt.empty(), at.now()), 
+        return this.Wn.getOverlay(t, e).next((s => (n = s, this.Hn(t, e, n)))).next((t => (null !== n && Dn(n.mutation, t, Rt.empty(), ct.now()), 
         t)));
     }
     /**
@@ -9318,7 +9318,7 @@ class Yr {
             // might be a patch mutation whose precondition does not match before the
             // change (hence overlay is undefined), but would now match.
                         s.has(e.key) && (void 0 === o || o.mutation instanceof kn) ? i = i.insert(e.key, e) : void 0 !== o && (r.set(e.key, o.mutation.getFieldMask()), 
-            Dn(o.mutation, e, o.mutation.getFieldMask(), at.now()));
+            Dn(o.mutation, e, o.mutation.getFieldMask(), ct.now()));
         })), this.es(t, i).next((t => (t.forEach(((t, e) => r.set(t, e))), e.forEach(((t, e) => {
             var n;
             return o.set(t, new Yr(e, null !== (n = r.get(t)) && void 0 !== n ? n : null));
@@ -9342,13 +9342,13 @@ class Yr {
             // Iterate in descending order of batch IDs, and skip documents that are
             // already saved.
                         for (;o.hasNext(); ) {
-                const s = o.getNext(), u = s.key, c = s.value, a = Yn();
-                c.forEach((t => {
+                const s = o.getNext(), u = s.key, a = s.value, c = Yn();
+                a.forEach((t => {
                     if (!i.has(t)) {
                         const s = vn(e.get(t), n.get(t));
-                        null !== s && a.set(t, s), i = i.add(t);
+                        null !== s && c.set(t, s), i = i.add(t);
                     }
-                })), r.push(this.Wn.saveOverlays(t, u, a));
+                })), r.push(this.Wn.saveOverlays(t, u, c));
             }
             return Ai.waitFor(r);
         })).next((() => n));
@@ -9410,7 +9410,7 @@ class Yr {
             let n = Hn();
             return s.forEach(((s, i) => {
                 const r = t.get(s);
-                void 0 !== r && Dn(r.mutation, i, Rt.empty(), at.now()), 
+                void 0 !== r && Dn(r.mutation, i, Rt.empty(), ct.now()), 
                 // Finally, insert the documents that still match the query
                 nn(e, i) && (n = n.insert(s, i));
             })), n;
@@ -10112,7 +10112,7 @@ class uo {
     }
     runTransaction(t, e, n) {
         F("MemoryPersistence", "Starting transaction:", t);
-        const s = new co(this.Fs.next());
+        const s = new ao(this.Fs.next());
         return this.referenceDelegate.qs(), n(s).next((t => this.referenceDelegate.Ks(s).next((() => t)))).toPromise().then((t => (s.raiseOnCommittedEvent(), 
         t)));
     }
@@ -10124,13 +10124,13 @@ class uo {
 /**
  * Memory persistence is not actually transactional, but future implementations
  * may have transaction-scoped state.
- */ class co extends Ei {
+ */ class ao extends Ei {
     constructor(t) {
         super(), this.currentSequenceNumber = t;
     }
 }
 
-class ao {
+class co {
     constructor(t) {
         this.persistence = t, 
         /** Tracks all documents that are active in Query views. */
@@ -10139,7 +10139,7 @@ class ao {
         this.js = null;
     }
     static Ws(t) {
-        return new ao(t);
+        return new co(t);
     }
     get zs() {
         if (this.js) return this.js;
@@ -10329,7 +10329,7 @@ class ao {
                 unique: !1
             });
             t.createObjectStore("indexState", {
-                keyPath: ai
+                keyPath: ci
             }).createIndex("sequenceNumberIndex", hi, {
                 unique: !1
             });
@@ -10384,7 +10384,7 @@ class ao {
     Zs(t, e) {
         // Create the index.
         t.createObjectStore("collectionParents", {
-            keyPath: ci
+            keyPath: ai
         });
         const n = e.store("collectionParents"), s = new _r, i = t => {
             if (s.add(t)) {
@@ -10450,7 +10450,7 @@ class ao {
         })).next((() => Ai.waitFor(s)));
     }
     ni(t, e) {
-        const n = e.store("mutations"), s = Gr(this.O), i = new uo(ao.Ws, this.O.Jt), r = [], o = new Map;
+        const n = e.store("mutations"), s = Gr(this.O), i = new uo(co.Ws, this.O.Jt), r = [], o = new Map;
         return n.qt().next((t => {
             t.forEach((t => {
                 var e;
@@ -10459,7 +10459,7 @@ class ao {
             }));
         })).next((() => {
             o.forEach(((t, n) => {
-                const o = new x(n), u = tr.Yt(this.O, o), c = i.getIndexManager(o), a = Pr.Yt(o, this.O, c, i.referenceDelegate), h = new Xr(s, a, u, c);
+                const o = new x(n), u = tr.Yt(this.O, o), a = i.getIndexManager(o), c = Pr.Yt(o, this.O, a, i.referenceDelegate), h = new Xr(s, c, u, a);
                 r.push(h.ns(new Ni(e, st.A), t));
             }));
         })).next((() => Ai.waitFor(r)));
@@ -10538,21 +10538,21 @@ class _o {
      * Whether to synchronize the in-memory state of multiple tabs and share
      * access to local persistence.
      */
-    t, e, n, s, i, r, o, u, c, 
+    t, e, n, s, i, r, o, u, a, 
     /**
      * If set to true, forcefully obtains database access. Existing tabs will
      * no longer be able to access IndexedDB.
      */
-    a, h = 14) {
+    c, h = 14) {
         if (this.allowTabSynchronization = t, this.persistenceKey = e, this.clientId = n, 
-        this.si = i, this.window = r, this.document = o, this.ii = c, this.ri = a, this.oi = h, 
+        this.si = i, this.window = r, this.document = o, this.ii = a, this.ri = c, this.oi = h, 
         this.Fs = null, this.$s = !1, this.isPrimary = !1, this.networkEnabled = !0, 
         /** Our window.unload handler, if registered. */
         this.ui = null, this.inForeground = !1, 
         /** Our 'visibilitychange' listener if registered. */
-        this.ci = null, 
-        /** The client metadata refresh task. */
         this.ai = null, 
+        /** The client metadata refresh task. */
+        this.ci = null, 
         /** The last time we garbage collected the client metadata object store. */
         this.hi = Number.NEGATIVE_INFINITY, 
         /** A listener to notify on primary state changes. */
@@ -10560,7 +10560,7 @@ class _o {
         this.referenceDelegate = new Lr(this, s), this.fi = e + "main", this.O = new Bi(u), 
         this.di = new Pi(this.fi, this.oi, new ho(this.O)), this.Bs = new Cr(this.referenceDelegate, this.O), 
         this.Qn = Gr(this.O), this.Us = new Yi, this.window && this.window.localStorage ? this._i = this.window.localStorage : (this._i = null, 
-        !1 === a && $("IndexedDbPersistence", "LocalStorage is unavailable. As a result, persistence may not work reliably. In particular enablePersistence() could fail immediately after refreshing the page."));
+        !1 === c && $("IndexedDbPersistence", "LocalStorage is unavailable. As a result, persistence may not work reliably. In particular enablePersistence() could fail immediately after refreshing the page."));
     }
     /**
      * Attempt to start IndexedDb persistence.
@@ -10677,7 +10677,7 @@ class _o {
      * Schedules a recurring timer to update the client metadata and to either
      * extend or acquire the primary lease if the client is eligible.
      */    yi() {
-        this.ai = this.si.enqueueAfterDelay("client_metadata_refresh" /* ClientMetadataRefresh */ , 4e3, (() => this.wi().then((() => this.bi())).then((() => this.yi()))));
+        this.ci = this.si.enqueueAfterDelay("client_metadata_refresh" /* ClientMetadataRefresh */ , 4e3, (() => this.wi().then((() => this.bi())).then((() => this.yi()))));
     }
     /** Checks whether `client` is the local client. */    Ri(t) {
         return !!t && t.ownerId === this.clientId;
@@ -10732,7 +10732,7 @@ class _o {
     async shutdown() {
         // The shutdown() operations are idempotent and can be called even when
         // start() aborted (e.g. because it couldn't acquire the persistence lease).
-        this.$s = !1, this.Ci(), this.ai && (this.ai.cancel(), this.ai = null), this.xi(), 
+        this.$s = !1, this.Ci(), this.ci && (this.ci.cancel(), this.ci = null), this.xi(), 
         this.Ni(), 
         // Use `SimpleDb.runTransaction` directly to avoid failing if another tab
         // has obtained the primary lease.
@@ -10832,13 +10832,13 @@ class _o {
         !1));
     }
     mi() {
-        null !== this.document && "function" == typeof this.document.addEventListener && (this.ci = () => {
+        null !== this.document && "function" == typeof this.document.addEventListener && (this.ai = () => {
             this.si.enqueueAndForget((() => (this.inForeground = "visible" === this.document.visibilityState, 
             this.wi())));
-        }, this.document.addEventListener("visibilitychange", this.ci), this.inForeground = "visible" === this.document.visibilityState);
+        }, this.document.addEventListener("visibilitychange", this.ai), this.inForeground = "visible" === this.document.visibilityState);
     }
     xi() {
-        this.ci && (this.document.removeEventListener("visibilitychange", this.ci), this.ci = null);
+        this.ai && (this.document.removeEventListener("visibilitychange", this.ai), this.ai = null);
     }
     /**
      * Attaches a window.unload handler that will synchronously write our
@@ -11288,15 +11288,15 @@ function Ro(t) {
                 i = n.Hi;
         const o = [];
         e.targetChanges.forEach(((r, u) => {
-            const c = i.get(u);
-            if (!c) return;
+            const a = i.get(u);
+            if (!a) return;
             // Only update the remote keys if the target is still active. This
             // ensures that we can persist the updated target data along with
             // the updated assignment.
                         o.push(n.Bs.removeMatchingKeys(t, r.removedDocuments, u).next((() => n.Bs.addMatchingKeys(t, r.addedDocuments, u))));
-            let a = c.withSequenceNumber(t.currentSequenceNumber);
-            e.targetMismatches.has(u) ? a = a.withResumeToken(Vt.EMPTY_BYTE_STRING, ht.min()).withLastLimboFreeSnapshotVersion(ht.min()) : r.resumeToken.approximateByteSize() > 0 && (a = a.withResumeToken(r.resumeToken, s)), 
-            i = i.insert(u, a), 
+            let c = a.withSequenceNumber(t.currentSequenceNumber);
+            e.targetMismatches.has(u) ? c = c.withResumeToken(Vt.EMPTY_BYTE_STRING, ht.min()).withLastLimboFreeSnapshotVersion(ht.min()) : r.resumeToken.approximateByteSize() > 0 && (c = c.withResumeToken(r.resumeToken, s)), 
+            i = i.insert(u, c), 
             // Update the target data if there are target changes (or if
             // sufficient time has passed since the last update).
             /**
@@ -11328,9 +11328,9 @@ function Ro(t) {
             }
             /**
  * Notifies local store of the changed views to locally pin documents.
- */ (c, a, r) && o.push(n.Bs.updateTargetData(t, a));
+ */ (a, c, r) && o.push(n.Bs.updateTargetData(t, c));
         }));
-        let u = Wn(), c = es();
+        let u = Wn(), a = es();
         // 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
@@ -11341,12 +11341,12 @@ function Ro(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(bo(t, r, e.documentUpdates).next((t => {
-            u = t.nr, c = t.sr;
+            u = t.nr, a = t.sr;
         }))), !s.isEqual(ht.min())) {
             const e = n.Bs.getLastRemoteSnapshotVersion(t).next((e => n.Bs.setTargetsMetadata(t, t.currentSequenceNumber, s)));
             o.push(e);
         }
-        return Ai.waitFor(o).next((() => r.apply(t))).next((() => n.tr.Yn(t, u, c))).next((() => u));
+        return Ai.waitFor(o).next((() => r.apply(t))).next((() => n.tr.Yn(t, u, a))).next((() => u));
     })).then((t => (n.Hi = i, t)));
 }
 
@@ -11532,11 +11532,11 @@ async function ko(t, e, n, s) {
         const n = e.rr(t.metadata.name);
         t.document && (r = r.add(n));
         const s = e.ur(t);
-        s.setReadTime(e.cr(t.metadata.readTime)), o = o.insert(n, s);
+        s.setReadTime(e.ar(t.metadata.readTime)), o = o.insert(n, s);
     }
     const u = i.Xi.newChangeBuffer({
         trackRemovals: !0
-    }), c = await vo(i, function(t) {
+    }), a = await vo(i, function(t) {
         // It is OK that the path used for the query is not valid, because this will
         // not be read and queried.
         return Ye(Qe(Tt.fromString(`__bundle__/docs/${t}`)));
@@ -11544,7 +11544,7 @@ async function ko(t, e, n, s) {
     // Allocates a target to hold all document keys from the bundle, such that
     // they will not get garbage collected right away.
         return i.persistence.runTransaction("Apply bundle documents", "readwrite", (t => bo(t, u, o).next((e => (u.apply(t), 
-    e))).next((e => i.Bs.removeMatchingKeysForTargetId(t, c.targetId).next((() => i.Bs.addMatchingKeys(t, r, c.targetId))).next((() => i.tr.Yn(t, e.nr, e.sr))).next((() => e.nr))))));
+    e))).next((e => i.Bs.removeMatchingKeysForTargetId(t, a.targetId).next((() => i.Bs.addMatchingKeys(t, r, a.targetId))).next((() => i.tr.Yn(t, e.nr, e.sr))).next((() => e.nr))))));
 }
 
 /**
@@ -11630,7 +11630,7 @@ class Bo {
     /**
      * Parses a MutationMetadata from its JSON representation in WebStorage.
      * Logs a warning and returns null if the format of the data is not valid.
-     */    static ar(t, e, n) {
+     */    static cr(t, e, n) {
         const s = JSON.parse(n);
         let i, r = "object" == typeof s && -1 !== [ "pending", "acknowledged", "rejected" ].indexOf(s.state) && (void 0 === s.error || "object" == typeof s.error);
         return r && s.error && (r = "string" == typeof s.error.message && "string" == typeof s.error.code, 
@@ -11661,7 +11661,7 @@ class Lo {
     /**
      * Parses a QueryTargetMetadata from its JSON representation in WebStorage.
      * Logs a warning and returns null if the format of the data is not valid.
-     */    static ar(t, e) {
+     */    static cr(t, e) {
         const n = JSON.parse(e);
         let s, i = "object" == typeof n && -1 !== [ "not-current", "current", "rejected" ].indexOf(n.state) && (void 0 === n.error || "object" == typeof n.error);
         return i && n.error && (i = "string" == typeof n.error.message && "string" == typeof n.error.code, 
@@ -11690,7 +11690,7 @@ class Lo {
     /**
      * Parses a RemoteClientState from the JSON representation in WebStorage.
      * Logs a warning and returns null if the format of the data is not valid.
-     */    static ar(t, e) {
+     */    static cr(t, e) {
         const n = JSON.parse(e);
         let s = "object" == typeof n && n.activeTargetIds instanceof Array, i = ss();
         for (let t = 0; s && t < n.activeTargetIds.length; ++t) s = Bt(n.activeTargetIds[t]), 
@@ -11711,7 +11711,7 @@ class Lo {
     /**
      * Parses a SharedOnlineState from its JSON representation in WebStorage.
      * Logs a warning and returns null if the format of the data is not valid.
-     */    static ar(t) {
+     */    static cr(t) {
         const e = JSON.parse(t);
         return "object" == typeof e && -1 !== [ "Unknown", "Online", "Offline" ].indexOf(e.onlineState) && "string" == typeof e.clientId ? new qo(e.clientId, e.onlineState) : ($("SharedClientState", `Failed to parse online state: ${t}`), 
         null);
@@ -11826,7 +11826,7 @@ class Ko {
             if (e === this._r) continue;
             const t = this.getItem(Mo(this.persistenceKey, e));
             if (t) {
-                const n = Uo.ar(e, t);
+                const n = Uo.cr(e, t);
                 n && (this.gr = this.gr.insert(n.clientId, n));
             }
         }
@@ -11873,7 +11873,7 @@ class Ko {
                 if (this.isActiveQueryTarget(t)) {
             const n = this.storage.getItem($o(this.persistenceKey, t));
             if (n) {
-                const s = Lo.ar(t, n);
+                const s = Lo.cr(t, n);
                 s && (e = s.state);
             }
         }
@@ -12016,27 +12016,27 @@ class Ko {
      * be parsed.
      */    Br(t, e) {
         const n = this.Fr(t);
-        return Uo.ar(n, e);
+        return Uo.cr(n, e);
     }
     /**
      * Parses a mutation batch state in WebStorage. Returns 'null' if the value
      * could not be parsed.
      */    Lr(t, e) {
         const n = this.Er.exec(t), s = Number(n[1]), i = void 0 !== n[2] ? n[2] : null;
-        return Bo.ar(new x(i), s, e);
+        return Bo.cr(new x(i), s, e);
     }
     /**
      * Parses a query target state from WebStorage. Returns 'null' if the value
      * could not be parsed.
      */    qr(t, e) {
         const n = this.Ar.exec(t), s = Number(n[1]);
-        return Lo.ar(s, e);
+        return Lo.cr(s, e);
     }
     /**
      * Parses an online state from WebStorage. Returns 'null' if the value
      * could not be parsed.
      */    Vr(t) {
-        return qo.ar(t);
+        return qo.cr(t);
     }
     Gr(t) {
         return JSON.parse(t);
@@ -12247,9 +12247,9 @@ class Ho {
         this.ro = t.ro, this.oo = t.oo;
     }
     uo(t) {
-        this.co = t;
+        this.ao = t;
     }
-    ao(t) {
+    co(t) {
         this.ho = t;
     }
     onMessage(t) {
@@ -12262,7 +12262,7 @@ class Ho {
         this.ro(t);
     }
     fo() {
-        this.co();
+        this.ao();
     }
     _o(t) {
         this.ho(t);
@@ -12422,22 +12422,22 @@ class {
         d() || _() || w() || m() || g() || y() || (o.httpHeadersOverwriteParam = "$httpHeaders");
         const u = s.join("");
         F("Connection", "Creating WebChannel: " + u, o);
-        const c = i.createWebChannel(u, o);
+        const a = i.createWebChannel(u, o);
         // WebChannel supports sending the first message with the handshake - saving
         // a network round trip. However, it will have to call send in the same
         // JS event loop as open. In order to enforce this, we delay actually
         // opening the WebChannel until send is called. Whether we have called
         // open is tracked with this variable.
-                let a = !1, h = !1;
+                let c = !1, h = !1;
         // A flag to determine whether the stream was closed (by us or through an
         // error/close event) to avoid delivering multiple close events or sending
         // on a closed stream
                 const l = new Ho({
             ro: t => {
-                h ? F("Connection", "Not sending because WebChannel is closed:", t) : (a || (F("Connection", "Opening WebChannel transport."), 
-                c.open(), a = !0), F("Connection", "WebChannel sending:", t), c.send(t));
+                h ? F("Connection", "Not sending because WebChannel is closed:", t) : (c || (F("Connection", "Opening WebChannel transport."), 
+                a.open(), c = !0), F("Connection", "WebChannel sending:", t), a.send(t));
             },
-            oo: () => c.close()
+            oo: () => a.close()
         }), f = (t, e, n) => {
             // TODO(dimond): closure typing seems broken because WebChannel does
             // not implement goog.events.Listenable
@@ -12455,13 +12455,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 f(c, v.EventType.OPEN, (() => {
+                return f(a, v.EventType.OPEN, (() => {
             h || F("Connection", "WebChannel transport opened.");
-        })), f(c, v.EventType.CLOSE, (() => {
+        })), f(a, v.EventType.CLOSE, (() => {
             h || (h = !0, F("Connection", "WebChannel transport closed"), l._o());
-        })), f(c, v.EventType.ERROR, (t => {
+        })), f(a, v.EventType.ERROR, (t => {
             h || (h = !0, B("Connection", "WebChannel transport errored:", t), l._o(new j(Q.UNAVAILABLE, "The operation could not be completed")));
-        })), f(c, v.EventType.MESSAGE, (t => {
+        })), f(a, v.EventType.MESSAGE, (t => {
             var e;
             if (!h) {
                 const n = t.data[0];
@@ -12491,7 +12491,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
-                    h = !0, l._o(new j(e, n)), c.close();
+                    h = !0, l._o(new j(e, n)), a.close();
                 } else F("Connection", "WebChannel received:", n), l.wo(n);
             }
         })), f(r, S.STAT_EVENT, (t => {
@@ -12823,7 +12823,7 @@ class eu {
         // inhibit backoff or otherwise manipulate the state in its non-started state.
         this.state = t, 
         // Notify the listener that the stream closed.
-        await this.listener.ao(e);
+        await this.listener.co(e);
     }
     /**
      * Can be overridden to perform additional cleanup before the stream is closed.
@@ -12855,7 +12855,7 @@ class eu {
         this.stream = this.eu(t, e), this.stream.uo((() => {
             n((() => (this.state = 2 /* Open */ , this.Lo = this.si.enqueueAfterDelay(this.Mo, 1e4, (() => (this.Ko() && (this.state = 3 /* Healthy */), 
             Promise.resolve()))), this.listener.uo())));
-        })), this.stream.ao((t => {
+        })), this.stream.co((t => {
             n((() => this.tu(t)));
         })), this.stream.onMessage((t => {
             n((() => this.onMessage(t)));
@@ -12992,10 +12992,10 @@ class eu {
             // the write itself might be causing an error we want to back off from.
             this.Uo.reset();
             const e = ks(t.writeResults, t.commitTime), n = ps(t.commitTime);
-            return this.listener.cu(n, e);
+            return this.listener.au(n, e);
         }
         // The first response is always the handshake response
-        return q(!t.writeResults || 0 === t.writeResults.length), this.ru = !0, this.listener.au();
+        return q(!t.writeResults || 0 === t.writeResults.length), this.ru = !0, this.listener.cu();
     }
     /**
      * Sends an initial streamToken to the server, performing the handshake
@@ -13220,7 +13220,7 @@ class ru {
                 wu(this) && (F("RemoteStore", "Restarting streams for network reachability change."), 
                 await async function(t) {
                     const e = G(t);
-                    e.Au.add(4 /* ConnectivityChange */), await cu(e), e.bu.set("Unknown" /* Unknown */), 
+                    e.Au.add(4 /* ConnectivityChange */), await au(e), e.bu.set("Unknown" /* Unknown */), 
                     e.Au.delete(4 /* ConnectivityChange */), await uu(e);
                 }(this));
             }));
@@ -13235,7 +13235,7 @@ async function uu(t) {
 /**
  * Temporarily disables the network. The network can be re-enabled using
  * enableNetwork().
- */ async function cu(t) {
+ */ async function au(t) {
     for (const e of t.Ru) await e(/* enabled= */ !1);
 }
 
@@ -13243,7 +13243,7 @@ async function uu(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 au(t, e) {
+function cu(t, e) {
     const n = G(t);
     n.Eu.has(e.targetId) || (
     // Mark this as something the client is currently listening for.
@@ -13320,7 +13320,7 @@ async function yu(t, e) {
 async function pu(t, e, n) {
     if (
     // Mark the client as online since we got a message from the server
-    t.bu.set("Online" /* Online */), e instanceof cs && 2 /* Removed */ === e.state && e.cause) 
+    t.bu.set("Online" /* Online */), e instanceof as && 2 /* Removed */ === e.state && e.cause) 
     // There was an error on a target, don't wait for a consistent snapshot
     // to raise events
     try {
@@ -13404,7 +13404,7 @@ async function pu(t, e, n) {
     if (!vi(e)) throw e;
     t.Au.add(1 /* IndexedDbFailed */), 
     // Disable network and raise offline snapshots
-    await cu(t), t.bu.set("Offline" /* Offline */), n || (
+    await au(t), t.bu.set("Offline" /* Offline */), n || (
     // Use a simple read operation to determine if IndexedDB recovered.
     // Ideally, we would expose a health check directly on SimpleDb, but
     // RemoteStore only has access to persistence through LocalStore.
@@ -13515,7 +13515,7 @@ async function Cu(t, e) {
     // Tear down and re-create our network streams. This will ensure we get a
     // fresh auth token for the new user and re-fill the write pipeline with
     // new mutations from the LocalStore (since mutations are per-user).
-        n.Au.add(3 /* CredentialChange */), await cu(n), s && 
+        n.Au.add(3 /* CredentialChange */), await au(n), s && 
     // Don't set the network status to Unknown if we are offline.
     n.bu.set("Unknown" /* Unknown */), await n.remoteSyncer.handleCredentialChange(e), 
     n.Au.delete(3 /* CredentialChange */), await uu(n);
@@ -13526,7 +13526,7 @@ async function Cu(t, e) {
  */ async function xu(t, e) {
     const n = G(t);
     e ? (n.Au.delete(2 /* IsSecondary */), await uu(n)) : e || (n.Au.add(2 /* IsSecondary */), 
-    await cu(n), n.bu.set("Unknown" /* Unknown */));
+    await au(n), n.bu.set("Unknown" /* Unknown */));
 }
 
 /**
@@ -13560,7 +13560,7 @@ async function Cu(t, e) {
  * limitations under the License.
  */ (t.datastore, t.asyncQueue, {
         uo: gu.bind(null, t),
-        ao: yu.bind(null, t),
+        co: yu.bind(null, t),
         nu: pu.bind(null, t)
     }), t.Ru.push((async e => {
         e ? (t.vu.Qo(), _u(t) ? du(t) : t.bu.set("Unknown" /* Unknown */)) : (await t.vu.stop(), 
@@ -13583,9 +13583,9 @@ async function Cu(t, e) {
         return s.fu(), new su(e, s.Fo, s.authCredentials, s.appCheckCredentials, s.O, n);
     }(t.datastore, t.asyncQueue, {
         uo: Vu.bind(null, t),
-        ao: Du.bind(null, t),
-        au: vu.bind(null, t),
-        cu: Su.bind(null, t)
+        co: Du.bind(null, t),
+        cu: vu.bind(null, t),
+        au: Su.bind(null, t)
     }), t.Ru.push((async e => {
         e ? (t.Su.Qo(), 
         // This will start the write stream if necessary.
@@ -14082,9 +14082,9 @@ function ju(t) {
     /**
      * Converts a BundleDocument to a MutableDocument.
      */    ur(t) {
-        return t.metadata.exists ? Ss(this.O, t.document, !1) : he.newNoDocument(this.rr(t.metadata.name), this.cr(t.metadata.readTime));
+        return t.metadata.exists ? Ss(this.O, t.document, !1) : he.newNoDocument(this.rr(t.metadata.name), this.ar(t.metadata.readTime));
     }
-    cr(t) {
+    ar(t) {
         return ps(t);
     }
 }
@@ -14194,7 +14194,7 @@ class Zu {
  * View is responsible for computing the final merged truth of what docs are in
  * a query. It gets notified of local and remote changes to docs, and applies
  * the query filters and limits to determine the most correct possible results.
- */ class tc {
+ */ class ta {
     constructor(t, 
     /** Documents included in the remote target */
     e) {
@@ -14214,7 +14214,7 @@ class Zu {
     /**
      * The set of remote documents that the server has told us belongs to the target associated with
      * this view.
-     */    get tc() {
+     */    get ta() {
         return this.Hu;
     }
     /**
@@ -14226,8 +14226,8 @@ class Zu {
      * @param previousChanges - If this is being called with a refill, then start
      *        with this set of docs and changes instead of the current view.
      * @returns a new set of docs, changes, and refill flag.
-     */    ec(t, e) {
-        const n = e ? e.nc : new $u, s = e ? e.Zu : this.Zu;
+     */    ea(t, e) {
+        const n = e ? e.na : new $u, s = e ? e.Zu : this.Zu;
         let i = e ? e.mutatedKeys : this.mutatedKeys, r = s, o = !1;
         // Track the last doc in a (full) limit. This is necessary, because some
         // update (a delete, or an update moving a doc past the old limit) might
@@ -14237,34 +14237,34 @@ class Zu {
         // deletes. So we keep this doc at the old limit to compare the updates to.
         // Note that this should never get used in a refill (when previousChanges is
         // set), because there will only be adds -- no deletes or updates.
-        const u = "F" /* First */ === this.query.limitType && s.size === this.query.limit ? s.last() : null, c = "L" /* Last */ === this.query.limitType && s.size === this.query.limit ? s.first() : null;
+        const u = "F" /* First */ === this.query.limitType && s.size === this.query.limit ? s.last() : null, a = "L" /* Last */ === this.query.limitType && s.size === this.query.limit ? s.first() : null;
         // Drop documents out to meet limit/limitToLast requirement.
         if (t.inorderTraversal(((t, e) => {
-            const a = s.get(t), h = nn(this.query, e) ? e : null, l = !!a && this.mutatedKeys.has(a.key), f = !!h && (h.hasLocalMutations || 
+            const c = s.get(t), h = nn(this.query, e) ? e : null, l = !!c && this.mutatedKeys.has(c.key), f = !!h && (h.hasLocalMutations || 
             // We only consider committed mutations for documents that were
             // mutated during the lifetime of the view.
             this.mutatedKeys.has(h.key) && h.hasCommittedMutations);
             let d = !1;
             // Calculate change
-                        if (a && h) {
-                a.data.isEqual(h.data) ? l !== f && (n.track({
+                        if (c && h) {
+                c.data.isEqual(h.data) ? l !== f && (n.track({
                     type: 3 /* Metadata */ ,
                     doc: h
-                }), d = !0) : this.sc(a, h) || (n.track({
+                }), d = !0) : this.sa(c, h) || (n.track({
                     type: 2 /* Modified */ ,
                     doc: h
-                }), d = !0, (u && this.Xu(h, u) > 0 || c && this.Xu(h, c) < 0) && (
+                }), d = !0, (u && this.Xu(h, u) > 0 || a && this.Xu(h, a) < 0) && (
                 // This doc moved from inside the limit to outside the limit.
                 // That means there may be some other doc in the local cache
                 // that should be included instead.
                 o = !0));
-            } else !a && h ? (n.track({
+            } else !c && h ? (n.track({
                 type: 0 /* Added */ ,
                 doc: h
-            }), d = !0) : a && !h && (n.track({
+            }), d = !0) : c && !h && (n.track({
                 type: 1 /* Removed */ ,
-                doc: a
-            }), d = !0, (u || c) && (
+                doc: c
+            }), d = !0, (u || a) && (
             // A doc was removed from a full limit query. We'll need to
             // requery from the local cache to see if we know about some other
             // doc that should be in the results.
@@ -14279,12 +14279,12 @@ class Zu {
         }
         return {
             Zu: r,
-            nc: n,
+            na: n,
             ji: o,
             mutatedKeys: i
         };
     }
-    sc(t, e) {
+    sa(t, e) {
         // We suppress the initial change event for documents that were modified as
         // part of a write acknowledgment (e.g. when the value of a server transform
         // is applied) as Watch will send us the same document again.
@@ -14309,7 +14309,7 @@ class Zu {
         const s = this.Zu;
         this.Zu = t.Zu, this.mutatedKeys = t.mutatedKeys;
         // Sort changes based on type and query comparator
-        const i = t.nc.Cu();
+        const i = t.na.Cu();
         i.sort(((t, e) => function(t, e) {
             const n = t => {
                 switch (t) {
@@ -14347,18 +14347,18 @@ class Zu {
  * 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.
- */ (t.type, e.type) || this.Xu(t.doc, e.doc))), this.ic(n);
-        const r = e ? this.rc() : [], o = 0 === this.Yu.size && this.current ? 1 /* Synced */ : 0 /* Local */ , u = o !== this.Ju;
+ */ (t.type, e.type) || this.Xu(t.doc, e.doc))), this.ia(n);
+        const r = e ? this.ra() : [], o = 0 === this.Yu.size && this.current ? 1 /* Synced */ : 0 /* Local */ , u = o !== this.Ju;
         if (this.Ju = o, 0 !== i.length || u) {
             return {
                 snapshot: new Bu(this.query, t.Zu, s, i, t.mutatedKeys, 0 /* Local */ === o, u, 
                 /* excludesMetadataChanges= */ !1),
-                oc: r
+                oa: r
             };
         }
         // no changes
         return {
-            oc: r
+            oa: r
         };
     }
     /**
@@ -14372,17 +14372,17 @@ class Zu {
         // true once the client is back online.
         this.current = !1, this.applyChanges({
             Zu: this.Zu,
-            nc: new $u,
+            na: new $u,
             mutatedKeys: this.mutatedKeys,
             ji: !1
         }, 
         /* updateLimboDocuments= */ !1)) : {
-            oc: []
+            oa: []
         };
     }
     /**
      * Returns whether the doc for the given key should be in limbo.
-     */    uc(t) {
+     */    ua(t) {
         // If the remote end says it's part of this query, it's not in limbo.
         return !this.Hu.has(t) && (
         // The local store doesn't think it's a result, so it shouldn't be in limbo.
@@ -14391,18 +14391,18 @@ class Zu {
     /**
      * Updates syncedDocuments, current, and limbo docs based on the given change.
      * Returns the list of changes to which docs are in limbo.
-     */    ic(t) {
+     */    ia(t) {
         t && (t.addedDocuments.forEach((t => this.Hu = this.Hu.add(t))), t.modifiedDocuments.forEach((t => {})), 
         t.removedDocuments.forEach((t => this.Hu = this.Hu.delete(t))), this.current = t.current);
     }
-    rc() {
+    ra() {
         // We can only determine limbo documents when we're in-sync with the server.
         if (!this.current) return [];
         // TODO(klimt): Do this incrementally so that it's not quadratic when
         // updating many documents.
                 const t = this.Yu;
         this.Yu = es(), this.Zu.forEach((t => {
-            this.uc(t.key) && (this.Yu = this.Yu.add(t.key));
+            this.ua(t.key) && (this.Yu = this.Yu.add(t.key));
         }));
         // Diff the new limbo docs with the old limbo docs.
         const e = [];
@@ -14432,9 +14432,9 @@ class Zu {
      * @returns The ViewChange that resulted from this synchronization.
      */
     // PORTING NOTE: Multi-tab only.
-    cc(t) {
+    aa(t) {
         this.Hu = t.ir, this.Yu = es();
-        const e = this.ec(t.documents);
+        const e = this.ea(t.documents);
         return this.applyChanges(e, /*updateLimboDocuments=*/ !0);
     }
     /**
@@ -14443,7 +14443,7 @@ class Zu {
      * `hasPendingWrites` status of the already established view.
      */
     // PORTING NOTE: Multi-tab only.
-    ac() {
+    ca() {
         return Bu.fromInitialDocuments(this.query, this.Zu, this.mutatedKeys, 0 /* Local */ === this.Ju);
     }
 }
@@ -14452,7 +14452,7 @@ class Zu {
  * QueryView contains all of the data that SyncEngine needs to keep track of for
  * a particular query.
  */
-class ec {
+class ea {
     constructor(
     /**
      * The query itself.
@@ -14474,7 +14474,7 @@ class ec {
     }
 }
 
-/** Tracks a limbo resolution. */ class nc {
+/** Tracks a limbo resolution. */ class na {
     constructor(t) {
         this.key = t, 
         /**
@@ -14483,7 +14483,7 @@ class ec {
          * decide whether it needs to manufacture a delete event for the target once
          * the target is CURRENT.
          */
-        this.hc = !1;
+        this.ha = !1;
     }
 }
 
@@ -14499,13 +14499,13 @@ class ec {
  * 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 sc {
+ */ class sa {
     constructor(t, e, n, 
     // PORTING NOTE: Manages state synchronization in multi-tab environments.
     s, i, r) {
         this.localStore = t, this.remoteStore = e, this.eventManager = n, this.sharedClientState = s, 
-        this.currentUser = i, this.maxConcurrentLimboResolutions = r, this.lc = {}, this.fc = new Qn((t => tn(t)), Ze), 
-        this.dc = new Map, 
+        this.currentUser = i, this.maxConcurrentLimboResolutions = r, this.la = {}, this.fa = new Qn((t => tn(t)), Ze), 
+        this.da = new Map, 
         /**
          * The keys of documents that are in limbo for which we haven't yet started a
          * limbo resolution query. The strings in this set are the result of calling
@@ -14515,28 +14515,28 @@ class ec {
          * of arbitrary elements and it also maintains insertion order, providing the
          * desired queue-like FIFO semantics.
          */
-        this._c = new Set, 
+        this._a = new Set, 
         /**
          * Keeps track of the target ID for each document that is in limbo with an
          * active target.
          */
-        this.wc = new _t(Lt.comparator), 
+        this.wa = new _t(Lt.comparator), 
         /**
          * Keeps track of the information about an active limbo resolution for each
          * active target ID that was started for the purpose of limbo resolution.
          */
-        this.mc = new Map, this.gc = new eo, 
+        this.ma = new Map, this.ga = new eo, 
         /** Stores user completion handlers, indexed by User and BatchId. */
-        this.yc = {}, 
+        this.ya = {}, 
         /** Stores user callbacks waiting for all pending writes to be acknowledged. */
-        this.Ic = new Map, this.Tc = Dr.yn(), this.onlineState = "Unknown" /* Unknown */ , 
+        this.pa = new Map, this.Ia = Dr.yn(), this.onlineState = "Unknown" /* Unknown */ , 
         // The primary state is set to `true` or `false` immediately after Firestore
         // startup. In the interim, a client should only be considered primary if
         // `isPrimary` is true.
-        this.Ec = void 0;
+        this.Ta = void 0;
     }
     get isPrimaryClient() {
-        return !0 === this.Ec;
+        return !0 === this.Ta;
     }
 }
 
@@ -14545,10 +14545,10 @@ class ec {
  * server. All the subsequent view snapshots or errors are sent to the
  * subscribed handlers. Returns the initial snapshot.
  */
-async function ic(t, e) {
-    const n = Nc(t);
+async function ia(t, e) {
+    const n = Na(t);
     let s, i;
-    const r = n.fc.get(e);
+    const r = n.fa.get(e);
     if (r) 
     // PORTING NOTE: With Multi-Tab Web, it is possible that a query view
     // already exists when EventManager calls us for the first time. This
@@ -14556,11 +14556,11 @@ async function ic(t, e) {
     // behalf of another tab and the user of the primary also starts listening
     // to the query. EventManager will not have an assigned target ID in this
     // case and calls `listen` to obtain this ID.
-    s = r.targetId, n.sharedClientState.addLocalQueryTarget(s), i = r.view.ac(); else {
+    s = r.targetId, n.sharedClientState.addLocalQueryTarget(s), i = r.view.ca(); else {
         const t = await vo(n.localStore, Ye(e));
-        n.isPrimaryClient && au(n.remoteStore, t);
+        n.isPrimaryClient && cu(n.remoteStore, t);
         const r = n.sharedClientState.addLocalQueryTarget(t.targetId);
-        s = t.targetId, i = await rc(n, e, s, "current" === r);
+        s = t.targetId, i = await ra(n, e, s, "current" === r);
     }
     return i;
 }
@@ -14568,33 +14568,33 @@ async function ic(t, e) {
 /**
  * Registers a view for a previously unknown query and computes its initial
  * snapshot.
- */ async function rc(t, e, n, s) {
+ */ async function ra(t, e, n, s) {
     // PORTING NOTE: On Web only, we inject the code that registers new Limbo
     // targets based on view changes. This allows us to only depend on Limbo
     // changes when user code includes queries.
-    t.Ac = (e, n, s) => async function(t, e, n, s) {
-        let i = e.view.ec(n);
+    t.Ea = (e, n, s) => async function(t, e, n, s) {
+        let i = e.view.ea(n);
         i.ji && (
         // The query has a limit and some docs were removed, so we need
         // to re-run the query against the local store to make sure we
         // didn't lose any good docs that had been past the limit.
         i = await Do(t.localStore, e.query, 
-        /* usePreviousResults= */ !1).then((({documents: t}) => e.view.ec(t, i))));
+        /* usePreviousResults= */ !1).then((({documents: t}) => e.view.ea(t, i))));
         const r = s && s.targetChanges.get(e.targetId), o = e.view.applyChanges(i, 
         /* updateLimboDocuments= */ t.isPrimaryClient, r);
-        return yc(t, e.targetId, o.oc), o.snapshot;
+        return ya(t, e.targetId, o.oa), o.snapshot;
     }(t, e, n, s);
     const i = await Do(t.localStore, e, 
-    /* usePreviousResults= */ !0), r = new tc(e, i.ir), o = r.ec(i.documents), u = rs.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), c = r.applyChanges(o, 
+    /* usePreviousResults= */ !0), r = new ta(e, i.ir), o = r.ea(i.documents), u = rs.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), a = r.applyChanges(o, 
     /* updateLimboDocuments= */ t.isPrimaryClient, u);
-    yc(t, n, c.oc);
-    const a = new ec(e, n, r);
-    return t.fc.set(e, a), t.dc.has(n) ? t.dc.get(n).push(e) : t.dc.set(n, [ e ]), c.snapshot;
+    ya(t, n, a.oa);
+    const c = new ea(e, n, r);
+    return t.fa.set(e, c), t.da.has(n) ? t.da.get(n).push(e) : t.da.set(n, [ e ]), a.snapshot;
 }
 
-/** Stops listening to the query. */ async function oc(t, e) {
-    const n = G(t), s = n.fc.get(e), i = n.dc.get(s.targetId);
-    if (i.length > 1) return n.dc.set(s.targetId, i.filter((t => !Ze(t, e)))), void n.fc.delete(e);
+/** Stops listening to the query. */ async function oa(t, e) {
+    const n = G(t), s = n.fa.get(e), i = n.da.get(s.targetId);
+    if (i.length > 1) return n.da.set(s.targetId, i.filter((t => !Ze(t, e)))), void n.fa.delete(e);
     // No other queries are mapped to the target, clean up the query and the target.
         if (n.isPrimaryClient) {
         // We need to remove the local query target first to allow us to verify
@@ -14603,9 +14603,9 @@ async function ic(t, e) {
         n.sharedClientState.isActiveQueryTarget(s.targetId) || await So(n.localStore, s.targetId, 
         /*keepPersistedTargetData=*/ !1).then((() => {
             n.sharedClientState.clearQueryState(s.targetId), hu(n.remoteStore, s.targetId), 
-            mc(n, s.targetId);
+            ma(n, s.targetId);
         })).catch(Or);
-    } else mc(n, s.targetId), await So(n.localStore, s.targetId, 
+    } else ma(n, s.targetId), await So(n.localStore, s.targetId, 
     /*keepPersistedTargetData=*/ !0);
 }
 
@@ -14618,11 +14618,11 @@ async function ic(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 uc(t, e, n) {
-    const s = kc(t);
+ */ async function ua(t, e, n) {
+    const s = ka(t);
     try {
         const t = await function(t, e) {
-            const n = G(t), s = at.now(), i = e.reduce(((t, e) => t.add(e.key)), es());
+            const n = G(t), s = ct.now(), i = e.reduce(((t, e) => t.add(e.key)), es());
             let r, o;
             return n.persistence.runTransaction("Locally write mutations", "readwrite", (t => {
                 // Figure out which keys do not have a remote version in the cache, this
@@ -14631,10 +14631,10 @@ async function ic(t, e) {
                 // TODO(Overlay): Is there a better way to determine this? Using the
                 //  document version does not work because local mutations set them back
                 //  to 0.
-                let u = Wn(), c = es();
+                let u = Wn(), a = es();
                 return n.Xi.getEntries(t, i).next((t => {
                     u = t, u.forEach(((t, e) => {
-                        e.isValidDocument() || (c = c.add(t));
+                        e.isValidDocument() || (a = a.add(t));
                     }));
                 })).next((() => n.tr.ts(t, u))).next((i => {
                     r = i;
@@ -14650,12 +14650,12 @@ async function ic(t, e) {
                         // NOTE: The base state should only be applied if there's some
                         // existing document to override, so use a Precondition of
                         // exists=true
-                        o.push(new kn(t.key, e, ae(e.value.mapValue), Pn.exists(!0)));
+                        o.push(new kn(t.key, e, ce(e.value.mapValue), Pn.exists(!0)));
                     }
                     return n.jn.addMutationBatch(t, s, o, e);
                 })).next((e => {
                     o = e;
-                    const s = e.applyToLocalDocumentSet(r, c);
+                    const s = e.applyToLocalDocumentSet(r, a);
                     return n.Wn.saveOverlays(t, e.batchId, s);
                 }));
             })).then((() => {
@@ -14667,14 +14667,14 @@ async function ic(t, e) {
             }));
         }(s.localStore, e);
         s.sharedClientState.addPendingMutation(t.batchId), function(t, e, n) {
-            let s = t.yc[t.currentUser.toKey()];
+            let s = t.ya[t.currentUser.toKey()];
             s || (s = new _t(ot));
-            s = s.insert(e, n), t.yc[t.currentUser.toKey()] = s;
+            s = s.insert(e, n), t.ya[t.currentUser.toKey()] = s;
         }
         /**
  * Resolves or rejects the user callback for the given batch and then discards
  * it.
- */ (s, t.batchId, n), await Tc(s, t.changes), await Eu(s.remoteStore);
+ */ (s, t.batchId, n), await Ta(s, t.changes), await Eu(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.
@@ -14687,20 +14687,20 @@ async function ic(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 cc(t, e) {
+ */ async function aa(t, e) {
     const n = G(t);
     try {
         const t = await Po(n.localStore, e);
         // Update `receivedDocument` as appropriate for any limbo targets.
                 e.targetChanges.forEach(((t, e) => {
-            const s = n.mc.get(e);
+            const s = n.ma.get(e);
             s && (
             // Since this is a limbo resolution lookup, it's for a single document
             // and it could be added, modified, or removed, but not a combination.
             q(t.addedDocuments.size + t.modifiedDocuments.size + t.removedDocuments.size <= 1), 
-            t.addedDocuments.size > 0 ? s.hc = !0 : t.modifiedDocuments.size > 0 ? q(s.hc) : t.removedDocuments.size > 0 && (q(s.hc), 
-            s.hc = !1));
-        })), await Tc(n, t, e);
+            t.addedDocuments.size > 0 ? s.ha = !0 : t.modifiedDocuments.size > 0 ? q(s.ha) : t.removedDocuments.size > 0 && (q(s.ha), 
+            s.ha = !1));
+        })), await Ta(n, t, e);
     } catch (t) {
         await Or(t);
     }
@@ -14709,7 +14709,7 @@ async function ic(t, e) {
 /**
  * Applies an OnlineState change to the sync engine and notifies any views of
  * the change.
- */ function ac(t, e, n) {
+ */ function ca(t, e, n) {
     const s = G(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
@@ -14717,7 +14717,7 @@ async function ic(t, e) {
     // SharedClientState.
         if (s.isPrimaryClient && 0 /* RemoteStore */ === n || !s.isPrimaryClient && 1 /* SharedClientState */ === n) {
         const t = [];
-        s.fc.forEach(((n, s) => {
+        s.fa.forEach(((n, s) => {
             const i = s.view.ku(e);
             i.snapshot && t.push(i.snapshot);
         })), function(t, e) {
@@ -14729,7 +14729,7 @@ async function ic(t, e) {
                 // Run global snapshot listeners if a consistent snapshot has been emitted.
                 t.ku(e) && (s = !0);
             })), s && ju(n);
-        }(s.eventManager, e), t.length && s.lc.nu(t), s.onlineState = e, s.isPrimaryClient && s.sharedClientState.setOnlineState(e);
+        }(s.eventManager, e), t.length && s.la.nu(t), s.onlineState = e, s.isPrimaryClient && s.sharedClientState.setOnlineState(e);
     }
 }
 
@@ -14743,11 +14743,11 @@ async function ic(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 hc(t, e, n) {
+ */ async function ha(t, e, n) {
     const s = G(t);
     // PORTING NOTE: Multi-tab only.
         s.sharedClientState.updateQueryState(e, "rejected", n);
-    const i = s.mc.get(e), r = i && i.key;
+    const i = s.ma.get(e), r = i && i.key;
     if (r) {
         // TODO(klimt): We really only should do the following on permission
         // denied errors, but we don't have the cause code here.
@@ -14763,18 +14763,18 @@ async function ic(t, e) {
         const n = es().add(r), i = new is(ht.min(), 
         /* targetChanges= */ new Map, 
         /* targetMismatches= */ new gt(ot), t, n);
-        await cc(s, i), 
+        await aa(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.wc = s.wc.remove(r), s.mc.delete(e), Ic(s);
+        s.wa = s.wa.remove(r), s.ma.delete(e), Ia(s);
     } else await So(s.localStore, e, 
-    /* keepPersistedTargetData */ !1).then((() => mc(s, e, n))).catch(Or);
+    /* keepPersistedTargetData */ !1).then((() => ma(s, e, n))).catch(Or);
 }
 
-async function lc(t, e) {
+async function la(t, e) {
     const n = G(t), s = e.batch.batchId;
     try {
         const t = await Ao(n.localStore, e);
@@ -14782,14 +14782,14 @@ async function lc(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.
-                wc(n, s, /*error=*/ null), _c(n, s), n.sharedClientState.updateMutationState(s, "acknowledged"), 
-        await Tc(n, t);
+                wa(n, s, /*error=*/ null), _a(n, s), n.sharedClientState.updateMutationState(s, "acknowledged"), 
+        await Ta(n, t);
     } catch (t) {
         await Or(t);
     }
 }
 
-async function fc(t, e, n) {
+async function fa(t, e, n) {
     const s = G(t);
     try {
         const t = await function(t, e) {
@@ -14809,8 +14809,8 @@ async function fc(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.
-                wc(s, e, n), _c(s, e), s.sharedClientState.updateMutationState(e, "rejected", n), 
-        await Tc(s, t);
+                wa(s, e, n), _a(s, e), s.sharedClientState.updateMutationState(e, "rejected", n), 
+        await Ta(s, t);
     } catch (n) {
         await Or(n);
     }
@@ -14819,7 +14819,7 @@ async function fc(t, e, n) {
 /**
  * Registers a user callback that resolves when all pending mutations at the moment of calling
  * are acknowledged .
- */ async function dc(t, e) {
+ */ async function da(t, e) {
     const n = G(t);
     wu(n.remoteStore) || F("SyncEngine", "The network is disabled. The task returned by 'awaitPendingWrites()' will not complete until the network is enabled.");
     try {
@@ -14830,8 +14830,8 @@ async function fc(t, e, n) {
         if (-1 === t) 
         // Trigger the callback right away if there is no pending writes at the moment.
         return void e.resolve();
-        const s = n.Ic.get(t) || [];
-        s.push(e), n.Ic.set(t, s);
+        const s = n.pa.get(t) || [];
+        s.push(e), n.pa.set(t, s);
     } catch (t) {
         const n = Mu(t, "Initialization of waitForPendingWrites() operation failed");
         e.reject(n);
@@ -14841,56 +14841,56 @@ async function fc(t, e, n) {
 /**
  * Triggers the callbacks that are waiting for this batch id to get acknowledged by server,
  * if there are any.
- */ function _c(t, e) {
-    (t.Ic.get(e) || []).forEach((t => {
+ */ function _a(t, e) {
+    (t.pa.get(e) || []).forEach((t => {
         t.resolve();
-    })), t.Ic.delete(e);
+    })), t.pa.delete(e);
 }
 
-/** Reject all outstanding callbacks waiting for pending writes to complete. */ function wc(t, e, n) {
+/** Reject all outstanding callbacks waiting for pending writes to complete. */ function wa(t, e, n) {
     const s = G(t);
-    let i = s.yc[s.currentUser.toKey()];
+    let i = s.ya[s.currentUser.toKey()];
     // NOTE: Mutations restored from persistence won't have callbacks, so it's
     // okay for there to be no callback for this ID.
         if (i) {
         const t = i.get(e);
-        t && (n ? t.reject(n) : t.resolve(), i = i.remove(e)), s.yc[s.currentUser.toKey()] = i;
+        t && (n ? t.reject(n) : t.resolve(), i = i.remove(e)), s.ya[s.currentUser.toKey()] = i;
     }
 }
 
-function mc(t, e, n = null) {
+function ma(t, e, n = null) {
     t.sharedClientState.removeLocalQueryTarget(e);
-    for (const s of t.dc.get(e)) t.fc.delete(s), n && t.lc.Rc(s, n);
-    if (t.dc.delete(e), t.isPrimaryClient) {
-        t.gc.Is(e).forEach((e => {
-            t.gc.containsKey(e) || 
+    for (const s of t.da.get(e)) t.fa.delete(s), n && t.la.Aa(s, n);
+    if (t.da.delete(e), t.isPrimaryClient) {
+        t.ga.Is(e).forEach((e => {
+            t.ga.containsKey(e) || 
             // We removed the last reference for this key
-            gc(t, e);
+            ga(t, e);
         }));
     }
 }
 
-function gc(t, e) {
-    t._c.delete(e.path.canonicalString());
+function ga(t, e) {
+    t._a.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.wc.get(e);
-    null !== n && (hu(t.remoteStore, n), t.wc = t.wc.remove(e), t.mc.delete(n), Ic(t));
+    const n = t.wa.get(e);
+    null !== n && (hu(t.remoteStore, n), t.wa = t.wa.remove(e), t.ma.delete(n), Ia(t));
 }
 
-function yc(t, e, n) {
-    for (const s of n) if (s instanceof Xu) t.gc.addReference(s.key, e), pc(t, s); else if (s instanceof Zu) {
-        F("SyncEngine", "Document no longer in limbo: " + s.key), t.gc.removeReference(s.key, e);
-        t.gc.containsKey(s.key) || 
+function ya(t, e, n) {
+    for (const s of n) if (s instanceof Xu) t.ga.addReference(s.key, e), pa(t, s); else if (s instanceof Zu) {
+        F("SyncEngine", "Document no longer in limbo: " + s.key), t.ga.removeReference(s.key, e);
+        t.ga.containsKey(s.key) || 
         // We removed the last reference for this key
-        gc(t, s.key);
+        ga(t, s.key);
     } else U();
 }
 
-function pc(t, e) {
+function pa(t, e) {
     const n = e.key, s = n.path.canonicalString();
-    t.wc.get(n) || t._c.has(s) || (F("SyncEngine", "New document in limbo: " + n), t._c.add(s), 
-    Ic(t));
+    t.wa.get(n) || t._a.has(s) || (F("SyncEngine", "New document in limbo: " + n), t._a.add(s), 
+    Ia(t));
 }
 
 /**
@@ -14900,19 +14900,19 @@ function pc(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 Ic(t) {
-    for (;t._c.size > 0 && t.wc.size < t.maxConcurrentLimboResolutions; ) {
-        const e = t._c.values().next().value;
-        t._c.delete(e);
-        const n = new Lt(Tt.fromString(e)), s = t.Tc.next();
-        t.mc.set(s, new nc(n)), t.wc = t.wc.insert(n, s), au(t.remoteStore, new $i(Ye(Qe(n.path)), s, 2 /* LimboResolution */ , st.A));
+ */ function Ia(t) {
+    for (;t._a.size > 0 && t.wa.size < t.maxConcurrentLimboResolutions; ) {
+        const e = t._a.values().next().value;
+        t._a.delete(e);
+        const n = new Lt(Tt.fromString(e)), s = t.Ia.next();
+        t.ma.set(s, new na(n)), t.wa = t.wa.insert(n, s), cu(t.remoteStore, new $i(Ye(Qe(n.path)), s, 2 /* LimboResolution */ , st.A));
     }
 }
 
-async function Tc(t, e, n) {
+async function Ta(t, e, n) {
     const s = G(t), i = [], r = [], o = [];
-    s.fc.isEmpty() || (s.fc.forEach(((t, u) => {
-        o.push(s.Ac(u, e, n).then((t => {
+    s.fa.isEmpty() || (s.fa.forEach(((t, u) => {
+        o.push(s.Ea(u, e, n).then((t => {
             if (t) {
                 s.isPrimaryClient && s.sharedClientState.updateQueryState(u.targetId, t.fromCache ? "not-current" : "current"), 
                 i.push(t);
@@ -14920,7 +14920,7 @@ async function Tc(t, e, n) {
                 r.push(e);
             }
         })));
-    })), await Promise.all(o), s.lc.nu(i), await async function(t, e) {
+    })), await Promise.all(o), s.la.nu(i), await async function(t, e) {
         const n = G(t);
         try {
             await n.persistence.runTransaction("notifyLocalViewChanges", "readwrite", (t => Ai.forEach(e, (e => Ai.forEach(e.Fi, (s => n.persistence.referenceDelegate.addReference(t, e.targetId, s))).next((() => Ai.forEach(e.$i, (s => n.persistence.referenceDelegate.removeReference(t, e.targetId, s)))))))));
@@ -14943,7 +14943,7 @@ async function Tc(t, e, n) {
     }(s.localStore, r));
 }
 
-async function Ec(t, e) {
+async function Ea(t, e) {
     const n = G(t);
     if (!n.currentUser.isEqual(e)) {
         F("SyncEngine", "User change. New user:", e.toKey());
@@ -14951,27 +14951,27 @@ async function Ec(t, e) {
         n.currentUser = e, 
         // Fails tasks waiting for pending writes requested by previous user.
         function(t, e) {
-            t.Ic.forEach((t => {
+            t.pa.forEach((t => {
                 t.forEach((t => {
                     t.reject(new j(Q.CANCELLED, e));
                 }));
-            })), t.Ic.clear();
+            })), t.pa.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 Tc(n, t.er);
+        n.sharedClientState.handleUserChange(e, t.removedBatchIds, t.addedBatchIds), await Ta(n, t.er);
     }
 }
 
-function Ac(t, e) {
-    const n = G(t), s = n.mc.get(e);
-    if (s && s.hc) return es().add(s.key);
+function Aa(t, e) {
+    const n = G(t), s = n.ma.get(e);
+    if (s && s.ha) return es().add(s.key);
     {
         let t = es();
-        const s = n.dc.get(e);
+        const s = n.da.get(e);
         if (!s) return t;
         for (const e of s) {
-            const s = n.fc.get(e);
-            t = t.unionWith(s.view.tc);
+            const s = n.fa.get(e);
+            t = t.unionWith(s.view.ta);
         }
         return t;
     }
@@ -14980,10 +14980,10 @@ function Ac(t, e) {
 /**
  * Reconcile the list of synced documents in an existing view with those
  * from persistence.
- */ async function Rc(t, e) {
+ */ async function Ra(t, e) {
     const n = G(t), s = await Do(n.localStore, e.query, 
-    /* usePreviousResults= */ !0), i = e.view.cc(s);
-    return n.isPrimaryClient && yc(n, e.targetId, i.oc), i;
+    /* usePreviousResults= */ !0), i = e.view.aa(s);
+    return n.isPrimaryClient && ya(n, e.targetId, i.oa), i;
 }
 
 /**
@@ -14991,14 +14991,14 @@ function Ac(t, e) {
  * snapshots if needed.
  */
 // PORTING NOTE: Multi-Tab only.
-async function Pc(t, e) {
+async function Pa(t, e) {
     const n = G(t);
-    return xo(n.localStore, e).then((t => Tc(n, t)));
+    return xo(n.localStore, e).then((t => Ta(n, t)));
 }
 
 /** Applies a mutation state to an existing batch.  */
 // PORTING NOTE: Multi-Tab only.
-async function bc(t, e, n, s) {
+async function ba(t, e, n, s) {
     const i = G(t), r = await function(t, e) {
         const n = G(t), s = G(n.jn);
         return n.persistence.runTransaction("Lookup mutation documents", "readonly", (t => s.fn(t, e).next((e => e ? n.tr.Jn(t, e) : Ai.resolve(null)))));
@@ -15012,11 +15012,11 @@ async function bc(t, e, n, s) {
     await Eu(i.remoteStore) : "acknowledged" === n || "rejected" === n ? (
     // NOTE: Both these methods are no-ops for batches that originated from
     // other clients.
-    wc(i, e, s || null), _c(i, e), function(t, e) {
+    wa(i, e, s || null), _a(i, e), function(t, e) {
         G(G(t).jn)._n(e);
     }
     // PORTING NOTE: Multi-Tab only.
-    (i.localStore, e)) : U(), await Tc(i, r)) : 
+    (i.localStore, e)) : U(), await Ta(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
@@ -15029,32 +15029,32 @@ async function bc(t, e, n, s) {
 
 /** Applies a query target change from a different tab. */
 // PORTING NOTE: Multi-Tab only.
-async function Vc(t, e) {
+async function Va(t, e) {
     const n = G(t);
-    if (Nc(n), kc(n), !0 === e && !0 !== n.Ec) {
+    if (Na(n), ka(n), !0 === e && !0 !== n.Ta) {
         // 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 vc(n, t.toArray());
-        n.Ec = !0, await xu(n.remoteStore, !0);
-        for (const t of e) au(n.remoteStore, t);
-    } else if (!1 === e && !1 !== n.Ec) {
+        const t = n.sharedClientState.getAllActiveQueryTargets(), e = await va(n, t.toArray());
+        n.Ta = !0, await xu(n.remoteStore, !0);
+        for (const t of e) cu(n.remoteStore, t);
+    } else if (!1 === e && !1 !== n.Ta) {
         const t = [];
         let e = Promise.resolve();
-        n.dc.forEach(((s, i) => {
-            n.sharedClientState.isLocalQueryTarget(i) ? t.push(i) : e = e.then((() => (mc(n, i), 
+        n.da.forEach(((s, i) => {
+            n.sharedClientState.isLocalQueryTarget(i) ? t.push(i) : e = e.then((() => (ma(n, i), 
             So(n.localStore, i, 
             /*keepPersistedTargetData=*/ !0)))), hu(n.remoteStore, i);
-        })), await e, await vc(n, t), 
+        })), await e, await va(n, t), 
         // PORTING NOTE: Multi-Tab only.
         function(t) {
             const e = G(t);
-            e.mc.forEach(((t, n) => {
+            e.ma.forEach(((t, n) => {
                 hu(e.remoteStore, n);
-            })), e.gc.Ts(), e.mc = new Map, e.wc = new _t(Lt.comparator);
+            })), e.ga.Ts(), e.ma = new Map, e.wa = new _t(Lt.comparator);
         }
         /**
  * Reconcile the query views of the provided query targets with the state from
@@ -15067,15 +15067,15 @@ async function Vc(t, e) {
  * tab to a primary tab
  */
         // PORTING NOTE: Multi-Tab only.
-        (n), n.Ec = !1, await xu(n.remoteStore, !1);
+        (n), n.Ta = !1, await xu(n.remoteStore, !1);
     }
 }
 
-async function vc(t, e, n) {
+async function va(t, e, n) {
     const s = G(t), i = [], r = [];
     for (const t of e) {
         let e;
-        const n = s.dc.get(t);
+        const n = s.da.get(t);
         if (n && 0 !== n.length) {
             // For queries that have a local View, we fetch their current state
             // from LocalStore (as the resume token and the snapshot version
@@ -15083,19 +15083,19 @@ async function vc(t, e, n) {
             // state (the list of syncedDocuments may have gotten out of sync).
             e = await vo(s.localStore, Ye(n[0]));
             for (const t of n) {
-                const e = s.fc.get(t), n = await Rc(s, e);
+                const e = s.fa.get(t), n = await Ra(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 Co(s.localStore, t);
-            e = await vo(s.localStore, n), await rc(s, Sc(n), t, 
+            e = await vo(s.localStore, n), await ra(s, Sa(n), t, 
             /*current=*/ !1);
         }
         i.push(e);
     }
-    return s.lc.nu(r), i;
+    return s.la.nu(r), i;
 }
 
 /**
@@ -15109,38 +15109,38 @@ async function vc(t, e, n) {
  * difference will not cause issues.
  */
 // PORTING NOTE: Multi-Tab only.
-function Sc(t) {
+function Sa(t) {
     return Ge(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 Dc(t) {
+function Da(t) {
     const e = G(t);
     return G(G(e.localStore).persistence).Oi();
 }
 
 /** Applies a query target change from a different tab. */
 // PORTING NOTE: Multi-Tab only.
-async function Cc(t, e, n, s) {
+async function Ca(t, e, n, s) {
     const i = G(t);
-    if (i.Ec) 
+    if (i.Ta) 
     // If we receive a target state notification via WebStorage, we are
     // either already secondary or another tab has taken the primary lease.
     return void F("SyncEngine", "Ignoring unexpected query state notification.");
-    const r = i.dc.get(e);
+    const r = i.da.get(e);
     if (r && r.length > 0) switch (n) {
       case "current":
       case "not-current":
         {
             const t = await xo(i.localStore, sn(r[0])), s = is.createSynthesizedRemoteEventForCurrentChange(e, "current" === n);
-            await Tc(i, t, s);
+            await Ta(i, t, s);
             break;
         }
 
       case "rejected":
         await So(i.localStore, e, 
-        /* keepPersistedTargetData */ !0), mc(i, e, s);
+        /* keepPersistedTargetData */ !0), ma(i, e, s);
         break;
 
       default:
@@ -15148,41 +15148,41 @@ async function Cc(t, e, n, s) {
     }
 }
 
-/** Adds or removes Watch targets for queries from different tabs. */ async function xc(t, e, n) {
-    const s = Nc(t);
-    if (s.Ec) {
+/** Adds or removes Watch targets for queries from different tabs. */ async function xa(t, e, n) {
+    const s = Na(t);
+    if (s.Ta) {
         for (const t of e) {
-            if (s.dc.has(t)) {
+            if (s.da.has(t)) {
                 // A target might have been added in a previous attempt
                 F("SyncEngine", "Adding an already active target " + t);
                 continue;
             }
             const e = await Co(s.localStore, t), n = await vo(s.localStore, e);
-            await rc(s, Sc(e), n.targetId, 
-            /*current=*/ !1), au(s.remoteStore, n);
+            await ra(s, Sa(e), n.targetId, 
+            /*current=*/ !1), cu(s.remoteStore, n);
         }
         for (const t of n) 
         // Check that the target is still active since the target might have been
         // removed if it has been rejected by the backend.
-        s.dc.has(t) && 
+        s.da.has(t) && 
         // Release queries that are still active.
         await So(s.localStore, t, 
         /* keepPersistedTargetData */ !1).then((() => {
-            hu(s.remoteStore, t), mc(s, t);
+            hu(s.remoteStore, t), ma(s, t);
         })).catch(Or);
     }
 }
 
-function Nc(t) {
+function Na(t) {
     const e = G(t);
-    return e.remoteStore.remoteSyncer.applyRemoteEvent = cc.bind(null, e), e.remoteStore.remoteSyncer.getRemoteKeysForTarget = Ac.bind(null, e), 
-    e.remoteStore.remoteSyncer.rejectListen = hc.bind(null, e), e.lc.nu = Gu.bind(null, e.eventManager), 
-    e.lc.Rc = Qu.bind(null, e.eventManager), e;
+    return e.remoteStore.remoteSyncer.applyRemoteEvent = aa.bind(null, e), e.remoteStore.remoteSyncer.getRemoteKeysForTarget = Aa.bind(null, e), 
+    e.remoteStore.remoteSyncer.rejectListen = ha.bind(null, e), e.la.nu = Gu.bind(null, e.eventManager), 
+    e.la.Aa = Qu.bind(null, e.eventManager), e;
 }
 
-function kc(t) {
+function ka(t) {
     const e = G(t);
-    return e.remoteStore.remoteSyncer.applySuccessfulWrite = lc.bind(null, e), e.remoteStore.remoteSyncer.rejectFailedWrite = fc.bind(null, e), 
+    return e.remoteStore.remoteSyncer.applySuccessfulWrite = la.bind(null, e), e.remoteStore.remoteSyncer.rejectFailedWrite = fa.bind(null, e), 
     e;
 }
 
@@ -15193,7 +15193,7 @@ function kc(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 Oc(t, e, n) {
+ */ function Oa(t, e, n) {
     const s = G(t);
     // eslint-disable-next-line @typescript-eslint/no-floating-promises
         (
@@ -15218,13 +15218,13 @@ function kc(t) {
             }(s)), Promise.resolve(new Set);
             n._updateProgress(Yu(s));
             const i = new Ju(s, t.localStore, e.O);
-            let r = await e.Pc();
+            let r = await e.Ra();
             for (;r; ) {
                 const t = await i.Qu(r);
-                t && n._updateProgress(t), r = await e.Pc();
+                t && n._updateProgress(t), r = await e.Ra();
             }
             const o = await i.complete();
-            return await Tc(t, o.zu, 
+            return await Ta(t, o.zu, 
             /* remoteEvent */ void 0), 
             // Save metadata, so loading the same bundle will skip.
             await function(t, e) {
@@ -15263,24 +15263,24 @@ function kc(t) {
     }));
 }
 
-class Mc {
+class Ma {
     constructor() {
         this.synchronizeTabs = !1;
     }
     async initialize(t) {
-        this.O = Zo(t.databaseInfo.databaseId), this.sharedClientState = this.bc(t), this.persistence = this.Vc(t), 
-        await this.persistence.start(), this.gcScheduler = this.vc(t), this.localStore = this.Sc(t);
+        this.O = Zo(t.databaseInfo.databaseId), this.sharedClientState = this.Pa(t), this.persistence = this.ba(t), 
+        await this.persistence.start(), this.gcScheduler = this.Va(t), this.localStore = this.va(t);
     }
-    vc(t) {
+    Va(t) {
         return null;
     }
-    Sc(t) {
+    va(t) {
         return To(this.persistence, new po, t.initialUser, this.O);
     }
-    Vc(t) {
-        return new uo(ao.Ws, this.O);
+    ba(t) {
+        return new uo(co.Ws, this.O);
     }
-    bc(t) {
+    Pa(t) {
         return new Qo;
     }
     async terminate() {
@@ -15291,31 +15291,31 @@ class Mc {
 
 /**
  * Provides all components needed for Firestore with IndexedDB persistence.
- */ class Fc extends Mc {
+ */ class Fa extends Ma {
     constructor(t, e, n) {
-        super(), this.Dc = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;
+        super(), this.Sa = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;
     }
     async initialize(t) {
-        await super.initialize(t), await this.Dc.initialize(this, t), 
+        await super.initialize(t), await this.Sa.initialize(this, t), 
         // Enqueue writes from a previous session
-        await kc(this.Dc.syncEngine), await Eu(this.Dc.remoteStore), 
+        await ka(this.Sa.syncEngine), await Eu(this.Sa.remoteStore), 
         // NOTE: This will immediately call the listener, so we make sure to
         // set it after localStore / remoteStore are started.
         await this.persistence.pi((() => (this.gcScheduler && !this.gcScheduler.started && this.gcScheduler.start(this.localStore), 
         Promise.resolve())));
     }
-    Sc(t) {
+    va(t) {
         return To(this.persistence, new po, t.initialUser, this.O);
     }
-    vc(t) {
+    Va(t) {
         const e = this.persistence.referenceDelegate.garbageCollector;
         return new $r(e, t.asyncQueue);
     }
-    Vc(t) {
+    ba(t) {
         const e = go(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey), n = void 0 !== this.cacheSizeBytes ? Er.withCacheSize(this.cacheSizeBytes) : Er.DEFAULT;
         return new _o(this.synchronizeTabs, e, t.clientId, n, t.asyncQueue, Yo(), Xo(), this.O, this.sharedClientState, !!this.forceOwnership);
     }
-    bc(t) {
+    Pa(t) {
         return new Qo;
     }
 }
@@ -15327,27 +15327,27 @@ class Mc {
  * 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 $c extends Fc {
+ */ class $a extends Fa {
     constructor(t, e) {
-        super(t, e, /* forceOwnership= */ !1), this.Dc = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;
+        super(t, e, /* forceOwnership= */ !1), this.Sa = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;
     }
     async initialize(t) {
         await super.initialize(t);
-        const e = this.Dc.syncEngine;
+        const e = this.Sa.syncEngine;
         this.sharedClientState instanceof Go && (this.sharedClientState.syncEngine = {
-            jr: bc.bind(null, e),
-            Wr: Cc.bind(null, e),
-            zr: xc.bind(null, e),
-            Oi: Dc.bind(null, e),
-            Qr: Pc.bind(null, e)
+            jr: ba.bind(null, e),
+            Wr: Ca.bind(null, e),
+            zr: xa.bind(null, e),
+            Oi: Da.bind(null, e),
+            Qr: Pa.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.pi((async t => {
-            await Vc(this.Dc.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start(this.localStore) : t || this.gcScheduler.stop());
+            await Va(this.Sa.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start(this.localStore) : t || this.gcScheduler.stop());
         }));
     }
-    bc(t) {
+    Pa(t) {
         const e = Yo();
         if (!Go.vt(e)) throw new j(Q.UNIMPLEMENTED, "IndexedDB persistence is only available on platforms that support LocalStorage.");
         const n = go(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey);
@@ -15358,13 +15358,13 @@ class Mc {
 /**
  * Initializes and wires the components that are needed to interface with the
  * network.
- */ class Bc {
+ */ class Ba {
     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 => ac(this.syncEngine, t, 1 /* SharedClientState */), 
-        this.remoteStore.remoteSyncer.handleCredentialChange = Ec.bind(null, this.syncEngine), 
+        /* startAsPrimary=*/ !t.synchronizeTabs), this.sharedClientState.onlineStateHandler = t => ca(this.syncEngine, t, 1 /* SharedClientState */), 
+        this.remoteStore.remoteSyncer.handleCredentialChange = Ea.bind(null, this.syncEngine), 
         await xu(this.remoteStore, this.syncEngine.isPrimaryClient));
     }
     createEventManager(t) {
@@ -15378,7 +15378,7 @@ class Mc {
         }(t.authCredentials, t.appCheckCredentials, n, e);
     }
     createRemoteStore(t) {
-        return e = this.localStore, n = this.datastore, s = t.asyncQueue, i = t => ac(this.syncEngine, t, 0 /* RemoteStore */), 
+        return e = this.localStore, n = this.datastore, s = t.asyncQueue, i = t => ca(this.syncEngine, t, 0 /* RemoteStore */), 
         r = Wo.vt() ? new Wo : new jo, new ou(e, n, s, i, r);
         var e, n, s, i, r;
         /** Re-enables the network. Idempotent. */    }
@@ -15386,14 +15386,14 @@ class Mc {
         return function(t, e, n, 
         // PORTING NOTE: Manages state synchronization in multi-tab environments.
         s, i, r, o) {
-            const u = new sc(t, e, n, s, i, r);
-            return o && (u.Ec = !0), u;
+            const u = new sa(t, e, n, s, i, r);
+            return o && (u.Ta = !0), u;
         }(this.localStore, this.remoteStore, this.eventManager, this.sharedClientState, t.initialUser, t.maxConcurrentLimboResolutions, e);
     }
     terminate() {
         return async function(t) {
             const e = G(t);
-            F("RemoteStore", "RemoteStore shutting down."), e.Au.add(5 /* Shutdown */), await cu(e), 
+            F("RemoteStore", "RemoteStore shutting down."), e.Au.add(5 /* Shutdown */), await au(e), 
             e.Pu.shutdown(), 
             // Set the OnlineState to Unknown (rather than Offline) to avoid potentially
             // triggering spurious listener events with cached data, etc.
@@ -15429,7 +15429,7 @@ class Mc {
  * @param bytesPerRead - How many bytes each `read()` from the returned reader
  *        will read.
  */
-function Lc(t, e = 10240) {
+function La(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.
@@ -15495,7 +15495,7 @@ function Lc(t, e = 10240) {
  * asynchronously. To allow immediate silencing, a mute call is added which
  * causes events scheduled to no longer be raised.
  */
-class Uc {
+class Ua {
     constructor(t) {
         this.observer = t, 
         /**
@@ -15505,15 +15505,15 @@ class Uc {
         this.muted = !1;
     }
     next(t) {
-        this.observer.next && this.Cc(this.observer.next, t);
+        this.observer.next && this.Da(this.observer.next, t);
     }
     error(t) {
-        this.observer.error ? this.Cc(this.observer.error, t) : console.error("Uncaught Error in snapshot listener:", t);
+        this.observer.error ? this.Da(this.observer.error, t) : console.error("Uncaught Error in snapshot listener:", t);
     }
-    xc() {
+    Ca() {
         this.muted = !0;
     }
-    Cc(t, e) {
+    Da(t, e) {
         this.muted || setTimeout((() => {
             this.muted || t(e);
         }), 0);
@@ -15541,32 +15541,32 @@ class Uc {
  *
  * Takes a bundle stream or buffer, and presents abstractions to read bundled
  * elements out of the underlying content.
- */ class qc {
+ */ class qa {
     constructor(
     /** The reader to read from underlying binary bundle data source. */
     t, e) {
-        this.Nc = t, this.O = e, 
+        this.xa = t, this.O = e, 
         /** Cached bundle metadata. */
         this.metadata = new W, 
         /**
          * Internal buffer to hold bundle content, accumulating incomplete element
          * content.
          */
-        this.buffer = new Uint8Array, this.kc = new TextDecoder("utf-8"), 
+        this.buffer = new Uint8Array, this.Na = new TextDecoder("utf-8"), 
         // Read the metadata (which is the first element).
-        this.Oc().then((t => {
+        this.ka().then((t => {
             t && t.Ku() ? this.metadata.resolve(t.payload.metadata) : this.metadata.reject(new Error(`The first element of the bundle is not a metadata, it is\n             ${JSON.stringify(null == t ? void 0 : t.payload)}`));
         }), (t => this.metadata.reject(t)));
     }
     close() {
-        return this.Nc.cancel();
+        return this.xa.cancel();
     }
     async getMetadata() {
         return this.metadata.promise;
     }
-    async Pc() {
+    async Ra() {
         // Makes sure metadata is read before proceeding.
-        return await this.getMetadata(), this.Oc();
+        return await this.getMetadata(), this.ka();
     }
     /**
      * Reads from the head of internal buffer, and pulling more data from
@@ -15577,15 +15577,15 @@ class Uc {
      *
      * Returns either the bundled element, or null if we have reached the end of
      * the stream.
-     */    async Oc() {
-        const t = await this.Mc();
+     */    async ka() {
+        const t = await this.Oa();
         if (null === t) return null;
-        const e = this.kc.decode(t), n = Number(e);
-        isNaN(n) && this.Fc(`length string (${e}) is not valid number`);
-        const s = await this.$c(n);
+        const e = this.Na.decode(t), n = Number(e);
+        isNaN(n) && this.Ma(`length string (${e}) is not valid number`);
+        const s = await this.Fa(n);
         return new zu(JSON.parse(s), t.length + n);
     }
-    /** First index of '{' from the underlying buffer. */    Bc() {
+    /** First index of '{' from the underlying buffer. */    $a() {
         return this.buffer.findIndex((t => t === "{".charCodeAt(0)));
     }
     /**
@@ -15593,17 +15593,17 @@ class Uc {
      * return the content.
      *
      * If reached end of the stream, returns a null.
-     */    async Mc() {
-        for (;this.Bc() < 0; ) {
-            if (await this.Lc()) break;
+     */    async Oa() {
+        for (;this.$a() < 0; ) {
+            if (await this.Ba()) 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.Bc();
+        const t = this.$a();
         // Broke out of the loop because underlying stream is closed, but still
         // cannot find an open bracket.
-                t < 0 && this.Fc("Reached the end of bundle when a length string is expected.");
+                t < 0 && this.Ma("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;
@@ -15613,23 +15613,23 @@ class Uc {
      * number of bytes, pulling more data from the underlying stream if needed.
      *
      * Returns a string decoded from the read bytes.
-     */    async $c(t) {
+     */    async Fa(t) {
         for (;this.buffer.length < t; ) {
-            await this.Lc() && this.Fc("Reached the end of bundle when more is expected.");
+            await this.Ba() && this.Ma("Reached the end of bundle when more is expected.");
         }
-        const e = this.kc.decode(this.buffer.slice(0, t));
+        const e = this.Na.decode(this.buffer.slice(0, t));
         // Update the internal buffer to drop the read json string.
                 return this.buffer = this.buffer.slice(t), e;
     }
-    Fc(t) {
+    Ma(t) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        throw this.Nc.cancel(), new Error(`Invalid bundle format: ${t}`);
+        throw this.xa.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 Lc() {
-        const t = await this.Nc.read();
+     */    async Ba() {
+        const t = await this.xa.read();
         if (!t.done) {
             const e = new Uint8Array(this.buffer.length + t.value.length);
             e.set(this.buffer), e.set(t.value, this.buffer.length), this.buffer = e;
@@ -15658,7 +15658,7 @@ class Uc {
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
  */
-class Kc {
+class Ka {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -15798,29 +15798,29 @@ class Kc {
 /**
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
- */ class Gc {
+ */ class Ga {
     constructor(t, e, n, s, i) {
         this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = s, 
-        this.deferred = i, this.Uc = n.maxAttempts, this.Uo = new tu(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.deferred = i, this.La = n.maxAttempts, this.Uo = new tu(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
-        this.Uc -= 1, this.qc();
+        this.La -= 1, this.Ua();
     }
-    qc() {
+    Ua() {
         this.Uo.xo((async () => {
-            const t = new Kc(this.datastore), e = this.Kc(t);
+            const t = new Ka(this.datastore), e = this.qa(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
                 })).catch((t => {
-                    this.Gc(t);
+                    this.Ka(t);
                 }))));
             })).catch((t => {
-                this.Gc(t);
+                this.Ka(t);
             }));
         }));
     }
-    Kc(t) {
+    qa(t) {
         try {
             const e = this.updateFunction(t);
             return !Ft(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
@@ -15830,11 +15830,11 @@ class Kc {
             return this.deferred.reject(t), null;
         }
     }
-    Gc(t) {
-        this.Uc > 0 && this.Qc(t) ? (this.Uc -= 1, this.asyncQueue.enqueueAndForget((() => (this.qc(), 
+    Ka(t) {
+        this.La > 0 && this.Ga(t) ? (this.La -= 1, this.asyncQueue.enqueueAndForget((() => (this.Ua(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
-    Qc(t) {
+    Ga(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.
@@ -15866,7 +15866,7 @@ class Kc {
  * 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 Qc {
+class Qa {
     constructor(t, e, 
     /**
      * Asynchronous queue responsible for all of our internal processing. When
@@ -15926,7 +15926,7 @@ class Qc {
     }
 }
 
-async function jc(t, e) {
+async function ja(t, e) {
     t.asyncQueue.verifyOperationInProgress(), F("FirestoreClient", "Initializing OfflineComponentProvider");
     const n = await t.getConfiguration();
     await e.initialize(n);
@@ -15939,9 +15939,9 @@ async function jc(t, e) {
     e.persistence.setDatabaseDeletedListener((() => t.terminate())), t.offlineComponents = e;
 }
 
-async function Wc(t, e) {
+async function Wa(t, e) {
     t.asyncQueue.verifyOperationInProgress();
-    const n = await zc(t);
+    const n = await za(t);
     F("FirestoreClient", "Initializing OnlineComponentProvider");
     const s = await t.getConfiguration();
     await e.initialize(n, s), 
@@ -15951,41 +15951,41 @@ async function Wc(t, e) {
     t.onlineComponents = e;
 }
 
-async function zc(t) {
+async function za(t) {
     return t.offlineComponents || (F("FirestoreClient", "Using default OfflineComponentProvider"), 
-    await jc(t, new Mc)), t.offlineComponents;
+    await ja(t, new Ma)), t.offlineComponents;
 }
 
-async function Hc(t) {
+async function Ha(t) {
     return t.onlineComponents || (F("FirestoreClient", "Using default OnlineComponentProvider"), 
-    await Wc(t, new Bc)), t.onlineComponents;
+    await Wa(t, new Ba)), t.onlineComponents;
 }
 
-function Jc(t) {
-    return zc(t).then((t => t.persistence));
+function Ja(t) {
+    return za(t).then((t => t.persistence));
 }
 
-function Yc(t) {
-    return zc(t).then((t => t.localStore));
+function Ya(t) {
+    return za(t).then((t => t.localStore));
 }
 
-function Xc(t) {
-    return Hc(t).then((t => t.remoteStore));
+function Xa(t) {
+    return Ha(t).then((t => t.remoteStore));
 }
 
-function Zc(t) {
-    return Hc(t).then((t => t.syncEngine));
+function Za(t) {
+    return Ha(t).then((t => t.syncEngine));
 }
 
-async function ta(t) {
-    const e = await Hc(t), n = e.eventManager;
-    return n.onListen = ic.bind(null, e.syncEngine), n.onUnlisten = oc.bind(null, e.syncEngine), 
+async function tc(t) {
+    const e = await Ha(t), n = e.eventManager;
+    return n.onListen = ia.bind(null, e.syncEngine), n.onUnlisten = oa.bind(null, e.syncEngine), 
     n;
 }
 
-/** Enables the network connection and re-enqueues all pending operations. */ function ea(t) {
+/** Enables the network connection and re-enqueues all pending operations. */ function ec(t) {
     return t.asyncQueue.enqueue((async () => {
-        const e = await Jc(t), n = await Xc(t);
+        const e = await Ja(t), n = await Xa(t);
         return e.setNetworkEnabled(!0), function(t) {
             const e = G(t);
             return e.Au.delete(0 /* UserDisabled */), uu(e);
@@ -15993,12 +15993,12 @@ async function ta(t) {
     }));
 }
 
-/** Disables the network connection. Pending operations will not complete. */ function na(t) {
+/** Disables the network connection. Pending operations will not complete. */ function nc(t) {
     return t.asyncQueue.enqueue((async () => {
-        const e = await Jc(t), n = await Xc(t);
+        const e = await Ja(t), n = await Xa(t);
         return e.setNetworkEnabled(!1), async function(t) {
             const e = G(t);
-            e.Au.add(0 /* UserDisabled */), await cu(e), 
+            e.Au.add(0 /* UserDisabled */), await au(e), 
             // Set the OnlineState to Offline so get()s return from cache, etc.
             e.bu.set("Offline" /* Offline */);
         }(n);
@@ -16009,7 +16009,7 @@ async function ta(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 sa(t, e) {
+ */ function sc(t, e) {
     const n = new W;
     return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {
         try {
@@ -16026,13 +16026,13 @@ async function ta(t) {
     /**
  * Retrieves a latency-compensated document from the backend via a
  * SnapshotListener.
- */ (await Yc(t), e, n))), n.promise;
+ */ (await Ya(t), e, n))), n.promise;
 }
 
-function ia(t, e, n = {}) {
+function ic(t, e, n = {}) {
     const s = new W;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new Uc({
+        const r = new Ua({
             next: r => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
@@ -16054,15 +16054,15 @@ function ia(t, e, n = {}) {
             qu: !0
         });
         return qu(t, o);
-    }(await ta(t), t.asyncQueue, e, n, s))), s.promise;
+    }(await tc(t), t.asyncQueue, e, n, s))), s.promise;
 }
 
-function ra(t, e) {
+function rc(t, e) {
     const n = new W;
     return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {
         try {
             const s = await Do(t, e, 
-            /* usePreviousResults= */ !0), i = new tc(e, s.ir), r = i.ec(s.documents), o = i.applyChanges(r, 
+            /* usePreviousResults= */ !0), i = new ta(e, s.ir), r = i.ea(s.documents), o = i.applyChanges(r, 
             /* updateLimboDocuments= */ !1);
             n.resolve(o.snapshot);
         } catch (t) {
@@ -16073,13 +16073,13 @@ function ra(t, e) {
     /**
  * Retrieves a latency-compensated query snapshot from the backend via a
  * SnapshotListener.
- */ (await Yc(t), e, n))), n.promise;
+ */ (await Ya(t), e, n))), n.promise;
 }
 
-function oa(t, e, n = {}) {
+function oc(t, e, n = {}) {
     const s = new W;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new Uc({
+        const r = new Ua({
             next: n => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
@@ -16091,20 +16091,20 @@ function oa(t, e, n = {}) {
             qu: !0
         });
         return qu(t, o);
-    }(await ta(t), t.asyncQueue, e, n, s))), s.promise;
+    }(await tc(t), t.asyncQueue, e, n, s))), s.promise;
 }
 
-function ua(t, e) {
-    const n = new Uc(e);
+function uc(t, e) {
+    const n = new Ua(e);
     return t.asyncQueue.enqueueAndForget((async () => function(t, e) {
         G(t).Nu.add(e), 
         // Immediately fire an initial event, indicating all existing listeners
         // are in-sync.
         e.next();
-    }(await ta(t), n))), () => {
-        n.xc(), t.asyncQueue.enqueueAndForget((async () => function(t, e) {
+    }(await tc(t), n))), () => {
+        n.Ca(), t.asyncQueue.enqueueAndForget((async () => function(t, e) {
             G(t).Nu.delete(e);
-        }(await ta(t), n)));
+        }(await tc(t), n)));
     };
 }
 
@@ -16122,25 +16122,25 @@ function ua(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 ca(t, e, n) {
+ */ function ac(t, e, n) {
     const s = new W;
     return t.asyncQueue.enqueueAndForget((async () => {
         const i = await function(t) {
-            return Hc(t).then((t => t.datastore));
+            return Ha(t).then((t => t.datastore));
         }(t);
-        new Gc(t.asyncQueue, i, n, e, s).run();
+        new Ga(t.asyncQueue, i, n, e, s).run();
     })), s.promise;
 }
 
-function aa(t, e, n, s) {
+function cc(t, e, n, s) {
     const i = function(t, e) {
         let n;
         n = "string" == typeof t ? (new TextEncoder).encode(t) : t;
         return function(t, e) {
-            return new qc(t, e);
+            return new qa(t, e);
         }(function(t, e) {
-            if (t instanceof Uint8Array) return Lc(t, e);
-            if (t instanceof ArrayBuffer) return Lc(new Uint8Array(t), e);
+            if (t instanceof Uint8Array) return La(t, e);
+            if (t instanceof ArrayBuffer) return La(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);
@@ -16162,18 +16162,18 @@ function aa(t, e, n, s) {
  * limitations under the License.
  */ (n, Zo(e));
     t.asyncQueue.enqueueAndForget((async () => {
-        Oc(await Zc(t), i, s);
+        Oa(await Za(t), i, s);
     }));
 }
 
-function ha(t, e) {
+function hc(t, e) {
     return t.asyncQueue.enqueue((async () => function(t, e) {
         const n = G(t);
         return n.persistence.runTransaction("Get named query", "readonly", (t => n.Us.getNamedQuery(t, e)));
-    }(await Yc(t), e)));
+    }(await Ya(t), e)));
 }
 
-const la = new Map;
+const lc = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -16195,28 +16195,28 @@ const la = new Map;
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function fa(t, e, n) {
+function fc(t, e, n) {
     if (!n) throw new j(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 da(t, e, n, s) {
+ */ function dc(t, e, n, s) {
     if (!0 === e && !0 === s) throw new j(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 _a(t) {
+ */ function _c(t) {
     if (!Lt.isDocumentKey(t)) throw new j(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 wa(t) {
+ */ function wc(t) {
     if (Lt.isDocumentKey(t)) throw new j(Q.INVALID_ARGUMENT, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
@@ -16225,7 +16225,7 @@ function fa(t, e, n) {
  * (i.e. excludes Array, Date, etc.).
  */
 /** Returns a string describing the type / value of the provided input. */
-function ma(t) {
+function mc(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)}...`), 
@@ -16254,7 +16254,7 @@ function ma(t) {
     return "function" == typeof t ? "a function" : U();
 }
 
-function ga(t, 
+function gc(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     if ("_delegate" in t && (
@@ -16263,14 +16263,14 @@ e) {
     t = t._delegate), !(t instanceof e)) {
         if (e.name === t.constructor.name) throw new j(Q.INVALID_ARGUMENT, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
-            const n = ma(t);
+            const n = mc(t);
             throw new j(Q.INVALID_ARGUMENT, `Expected type '${e.name}', but it was: ${n}`);
         }
     }
     return t;
 }
 
-function ya(t, e) {
+function yc(t, e) {
     if (e <= 0) throw new j(Q.INVALID_ARGUMENT, `Function ${t}() requires a positive number, but it was: ${e}.`);
 }
 
@@ -16296,7 +16296,7 @@ function ya(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 pa {
+class pc {
     constructor(t) {
         var e;
         if (void 0 === t.host) {
@@ -16309,7 +16309,7 @@ class pa {
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
-        this.useFetchStreams = !!t.useFetchStreams, da("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
+        this.useFetchStreams = !!t.useFetchStreams, dc("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;
@@ -16336,14 +16336,14 @@ class pa {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class Ia {
+ */ class Ic {
     /** @hideconstructor */
     constructor(t, e, n) {
         this._authCredentials = e, this._appCheckCredentials = n, 
         /**
          * Whether it's a Firestore or Firestore Lite instance.
          */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new pa({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new pc({}), 
         this._settingsFrozen = !1, t instanceof Mt ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
             if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new j(Q.INVALID_ARGUMENT, '"projectId" not provided in firebase.initializeApp.');
@@ -16378,7 +16378,7 @@ class pa {
     }
     _setSettings(t) {
         if (this._settingsFrozen) throw new j(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 pa(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new pc(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new H;
             switch (t.type) {
               case "gapi":
@@ -16423,15 +16423,15 @@ class pa {
  * when the `Firestore` instance is terminated.
  */
         return function(t) {
-            const e = la.get(t);
-            e && (F("ComponentProvider", "Removing Datastore"), la.delete(t), e.terminate());
+            const e = lc.get(t);
+            e && (F("ComponentProvider", "Removing Datastore"), lc.delete(t), e.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function Ta(t, e, n, s = {}) {
+function Tc(t, e, n, s = {}) {
     var i;
-    const r = (t = ga(t, Ia))._getSettings();
+    const r = (t = gc(t, Ic))._getSettings();
     if ("firestore.googleapis.com" !== r.host && r.host !== e && B("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, r), {
         host: `${e}:${n}`,
@@ -16470,7 +16470,7 @@ function Ta(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 Ea {
+ */ class Ec {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -16498,17 +16498,17 @@ function Ta(t, e, n, s = {}) {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new Ra(this.firestore, this.converter, this._key.path.popLast());
+        return new Rc(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new Ea(this.firestore, t, this._key);
+        return new Ec(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 Aa {
+ */ class Ac {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -16521,14 +16521,14 @@ function Ta(t, e, n, s = {}) {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new Aa(this.firestore, t, this._query);
+        return new Ac(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 Ra extends Aa {
+ */ class Rc extends Ac {
     /** @hideconstructor */
     constructor(t, e, n) {
         super(t, e, Qe(n)), this._path = n, 
@@ -16549,23 +16549,23 @@ function Ta(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 Ea(this.firestore, 
+        return t.isEmpty() ? null : new Ec(this.firestore, 
         /* converter= */ null, new Lt(t));
     }
     withConverter(t) {
-        return new Ra(this.firestore, t, this._path);
+        return new Rc(this.firestore, t, this._path);
     }
 }
 
-function Pa(t, e, ...n) {
-    if (t = I(t), fa("collection", "path", e), t instanceof Ia) {
+function Pc(t, e, ...n) {
+    if (t = I(t), fc("collection", "path", e), t instanceof Ic) {
         const s = Tt.fromString(e, ...n);
-        return wa(s), new Ra(t, /* converter= */ null, s);
+        return wc(s), new Rc(t, /* converter= */ null, s);
     }
     {
-        if (!(t instanceof Ea || t instanceof Ra)) throw new j(Q.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof Ec || t instanceof Rc)) throw new j(Q.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(Tt.fromString(e, ...n));
-        return wa(s), new Ra(t.firestore, 
+        return wc(s), new Rc(t.firestore, 
         /* converter= */ null, s);
     }
 }
@@ -16582,9 +16582,9 @@ function Pa(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 ba(t, e) {
-    if (t = ga(t, Ia), fa("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new j(Q.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new Aa(t, 
+ */ function bc(t, e) {
+    if (t = gc(t, Ic), fc("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new j(Q.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new Ac(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
@@ -16595,19 +16595,19 @@ function Pa(t, e, ...n) {
     }(e));
 }
 
-function Va(t, e, ...n) {
+function Vc(t, e, ...n) {
     if (t = I(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = rt.R()), fa("doc", "path", e), t instanceof Ia) {
+    1 === arguments.length && (e = rt.R()), fc("doc", "path", e), t instanceof Ic) {
         const s = Tt.fromString(e, ...n);
-        return _a(s), new Ea(t, 
+        return _c(s), new Ec(t, 
         /* converter= */ null, new Lt(s));
     }
     {
-        if (!(t instanceof Ea || t instanceof Ra)) throw new j(Q.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof Ec || t instanceof Rc)) throw new j(Q.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(Tt.fromString(e, ...n));
-        return _a(s), new Ea(t.firestore, t instanceof Ra ? t.converter : null, new Lt(s));
+        return _c(s), new Ec(t.firestore, t instanceof Rc ? t.converter : null, new Lt(s));
     }
 }
 
@@ -16618,8 +16618,8 @@ function Va(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 va(t, e) {
-    return t = I(t), e = I(e), (t instanceof Ea || t instanceof Ra) && (e instanceof Ea || e instanceof Ra) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+ */ function vc(t, e) {
+    return t = I(t), e = I(e), (t instanceof Ec || t instanceof Rc) && (e instanceof Ec || e instanceof Rc) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -16630,8 +16630,8 @@ function Va(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 Sa(t, e) {
-    return t = I(t), e = I(e), t instanceof Aa && e instanceof Aa && (t.firestore === e.firestore && Ze(t._query, e._query) && t.converter === e.converter);
+ */ function Sc(t, e) {
+    return t = I(t), e = I(e), t instanceof Ac && e instanceof Ac && (t.firestore === e.firestore && Ze(t._query, e._query) && t.converter === e.converter);
 }
 
 /**
@@ -16649,42 +16649,42 @@ function Va(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 Da {
+ */ class Dc {
     constructor() {
         // The last promise in the queue.
-        this.jc = Promise.resolve(), 
+        this.Qa = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.Wc = [], 
+        this.ja = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.zc = !1, 
+        this.Wa = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.Hc = [], 
+        this.za = [], 
         // visible for testing
-        this.Jc = null, 
+        this.Ha = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.Yc = !1, 
+        this.Ja = !1, 
         // Enabled during shutdown on Safari to prevent future access to IndexedDB.
-        this.Xc = !1, 
+        this.Ya = !1, 
         // List of TimerIds to fast-forward delays for.
-        this.Zc = [], 
+        this.Xa = [], 
         // Backoff timer used to schedule retries for retryable operations
         this.Uo = new tu(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.ta = () => {
+        this.Za = () => {
             const t = Xo();
             t && F("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.Uo.ko();
         };
         const t = Xo();
-        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.ta);
+        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Za);
     }
     get isShuttingDown() {
-        return this.zc;
+        return this.Wa;
     }
     /**
      * Adds a new operation to the queue without waiting for it to complete (i.e.
@@ -16694,44 +16694,44 @@ function Va(t, e, ...n) {
         this.enqueue(t);
     }
     enqueueAndForgetEvenWhileRestricted(t) {
-        this.ea(), 
+        this.tc(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.na(t);
+        this.ec(t);
     }
     enterRestrictedMode(t) {
-        if (!this.zc) {
-            this.zc = !0, this.Xc = t || !1;
+        if (!this.Wa) {
+            this.Wa = !0, this.Ya = t || !1;
             const e = Xo();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.ta);
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Za);
         }
     }
     enqueue(t) {
-        if (this.ea(), this.zc) 
+        if (this.tc(), this.Wa) 
         // Return a Promise which never resolves.
         return new Promise((() => {}));
         // Create a deferred Promise that we can return to the callee. This
         // allows us to return a "hanging Promise" only to the callee and still
         // advance the queue even when the operation is not run.
                 const e = new W;
-        return this.na((() => this.zc && this.Xc ? Promise.resolve() : (t().then(e.resolve, e.reject), 
+        return this.ec((() => this.Wa && this.Ya ? Promise.resolve() : (t().then(e.resolve, e.reject), 
         e.promise))).then((() => e.promise));
     }
     enqueueRetryable(t) {
-        this.enqueueAndForget((() => (this.Wc.push(t), this.sa())));
+        this.enqueueAndForget((() => (this.ja.push(t), this.nc())));
     }
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
-     */    async sa() {
-        if (0 !== this.Wc.length) {
+     */    async nc() {
+        if (0 !== this.ja.length) {
             try {
-                await this.Wc[0](), this.Wc.shift(), this.Uo.reset();
+                await this.ja[0](), this.ja.shift(), this.Uo.reset();
             } catch (t) {
                 if (!vi(t)) throw t;
  // Failure will be handled by AsyncQueue
                                 F("AsyncQueue", "Operation failed with retryable error: " + t);
             }
-            this.Wc.length > 0 && 
+            this.ja.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
@@ -16742,12 +16742,12 @@ function Va(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.Uo.xo((() => this.sa()));
+            this.Uo.xo((() => this.nc()));
         }
     }
-    na(t) {
-        const e = this.jc.then((() => (this.Yc = !0, t().catch((t => {
-            this.Jc = t, this.Yc = !1;
+    ec(t) {
+        const e = this.Qa.then((() => (this.Ja = !0, t().catch((t => {
+            this.Ha = t, this.Ja = !1;
             const e = 
             /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -16779,38 +16779,38 @@ function Va(t, e, ...n) {
             // all further attempts to chain (via .then) will just short-circuit
             // and return the rejected Promise.
             throw $("INTERNAL UNHANDLED ERROR: ", e), t;
-        })).then((t => (this.Yc = !1, t))))));
-        return this.jc = e, e;
+        })).then((t => (this.Ja = !1, t))))));
+        return this.Qa = e, e;
     }
     enqueueAfterDelay(t, e, n) {
-        this.ea(), 
+        this.tc(), 
         // Fast-forward delays for timerIds that have been overriden.
-        this.Zc.indexOf(t) > -1 && (e = 0);
-        const s = Ou.createAndSchedule(this, t, e, n, (t => this.ia(t)));
-        return this.Hc.push(s), s;
+        this.Xa.indexOf(t) > -1 && (e = 0);
+        const s = Ou.createAndSchedule(this, t, e, n, (t => this.sc(t)));
+        return this.za.push(s), s;
     }
-    ea() {
-        this.Jc && U();
+    tc() {
+        this.Ha && U();
     }
     verifyOperationInProgress() {}
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
-     */    async ra() {
+     */    async ic() {
         // 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.jc, await t;
-        } while (t !== this.jc);
+            t = this.Qa, await t;
+        } while (t !== this.Qa);
     }
     /**
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
-     */    oa(t) {
-        for (const e of this.Hc) if (e.timerId === t) return !0;
+     */    rc(t) {
+        for (const e of this.za) if (e.timerId === t) return !0;
         return !1;
     }
     /**
@@ -16819,28 +16819,28 @@ function Va(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.
-     */    ua(t) {
+     */    oc(t) {
         // Note that draining may generate more delayed ops, so we do that first.
-        return this.ra().then((() => {
+        return this.ic().then((() => {
             // Run ops in the same order they'd run if they ran naturally.
-            this.Hc.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
-            for (const e of this.Hc) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
-            return this.ra();
+            this.za.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
+            for (const e of this.za) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
+            return this.ic();
         }));
     }
     /**
      * For Tests: Skip all subsequent delays for a timer id.
-     */    ca(t) {
-        this.Zc.push(t);
+     */    uc(t) {
+        this.Xa.push(t);
     }
-    /** Called once a DelayedOperation is run or canceled. */    ia(t) {
+    /** Called once a DelayedOperation is run or canceled. */    sc(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        const e = this.Hc.indexOf(t);
-        this.Hc.splice(e, 1);
+        const e = this.za.indexOf(t);
+        this.za.splice(e, 1);
     }
 }
 
-function Ca(t) {
+function Cc(t) {
     /**
  * Returns true if obj is an object and contains at least one of the specified
  * methods.
@@ -16875,7 +16875,7 @@ function Ca(t) {
  */ (t, [ "next", "error", "complete" ]);
 }
 
-class xa {
+class xc {
     constructor() {
         this._progressObserver = {}, this._taskCompletionResolver = new W, this._lastProgress = {
             taskState: "Running",
@@ -16959,27 +16959,27 @@ class xa {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** DOMException error code constants. */ const Na = -1;
+/** DOMException error code constants. */ const Nc = -1;
 
 /**
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
  */
-class ka extends Ia {
+class kc extends Ic {
     /** @hideconstructor */
     constructor(t, e, n) {
         super(t, e, n), 
         /**
          * Whether it's a {@link Firestore} or Firestore Lite instance.
          */
-        this.type = "firestore", this._queue = new Da, this._persistenceKey = "name" in t ? t.name : "[DEFAULT]";
+        this.type = "firestore", this._queue = new Dc, 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.
-        $a(this), this._firestoreClient.terminate();
+        $c(this), this._firestoreClient.terminate();
     }
 }
 
@@ -16993,7 +16993,7 @@ class ka extends Ia {
  * be associated.
  * @param settings - A settings object to configure the {@link Firestore} instance.
  * @returns A newly initialized {@link Firestore} instance.
- */ function Oa(t, e) {
+ */ function Oc(t, e) {
     const n = _getProvider(t, "firestore");
     if (n.isInitialized()) {
         const t = n.getImmediate(), s = n.getOptions();
@@ -17014,22 +17014,22 @@ class ka extends Ia {
  * @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 Ma(e = t()) {
+ */ function Mc(e = t()) {
     return _getProvider(e, "firestore").getImmediate();
 }
 
 /**
  * @internal
- */ function Fa(t) {
-    return t._firestoreClient || $a(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;
+ */ function Fc(t) {
+    return t._firestoreClient || $c(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;
 }
 
-function $a(t) {
+function $c(t) {
     var e;
     const n = t._freezeSettings(), s = function(t, e, n, s) {
         return new Ot(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 Qc(t._authCredentials, t._appCheckCredentials, t._queue, s);
+    t._firestoreClient = new Qa(t._authCredentials, t._appCheckCredentials, t._queue, s);
 }
 
 /**
@@ -17054,10 +17054,10 @@ function $a(t) {
  * @param persistenceSettings - Optional settings object to configure
  * persistence.
  * @returns A `Promise` that represents successfully enabling persistent storage.
- */ function Ba(t, e) {
-    Ha(t = ga(t, ka));
-    const n = Fa(t), s = t._freezeSettings(), i = new Bc;
-    return Ua(n, i, new Fc(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
+ */ function Bc(t, e) {
+    Hc(t = gc(t, kc));
+    const n = Fc(t), s = t._freezeSettings(), i = new Ba;
+    return Uc(n, i, new Fa(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
 }
 
 /**
@@ -17081,10 +17081,10 @@ function $a(t) {
  * @param firestore - The {@link Firestore} instance to enable persistence for.
  * @returns A `Promise` that represents successfully enabling persistent
  * storage.
- */ function La(t) {
-    Ha(t = ga(t, ka));
-    const e = Fa(t), n = t._freezeSettings(), s = new Bc;
-    return Ua(e, s, new $c(s, n.cacheSizeBytes));
+ */ function Lc(t) {
+    Hc(t = gc(t, kc));
+    const e = Fc(t), n = t._freezeSettings(), s = new Ba;
+    return Uc(e, s, new $a(s, n.cacheSizeBytes));
 }
 
 /**
@@ -17092,11 +17092,11 @@ function $a(t) {
  * If the operation fails with a recoverable error (see
  * `canRecoverFromIndexedDbError()` below), the returned Promise is rejected
  * but the client remains usable.
- */ function Ua(t, e, n) {
+ */ function Uc(t, e, n) {
     const s = new W;
     return t.asyncQueue.enqueue((async () => {
         try {
-            await jc(t, n), await Wc(t, e), s.resolve();
+            await ja(t, n), await Wa(t, e), s.resolve();
         } catch (t) {
             if (!
             /**
@@ -17150,7 +17150,7 @@ function $a(t) {
     })).then((() => s.promise));
 }
 
-function qa(t) {
+function qc(t) {
     if (t._initialized && !t._terminated) throw new j(Q.FAILED_PRECONDITION, "Persistence can only be cleared before a Firestore instance is initialized or after it is terminated.");
     const e = new W;
     return t._queue.enqueueAndForgetEvenWhileRestricted((async () => {
@@ -17181,11 +17181,11 @@ function qa(t) {
  *
  * @returns A `Promise` which resolves when all currently pending writes have been
  * acknowledged by the backend.
- */ function Ka(t) {
+ */ function Kc(t) {
     return function(t) {
         const e = new W;
-        return t.asyncQueue.enqueueAndForget((async () => dc(await Zc(t), e))), e.promise;
-    }(Fa(t = ga(t, ka)));
+        return t.asyncQueue.enqueueAndForget((async () => da(await Za(t), e))), e.promise;
+    }(Fc(t = gc(t, kc)));
 }
 
 /**
@@ -17193,8 +17193,8 @@ function qa(t) {
  * call to {@link disableNetwork}.
  *
  * @returns A `Promise` that is resolved once the network has been enabled.
- */ function Ga(t) {
-    return ea(Fa(t = ga(t, ka)));
+ */ function Gc(t) {
+    return ec(Fc(t = gc(t, kc)));
 }
 
 /**
@@ -17204,8 +17204,8 @@ function qa(t) {
  * operations will be queued until the network is restored.
  *
  * @returns A `Promise` that is resolved once the network has been disabled.
- */ function Qa(t) {
-    return na(Fa(t = ga(t, ka)));
+ */ function Qc(t) {
+    return nc(Fc(t = gc(t, kc)));
 }
 
 /**
@@ -17229,7 +17229,7 @@ function qa(t) {
  *
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function ja(t) {
+ */ function jc(t) {
     return e(t.app, "firestore"), t._delete();
 }
 
@@ -17243,9 +17243,9 @@ function qa(t) {
  * @returns A `LoadBundleTask` object, which notifies callers with progress
  * updates, and completion or error events. It can be used as a
  * `Promise<LoadBundleTaskProgress>`.
- */ function Wa(t, e) {
-    const n = Fa(t = ga(t, ka)), s = new xa;
-    return aa(n, t._databaseId, e, s), s;
+ */ function Wc(t, e) {
+    const n = Fc(t = gc(t, kc)), s = new xc;
+    return cc(n, t._databaseId, e, s), s;
 }
 
 /**
@@ -17259,11 +17259,11 @@ function qa(t) {
  * @param firestore - The {@link Firestore} instance to read the query from.
  * @param name - The name of the query.
  * @returns A `Promise` that is resolved with the Query or `null`.
- */ function za(t, e) {
-    return ha(Fa(t = ga(t, ka)), e).then((e => e ? new Aa(t, null, e.query) : null));
+ */ function zc(t, e) {
+    return hc(Fc(t = gc(t, kc)), e).then((e => e ? new Ac(t, null, e.query) : null));
 }
 
-function Ha(t) {
+function Hc(t) {
     if (t._initialized || t._terminated) throw new j(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.");
 }
 
@@ -17307,7 +17307,7 @@ function Ha(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 Ja {
+class Jc {
     /**
      * 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.
@@ -17331,8 +17331,8 @@ class Ja {
 /**
  * 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 Ya() {
-    return new Ja("__name__");
+ */ function Yc() {
+    return new Jc("__name__");
 }
 
 /**
@@ -17353,7 +17353,7 @@ class Ja {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class Xa {
+ */ class Xc {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -17365,7 +17365,7 @@ class Ja {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new Xa(Vt.fromBase64String(t));
+            return new Xc(Vt.fromBase64String(t));
         } catch (t) {
             throw new j(Q.INVALID_ARGUMENT, "Failed to construct data from Base64 string: " + t);
         }
@@ -17375,7 +17375,7 @@ class Ja {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new Xa(Vt.fromUint8Array(t));
+        return new Xc(Vt.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -17427,7 +17427,7 @@ class Ja {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class Za {
+ */ class Zc {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -17581,55 +17581,55 @@ function ih(t) {
         this.settings = t, this.databaseId = e, this.O = 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.aa(), this.fieldTransforms = i || [], this.fieldMask = r || [];
+        void 0 === i && this.ac(), this.fieldTransforms = i || [], this.fieldMask = r || [];
     }
     get path() {
         return this.settings.path;
     }
-    get ha() {
-        return this.settings.ha;
+    get cc() {
+        return this.settings.cc;
     }
-    /** Returns a new context with the specified settings overwritten. */    la(t) {
+    /** Returns a new context with the specified settings overwritten. */    hc(t) {
         return new rh(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.O, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
-    fa(t) {
+    lc(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.la({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.hc({
             path: n,
-            da: !1
+            fc: !1
         });
-        return s._a(t), s;
+        return s.dc(t), s;
     }
-    wa(t) {
+    _c(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.la({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), s = this.hc({
             path: n,
-            da: !1
+            fc: !1
         });
-        return s.aa(), s;
+        return s.ac(), s;
     }
-    ma(t) {
+    wc(t) {
         // TODO(b/34871131): We don't support array paths right now; so make path
         // undefined.
-        return this.la({
+        return this.hc({
             path: void 0,
-            da: !0
+            fc: !0
         });
     }
-    ga(t) {
-        return Ph(t, this.settings.methodName, this.settings.ya || !1, this.path, this.settings.pa);
+    mc(t) {
+        return Ph(t, this.settings.methodName, this.settings.gc || !1, this.path, this.settings.yc);
     }
     /** 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)));
     }
-    aa() {
+    ac() {
         // 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._a(this.path.get(t));
+        if (this.path) for (let t = 0; t < this.path.length; t++) this.dc(this.path.get(t));
     }
-    _a(t) {
-        if (0 === t.length) throw this.ga("Document fields must not be empty");
-        if (ih(this.ha) && eh.test(t)) throw this.ga('Document fields cannot begin and end with "__"');
+    dc(t) {
+        if (0 === t.length) throw this.mc("Document fields must not be empty");
+        if (ih(this.cc) && eh.test(t)) throw this.mc('Document fields cannot begin and end with "__"');
     }
 }
 
@@ -17640,14 +17640,14 @@ function ih(t) {
     constructor(t, e, n) {
         this.databaseId = t, this.ignoreUndefinedProperties = e, this.O = n || Zo(t);
     }
-    /** Creates a new top-level parse context. */    Ia(t, e, n, s = !1) {
+    /** Creates a new top-level parse context. */    Ic(t, e, n, s = !1) {
         return new rh({
-            ha: t,
+            cc: t,
             methodName: e,
-            pa: n,
+            yc: n,
             path: At.emptyPath(),
-            da: !1,
-            ya: s
+            fc: !1,
+            gc: s
         }, this.databaseId, this.O, this.ignoreUndefinedProperties);
     }
 }
@@ -17657,32 +17657,32 @@ function uh(t) {
     return new oh(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function ch(t, e, n, s, i, r = {}) {
-    const o = t.Ia(r.merge || r.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
+/** Parse document data from a set() call. */ function ah(t, e, n, s, i, r = {}) {
+    const o = t.Ic(r.merge || r.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
     Th("Data must be an object, but it was:", o, s);
     const u = ph(s, o);
-    let c, a;
-    if (r.merge) c = new Rt(o.fieldMask), a = o.fieldTransforms; else if (r.mergeFields) {
+    let a, c;
+    if (r.merge) a = new Rt(o.fieldMask), c = o.fieldTransforms; else if (r.mergeFields) {
         const t = [];
         for (const s of r.mergeFields) {
             const i = Eh(e, s, n);
             if (!o.contains(i)) throw new j(Q.INVALID_ARGUMENT, `Field '${i}' is specified in your field mask but missing from your input data.`);
             bh(t, i) || t.push(i);
         }
-        c = new Rt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
-    } else c = null, a = o.fieldTransforms;
-    return new nh(new ce(u), c, a);
+        a = new Rt(t), c = o.fieldTransforms.filter((t => a.covers(t.field)));
+    } else a = null, c = o.fieldTransforms;
+    return new nh(new ae(u), a, c);
 }
 
-class ah extends Za {
+class ch extends Zc {
     _toFieldTransform(t) {
-        if (2 /* MergeSet */ !== t.ha) throw 1 /* Update */ === t.ha ? t.ga(`${this._methodName}() can only appear at the top level of your update data`) : t.ga(`${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;
     }
     isEqual(t) {
-        return t instanceof ah;
+        return t instanceof ch;
     }
 }
 
@@ -17703,14 +17703,14 @@ class ah extends Za {
  * @param arrayElement - Whether or not the FieldValue has an array.
  */ function hh(t, e, n) {
     return new rh({
-        ha: 3 /* Argument */ ,
-        pa: e.settings.pa,
+        cc: 3 /* Argument */ ,
+        yc: e.settings.yc,
         methodName: t._methodName,
-        da: n
+        fc: n
     }, e.databaseId, e.O, e.ignoreUndefinedProperties);
 }
 
-class lh extends Za {
+class lh extends Zc {
     _toFieldTransform(t) {
         return new En(t.path, new _n);
     }
@@ -17719,13 +17719,13 @@ class lh extends Za {
     }
 }
 
-class fh extends Za {
+class fh extends Zc {
     constructor(t, e) {
-        super(t), this.Ta = e;
+        super(t), this.Tc = e;
     }
     _toFieldTransform(t) {
         const e = hh(this, t, 
-        /*array=*/ !0), n = this.Ta.map((t => yh(t, e))), s = new wn(n);
+        /*array=*/ !0), n = this.Tc.map((t => yh(t, e))), s = new wn(n);
         return new En(t.path, s);
     }
     isEqual(t) {
@@ -17734,13 +17734,13 @@ class fh extends Za {
     }
 }
 
-class dh extends Za {
+class dh extends Zc {
     constructor(t, e) {
-        super(t), this.Ta = e;
+        super(t), this.Tc = e;
     }
     _toFieldTransform(t) {
         const e = hh(this, t, 
-        /*array=*/ !0), n = this.Ta.map((t => yh(t, e))), s = new gn(n);
+        /*array=*/ !0), n = this.Tc.map((t => yh(t, e))), s = new gn(n);
         return new En(t.path, s);
     }
     isEqual(t) {
@@ -17749,12 +17749,12 @@ class dh extends Za {
     }
 }
 
-class _h extends Za {
+class _h extends Zc {
     constructor(t, e) {
-        super(t), this.Ea = e;
+        super(t), this.Ec = e;
     }
     _toFieldTransform(t) {
-        const e = new pn(t.O, an(t.O, this.Ea));
+        const e = new pn(t.O, cn(t.O, this.Ec));
         return new En(t.path, e);
     }
     isEqual(t) {
@@ -17764,19 +17764,19 @@ class _h extends Za {
 }
 
 /** Parse update data from an update() call. */ function wh(t, e, n, s) {
-    const i = t.Ia(1 /* Update */ , e, n);
+    const i = t.Ic(1 /* Update */ , e, n);
     Th("Data must be an object, but it was:", i, s);
-    const r = [], o = ce.empty();
+    const r = [], o = ae.empty();
     ft(s, ((t, s) => {
         const u = Rh(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 s = I(s);
-        const c = i.wa(u);
-        if (s instanceof ah) 
+        const a = i._c(u);
+        if (s instanceof ch) 
         // Add it to the field mask, but don't add anything to updateData.
         r.push(u); else {
-            const t = yh(s, c);
+            const t = yh(s, a);
             null != t && (r.push(u), o.set(u, t));
         }
     }));
@@ -17785,27 +17785,27 @@ class _h extends Za {
 }
 
 /** Parse update data from a list of field/value arguments. */ function mh(t, e, n, s, i, r) {
-    const o = t.Ia(1 /* Update */ , e, n), u = [ Eh(e, s, n) ], c = [ i ];
+    const o = t.Ic(1 /* Update */ , e, n), u = [ Eh(e, s, n) ], a = [ i ];
     if (r.length % 2 != 0) throw new j(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) u.push(Eh(e, r[t])), c.push(r[t + 1]);
-    const a = [], h = ce.empty();
+    for (let t = 0; t < r.length; t += 2) u.push(Eh(e, r[t])), a.push(r[t + 1]);
+    const c = [], h = ae.empty();
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
-    for (let t = u.length - 1; t >= 0; --t) if (!bh(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!bh(c, u[t])) {
         const e = u[t];
-        let n = c[t];
+        let n = a[t];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 n = I(n);
-        const s = o.wa(e);
-        if (n instanceof ah) 
+        const s = o._c(e);
+        if (n instanceof ch) 
         // Add it to the field mask, but don't add anything to updateData.
-        a.push(e); else {
+        c.push(e); else {
             const t = yh(n, s);
-            null != t && (a.push(e), h.set(e, t));
+            null != t && (c.push(e), h.set(e, t));
         }
     }
-    const l = new Rt(a);
+    const l = new Rt(c);
     return new sh(h, l, o.fieldTransforms);
 }
 
@@ -17816,7 +17816,7 @@ class _h extends Za {
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
  */ function gh(t, e, n, s = !1) {
-    return yh(n, t.Ia(s ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+    return yh(n, t.Ic(s ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -17832,7 +17832,7 @@ class _h extends Za {
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
     t = I(t))) return Th("Unsupported field value:", e, t), ph(t, e);
-    if (t instanceof Za) 
+    if (t instanceof Zc) 
     // FieldValues usually parse into transforms (except deleteField())
     // 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
@@ -17844,8 +17844,8 @@ class _h extends Za {
  */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!ih(e.ha)) throw e.ga(`${t._methodName}() can only be used with update() and set()`);
-        if (!e.path) throw e.ga(`${t._methodName}() is not currently supported inside arrays`);
+        if (!ih(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);
     }
@@ -17869,12 +17869,12 @@ class _h extends Za {
         // 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.da && 4 /* ArrayArgument */ !== e.ha) throw e.ga("Nested arrays are not supported");
+        if (e.settings.fc && 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 = yh(i, e.ma(s));
+                let t = yh(i, e.wc(s));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -17893,7 +17893,7 @@ class _h extends Za {
         if (null === (t = I(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return an(e.O, t);
+        if ("number" == typeof t) return cn(e.O, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -17901,16 +17901,16 @@ class _h extends Za {
             stringValue: t
         };
         if (t instanceof Date) {
-            const n = at.fromDate(t);
+            const n = ct.fromDate(t);
             return {
                 timestampValue: ms(e.O, n)
             };
         }
-        if (t instanceof at) {
+        if (t instanceof ct) {
             // Firestore backend truncates precision down to microseconds. To ensure
             // offline mode works the same with regards to truncation, perform the
             // truncation immediately without waiting for the backend to do that.
-            const n = new at(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            const n = new ct(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
                 timestampValue: ms(e.O, n)
             };
@@ -17921,17 +17921,17 @@ class _h extends Za {
                 longitude: t.longitude
             }
         };
-        if (t instanceof Xa) return {
+        if (t instanceof Xc) return {
             bytesValue: gs(e.O, t._byteString)
         };
-        if (t instanceof Ea) {
+        if (t instanceof Ec) {
             const n = e.databaseId, s = t.firestore._databaseId;
-            if (!s.isEqual(n)) throw e.ga(`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: Is(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.ga(`Unsupported field value: ${ma(t)}`);
+        throw e.mc(`Unsupported field value: ${mc(t)}`);
     }
     /**
  * Checks whether an object looks like a JSON object that should be converted
@@ -17948,7 +17948,7 @@ function ph(t, e) {
     // If we encounter an empty object, we explicitly add it to the update
     // mask to ensure that the server creates a map entry.
     e.path && e.path.length > 0 && e.fieldMask.push(e.path) : ft(t, ((t, s) => {
-        const i = yh(s, e.fa(t));
+        const i = yh(s, e.lc(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -17958,15 +17958,15 @@ function ph(t, e) {
 }
 
 function Ih(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof at || t instanceof th || t instanceof Xa || t instanceof Ea || t instanceof Za);
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof ct || t instanceof th || t instanceof Xc || t instanceof Ec || t instanceof Zc);
 }
 
 function Th(t, e, n) {
     if (!Ih(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
-        const s = ma(n);
-        throw "an object" === s ? e.ga(t + " a custom object") : e.ga(t + " " + s);
+        const s = mc(n);
+        throw "an object" === s ? e.mc(t + " a custom object") : e.mc(t + " " + s);
     }
 }
 
@@ -17976,7 +17976,7 @@ function Th(t, e, n) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    e = I(e)) instanceof Ja) return e._internalPath;
+    e = I(e)) instanceof Jc) return e._internalPath;
     if ("string" == typeof e) return Rh(t, e);
     throw Ph("Field path arguments must be of type string or ", t, 
     /* hasConverter= */ !1, 
@@ -18000,7 +18000,7 @@ function Th(t, e, n) {
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return new Ja(...e.split("."))._internalPath;
+        return new Jc(...e.split("."))._internalPath;
     } catch (s) {
         throw Ph(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
@@ -18012,9 +18012,9 @@ function Ph(t, e, n, s, i) {
     const r = s && !s.isEmpty(), o = void 0 !== i;
     let u = `Function ${e}() called with invalid data`;
     n && (u += " (via `toFirestore()`)"), u += ". ";
-    let c = "";
-    return (r || o) && (c += " (found", r && (c += ` in field ${s}`), o && (c += ` in document ${i}`), 
-    c += ")"), new j(Q.INVALID_ARGUMENT, u + t + c);
+    let a = "";
+    return (r || o) && (a += " (found", r && (a += ` in field ${s}`), o && (a += ` in document ${i}`), 
+    a += ")"), new j(Q.INVALID_ARGUMENT, u + t + a);
 }
 
 /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function bh(t, e) {
@@ -18061,7 +18061,7 @@ function Ph(t, e, n, s, i) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new Ea(this._firestore, this._converter, this._key);
+        return new Ec(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -18132,7 +18132,7 @@ function Ph(t, e, n, s, i) {
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */ function Sh(t, e) {
-    return "string" == typeof e ? Rh(t, e) : e instanceof Ja ? e._internalPath : e._delegate._internalPath;
+    return "string" == typeof e ? Rh(t, e) : e instanceof Jc ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -18368,7 +18368,7 @@ function kh(t) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */ function Oh(t, e) {
-    return t instanceof Ch && e instanceof Ch ? 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 Nh && e instanceof Nh && (t._firestore === e._firestore && Sa(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
+    return t instanceof Ch && e instanceof Ch ? 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 Nh && e instanceof Nh && (t._firestore === e._firestore && Sc(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot));
 }
 
 /**
@@ -18414,7 +18414,7 @@ function kh(t) {
 
 class Bh extends Fh {
     constructor(t, e, n) {
-        super(), this.Aa = t, this.Ra = e, this.Pa = n, this.type = "where";
+        super(), this.Ac = t, this.Rc = e, this.Pc = n, this.type = "where";
     }
     _apply(t) {
         const e = uh(t.firestore), n = function(t, e, n, s, i, r, o) {
@@ -18434,7 +18434,7 @@ class Bh extends Fh {
             } else "in" /* IN */ !== r && "not-in" /* NOT_IN */ !== r && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== r || tl(o, r), 
             u = gh(n, e, o, 
             /* allowArrays= */ "in" /* IN */ === r || "not-in" /* NOT_IN */ === r);
-            const c = Se.create(i, r, u);
+            const a = Se.create(i, r, u);
             return function(t, e) {
                 if (e.S()) {
                     const n = ze(t);
@@ -18482,9 +18482,9 @@ class Bh extends Fh {
                 if (null !== n) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
                 throw n === e.op ? new j(Q.INVALID_ARGUMENT, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new j(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.Aa, this.Ra, this.Pa);
-        return new Aa(t.firestore, t.converter, function(t, e) {
+            }(t, a), a;
+        }(t._query, "where", e, t.firestore._databaseId, this.Ac, this.Rc, this.Pc);
+        return new Ac(t.firestore, t.converter, function(t, e) {
             const n = t.filters.concat([ e ]);
             return new Ke(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
@@ -18508,7 +18508,7 @@ class Bh extends Fh {
 
 class Uh extends Fh {
     constructor(t, e) {
-        super(), this.Aa = t, this.ba = e, this.type = "orderBy";
+        super(), this.Ac = t, this.bc = e, this.type = "orderBy";
     }
     _apply(t) {
         const e = function(t, e, n) {
@@ -18533,8 +18533,8 @@ class Uh extends Fh {
  * 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.Aa, this.ba);
-        return new Aa(t.firestore, t.converter, function(t, e) {
+ */ (t._query, this.Ac, this.bc);
+        return new Ac(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 Ke(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
@@ -18557,10 +18557,10 @@ class Uh extends Fh {
 
 class Kh extends Fh {
     constructor(t, e, n) {
-        super(), this.type = t, this.Va = e, this.va = n;
+        super(), this.type = t, this.Vc = e, this.vc = n;
     }
     _apply(t) {
-        return new Aa(t.firestore, t.converter, Xe(t._query, this.Va, this.va));
+        return new Ac(t.firestore, t.converter, Xe(t._query, this.Vc, this.vc));
     }
 }
 
@@ -18570,7 +18570,7 @@ class Kh extends Fh {
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
  */ function Gh(t) {
-    return ya("limit", t), new Kh("limit", t, "F" /* First */);
+    return yc("limit", t), new Kh("limit", t, "F" /* First */);
 }
 
 /**
@@ -18582,16 +18582,16 @@ class Kh extends Fh {
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
  */ function Qh(t) {
-    return ya("limitToLast", t), new Kh("limitToLast", t, "L" /* Last */);
+    return yc("limitToLast", t), new Kh("limitToLast", t, "L" /* Last */);
 }
 
 class jh extends Fh {
     constructor(t, e, n) {
-        super(), this.type = t, this.Sa = e, this.Da = n;
+        super(), this.type = t, this.Sc = e, this.Dc = n;
     }
     _apply(t) {
-        const e = Xh(t, this.type, this.Sa, this.Da);
-        return new Aa(t.firestore, t.converter, function(t, e) {
+        const e = Xh(t, this.type, this.Sc, this.Dc);
+        return new Ac(t.firestore, t.converter, function(t, e) {
             return new Ke(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
@@ -18609,11 +18609,11 @@ function zh(...t) {
 
 class Hh extends Fh {
     constructor(t, e, n) {
-        super(), this.type = t, this.Sa = e, this.Da = n;
+        super(), this.type = t, this.Sc = e, this.Dc = n;
     }
     _apply(t) {
-        const e = Xh(t, this.type, this.Sa, this.Da);
-        return new Aa(t.firestore, t.converter, function(t, e) {
+        const e = Xh(t, this.type, this.Sc, this.Dc);
+        return new Ac(t.firestore, t.converter, function(t, e) {
             return new Ke(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
@@ -18661,16 +18661,16 @@ function Yh(...t) {
             if (i.length > o.length) throw new j(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 u = [];
             for (let r = 0; r < i.length; r++) {
-                const c = i[r];
+                const a = i[r];
                 if (o[r].field.isKeyField()) {
-                    if ("string" != typeof c) throw new j(Q.INVALID_ARGUMENT, `Invalid query. Expected a string for document ID in ${s}(), but got a ${typeof c}`);
-                    if (!He(t) && -1 !== c.indexOf("/")) throw new j(Q.INVALID_ARGUMENT, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${s}() must be a plain document ID, but '${c}' contains a slash.`);
-                    const n = t.path.child(Tt.fromString(c));
+                    if ("string" != typeof a) throw new j(Q.INVALID_ARGUMENT, `Invalid query. Expected a string for document ID in ${s}(), but got a ${typeof a}`);
+                    if (!He(t) && -1 !== a.indexOf("/")) throw new j(Q.INVALID_ARGUMENT, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${s}() must be a plain document ID, but '${a}' contains a slash.`);
+                    const n = t.path.child(Tt.fromString(a));
                     if (!Lt.isDocumentKey(n)) throw new j(Q.INVALID_ARGUMENT, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${s}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
                     const i = new Lt(n);
                     u.push(Jt(e, i));
                 } else {
-                    const t = gh(n, s, c);
+                    const t = gh(n, s, a);
                     u.push(t);
                 }
             }
@@ -18692,8 +18692,8 @@ function Zh(t, e, n) {
         if (!Lt.isDocumentKey(s)) throw new j(Q.INVALID_ARGUMENT, `Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '${s}' is not because it has an odd number of segments (${s.length}).`);
         return Jt(t, new Lt(s));
     }
-    if (n instanceof Ea) return Jt(t, n._key);
-    throw new j(Q.INVALID_ARGUMENT, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${ma(n)}.`);
+    if (n instanceof Ec) return Jt(t, n._key);
+    throw new j(Q.INVALID_ARGUMENT, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${mc(n)}.`);
 }
 
 /**
@@ -18816,7 +18816,7 @@ class sl {
     }
     convertTimestamp(t) {
         const e = St(t);
-        return new at(e.seconds, e.nanos);
+        return new ct(e.seconds, e.nanos);
     }
     convertDocumentKey(t, e) {
         const n = Tt.fromString(t);
@@ -18867,11 +18867,11 @@ class rl extends sl {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new Xa(t);
+        return new Xc(t);
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new Ea(this.firestore, /* converter= */ null, e);
+        return new Ec(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -18906,7 +18906,7 @@ class rl extends sl {
     }
     set(t, e, n) {
         this._verifyNotCommitted();
-        const s = ul(t, this._firestore), i = il(s.converter, e, n), r = ch(this._dataReader, "WriteBatch.set", s._key, i, null !== s.converter, n);
+        const s = ul(t, this._firestore), i = il(s.converter, e, n), r = ah(this._dataReader, "WriteBatch.set", s._key, i, null !== s.converter, n);
         return this._mutations.push(r.toMutation(s._key, Pn.none())), this;
     }
     update(t, e, n, ...s) {
@@ -18915,7 +18915,7 @@ class rl extends sl {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let r;
-        return r = "string" == typeof (e = I(e)) || e instanceof Ja ? mh(this._dataReader, "WriteBatch.update", i._key, e, n, s) : wh(this._dataReader, "WriteBatch.update", i._key, e), 
+        return r = "string" == typeof (e = I(e)) || e instanceof Jc ? mh(this._dataReader, "WriteBatch.update", i._key, e, n, s) : wh(this._dataReader, "WriteBatch.update", i._key, e), 
         this._mutations.push(r.toMutation(i._key, Pn.exists(!0))), this;
     }
     /**
@@ -19005,22 +19005,22 @@ function ul(t, e) {
  * @returns A Promise resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */
-function cl(t) {
-    t = ga(t, Ea);
-    const e = ga(t.firestore, ka);
-    return ia(Fa(e), t._key).then((n => El(e, t, n)));
+function al(t) {
+    t = gc(t, Ec);
+    const e = gc(t.firestore, kc);
+    return ic(Fc(e), t._key).then((n => El(e, t, n)));
 }
 
-class al extends sl {
+class cl extends sl {
     constructor(t) {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new Xa(t);
+        return new Xc(t);
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new Ea(this.firestore, /* converter= */ null, e);
+        return new Ec(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -19031,9 +19031,9 @@ class al extends sl {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function hl(t) {
-    t = ga(t, Ea);
-    const e = ga(t.firestore, ka), n = Fa(e), s = new al(e);
-    return sa(n, t._key).then((n => new Ch(e, s, t._key, n, new Dh(null !== n && n.hasLocalMutations, 
+    t = gc(t, Ec);
+    const e = gc(t.firestore, kc), n = Fc(e), s = new cl(e);
+    return sc(n, t._key).then((n => new Ch(e, s, t._key, n, new Dh(null !== n && n.hasLocalMutations, 
     /* fromCache= */ !0), t.converter)));
 }
 
@@ -19044,9 +19044,9 @@ class al extends sl {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function ll(t) {
-    t = ga(t, Ea);
-    const e = ga(t.firestore, ka);
-    return ia(Fa(e), t._key, {
+    t = gc(t, Ec);
+    const e = gc(t.firestore, kc);
+    return ic(Fc(e), t._key, {
         source: "server"
     }).then((n => El(e, t, n)));
 }
@@ -19061,9 +19061,9 @@ class al extends sl {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function fl(t) {
-    t = ga(t, Aa);
-    const e = ga(t.firestore, ka), n = Fa(e), s = new al(e);
-    return Mh(t._query), oa(n, t._query).then((n => new Nh(e, s, t, n)));
+    t = gc(t, Ac);
+    const e = gc(t.firestore, kc), n = Fc(e), s = new cl(e);
+    return Mh(t._query), oc(n, t._query).then((n => new Nh(e, s, t, n)));
 }
 
 /**
@@ -19072,9 +19072,9 @@ class al extends sl {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function dl(t) {
-    t = ga(t, Aa);
-    const e = ga(t.firestore, ka), n = Fa(e), s = new al(e);
-    return ra(n, t._query).then((n => new Nh(e, s, t, n)));
+    t = gc(t, Ac);
+    const e = gc(t.firestore, kc), n = Fc(e), s = new cl(e);
+    return rc(n, t._query).then((n => new Nh(e, s, t, n)));
 }
 
 /**
@@ -19083,27 +19083,27 @@ class al extends sl {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function _l(t) {
-    t = ga(t, Aa);
-    const e = ga(t.firestore, ka), n = Fa(e), s = new al(e);
-    return oa(n, t._query, {
+    t = gc(t, Ac);
+    const e = gc(t.firestore, kc), n = Fc(e), s = new cl(e);
+    return oc(n, t._query, {
         source: "server"
     }).then((n => new Nh(e, s, t, n)));
 }
 
 function wl(t, e, n) {
-    t = ga(t, Ea);
-    const s = ga(t.firestore, ka), i = il(t.converter, e, n);
-    return Tl(s, [ ch(uh(s), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Pn.none()) ]);
+    t = gc(t, Ec);
+    const s = gc(t.firestore, kc), i = il(t.converter, e, n);
+    return Tl(s, [ ah(uh(s), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Pn.none()) ]);
 }
 
 function ml(t, e, n, ...s) {
-    t = ga(t, Ea);
-    const i = ga(t.firestore, ka), r = uh(i);
+    t = gc(t, Ec);
+    const i = gc(t.firestore, kc), r = uh(i);
     let o;
     o = "string" == typeof (
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-    e = I(e)) || e instanceof Ja ? mh(r, "updateDoc", t._key, e, n, s) : wh(r, "updateDoc", t._key, e);
+    e = I(e)) || e instanceof Jc ? mh(r, "updateDoc", t._key, e, n, s) : wh(r, "updateDoc", t._key, e);
     return Tl(i, [ o.toMutation(t._key, Pn.exists(!0)) ]);
 }
 
@@ -19114,7 +19114,7 @@ function ml(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 gl(t) {
-    return Tl(ga(t.firestore, ka), [ new $n(t._key, Pn.none()) ]);
+    return Tl(gc(t.firestore, kc), [ new $n(t._key, Pn.none()) ]);
 }
 
 /**
@@ -19127,8 +19127,8 @@ function ml(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 yl(t, e) {
-    const n = ga(t.firestore, ka), s = Va(t), i = il(t.converter, e);
-    return Tl(n, [ ch(uh(t.firestore), "addDoc", s._key, i, null !== t.converter, {}).toMutation(s._key, Pn.exists(!1)) ]).then((() => s));
+    const n = gc(t.firestore, kc), s = Vc(t), i = il(t.converter, e);
+    return Tl(n, [ ah(uh(t.firestore), "addDoc", s._key, i, null !== t.converter, {}).toMutation(s._key, Pn.exists(!1)) ]).then((() => s));
 }
 
 function pl(t, ...e) {
@@ -19137,44 +19137,44 @@ function pl(t, ...e) {
     let r = {
         includeMetadataChanges: !1
     }, o = 0;
-    "object" != typeof e[o] || Ca(e[o]) || (r = e[o], o++);
+    "object" != typeof e[o] || Cc(e[o]) || (r = e[o], o++);
     const u = {
         includeMetadataChanges: r.includeMetadataChanges
     };
-    if (Ca(e[o])) {
+    if (Cc(e[o])) {
         const t = e[o];
         e[o] = null === (n = t.next) || void 0 === n ? void 0 : n.bind(t), e[o + 1] = null === (s = t.error) || void 0 === s ? void 0 : s.bind(t), 
         e[o + 2] = null === (i = t.complete) || void 0 === i ? void 0 : i.bind(t);
     }
-    let c, a, h;
-    if (t instanceof Ea) a = ga(t.firestore, ka), h = Qe(t._key.path), c = {
+    let a, c, h;
+    if (t instanceof Ec) c = gc(t.firestore, kc), h = Qe(t._key.path), a = {
         next: n => {
-            e[o] && e[o](El(a, t, n));
+            e[o] && e[o](El(c, t, n));
         },
         error: e[o + 1],
         complete: e[o + 2]
     }; else {
-        const n = ga(t, Aa);
-        a = ga(n.firestore, ka), h = n._query;
-        const s = new al(a);
-        c = {
+        const n = gc(t, Ac);
+        c = gc(n.firestore, kc), h = n._query;
+        const s = new cl(c);
+        a = {
             next: t => {
-                e[o] && e[o](new Nh(a, s, n, t));
+                e[o] && e[o](new Nh(c, s, n, t));
             },
             error: e[o + 1],
             complete: e[o + 2]
         }, Mh(t._query);
     }
     return function(t, e, n, s) {
-        const i = new Uc(s), r = new Wu(e, i, n);
-        return t.asyncQueue.enqueueAndForget((async () => qu(await ta(t), r))), () => {
-            i.xc(), t.asyncQueue.enqueueAndForget((async () => Ku(await ta(t), r)));
+        const i = new Ua(s), r = new Wu(e, i, n);
+        return t.asyncQueue.enqueueAndForget((async () => qu(await tc(t), r))), () => {
+            i.Ca(), t.asyncQueue.enqueueAndForget((async () => Ku(await tc(t), r)));
         };
-    }(Fa(a), h, u, c);
+    }(Fc(c), h, u, a);
 }
 
 function Il(t, e) {
-    return ua(Fa(t = ga(t, ka)), Ca(e) ? e : {
+    return uc(Fc(t = gc(t, kc)), Cc(e) ? e : {
         next: e
     });
 }
@@ -19185,15 +19185,15 @@ function Il(t, e) {
  */ function Tl(t, e) {
     return function(t, e) {
         const n = new W;
-        return t.asyncQueue.enqueueAndForget((async () => uc(await Zc(t), e, n))), n.promise;
-    }(Fa(t), e);
+        return t.asyncQueue.enqueueAndForget((async () => ua(await Za(t), e, n))), n.promise;
+    }(Fc(t), e);
 }
 
 /**
  * Converts a {@link ViewSnapshot} that contains the single document specified by `ref`
  * to a {@link DocumentSnapshot}.
  */ function El(t, e, n) {
-    const s = n.docs.get(e._key), i = new al(t);
+    const s = n.docs.get(e._key), i = new cl(t);
     return new Ch(t, i, e._key, s, new Dh(n.hasPendingWrites, n.fromCache), e.converter);
 }
 
@@ -19240,7 +19240,7 @@ function Il(t, e) {
         }));
     }
     set(t, e, n) {
-        const s = ul(t, this._firestore), i = il(s.converter, e, n), r = ch(this._dataReader, "Transaction.set", s._key, i, null !== s.converter, n);
+        const s = ul(t, this._firestore), i = il(s.converter, e, n), r = ah(this._dataReader, "Transaction.set", s._key, i, null !== s.converter, n);
         return this._transaction.set(s._key, r), this;
     }
     update(t, e, n, ...s) {
@@ -19248,7 +19248,7 @@ function Il(t, e) {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let r;
-        return r = "string" == typeof (e = I(e)) || e instanceof Ja ? mh(this._dataReader, "Transaction.update", i._key, e, n, s) : wh(this._dataReader, "Transaction.update", i._key, e), 
+        return r = "string" == typeof (e = I(e)) || e instanceof Jc ? mh(this._dataReader, "Transaction.update", i._key, e, n, s) : wh(this._dataReader, "Transaction.update", i._key, e), 
         this._transaction.update(i._key, r), this;
     }
     /**
@@ -19273,7 +19273,7 @@ function Il(t, e) {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const e = ul(t, this._firestore), n = new al(this._firestore);
+        const e = ul(t, this._firestore), n = new cl(this._firestore);
         return super.get(t).then((t => new Ch(this._firestore, n, e._key, t._document, new Dh(
         /* hasPendingWrites= */ !1, 
         /* fromCache= */ !1), e.converter)));
@@ -19299,12 +19299,12 @@ function Il(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */ function Rl(t, e, n) {
-    t = ga(t, ka);
+    t = gc(t, kc);
     const s = Object.assign(Object.assign({}, nl), n);
     !function(t) {
         if (t.maxAttempts < 1) throw new j(Q.INVALID_ARGUMENT, "Max attempts must be at least 1");
     }(s);
-    return ca(Fa(t), (n => e(new Al(t, n))), s);
+    return ac(Fc(t), (n => e(new Al(t, n))), s);
 }
 
 /**
@@ -19327,7 +19327,7 @@ function Il(t, e) {
  * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or
  * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.
  */ function Pl() {
-    return new ah("deleteField");
+    return new ch("deleteField");
 }
 
 /**
@@ -19419,7 +19419,7 @@ function Il(t, e) {
  * @returns A {@link WriteBatch} that can be used to atomically execute multiple
  * writes.
  */ function Dl(t) {
-    return Fa(t = ga(t, ka)), new ol(t, (e => Tl(t, e)));
+    return Fc(t = gc(t, kc)), new ol(t, (e => Tl(t, e)));
 }
 
 /**
@@ -19438,7 +19438,7 @@ function Il(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */ function Cl(t, e) {
-    Fa(t = ga(t, ka));
+    Fc(t = gc(t, kc));
     const n = "string" == typeof e ? function(t) {
         try {
             return JSON.parse(t);
@@ -19484,14 +19484,14 @@ function xl(t, e) {
     !function(t) {
         N = t;
     }(i), n(new r("firestore", ((t, {options: n}) => {
-        const s = t.getProvider("app").getImmediate(), i = new ka(s, new Y(t.getProvider("auth-internal")), new et(t.getProvider("app-check-internal")));
+        const s = t.getProvider("app").getImmediate(), i = new kc(s, new Y(t.getProvider("auth-internal")), new et(t.getProvider("app-check-internal")));
         return n = Object.assign({
             useFetchStreams: e
         }, n), i._setSettings(n), i;
-    }), "PUBLIC")), s(C, "3.4.9-canary.2cd1cc76f", t), 
+    }), "PUBLIC")), s(C, "3.4.9-canary.2d6a4143d", t), 
     // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-    s(C, "3.4.9-canary.2cd1cc76f", "esm2017");
+    s(C, "3.4.9-canary.2d6a4143d", "esm2017");
 }("rn", /* useFetchStreams= */ !1);
 
-export { sl as AbstractUserDataWriter, Xa as Bytes, Na as CACHE_SIZE_UNLIMITED, Ra as CollectionReference, Ea as DocumentReference, Ch as DocumentSnapshot, Ja as FieldPath, Za as FieldValue, ka as Firestore, j as FirestoreError, th as GeoPoint, xa as LoadBundleTask, Aa as Query, Fh as QueryConstraint, xh as QueryDocumentSnapshot, Nh as QuerySnapshot, Dh as SnapshotMetadata, at as Timestamp, Al as Transaction, ol as WriteBatch, Mt as _DatabaseId, Lt as _DocumentKey, nt as _EmptyAppCheckTokenProvider, H as _EmptyAuthCredentialsProvider, At as _FieldPath, ga as _cast, K as _debugAssert, bt as _isBase64Available, B as _logWarn, Cl as _setIndexConfiguration, da as _validateIsNotUsedTogether, yl as addDoc, vl as arrayRemove, Vl as arrayUnion, qa as clearIndexedDbPersistence, Pa as collection, ba as collectionGroup, Ta as connectFirestoreEmulator, gl as deleteDoc, Pl as deleteField, Qa as disableNetwork, Va as doc, Ya as documentId, Ba as enableIndexedDbPersistence, La as enableMultiTabIndexedDbPersistence, Ga as enableNetwork, Yh as endAt, Jh as endBefore, Fa as ensureFirestoreConfigured, Tl as executeWrite, cl as getDoc, hl as getDocFromCache, ll as getDocFromServer, fl as getDocs, dl as getDocsFromCache, _l as getDocsFromServer, Ma as getFirestore, Sl as increment, Oa as initializeFirestore, Gh as limit, Qh as limitToLast, Wa as loadBundle, za as namedQuery, pl as onSnapshot, Il as onSnapshotsInSync, qh as orderBy, $h as query, Sa as queryEqual, va as refEqual, Rl as runTransaction, bl as serverTimestamp, wl as setDoc, M as setLogLevel, Oh as snapshotEqual, zh as startAfter, Wh as startAt, ja as terminate, ml as updateDoc, Ka as waitForPendingWrites, Lh as where, Dl as writeBatch };
+export { sl as AbstractUserDataWriter, Xc as Bytes, Nc as CACHE_SIZE_UNLIMITED, Rc as CollectionReference, Ec as DocumentReference, Ch as DocumentSnapshot, Jc as FieldPath, Zc as FieldValue, kc as Firestore, j as FirestoreError, th as GeoPoint, xc as LoadBundleTask, Ac as Query, Fh as QueryConstraint, xh as QueryDocumentSnapshot, Nh as QuerySnapshot, Dh as SnapshotMetadata, ct as Timestamp, Al as Transaction, ol as WriteBatch, Mt as _DatabaseId, Lt as _DocumentKey, nt as _EmptyAppCheckTokenProvider, H as _EmptyAuthCredentialsProvider, At as _FieldPath, gc as _cast, K as _debugAssert, bt as _isBase64Available, B as _logWarn, Cl as _setIndexConfiguration, dc as _validateIsNotUsedTogether, yl as addDoc, vl as arrayRemove, Vl as arrayUnion, qc as clearIndexedDbPersistence, Pc as collection, bc as collectionGroup, Tc as connectFirestoreEmulator, gl as deleteDoc, Pl as deleteField, Qc as disableNetwork, Vc as doc, Yc as documentId, Bc as enableIndexedDbPersistence, Lc as enableMultiTabIndexedDbPersistence, Gc as enableNetwork, Yh as endAt, Jh as endBefore, Fc as ensureFirestoreConfigured, Tl as executeWrite, al as getDoc, hl as getDocFromCache, ll as getDocFromServer, fl as getDocs, dl as getDocsFromCache, _l as getDocsFromServer, Mc as getFirestore, Sl as increment, Oc as initializeFirestore, Gh as limit, Qh as limitToLast, Wc as loadBundle, zc as namedQuery, pl as onSnapshot, Il as onSnapshotsInSync, qh as orderBy, $h as query, Sc as queryEqual, vc as refEqual, Rl as runTransaction, bl as serverTimestamp, wl as setDoc, M as setLogLevel, Oh as snapshotEqual, zh as startAfter, Wh as startAt, jc as terminate, ml as updateDoc, Kc as waitForPendingWrites, Lh as where, Dl as writeBatch };
 //# sourceMappingURL=index.rn.js.map