@firebase/firestore 3.10.0 → 3.10.1-20230413163153

package/dist/index.esm5.js

@@ -8,7 +8,7 @@ import { Logger as l, LogLevel as h } from "@firebase/logger";
 
 import { FirebaseError as f, getUA as d, isSafari as p, getModularInstance as v, isIndexedDBAvailable as m, createMockUserToken as y, deepEqual as g, getDefaultEmulatorHostnameAndPort as w } from "@firebase/util";
 
-import { XhrIo as b, EventType as I, ErrorCode as E, createWebChannelTransport as T, getStatEventTarget as S, FetchXmlHttpFactory as _, WebChannel as D, Event as x, Stat as N } from "@firebase/webchannel-wrapper";
+import { XhrIo as b, EventType as I, ErrorCode as T, createWebChannelTransport as E, getStatEventTarget as S, FetchXmlHttpFactory as _, WebChannel as D, Event as x, Stat as N } from "@firebase/webchannel-wrapper";
 
 var C = "@firebase/firestore", A = /** @class */ function() {
     function t(t) {
@@ -70,7 +70,7 @@ A.MOCK_USER = new A("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var k = "9.19.0", O = new l("@firebase/firestore");
+var k = "9.20.0-20230413163153", O = new l("@firebase/firestore");
 
 /**
  * @license
@@ -1128,7 +1128,7 @@ function gt(t, e) {
         /** The state of an index that has not yet been backfilled. */;
     }
     return t.empty = function() {
-        return new t(0, Et.min());
+        return new t(0, Tt.min());
     }, t;
 }();
 
@@ -1143,17 +1143,17 @@ function gt(t, e) {
     // `(readTime + 1, DocumentKey.empty())` since `> DocumentKey.empty()` matches
     // all valid document IDs.
     var n = t.toTimestamp().seconds, r = t.toTimestamp().nanoseconds + 1, i = at.fromTimestamp(1e9 === r ? new ut(n + 1, 0) : new ut(n, r));
-    return new Et(i, ft.empty(), e);
+    return new Tt(i, ft.empty(), e);
 }
 
 /** Creates a new offset based on the provided document. */ function It(t) {
-    return new Et(t.readTime, t.key, -1);
+    return new Tt(t.readTime, t.key, -1);
 }
 
 /**
  * Stores the latest read time, document and batch ID that were processed for an
  * index.
- */ var Et = /** @class */ function() {
+ */ var Tt = /** @class */ function() {
     function t(
     /**
      * The latest read time version that has been indexed by Firestore for this
@@ -1180,7 +1180,7 @@ function gt(t, e) {
     }, t;
 }();
 
-function Tt(t, e) {
+function Et(t, e) {
     var n = t.readTime.compareTo(e.readTime);
     return 0 !== n ? n : 0 !== (n = ft.comparator(t.documentKey, e.documentKey)) ? n : rt(t.largestBatchId, e.largestBatchId);
 }
@@ -2035,8 +2035,8 @@ function Mt(t) {
         var n = t;
         return e.changes.forEach((function(t, e) {
             var r = It(e);
-            Tt(r, n) > 0 && (n = r);
-        })), new Et(n.readTime, n.documentKey, Math.max(e.batchId, t.largestBatchId));
+            Et(r, n) > 0 && (n = r);
+        })), new Tt(n.readTime, n.documentKey, Math.max(e.batchId, t.largestBatchId));
     }, t;
 }(), qt = /** @class */ function() {
     function t(t, e) {
@@ -2303,15 +2303,15 @@ function be(t) {
 // tree.
 var Ie = /** @class */ function() {
     function t(t, e) {
-        this.comparator = t, this.root = e || Te.EMPTY;
+        this.comparator = t, this.root = e || Ee.EMPTY;
     }
     // Returns a copy of the map, with the specified key/value added or replaced.
         return t.prototype.insert = function(e, n) {
-        return new t(this.comparator, this.root.insert(e, n, this.comparator).copy(null, null, Te.BLACK, null, null));
+        return new t(this.comparator, this.root.insert(e, n, this.comparator).copy(null, null, Ee.BLACK, null, null));
     }, 
     // Returns a copy of the map, with the specified key removed.
     t.prototype.remove = function(e) {
-        return new t(this.comparator, this.root.remove(e, this.comparator).copy(null, null, Te.BLACK, null, null));
+        return new t(this.comparator, this.root.remove(e, this.comparator).copy(null, null, Ee.BLACK, null, null));
     }, 
     // Returns the value of the node with the given key, or null.
     t.prototype.get = function(t) {
@@ -2380,15 +2380,15 @@ var Ie = /** @class */ function() {
     }, 
     // Returns an iterator over the SortedMap.
     t.prototype.getIterator = function() {
-        return new Ee(this.root, null, this.comparator, !1);
+        return new Te(this.root, null, this.comparator, !1);
     }, t.prototype.getIteratorFrom = function(t) {
-        return new Ee(this.root, t, this.comparator, !1);
+        return new Te(this.root, t, this.comparator, !1);
     }, t.prototype.getReverseIterator = function() {
-        return new Ee(this.root, null, this.comparator, !0);
+        return new Te(this.root, null, this.comparator, !0);
     }, t.prototype.getReverseIteratorFrom = function(t) {
-        return new Ee(this.root, t, this.comparator, !0);
+        return new Te(this.root, t, this.comparator, !0);
     }, t;
-}(), Ee = /** @class */ function() {
+}(), Te = /** @class */ function() {
     function t(t, e, n, r) {
         this.isReverse = r, this.nodeStack = [];
         for (var i = 1; !t.isEmpty(); ) if (i = e ? n(t.key, e) : 1, 
@@ -2425,7 +2425,7 @@ var Ie = /** @class */ function() {
             value: t.value
         };
     }, t;
-}(), Te = /** @class */ function() {
+}(), Ee = /** @class */ function() {
     function t(e, n, r, i, o) {
         this.key = e, this.value = n, this.color = null != r ? r : t.RED, this.left = null != i ? i : t.EMPTY, 
         this.right = null != o ? o : t.EMPTY, this.size = this.left.size + 1 + this.right.size;
@@ -2530,9 +2530,9 @@ var Ie = /** @class */ function() {
 // end LLRBNode
 // Empty node is shared between all LLRB trees.
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
-Te.EMPTY = null, Te.RED = !0, Te.BLACK = !1, 
+Ee.EMPTY = null, Ee.RED = !0, Ee.BLACK = !1, 
 // end LLRBEmptyNode
-Te.EMPTY = new (/** @class */ function() {
+Ee.EMPTY = new (/** @class */ function() {
     function t() {
         this.size = 0;
     }
@@ -2573,7 +2573,7 @@ Te.EMPTY = new (/** @class */ function() {
     }, 
     // Returns a copy of the tree, with the specified key/value added.
     t.prototype.insert = function(t, e, n) {
-        return new Te(t, e);
+        return new Ee(t, e);
     }, 
     // Returns a copy of the tree, with the specified key removed.
     t.prototype.remove = function(t, e) {
@@ -3895,19 +3895,19 @@ function bn(t) {
 /**
  * Returns true if this filter is a conjunction of field filters only. Returns false otherwise.
  */ function In(t) {
-    return En(t) && wn(t);
+    return Tn(t) && wn(t);
 }
 
 /**
  * Returns true if this filter does not contain any composite filters. Returns false otherwise.
- */ function En(t) {
+ */ function Tn(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
         if (n[e] instanceof gn) return !1;
     }
     return !0;
 }
 
-function Tn(t) {
+function En(t) {
     if (t instanceof yn) 
     // TODO(b/29183165): Technically, this won't be unique if two values have
     // the same description, such as the int 3 and the string "3". So we should
@@ -3921,11 +3921,11 @@ function Tn(t) {
     // `col.whereEquals("a", 1).whereEquals("b", 2)` should have the same
     // canonical ID as `col.where(and(equals("a",1), equals("b",2)))`.
     return t.filters.map((function(t) {
-        return Tn(t);
+        return En(t);
     })).join(",");
     // filter instanceof CompositeFilter
     var e = t.filters.map((function(t) {
-        return Tn(t);
+        return En(t);
     })).join(",");
     return "".concat(t.op, "(").concat(e, ")");
 }
@@ -4058,7 +4058,7 @@ function Ln(t) {
     if (null === e.ft) {
         var n = e.path.canonicalString();
         null !== e.collectionGroup && (n += "|cg:" + e.collectionGroup), n += "|f:", n += e.filters.map((function(t) {
-            return Tn(t);
+            return En(t);
         })).join(","), n += "|ob:", n += e.orderBy.map((function(t) {
             return function(t) {
                 // TODO(b/29183165): Make this collision robust.
@@ -4634,7 +4634,7 @@ function br() {
 
 /**
  * Returns an IntegerValue for `value`.
- */ function Er(t) {
+ */ function Tr(t) {
     return {
         integerValue: "" + t
     };
@@ -4644,8 +4644,8 @@ function br() {
  * Returns a value for a number that's appropriate to put into a proto.
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
- */ function Tr(t, e) {
-    return zt(e) ? Er(e) : Ir(t, e);
+ */ function Er(t, e) {
+    return zt(e) ? Tr(e) : Ir(t, e);
 }
 
 /**
@@ -4696,7 +4696,7 @@ function br() {
         // precision and resolves overflows by reducing precision, we do not
         // manually cap overflows at 2^63.
         var n = xr(t, e), r = Pr(n) + Pr(t._t);
-        return Je(n) && Je(t._t) ? Er(r) : Ir(t.serializer, r);
+        return Je(n) && Je(t._t) ? Tr(r) : Ir(t.serializer, r);
     }(t, e);
 }
 
@@ -5989,7 +5989,7 @@ function bi() {
  */ var Ii = {
     asc: "ASCENDING",
     desc: "DESCENDING"
-}, Ei = {
+}, Ti = {
     "<": "LESS_THAN",
     "<=": "LESS_THAN_OR_EQUAL",
     ">": "GREATER_THAN",
@@ -6000,7 +6000,7 @@ function bi() {
     in: "IN",
     "not-in": "NOT_IN",
     "array-contains-any": "ARRAY_CONTAINS_ANY"
-}, Ti = {
+}, Ei = {
     and: "AND",
     or: "OR"
 }, Si = function(t, e) {
@@ -6394,11 +6394,11 @@ function ji(t) {
 }
 
 function Qi(t) {
-    return Ei[t];
+    return Ti[t];
 }
 
 function Wi(t) {
-    return Ti[t];
+    return Ei[t];
 }
 
 function Hi(t) {
@@ -7118,7 +7118,7 @@ var Io = /** @class */ function() {
             this.buffer = r;
         }
     }, t;
-}(), Eo = /** @class */ function() {
+}(), To = /** @class */ function() {
     function t(t) {
         this.Me = t;
     }
@@ -7131,7 +7131,7 @@ var Io = /** @class */ function() {
     }, t.prototype.ce = function() {
         this.Me.xe();
     }, t;
-}(), To = /** @class */ function() {
+}(), Eo = /** @class */ function() {
     function t(t) {
         this.Me = t;
     }
@@ -7146,7 +7146,7 @@ var Io = /** @class */ function() {
     }, t;
 }(), So = /** @class */ function() {
     function t() {
-        this.Me = new Io, this.Fe = new Eo(this.Me), this.Be = new To(this.Me);
+        this.Me = new Io, this.Fe = new To(this.Me), this.Be = new Eo(this.Me);
     }
     return t.prototype.seed = function(t) {
         this.Me.seed(t);
@@ -7452,7 +7452,7 @@ function Mo(t, e) {
     // If the composite filter only contains 1 filter, apply associativity to it.
         if (1 === e.length) return Lo(e[0]);
     // Associativity applied to a flat composite filter results is itself.
-        if (En(t)) return t;
+        if (Tn(t)) return t;
     // First apply associativity to all subfilters. This will in turn recursively apply
     // associativity to all nested composite filters and field filters.
         var n = e.map((function(t) {
@@ -7528,9 +7528,9 @@ var Vo = /** @class */ function() {
         // Field indices are not supported with memory persistence.
         return xt.resolve(null);
     }, t.prototype.getMinOffset = function(t, e) {
-        return xt.resolve(Et.min());
+        return xt.resolve(Tt.min());
     }, t.prototype.getMinOffsetFromCollectionGroup = function(t, e) {
-        return xt.resolve(Et.min());
+        return xt.resolve(Tt.min());
     }, t.prototype.updateCollectionGroup = function(t, e, n) {
         // Field indices are not supported with memory persistence.
         return xt.resolve();
@@ -7884,7 +7884,7 @@ var Vo = /** @class */ function() {
             return xt.forEach(t, (function(t) {
                 return i.get([ t.indexId, n.uid ]).next((function(n) {
                     e.push(function(t, e) {
-                        var n = e ? new wt(e.sequenceNumber, new Et(io(e.readTime), new ft(Qt(e.documentKey)), e.largestBatchId)) : wt.empty(), r = t.fields.map((function(t) {
+                        var n = e ? new wt(e.sequenceNumber, new Tt(io(e.readTime), new ft(Qt(e.documentKey)), e.largestBatchId)) : wt.empty(), r = t.fields.map((function(t) {
                             var e = t[0], n = t[1];
                             return new yt(ht.fromServerFormat(e), n);
                         }));
@@ -8095,9 +8095,9 @@ function Qo(t) {
     U(0 !== t.length);
     for (var e = t[0].indexState.offset, n = e.largestBatchId, r = 1; r < t.length; r++) {
         var i = t[r].indexState.offset;
-        Tt(i, e) < 0 && (e = i), n < i.largestBatchId && (n = i.largestBatchId);
+        Et(i, e) < 0 && (e = i), n < i.largestBatchId && (n = i.largestBatchId);
     }
-    return new Et(e.readTime, e.documentKey, n);
+    return new Tt(e.readTime, e.documentKey, n);
 }
 
 /**
@@ -9297,7 +9297,7 @@ function iu(t) {
             return n;
         }));
     }, t.prototype.getAllFromCollectionGroup = function(t, e, n, r) {
-        var i = this, o = cr(), u = bu(e, n), a = bu(e, Et.max());
+        var i = this, o = cr(), u = bu(e, n), a = bu(e, Tt.max());
         return gu(t).Z({
             index: "collectionGroupIndex",
             range: IDBKeyRange.bound(u, a, !0)
@@ -9548,7 +9548,7 @@ function bu(t, e) {
 /**
  * Represents a local view (overlay) of a document, and the fields that are
  * locally mutated.
- */ var Eu = function(t, 
+ */ var Tu = function(t, 
 /**
      * The fields that are locally mutated by patch mutations.
      *
@@ -9557,7 +9557,7 @@ function bu(t, e) {
      */
 e) {
     this.overlayedDocument = t, this.mutatedFields = e;
-}, Tu = /** @class */ function() {
+}, Eu = /** @class */ function() {
     function t(t, e, n, r) {
         this.remoteDocumentCache = t, this.mutationQueue = e, this.documentOverlayCache = n, 
         this.indexManager = r
@@ -9671,7 +9671,7 @@ e) {
                 return o.set(t, e);
             })), e.forEach((function(t, e) {
                 var n;
-                return u.set(t, new Eu(e, null !== (n = o.get(t)) && void 0 !== n ? n : null));
+                return u.set(t, new Tu(e, null !== (n = o.get(t)) && void 0 !== n ? n : null));
             })), u;
         }));
     }, t.prototype.recalculateAndSaveOverlays = function(t, e) {
@@ -10163,7 +10163,7 @@ e) {
         ; a.hasNext(); ) {
             var s = a.getNext(), c = s.key, l = s.value.document;
             if (!o.isPrefixOf(c.path)) break;
-            c.path.length > o.length + 1 || Tt(It(l), n) <= 0 || (r.has(l.key) || rr(e, l)) && (i = i.insert(l.key, l.mutableCopy()));
+            c.path.length > o.length + 1 || Et(It(l), n) <= 0 || (r.has(l.key) || rr(e, l)) && (i = i.insert(l.key, l.mutableCopy()));
         }
         return xt.resolve(i);
     }, t.prototype.getAllFromCollectionGroup = function(t, e, n, r) {
@@ -10673,7 +10673,7 @@ e) {
                 })), r.set(t.userId, i);
             })), xt.forEach(r, (function(t, r) {
                 var u = new A(r), a = mo.ie(n.serializer, u), s = o.getIndexManager(u), c = Zo.ie(u, n.serializer, s, o.referenceDelegate);
-                return new Tu(i, c, a, s).recalculateAndSaveOverlaysForDocumentKeys(new me(e, qt.ct), t).next();
+                return new Eu(i, c, a, s).recalculateAndSaveOverlaysForDocumentKeys(new me(e, qt.ct), t).next();
             }));
         }));
     }, t;
@@ -11437,7 +11437,7 @@ var zu = /** @class */ function() {
         return !!i && (i.hasPendingWrites || i.version.compareTo(r) > 0);
     }, t.prototype.Oi = function(t, e) {
         return R() <= h.DEBUG && F("QueryEngine", "Using full collection scan to execute query:", nr(e)), 
-        this.xi.getDocumentsMatchingQuery(t, e, Et.min());
+        this.xi.getDocumentsMatchingQuery(t, e, Tt.min());
     }, 
     /**
      * Combines the results from an indexed execution with the remaining documents
@@ -11482,7 +11482,7 @@ var zu = /** @class */ function() {
         // TODO(indexing): Add spec tests that test these components change after a
         // user change
         this.documentOverlayCache = this.persistence.getDocumentOverlayCache(t), this.indexManager = this.persistence.getIndexManager(t), 
-        this.mutationQueue = this.persistence.getMutationQueue(t, this.indexManager), this.localDocuments = new Tu(this.Ki, this.mutationQueue, this.documentOverlayCache, this.indexManager), 
+        this.mutationQueue = this.persistence.getMutationQueue(t, this.indexManager), this.localDocuments = new Eu(this.Ki, this.mutationQueue, this.documentOverlayCache, this.indexManager), 
         this.Ki.setIndexManager(this.indexManager), this.Bi.initialize(this.localDocuments, this.indexManager);
     }, t.prototype.collectGarbage = function(t) {
         var e = this;
@@ -12582,7 +12582,7 @@ var ba = {
     }, t.prototype.io = function(t) {
         this.eo(t);
     }, t;
-}(), Ea = "WebChannelConnection", Ta = /** @class */ function(e) {
+}(), Ta = "WebChannelConnection", Ea = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this, t) || this).forceLongPolling = t.forceLongPolling, n.autoDetectLongPolling = t.autoDetectLongPolling, 
@@ -12599,19 +12599,19 @@ var ba = {
             a.setWithCredentials(!0), a.listenOnce(I.COMPLETE, (function() {
                 try {
                     switch (a.getLastErrorCode()) {
-                      case E.NO_ERROR:
+                      case T.NO_ERROR:
                         var e = a.getResponseJson();
-                        F(Ea, "XHR for RPC '".concat(t, "' ").concat(i, " received:"), JSON.stringify(e)), 
+                        F(Ta, "XHR for RPC '".concat(t, "' ").concat(i, " received:"), JSON.stringify(e)), 
                         o(e);
                         break;
 
-                      case E.TIMEOUT:
-                        F(Ea, "RPC '".concat(t, "' ").concat(i, " timed out")), u(new K(G.DEADLINE_EXCEEDED, "Request time out"));
+                      case T.TIMEOUT:
+                        F(Ta, "RPC '".concat(t, "' ").concat(i, " timed out")), u(new K(G.DEADLINE_EXCEEDED, "Request time out"));
                         break;
 
-                      case E.HTTP_ERROR:
+                      case T.HTTP_ERROR:
                         var n = a.getStatus();
-                        if (F(Ea, "RPC '".concat(t, "' ").concat(i, " failed with status:"), n, "response text:", a.getResponseText()), 
+                        if (F(Ta, "RPC '".concat(t, "' ").concat(i, " failed with status:"), n, "response text:", a.getResponseText()), 
                         n > 0) {
                             var r = a.getResponseJson();
                             Array.isArray(r) && (r = r[0]);
@@ -12633,14 +12633,14 @@ var ba = {
                         q();
                     }
                 } finally {
-                    F(Ea, "RPC '".concat(t, "' ").concat(i, " completed."));
+                    F(Ta, "RPC '".concat(t, "' ").concat(i, " completed."));
                 }
             }));
             var s = JSON.stringify(r);
-            F(Ea, "RPC '".concat(t, "' ").concat(i, " sending request:"), r), a.send(e, "POST", s, n, 15);
+            F(Ta, "RPC '".concat(t, "' ").concat(i, " sending request:"), r), a.send(e, "POST", s, n, 15);
         }));
     }, n.prototype.wo = function(t, e, n) {
-        var r = wa(), i = [ this.ro, "/", "google.firestore.v1.Firestore", "/", t, "/channel" ], o = T(), u = S(), a = {
+        var r = wa(), i = [ this.ro, "/", "google.firestore.v1.Firestore", "/", t, "/channel" ], o = E(), u = S(), a = {
             // Required for backend stickiness, routing behavior is based on this
             // parameter.
             httpSessionIdParam: "gsessionid",
@@ -12676,11 +12676,11 @@ var ba = {
         // which is recognized by the webchannel backend.
         a.encodeInitMessageHeaders = !0;
         var s = i.join("");
-        F(Ea, "Creating RPC '".concat(t, "' stream ").concat(r, ": ").concat(s), a);
+        F(Ta, "Creating RPC '".concat(t, "' stream ").concat(r, ": ").concat(s), a);
         var c = o.createWebChannel(s, a), l = !1, h = !1, f = new Ia({
             Wr: function(e) {
-                h ? F(Ea, "Not sending because RPC '".concat(t, "' stream ").concat(r, " is closed:"), e) : (l || (F(Ea, "Opening RPC '".concat(t, "' stream ").concat(r, " transport.")), 
-                c.open(), l = !0), F(Ea, "RPC '".concat(t, "' stream ").concat(r, " sending:"), e), 
+                h ? F(Ta, "Not sending because RPC '".concat(t, "' stream ").concat(r, " is closed:"), e) : (l || (F(Ta, "Opening RPC '".concat(t, "' stream ").concat(r, " transport.")), 
+                c.open(), l = !0), F(Ta, "RPC '".concat(t, "' stream ").concat(r, " sending:"), e), 
                 c.send(e));
             },
             Hr: function() {
@@ -12709,12 +12709,12 @@ var ba = {
         // Note that eventually this function could go away if we are confident
         // enough the code is exception free.
         return d(c, D.EventType.OPEN, (function() {
-            h || F(Ea, "RPC '".concat(t, "' stream ").concat(r, " transport opened."));
+            h || F(Ta, "RPC '".concat(t, "' stream ").concat(r, " transport opened."));
         })), d(c, D.EventType.CLOSE, (function() {
-            h || (h = !0, F(Ea, "RPC '".concat(t, "' stream ").concat(r, " transport closed")), 
+            h || (h = !0, F(Ta, "RPC '".concat(t, "' stream ").concat(r, " transport closed")), 
             f.so());
         })), d(c, D.EventType.ERROR, (function(e) {
-            h || (h = !0, L(Ea, "RPC '".concat(t, "' stream ").concat(r, " transport errored:"), e), 
+            h || (h = !0, L(Ta, "RPC '".concat(t, "' stream ").concat(r, " transport errored:"), e), 
             f.so(new K(G.UNAVAILABLE, "The operation could not be completed")));
         })), d(c, D.EventType.MESSAGE, (function(e) {
             var n;
@@ -12728,7 +12728,7 @@ var ba = {
                 // Use any because msgData.error is not typed.
                 var o = i, u = o.error || (null === (n = o[0]) || void 0 === n ? void 0 : n.error);
                 if (u) {
-                    F(Ea, "RPC '".concat(t, "' stream ").concat(r, " received error:"), u);
+                    F(Ta, "RPC '".concat(t, "' stream ").concat(r, " received error:"), u);
                     // error.status will be a string like 'OK' or 'NOT_FOUND'.
                     var a = u.status, s = 
                     /**
@@ -12746,10 +12746,10 @@ var ba = {
                     void 0 === s && (s = G.INTERNAL, l = "Unknown error status: " + a + " with message " + u.message), 
                     // Mark closed so no further events are propagated
                     h = !0, f.so(new K(s, l)), c.close();
-                } else F(Ea, "RPC '".concat(t, "' stream ").concat(r, " received:"), i), f.io(i);
+                } else F(Ta, "RPC '".concat(t, "' stream ").concat(r, " received:"), i), f.io(i);
             }
         })), d(u, x.STAT_EVENT, (function(e) {
-            e.stat === N.PROXY ? F(Ea, "RPC '".concat(t, "' stream ").concat(r, " detected buffering proxy")) : e.stat === N.NOPROXY && F(Ea, "RPC '".concat(t, "' stream ").concat(r, " detected no buffering proxy"));
+            e.stat === N.PROXY ? F(Ta, "RPC '".concat(t, "' stream ").concat(r, " detected buffering proxy")) : e.stat === N.NOPROXY && F(Ta, "RPC '".concat(t, "' stream ").concat(r, " detected no buffering proxy"));
         })), setTimeout((function() {
             // Technically we could/should wait for the WebChannel opened event,
             // but because we want to send the first message with the WebChannel
@@ -13279,8 +13279,8 @@ function Sa() {
                 e.documentRemove;
                 var I = e.documentRemove;
                 I.document;
-                var E = Oi(t, I.document), T = I.removedTargetIds || [];
-                n = new pi([], T, E, null);
+                var T = Oi(t, I.document), E = I.removedTargetIds || [];
+                n = new pi([], E, T, null);
             } else {
                 if (!("filter" in e)) return q();
                 e.filter;
@@ -14771,7 +14771,7 @@ function ys(t) {
         /** Batched documents to be saved into storage */
         this.documents = [], 
         /** The collection groups affected by this bundle. */
-        this.collectionGroups = new Set, this.progress = Es(t)
+        this.collectionGroups = new Set, this.progress = Ts(t)
         /**
      * Adds an element from the bundle to the loader.
      *
@@ -14861,7 +14861,7 @@ function ys(t) {
  * Returns a `LoadBundleTaskProgress` representing the initial progress of
  * loading a bundle.
  */
-function Es(t) {
+function Ts(t) {
     return {
         taskState: "Running",
         documentsLoaded: 0,
@@ -14890,7 +14890,7 @@ function Es(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.
- */ var Ts = function(t) {
+ */ var Es = function(t) {
     this.key = t;
 }, Ss = function(t) {
     this.key = t;
@@ -15091,7 +15091,7 @@ function Es(t) {
         return e.forEach((function(e) {
             t.Uu.has(e) || n.push(new Ss(e));
         })), this.Uu.forEach((function(t) {
-            e.has(t) || n.push(new Ts(t));
+            e.has(t) || n.push(new Es(t));
         })), n;
     }, 
     /**
@@ -15716,7 +15716,7 @@ function zs(t, e) {
 function Gs(t, e, n) {
     for (var r = 0, i = n; r < i.length; r++) {
         var o = i[r];
-        o instanceof Ts ? (t.cc.addReference(o.key, e), Ks(t, o)) : o instanceof Ss ? (F("SyncEngine", "Document no longer in limbo: " + o.key), 
+        o instanceof Es ? (t.cc.addReference(o.key, e), Ks(t, o)) : o instanceof Ss ? (F("SyncEngine", "Document no longer in limbo: " + o.key), 
         t.cc.removeReference(o.key, e), t.cc.containsKey(o.key) || 
         // We removed the last reference for this key
         zs(t, o.key)) : q();
@@ -16258,7 +16258,7 @@ function uc(t, r, i) {
                     }(e)), Promise.resolve(new Set)) ];
 
                   case 4:
-                    return i._updateProgress(Es(e)), o = new Is(e, t.localStore, r.serializer), [ 4 /*yield*/ , r._c() ];
+                    return i._updateProgress(Ts(e)), o = new Is(e, t.localStore, r.serializer), [ 4 /*yield*/ , r._c() ];
 
                   case 5:
                     u = n.sent(), n.label = 6;
@@ -16515,7 +16515,7 @@ var ac = /** @class */ function() {
     }, t.prototype.createEventManager = function(t) {
         return new fs;
     }, t.prototype.createDatastore = function(t) {
-        var e, n = Da(t.databaseInfo.databaseId), r = (e = t.databaseInfo, new Ta(e));
+        var e, n = Da(t.databaseInfo.databaseId), r = (e = t.databaseInfo, new Ea(e));
         /** Return the Platform-specific connectivity monitor. */ return function(t, e, n, r) {
             return new ka(t, e, n, r);
         }(t.authCredentials, t.appCheckCredentials, r, n);
@@ -17331,13 +17331,13 @@ function Ic(t) {
     }));
 }
 
-function Ec(t) {
+function Tc(t) {
     return bc(t).then((function(t) {
         return t.persistence;
     }));
 }
 
-function Tc(t) {
+function Ec(t) {
     return bc(t).then((function(t) {
         return t.localStore;
     }));
@@ -18584,7 +18584,7 @@ function sl(t) {
                 return n(this, (function(n) {
                     switch (n.label) {
                       case 0:
-                        return [ 4 /*yield*/ , Ec(t) ];
+                        return [ 4 /*yield*/ , Tc(t) ];
 
                       case 1:
                         return e = n.sent(), [ 4 /*yield*/ , Sc(t) ];
@@ -18618,7 +18618,7 @@ function sl(t) {
                 return n(this, (function(o) {
                     switch (o.label) {
                       case 0:
-                        return [ 4 /*yield*/ , Ec(t) ];
+                        return [ 4 /*yield*/ , Tc(t) ];
 
                       case 1:
                         return r = o.sent(), [ 4 /*yield*/ , Sc(t) ];
@@ -18759,7 +18759,7 @@ function dl(t, r) {
                             return n.persistence.runTransaction("Get named query", "readonly", (function(t) {
                                 return n.xs.getNamedQuery(t, e);
                             }));
-                        }, [ 4 /*yield*/ , Tc(t) ];
+                        }, [ 4 /*yield*/ , Ec(t) ];
 
                       case 1:
                         return [ 2 /*return*/ , e.apply(void 0, [ n.sent(), r ]) ];
@@ -19016,7 +19016,7 @@ function(t) {
     t.prototype._compareTo = function(t) {
         return rt(this._lat, t._lat) || rt(this._long, t._long);
     }, t;
-}(), El = /^__.*__$/, Tl = /** @class */ function() {
+}(), Tl = /^__.*__$/, El = /** @class */ function() {
     function t(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
@@ -19148,7 +19148,7 @@ function(t) {
         if (this.path) for (var t = 0; t < this.path.length; t++) this.ea(this.path.get(t));
     }, t.prototype.ea = function(t) {
         if (0 === t.length) throw this.ia("Document fields must not be empty");
-        if (_l(this.Yc) && El.test(t)) throw this.ia('Document fields cannot begin and end with "__"');
+        if (_l(this.Yc) && Tl.test(t)) throw this.ia('Document fields cannot begin and end with "__"');
     }, t;
 }(), xl = /** @class */ function() {
     function t(t, e, n) {
@@ -19190,7 +19190,7 @@ function(t) {
             return a.covers(t.field);
         }));
     } else a = null, s = u.fieldTransforms;
-    return new Tl(new sn(c), a, s);
+    return new El(new sn(c), a, s);
 }
 
 var Al = /** @class */ function(e) {
@@ -19276,7 +19276,7 @@ var Ol = /** @class */ function(e) {
         return (r = e.call(this, t) || this).aa = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = new Rr(t.serializer, Tr(t.serializer, this.aa));
+        var e = new Rr(t.serializer, Er(t.serializer, this.aa));
         return new Mr(t.path, e);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -19405,7 +19405,7 @@ var Ol = /** @class */ function(e) {
         if (null === (t = v(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return Tr(e.serializer, t);
+        if ("number" == typeof t) return Er(e.serializer, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -19824,7 +19824,7 @@ function Jl(t, e) {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // Only support QueryFilterConstraints
         return t.forEach((function(t) {
-        return Eh("or", t);
+        return Th("or", t);
     })), rh._create("or" /* CompositeOperator.OR */ , t)
     /**
  * Creates a new {@link QueryCompositeFilterConstraint} that is a conjunction of
@@ -19842,7 +19842,7 @@ function oh() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // Only support QueryFilterConstraints
         return t.forEach((function(t) {
-        return Eh("and", t);
+        return Th("and", t);
     })), rh._create("and" /* CompositeOperator.AND */ , t)
     /**
  * A `QueryOrderByConstraint` is used to sort the set of documents returned by a
@@ -20144,11 +20144,11 @@ function Ih(t, e, n) {
     if (!n.isEqual(e)) throw new K(G.INVALID_ARGUMENT, "Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '".concat(e.toString(), "' and so you must also use '").concat(e.toString(), "' as your first argument to orderBy(), but your first orderBy() is on field '").concat(n.toString(), "' instead."));
 }
 
-function Eh(t, e) {
+function Th(t, e) {
     if (!(e instanceof eh || e instanceof rh)) throw new K(G.INVALID_ARGUMENT, "Function ".concat(t, "() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'."));
 }
 
-var Th = /** @class */ function() {
+var Eh = /** @class */ function() {
     function t() {}
     return t.prototype.convertValue = function(t, e) {
         switch (void 0 === e && (e = "none"), ze(t)) {
@@ -20268,7 +20268,7 @@ var _h = /** @class */ function(e) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
         return new Bc(this.firestore, /* converter= */ null, e);
     }, n;
-}(Th);
+}(Eh);
 
 /**
  * @license
@@ -20623,7 +20623,7 @@ var Vh = /** @class */ function(e) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
         return new Bc(this.firestore, /* converter= */ null, e);
     }, n;
-}(Th);
+}(Eh);
 
 /**
  * Reads the document referred to by this `DocumentReference` from cache.
@@ -20668,7 +20668,7 @@ var Vh = /** @class */ function(e) {
                                     }
                                 }));
                             }));
-                        }, [ 4 /*yield*/ , Tc(t) ];
+                        }, [ 4 /*yield*/ , Ec(t) ];
 
                       case 1:
                         return [ 2 /*return*/ , i.apply(void 0, [ u.sent(), r, o ]) ];
@@ -20755,7 +20755,7 @@ function zh(t) {
                                     }
                                 }));
                             }));
-                        }, [ 4 /*yield*/ , Tc(t) ];
+                        }, [ 4 /*yield*/ , Ec(t) ];
 
                       case 1:
                         return [ 2 /*return*/ , i.apply(void 0, [ u.sent(), r, o ]) ];
@@ -21055,17 +21055,14 @@ function Yh(t, r) {
         var o = this, u = new j;
         return t.asyncQueue.enqueueAndForget((function() {
             return e(o, void 0, void 0, (function() {
-                var o, a, s;
-                return n(this, (function(c) {
-                    switch (c.label) {
+                var o, a;
+                return n(this, (function(s) {
+                    switch (s.label) {
                       case 0:
-                        return c.trys.push([ 0, 5, , 6 ]), o = za, [ 4 /*yield*/ , Sc(t) ];
+                        return s.trys.push([ 0, 2, , 3 ]), [ 4 /*yield*/ , Dc(t) ];
 
                       case 1:
-                        return o.apply(void 0, [ c.sent() ]) ? [ 4 /*yield*/ , Dc(t) ] : [ 3 /*break*/ , 3 ];
-
-                      case 2:
-                        return a = c.sent(), u.resolve(
+                        return o = s.sent(), u.resolve(
                         // TODO(firestorexp): Make sure there is only one Datastore instance per
                         // firestore-exp client.
                         function(t, r, i) {
@@ -21113,19 +21110,12 @@ function Yh(t, r) {
                                     }
                                 }));
                             }));
-                        }(a, r, i)), [ 3 /*break*/ , 4 ];
+                        }(o, r, i)), [ 3 /*break*/ , 3 ];
 
-                      case 3:
-                        u.reject(new K(G.UNAVAILABLE, "Failed to get aggregate result because the client is offline.")), 
-                        c.label = 4;
-
-                      case 4:
-                        return [ 3 /*break*/ , 6 ];
-
-                      case 5:
-                        return s = c.sent(), u.reject(s), [ 3 /*break*/ , 6 ];
+                      case 2:
+                        return a = s.sent(), u.reject(a), [ 3 /*break*/ , 3 ];
 
-                      case 6:
+                      case 3:
                         return [ 2 /*return*/ ];
                     }
                 }));
@@ -21630,9 +21620,9 @@ function If(t, i) {
             }
         }(t) : t, n = [];
         if (Array.isArray(e.indexes)) for (var r = 0, i = e.indexes; r < i.length; r++) {
-            var o = i[r], u = Ef(o, "collectionGroup"), a = [];
+            var o = i[r], u = Tf(o, "collectionGroup"), a = [];
             if (Array.isArray(o.fields)) for (var s = 0, c = o.fields; s < c.length; s++) {
-                var l = c[s], h = jl("setIndexConfiguration", Ef(l, "fieldPath"));
+                var l = c[s], h = jl("setIndexConfiguration", Tf(l, "fieldPath"));
                 "CONTAINS" === l.arrayConfig ? a.push(new yt(h, 2 /* IndexKind.CONTAINS */)) : "ASCENDING" === l.order ? a.push(new yt(h, 0 /* IndexKind.ASCENDING */)) : "DESCENDING" === l.order && a.push(new yt(h, 1 /* IndexKind.DESCENDING */));
             }
             n.push(new dt(dt.UNKNOWN_ID, u, a, wt.empty()));
@@ -21711,7 +21701,7 @@ function If(t, i) {
                                     })) ];
                                 }));
                             }));
-                        }, [ 4 /*yield*/ , Tc(t) ];
+                        }, [ 4 /*yield*/ , Ec(t) ];
 
                       case 1:
                         return [ 2 /*return*/ , o.apply(void 0, [ u.sent(), i ]) ];
@@ -21722,7 +21712,7 @@ function If(t, i) {
     }(u, a);
 }
 
-function Ef(t, e) {
+function Tf(t, e) {
     if ("string" != typeof t[e]) throw new K(G.INVALID_ARGUMENT, "Missing string value for: " + e);
     return t[e];
 }
@@ -21739,9 +21729,9 @@ function Ef(t, e) {
     return r = Object.assign({
         useFetchStreams: ff
     }, r), o._setSettings(r), o;
-}), "PUBLIC").setMultipleInstances(!0)), u(C, "3.10.0", void 0), 
+}), "PUBLIC").setMultipleInstances(!0)), u(C, "3.10.1-20230413163153", void 0), 
 // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-u(C, "3.10.0", "esm5");
+u(C, "3.10.1-20230413163153", "esm5");
 
-export { Th as AbstractUserDataWriter, vl as AggregateField, ml as AggregateQuerySnapshot, yl as Bytes, Xc as CACHE_SIZE_UNLIMITED, Gc as CollectionReference, Bc as DocumentReference, Oh as DocumentSnapshot, gl as FieldPath, bl as FieldValue, $c as Firestore, K as FirestoreError, Il as GeoPoint, Zc as LoadBundleTask, zc as Query, rh as QueryCompositeFilterConstraint, $l as QueryConstraint, Rh as QueryDocumentSnapshot, ph as QueryEndAtConstraint, eh as QueryFieldFilterConstraint, sh as QueryLimitConstraint, uh as QueryOrderByConstraint, Ph as QuerySnapshot, hh as QueryStartAtConstraint, kh as SnapshotMetadata, ut as Timestamp, df as Transaction, lf as WriteBatch, qe as _DatabaseId, ft as _DocumentKey, tt as _EmptyAppCheckTokenProvider, W as _EmptyAuthCredentialsProvider, ht as _FieldPath, li as _TestingHooks, Mc as _cast, B as _debugAssert, Ce as _isBase64Available, L as _logWarn, Oc as _validateIsNotUsedTogether, Wh as addDoc, Ch as aggregateFieldEqual, Ah as aggregateQuerySnapshotEqual, oh as and, gf as arrayRemove, yf as arrayUnion, xh as average, al as clearIndexedDbPersistence, Kc as collection, jc as collectionGroup, Uc as connectFirestoreEmulator, Nh as count, Qh as deleteDoc, vf as deleteField, ll as disableNetwork, Qc as doc, wl as documentId, il as enableIndexedDbPersistence, ol as enableMultiTabIndexedDbPersistence, cl as enableNetwork, mh as endAt, vh as endBefore, nl as ensureFirestoreConfigured, Jh as executeWrite, $h as getAggregateFromServer, Xh as getCountFromServer, Lh as getDoc, qh as getDocFromCache, Uh as getDocFromServer, Bh as getDocs, zh as getDocsFromCache, Gh as getDocsFromServer, el as getFirestore, wf as increment, tl as initializeFirestore, ch as limit, lh as limitToLast, fl as loadBundle, nf as memoryLocalCache, dl as namedQuery, Hh as onSnapshot, Yh as onSnapshotsInSync, ih as or, ah as orderBy, rf as persistentLocalCache, sf as persistentMultipleTabManager, af as persistentSingleTabManager, th as query, Hc as queryEqual, Wc as refEqual, pf as runTransaction, mf as serverTimestamp, Kh as setDoc, If as setIndexConfiguration, P as setLogLevel, Mh as snapshotEqual, dh as startAfter, fh as startAt, Dh as sum, hl as terminate, jh as updateDoc, sl as waitForPendingWrites, nh as where, bf as writeBatch };
+export { Eh as AbstractUserDataWriter, vl as AggregateField, ml as AggregateQuerySnapshot, yl as Bytes, Xc as CACHE_SIZE_UNLIMITED, Gc as CollectionReference, Bc as DocumentReference, Oh as DocumentSnapshot, gl as FieldPath, bl as FieldValue, $c as Firestore, K as FirestoreError, Il as GeoPoint, Zc as LoadBundleTask, zc as Query, rh as QueryCompositeFilterConstraint, $l as QueryConstraint, Rh as QueryDocumentSnapshot, ph as QueryEndAtConstraint, eh as QueryFieldFilterConstraint, sh as QueryLimitConstraint, uh as QueryOrderByConstraint, Ph as QuerySnapshot, hh as QueryStartAtConstraint, kh as SnapshotMetadata, ut as Timestamp, df as Transaction, lf as WriteBatch, qe as _DatabaseId, ft as _DocumentKey, tt as _EmptyAppCheckTokenProvider, W as _EmptyAuthCredentialsProvider, ht as _FieldPath, li as _TestingHooks, Mc as _cast, B as _debugAssert, Ce as _isBase64Available, L as _logWarn, Oc as _validateIsNotUsedTogether, Wh as addDoc, Ch as aggregateFieldEqual, Ah as aggregateQuerySnapshotEqual, oh as and, gf as arrayRemove, yf as arrayUnion, xh as average, al as clearIndexedDbPersistence, Kc as collection, jc as collectionGroup, Uc as connectFirestoreEmulator, Nh as count, Qh as deleteDoc, vf as deleteField, ll as disableNetwork, Qc as doc, wl as documentId, il as enableIndexedDbPersistence, ol as enableMultiTabIndexedDbPersistence, cl as enableNetwork, mh as endAt, vh as endBefore, nl as ensureFirestoreConfigured, Jh as executeWrite, $h as getAggregateFromServer, Xh as getCountFromServer, Lh as getDoc, qh as getDocFromCache, Uh as getDocFromServer, Bh as getDocs, zh as getDocsFromCache, Gh as getDocsFromServer, el as getFirestore, wf as increment, tl as initializeFirestore, ch as limit, lh as limitToLast, fl as loadBundle, nf as memoryLocalCache, dl as namedQuery, Hh as onSnapshot, Yh as onSnapshotsInSync, ih as or, ah as orderBy, rf as persistentLocalCache, sf as persistentMultipleTabManager, af as persistentSingleTabManager, th as query, Hc as queryEqual, Wc as refEqual, pf as runTransaction, mf as serverTimestamp, Kh as setDoc, If as setIndexConfiguration, P as setLogLevel, Mh as snapshotEqual, dh as startAfter, fh as startAt, Dh as sum, hl as terminate, jh as updateDoc, sl as waitForPendingWrites, nh as where, bf as writeBatch };
 //# sourceMappingURL=index.esm5.js.map