@firebase/firestore 3.4.5-canary.13c08951a → 3.4.5-canary.8ac8fb099

package/dist/index.esm2017.js

@@ -66,7 +66,7 @@ C.MOCK_USER = new C("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let x = "9.6.7-canary.13c08951a";
+let x = "9.6.7-canary.8ac8fb099";
 
 /**
  * @license
@@ -1425,7 +1425,7 @@ function Pt(t) {
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Vt(t) {
+ */ function bt(t) {
     const e = Et(t.mapValue.fields.__local_write_time__.timestampValue);
     return new ut(e.seconds, e.nanos);
 }
@@ -1445,7 +1445,7 @@ function Pt(t) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class bt {
+ */ class Vt {
     /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -1636,7 +1636,7 @@ function Ot(t) {
         return t.booleanValue === e.booleanValue;
 
       case 4 /* ServerTimestampValue */ :
-        return Vt(t).isEqual(Vt(e));
+        return bt(t).isEqual(bt(e));
 
       case 3 /* TimestampValue */ :
         return function(t, e) {
@@ -1718,7 +1718,7 @@ function Ft(t, e) {
         return Bt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return Bt(Vt(t), Vt(e));
+        return Bt(bt(t), bt(e));
 
       case 5 /* StringValue */ :
         return rt(t.stringValue, e.stringValue);
@@ -2301,7 +2301,7 @@ function le(t, e) {
     for (let i = 0; i < t.filters.length; i++) if (n = t.filters[i], s = e.filters[i], 
     n.op !== s.op || !n.field.isEqual(s.field) || !$t(n.value, s.value)) return !1;
     var n, s;
-    return t.collectionGroup === e.collectionGroup && (!!t.path.isEqual(e.path) && (!!be(t.startAt, e.startAt) && be(t.endAt, e.endAt)));
+    return t.collectionGroup === e.collectionGroup && (!!t.path.isEqual(e.path) && (!!Ve(t.startAt, e.startAt) && Ve(t.endAt, e.endAt)));
 }
 
 function fe(t) {
@@ -2469,7 +2469,7 @@ function Pe(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
-function Ve(t, e, n) {
+function be(t, e, n) {
     let s = 0;
     for (let i = 0; i < t.position.length; i++) {
         const r = e[i], o = t.position[i];
@@ -2484,7 +2484,7 @@ function Ve(t, e, n) {
 /**
  * Returns true if a document sorts after a bound using the provided sort
  * order.
- */ function be(t, e) {
+ */ function Ve(t, e) {
     if (null === t) return null === e;
     if (null === e) return !1;
     if (t.inclusive !== e.inclusive || t.position.length !== e.position.length) return !1;
@@ -2660,11 +2660,11 @@ function Ue(t) {
  * order.
  */
         function(t, e, n) {
-            const s = Ve(t, e, n);
+            const s = be(t, e, n);
             return t.inclusive ? s <= 0 : s < 0;
         }(t.startAt, $e(t), e)) return !1;
         if (t.endAt && !function(t, e, n) {
-            const s = Ve(t, e, n);
+            const s = be(t, e, n);
             return t.inclusive ? s >= 0 : s > 0;
         }(t.endAt, $e(t), e)) return !1;
         return !0;
@@ -3300,7 +3300,7 @@ class Rn extends fn {
  * Important! The names of these identifiers matter because the string forms
  * are used for reverse lookups from the webchannel stream. Do NOT change the
  * names of these identifiers or change this into a const enum.
- */ var Vn, bn;
+ */ var bn, Vn;
 
 /**
  * Determines whether an error code represents a permanent error when received
@@ -3365,55 +3365,55 @@ function Sn(t) {
     // to send invalid proto messages) we may get an error with no GRPC code.
     return M("GRPC error has no .code"), G.UNKNOWN;
     switch (t) {
-      case Vn.OK:
+      case bn.OK:
         return G.OK;
 
-      case Vn.CANCELLED:
+      case bn.CANCELLED:
         return G.CANCELLED;
 
-      case Vn.UNKNOWN:
+      case bn.UNKNOWN:
         return G.UNKNOWN;
 
-      case Vn.DEADLINE_EXCEEDED:
+      case bn.DEADLINE_EXCEEDED:
         return G.DEADLINE_EXCEEDED;
 
-      case Vn.RESOURCE_EXHAUSTED:
+      case bn.RESOURCE_EXHAUSTED:
         return G.RESOURCE_EXHAUSTED;
 
-      case Vn.INTERNAL:
+      case bn.INTERNAL:
         return G.INTERNAL;
 
-      case Vn.UNAVAILABLE:
+      case bn.UNAVAILABLE:
         return G.UNAVAILABLE;
 
-      case Vn.UNAUTHENTICATED:
+      case bn.UNAUTHENTICATED:
         return G.UNAUTHENTICATED;
 
-      case Vn.INVALID_ARGUMENT:
+      case bn.INVALID_ARGUMENT:
         return G.INVALID_ARGUMENT;
 
-      case Vn.NOT_FOUND:
+      case bn.NOT_FOUND:
         return G.NOT_FOUND;
 
-      case Vn.ALREADY_EXISTS:
+      case bn.ALREADY_EXISTS:
         return G.ALREADY_EXISTS;
 
-      case Vn.PERMISSION_DENIED:
+      case bn.PERMISSION_DENIED:
         return G.PERMISSION_DENIED;
 
-      case Vn.FAILED_PRECONDITION:
+      case bn.FAILED_PRECONDITION:
         return G.FAILED_PRECONDITION;
 
-      case Vn.ABORTED:
+      case bn.ABORTED:
         return G.ABORTED;
 
-      case Vn.OUT_OF_RANGE:
+      case bn.OUT_OF_RANGE:
         return G.OUT_OF_RANGE;
 
-      case Vn.UNIMPLEMENTED:
+      case bn.UNIMPLEMENTED:
         return G.UNIMPLEMENTED;
 
-      case Vn.DATA_LOSS:
+      case bn.DATA_LOSS:
         return G.DATA_LOSS;
 
       default:
@@ -3428,14 +3428,14 @@ function Sn(t) {
  * "UNKNOWN", etc.)
  * @returns The equivalent Code. Non-matching responses are mapped to
  *     Code.UNKNOWN.
- */ (bn = Vn || (Vn = {}))[bn.OK = 0] = "OK", bn[bn.CANCELLED = 1] = "CANCELLED", 
-bn[bn.UNKNOWN = 2] = "UNKNOWN", bn[bn.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
-bn[bn.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", bn[bn.NOT_FOUND = 5] = "NOT_FOUND", 
-bn[bn.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", bn[bn.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
-bn[bn.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", bn[bn.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
-bn[bn.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", bn[bn.ABORTED = 10] = "ABORTED", 
-bn[bn.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", bn[bn.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
-bn[bn.INTERNAL = 13] = "INTERNAL", bn[bn.UNAVAILABLE = 14] = "UNAVAILABLE", bn[bn.DATA_LOSS = 15] = "DATA_LOSS";
+ */ (Vn = bn || (bn = {}))[Vn.OK = 0] = "OK", Vn[Vn.CANCELLED = 1] = "CANCELLED", 
+Vn[Vn.UNKNOWN = 2] = "UNKNOWN", Vn[Vn.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+Vn[Vn.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", Vn[Vn.NOT_FOUND = 5] = "NOT_FOUND", 
+Vn[Vn.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", Vn[Vn.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+Vn[Vn.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", Vn[Vn.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+Vn[Vn.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", Vn[Vn.ABORTED = 10] = "ABORTED", 
+Vn[Vn.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", Vn[Vn.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+Vn[Vn.INTERNAL = 13] = "INTERNAL", Vn[Vn.UNAVAILABLE = 14] = "UNAVAILABLE", Vn[Vn.DATA_LOSS = 15] = "DATA_LOSS";
 
 /**
  * @license
@@ -3552,7 +3552,7 @@ class Cn {
         let i = 1;
         for (;!t.isEmpty(); ) if (i = e ? n(t.key, e) : 1, 
         // flip the comparison if we're going in reverse
-        s && (i *= -1), i < 0) 
+        e && s && (i *= -1), i < 0) 
         // This node is less than our start key. ignore it
         t = this.isReverse ? t.left : t.right; else {
             if (0 === i) {
@@ -4862,7 +4862,7 @@ function As(t, e) {
         function(t) {
             return {
                 field: Ss(t.field),
-                direction: bs(t.dir)
+                direction: Vs(t.dir)
             };
         }(t)));
     }(e.orderBy);
@@ -4897,7 +4897,7 @@ function Rs(t) {
         t.allDescendants ? i = t.collectionId : e = e.child(t.collectionId);
     }
     let r = [];
-    n.where && (r = Vs(n.where));
+    n.where && (r = bs(n.where));
     let o = [];
     n.orderBy && (o = n.orderBy.map((t => function(t) {
         return new Re(Ds(t.field), 
@@ -4957,11 +4957,11 @@ function Ps(t, e) {
     };
 }
 
-function Vs(t) {
-    return t ? void 0 !== t.unaryFilter ? [ xs(t) ] : void 0 !== t.fieldFilter ? [ Cs(t) ] : void 0 !== t.compositeFilter ? t.compositeFilter.filters.map((t => Vs(t))).reduce(((t, e) => t.concat(e))) : L() : [];
+function bs(t) {
+    return t ? void 0 !== t.unaryFilter ? [ xs(t) ] : void 0 !== t.fieldFilter ? [ Cs(t) ] : void 0 !== t.compositeFilter ? t.compositeFilter.filters.map((t => bs(t))).reduce(((t, e) => t.concat(e))) : L() : [];
 }
 
-function bs(t) {
+function Vs(t) {
     return ts[t];
 }
 
@@ -6078,12 +6078,12 @@ class li {
      * objectstores.
      */
     constructor(t, e, n) {
-        this.name = t, this.version = e, this.Vt = n;
+        this.name = t, this.version = e, this.bt = n;
         // NOTE: According to https://bugs.webkit.org/show_bug.cgi?id=197050, the
         // 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 === fi.bt(getUA()) && M("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 === fi.Vt(getUA()) && M("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), gi(window.indexedDB.deleteDatabase(t)).toPromise();
@@ -6098,7 +6098,7 @@ class li {
         // 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 = fi.bt(t), n = 0 < e && e < 10, s = fi.Dt(t), i = 0 < s && s < 4.5;
+                const t = getUA(), e = fi.Vt(t), n = 0 < e && e < 10, s = fi.Dt(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
@@ -6121,7 +6121,7 @@ class li {
     }
     // visible for testing
     /** Parse User Agent to determine iOS version. Returns -1 if not found. */
-    static bt(t) {
+    static Vt(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);
     }
@@ -6152,7 +6152,7 @@ class li {
             }, s.onupgradeneeded = t => {
                 $("SimpleDb", 'Database "' + this.name + '" requires upgrade from version:', t.oldVersion);
                 const e = t.target.result;
-                this.Vt.kt(e, s.transaction, t.oldVersion, this.version).next((() => {
+                this.bt.kt(e, s.transaction, t.oldVersion, this.version).next((() => {
                     $("SimpleDb", "Database upgrade to version " + this.version + " complete");
                 }));
             };
@@ -6420,7 +6420,7 @@ class li {
 let yi = !1;
 
 function pi(t) {
-    const e = fi.bt(getUA());
+    const e = fi.Vt(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) {
@@ -6686,13 +6686,13 @@ function Ei(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Serializer for values stored in the LocalStore. */ class Vi {
+/** Serializer for values stored in the LocalStore. */ class bi {
     constructor(t) {
         this.Jt = t;
     }
 }
 
-/** Decodes a remote document from storage locally to a Document. */ function bi(t, e) {
+/** Decodes a remote document from storage locally to a Document. */ function Vi(t, e) {
     let n;
     if (e.document) n = ms(t.Jt, e.document, !!e.hasCommittedMutations); else if (e.noDocument) {
         const t = xt.fromSegments(e.noDocument.path), s = xi(e.noDocument.readTime);
@@ -7183,12 +7183,12 @@ function Qi(t) {
      * Writes the "infinity" byte sequence that sorts after all other byte
      * sequences written in ascending order.
      */    Pe() {
-        this.Ve(255), this.Ve(255);
+        this.be(255), this.be(255);
     }
     /**
      * Writes the "infinity" byte sequence that sorts before all other byte
      * sequences written in descending order.
-     */    be() {
+     */    Ve() {
         this.ve(255), this.ve(255);
     }
     /**
@@ -7225,19 +7225,19 @@ function Qi(t) {
     }
     /** Writes a single byte ascending to the buffer. */    _e(t) {
         const e = 255 & t;
-        0 === e ? (this.Ve(0), this.Ve(255)) : 255 === e ? (this.Ve(255), this.Ve(0)) : this.Ve(e);
+        0 === e ? (this.be(0), this.be(255)) : 255 === e ? (this.be(255), this.be(0)) : this.be(e);
     }
     /** Writes a single byte descending to the buffer.  */    ge(t) {
         const e = 255 & t;
         0 === e ? (this.ve(0), this.ve(255)) : 255 === e ? (this.ve(255), this.ve(0)) : this.ve(t);
     }
     we() {
-        this.Ve(0), this.Ve(1);
+        this.be(0), this.be(1);
     }
     ye() {
         this.ve(0), this.ve(1);
     }
-    Ve(t) {
+    be(t) {
         this.Ae(1), this.buffer[this.position++] = t;
     }
     ve(t) {
@@ -7289,7 +7289,7 @@ class Hi {
         this.De.Re(t);
     }
     ee() {
-        this.De.be();
+        this.De.Ve();
     }
 }
 
@@ -8859,7 +8859,7 @@ class pr {
  * Used to calculate the nth sequence number. Keeps a rolling buffer of the
  * lowest n values passed to `addElement`, and finally reports the largest of
  * them in `maxValue`.
- */ class Vr {
+ */ class br {
     constructor(t) {
         this.Tn = t, this.buffer = new Nn(Pr), this.An = 0;
     }
@@ -8887,23 +8887,23 @@ class pr {
 /**
  * This class is responsible for the scheduling of LRU garbage collection. It handles checking
  * whether or not GC is enabled, as well as which delay to use before the next run.
- */ class br {
+ */ class Vr {
     constructor(t, e) {
-        this.garbageCollector = t, this.asyncQueue = e, this.Vn = !1, this.bn = null;
+        this.garbageCollector = t, this.asyncQueue = e, this.bn = !1, this.Vn = null;
     }
     start(t) {
         -1 !== this.garbageCollector.params.cacheSizeCollectionThreshold && this.vn(t);
     }
     stop() {
-        this.bn && (this.bn.cancel(), this.bn = null);
+        this.Vn && (this.Vn.cancel(), this.Vn = null);
     }
     get started() {
-        return null !== this.bn;
+        return null !== this.Vn;
     }
     vn(t) {
-        const e = this.Vn ? 3e5 : 6e4;
-        $("LruGarbageCollector", `Garbage collection scheduled in ${e}ms`), this.bn = this.asyncQueue.enqueueAfterDelay("lru_garbage_collection" /* LruGarbageCollection */ , e, (async () => {
-            this.bn = null, this.Vn = !0;
+        const e = this.bn ? 3e5 : 6e4;
+        $("LruGarbageCollector", `Garbage collection scheduled in ${e}ms`), this.Vn = this.asyncQueue.enqueueAfterDelay("lru_garbage_collection" /* LruGarbageCollection */ , e, (async () => {
+            this.Vn = null, this.bn = !0;
             try {
                 await t.collectGarbage(this.garbageCollector);
             } catch (t) {
@@ -8923,7 +8923,7 @@ class pr {
     }
     nthSequenceNumber(t, e) {
         if (0 === e) return hi.resolve(nt.A);
-        const n = new Vr(e);
+        const n = new br(e);
         return this.Sn.forEachTarget(t, (t => n.Pn(t.sequenceNumber))).next((() => this.Sn.Cn(t, (t => n.Pn(t))))).next((() => n.maxValue));
     }
     removeTargets(t, e, n) {
@@ -9331,7 +9331,7 @@ function Dr(t, e) {
      * the document corresponds to the format used for sentinel deletes).
      */    Mn(t, e) {
         if (e) {
-            const t = bi(this.O, e);
+            const t = Vi(this.O, e);
             // Whether the document is a sentinel removal and should only be used in the
             // `getNewDocumentChanges()`
                         if (!(t.isNoDocument() && t.version.isEqual(at.min()))) return t;
@@ -9746,7 +9746,7 @@ class Lr {
         this.ss = Number.NEGATIVE_INFINITY, 
         /** A listener to notify on primary state changes. */
         this.rs = t => Promise.resolve(), !Lr.vt()) throw new j(G.UNIMPLEMENTED, "This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.");
-        this.referenceDelegate = new Sr(this, s), this.os = e + "main", this.O = new Vi(c), 
+        this.referenceDelegate = new Sr(this, s), this.os = e + "main", this.O = new bi(c), 
         this.cs = new fi(this.os, this.schemaVersion, new Mr(this.O)), this.us = new Ir(this.referenceDelegate, this.O), 
         this.hs = function(t) {
             return new xr(t);
@@ -9847,12 +9847,12 @@ class Lr {
      * RemoteDocumentChanges and the ClientMetadata store based on the last update
      * time of all clients.
      */    async Ps() {
-        if (this.isPrimary && !this.Vs(this.ss, 18e5)) {
+        if (this.isPrimary && !this.bs(this.ss, 18e5)) {
             this.ss = Date.now();
             const t = await this.runTransaction("maybeGarbageCollectMultiClientState", "readwrite-primary", (t => {
                 const e = Ei(t, Xs.store);
                 return e.qt().next((t => {
-                    const n = this.bs(t, 18e5), s = t.filter((t => -1 === n.indexOf(t)));
+                    const n = this.Vs(t, 18e5), s = t.filter((t => -1 === n.indexOf(t)));
                     // Delete metadata for clients that are no longer considered active.
                     return hi.forEach(s, (t => e.delete(t.clientId))).next((() => s));
                 }));
@@ -9892,7 +9892,7 @@ class Lr {
             // - 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.Vs(e.leaseTimestampMs, 5e3) && !this.Ss(e.ownerId)) {
+            if (null !== e && this.bs(e.leaseTimestampMs, 5e3) && !this.Ss(e.ownerId)) {
                 if (this.As(e) && this.networkEnabled) return !0;
                 if (!this.As(e)) {
                     if (!e.allowTabSynchronization) 
@@ -9911,7 +9911,7 @@ class Lr {
                     return !1;
                 }
             }
-            return !(!this.networkEnabled || !this.inForeground) || qr(t).qt().next((t => void 0 === this.bs(t, 5e3).find((t => {
+            return !(!this.networkEnabled || !this.inForeground) || qr(t).qt().next((t => void 0 === this.Vs(t, 5e3).find((t => {
                 if (this.clientId !== t.clientId) {
                     const e = !this.networkEnabled && t.networkEnabled, n = !this.inForeground && t.inForeground, s = this.networkEnabled === t.networkEnabled;
                     if (e || n && s) return !0;
@@ -9939,8 +9939,8 @@ class Lr {
     /**
      * Returns clients that are not zombied and have an updateTime within the
      * provided threshold.
-     */    bs(t, e) {
-        return t.filter((t => this.Vs(t.updateTimeMs, e) && !this.Ss(t.clientId)));
+     */    Vs(t, e) {
+        return t.filter((t => this.bs(t.updateTimeMs, e) && !this.Ss(t.clientId)));
     }
     /**
      * Returns the IDs of the clients that are currently active. If multi-tab
@@ -9949,7 +9949,7 @@ class Lr {
      *
      * PORTING NOTE: This is only used for Web multi-tab.
      */    ks() {
-        return this.runTransaction("getActiveClients", "readonly", (t => qr(t).qt().next((t => this.bs(t, 18e5).map((t => t.clientId))))));
+        return this.runTransaction("getActiveClients", "readonly", (t => qr(t).qt().next((t => this.Vs(t, 18e5).map((t => t.clientId))))));
     }
     get started() {
         return this.Zn;
@@ -9996,7 +9996,7 @@ class Lr {
     // be turned off.
     Os(t) {
         return Ur(t).get(Ls.key).next((t => {
-            if (null !== t && this.Vs(t.leaseTimestampMs, 5e3) && !this.Ss(t.ownerId) && !this.As(t) && !(this.Yn || this.allowTabSynchronization && t.allowTabSynchronization)) throw new j(G.FAILED_PRECONDITION, Br);
+            if (null !== t && this.bs(t.leaseTimestampMs, 5e3) && !this.Ss(t.ownerId) && !this.As(t) && !(this.Yn || this.allowTabSynchronization && t.allowTabSynchronization)) throw new j(G.FAILED_PRECONDITION, Br);
         }));
     }
     /**
@@ -10014,7 +10014,7 @@ class Lr {
         return e.get(Ls.key).next((t => this.As(t) ? ($("IndexedDbPersistence", "Releasing primary lease."), 
         e.delete(Ls.key)) : hi.resolve()));
     }
-    /** Verifies that `updateTimeMs` is within `maxAgeMs`. */    Vs(t, e) {
+    /** Verifies that `updateTimeMs` is within `maxAgeMs`. */    bs(t, e) {
         const n = Date.now();
         return !(t < n - e) && (!(t > n) || (M(`Detected an update time that is in the future: ${t} > ${n}`), 
         !1));
@@ -10790,7 +10790,7 @@ function oo(t) {
         }, ((t, e) => {
             // Unlike `getEntry()` and others, `getNewDocumentChanges()` parses
             // the documents directly since we want to keep sentinel deletes.
-            const n = bi(s.O, e);
+            const n = Vi(s.O, e);
             i = i.insert(n.key, n), r = e.readTime;
         })).next((() => ({
             $s: i,
@@ -11093,13 +11093,13 @@ async function ao(t, e, n = qn()) {
 
 class _o {
     constructor(t, e) {
-        this.key = t, this.Vi = e;
+        this.key = t, this.bi = e;
     }
     /** Compare by key then by ID */    static gi(t, e) {
-        return xt.comparator(t.key, e.key) || rt(t.Vi, e.Vi);
+        return xt.comparator(t.key, e.key) || rt(t.bi, e.bi);
     }
     /** Compare by ID then by key */    static pi(t, e) {
-        return rt(t.Vi, e.Vi) || xt.comparator(t.key, e.key);
+        return rt(t.bi, e.bi) || xt.comparator(t.key, e.key);
     }
 }
 
@@ -11127,7 +11127,7 @@ class _o {
          */
         this.Ms = [], 
         /** Next value to use when assigning sequential IDs to each mutation batch. */
-        this.bi = 1, 
+        this.Vi = 1, 
         /** An ordered mapping between documents and the mutations batch IDs. */
         this.vi = new Nn(_o.gi);
     }
@@ -11135,8 +11135,8 @@ class _o {
         return hi.resolve(0 === this.Ms.length);
     }
     addMutationBatch(t, e, n, s) {
-        const i = this.bi;
-        this.bi++, this.Ms.length > 0 && this.Ms[this.Ms.length - 1];
+        const i = this.Vi;
+        this.Vi++, this.Ms.length > 0 && this.Ms[this.Ms.length - 1];
         const r = new Ti(i, e, n, s);
         this.Ms.push(r);
         // Track references by document key and index collection parents.
@@ -11153,7 +11153,7 @@ class _o {
                 return hi.resolve(this.Ms.length > i ? this.Ms[i] : null);
     }
     getHighestUnacknowledgedBatchId() {
-        return hi.resolve(0 === this.Ms.length ? -1 : this.bi - 1);
+        return hi.resolve(0 === this.Ms.length ? -1 : this.Vi - 1);
     }
     getAllMutationBatches(t) {
         return hi.resolve(this.Ms.slice());
@@ -11161,7 +11161,7 @@ class _o {
     getAllMutationBatchesAffectingDocumentKey(t, e) {
         const n = new _o(e, 0), s = new _o(e, Number.POSITIVE_INFINITY), i = [];
         return this.vi.forEachInRange([ n, s ], (t => {
-            const e = this.Si(t.Vi);
+            const e = this.Si(t.bi);
             i.push(e);
         })), hi.resolve(i);
     }
@@ -11170,7 +11170,7 @@ class _o {
         return e.forEach((t => {
             const e = new _o(t, 0), s = new _o(t, Number.POSITIVE_INFINITY);
             this.vi.forEachInRange([ e, s ], (t => {
-                n = n.add(t.Vi);
+                n = n.add(t.bi);
             }));
         })), hi.resolve(this.Ci(n));
     }
@@ -11196,7 +11196,7 @@ class _o {
             // the document /rooms/abc/messages/xyx.
             // TODO(mcg): we'll need a different scanner when we implement
             // ancestor queries.
-            e.length === s && (o = o.add(t.Vi)), !0);
+            e.length === s && (o = o.add(t.bi)), !0);
         }), r), hi.resolve(this.Ci(o));
     }
     Ci(t) {
@@ -11521,7 +11521,7 @@ class po {
         this.referenceDelegate = t(this), this.us = new yo(this);
         this.indexManager = new nr, this.hs = function(t) {
             return new mo(t);
-        }((t => this.referenceDelegate.Li(t))), this.O = new Vi(e), this.ls = new ho(this.O);
+        }((t => this.referenceDelegate.Li(t))), this.O = new bi(e), this.ls = new ho(this.O);
     }
     start() {
         return Promise.resolve();
@@ -11721,7 +11721,7 @@ class Po {
  * target is 'not-current', 'current' or 'rejected'.
  */
 // Visible for testing
-class Vo {
+class bo {
     constructor(t, e, n) {
         this.targetId = t, this.state = e, this.error = n;
     }
@@ -11732,7 +11732,7 @@ class Vo {
         const n = JSON.parse(e);
         let s, i = "object" == typeof n && -1 !== [ "not-current", "current", "rejected" ].indexOf(n.state) && (void 0 === n.error || "object" == typeof n.error);
         return i && n.error && (i = "string" == typeof n.error.message && "string" == typeof n.error.code, 
-        i && (s = new j(n.error.code, n.error.message))), i ? new Vo(t, n.state, s) : (M("SharedClientState", `Failed to parse target state for ID '${t}': ${e}`), 
+        i && (s = new j(n.error.code, n.error.message))), i ? new bo(t, n.state, s) : (M("SharedClientState", `Failed to parse target state for ID '${t}': ${e}`), 
         null);
     }
     Ji() {
@@ -11750,7 +11750,7 @@ class Vo {
 /**
  * This class represents the immutable ClientState for a client read from
  * WebStorage, containing the list of active query targets.
- */ class bo {
+ */ class Vo {
     constructor(t, e) {
         this.clientId = t, this.activeTargetIds = e;
     }
@@ -11762,7 +11762,7 @@ class Vo {
         let s = "object" == typeof n && n.activeTargetIds instanceof Array, i = Gn();
         for (let t = 0; s && t < n.activeTargetIds.length; ++t) s = Ct(n.activeTargetIds[t]), 
         i = i.add(n.activeTargetIds[t]);
-        return s ? new bo(t, i) : (M("SharedClientState", `Failed to parse client data for instance '${t}': ${e}`), 
+        return s ? new Vo(t, i) : (M("SharedClientState", `Failed to parse client data for instance '${t}': ${e}`), 
         null);
     }
 }
@@ -11892,7 +11892,7 @@ class So {
             if (e === this.Zi) continue;
             const t = this.getItem(To(this.persistenceKey, e));
             if (t) {
-                const n = bo.Hi(e, t);
+                const n = Vo.Hi(e, t);
                 n && (this.nr = this.nr.insert(n.clientId, n));
             }
         }
@@ -11939,7 +11939,7 @@ class So {
                 if (this.isActiveQueryTarget(t)) {
             const n = this.storage.getItem(Ro(this.persistenceKey, t));
             if (n) {
-                const s = Vo.Hi(t, n);
+                const s = bo.Hi(t, n);
                 s && (e = s.state);
             }
         }
@@ -12003,8 +12003,8 @@ class So {
                         }
                     } else if (this.ur.test(e.key)) {
                         if (null !== e.newValue) {
-                            const t = this.Vr(e.key, e.newValue);
-                            if (t) return this.br(t);
+                            const t = this.br(e.key, e.newValue);
+                            if (t) return this.Vr(t);
                         }
                     } else if (this.ar.test(e.key)) {
                         if (null !== e.newValue) {
@@ -12060,7 +12060,7 @@ class So {
         this.storage.setItem(this.hr, JSON.stringify(e));
     }
     Ir(t, e, n) {
-        const s = Ro(this.persistenceKey, t), i = new Vo(t, e, n);
+        const s = Ro(this.persistenceKey, t), i = new bo(t, e, n);
         this.setItem(s, i.Ji());
     }
     Tr() {
@@ -12078,12 +12078,12 @@ class So {
      * be parsed.
      */    Pr(t, e) {
         const n = this.Ar(t);
-        return bo.Hi(n, e);
+        return Vo.Hi(n, e);
     }
     /**
      * Parses a mutation batch state in WebStorage. Returns 'null' if the value
      * could not be parsed.
-     */    Vr(t, e) {
+     */    br(t, e) {
         const n = this.ur.exec(t), s = Number(n[1]), i = void 0 !== n[2] ? n[2] : null;
         return Po.Hi(new C(i), s, e);
     }
@@ -12092,7 +12092,7 @@ class So {
      * could not be parsed.
      */    vr(t, e) {
         const n = this.ar.exec(t), s = Number(n[1]);
-        return Vo.Hi(s, e);
+        return bo.Hi(s, e);
     }
     /**
      * Parses an online state from WebStorage. Returns 'null' if the value
@@ -12100,7 +12100,7 @@ class So {
      */    _r(t) {
         return vo.Hi(t);
     }
-    async br(t) {
+    async Vr(t) {
         if (t.user.uid === this.currentUser.uid) return this.syncEngine.Cr(t.batchId, t.state, t.error);
         $("SharedClientState", `Ignoring mutation for non-active user ${t.user.uid}`);
     }
@@ -12545,7 +12545,7 @@ class {
                     function(t) {
                         // lookup by string
                         // eslint-disable-next-line @typescript-eslint/no-explicit-any
-                        const e = Vn[t];
+                        const e = bn[t];
                         if (void 0 !== e) return Sn(e);
                     }(t), n = i.message;
                     void 0 === e && (e = G.INTERNAL, n = "Unknown error status: " + t + " with message " + i.message), 
@@ -12773,7 +12773,7 @@ class Uo {
          * getCloseGuardedDispatcher() to invalidate callbacks that happen after
          * close.
          */
-        this.Ro = 0, this.Po = null, this.Vo = null, this.stream = null, this.bo = new Lo(t, e);
+        this.Ro = 0, this.Po = null, this.bo = null, this.stream = null, this.Vo = new Lo(t, e);
     }
     /**
      * Returns true if start() has been called and no error has occurred. True
@@ -12815,7 +12815,7 @@ class Uo {
      * Each error will call the onClose() listener. That function can decide to
      * inhibit backoff if required.
      */    Co() {
-        this.state = 0 /* Initial */ , this.bo.reset();
+        this.state = 0 /* Initial */ , this.Vo.reset();
     }
     /**
      * Marks this stream as idle. If no further actions are performed on the
@@ -12844,7 +12844,7 @@ class Uo {
         this.Po && (this.Po.cancel(), this.Po = null);
     }
     /** Cancels the health check delayed operation. */    $o() {
-        this.Vo && (this.Vo.cancel(), this.Vo = null);
+        this.bo && (this.bo.cancel(), this.bo = null);
     }
     /**
      * Closes the stream and cleans up as necessary:
@@ -12860,15 +12860,15 @@ class Uo {
      * @param error - the error the connection was closed with.
      */    async close(t, e) {
         // Cancel any outstanding timers (they're guaranteed not to execute).
-        this.Oo(), this.$o(), this.bo.cancel(), 
+        this.Oo(), this.$o(), this.Vo.cancel(), 
         // Invalidates any stream-related callbacks (e.g. from auth or the
         // underlying stream), guaranteeing they won't execute.
         this.Ro++, 4 /* Error */ !== t ? 
         // If this is an intentional close ensure we don't delay our next connection attempt.
-        this.bo.reset() : e && e.code === G.RESOURCE_EXHAUSTED ? (
+        this.Vo.reset() : e && e.code === G.RESOURCE_EXHAUSTED ? (
         // Log the error. (Probably either 'quota exceeded' or 'max queue length reached'.)
         M(e.toString()), M("Using maximum backoff delay to prevent overloading the backend."), 
-        this.bo.mo()) : e && e.code === G.UNAUTHENTICATED && 3 /* Healthy */ !== this.state && (
+        this.Vo.mo()) : e && e.code === G.UNAUTHENTICATED && 3 /* Healthy */ !== this.state && (
         // "unauthenticated" error means the token was rejected. This should rarely
         // happen since both Auth and AppCheck ensure a sufficient TTL when we
         // request a token. If a user manually resets their system clock this can
@@ -12912,7 +12912,7 @@ class Uo {
     Bo(t, e) {
         const n = this.Fo(this.Ro);
         this.stream = this.Uo(t, e), this.stream.Qr((() => {
-            n((() => (this.state = 2 /* Open */ , this.Vo = this.Hn.enqueueAfterDelay(this.To, 1e4, (() => (this.So() && (this.state = 3 /* Healthy */), 
+            n((() => (this.state = 2 /* Open */ , this.bo = this.Hn.enqueueAfterDelay(this.To, 1e4, (() => (this.So() && (this.state = 3 /* Healthy */), 
             Promise.resolve()))), this.listener.Qr())));
         })), this.stream.zr((t => {
             n((() => this.Lo(t)));
@@ -12921,7 +12921,7 @@ class Uo {
         }));
     }
     Do() {
-        this.state = 5 /* Backoff */ , this.bo.yo((async () => {
+        this.state = 5 /* Backoff */ , this.Vo.yo((async () => {
             this.state = 0 /* Initial */ , this.start();
         }));
     }
@@ -12962,7 +12962,7 @@ class Uo {
     }
     onMessage(t) {
         // A successful response means the stream is healthy
-        this.bo.reset();
+        this.Vo.reset();
         const e = ys(this.O, t), n = function(t) {
             // We have only reached a consistent snapshot for the entire stream if there
             // is a read_time set and it applies to all targets (i.e. the list of
@@ -13049,7 +13049,7 @@ class Uo {
             // A successful first write response means the stream is healthy,
             // Note, that we could consider a successful handshake healthy, however,
             // the write itself might be causing an error we want to back off from.
-            this.bo.reset();
+            this.Vo.reset();
             const e = Es(t.writeResults, t.commitTime), n = os(t.commitTime);
             return this.listener.zo(n, e);
         }
@@ -13946,13 +13946,13 @@ class Pc {
 /**
  * Holds the listeners and the last received ViewSnapshot for a query being
  * tracked by EventManager.
- */ class Vc {
+ */ class bc {
     constructor() {
         this.yc = void 0, this.listeners = [];
     }
 }
 
-class bc {
+class Vc {
     constructor() {
         this.queries = new er((t => Le(t)), Be), this.onlineState = "Unknown" /* Unknown */ , 
         this.Ic = new Set;
@@ -13962,7 +13962,7 @@ class bc {
 async function vc(t, e) {
     const n = K(t), s = e.query;
     let i = !1, r = n.queries.get(s);
-    if (r || (i = !0, r = new Vc), i) try {
+    if (r || (i = !0, r = new bc), i) try {
         r.yc = await n.onListen(s);
     } catch (t) {
         const n = Tc(t, `Initialization of query '${Ue(e.query)}' failed`);
@@ -14042,7 +14042,7 @@ function xc(t) {
             /* excludesMetadataChanges= */ !0);
         }
         let e = !1;
-        return this.Rc ? this.Vc(t) && (this.Ac.next(t), e = !0) : this.bc(t, this.onlineState) && (this.vc(t), 
+        return this.Rc ? this.bc(t) && (this.Ac.next(t), e = !0) : this.Vc(t, this.onlineState) && (this.vc(t), 
         e = !0), this.Pc = t, e;
     }
     onError(t) {
@@ -14051,10 +14051,10 @@ function xc(t) {
     /** Returns whether a snapshot was raised. */    Ec(t) {
         this.onlineState = t;
         let e = !1;
-        return this.Pc && !this.Rc && this.bc(this.Pc, t) && (this.vc(this.Pc), e = !0), 
+        return this.Pc && !this.Rc && this.Vc(this.Pc, t) && (this.vc(this.Pc), e = !0), 
         e;
     }
-    bc(t, e) {
+    Vc(t, e) {
         // Always raise the first event when we're synced
         if (!t.fromCache) return !0;
         // NOTE: We consider OnlineState.Unknown as online (it should become Offline
@@ -14065,7 +14065,7 @@ function xc(t) {
                 return (!this.options.Sc || !n) && (!t.docs.isEmpty() || "Offline" /* Offline */ === e);
         // Raise data from cache if we have any documents or we are offline
         }
-    Vc(t) {
+    bc(t) {
         // We don't need to handle includeDocumentMetadataChanges here because
         // the Metadata only changes have already been stripped out if needed.
         // At this point the only changes we will see are the ones we should
@@ -15336,7 +15336,7 @@ class Tu {
     }
     fu(t) {
         const e = this.persistence.referenceDelegate.garbageCollector;
-        return new br(e, t.asyncQueue);
+        return new Vr(e, t.asyncQueue);
     }
     lu(t) {
         const e = Kr(t.databaseInfo.databaseId, t.databaseInfo.persistenceKey), n = void 0 !== this.cacheSizeBytes ? lr.withCacheSize(this.cacheSizeBytes) : lr.DEFAULT;
@@ -15395,7 +15395,7 @@ class Tu {
         await yc(this.remoteStore, this.syncEngine.isPrimaryClient));
     }
     createEventManager(t) {
-        return new bc;
+        return new Vc;
     }
     createDatastore(t) {
         const e = Bo(t.databaseInfo.databaseId), n = (s = t.databaseInfo, new $o(s));
@@ -15456,7 +15456,7 @@ class Tu {
  * @param bytesPerRead - How many bytes each `read()` from the returned reader
  *        will read.
  */
-function Vu(t, e = 10240) {
+function bu(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.
@@ -15522,7 +15522,7 @@ function Vu(t, e = 10240) {
  * asynchronously. To allow immediate silencing, a mute call is added which
  * causes events scheduled to no longer be raised.
  */
-class bu {
+class Vu {
     constructor(t) {
         this.observer = t, 
         /**
@@ -15829,14 +15829,14 @@ class Su {
 class Du {
     constructor(t, e, n, s) {
         this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = s, 
-        this.Pu = 5, this.bo = new Lo(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.Pu = 5, this.Vo = new Lo(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
-        this.Pu -= 1, this.Vu();
+        this.Pu -= 1, this.bu();
     }
-    Vu() {
-        this.bo.yo((async () => {
-            const t = new Su(this.datastore), e = this.bu(t);
+    bu() {
+        this.Vo.yo((async () => {
+            const t = new Su(this.datastore), e = this.Vu(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
@@ -15848,7 +15848,7 @@ class Du {
             }));
         }));
     }
-    bu(t) {
+    Vu(t) {
         try {
             const e = this.updateFunction(t);
             return !St(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
@@ -15859,7 +15859,7 @@ class Du {
         }
     }
     vu(t) {
-        this.Pu > 0 && this.Su(t) ? (this.Pu -= 1, this.asyncQueue.enqueueAndForget((() => (this.Vu(), 
+        this.Pu > 0 && this.Su(t) ? (this.Pu -= 1, this.asyncQueue.enqueueAndForget((() => (this.bu(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
     Su(t) {
@@ -16060,7 +16060,7 @@ async function Lu(t) {
 function Gu(t, e, n = {}) {
     const s = new Q;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new bu({
+        const r = new Vu({
             next: r => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
@@ -16107,7 +16107,7 @@ function ju(t, e) {
 function Qu(t, e, n = {}) {
     const s = new Q;
     return t.asyncQueue.enqueueAndForget((async () => function(t, e, n, s, i) {
-        const r = new bu({
+        const r = new Vu({
             next: n => {
                 // Remove query first before passing event to user to avoid
                 // user actions affecting the now stale query.
@@ -16123,7 +16123,7 @@ function Qu(t, e, n = {}) {
 }
 
 function Wu(t, e) {
-    const n = new bu(e);
+    const n = new Vu(e);
     return t.asyncQueue.enqueueAndForget((async () => function(t, e) {
         K(t).Ic.add(e), 
         // Immediately fire an initial event, indicating all existing listeners
@@ -16167,8 +16167,8 @@ function Hu(t, e, n, s) {
         return function(t, e) {
             return new vu(t, e);
         }(function(t, e) {
-            if (t instanceof Uint8Array) return Vu(t, e);
-            if (t instanceof ArrayBuffer) return Vu(new Uint8Array(t), e);
+            if (t instanceof Uint8Array) return bu(t, e);
+            if (t instanceof ArrayBuffer) return bu(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);
@@ -16700,13 +16700,13 @@ function da(t, e, ...n) {
         // List of TimerIds to fast-forward delays for.
         this.Mu = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.bo = new Lo(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.Vo = new Lo(this, "async_queue_retry" /* AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
         this.Fu = () => {
             const t = Fo();
-            t && $("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.bo.Io();
+            t && $("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.Vo.Io();
         };
         const t = Fo();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Fu);
@@ -16753,7 +16753,7 @@ function da(t, e, ...n) {
      */    async Uu() {
         if (0 !== this.Cu.length) {
             try {
-                await this.Cu[0](), this.Cu.shift(), this.bo.reset();
+                await this.Cu[0](), this.Cu.shift(), this.Vo.reset();
             } catch (t) {
                 if (!wi(t)) throw t;
  // Failure will be handled by AsyncQueue
@@ -16770,7 +16770,7 @@ function da(t, e, ...n) {
             // Since `backoffAndRun()` cancels an existing backoff and schedules a
             // new backoff on every call, there is only ever a single additional
             // operation in the queue.
-            this.bo.yo((() => this.Uu()));
+            this.Vo.yo((() => this.Uu()));
         }
     }
     Lu(t) {
@@ -17055,7 +17055,7 @@ class Ia extends oa {
 function Ra(t) {
     var e;
     const n = t._freezeSettings(), s = function(t, e, n, s) {
-        return new bt(t, e, n, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams);
+        return new Vt(t, e, n, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams);
     }(t._databaseId, (null === (e = t._app) || void 0 === e ? void 0 : e.options.appId) || "", t._persistenceKey, n);
     t._firestoreClient = new Cu(t._authCredentials, t._appCheckCredentials, t._queue, s);
 }
@@ -17085,7 +17085,7 @@ function Ra(t) {
  */ function Pa(t, e) {
     Oa(t = sa(t, Ia));
     const n = Aa(t), s = t._freezeSettings(), i = new Pu;
-    return ba(n, i, new Au(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
+    return Va(n, i, new Au(i, s.cacheSizeBytes, null == e ? void 0 : e.forceOwnership));
 }
 
 /**
@@ -17109,10 +17109,10 @@ function Ra(t) {
  * @param firestore - The {@link Firestore} instance to enable persistence for.
  * @returns A `Promise` that represents successfully enabling persistent
  * storage.
- */ function Va(t) {
+ */ function ba(t) {
     Oa(t = sa(t, Ia));
     const e = Aa(t), n = t._freezeSettings(), s = new Pu;
-    return ba(e, s, new Ru(s, n.cacheSizeBytes));
+    return Va(e, s, new Ru(s, n.cacheSizeBytes));
 }
 
 /**
@@ -17120,7 +17120,7 @@ function Ra(t) {
  * If the operation fails with a recoverable error (see
  * `canRecoverFromIndexedDbError()` below), the returned Promise is rejected
  * but the client remains usable.
- */ function ba(t, e, n) {
+ */ function Va(t, e, n) {
     const s = new Q;
     return t.asyncQueue.enqueue((async () => {
         try {
@@ -18529,12 +18529,12 @@ class Ph extends Ah {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function Vh(t, e, n) {
+ */ function bh(t, e, n) {
     const s = e, i = wh("where", t);
     return new Ph(i, s, n);
 }
 
-class bh extends Ah {
+class Vh extends Ah {
     constructor(t, e) {
         super(), this.ca = t, this.ha = e, this.type = "orderBy";
     }
@@ -18580,7 +18580,7 @@ class bh extends Ah {
  * @returns The created {@link Query}.
  */ function vh(t, e = "asc") {
     const n = e, s = wh("orderBy", t);
-    return new bh(s, n);
+    return new Vh(s, n);
 }
 
 class Sh extends Ah {
@@ -18816,7 +18816,7 @@ function Uh(t, e, n) {
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Vt(t));
+            return this.convertTimestamp(bt(t));
 
           default:
             return null;
@@ -19174,7 +19174,7 @@ function il(t, ...e) {
         }, Th(t._query);
     }
     return function(t, e, n, s) {
-        const i = new bu(s), r = new Nc(e, i, n);
+        const i = new Vu(s), r = new Nc(e, i, n);
         return t.asyncQueue.enqueueAndForget((async () => vc(await Lu(t), r))), () => {
             i.mu(), t.asyncQueue.enqueueAndForget((async () => Sc(await Lu(t), r)));
         };
@@ -19478,10 +19478,10 @@ function gl(t, e) {
         return n = Object.assign({
             useFetchStreams: e
         }, n), i._setSettings(n), i;
-    }), "PUBLIC")), registerVersion(D, "3.4.5-canary.13c08951a", t), 
+    }), "PUBLIC")), registerVersion(D, "3.4.5-canary.8ac8fb099", t), 
     // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-    registerVersion(D, "3.4.5-canary.13c08951a", "esm2017");
+    registerVersion(D, "3.4.5-canary.8ac8fb099", "esm2017");
 }();
 
-export { qh as AbstractUserDataWriter, Fa as Bytes, pa as CACHE_SIZE_UNLIMITED, ha as CollectionReference, ua as DocumentReference, gh as DocumentSnapshot, $a as FieldPath, Ba as FieldValue, Ia as Firestore, j as FirestoreError, La as GeoPoint, ya as LoadBundleTask, aa as Query, Ah as QueryConstraint, yh as QueryDocumentSnapshot, ph as QuerySnapshot, mh as SnapshotMetadata, ut as Timestamp, ul as Transaction, jh as WriteBatch, vt as _DatabaseId, xt as _DocumentKey, et as _EmptyAppCheckTokenProvider, z as _EmptyAuthCredentialsProvider, mt as _FieldPath, sa as _cast, q as _debugAssert, yt as _isBase64Available, F as _logWarn, ml as _setIndexConfiguration, Zu as _validateIsNotUsedTogether, sl as addDoc, dl as arrayRemove, fl as arrayUnion, va as clearIndexedDbPersistence, la as collection, fa as collectionGroup, ca as connectFirestoreEmulator, nl as deleteDoc, hl as deleteField, Ca as disableNetwork, da as doc, Ma as documentId, Pa as enableIndexedDbPersistence, Va as enableMultiTabIndexedDbPersistence, Da as enableNetwork, Mh as endAt, $h as endBefore, Aa as ensureFirestoreConfigured, ol as executeWrite, Wh as getDoc, Hh as getDocFromCache, Jh as getDocFromServer, Yh as getDocs, Xh as getDocsFromCache, Zh as getDocsFromServer, Ta as getFirestore, _l as increment, Ea as initializeFirestore, Dh as limit, Ch as limitToLast, Na as loadBundle, ka as namedQuery, il as onSnapshot, rl as onSnapshotsInSync, vh as orderBy, Rh as query, wa as queryEqual, _a as refEqual, al as runTransaction, ll as serverTimestamp, tl as setDoc, O as setLogLevel, Eh as snapshotEqual, kh as startAfter, Nh as startAt, xa as terminate, el as updateDoc, Sa as waitForPendingWrites, Vh as where, wl as writeBatch };
+export { qh as AbstractUserDataWriter, Fa as Bytes, pa as CACHE_SIZE_UNLIMITED, ha as CollectionReference, ua as DocumentReference, gh as DocumentSnapshot, $a as FieldPath, Ba as FieldValue, Ia as Firestore, j as FirestoreError, La as GeoPoint, ya as LoadBundleTask, aa as Query, Ah as QueryConstraint, yh as QueryDocumentSnapshot, ph as QuerySnapshot, mh as SnapshotMetadata, ut as Timestamp, ul as Transaction, jh as WriteBatch, vt as _DatabaseId, xt as _DocumentKey, et as _EmptyAppCheckTokenProvider, z as _EmptyAuthCredentialsProvider, mt as _FieldPath, sa as _cast, q as _debugAssert, yt as _isBase64Available, F as _logWarn, ml as _setIndexConfiguration, Zu as _validateIsNotUsedTogether, sl as addDoc, dl as arrayRemove, fl as arrayUnion, va as clearIndexedDbPersistence, la as collection, fa as collectionGroup, ca as connectFirestoreEmulator, nl as deleteDoc, hl as deleteField, Ca as disableNetwork, da as doc, Ma as documentId, Pa as enableIndexedDbPersistence, ba as enableMultiTabIndexedDbPersistence, Da as enableNetwork, Mh as endAt, $h as endBefore, Aa as ensureFirestoreConfigured, ol as executeWrite, Wh as getDoc, Hh as getDocFromCache, Jh as getDocFromServer, Yh as getDocs, Xh as getDocsFromCache, Zh as getDocsFromServer, Ta as getFirestore, _l as increment, Ea as initializeFirestore, Dh as limit, Ch as limitToLast, Na as loadBundle, ka as namedQuery, il as onSnapshot, rl as onSnapshotsInSync, vh as orderBy, Rh as query, wa as queryEqual, _a as refEqual, al as runTransaction, ll as serverTimestamp, tl as setDoc, O as setLogLevel, Eh as snapshotEqual, kh as startAfter, Nh as startAt, xa as terminate, el as updateDoc, Sa as waitForPendingWrites, bh as where, wl as writeBatch };
 //# sourceMappingURL=index.esm2017.js.map