@firebase/firestore 3.11.0-canary.98d0b8498 → 3.11.0-canary.a0bb76884

package/dist/index.cjs.js

@@ -8,7 +8,7 @@ var logger = require('@firebase/logger');
 var util = require('@firebase/util');
 var webchannelWrapper = require('@firebase/webchannel-wrapper');
 
-const b = "@firebase/firestore";
+const P = "@firebase/firestore";
 
 /**
  * @license
@@ -70,7 +70,7 @@ V.MOCK_USER = new V("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let S = "9.21.0-canary.98d0b8498";
+let S = "9.21.0-canary.a0bb76884";
 
 /**
  * @license
@@ -1569,7 +1569,7 @@ function Tt(t, e) {
  * Wraps an IDBTransaction and exposes a store() method to get a handle to a
  * specific object store.
  */
-class Pt {
+class bt {
     constructor(t, e) {
         this.action = t, this.transaction = e, this.aborted = !1, 
         /**
@@ -1586,7 +1586,7 @@ class Pt {
     }
     static open(t, e, n, s) {
         try {
-            return new Pt(e, t.transaction(s, n));
+            return new bt(e, t.transaction(s, n));
         } catch (t) {
             throw new St(e, t);
         }
@@ -1625,7 +1625,7 @@ class Pt {
  * since .then() continuations are executed asynchronously (e.g. via
  * .setImmediate), which would cause IndexedDB to end the transaction.
  * See PersistencePromise for more details.
- */ class bt {
+ */ class Pt {
     /*
      * Creates a new SimpleDb wrapper for IndexedDb database `name`.
      *
@@ -1641,14 +1641,14 @@ class Pt {
         // bug we're checking for should exist in iOS >= 12.2 and < 13, but for
         // whatever reason it's much harder to hit after 12.2 so we only proactively
         // log on 12.2.
-        12.2 === bt.S(util.getUA()) && k("Firestore persistence suffers from a bug in iOS 12.2 Safari that may cause your app to stop working. See https://stackoverflow.com/q/56496296/110915 for details and a potential workaround.");
+        12.2 === Pt.S(util.getUA()) && k("Firestore persistence suffers from a bug in iOS 12.2 Safari that may cause your app to stop working. See https://stackoverflow.com/q/56496296/110915 for details and a potential workaround.");
     }
     /** Deletes the specified database. */    static delete(t) {
         return N("SimpleDb", "Removing database:", t), xt(window.indexedDB.deleteDatabase(t)).toPromise();
     }
     /** Returns true if IndexedDB is available in the current environment. */    static D() {
         if (!util.isIndexedDBAvailable()) return !1;
-        if (bt.C()) return !0;
+        if (Pt.C()) return !0;
         // We extensively use indexed array values and compound keys,
         // which IE and Edge do not support. However, they still have indexedDB
         // defined on the window, so we need to check for them here and make sure
@@ -1656,7 +1656,7 @@ class Pt {
         // For tracking support of this feature, see here:
         // https://developer.microsoft.com/en-us/microsoft-edge/platform/status/indexeddbarraysandmultientrysupport/
         // Check the UA string to find out the browser.
-                const t = util.getUA(), e = bt.S(t), n = 0 < e && e < 10, s = bt.N(t), i = 0 < s && s < 4.5;
+                const t = util.getUA(), e = Pt.S(t), n = 0 < e && e < 10, s = Pt.N(t), i = 0 < s && s < 4.5;
         // IE 10
         // ua = 'Mozilla/5.0 (compatible; MSIE 10.0; Windows NT 6.2; Trident/6.0)';
         // IE 11
@@ -1726,7 +1726,7 @@ class Pt {
             ++r;
             try {
                 this.db = await this.$(t);
-                const e = Pt.open(this.db, t, i ? "readonly" : "readwrite", n), r = s(e).next((t => (e.P(), 
+                const e = bt.open(this.db, t, i ? "readonly" : "readwrite", n), r = s(e).next((t => (e.P(), 
                 t))).catch((t => (
                 // Abort the transaction if there was an error.
                 e.abort(t), Rt.reject(t)))).toPromise();
@@ -1978,7 +1978,7 @@ class Pt {
 let Nt = !1;
 
 function kt(t) {
-    const e = bt.S(util.getUA());
+    const e = Pt.S(util.getUA());
     if (e >= 12.2 && e < 13) {
         const e = "An internal error was encountered in the Indexed Database server";
         if (t.message.indexOf(e) >= 0) {
@@ -2305,7 +2305,7 @@ class we extends At {
 
 function _e(t, e) {
     const n = L(t);
-    return bt.M(n.at, e);
+    return Pt.M(n.at, e);
 }
 
 /**
@@ -2894,7 +2894,7 @@ function ve(t) {
  */
 /**
  * An error encountered while decoding base64 string.
- */ class Pe extends Error {
+ */ class be extends Error {
     constructor() {
         super(...arguments), this.name = "Base64DecodeError";
     }
@@ -2918,7 +2918,7 @@ function ve(t) {
  */
 /** Converts a Base64 encoded string to a binary string. */
 /** True if and only if the Base64 conversion functions are available. */
-function be() {
+function Pe() {
     return "undefined" != typeof atob;
 }
 
@@ -2958,7 +2958,7 @@ function be() {
                 // Check that `DOMException` is defined before using it to avoid
                 // "ReferenceError: Property 'DOMException' doesn't exist" in react-native.
                 // (https://github.com/firebase/firebase-js-sdk/issues/7115)
-                throw "undefined" != typeof DOMException && t instanceof DOMException ? new Pe("Invalid base64 string: " + t) : t;
+                throw "undefined" != typeof DOMException && t instanceof DOMException ? new be("Invalid base64 string: " + t) : t;
             }
         }
         /** Converts a binary string to a Base64 encoded string. */ (t);
@@ -3980,10 +3980,10 @@ class mn extends _n {
     /**
      * Creates a filter based on the provided arguments.
      */    static create(t, e, n) {
-        return t.isKeyField() ? "in" /* Operator.IN */ === e || "not-in" /* Operator.NOT_IN */ === e ? this.createKeyFieldInFilter(t, e, n) : new Pn(t, e, n) : "array-contains" /* Operator.ARRAY_CONTAINS */ === e ? new Dn(t, n) : "in" /* Operator.IN */ === e ? new Cn(t, n) : "not-in" /* Operator.NOT_IN */ === e ? new xn(t, n) : "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new Nn(t, n) : new mn(t, e, n);
+        return t.isKeyField() ? "in" /* Operator.IN */ === e || "not-in" /* Operator.NOT_IN */ === e ? this.createKeyFieldInFilter(t, e, n) : new bn(t, e, n) : "array-contains" /* Operator.ARRAY_CONTAINS */ === e ? new Dn(t, n) : "in" /* Operator.IN */ === e ? new Cn(t, n) : "not-in" /* Operator.NOT_IN */ === e ? new xn(t, n) : "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new Nn(t, n) : new mn(t, e, n);
     }
     static createKeyFieldInFilter(t, e, n) {
-        return "in" /* Operator.IN */ === e ? new bn(t, n) : new Vn(t, n);
+        return "in" /* Operator.IN */ === e ? new Pn(t, n) : new Vn(t, n);
     }
     matches(t) {
         const e = t.data.field(this.field);
@@ -4133,7 +4133,7 @@ function vn(t, e) {
     }(t) : "Filter";
 }
 
-class Pn extends mn {
+class bn extends mn {
     constructor(t, e, n) {
         super(t, e, n), this.key = ht.fromName(n.referenceValue);
     }
@@ -4143,7 +4143,7 @@ class Pn extends mn {
     }
 }
 
-/** Filter that matches on key fields within an array. */ class bn extends mn {
+/** Filter that matches on key fields within an array. */ class Pn extends mn {
     constructor(t, e) {
         super(t, "in" /* Operator.IN */ , e), this.keys = Sn("in" /* Operator.IN */ , e);
     }
@@ -4858,7 +4858,7 @@ function ps() {
  * Computes the local transform result against the provided `previousValue`,
  * optionally using the provided localWriteTime.
  */ function vs(t, e, n) {
-    return t instanceof bs ? function(t, e) {
+    return t instanceof Ps ? function(t, e) {
         const n = {
             fields: {
                 __type__: {
@@ -4888,7 +4888,7 @@ function ps() {
         // PORTING NOTE: Since JavaScript's integer arithmetic is limited to 53 bit
         // precision and resolves overflows by reducing precision, we do not
         // manually cap overflows at 2^63.
-        const n = Ps(t, e), s = Ns(n) + Ns(t._t);
+        const n = bs(t, e), s = Ns(n) + Ns(t._t);
         return He(n) && He(t._t) ? Ts(s) : Is(t.serializer, s);
     }(t, e);
 }
@@ -4917,7 +4917,7 @@ function ps() {
  *
  * @returns a base value to store along with the mutation, or null for
  * idempotent transforms.
- */ function Ps(t, e) {
+ */ function bs(t, e) {
     return t instanceof xs ? He(n = e) || function(t) {
         return !!t && "doubleValue" in t;
     }
@@ -4928,7 +4928,7 @@ function ps() {
 }
 
 /** Transforms a value into a server-generated timestamp. */
-class bs extends As {}
+class Ps extends As {}
 
 /** Transforms an array value via a union operation. */ class Vs extends As {
     constructor(t) {
@@ -5005,7 +5005,7 @@ function ks(t) {
 
 function $s(t, e) {
     return t.field.isEqual(e.field) && function(t, e) {
-        return t instanceof Vs && e instanceof Vs || t instanceof Ds && e instanceof Ds ? nt(t.elements, e.elements, qe) : t instanceof xs && e instanceof xs ? qe(t._t, e._t) : t instanceof bs && e instanceof bs;
+        return t instanceof Vs && e instanceof Vs || t instanceof Ds && e instanceof Ds ? nt(t.elements, e.elements, qe) : t instanceof xs && e instanceof xs ? qe(t._t, e._t) : t instanceof Ps && e instanceof Ps;
     }(t.transform, e.transform);
 }
 
@@ -5250,7 +5250,7 @@ class Os {
  */ function Gs(t, e) {
     let n = null;
     for (const s of t.fieldTransforms) {
-        const t = e.data.field(s.field), i = Ps(s.transform, t || null);
+        const t = e.data.field(s.field), i = bs(s.transform, t || null);
         null != i && (null === n && (n = un.empty()), n.set(s.field, i));
     }
     return n || null;
@@ -6049,13 +6049,13 @@ class _i extends Error {
      * document went out of view without the server sending a new document.
      */
     s) {
-        this.Rt = t, this.removedTargetIds = e, this.key = n, this.Pt = s;
+        this.Rt = t, this.removedTargetIds = e, this.key = n, this.bt = s;
     }
 }
 
 class pi {
     constructor(t, e) {
-        this.targetId = t, this.bt = e;
+        this.targetId = t, this.Pt = e;
     }
 }
 
@@ -6195,8 +6195,8 @@ class Ei {
     /**
      * Processes and adds the DocumentWatchChange to the current set of changes.
      */    Wt(t) {
-        for (const e of t.Rt) t.Pt && t.Pt.isFoundDocument() ? this.Ht(e, t.Pt) : this.Jt(e, t.key, t.Pt);
-        for (const e of t.removedTargetIds) this.Jt(e, t.key, t.Pt);
+        for (const e of t.Rt) t.bt && t.bt.isFoundDocument() ? this.Ht(e, t.bt) : this.Jt(e, t.key, t.bt);
+        for (const e of t.removedTargetIds) this.Jt(e, t.key, t.bt);
     }
     /** Processes and adds the WatchTargetChange to the current set of changes. */    Yt(t) {
         this.forEachTarget(t, (e => {
@@ -6256,7 +6256,7 @@ class Ei {
      * `pendingTargetResets`.
      */    ee(t) {
         var e;
-        const n = t.targetId, s = t.bt.count, i = this.ne(n);
+        const n = t.targetId, s = t.Pt.count, i = this.ne(n);
         if (i) {
             const r = i.target;
             if (Fn(r)) if (0 === s) {
@@ -6311,7 +6311,7 @@ class Ei {
  * 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.
- */ (s, i, t.bt));
+ */ (s, i, t.Pt));
                 }
             }
         }
@@ -6320,14 +6320,14 @@ class Ei {
      * Apply bloom filter to remove the deleted documents, and return the
      * application status.
      */    ie(t, e) {
-        const {unchangedNames: n, count: s} = t.bt;
+        const {unchangedNames: n, count: s} = t.Pt;
         if (!n || !n.bits) return 1 /* BloomFilterApplicationStatus.Skipped */;
         const {bits: {bitmap: i = "", padding: r = 0}, hashCount: o = 0} = n;
         let u, c;
         try {
             u = xe(i).toUint8Array();
         } catch (t) {
-            if (t instanceof Pe) return M("Decoding the base64 bloom filter in existence filter failed (" + t.message + "); ignoring the bloom filter and falling back to full re-query."), 
+            if (t instanceof be) return M("Decoding the base64 bloom filter in existence filter failed (" + t.message + "); ignoring the bloom filter and falling back to full re-query."), 
             1 /* BloomFilterApplicationStatus.Skipped */;
             throw t;
         }
@@ -6490,7 +6490,7 @@ const Ri = (() => {
         desc: "DESCENDING"
     };
     return t;
-})(), Pi = (() => {
+})(), bi = (() => {
     const t = {
         "<": "LESS_THAN",
         "<=": "LESS_THAN_OR_EQUAL",
@@ -6504,7 +6504,7 @@ const Ri = (() => {
         "array-contains-any": "ARRAY_CONTAINS_ANY"
     };
     return t;
-})(), bi = (() => {
+})(), Pi = (() => {
     const t = {
         and: "AND",
         or: "OR"
@@ -6727,7 +6727,7 @@ function ji(t, e) {
     }
     return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((t => function(t, e) {
         const n = e.transform;
-        if (n instanceof bs) return {
+        if (n instanceof Ps) return {
             fieldPath: e.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
@@ -6762,7 +6762,7 @@ function zi(t, e) {
         return void 0 !== t.updateTime ? Fs.updateTime(Ni(t.updateTime)) : void 0 !== t.exists ? Fs.exists(t.exists) : Fs.none();
     }(e.currentDocument) : Fs.none(), s = e.updateTransforms ? e.updateTransforms.map((e => function(t, e) {
         let n = null;
-        if ("setToServerValue" in e) F("REQUEST_TIME" === e.setToServerValue), n = new bs; else if ("appendMissingElements" in e) {
+        if ("setToServerValue" in e) F("REQUEST_TIME" === e.setToServerValue), n = new Ps; else if ("appendMissingElements" in e) {
             const t = e.appendMissingElements.values || [];
             n = new Vs(t);
         } else if ("removeAllFromArray" in e) {
@@ -7027,11 +7027,11 @@ function tr(t) {
 }
 
 function er(t) {
-    return Pi[t];
+    return bi[t];
 }
 
 function nr(t) {
-    return bi[t];
+    return Pi[t];
 }
 
 function sr(t) {
@@ -7460,7 +7460,7 @@ function Tr(t, e, n, s) {
         return new Rr(t, n);
     }
     getOverlay(t, e) {
-        return Pr(t).get(Ir(this.userId, e)).next((t => t ? pr(this.serializer, t) : null));
+        return br(t).get(Ir(this.userId, e)).next((t => t ? pr(this.serializer, t) : null));
     }
     getOverlays(t, e) {
         const n = fs();
@@ -7484,13 +7484,13 @@ function Tr(t, e, n, s) {
             const s = IDBKeyRange.bound([ this.userId, e, n ], [ this.userId, e, n + 1 ], 
             /*lowerOpen=*/ !1, 
             /*upperOpen=*/ !0);
-            i.push(Pr(t).J("collectionPathOverlayIndex", s));
+            i.push(br(t).J("collectionPathOverlayIndex", s));
         })), Rt.waitFor(i);
     }
     getOverlaysForCollection(t, e, n) {
         const s = fs(), i = qt(e), r = IDBKeyRange.bound([ this.userId, i, n ], [ this.userId, i, Number.POSITIVE_INFINITY ], 
         /*lowerOpen=*/ !0);
-        return Pr(t).j("collectionPathOverlayIndex", r).next((t => {
+        return br(t).j("collectionPathOverlayIndex", r).next((t => {
             for (const e of t) {
                 const t = pr(this.serializer, e);
                 s.set(t.getKey(), t);
@@ -7505,7 +7505,7 @@ function Tr(t, e, n, s) {
         // is not inclusive.
                 const o = IDBKeyRange.bound([ this.userId, e, n ], [ this.userId, e, Number.POSITIVE_INFINITY ], 
         /*lowerOpen=*/ !0);
-        return Pr(t).X({
+        return br(t).X({
             index: "collectionGroupOverlayIndex",
             range: o
         }, ((t, e, n) => {
@@ -7518,7 +7518,7 @@ function Tr(t, e, n, s) {
         })).next((() => i));
     }
     de(t, e) {
-        return Pr(t).put(function(t, e, n) {
+        return br(t).put(function(t, e, n) {
             const [s, i, r] = Ir(e, n.mutation.key);
             return {
                 userId: e,
@@ -7534,7 +7534,7 @@ function Tr(t, e, n, s) {
 
 /**
  * Helper to get a typed SimpleDbStore for the document overlay object store.
- */ function Pr(t) {
+ */ function br(t) {
     return _e(t, "documentOverlays");
 }
 
@@ -7557,7 +7557,7 @@ function Tr(t, e, n, s) {
 // Note: This code is copied from the backend. Code that is not used by
 // Firestore was removed.
 /** Firestore index value writer.  */
-class br {
+class Pr {
     constructor() {}
     // The write methods below short-circuit writing terminators for values
     // containing a (terminating) truncated value.
@@ -7590,9 +7590,9 @@ class br {
         this.Te(e)) : "arrayValue" in t ? (this.Re(t.arrayValue, e), this.Te(e)) : O();
     }
     Ie(t, e) {
-        this.ge(e, 25), this.Pe(t, e);
+        this.ge(e, 25), this.be(t, e);
     }
-    Pe(t, e) {
+    be(t, e) {
         e.pe(t);
     }
     ve(t, e) {
@@ -7608,7 +7608,7 @@ class br {
     Ae(t, e) {
         this.ge(e, 37);
         ht.fromName(t).path.forEach((t => {
-            this.ge(e, 60), this.Pe(t, e);
+            this.ge(e, 60), this.be(t, e);
         }));
     }
     ge(t, e) {
@@ -7622,7 +7622,7 @@ class br {
     }
 }
 
-br.be = new br;
+Pr.Pe = new Pr;
 
 /**
  * Counts the number of zeros in a byte.
@@ -8548,20 +8548,20 @@ class Jr {
             const t = e.data.field(s.fieldPath);
             if (null == t) return null;
             const i = n.We(s.kind);
-            br.be.we(t, i);
+            Pr.Pe.we(t, i);
         }
         return n.Ge();
     }
     /** Encodes a single value to the ascending index format. */    fn(t) {
         const e = new Nr;
-        return br.be.we(t, e.We(0 /* IndexKind.ASCENDING */)), e.Ge();
+        return Pr.Pe.we(t, e.We(0 /* IndexKind.ASCENDING */)), e.Ge();
     }
     /**
      * Returns an encoded form of the document key that sorts based on the key
      * ordering of the field index.
      */    mn(t, e) {
         const n = new Nr;
-        return br.be.we(We(this.databaseId, e), n.We(function(t) {
+        return Pr.Pe.we(We(this.databaseId, e), n.We(function(t) {
             const e = dt(t);
             return 0 === e.length ? 0 /* IndexKind.ASCENDING */ : e[e.length - 1].kind;
         }(t))), n.Ge();
@@ -8578,7 +8578,7 @@ class Jr {
             const t = n[i++];
             for (const n of s) if (this.gn(e, r.fieldPath) && Je(t)) s = this.yn(s, r, t); else {
                 const e = n.We(r.kind);
-                br.be.we(t, e);
+                Pr.Pe.we(t, e);
             }
         }
         return this.pn(s);
@@ -8604,7 +8604,7 @@ class Jr {
         const s = [ ...t ], i = [];
         for (const t of n.arrayValue.values || []) for (const n of s) {
             const s = new Nr;
-            s.seed(n.Ge()), br.be.we(t, s.We(e.kind)), i.push(s);
+            s.seed(n.Ge()), Pr.Pe.we(t, s.We(e.kind)), i.push(s);
         }
         return i;
     }
@@ -8753,13 +8753,13 @@ class Jr {
         for (let t = 0; t < s.length; t += 2) {
             // If we encounter two bounds that will create an unmatchable key range,
             // then we return an empty set of key ranges.
-            if (this.Pn(s[t], s[t + 1])) return [];
+            if (this.bn(s[t], s[t + 1])) return [];
             const e = [ s[t].indexId, this.uid, s[t].arrayValue, s[t].directionalValue, Hr, [] ], n = [ s[t + 1].indexId, this.uid, s[t + 1].arrayValue, s[t + 1].directionalValue, Hr, [] ];
             i.push(IDBKeyRange.bound(e, n));
         }
         return i;
     }
-    Pn(t, e) {
+    bn(t, e) {
         // If lower bound is greater than the upper bound, then the key
         // range can never be matched.
         return Mr(t, e) > 0;
@@ -8935,7 +8935,7 @@ class oo {
          * view of the documents that were previously affected by the mutation.
          */
         // PORTING NOTE: Multi-tab only.
-        this.bn = {};
+        this.Pn = {};
     }
     /**
      * Creates a new mutation queue for the given user.
@@ -8991,7 +8991,7 @@ class oo {
             return h.forEach((e => {
                 a.push(this.indexManager.addToCollectionParentIndex(t, e));
             })), t.addOnCommittedListener((() => {
-                this.bn[o] = u.keys();
+                this.Pn[o] = u.keys();
             })), Rt.waitFor(a).next((() => u));
         }));
     }
@@ -9006,10 +9006,10 @@ class oo {
      */
     // PORTING NOTE: Multi-tab only.
     Vn(t, e) {
-        return this.bn[e] ? Rt.resolve(this.bn[e]) : this.lookupMutationBatch(t, e).next((t => {
+        return this.Pn[e] ? Rt.resolve(this.Pn[e]) : this.lookupMutationBatch(t, e).next((t => {
             if (t) {
                 const n = t.keys();
-                return this.bn[e] = n, n;
+                return this.Pn[e] = n, n;
             }
             return null;
         }));
@@ -9127,7 +9127,7 @@ class oo {
      */
     // PORTING NOTE: Multi-tab only
     Dn(t) {
-        delete this.bn[t];
+        delete this.Pn[t];
     }
     performConsistencyCheck(t) {
         return this.checkEmpty(t).next((e => {
@@ -9960,7 +9960,7 @@ function Ao(t, e) {
         })).next((() => i));
     }
     newChangeBuffer(t) {
-        return new bo(this, !!t && t.trackRemovals);
+        return new Po(this, !!t && t.trackRemovals);
     }
     getSize(t) {
         return this.getMetadata(t).next((t => t.byteSize));
@@ -9985,7 +9985,7 @@ function Ao(t, e) {
     }
 }
 
-/** Creates a new IndexedDbRemoteDocumentCache. */ function Po(t) {
+/** Creates a new IndexedDbRemoteDocumentCache. */ function bo(t) {
     return new Ro(t);
 }
 
@@ -9995,7 +9995,7 @@ function Ao(t, e) {
  * Unlike the MemoryRemoteDocumentChangeBuffer, the IndexedDb implementation computes the size
  * delta for all submitted changes. This avoids having to re-read all documents from IndexedDb
  * when we apply the changes.
- */ class bo extends vo {
+ */ class Po extends vo {
     /**
      * @param documentCache - The IndexedDbRemoteDocumentCache to apply the changes to.
      * @param trackRemovals - Whether to create sentinel deletes that can be tracked by
@@ -10681,7 +10681,7 @@ class Fo {
         return Rt.resolve(this.Rs(e));
     }
     getNextMutationBatchAfterBatchId(t, e) {
-        const n = e + 1, s = this.Ps(n), i = s < 0 ? 0 : s;
+        const n = e + 1, s = this.bs(n), i = s < 0 ? 0 : s;
         // The requested batchId may still be out of range so normalize it to the
         // start of the queue.
                 return Rt.resolve(this.mutationQueue.length > i ? this.mutationQueue[i] : null);
@@ -10706,7 +10706,7 @@ class Fo {
             this.vs.forEachInRange([ e, s ], (t => {
                 n = n.add(t.Es);
             }));
-        })), Rt.resolve(this.bs(n));
+        })), Rt.resolve(this.Ps(n));
     }
     getAllMutationBatchesAffectingQuery(t, e) {
         // Use the query path as a prefix for testing if a document matches the
@@ -10731,9 +10731,9 @@ class Fo {
             // TODO(mcg): we'll need a different scanner when we implement
             // ancestor queries.
             e.length === s && (o = o.add(t.Es)), !0);
-        }), r), Rt.resolve(this.bs(o));
+        }), r), Rt.resolve(this.Ps(o));
     }
-    bs(t) {
+    Ps(t) {
         // Construct an array of matching batches, sorted by batchID to ensure that
         // multiple mutations affecting the same document key are applied in order.
         const e = [];
@@ -10770,7 +10770,7 @@ class Fo {
      * @param action - A description of what the caller is doing, phrased in passive
      * form (e.g. "acknowledged" in a routine that acknowledges batches).
      */    Vs(t, e) {
-        return this.Ps(t);
+        return this.bs(t);
     }
     /**
      * Finds the index of the given batchId in the mutation queue. This operation
@@ -10780,7 +10780,7 @@ class Fo {
      * the state of the queue. Note this index can be negative if the requested
      * batchId has already been remvoed from the queue or past the end of the
      * queue if the batchId is larger than the last added batch.
-     */    Ps(t) {
+     */    bs(t) {
         if (0 === this.mutationQueue.length) 
         // As an index this is past the end of the queue
         return 0;
@@ -10794,7 +10794,7 @@ class Fo {
      * A version of lookupMutationBatch that doesn't return a promise, this makes
      * other functions that uses this code easier to read and more efficent.
      */    Rs(t) {
-        const e = this.Ps(t);
+        const e = this.bs(t);
         if (e < 0 || e >= this.mutationQueue.length) return null;
         return this.mutationQueue[e];
     }
@@ -11276,7 +11276,7 @@ class jo {
      * to SCHEMA_VERSION. Different values of toVersion are only used for testing
      * and local feature development.
      */    O(t, e, n, s) {
-        const i = new Pt("createOrUpgrade", e);
+        const i = new bt("createOrUpgrade", e);
         n < 1 && s >= 1 && (function(t) {
             t.createObjectStore("owner");
         }(t), function(t) {
@@ -11511,7 +11511,7 @@ class jo {
         })).next((() => Rt.waitFor(s)));
     }
     ni(t, e) {
-        const n = e.store("mutations"), s = Po(this.serializer), i = new Ko(Qo.js, this.serializer.le);
+        const n = e.store("mutations"), s = bo(this.serializer), i = new Ko(Qo.js, this.serializer.le);
         return n.j().next((t => {
             const n = new Map;
             return t.forEach((t => {
@@ -11618,8 +11618,8 @@ class Jo {
         /** A listener to notify on primary state changes. */
         this.li = t => Promise.resolve(), !Jo.D()) throw new U(q.UNIMPLEMENTED, "This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.");
         this.referenceDelegate = new Eo(this, s), this.fi = e + "main", this.serializer = new ar(u), 
-        this.di = new bt(this.fi, this.oi, new zo(this.serializer)), this.Fs = new fo(this.referenceDelegate, this.serializer), 
-        this.remoteDocumentCache = Po(this.serializer), this.Ls = new Er, this.window && this.window.localStorage ? this.wi = this.window.localStorage : (this.wi = null, 
+        this.di = new Pt(this.fi, this.oi, new zo(this.serializer)), this.Fs = new fo(this.referenceDelegate, this.serializer), 
+        this.remoteDocumentCache = bo(this.serializer), this.Ls = new Er, this.window && this.window.localStorage ? this.wi = this.window.localStorage : (this.wi = null, 
         !1 === a && k("IndexedDbPersistence", "LocalStorage is unavailable. As a result, persistence may not work reliably. In particular enablePersistence() could fail immediately after refreshing the page."));
     }
     /**
@@ -11714,8 +11714,8 @@ class Jo {
      * If the garbage collection threshold has passed, prunes the
      * RemoteDocumentChanges and the ClientMetadata store based on the last update
      * time of all clients.
-     */    async Pi() {
-        if (this.isPrimary && !this.bi(this.hi, 18e5)) {
+     */    async bi() {
+        if (this.isPrimary && !this.Pi(this.hi, 18e5)) {
             this.hi = Date.now();
             const t = await this.runTransaction("maybeGarbageCollectMultiClientState", "readwrite-primary", (t => {
                 const e = _e(t, "clientMetadata");
@@ -11737,7 +11737,7 @@ class Jo {
      * 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" /* TimerId.ClientMetadataRefresh */ , 4e3, (() => this._i().then((() => this.Pi())).then((() => this.yi()))));
+        this.ai = this.si.enqueueAfterDelay("client_metadata_refresh" /* TimerId.ClientMetadataRefresh */ , 4e3, (() => this._i().then((() => this.bi())).then((() => this.yi()))));
     }
     /** Checks whether `client` is the local client. */    vi(t) {
         return !!t && t.ownerId === this.clientId;
@@ -11760,7 +11760,7 @@ class Jo {
             // - every clients network is disabled and no other client's tab is in
             //   the foreground.
             // - the `forceOwningTab` setting was passed in.
-            if (null !== e && this.bi(e.leaseTimestampMs, 5e3) && !this.Di(e.ownerId)) {
+            if (null !== e && this.Pi(e.leaseTimestampMs, 5e3) && !this.Di(e.ownerId)) {
                 if (this.vi(e) && this.networkEnabled) return !0;
                 if (!this.vi(e)) {
                     if (!e.allowTabSynchronization) 
@@ -11808,7 +11808,7 @@ class Jo {
      * Returns clients that are not zombied and have an updateTime within the
      * provided threshold.
      */    Vi(t, e) {
-        return t.filter((t => this.bi(t.updateTimeMs, e) && !this.Di(t.clientId)));
+        return t.filter((t => this.Pi(t.updateTimeMs, e) && !this.Di(t.clientId)));
     }
     /**
      * Returns the IDs of the clients that are currently active. If multi-tab
@@ -11864,7 +11864,7 @@ class Jo {
     // be turned off.
     $i(t) {
         return Yo(t).get("owner").next((t => {
-            if (null !== t && this.bi(t.leaseTimestampMs, 5e3) && !this.Di(t.ownerId) && !this.vi(t) && !(this.ri || this.allowTabSynchronization && t.allowTabSynchronization)) throw new U(q.FAILED_PRECONDITION, Ho);
+            if (null !== t && this.Pi(t.leaseTimestampMs, 5e3) && !this.Di(t.ownerId) && !this.vi(t) && !(this.ri || this.allowTabSynchronization && t.allowTabSynchronization)) throw new U(q.FAILED_PRECONDITION, Ho);
         }));
     }
     /**
@@ -11879,14 +11879,14 @@ class Jo {
         return Yo(t).put("owner", e);
     }
     static D() {
-        return bt.D();
+        return Pt.D();
     }
     /** Checks the primary lease and removes it if we are the current primary. */    Ei(t) {
         const e = Yo(t);
         return e.get("owner").next((t => this.vi(t) ? (N("IndexedDbPersistence", "Releasing primary lease."), 
         e.delete("owner")) : Rt.resolve()));
     }
-    /** Verifies that `updateTimeMs` is within `maxAgeMs`. */    bi(t, e) {
+    /** Verifies that `updateTimeMs` is within `maxAgeMs`. */    Pi(t, e) {
         const n = Date.now();
         return !(t < n - e) && (!(t > n) || (k(`Detected an update time that is in the future: ${t} > ${n}`), 
         !1));
@@ -12819,7 +12819,7 @@ class Ru {
  * `WebStorageSharedClientState` uses WebStorage (window.localStorage) as the
  * backing store for the SharedClientState. It keeps track of all active
  * clients and supports modifications of the local client's data.
- */ class Pu {
+ */ class bu {
     constructor(t, e, n, s, i) {
         this.window = t, this.si = e, this.persistenceKey = n, this.dr = s, this.syncEngine = null, 
         this.onlineStateHandler = null, this.sequenceNumberHandler = null, this.wr = this._r.bind(this), 
@@ -12899,8 +12899,8 @@ class Ru {
         // if applicable.
         const e = this.storage.getItem(this.Ar);
         if (e) {
-            const t = this.Pr(e);
-            t && this.br(t);
+            const t = this.br(e);
+            t && this.Pr(t);
         }
         for (const t of this.gr) this._r(t);
         this.gr = [], 
@@ -13011,8 +13011,8 @@ class Ru {
                         }
                     } else if (e.key === this.Ar) {
                         if (null !== e.newValue) {
-                            const t = this.Pr(e.newValue);
-                            if (t) return this.br(t);
+                            const t = this.br(e.newValue);
+                            if (t) return this.Pr(t);
                         }
                     } else if (e.key === this.pr) {
                         const t = function(t) {
@@ -13099,7 +13099,7 @@ class Ru {
     /**
      * Parses an online state from WebStorage. Returns 'null' if the value
      * could not be parsed.
-     */    Pr(t) {
+     */    br(t) {
         return vu.cr(t);
     }
     Kr(t) {
@@ -13122,7 +13122,7 @@ class Ru {
             this.mr = n;
         }));
     }
-    br(t) {
+    Pr(t) {
         // We check whether the client that wrote this online state is still active
         // by comparing its client ID to the list of clients kept active in
         // IndexedDb. If a client does not update their IndexedDb client state
@@ -13138,7 +13138,7 @@ class Ru {
     }
 }
 
-class bu {
+class Pu {
     constructor() {
         this.Wr = new Ru, this.Hr = {}, this.onlineStateHandler = null, this.sequenceNumberHandler = null;
     }
@@ -13739,7 +13739,7 @@ class Bu {
      * Note that jitter will still be applied, so the actual delay could be as
      * much as 1.5*maxDelayMs.
      */ , i = 6e4) {
-        this.si = t, this.timerId = e, this.Ro = n, this.Po = s, this.bo = i, this.Vo = 0, 
+        this.si = t, this.timerId = e, this.Ro = n, this.bo = s, this.Po = i, this.Vo = 0, 
         this.So = null, 
         /** The last backoff attempt, as epoch milliseconds. */
         this.Do = Date.now(), this.reset();
@@ -13757,7 +13757,7 @@ class Bu {
      * Resets the backoff delay to the maximum delay (e.g. for use after a
      * RESOURCE_EXHAUSTED error).
      */    Co() {
-        this.Vo = this.bo;
+        this.Vo = this.Po;
     }
     /**
      * Returns a promise that resolves after currentDelayMs, and increases the
@@ -13775,7 +13775,7 @@ class Bu {
         t()))), 
         // Apply backoff factor to determine next delay and ensure it is within
         // bounds.
-        this.Vo *= this.Po, this.Vo < this.Ro && (this.Vo = this.Ro), this.Vo > this.bo && (this.Vo = this.bo);
+        this.Vo *= this.bo, this.Vo < this.Ro && (this.Vo = this.Ro), this.Vo > this.Po && (this.Vo = this.Po);
     }
     ko() {
         null !== this.So && (this.So.skipDelay(), this.So = null);
@@ -14405,11 +14405,11 @@ class Qu {
                 ec(this) && (N("RemoteStore", "Restarting streams for network reachability change."), 
                 await async function(t) {
                     const e = L(t);
-                    e.Au.add(4 /* OfflineCause.ConnectivityChange */), await Wu(e), e.Pu.set("Unknown" /* OnlineState.Unknown */), 
+                    e.Au.add(4 /* OfflineCause.ConnectivityChange */), await Wu(e), e.bu.set("Unknown" /* OnlineState.Unknown */), 
                     e.Au.delete(4 /* OfflineCause.ConnectivityChange */), await zu(e);
                 }(this));
             }));
-        })), this.Pu = new Qu(n, s);
+        })), this.bu = new Qu(n, s);
     }
 }
 
@@ -14446,14 +14446,14 @@ function Hu(t, e) {
     // Revert to OnlineState.Unknown if the watch stream is not open and we
     // have no listeners, since without any listens to send we cannot
     // confirm if the stream is healthy and upgrade to OnlineState.Online.
-    n.Pu.set("Unknown" /* OnlineState.Unknown */));
+    n.bu.set("Unknown" /* OnlineState.Unknown */));
 }
 
 /**
  * We need to increment the the expected number of pending responses we're due
  * from watch so we wait for the ack to process any messages from this target.
  */ function Yu(t, e) {
-    if (t.bu.Lt(e.targetId), e.resumeToken.approximateByteSize() > 0 || e.snapshotVersion.compareTo(rt.min()) > 0) {
+    if (t.Pu.Lt(e.targetId), e.resumeToken.approximateByteSize() > 0 || e.snapshotVersion.compareTo(rt.min()) > 0) {
         const n = t.remoteSyncer.getRemoteKeysForTarget(e.targetId).size;
         e = e.withExpectedCount(n);
     }
@@ -14465,15 +14465,15 @@ function Hu(t, e) {
  * from watch so we wait for the removal on the server before we process any
  * messages from this target.
  */ function Xu(t, e) {
-    t.bu.Lt(e), pc(t).su(e);
+    t.Pu.Lt(e), pc(t).su(e);
 }
 
 function Zu(t) {
-    t.bu = new Ei({
+    t.Pu = new Ei({
         getRemoteKeysForTarget: e => t.remoteSyncer.getRemoteKeysForTarget(e),
         he: e => t.Eu.get(e) || null,
         oe: () => t.datastore.serializer.databaseId
-    }), pc(t).start(), t.Pu.mu();
+    }), pc(t).start(), t.bu.mu();
 }
 
 /**
@@ -14488,7 +14488,7 @@ function ec(t) {
 }
 
 function nc(t) {
-    t.bu = void 0;
+    t.Pu = void 0;
 }
 
 async function sc(t) {
@@ -14500,17 +14500,17 @@ async function sc(t) {
 async function ic(t, e) {
     nc(t), 
     // If we still need the watch stream, retry the connection.
-    tc(t) ? (t.Pu.pu(e), Zu(t)) : 
+    tc(t) ? (t.bu.pu(e), Zu(t)) : 
     // No need to restart watch stream because there are no active targets.
     // The online state is set to unknown because there is no active attempt
     // at establishing a connection
-    t.Pu.set("Unknown" /* OnlineState.Unknown */);
+    t.bu.set("Unknown" /* OnlineState.Unknown */);
 }
 
 async function rc(t, e, n) {
     if (
     // Mark the client as online since we got a message from the server
-    t.Pu.set("Online" /* OnlineState.Online */), e instanceof Ii && 2 /* WatchTargetChangeState.Removed */ === e.state && e.cause) 
+    t.bu.set("Online" /* OnlineState.Online */), e instanceof Ii && 2 /* WatchTargetChangeState.Removed */ === e.state && e.cause) 
     // There was an error on a target, don't wait for a consistent snapshot
     // to raise events
     try {
@@ -14520,7 +14520,7 @@ async function rc(t, e, n) {
             const n = e.cause;
             for (const s of e.targetIds) 
             // A watched target might have been removed already.
-            t.Eu.has(s) && (await t.remoteSyncer.rejectListen(s, n), t.Eu.delete(s), t.bu.removeTarget(s));
+            t.Eu.has(s) && (await t.remoteSyncer.rejectListen(s, n), t.Eu.delete(s), t.Pu.removeTarget(s));
         }
         /**
  * Attempts to fill our write pipeline with writes from the LocalStore.
@@ -14533,7 +14533,7 @@ async function rc(t, e, n) {
     } catch (n) {
         N("RemoteStore", "Failed to remove targets %s: %s ", e.targetIds.join(","), n), 
         await oc(t, n);
-    } else if (e instanceof yi ? t.bu.Wt(e) : e instanceof pi ? t.bu.ee(e) : t.bu.Yt(e), 
+    } else if (e instanceof yi ? t.Pu.Wt(e) : e instanceof pi ? t.Pu.ee(e) : t.Pu.Yt(e), 
     !n.isEqual(rt.min())) try {
         const e = await ou(t.localStore);
         n.compareTo(e) >= 0 && 
@@ -14546,7 +14546,7 @@ async function rc(t, e, n) {
  * SyncEngine.
  */
         function(t, e) {
-            const n = t.bu.ue(e);
+            const n = t.Pu.ue(e);
             // Update in-memory resume tokens. LocalStore will update the
             // persistent view of these when applying the completed RemoteEvent.
                         return n.targetChanges.forEach(((n, s) => {
@@ -14594,7 +14594,7 @@ async function rc(t, e, n) {
     if (!Dt(e)) throw e;
     t.Au.add(1 /* OfflineCause.IndexedDbFailed */), 
     // Disable network and raise offline snapshots
-    await Wu(t), t.Pu.set("Offline" /* OnlineState.Offline */), n || (
+    await Wu(t), t.bu.set("Offline" /* OnlineState.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.
@@ -14707,7 +14707,7 @@ async function gc(t, e) {
     // new mutations from the LocalStore (since mutations are per-user).
         n.Au.add(3 /* OfflineCause.CredentialChange */), await Wu(n), s && 
     // Don't set the network status to Unknown if we are offline.
-    n.Pu.set("Unknown" /* OnlineState.Unknown */), await n.remoteSyncer.handleCredentialChange(e), 
+    n.bu.set("Unknown" /* OnlineState.Unknown */), await n.remoteSyncer.handleCredentialChange(e), 
     n.Au.delete(3 /* OfflineCause.CredentialChange */), await zu(n);
 }
 
@@ -14716,7 +14716,7 @@ async function gc(t, e) {
  */ async function yc(t, e) {
     const n = L(t);
     e ? (n.Au.delete(2 /* OfflineCause.IsSecondary */), await zu(n)) : e || (n.Au.add(2 /* OfflineCause.IsSecondary */), 
-    await Wu(n), n.Pu.set("Unknown" /* OnlineState.Unknown */));
+    await Wu(n), n.bu.set("Unknown" /* OnlineState.Unknown */));
 }
 
 /**
@@ -14753,7 +14753,7 @@ async function gc(t, e) {
         co: ic.bind(null, t),
         eu: rc.bind(null, t)
     }), t.vu.push((async e => {
-        e ? (t.Vu.Go(), tc(t) ? Zu(t) : t.Pu.set("Unknown" /* OnlineState.Unknown */)) : (await t.Vu.stop(), 
+        e ? (t.Vu.Go(), tc(t) ? Zu(t) : t.bu.set("Unknown" /* OnlineState.Unknown */)) : (await t.Vu.stop(), 
         nc(t));
     }))), t.Vu;
 }
@@ -15078,13 +15078,13 @@ class Rc {
 /**
  * Holds the listeners and the last received ViewSnapshot for a query being
  * tracked by EventManager.
- */ class Pc {
+ */ class bc {
     constructor() {
         this.xu = void 0, this.listeners = [];
     }
 }
 
-class bc {
+class Pc {
     constructor() {
         this.queries = new os((t => ts(t)), Zn), this.onlineState = "Unknown" /* OnlineState.Unknown */ , 
         this.Nu = new Set;
@@ -15094,7 +15094,7 @@ class bc {
 async function Vc(t, e) {
     const n = L(t), s = e.query;
     let i = !1, r = n.queries.get(s);
-    if (r || (i = !0, r = new Pc), i) try {
+    if (r || (i = !0, r = new bc), i) try {
         r.xu = await n.onListen(s);
     } catch (t) {
         const n = Ec(t, `Initialization of query '${es(e.query)}' failed`);
@@ -16411,10 +16411,10 @@ function Ia(t) {
             }(s)), Promise.resolve(new Set);
             n._updateProgress(Oc(s));
             const i = new $c(s, t.localStore, e.serializer);
-            let r = await e.Pc();
+            let r = await e.bc();
             for (;r; ) {
                 const t = await i.ju(r);
-                t && n._updateProgress(t), r = await e.Pc();
+                t && n._updateProgress(t), r = await e.bc();
             }
             const o = await i.complete();
             return await ua(t, o.Hu, 
@@ -16478,7 +16478,7 @@ class Ea {
         return new Ko(Qo.js, this.serializer);
     }
     createSharedClientState(t) {
-        return new bu;
+        return new Pu;
     }
     async terminate() {
         this.gcScheduler && this.gcScheduler.stop(), await this.sharedClientState.shutdown(), 
@@ -16505,12 +16505,12 @@ class Aa extends Ea {
  * Provides all components needed for Firestore with IndexedDB persistence.
  */ class va extends Ea {
     constructor(t, e, n) {
-        super(), this.bc = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;
+        super(), this.Pc = t, this.cacheSizeBytes = e, this.forceOwnership = n, this.synchronizeTabs = !1;
     }
     async initialize(t) {
-        await super.initialize(t), await this.bc.initialize(this, t), 
+        await super.initialize(t), await this.Pc.initialize(this, t), 
         // Enqueue writes from a previous session
-        await Ia(this.bc.syncEngine), await cc(this.bc.remoteStore), 
+        await Ia(this.Pc.syncEngine), await cc(this.Pc.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(), 
@@ -16533,7 +16533,7 @@ class Aa extends Ea {
         return new Jo(this.synchronizeTabs, e, t.clientId, n, t.asyncQueue, $u(), Ou(), this.serializer, this.sharedClientState, !!this.forceOwnership);
     }
     createSharedClientState(t) {
-        return new bu;
+        return new Pu;
     }
 }
 
@@ -16546,12 +16546,12 @@ class Aa extends Ea {
  * `synchronizeTabs` will be enabled.
  */ class Ra extends va {
     constructor(t, e) {
-        super(t, e, /* forceOwnership= */ !1), this.bc = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;
+        super(t, e, /* forceOwnership= */ !1), this.Pc = t, this.cacheSizeBytes = e, this.synchronizeTabs = !0;
     }
     async initialize(t) {
         await super.initialize(t);
-        const e = this.bc.syncEngine;
-        this.sharedClientState instanceof Pu && (this.sharedClientState.syncEngine = {
+        const e = this.Pc.syncEngine;
+        this.sharedClientState instanceof bu && (this.sharedClientState.syncEngine = {
             Qr: fa.bind(null, e),
             jr: ga.bind(null, e),
             zr: ya.bind(null, e),
@@ -16561,22 +16561,22 @@ class Aa extends Ea {
         // 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 da(this.bc.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start() : t || this.gcScheduler.stop()), 
+            await da(this.Pc.syncEngine, t), this.gcScheduler && (t && !this.gcScheduler.started ? this.gcScheduler.start() : t || this.gcScheduler.stop()), 
             this.indexBackfillerScheduler && (t && !this.indexBackfillerScheduler.started ? this.indexBackfillerScheduler.start() : t || this.indexBackfillerScheduler.stop());
         }));
     }
     createSharedClientState(t) {
         const e = $u();
-        if (!Pu.D(e)) throw new U(q.UNIMPLEMENTED, "IndexedDB persistence is only available on platforms that support LocalStorage.");
+        if (!bu.D(e)) throw new U(q.UNIMPLEMENTED, "IndexedDB persistence is only available on platforms that support LocalStorage.");
         const n = Zo(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey);
-        return new Pu(e, t.asyncQueue, n, t.clientId, t.initialUser);
+        return new bu(e, t.asyncQueue, n, t.clientId, t.initialUser);
     }
 }
 
 /**
  * Initializes and wires the components that are needed to interface with the
  * network.
- */ class Pa {
+ */ 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), 
@@ -16586,7 +16586,7 @@ class Aa extends Ea {
         await yc(this.remoteStore, this.syncEngine.isPrimaryClient));
     }
     createEventManager(t) {
-        return new bc;
+        return new Pc;
     }
     createDatastore(t) {
         const e = Fu(t.databaseInfo.databaseId), n = (s = t.databaseInfo, new Mu(s));
@@ -16615,7 +16615,7 @@ class Aa extends Ea {
             await Wu(e), e.Ru.shutdown(), 
             // Set the OnlineState to Unknown (rather than Offline) to avoid potentially
             // triggering spurious listener events with cached data, etc.
-            e.Pu.set("Unknown" /* OnlineState.Unknown */);
+            e.bu.set("Unknown" /* OnlineState.Unknown */);
         }(this.remoteStore);
     }
 }
@@ -16647,7 +16647,7 @@ class Aa extends Ea {
  * @param bytesPerRead - How many bytes each `read()` from the returned reader
  *        will read.
  */
-function ba(t, e = 10240) {
+function Pa(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.
@@ -16782,7 +16782,7 @@ class Va {
     async getMetadata() {
         return this.metadata.promise;
     }
-    async Pc() {
+    async bc() {
         // Makes sure metadata is read before proceeding.
         return await this.getMetadata(), this.xc();
     }
@@ -17200,7 +17200,7 @@ async function $a(t) {
 async function Oa(t) {
     return t._onlineComponents || (t._uninitializedComponentsProvider ? (N("FirestoreClient", "Using user provided OnlineComponentProvider"), 
     await ka(t, t._uninitializedComponentsProvider._online)) : (N("FirestoreClient", "Using default OnlineComponentProvider"), 
-    await ka(t, new Pa))), t._onlineComponents;
+    await ka(t, new ba))), t._onlineComponents;
 }
 
 function Fa(t) {
@@ -17246,7 +17246,7 @@ async function Ka(t) {
             const e = L(t);
             e.Au.add(0 /* OfflineCause.UserDisabled */), await Wu(e), 
             // Set the OnlineState to Offline so get()s return from cache, etc.
-            e.Pu.set("Offline" /* OnlineState.Offline */);
+            e.bu.set("Offline" /* OnlineState.Offline */);
         }(n);
     }));
 }
@@ -17375,8 +17375,8 @@ function Ja(t, e) {
         return function(t, e) {
             return new Sa(t, e);
         }(function(t, e) {
-            if (t instanceof Uint8Array) return ba(t, e);
-            if (t instanceof ArrayBuffer) return ba(new Uint8Array(t), e);
+            if (t instanceof Uint8Array) return Pa(t, e);
+            if (t instanceof ArrayBuffer) return Pa(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);
@@ -18361,7 +18361,7 @@ class Eh {
     });
 }
 
-function Ph(e, n) {
+function bh(e, n) {
     const s = "object" == typeof e ? e : app.getApp(), i = "string" == typeof e ? e : n || "(default)", r = app._getProvider(s, "firestore").getImmediate({
         identifier: i
     });
@@ -18374,7 +18374,7 @@ function Ph(e, n) {
 
 /**
  * @internal
- */ function bh(t) {
+ */ function Ph(t) {
     return t._firestoreClient || Vh(t), t._firestoreClient.verifyNotTerminated(), t._firestoreClient;
 }
 
@@ -18419,10 +18419,10 @@ function Vh(t) {
  * is already specified will throw an exception.
  */ function Sh(t, e) {
     Bh(t = uh(t, vh));
-    const n = bh(t);
+    const n = Ph(t);
     if (n._uninitializedComponentsProvider) throw new U(q.FAILED_PRECONDITION, "SDK cache is already specified.");
     M("enableIndexedDbPersistence() will be deprecated in the future, you can use `FirestoreSettings.cache` instead.");
-    const s = t._freezeSettings(), i = new Pa;
+    const s = t._freezeSettings(), i = new ba;
     return Ch(n, i, new va(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
 }
 
@@ -18453,10 +18453,10 @@ function Vh(t) {
  * is already specified will throw an exception.
  */ function Dh(t) {
     Bh(t = uh(t, vh));
-    const e = bh(t);
+    const e = Ph(t);
     if (e._uninitializedComponentsProvider) throw new U(q.FAILED_PRECONDITION, "SDK cache is already specified.");
     M("enableMultiTabIndexedDbPersistence() will be deprecated in the future, you can use `FirestoreSettings.cache` instead.");
-    const n = t._freezeSettings(), s = new Pa;
+    const n = t._freezeSettings(), s = new ba;
     return Ch(e, s, new Ra(s, n.cacheSizeBytes));
 }
 
@@ -18505,9 +18505,9 @@ function Vh(t) {
     return t._queue.enqueueAndForgetEvenWhileRestricted((async () => {
         try {
             await async function(t) {
-                if (!bt.D()) return Promise.resolve();
+                if (!Pt.D()) return Promise.resolve();
                 const e = t + "main";
-                await bt.delete(e);
+                await Pt.delete(e);
             }(Zo(t._databaseId, t._persistenceKey)), e.resolve();
         } catch (t) {
             e.reject(t);
@@ -18534,7 +18534,7 @@ function Vh(t) {
     return function(t) {
         const e = new K;
         return t.asyncQueue.enqueueAndForget((async () => Zc(await qa(t), e))), e.promise;
-    }(bh(t = uh(t, vh)));
+    }(Ph(t = uh(t, vh)));
 }
 
 /**
@@ -18543,7 +18543,7 @@ function Vh(t) {
  *
  * @returns A `Promise` that is resolved once the network has been enabled.
  */ function kh(t) {
-    return Ga(bh(t = uh(t, vh)));
+    return Ga(Ph(t = uh(t, vh)));
 }
 
 /**
@@ -18554,7 +18554,7 @@ function Vh(t) {
  *
  * @returns A `Promise` that is resolved once the network has been disabled.
  */ function Mh(t) {
-    return Qa(bh(t = uh(t, vh)));
+    return Qa(Ph(t = uh(t, vh)));
 }
 
 /**
@@ -18593,7 +18593,7 @@ function Vh(t) {
  * updates, and completion or error events. It can be used as a
  * `Promise<LoadBundleTaskProgress>`.
  */ function Oh(t, e) {
-    const n = bh(t = uh(t, vh)), s = new Eh;
+    const n = Ph(t = uh(t, vh)), s = new Eh;
     return Ya(n, t._databaseId, e, s), s;
 }
 
@@ -18609,7 +18609,7 @@ function Vh(t) {
  * @param name - The name of the query.
  * @returns A `Promise` that is resolved with the Query or `null`.
  */ function Fh(t, e) {
-    return Xa(bh(t = uh(t, vh)), e).then((e => e ? new dh(t, null, e.query) : null));
+    return Xa(Ph(t = uh(t, vh)), e).then((e => e ? new dh(t, null, e.query) : null));
 }
 
 function Bh(t) {
@@ -19120,7 +19120,7 @@ class el extends Qh {
 
 class sl extends Qh {
     _toFieldTransform(t) {
-        return new Ms(t.path, new bs);
+        return new Ms(t.path, new Ps);
     }
     isEqual(t) {
         return t instanceof sl;
@@ -19579,7 +19579,7 @@ function gl(t, e, n, s, i) {
 function Rl(t, e, ...n) {
     let s = [];
     e instanceof Al && s.push(e), s = s.concat(n), function(t) {
-        const e = t.filter((t => t instanceof Vl)).length, n = t.filter((t => t instanceof Pl)).length;
+        const e = t.filter((t => t instanceof Vl)).length, n = t.filter((t => t instanceof bl)).length;
         if (e > 1 || e > 0 && n > 0) throw new U(q.INVALID_ARGUMENT, "InvalidQuery. When using composite filters, you cannot use more than one filter at the top level. Consider nesting the multiple filters within an `and(...)` statement. For example: change `query(query, where(...), or(...))` to `query(query, and(where(...), or(...)))`.");
     }
     /**
@@ -19614,7 +19614,7 @@ function Rl(t, e, ...n) {
  * `QueryFieldFilterConstraint`s are created by invoking {@link where} and can then
  * be passed to {@link (query:1)} to create a new query instance that also contains
  * this `QueryFieldFilterConstraint`.
- */ class Pl extends vl {
+ */ class bl extends vl {
     /**
      * @internal
      */
@@ -19624,7 +19624,7 @@ function Rl(t, e, ...n) {
         this.type = "where";
     }
     static _create(t, e, n) {
-        return new Pl(t, e, n);
+        return new bl(t, e, n);
     }
     _apply(t) {
         const e = this._parse(t);
@@ -19664,9 +19664,9 @@ function Rl(t, e, ...n) {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link QueryFieldFilterConstraint}.
- */ function bl(t, e, n) {
+ */ function Pl(t, e, n) {
     const s = e, i = Tl("where", t);
-    return Pl._create(i, s, n);
+    return bl._create(i, s, n);
 }
 
 /**
@@ -20045,7 +20045,7 @@ function jl(t, e, n) {
 }
 
 function zl(t, e) {
-    if (!(e instanceof Pl || e instanceof Vl)) throw new U(q.INVALID_ARGUMENT, `Function ${t}() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'.`);
+    if (!(e instanceof bl || e instanceof Vl)) throw new U(q.INVALID_ARGUMENT, `Function ${t}() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'.`);
 }
 
 class Wl {
@@ -20517,7 +20517,7 @@ function uf(t) {
  */ function af(t) {
     t = uh(t, fh);
     const e = uh(t.firestore, vh);
-    return za(bh(e), t._key).then((n => Af(e, t, n)));
+    return za(Ph(e), t._key).then((n => Af(e, t, n)));
 }
 
 class hf extends Wl {
@@ -20541,7 +20541,7 @@ class hf extends Wl {
  * current document contents.
  */ function lf(t) {
     t = uh(t, fh);
-    const e = uh(t.firestore, vh), n = bh(e), s = new hf(e);
+    const e = uh(t.firestore, vh), n = Ph(e), s = new hf(e);
     return ja(n, t._key).then((n => new sf(e, s, t._key, n, new nf(null !== n && n.hasLocalMutations, 
     /* fromCache= */ !0), t.converter)));
 }
@@ -20555,7 +20555,7 @@ class hf extends Wl {
  */ function ff(t) {
     t = uh(t, fh);
     const e = uh(t.firestore, vh);
-    return za(bh(e), t._key, {
+    return za(Ph(e), t._key, {
         source: "server"
     }).then((n => Af(e, t, n)));
 }
@@ -20571,7 +20571,7 @@ class hf extends Wl {
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function df(t) {
     t = uh(t, dh);
-    const e = uh(t.firestore, vh), n = bh(e), s = new hf(e);
+    const e = uh(t.firestore, vh), n = Ph(e), s = new hf(e);
     return El(t._query), Ha(n, t._query).then((n => new of(e, s, t, n)));
 }
 
@@ -20583,7 +20583,7 @@ class hf extends Wl {
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function wf(t) {
     t = uh(t, dh);
-    const e = uh(t.firestore, vh), n = bh(e), s = new hf(e);
+    const e = uh(t.firestore, vh), n = Ph(e), s = new hf(e);
     return Wa(n, t._query).then((n => new of(e, s, t, n)));
 }
 
@@ -20594,7 +20594,7 @@ class hf extends Wl {
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function _f(t) {
     t = uh(t, dh);
-    const e = uh(t.firestore, vh), n = bh(e), s = new hf(e);
+    const e = uh(t.firestore, vh), n = Ph(e), s = new hf(e);
     return Ha(n, t._query, {
         source: "server"
     }).then((n => new of(e, s, t, n)));
@@ -20680,11 +20680,11 @@ function If(t, ...e) {
         return t.asyncQueue.enqueueAndForget((async () => Vc(await Ka(t), r))), () => {
             i.Sc(), t.asyncQueue.enqueueAndForget((async () => Sc(await Ka(t), r)));
         };
-    }(bh(a), h, u, c);
+    }(Ph(a), h, u, c);
 }
 
 function Tf(t, e) {
-    return Ja(bh(t = uh(t, vh)), Th(e) ? e : {
+    return Ja(Ph(t = uh(t, vh)), Th(e) ? e : {
         next: e
     });
 }
@@ -20696,7 +20696,7 @@ function Tf(t, e) {
     return function(t, e) {
         const n = new K;
         return t.asyncQueue.enqueueAndForget((async () => zc(await qa(t), e, n))), n.promise;
-    }(bh(t), e);
+    }(Ph(t), e);
 }
 
 /**
@@ -20783,7 +20783,7 @@ function Tf(t, e) {
  * ```
  * @internal TODO (sum/avg) remove when public
  */ function Rf(t, e) {
-    const n = uh(t.firestore, vh), s = bh(n), i = function(t, e) {
+    const n = uh(t.firestore, vh), s = Ph(n), i = function(t, e) {
         const n = [];
         for (const s in t) Object.prototype.hasOwnProperty.call(t, s) && n.push(e(t[s], s, t));
         return n;
@@ -20834,9 +20834,9 @@ function Tf(t, e) {
  */ (n, t, e)));
 }
 
-class Pf {
+class bf {
     constructor(t) {
-        this.kind = "memory", this._onlineComponentProvider = new Pa, (null == t ? void 0 : t.garbageCollector) ? this._offlineComponentProvider = t.garbageCollector._offlineComponentProvider : this._offlineComponentProvider = new Ea;
+        this.kind = "memory", this._onlineComponentProvider = new ba, (null == t ? void 0 : t.garbageCollector) ? this._offlineComponentProvider = t.garbageCollector._offlineComponentProvider : this._offlineComponentProvider = new Ea;
     }
     toJSON() {
         return {
@@ -20845,7 +20845,7 @@ class Pf {
     }
 }
 
-class bf {
+class Pf {
     constructor(t) {
         let e;
         this.kind = "persistent", (null == t ? void 0 : t.tabManager) ? (t.tabManager._initialize(t), 
@@ -20902,14 +20902,14 @@ class Sf {
  * Creates an instance of `MemoryLocalCache`. The instance can be set to
  * `FirestoreSettings.cache` to tell the SDK which cache layer to use.
  */ function xf(t) {
-    return new Pf(t);
+    return new bf(t);
 }
 
 /**
  * Creates an instance of `PersistentLocalCache`. The instance can be set to
  * `FirestoreSettings.cache` to tell the SDK which cache layer to use.
  */ function Nf(t) {
-    return new bf(t);
+    return new Pf(t);
 }
 
 class kf {
@@ -20924,7 +20924,7 @@ class kf {
     /**
      * @internal
      */    _initialize(t) {
-        this._onlineComponentProvider = new Pa, this._offlineComponentProvider = new va(this._onlineComponentProvider, null == t ? void 0 : t.cacheSizeBytes, this.forceOwnership);
+        this._onlineComponentProvider = new ba, this._offlineComponentProvider = new va(this._onlineComponentProvider, null == t ? void 0 : t.cacheSizeBytes, this.forceOwnership);
     }
 }
 
@@ -20940,7 +20940,7 @@ class Mf {
     /**
      * @internal
      */    _initialize(t) {
-        this._onlineComponentProvider = new Pa, this._offlineComponentProvider = new Ra(this._onlineComponentProvider, null == t ? void 0 : t.cacheSizeBytes);
+        this._onlineComponentProvider = new ba, this._offlineComponentProvider = new Ra(this._onlineComponentProvider, null == t ? void 0 : t.cacheSizeBytes);
     }
 }
 
@@ -21194,7 +21194,7 @@ class qf extends class {
             const i = await Ua(t);
             new Ca(t.asyncQueue, i, n, e, s).run();
         })), s.promise;
-    }(bh(t), (n => e(new qf(t, n))), s);
+    }(Ph(t), (n => e(new qf(t, n))), s);
 }
 
 /**
@@ -21309,7 +21309,7 @@ class qf extends class {
  * @returns A {@link WriteBatch} that can be used to atomically execute multiple
  * writes.
  */ function Wf(t) {
-    return bh(t = uh(t, vh)), new Bf(t, (e => Ef(t, e)));
+    return Ph(t = uh(t, vh)), new Bf(t, (e => Ef(t, e)));
 }
 
 /**
@@ -21329,7 +21329,7 @@ class qf extends class {
  * limitations under the License.
  */ function Hf(t, e) {
     var n;
-    const s = bh(t = uh(t, vh));
+    const s = Ph(t = uh(t, vh));
     if (!s._uninitializedComponentsProvider || "memory" === (null === (n = s._uninitializedComponentsProvider) || void 0 === n ? void 0 : n._offlineKind)) 
     // PORTING NOTE: We don't return an error if the user has not enabled
     // persistence since `enableIndexeddbPersistence()` can fail on the Web.
@@ -21375,9 +21375,9 @@ function Jf(t, e) {
         return s = Object.assign({
             useFetchStreams: e
         }, s), r._setSettings(s), r;
-    }), "PUBLIC").setMultipleInstances(!0)), app.registerVersion(b, "3.11.0-canary.98d0b8498", t), 
+    }), "PUBLIC").setMultipleInstances(!0)), app.registerVersion(P, "3.11.0-canary.a0bb76884", t), 
     // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-    app.registerVersion(b, "3.11.0-canary.98d0b8498", "cjs2017");
+    app.registerVersion(P, "3.11.0-canary.a0bb76884", "cjs2017");
 }();
 
 exports.AbstractUserDataWriter = Wl;
@@ -21399,7 +21399,7 @@ exports.QueryCompositeFilterConstraint = Vl;
 exports.QueryConstraint = vl;
 exports.QueryDocumentSnapshot = rf;
 exports.QueryEndAtConstraint = Bl;
-exports.QueryFieldFilterConstraint = Pl;
+exports.QueryFieldFilterConstraint = bl;
 exports.QueryLimitConstraint = Nl;
 exports.QueryOrderByConstraint = Cl;
 exports.QuerySnapshot = of;
@@ -21416,7 +21416,7 @@ exports._FieldPath = at;
 exports._TestingHooks = ci;
 exports._cast = uh;
 exports._debugAssert = B;
-exports._isBase64Available = be;
+exports._isBase64Available = Pe;
 exports._logWarn = M;
 exports._validateIsNotUsedTogether = sh;
 exports.addDoc = pf;
@@ -21441,7 +21441,7 @@ exports.enableMultiTabIndexedDbPersistence = Dh;
 exports.enableNetwork = kh;
 exports.endAt = ql;
 exports.endBefore = Ll;
-exports.ensureFirestoreConfigured = bh;
+exports.ensureFirestoreConfigured = Ph;
 exports.executeWrite = Ef;
 exports.getAggregateFromServer = Rf;
 exports.getCountFromServer = vf;
@@ -21451,7 +21451,7 @@ exports.getDocFromServer = ff;
 exports.getDocs = df;
 exports.getDocsFromCache = wf;
 exports.getDocsFromServer = _f;
-exports.getFirestore = Ph;
+exports.getFirestore = bh;
 exports.increment = zf;
 exports.initializeFirestore = Rh;
 exports.limit = kl;
@@ -21483,6 +21483,6 @@ exports.sum = Yl;
 exports.terminate = $h;
 exports.updateDoc = gf;
 exports.waitForPendingWrites = Nh;
-exports.where = bl;
+exports.where = Pl;
 exports.writeBatch = Wf;
 //# sourceMappingURL=index.cjs.js.map