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

package/dist/index.esm2017.js

@@ -66,7 +66,7 @@ D.MOCK_USER = new D("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let C = "9.6.0";
+let C = "9.6.1-canary.0db840a09";
 
 /**
  * @license
@@ -1408,7 +1408,7 @@ function Rt(t) {
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Pt(t) {
+ */ function bt(t) {
     const e = Tt(t.mapValue.fields.__local_write_time__.timestampValue);
     return new at(e.seconds, e.nanos);
 }
@@ -1433,7 +1433,7 @@ function Rt(t) {
 /**
  * Returns whether a variable is either undefined or null.
  */
-function bt(t) {
+function Pt(t) {
     return null == t;
 }
 
@@ -1534,7 +1534,7 @@ function bt(t) {
         return t.booleanValue === e.booleanValue;
 
       case 4 /* ServerTimestampValue */ :
-        return Pt(t).isEqual(Pt(e));
+        return bt(t).isEqual(bt(e));
 
       case 3 /* TimestampValue */ :
         return function(t, e) {
@@ -1614,7 +1614,7 @@ function kt(t, e) {
         return xt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return xt(Pt(t), Pt(e));
+        return xt(bt(t), bt(e));
 
       case 5 /* StringValue */ :
         return it(t.stringValue, e.stringValue);
@@ -1997,7 +1997,7 @@ function Lt(t) {
     isEqual(t) {
         return t instanceof Wt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
     }
-    clone() {
+    mutableCopy() {
         return new Wt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
     }
     toString() {
@@ -2052,7 +2052,7 @@ function Ht(t) {
         t += "|ob:", t += e.orderBy.map((t => function(t) {
             // TODO(b/29183165): Make this collision robust.
             return t.field.canonicalString() + t.dir;
-        }(t))).join(","), bt(e.limit) || (t += "|l:", t += e.limit), e.startAt && (t += "|lb:", 
+        }(t))).join(","), Pt(e.limit) || (t += "|l:", t += e.limit), e.startAt && (t += "|lb:", 
         t += he(e.startAt)), e.endAt && (t += "|ub:", t += he(e.endAt)), e.R = t;
     }
     return e.R;
@@ -2066,7 +2066,7 @@ function Jt(t) {
         /** Returns a debug description for `filter`. */
         var e;
         /** Filter that matches on key fields (i.e. '__name__'). */    })).join(", ")}]`), 
-    bt(t.limit) || (e += ", limit: " + t.limit), t.orderBy.length > 0 && (e += `, orderBy: [${t.orderBy.map((t => function(t) {
+    Pt(t.limit) || (e += ", limit: " + t.limit), t.orderBy.length > 0 && (e += `, orderBy: [${t.orderBy.map((t => function(t) {
         return `${t.field.canonicalString()} (${t.dir})`;
     }(t))).join(", ")}]`), t.startAt && (e += ", startAt: " + he(t.startAt)), t.endAt && (e += ", endAt: " + he(t.endAt)), 
     `Target(${e})`;
@@ -2327,11 +2327,11 @@ function we(t, e) {
  * we have to split the query into a set of collection queries at multiple
  * paths.
  */ function ye(t) {
-    return !bt(t.limit) && "F" /* First */ === t.limitType;
+    return !Pt(t.limit) && "F" /* First */ === t.limitType;
 }
 
 function pe(t) {
-    return !bt(t.limit) && "L" /* Last */ === t.limitType;
+    return !Pt(t.limit) && "L" /* Last */ === t.limitType;
 }
 
 function Te(t) {
@@ -2401,11 +2401,11 @@ function Ie(t) {
     return e.D;
 }
 
-function Pe(t, e, n) {
+function be(t, e, n) {
     return new _e(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
 }
 
-function be(t, e) {
+function Pe(t, e) {
     return Yt(Re(t), Re(e)) && t.limitType === e.limitType;
 }
 
@@ -3669,14 +3669,14 @@ function An() {
 
 const Rn = new gn(St.comparator);
 
-function Pn() {
+function bn() {
     return Rn;
 }
 
-const bn = new gn(St.comparator);
+const Pn = new gn(St.comparator);
 
 function vn() {
-    return bn;
+    return Pn;
 }
 
 const Vn = new Tn(St.comparator);
@@ -4601,7 +4601,7 @@ function hs(t, e) {
     }(e.orderBy);
     r && (n.structuredQuery.orderBy = r);
     const o = function(t, e) {
-        return t.C || bt(e) ? e : {
+        return t.C || Pt(e) ? e : {
             value: e
         };
     }
@@ -4645,7 +4645,7 @@ function ls(t) {
     let a = null;
     n.limit && (a = function(t) {
         let e;
-        return e = "object" == typeof t ? t.value : t, bt(e) ? null : e;
+        return e = "object" == typeof t ? t.value : t, Pt(e) ? null : e;
     }(n.limit));
     let c = null;
     n.startAt && (c = _s(n.startAt));
@@ -4812,11 +4812,11 @@ function As(t) {
  */
 function Rs(t) {
     let e = "";
-    for (let n = 0; n < t.length; n++) e.length > 0 && (e = bs(e)), e = Ps(t.get(n), e);
-    return bs(e);
+    for (let n = 0; n < t.length; n++) e.length > 0 && (e = Ps(e)), e = bs(t.get(n), e);
+    return Ps(e);
 }
 
-/** Encodes a single segment of a resource path into the given result */ function Ps(t, e) {
+/** Encodes a single segment of a resource path into the given result */ function bs(t, e) {
     let n = e;
     const s = t.length;
     for (let e = 0; e < s; e++) {
@@ -4837,7 +4837,7 @@ function Rs(t) {
     return n;
 }
 
-/** Encodes a path separator into the given result */ function bs(t) {
+/** Encodes a path separator into the given result */ function Ps(t) {
     return t + "

";
 }
 
@@ -5691,12 +5691,12 @@ class zs {
         // 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 === Hs.Pt(getUA()) && F("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 === Hs.bt(getUA()) && F("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 $("SimpleDb", "Removing database:", t), ti(window.indexedDB.deleteDatabase(t)).toPromise();
     }
-    /** Returns true if IndexedDB is available in the current environment. */    static bt() {
+    /** Returns true if IndexedDB is available in the current environment. */    static Pt() {
         if (!isIndexedDBAvailable()) return !1;
         if (Hs.vt()) return !0;
         // We extensively use indexed array values and compound keys,
@@ -5706,7 +5706,7 @@ class zs {
         // 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 = getUA(), e = Hs.Pt(t), n = 0 < e && e < 10, s = Hs.Vt(t), i = 0 < s && s < 4.5;
+                const t = getUA(), e = Hs.bt(t), n = 0 < e && e < 10, s = Hs.Vt(t), i = 0 < s && s < 4.5;
         // IE 10
         // ua = 'Mozilla/5.0 (compatible; MSIE 10.0; Windows NT 6.2; Trident/6.0)';
         // IE 11
@@ -5729,7 +5729,7 @@ class zs {
     }
     // visible for testing
     /** Parse User Agent to determine iOS version. Returns -1 if not found. */
-    static Pt(t) {
+    static bt(t) {
         const e = t.match(/i(?:phone|pad|pod) os ([\d_]+)/i), n = e ? e[1].split("_").slice(0, 2).join(".") : "-1";
         return Number(n);
     }
@@ -5999,7 +5999,7 @@ class zs {
 let ei = !1;
 
 function ni(t) {
-    const e = Hs.Pt(getUA());
+    const e = Hs.bt(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) {
@@ -6354,7 +6354,7 @@ function yi(t) {
         parent: t.parent,
         structuredQuery: t.structuredQuery
     });
-    return "LAST" === t.limitType ? Pe(e, e.limit, "L" /* Last */) : e;
+    return "LAST" === t.limitType ? be(e, e.limit, "L" /* Last */) : e;
 }
 
 /** Encodes a NamedQuery proto object to a NamedQuery model object. */
@@ -6526,7 +6526,7 @@ class pi {
                 collectionId: n,
                 parent: Rs(s)
             };
-            return Pi(t).put(i);
+            return bi(t).put(i);
         }
         return Gs.resolve();
     }
@@ -6534,7 +6534,7 @@ class pi {
         const n = [], s = IDBKeyRange.bound([ e, "" ], [ ot(e), "" ], 
         /*lowerOpen=*/ !1, 
         /*upperOpen=*/ !0);
-        return Pi(t).Bt(s).next((t => {
+        return bi(t).Bt(s).next((t => {
             for (const s of t) {
                 // This collectionId guard shouldn't be necessary (and isn't as long
                 // as we're running in a real browser), but there's a bug in
@@ -6551,7 +6551,7 @@ class pi {
 /**
  * Helper to get a typed SimpleDbStore for the collectionParents
  * document store.
- */ function Pi(t) {
+ */ function bi(t) {
     return ii(t, Bs.store);
 }
 
@@ -6570,7 +6570,7 @@ class pi {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const bi = {
+ */ const Pi = {
     didRun: !1,
     sequenceNumbersCollected: 0,
     targetsRemoved: 0,
@@ -7309,8 +7309,8 @@ class $i {
     }
     collect(t, e) {
         return -1 === this.params.cacheSizeCollectionThreshold ? ($("LruGarbageCollector", "Garbage collection skipped; disabled"), 
-        Gs.resolve(bi)) : this.getCacheSize(t).next((n => n < this.params.cacheSizeCollectionThreshold ? ($("LruGarbageCollector", `Garbage collection skipped; Cache size ${n} is lower than threshold ${this.params.cacheSizeCollectionThreshold}`), 
-        bi) : this.Te(t, e)));
+        Gs.resolve(Pi)) : this.getCacheSize(t).next((n => n < this.params.cacheSizeCollectionThreshold ? ($("LruGarbageCollector", `Garbage collection skipped; Cache size ${n} is lower than threshold ${this.params.cacheSizeCollectionThreshold}`), 
+        Pi) : this.Te(t, e)));
     }
     getCacheSize(t) {
         return this.ge.getCacheSize(t);
@@ -7682,23 +7682,23 @@ function Wi(t, e) {
         return this.getMetadata(t).next((n => (n.byteSize += e, this.Re(t, n))));
     }
     getEntry(t, e) {
-        return Xi(t).get(Zi(e)).next((t => this.Pe(e, t)));
+        return Xi(t).get(Zi(e)).next((t => this.be(e, t)));
     }
     /**
      * Looks up an entry in the cache.
      *
      * @param documentKey - The key of the entry to look up.
      * @returns The cached document entry and its size.
-     */    be(t, e) {
+     */    Pe(t, e) {
         return Xi(t).get(Zi(e)).next((t => ({
-            document: this.Pe(e, t),
+            document: this.be(e, t),
             size: Si(t)
         })));
     }
     getEntries(t, e) {
         let n = An();
         return this.ve(t, e, ((t, e) => {
-            const s = this.Pe(t, e);
+            const s = this.be(t, e);
             n = n.insert(t, s);
         })).next((() => n));
     }
@@ -7711,7 +7711,7 @@ function Wi(t, e) {
      */    Ve(t, e) {
         let n = An(), s = new gn(St.comparator);
         return this.ve(t, e, ((t, e) => {
-            const i = this.Pe(t, e);
+            const i = this.be(t, e);
             n = n.insert(t, i), s = s.insert(t, Si(e));
         })).next((() => ({
             documents: n,
@@ -7781,7 +7781,7 @@ function Wi(t, e) {
     /**
      * Decodes `remoteDoc` and returns the document (or null, if the document
      * corresponds to the format used for sentinel deletes).
-     */    Pe(t, e) {
+     */    be(t, e) {
         if (e) {
             const t = ui(this.k, e);
             // Whether the document is a sentinel removal and should only be used in the
@@ -7840,7 +7840,7 @@ class Ji extends zi {
     }
     getFromCache(t, e) {
         // Record the size of everything we load from the cache so we can compute a delta later.
-        return this.De.be(t, e).next((t => (this.Ce.set(e, t.size), t.document)));
+        return this.De.Pe(t, e).next((t => (this.Ce.set(e, t.size), t.document)));
     }
     getAllFromCache(t, e) {
         // Record the size of everything we load from the cache so we can compute
@@ -8173,7 +8173,7 @@ class sr {
         /** The last time we garbage collected the client metadata object store. */
         this.Qe = Number.NEGATIVE_INFINITY, 
         /** A listener to notify on primary state changes. */
-        this.We = t => Promise.resolve(), !sr.bt()) throw new j(K.UNIMPLEMENTED, "This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.");
+        this.We = t => Promise.resolve(), !sr.Pt()) throw new j(K.UNIMPLEMENTED, "This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.");
         this.referenceDelegate = new Qi(this, s), this.Ge = e + "main", this.k = new ci(a), 
         this.ze = new Hs(this.Ge, 11, new tr(this.k)), this.He = new Fi(this.referenceDelegate, this.k), 
         this.Jt = new Ri, this.Je = function(t, e) {
@@ -8429,8 +8429,8 @@ class sr {
         const e = new Ss(this.clientId, this.allowTabSynchronization, Date.now());
         return ir(t).put(Ss.key, e);
     }
-    static bt() {
-        return Hs.bt();
+    static Pt() {
+        return Hs.Pt();
     }
     /** Checks the primary lease and removes it if we are the current primary. */    an(t) {
         const e = ir(t);
@@ -8593,9 +8593,9 @@ class ar {
      * @returns Local view of the document or null if we don't have any cached
      * state for it.
      */    Rn(t, e) {
-        return this.An.getAllMutationBatchesAffectingDocumentKey(t, e).next((n => this.Pn(t, e, n)));
+        return this.An.getAllMutationBatchesAffectingDocumentKey(t, e).next((n => this.bn(t, e, n)));
     }
-    /** Internal version of `getDocument` that allows reusing batches. */    Pn(t, e, n) {
+    /** Internal version of `getDocument` that allows reusing batches. */    bn(t, e, n) {
         return this.Je.getEntry(t, e).next((t => {
             for (const e of n) e.applyToLocalView(t);
             return t;
@@ -8603,7 +8603,7 @@ class ar {
     }
     // Returns the view of the given `docs` as they would appear after applying
     // all mutations in the given `batches`.
-    bn(t, e) {
+    Pn(t, e) {
         t.forEach(((t, n) => {
             for (const t of e) t.applyToLocalView(n);
         }));
@@ -8620,7 +8620,7 @@ class ar {
      * Applies the local view the given `baseDocs` without retrieving documents
      * from the local store.
      */    Vn(t, e) {
-        return this.An.getAllMutationBatchesAffectingDocumentKeys(t, e).next((t => this.bn(e, t)));
+        return this.An.getAllMutationBatchesAffectingDocumentKeys(t, e).next((t => this.Pn(e, t)));
     }
     /**
      * Performs a query against the local view of all documents.
@@ -8641,13 +8641,13 @@ class ar {
     Sn(t, e) {
         // Just do a simple document lookup.
         return this.Rn(t, new St(e)).next((t => {
-            let e = Pn();
+            let e = bn();
             return t.isFoundDocument() && (e = e.insert(t.key, t)), e;
         }));
     }
     Dn(t, e, n) {
         const s = e.collectionGroup;
-        let i = Pn();
+        let i = bn();
         return this.Jt.getCollectionParents(t, s).next((r => Gs.forEach(r, (r => {
             const o = function(t, e) {
                 return new _e(e, 
@@ -9279,7 +9279,7 @@ async function Rr(t) {
  * LocalDocuments are re-calculated if there are remaining mutations in the
  * queue.
  */
-async function Pr(t, e, n, s) {
+async function br(t, e, n, s) {
     const i = q(t);
     let r = Sn(), o = An(), a = vn();
     for (const t of n) {
@@ -9306,7 +9306,7 @@ async function Pr(t, e, n, s) {
 /**
  * Saves the given `NamedQuery` to local persistence.
  */
-async function br(t, e, n = Sn()) {
+async function Pr(t, e, n = Sn()) {
     // Allocate a target for the named query such that it can be resumed
     // from associated read time if users use it to listen.
     // NOTE: this also means if no corresponding target exists, the new target
@@ -9669,7 +9669,7 @@ class Cr {
      */    addEntry(t, e, n) {
         const s = e.key, i = this.docs.get(s), r = i ? i.size : 0, o = this.Ts(e);
         return this.docs = this.docs.insert(s, {
-            document: e.clone(),
+            document: e.mutableCopy(),
             size: o,
             readTime: n
         }), this.size += o - r, this.Jt.addToCollectionParentIndex(t, s.path.popLast());
@@ -9685,13 +9685,13 @@ class Cr {
     }
     getEntry(t, e) {
         const n = this.docs.get(e);
-        return Gs.resolve(n ? n.document.clone() : Wt.newInvalidDocument(e));
+        return Gs.resolve(n ? n.document.mutableCopy() : Wt.newInvalidDocument(e));
     }
     getEntries(t, e) {
         let n = An();
         return e.forEach((t => {
             const e = this.docs.get(t);
-            n = n.insert(t, e ? e.document.clone() : Wt.newInvalidDocument(t));
+            n = n.insert(t, e ? e.document.mutableCopy() : Wt.newInvalidDocument(t));
         })), Gs.resolve(n);
     }
     getDocumentsMatchingQuery(t, e, n) {
@@ -9702,7 +9702,7 @@ class Cr {
         for (;r.hasNext(); ) {
             const {key: t, value: {document: i, readTime: o}} = r.getNext();
             if (!e.path.isPrefixOf(t.path)) break;
-            o.compareTo(n) <= 0 || Se(e, i) && (s = s.insert(i.key, i.clone()));
+            o.compareTo(n) <= 0 || Se(e, i) && (s = s.insert(i.key, i.mutableCopy()));
         }
         return Gs.resolve(s);
     }
@@ -9780,7 +9780,7 @@ class Nr extends zi {
          * A ordered bidirectional mapping between documents and the remote target
          * IDs.
          */
-        this.Rs = new Vr, this.targetCount = 0, this.Ps = $i.ie();
+        this.Rs = new Vr, this.targetCount = 0, this.bs = $i.ie();
     }
     forEachTarget(t, e) {
         return this.Is.forEach(((t, n) => e(n))), Gs.resolve();
@@ -9792,7 +9792,7 @@ class Nr extends zi {
         return Gs.resolve(this.As);
     }
     allocateTargetId(t) {
-        return this.highestTargetId = this.Ps.next(), Gs.resolve(this.highestTargetId);
+        return this.highestTargetId = this.bs.next(), Gs.resolve(this.highestTargetId);
     }
     setTargetsMetadata(t, e, n) {
         return n && (this.lastRemoteSnapshotVersion = n), e > this.As && (this.As = e), 
@@ -9801,7 +9801,7 @@ class Nr extends zi {
     ce(t) {
         this.Is.set(t.target, t);
         const e = t.targetId;
-        e > this.highestTargetId && (this.Ps = new $i(e), this.highestTargetId = e), t.sequenceNumber > this.As && (this.As = t.sequenceNumber);
+        e > this.highestTargetId && (this.bs = new $i(e), this.highestTargetId = e), t.sequenceNumber > this.As && (this.As = t.sequenceNumber);
     }
     addTargetData(t, e) {
         return this.ce(e), this.targetCount += 1, Gs.resolve();
@@ -9878,7 +9878,7 @@ class xr {
      * checked or asserted on every access.
      */
     constructor(t, e) {
-        this.bs = {}, this.Be = new et(0), this.Ue = !1, this.Ue = !0, this.referenceDelegate = t(this), 
+        this.Ps = {}, this.Be = new et(0), this.Ue = !1, this.Ue = !0, this.referenceDelegate = t(this), 
         this.He = new kr(this);
         this.Jt = new Ii, this.Je = function(t, e) {
             return new Cr(t, e);
@@ -9904,8 +9904,8 @@ class xr {
         return this.Jt;
     }
     getMutationQueue(t) {
-        let e = this.bs[t.toKey()];
-        return e || (e = new Dr(this.Jt, this.referenceDelegate), this.bs[t.toKey()] = e), 
+        let e = this.Ps[t.toKey()];
+        return e || (e = new Dr(this.Jt, this.referenceDelegate), this.Ps[t.toKey()] = e), 
         e;
     }
     getTargetCache() {
@@ -9924,7 +9924,7 @@ class xr {
         t)));
     }
     Ds(t, e) {
-        return Gs.or(Object.values(this.bs).map((n => () => n.containsKey(t, e))));
+        return Gs.or(Object.values(this.Ps).map((n => () => n.containsKey(t, e))));
     }
 }
 
@@ -10237,7 +10237,7 @@ class jr {
         // mutations but before we observe WebStorage events.
         this.window.addEventListener("storage", this.Us);
     }
-    /** Returns 'true' if WebStorage is available in the current environment. */    static bt(t) {
+    /** Returns 'true' if WebStorage is available in the current environment. */    static Pt(t) {
         return !(!t || !t.localStorage);
     }
     async start() {
@@ -10583,10 +10583,10 @@ class Wr {
  */
 class zr {
     constructor() {
-        this.Ii = () => this.Ai(), this.Ri = () => this.Pi(), this.bi = [], this.vi();
+        this.Ii = () => this.Ai(), this.Ri = () => this.bi(), this.Pi = [], this.vi();
     }
     Ei(t) {
-        this.bi.push(t);
+        this.Pi.push(t);
     }
     shutdown() {
         window.removeEventListener("online", this.Ii), window.removeEventListener("offline", this.Ri);
@@ -10596,16 +10596,16 @@ class zr {
     }
     Ai() {
         $("ConnectivityMonitor", "Network connectivity changed: AVAILABLE");
-        for (const t of this.bi) t(0 /* AVAILABLE */);
+        for (const t of this.Pi) t(0 /* AVAILABLE */);
     }
-    Pi() {
+    bi() {
         $("ConnectivityMonitor", "Network connectivity changed: UNAVAILABLE");
-        for (const t of this.bi) t(1 /* UNAVAILABLE */);
+        for (const t of this.Pi) t(1 /* UNAVAILABLE */);
     }
     // TODO(chenbrian): Consider passing in window either into this component or
     // here for testing via FakeWindow.
     /** Checks that all used attributes of window are available. */
-    static bt() {
+    static Pt() {
         return "undefined" != typeof window && void 0 !== window.addEventListener && void 0 !== window.removeEventListener;
     }
 }
@@ -11327,14 +11327,14 @@ class no {
             const e = t.targetChange;
             return e.targetIds && e.targetIds.length ? ct.min() : e.readTime ? Gn(e.readTime) : ct.min();
         }(t);
-        return this.listener.Pr(e, n);
+        return this.listener.br(e, n);
     }
     /**
      * Registers interest in the results of the given target. If the target
      * includes a resumeToken it will be included in the request. Results that
      * affect the target will be streamed back as WatchChange messages that
      * reference the targetId.
-     */    br(t) {
+     */    Pr(t) {
         const e = {};
         e.database = ts(this.k), e.addTarget = function(t, e) {
             let n;
@@ -11683,7 +11683,7 @@ function ho(t, e) {
  * We need to increment the the expected number of pending responses we're due
  * from watch so we wait for the ack to process any messages from this target.
  */ function fo(t, e) {
-    t.Yr.X(e.targetId), xo(t).br(e);
+    t.Yr.X(e.targetId), xo(t).Pr(e);
 }
 
 /**
@@ -11841,13 +11841,13 @@ async function Eo(t, e, n) {
 async function Ro(t) {
     const e = q(t), n = $o(e);
     let s = e.Qr.length > 0 ? e.Qr[e.Qr.length - 1].batchId : -1;
-    for (;Po(e); ) try {
+    for (;bo(e); ) try {
         const t = await yr(e.localStore, s);
         if (null === t) {
             0 === e.Qr.length && n._r();
             break;
         }
-        s = t.batchId, bo(e, t);
+        s = t.batchId, Po(e, t);
     } catch (t) {
         await Io(e, t);
     }
@@ -11857,14 +11857,14 @@ async function Ro(t) {
 /**
  * Returns true if we can add to the write pipeline (i.e. the network is
  * enabled and the write pipeline is not full).
- */ function Po(t) {
+ */ function bo(t) {
     return go(t) && t.Qr.length < 10;
 }
 
 /**
  * Queues additional writes to be sent to the write stream, sending them
  * immediately if the write stream is established.
- */ function bo(t, e) {
+ */ function Po(t, e) {
     t.Qr.push(e);
     const n = $o(t);
     n.lr() && n.Sr && n.Dr(e.mutations);
@@ -11964,7 +11964,7 @@ async function ko(t, e) {
  */ (t.datastore, t.asyncQueue, {
         Di: po.bind(null, t),
         Ni: To.bind(null, t),
-        Pr: Eo.bind(null, t)
+        br: Eo.bind(null, t)
     }), t.zr.push((async e => {
         e ? (t.Xr.wr(), mo(t) ? _o(t) : t.Jr.set("Unknown" /* Unknown */)) : (await t.Xr.stop(), 
         yo(t));
@@ -12116,7 +12116,7 @@ class Fo {
         // We are adding document key comparator to the end as it's the only
         // guaranteed unique property of a document.
         this.comparator = t ? (e, n) => t(e, n) || St.comparator(e.key, n.key) : (t, e) => St.comparator(t.key, e.key), 
-        this.keyedMap = Pn(), this.sortedSet = new gn(this.comparator);
+        this.keyedMap = bn(), this.sortedSet = new gn(this.comparator);
     }
     /**
      * Returns an empty copy of the existing DocumentSet, using the same
@@ -12263,7 +12263,7 @@ class Bo {
         return !this.mutatedKeys.isEmpty();
     }
     isEqual(t) {
-        if (!(this.fromCache === t.fromCache && this.syncStateChanged === t.syncStateChanged && this.mutatedKeys.isEqual(t.mutatedKeys) && be(this.query, t.query) && this.docs.isEqual(t.docs) && this.oldDocs.isEqual(t.oldDocs))) return !1;
+        if (!(this.fromCache === t.fromCache && this.syncStateChanged === t.syncStateChanged && this.mutatedKeys.isEqual(t.mutatedKeys) && Pe(this.query, t.query) && this.docs.isEqual(t.docs) && this.oldDocs.isEqual(t.oldDocs))) return !1;
         const e = this.docChanges, n = t.docChanges;
         if (e.length !== n.length) return !1;
         for (let t = 0; t < e.length; t++) if (e[t].type !== n[t].type || !e[t].doc.isEqual(n[t].doc)) return !1;
@@ -12298,7 +12298,7 @@ class Bo {
 
 class qo {
     constructor() {
-        this.queries = new Gi((t => ve(t)), be), this.onlineState = "Unknown" /* Unknown */ , 
+        this.queries = new Gi((t => ve(t)), Pe), this.onlineState = "Unknown" /* Unknown */ , 
         this.io = new Set;
     }
 }
@@ -12531,8 +12531,8 @@ function Go(t) {
     /**
      * Update the progress to 'Success' and return the updated progress.
      */    async complete() {
-        const t = await Pr(this.localStore, new Jo(this.k), this.documents, this.mo.id), e = this.po(this.documents);
-        for (const t of this.queries) await br(this.localStore, t, e.get(t.name));
+        const t = await br(this.localStore, new Jo(this.k), this.documents, this.mo.id), e = this.po(this.documents);
+        for (const t of this.queries) await Pr(this.localStore, t, e.get(t.name));
         return this.progress.taskState = "Success", new ar(Object.assign({}, this.progress), t);
     }
 }
@@ -12606,7 +12606,7 @@ class ta {
     /**
      * The set of remote documents that the server has told us belongs to the target associated with
      * this view.
-     */    get Po() {
+     */    get bo() {
         return this.To;
     }
     /**
@@ -12618,7 +12618,7 @@ class ta {
      * @param previousChanges - If this is being called with a refill, then start
      *        with this set of docs and changes instead of the current view.
      * @returns a new set of docs, changes, and refill flag.
-     */    bo(t, e) {
+     */    Po(t, e) {
         const n = e ? e.vo : new Lo, s = e ? e.Ro : this.Ro;
         let i = e ? e.mutatedKeys : this.mutatedKeys, r = s, o = !1;
         // Track the last doc in a (full) limit. This is necessary, because some
@@ -12826,7 +12826,7 @@ class ta {
     // PORTING NOTE: Multi-tab only.
     ko(t) {
         this.To = t.zn, this.Io = Sn();
-        const e = this.bo(t.documents);
+        const e = this.Po(t.documents);
         return this.applyChanges(e, /*updateLimboDocuments=*/ !0);
     }
     /**
@@ -12896,7 +12896,7 @@ class na {
     // 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.Fo = {}, this.Oo = new Gi((t => ve(t)), be), 
+        this.currentUser = i, this.maxConcurrentLimboResolutions = r, this.Fo = {}, this.Oo = new Gi((t => ve(t)), Pe), 
         this.Mo = new Map, 
         /**
          * The keys of documents that are in limbo for which we haven't yet started a
@@ -12963,19 +12963,19 @@ async function ra(t, e) {
     // targets based on view changes. This allows us to only depend on Limbo
     // changes when user code includes queries.
     t.Go = (e, n, s) => async function(t, e, n, s) {
-        let i = e.view.bo(n);
+        let i = e.view.Po(n);
         i.Bn && (
         // The query has a limit and some docs were removed, so we need
         // to re-run the query against the local store to make sure we
         // didn't lose any good docs that had been past the limit.
         i = await Er(t.localStore, e.query, 
-        /* usePreviousResults= */ !1).then((({documents: t}) => e.view.bo(t, i))));
+        /* usePreviousResults= */ !1).then((({documents: t}) => e.view.Po(t, i))));
         const r = s && s.targetChanges.get(e.targetId), o = e.view.applyChanges(i, 
         /* updateLimboDocuments= */ t.isPrimaryClient, r);
         return pa(t, e.targetId, o.Co), o.snapshot;
     }(t, e, n, s);
     const i = await Er(t.localStore, e, 
-    /* usePreviousResults= */ !0), r = new ea(e, i.zn), o = r.bo(i.documents), a = kn.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), c = r.applyChanges(o, 
+    /* usePreviousResults= */ !0), r = new ea(e, i.zn), o = r.Po(i.documents), a = kn.createSynthesizedTargetChangeForCurrentChange(n, s && "Offline" /* Offline */ !== t.onlineState), c = r.applyChanges(o, 
     /* updateLimboDocuments= */ t.isPrimaryClient, a);
     pa(t, n, c.Co);
     const u = new na(e, n, r);
@@ -12984,7 +12984,7 @@ async function ra(t, e) {
 
 /** Stops listening to the query. */ async function aa(t, e) {
     const n = q(t), s = n.Oo.get(e), i = n.Mo.get(s.targetId);
-    if (i.length > 1) return n.Mo.set(s.targetId, i.filter((t => !be(t, e)))), void n.Oo.delete(e);
+    if (i.length > 1) return n.Mo.set(s.targetId, i.filter((t => !Pe(t, e)))), void n.Oo.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
@@ -13099,7 +13099,7 @@ async function ra(t, e) {
                 // Run global snapshot listeners if a consistent snapshot has been emitted.
                 t.ro(e) && (s = !0);
             })), s && Go(n);
-        }(s.eventManager, e), t.length && s.Fo.Pr(t), s.onlineState = e, s.isPrimaryClient && s.sharedClientState.setOnlineState(e);
+        }(s.eventManager, e), t.length && s.Fo.br(t), s.onlineState = e, s.isPrimaryClient && s.sharedClientState.setOnlineState(e);
     }
 }
 
@@ -13287,7 +13287,7 @@ async function Ia(t, e, n) {
                 r.push(e);
             }
         })));
-    })), await Promise.all(o), s.Fo.Pr(i), await async function(t, e) {
+    })), await Promise.all(o), s.Fo.br(i), await async function(t, e) {
         const n = q(t);
         try {
             await n.persistence.runTransaction("notifyLocalViewChanges", "readwrite", (t => Gs.forEach(e, (e => Gs.forEach(e.kn, (s => n.persistence.referenceDelegate.addReference(t, e.targetId, s))).next((() => Gs.forEach(e.xn, (s => n.persistence.referenceDelegate.removeReference(t, e.targetId, s)))))))));
@@ -13338,7 +13338,7 @@ function Ra(t, e) {
         if (!s) return t;
         for (const e of s) {
             const s = n.Oo.get(e);
-            t = t.unionWith(s.view.Po);
+            t = t.unionWith(s.view.bo);
         }
         return t;
     }
@@ -13347,7 +13347,7 @@ function Ra(t, e) {
 /**
  * Reconcile the list of synced documents in an existing view with those
  * from persistence.
- */ async function Pa(t, e) {
+ */ async function ba(t, e) {
     const n = q(t), s = await Er(n.localStore, e.query, 
     /* usePreviousResults= */ !0), i = e.view.ko(s);
     return n.isPrimaryClient && pa(n, e.targetId, i.Co), i;
@@ -13358,7 +13358,7 @@ function Ra(t, e) {
  * snapshots if needed.
  */
 // PORTING NOTE: Multi-Tab only.
-async function ba(t) {
+async function Pa(t) {
     const e = q(t);
     return Ar(e.localStore).then((t => Ia(e, t)));
 }
@@ -13450,7 +13450,7 @@ async function Sa(t, e, n) {
             // state (the list of syncedDocuments may have gotten out of sync).
             e = await pr(s.localStore, Re(n[0]));
             for (const t of n) {
-                const e = s.Oo.get(t), n = await Pa(s, e);
+                const e = s.Oo.get(t), n = await ba(s, e);
                 n.snapshot && r.push(n.snapshot);
             }
         } else {
@@ -13462,7 +13462,7 @@ async function Sa(t, e, n) {
         }
         i.push(e);
     }
-    return s.Fo.Pr(r), i;
+    return s.Fo.br(r), i;
 }
 
 /**
@@ -13541,7 +13541,7 @@ async function Na(t, e, n, s) {
 function xa(t) {
     const e = q(t);
     return e.remoteStore.remoteSyncer.applyRemoteEvent = ua.bind(null, e), e.remoteStore.remoteSyncer.getRemoteKeysForTarget = Ra.bind(null, e), 
-    e.remoteStore.remoteSyncer.rejectListen = la.bind(null, e), e.Fo.Pr = Qo.bind(null, e.eventManager), 
+    e.remoteStore.remoteSyncer.rejectListen = la.bind(null, e), e.Fo.br = Qo.bind(null, e.eventManager), 
     e.Fo.zo = Wo.bind(null, e.eventManager), e;
 }
 
@@ -13705,7 +13705,7 @@ class Oa {
             gi: Na.bind(null, e),
             yi: ka.bind(null, e),
             Tn: Ca.bind(null, e),
-            _i: ba.bind(null, e)
+            _i: 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.
@@ -13715,7 +13715,7 @@ class Oa {
     }
     Jo(t) {
         const e = Xr();
-        if (!Qr.bt(e)) throw new j(K.UNIMPLEMENTED, "IndexedDB persistence is only available on platforms that support LocalStorage.");
+        if (!Qr.Pt(e)) throw new j(K.UNIMPLEMENTED, "IndexedDB persistence is only available on platforms that support LocalStorage.");
         const n = or(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey);
         return new Qr(e, t.asyncQueue, n, t.clientId, t.initialUser);
     }
@@ -13745,7 +13745,7 @@ class Oa {
     }
     createRemoteStore(t) {
         return e = this.localStore, n = this.datastore, s = t.asyncQueue, i = t => ha(this.syncEngine, t, 0 /* RemoteStore */), 
-        r = zr.bt() ? new zr : new Gr, new ao(e, n, s, i, r);
+        r = zr.Pt() ? new zr : new Gr, new ao(e, n, s, i, r);
         var e, n, s, i, r;
         /** Re-enables the network. Idempotent. */    }
     createSyncEngine(t, e) {
@@ -14190,7 +14190,7 @@ class Qa {
     da(t) {
         try {
             const e = this.updateFunction(t);
-            return !bt(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !Pt(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
             null);
         } catch (t) {
             // Do not retry errors thrown by user provided updateFunction.
@@ -14437,7 +14437,7 @@ function oc(t, e) {
     return t.asyncQueue.enqueueAndForget((async () => async function(t, e, n) {
         try {
             const s = await Er(t, e, 
-            /* usePreviousResults= */ !0), i = new ea(e, s.zn), r = i.bo(s.documents), o = i.applyChanges(r, 
+            /* usePreviousResults= */ !0), i = new ea(e, s.zn), r = i.Po(s.documents), o = i.applyChanges(r, 
             /* updateLimboDocuments= */ !1);
             n.resolve(o.snapshot);
         } catch (t) {
@@ -14901,7 +14901,7 @@ function Rc(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 Pc {
+ */ class bc {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -14932,14 +14932,14 @@ function Rc(t, e, n, s = {}) {
         return new vc(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new Pc(this.firestore, t, this._key);
+        return new bc(this.firestore, t, this._key);
     }
 }
 
 /**
  * A `Query` refers to a query which you can read or listen to. You can also
  * construct refined `Query` objects by adding filters and ordering.
- */ class bc {
+ */ class Pc {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -14952,14 +14952,14 @@ function Rc(t, e, n, s = {}) {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new bc(this.firestore, t, this._query);
+        return new Pc(this.firestore, t, this._query);
     }
 }
 
 /**
  * A `CollectionReference` object can be used for adding documents, getting
  * document references, and querying for documents (using {@link query}).
- */ class vc extends bc {
+ */ class vc extends Pc {
     /** @hideconstructor */
     constructor(t, e, n) {
         super(t, e, ge(n)), this._path = n, 
@@ -14980,7 +14980,7 @@ function Rc(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 Pc(this.firestore, 
+        return t.isEmpty() ? null : new bc(this.firestore, 
         /* converter= */ null, new St(t));
     }
     withConverter(t) {
@@ -14994,7 +14994,7 @@ function Vc(t, e, ...n) {
         return yc(s), new vc(t, /* converter= */ null, s);
     }
     {
-        if (!(t instanceof Pc || t instanceof vc)) throw new j(K.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof bc || t instanceof vc)) throw new j(K.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(dt.fromString(e, ...n));
         return yc(s), new vc(t.firestore, 
         /* converter= */ null, s);
@@ -15015,7 +15015,7 @@ function Vc(t, e, ...n) {
  * @returns The created `Query`.
  */ function Sc(t, e) {
     if (t = Tc(t, Ac), _c("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new j(K.INVALID_ARGUMENT, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new bc(t, 
+    return new Pc(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
@@ -15032,13 +15032,13 @@ function Dc(t, e, ...n) {
     // 'undefined' and 'null'.
     1 === arguments.length && (e = st.A()), _c("doc", "path", e), t instanceof Ac) {
         const s = dt.fromString(e, ...n);
-        return gc(s), new Pc(t, 
+        return gc(s), new bc(t, 
         /* converter= */ null, new St(s));
     }
     {
-        if (!(t instanceof Pc || t instanceof vc)) throw new j(K.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof bc || t instanceof vc)) throw new j(K.INVALID_ARGUMENT, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const s = t._path.child(dt.fromString(e, ...n));
-        return gc(s), new Pc(t.firestore, t instanceof vc ? t.converter : null, new St(s));
+        return gc(s), new bc(t.firestore, t instanceof vc ? t.converter : null, new St(s));
     }
 }
 
@@ -15050,7 +15050,7 @@ function Dc(t, e, ...n) {
  * @returns true if the references point to the same location in the same
  * Firestore database.
  */ function Cc(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof Pc || t instanceof vc) && (e instanceof Pc || e instanceof vc) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof bc || t instanceof vc) && (e instanceof bc || e instanceof vc) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -15062,7 +15062,7 @@ function Dc(t, e, ...n) {
  * @returns true if the references point to the same location in the same
  * Firestore database.
  */ function Nc(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), t instanceof bc && e instanceof bc && (t.firestore === e.firestore && be(t._query, e._query) && t.converter === e.converter);
+    return t = getModularInstance(t), e = getModularInstance(e), t instanceof Pc && e instanceof Pc && (t.firestore === e.firestore && Pe(t._query, e._query) && t.converter === e.converter);
 }
 
 /**
@@ -15125,9 +15125,9 @@ function Dc(t, e, ...n) {
         this.enqueue(t);
     }
     enqueueAndForgetEvenWhileRestricted(t) {
-        this.Pa(), 
+        this.ba(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.ba(t);
+        this.Pa(t);
     }
     enterRestrictedMode(t) {
         if (!this.ya) {
@@ -15137,14 +15137,14 @@ function Dc(t, e, ...n) {
         }
     }
     enqueue(t) {
-        if (this.Pa(), this.ya) 
+        if (this.ba(), this.ya) 
         // Return a Promise which never resolves.
         return new Promise((() => {}));
         // Create a deferred Promise that we can return to the callee. This
         // allows us to return a "hanging Promise" only to the callee and still
         // advance the queue even when the operation is not run.
                 const e = new Q;
-        return this.ba((() => this.ya && this.Ia ? Promise.resolve() : (t().then(e.resolve, e.reject), 
+        return this.Pa((() => this.ya && this.Ia ? Promise.resolve() : (t().then(e.resolve, e.reject), 
         e.promise))).then((() => e.promise));
     }
     enqueueRetryable(t) {
@@ -15176,7 +15176,7 @@ function Dc(t, e, ...n) {
             this.ur.Zi((() => this.va()));
         }
     }
-    ba(t) {
+    Pa(t) {
         const e = this.ma.then((() => (this.Ea = !0, t().catch((t => {
             this.Ta = t, this.Ea = !1;
             const e = 
@@ -15214,13 +15214,13 @@ function Dc(t, e, ...n) {
         return this.ma = e, e;
     }
     enqueueAfterDelay(t, e, n) {
-        this.Pa(), 
+        this.ba(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Aa.indexOf(t) > -1 && (e = 0);
         const s = Fo.createAndSchedule(this, t, e, n, (t => this.Va(t)));
         return this.pa.push(s), s;
     }
-    Pa() {
+    ba() {
         this.Ta && L();
     }
     verifyOperationInProgress() {}
@@ -15587,7 +15587,7 @@ function Qc(t) {
     return t._queue.enqueueAndForgetEvenWhileRestricted((async () => {
         try {
             await async function(t) {
-                if (!Hs.bt()) return Promise.resolve();
+                if (!Hs.Pt()) return Promise.resolve();
                 const e = t + "main";
                 await Hs.delete(e);
             }(or(t._databaseId, t._persistenceKey)), e.resolve();
@@ -15686,7 +15686,7 @@ function Qc(t) {
  * with resulting documents), and loaded to local cache using `loadBundle`. Once in local
  * cache, use this method to extract a {@link Query} by name.
  */ function Yc(t, e) {
-    return lc(Bc(t = Tc(t, Oc)), e).then((e => e ? new bc(t, null, e.query) : null));
+    return lc(Bc(t = Tc(t, Oc)), e).then((e => e ? new Pc(t, null, e.query) : null));
 }
 
 function Xc(t) {
@@ -16091,7 +16091,7 @@ function hu(t) {
     if (r.merge) c = new mt(o.fieldMask), u = o.fieldTransforms; else if (r.mergeFields) {
         const t = [];
         for (const s of r.mergeFields) {
-            const i = Pu(e, s, n);
+            const i = bu(e, s, n);
             if (!o.contains(i)) throw new j(K.INVALID_ARGUMENT, `Field '${i}' is specified in your field mask but missing from your input data.`);
             Su(t, i) || t.push(i);
         }
@@ -16211,9 +16211,9 @@ class gu extends nu {
 }
 
 /** Parse update data from a list of field/value arguments. */ function pu(t, e, n, s, i, r) {
-    const o = t.ja(1 /* Update */ , e, n), a = [ Pu(e, s, n) ], c = [ i ];
+    const o = t.ja(1 /* Update */ , e, n), a = [ bu(e, s, n) ], c = [ i ];
     if (r.length % 2 != 0) throw new j(K.INVALID_ARGUMENT, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
-    for (let t = 0; t < r.length; t += 2) a.push(Pu(e, r[t])), c.push(r[t + 1]);
+    for (let t = 0; t < r.length; t += 2) a.push(bu(e, r[t])), c.push(r[t + 1]);
     const u = [], h = jt.empty();
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
@@ -16350,7 +16350,7 @@ class gu extends nu {
         if (t instanceof eu) return {
             bytesValue: Qn(e.k, t._byteString)
         };
-        if (t instanceof Pc) {
+        if (t instanceof bc) {
             const n = e.databaseId, s = t.firestore._databaseId;
             if (!s.isEqual(n)) throw e.Ua(`Document reference is for database ${s.projectId}/${s.database} but should be for database ${n.projectId}/${n.database}`);
             return {
@@ -16384,7 +16384,7 @@ function Iu(t, e) {
 }
 
 function Au(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof at || t instanceof su || t instanceof eu || t instanceof Pc || t instanceof nu);
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof at || t instanceof su || t instanceof eu || t instanceof bc || t instanceof nu);
 }
 
 function Ru(t, e, n) {
@@ -16398,7 +16398,7 @@ function Ru(t, e, n) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function Pu(t, e, n) {
+ */ function bu(t, e, n) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
@@ -16411,7 +16411,7 @@ function Ru(t, e, n) {
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ const bu = new RegExp("[~\\*/\\[\\]]");
+ */ const Pu = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -16422,7 +16422,7 @@ function Ru(t, e, n) {
  * @param targetDoc - The document against which the field path will be
  * evaluated.
  */ function vu(t, e, n) {
-    if (e.search(bu) >= 0) throw Vu(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+    if (e.search(Pu) >= 0) throw Vu(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
@@ -16487,7 +16487,7 @@ function Vu(t, e, n, s, i) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new Pc(this._firestore, this._converter, this._key);
+        return new bc(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -16911,7 +16911,7 @@ class qu extends Bu {
                 throw n === e.op ? new j(K.INVALID_ARGUMENT, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new j(K.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.Ga, this.za, this.Ha);
-        return new bc(t.firestore, t.converter, function(t, e) {
+        return new Pc(t.firestore, t.converter, function(t, e) {
             const n = t.filters.concat([ e ]);
             return new _e(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
@@ -16961,7 +16961,7 @@ class ju extends Bu {
  * of the query or if any of the fields in the order by are an uncommitted
  * server timestamp.
  */ (t._query, this.Ga, this.Ja);
-        return new bc(t.firestore, t.converter, function(t, e) {
+        return new Pc(t.firestore, t.converter, function(t, e) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             const n = t.explicitOrderBy.concat([ e ]);
             return new _e(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
@@ -16987,7 +16987,7 @@ class Wu extends Bu {
         super(), this.type = t, this.Ya = e, this.Xa = n;
     }
     _apply(t) {
-        return new bc(t.firestore, t.converter, Pe(t._query, this.Ya, this.Xa));
+        return new Pc(t.firestore, t.converter, be(t._query, this.Ya, this.Xa));
     }
 }
 
@@ -17018,7 +17018,7 @@ class Hu extends Bu {
     }
     _apply(t) {
         const e = eh(t, this.type, this.Za, this.tc);
-        return new bc(t.firestore, t.converter, function(t, e) {
+        return new Pc(t.firestore, t.converter, function(t, e) {
             return new _e(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
@@ -17039,7 +17039,7 @@ class Xu extends Bu {
     }
     _apply(t) {
         const e = eh(t, this.type, this.Za, this.tc);
-        return new bc(t.firestore, t.converter, function(t, e) {
+        return new Pc(t.firestore, t.converter, function(t, e) {
             return new _e(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
@@ -17117,7 +17117,7 @@ function nh(t, e, n) {
         if (!St.isDocumentKey(s)) throw new j(K.INVALID_ARGUMENT, `Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '${s}' is not because it has an odd number of segments (${s.length}).`);
         return Ot(t, new St(s));
     }
-    if (n instanceof Pc) return Ot(t, n._key);
+    if (n instanceof bc) return Ot(t, n._key);
     throw new j(K.INVALID_ARGUMENT, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${pc(n)}.`);
 }
 
@@ -17213,7 +17213,7 @@ function ih(t, e, n) {
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Pt(t));
+            return this.convertTimestamp(bt(t));
 
           default:
             return null;
@@ -17276,7 +17276,7 @@ class ah extends rh {
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new Pc(this.firestore, /* converter= */ null, e);
+        return new bc(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -17411,7 +17411,7 @@ function uh(t, e) {
  * current document contents.
  */
 function hh(t) {
-    t = Tc(t, Pc);
+    t = Tc(t, bc);
     const e = Tc(t.firestore, Oc);
     return rc(Bc(e), t._key).then((n => Rh(e, t, n)));
 }
@@ -17425,7 +17425,7 @@ class lh extends rh {
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new Pc(this.firestore, /* converter= */ null, e);
+        return new bc(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -17436,7 +17436,7 @@ class lh extends rh {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function fh(t) {
-    t = Tc(t, Pc);
+    t = Tc(t, bc);
     const e = Tc(t.firestore, Oc), n = Bc(e), s = new lh(e);
     return ic(n, t._key).then((n => new xu(e, s, t._key, n, new ku(null !== n && n.hasLocalMutations, 
     /* fromCache= */ !0), t.converter)));
@@ -17449,7 +17449,7 @@ class lh extends rh {
  * @returns A `Promise` resolved with a `DocumentSnapshot` containing the
  * current document contents.
  */ function dh(t) {
-    t = Tc(t, Pc);
+    t = Tc(t, bc);
     const e = Tc(t.firestore, Oc);
     return rc(Bc(e), t._key, {
         source: "server"
@@ -17466,7 +17466,7 @@ class lh extends rh {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function wh(t) {
-    t = Tc(t, bc);
+    t = Tc(t, Pc);
     const e = Tc(t.firestore, Oc), n = Bc(e), s = new lh(e);
     return Lu(t._query), ac(n, t._query).then((n => new Fu(e, s, t, n)));
 }
@@ -17477,7 +17477,7 @@ class lh extends rh {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function _h(t) {
-    t = Tc(t, bc);
+    t = Tc(t, Pc);
     const e = Tc(t.firestore, Oc), n = Bc(e), s = new lh(e);
     return oc(n, t._query).then((n => new Fu(e, s, t, n)));
 }
@@ -17488,7 +17488,7 @@ class lh extends rh {
  *
  * @returns A `Promise` that will be resolved with the results of the query.
  */ function mh(t) {
-    t = Tc(t, bc);
+    t = Tc(t, Pc);
     const e = Tc(t.firestore, Oc), n = Bc(e), s = new lh(e);
     return ac(n, t._query, {
         source: "server"
@@ -17496,13 +17496,13 @@ class lh extends rh {
 }
 
 function gh(t, e, n) {
-    t = Tc(t, Pc);
+    t = Tc(t, bc);
     const s = Tc(t.firestore, Oc), i = oh(t.converter, e, n);
     return Ah(s, [ lu(hu(s), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Je.none()) ]);
 }
 
 function yh(t, e, n, ...s) {
-    t = Tc(t, Pc);
+    t = Tc(t, bc);
     const i = Tc(t.firestore, Oc), r = hu(i);
     let o;
     o = "string" == typeof (
@@ -17552,14 +17552,14 @@ function Eh(t, ...e) {
         e[o + 2] = null === (i = t.complete) || void 0 === i ? void 0 : i.bind(t);
     }
     let c, u, h;
-    if (t instanceof Pc) u = Tc(t.firestore, Oc), h = ge(t._key.path), c = {
+    if (t instanceof bc) u = Tc(t.firestore, Oc), h = ge(t._key.path), c = {
         next: n => {
             e[o] && e[o](Rh(u, t, n));
         },
         error: e[o + 1],
         complete: e[o + 2]
     }; else {
-        const n = Tc(t, bc);
+        const n = Tc(t, Pc);
         u = Tc(n.firestore, Oc), h = n._query;
         const s = new lh(u);
         c = {
@@ -17624,7 +17624,7 @@ function Ih(t, e) {
  * The `Transaction` object passed to a transaction's `updateFunction` provides
  * the methods to read and write data within the transaction context. See
  * {@link runTransaction}.
- */ class Ph extends class {
+ */ class bh extends class {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._transaction = e, this._dataReader = hu(t);
@@ -17701,8 +17701,8 @@ function Ih(t, e) {
  * (the `updateFunction` returned a failed promise), the promise returned by the
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
- */ function bh(t, e) {
-    return uc(Bc(t = Tc(t, Oc)), (n => e(new Ph(t, n))));
+ */ function Ph(t, e) {
+    return uc(Bc(t = Tc(t, Oc)), (n => e(new bh(t, n))));
 }
 
 /**
@@ -17832,10 +17832,10 @@ function Ih(t, e) {
         return n = Object.assign({
             useFetchStreams: e
         }, n), i._setSettings(n), i;
-    }), "PUBLIC" /* PUBLIC */)), registerVersion(S, "3.4.0", t), 
+    }), "PUBLIC")), registerVersion(S, "3.4.1-canary.0db840a09", t), 
     // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-    registerVersion(S, "3.4.0", "esm2017");
+    registerVersion(S, "3.4.1-canary.0db840a09", "esm2017");
 }();
 
-export { rh as AbstractUserDataWriter, eu as Bytes, Fc as CACHE_SIZE_UNLIMITED, vc as CollectionReference, Pc as DocumentReference, xu as DocumentSnapshot, Zc as FieldPath, nu as FieldValue, Oc as Firestore, j as FirestoreError, su as GeoPoint, $c as LoadBundleTask, bc as Query, Bu as QueryConstraint, $u as QueryDocumentSnapshot, Fu as QuerySnapshot, ku as SnapshotMetadata, at as Timestamp, Ph as Transaction, ch as WriteBatch, dc as _DatabaseId, St as _DocumentKey, tt as _EmptyAppCheckTokenProvider, G as _EmptyAuthCredentialsProvider, _t as _FieldPath, Tc as _cast, U as _debugAssert, gt as _isBase64Available, O as _logWarn, mc as _validateIsNotUsedTogether, Th as addDoc, Dh as arrayRemove, Sh as arrayUnion, Qc as clearIndexedDbPersistence, Vc as collection, Sc as collectionGroup, Rc as connectFirestoreEmulator, ph as deleteDoc, vh as deleteField, zc as disableNetwork, Dc as doc, tu as documentId, qc as enableIndexedDbPersistence, Kc as enableMultiTabIndexedDbPersistence, Gc as enableNetwork, th as endAt, Zu as endBefore, Bc as ensureFirestoreConfigured, Ah as executeWrite, hh as getDoc, fh as getDocFromCache, dh as getDocFromServer, wh as getDocs, _h as getDocsFromCache, mh as getDocsFromServer, Lc as getFirestore, Ch as increment, Mc as initializeFirestore, Gu as limit, zu as limitToLast, Jc as loadBundle, Yc as namedQuery, Eh as onSnapshot, Ih as onSnapshotsInSync, Qu as orderBy, Uu as query, Nc as queryEqual, Cc as refEqual, bh as runTransaction, Vh as serverTimestamp, gh as setDoc, x as setLogLevel, Mu as snapshotEqual, Yu as startAfter, Ju as startAt, Hc as terminate, yh as updateDoc, Wc as waitForPendingWrites, Ku as where, Nh as writeBatch };
+export { rh as AbstractUserDataWriter, eu as Bytes, Fc as CACHE_SIZE_UNLIMITED, vc as CollectionReference, bc as DocumentReference, xu as DocumentSnapshot, Zc as FieldPath, nu as FieldValue, Oc as Firestore, j as FirestoreError, su as GeoPoint, $c as LoadBundleTask, Pc as Query, Bu as QueryConstraint, $u as QueryDocumentSnapshot, Fu as QuerySnapshot, ku as SnapshotMetadata, at as Timestamp, bh as Transaction, ch as WriteBatch, dc as _DatabaseId, St as _DocumentKey, tt as _EmptyAppCheckTokenProvider, G as _EmptyAuthCredentialsProvider, _t as _FieldPath, Tc as _cast, U as _debugAssert, gt as _isBase64Available, O as _logWarn, mc as _validateIsNotUsedTogether, Th as addDoc, Dh as arrayRemove, Sh as arrayUnion, Qc as clearIndexedDbPersistence, Vc as collection, Sc as collectionGroup, Rc as connectFirestoreEmulator, ph as deleteDoc, vh as deleteField, zc as disableNetwork, Dc as doc, tu as documentId, qc as enableIndexedDbPersistence, Kc as enableMultiTabIndexedDbPersistence, Gc as enableNetwork, th as endAt, Zu as endBefore, Bc as ensureFirestoreConfigured, Ah as executeWrite, hh as getDoc, fh as getDocFromCache, dh as getDocFromServer, wh as getDocs, _h as getDocsFromCache, mh as getDocsFromServer, Lc as getFirestore, Ch as increment, Mc as initializeFirestore, Gu as limit, zu as limitToLast, Jc as loadBundle, Yc as namedQuery, Eh as onSnapshot, Ih as onSnapshotsInSync, Qu as orderBy, Uu as query, Nc as queryEqual, Cc as refEqual, Ph as runTransaction, Vh as serverTimestamp, gh as setDoc, x as setLogLevel, Mu as snapshotEqual, Yu as startAfter, Ju as startAt, Hc as terminate, yh as updateDoc, Wc as waitForPendingWrites, Ku as where, Nh as writeBatch };
 //# sourceMappingURL=index.esm2017.js.map