@firebase/firestore 3.8.3-canary.c8a6e08b0 → 3.8.3-canary.d5d78cbcf

package/dist/index.esm5.js

@@ -6,7 +6,7 @@ import { Component as c } from "@firebase/component";
 
 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 y, createMockUserToken as m, deepEqual as g, getDefaultEmulatorHostnameAndPort as w } from "@firebase/util";
+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 T, createWebChannelTransport as E, getStatEventTarget as S, FetchXmlHttpFactory as _, WebChannel as D, Event as x, Stat as A } from "@firebase/webchannel-wrapper";
 
@@ -70,7 +70,7 @@ C.MOCK_USER = new C("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var k = "9.17.1-canary.c8a6e08b0", O = new l("@firebase/firestore");
+var k = "9.17.1-canary.d5d78cbcf", O = new l("@firebase/firestore");
 
 /**
  * @license
@@ -1090,7 +1090,7 @@ function pt(t) {
 /**
  * Compares indexes by collection group and segments. Ignores update time and
  * index ID.
- */ function yt(t, e) {
+ */ function mt(t, e) {
     var n = rt(t.collectionGroup, e.collectionGroup);
     if (0 !== n) return n;
     for (var r = 0; r < Math.min(t.fields.length, e.fields.length); ++r) if (0 !== (n = gt(t.fields[r], e.fields[r]))) return n;
@@ -1100,7 +1100,7 @@ function pt(t) {
 /** Returns a debug representation of the field index */ dt.UNKNOWN_ID = -1;
 
 /** An index component consisting of field path and index type.  */
-var mt = function(
+var yt = function(
 /** The field path of the component. */
 t, 
 /** The fields sorting order. */
@@ -1482,7 +1482,7 @@ function Dt(t) {
         return M("SimpleDb", "Removing database:", t), Rt(window.indexedDB.deleteDatabase(t)).toPromise();
     }, 
     /** Returns true if IndexedDB is available in the current environment. */ t.C = function() {
-        if (!y()) return !1;
+        if (!m()) return !1;
         if (t.N()) return !0;
         // We extensively use indexed array values and compound keys,
         // which IE and Edge do not support. However, they still have indexedDB
@@ -2654,13 +2654,13 @@ function ve(t) {
     var e, n;
 }
 
-function ye(t, e) {
+function me(t, e) {
     return {
         referenceValue: "projects/".concat(t.projectId, "/databases/").concat(t.database, "/documents/").concat(e.path.canonicalString())
     };
 }
 
-/** Returns true if `value` is an IntegerValue . */ function me(t) {
+/** Returns true if `value` is an IntegerValue . */ function ye(t) {
     return !!t && "integerValue" in t;
 }
 
@@ -2726,7 +2726,7 @@ function ye(t, e) {
         stringValue: ""
     } : "bytesValue" in t ? {
         bytesValue: ""
-    } : "referenceValue" in t ? ye(jt.empty(), ft.empty()) : "geoPointValue" in t ? {
+    } : "referenceValue" in t ? me(jt.empty(), ft.empty()) : "geoPointValue" in t ? {
         geoPointValue: {
             latitude: -90,
             longitude: -180
@@ -2751,7 +2751,7 @@ function ye(t, e) {
         stringValue: ""
     } : "stringValue" in t ? {
         bytesValue: ""
-    } : "bytesValue" in t ? ye(jt.empty(), ft.empty()) : "referenceValue" in t ? {
+    } : "bytesValue" in t ? me(jt.empty(), ft.empty()) : "referenceValue" in t ? {
         geoPointValue: {
             latitude: -90,
             longitude: -180
@@ -4029,7 +4029,7 @@ function dn(t) {
 /**
  * Returns the value to use as the upper bound for ascending index segment at
  * the provided `fieldPath` (or the lower bound for a descending segment).
- */ function yn(t, e, n) {
+ */ function mn(t, e, n) {
     // Process all filters to find a value for the current field segment
     for (var r = ae, i = !0, o = 0, u = pn(t, e); o < u.length; o++) {
         var a = u[o], s = ae, c = !0;
@@ -4104,7 +4104,7 @@ function dn(t) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ var mn = 
+ */ var yn = 
 /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -4120,11 +4120,11 @@ function(t, e, n, r, i, o /* LimitType.First */ , u, a) {
 };
 
 /** Creates a new Query instance with the options provided. */ function gn(t, e, n, r, i, o, u, a) {
-    return new mn(t, e, n, r, i, o, u, a);
+    return new yn(t, e, n, r, i, o, u, a);
 }
 
 /** Creates a new Query for a query that matches all documents at `path` */ function wn(t) {
-    return new mn(t);
+    return new yn(t);
 }
 
 /**
@@ -4214,11 +4214,11 @@ function Tn(t) {
 function Dn(t, e) {
     e.getFirstInequalityField(), Tn(t);
     var n = t.filters.concat([ e ]);
-    return new mn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+    return new yn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
 }
 
 function xn(t, e, n) {
-    return new mn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+    return new yn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
 }
 
 function An(t, e) {
@@ -4425,7 +4425,7 @@ function Rn(t, e, n) {
         // precision and resolves overflows by reducing precision, we do not
         // manually cap overflows at 2^63.
         var n = Bn(t, e), r = Hn(n) + Hn(t.It);
-        return me(n) && me(t.It) ? Vn(r) : Mn(t.Tt, r);
+        return ye(n) && ye(t.It) ? Vn(r) : Mn(t.Tt, r);
     }(t, e);
 }
 
@@ -4454,7 +4454,7 @@ function Rn(t, e, n) {
  * @returns a base value to store along with the mutation, or null for
  * idempotent transforms.
  */ function Bn(t, e) {
-    return t instanceof Wn ? me(n = e) || function(t) {
+    return t instanceof Wn ? ye(n = e) || function(t) {
         return !!t && "doubleValue" in t;
     }(n) ? e : {
         integerValue: 0
@@ -4888,7 +4888,7 @@ function(t) {
  *
  * See isPermanentWriteError for classifying write errors.
  */
-function yr(t) {
+function mr(t) {
     switch (t) {
       default:
         return q();
@@ -4938,7 +4938,7 @@ function yr(t) {
  *
  * @returns The Code equivalent to the given GRPC status code. Fails if there
  *     is no match.
- */ function mr(t) {
+ */ function yr(t) {
     if (void 0 === t) 
     // This shouldn't normally happen, but in certain error cases (like trying
     // to send invalid proto messages) we may get an error with no GRPC code.
@@ -5799,7 +5799,7 @@ function oi(t, e) {
         delete: Jr(t, e.key)
     }; else if (e instanceof ar) n = {
         update: ri(t, e.key, e.data),
-        updateMask: mi(e.fieldMask)
+        updateMask: yi(e.fieldMask)
     }; else {
         if (!(e instanceof pr)) return q();
         n = {
@@ -5904,7 +5904,7 @@ function si(t, e) {
         collectionId: r.lastSegment()
     } ]);
     var i = function(t) {
-        if (0 !== t.length) return yi(Fe.create(t, "and" /* CompositeOperator.AND */));
+        if (0 !== t.length) return mi(Fe.create(t, "and" /* CompositeOperator.AND */));
     }(e.filters);
     i && (n.structuredQuery.where = i);
     var o = function(t) {
@@ -6090,7 +6090,7 @@ function vi(t) {
     return ht.fromServerFormat(t.fieldPath);
 }
 
-function yi(t) {
+function mi(t) {
     return t instanceof Oe ? function(t) {
         if ("==" /* Operator.EQUAL */ === t.op) {
             if (be(t.value)) return {
@@ -6128,7 +6128,7 @@ function yi(t) {
         };
     }(t) : t instanceof Fe ? function(t) {
         var e = t.getFilters().map((function(t) {
-            return yi(t);
+            return mi(t);
         }));
         return 1 === e.length ? e[0] : {
             compositeFilter: {
@@ -6139,7 +6139,7 @@ function yi(t) {
     }(t) : q();
 }
 
-function mi(t) {
+function yi(t) {
     var e = [];
     return t.fields.forEach((function(t) {
         return e.push(t.canonicalString());
@@ -6840,7 +6840,7 @@ function co(t, e, n, r) {
  */
 // Note: This code is copied from the backend. Code that is not used by
 // Firestore was removed.
-/** Firestore index value writer.  */ var yo = /** @class */ function() {
+/** Firestore index value writer.  */ var mo = /** @class */ function() {
     function t() {}
     // The write methods below short-circuit writing terminators for values
     // containing a (terminating) truncated value.
@@ -6908,7 +6908,7 @@ function co(t, e, n, r) {
  *
  * Visible for testing.
  */
-function mo(t) {
+function yo(t) {
     if (0 === t) return 8;
     var e = 0;
     return t >> 4 == 0 && (
@@ -6929,7 +6929,7 @@ function go(t) {
     // This is just the number of bytes for the unsigned representation of the number.
     var e = 64 - function(t) {
         for (var e = 0, n = 0; n < 8; ++n) {
-            var r = mo(255 & t[n]);
+            var r = yo(255 & t[n]);
             if (e += r, 8 !== r) break;
         }
         return e;
@@ -6942,7 +6942,7 @@ function go(t) {
  * behavior defined by the backend.
  *
  * The code is ported from its Java counterpart.
- */ yo.Ee = new yo;
+ */ mo.Ee = new mo;
 
 var wo = /** @class */ function() {
     function t() {
@@ -7649,7 +7649,7 @@ var Vo = /** @class */ function() {
                         // For each segment, retrieve a lower bound if there is a suitable filter or
                         // startAt.
                         for (var n = [], r = !0, i = 0, o = vt(e); i < o.length; i++) {
-                            var u = o[i], a = 0 /* IndexKind.ASCENDING */ === u.kind ? vn(t, u.fieldPath, t.startAt) : yn(t, u.fieldPath, t.startAt);
+                            var u = o[i], a = 0 /* IndexKind.ASCENDING */ === u.kind ? vn(t, u.fieldPath, t.startAt) : mn(t, u.fieldPath, t.startAt);
                             n.push(a.value), r && (r = a.inclusive);
                         }
                         return new Ae(n, r);
@@ -7657,7 +7657,7 @@ var Vo = /** @class */ function() {
                         // For each segment, retrieve an upper bound if there is a suitable filter or
                         // endAt.
                         for (var n = [], r = !0, i = 0, o = vt(e); i < o.length; i++) {
-                            var u = o[i], a = 0 /* IndexKind.ASCENDING */ === u.kind ? yn(t, u.fieldPath, t.endAt) : vn(t, u.fieldPath, t.endAt);
+                            var u = o[i], a = 0 /* IndexKind.ASCENDING */ === u.kind ? mn(t, u.fieldPath, t.endAt) : vn(t, u.fieldPath, t.endAt);
                             n.push(a.value), r && (r = a.inclusive);
                         }
                         return new Ae(n, r);
@@ -7763,13 +7763,13 @@ var Vo = /** @class */ function() {
             var o = i[r], u = e.data.field(o.fieldPath);
             if (null == u) return null;
             var a = n.Ke(o.kind);
-            yo.Ee.ae(u, a);
+            mo.Ee.ae(u, a);
         }
         return n.Be();
     }, 
     /** Encodes a single value to the ascending index format. */ t.prototype.un = function(t) {
         var e = new To;
-        return yo.Ee.ae(t, e.Ke(0 /* IndexKind.ASCENDING */)), e.Be();
+        return mo.Ee.ae(t, e.Ke(0 /* IndexKind.ASCENDING */)), e.Be();
     }, 
     /**
      * Returns an encoded form of the document key that sorts based on the key
@@ -7777,7 +7777,7 @@ var Vo = /** @class */ function() {
      */
     t.prototype.ln = function(t, e) {
         var n = new To;
-        return yo.Ee.ae(ye(this.databaseId, e), n.Ke(function(t) {
+        return mo.Ee.ae(me(this.databaseId, e), n.Ke(function(t) {
             var e = vt(t);
             return 0 === e.length ? 0 /* IndexKind.ASCENDING */ : e[e.length - 1].kind;
         }(t))), n.Be();
@@ -7794,7 +7794,7 @@ var Vo = /** @class */ function() {
             var h = l[c];
             if (this.fn(e, a.fieldPath) && ge(s)) r = this.dn(r, a, s); else {
                 var f = h.Ke(a.kind);
-                yo.Ee.ae(s, f);
+                mo.Ee.ae(s, f);
             }
         }
         return this._n(r);
@@ -7820,7 +7820,7 @@ var Vo = /** @class */ function() {
     t.prototype.dn = function(t, e, n) {
         for (var i = r([], t, !0), o = [], u = 0, a = n.arrayValue.values || []; u < a.length; u++) for (var s = a[u], c = 0, l = i; c < l.length; c++) {
             var h = l[c], f = new To;
-            f.seed(h.Be()), yo.Ee.ae(s, f.Ke(e.kind)), o.push(f);
+            f.seed(h.Be()), mo.Ee.ae(s, f.Ke(e.kind)), o.push(f);
         }
         return o;
     }, t.prototype.fn = function(t, e) {
@@ -7836,7 +7836,7 @@ var Vo = /** @class */ function() {
                     e.push(function(t, e) {
                         var n = e ? new wt(e.sequenceNumber, new Tt(no(e.readTime), new ft(Ti(e.documentKey)), e.largestBatchId)) : wt.empty(), r = t.fields.map((function(t) {
                             var e = t[0], n = t[1];
-                            return new mt(ht.fromServerFormat(e), n);
+                            return new yt(ht.fromServerFormat(e), n);
                         }));
                         return new dt(t.indexId, t.collectionGroup, r, n);
                     }(t, n));
@@ -9118,7 +9118,7 @@ function nu(t) {
      * returned by `newChangeBuffer()` to ensure proper accounting of metadata.
      */
     t.prototype.addEntry = function(t, e, n) {
-        return yu(t).put(n);
+        return mu(t).put(n);
     }, 
     /**
      * Removes a document from the cache.
@@ -9127,7 +9127,7 @@ function nu(t) {
      * returned by `newChangeBuffer()` to ensure proper accounting of metadata.
      */
     t.prototype.removeEntry = function(t, e, n) {
-        return yu(t).delete(
+        return mu(t).delete(
         /**
  * Returns a key that can be used for document lookups via the primary key of
  * the DbRemoteDocument object store.
@@ -9153,9 +9153,9 @@ function nu(t) {
         }));
     }, t.prototype.getEntry = function(t, e) {
         var n = this, r = sn.newInvalidDocument(e);
-        return yu(t).X({
+        return mu(t).X({
             index: "documentKeyIndex",
-            range: IDBKeyRange.only(mu(e))
+            range: IDBKeyRange.only(yu(e))
         }, (function(t, i) {
             r = n.Wn(e, i);
         })).next((function() {
@@ -9173,9 +9173,9 @@ function nu(t) {
             size: 0,
             document: sn.newInvalidDocument(e)
         };
-        return yu(t).X({
+        return mu(t).X({
             index: "documentKeyIndex",
-            range: IDBKeyRange.only(mu(e))
+            range: IDBKeyRange.only(yu(e))
         }, (function(t, i) {
             r = {
                 document: n.Wn(e, i),
@@ -9217,8 +9217,8 @@ function nu(t) {
         e.forEach((function(t) {
             return i = i.add(t);
         }));
-        var o = IDBKeyRange.bound(mu(i.first()), mu(i.last())), u = i.getIterator(), a = u.getNext();
-        return yu(t).X({
+        var o = IDBKeyRange.bound(yu(i.first()), yu(i.last())), u = i.getIterator(), a = u.getNext();
+        return mu(t).X({
             index: "documentKeyIndex",
             range: o
         }, (function(t, e, i) {
@@ -9229,7 +9229,7 @@ function nu(t) {
             // Key found in cache.
             n(a, e), a = u.hasNext() ? u.getNext() : null), 
             // Skip to the next key (if there is one).
-            a ? i.j(mu(a)) : i.done();
+            a ? i.j(yu(a)) : i.done();
         })).next((function() {
             // The rest of the keys are not in the cache. One case where `iterate`
             // above won't go through them is when the cache is empty.
@@ -9237,7 +9237,7 @@ function nu(t) {
         }));
     }, t.prototype.getDocumentsMatchingQuery = function(t, e, n, r) {
         var i = this, o = e.path, u = [ o.popLast().toArray(), o.lastSegment(), to(n.readTime), n.documentKey.path.isEmpty() ? "" : n.documentKey.path.lastSegment() ], a = [ o.popLast().toArray(), o.lastSegment(), [ Number.MAX_SAFE_INTEGER, Number.MAX_SAFE_INTEGER ], "" ];
-        return yu(t).W(IDBKeyRange.bound(u, a, !0)).next((function(t) {
+        return mu(t).W(IDBKeyRange.bound(u, a, !0)).next((function(t) {
             for (var n = br(), o = 0, u = t; o < u.length; o++) {
                 var a = u[o], s = i.Wn(ft.fromSegments(a.prefixPath.concat(a.collectionGroup, a.documentId)), a);
                 s.isFoundDocument() && (kn(e, s) || r.has(s.key)) && (
@@ -9248,7 +9248,7 @@ function nu(t) {
         }));
     }, t.prototype.getAllFromCollectionGroup = function(t, e, n, r) {
         var i = this, o = br(), u = gu(e, n), a = gu(e, Tt.max());
-        return yu(t).X({
+        return mu(t).X({
             index: "collectionGroupIndex",
             range: IDBKeyRange.bound(u, a, !0)
         }, (function(t, e, n) {
@@ -9403,14 +9403,14 @@ function vu(t) {
 
 /**
  * Helper to get a typed SimpleDbStore for the remoteDocuments object store.
- */ function yu(t) {
+ */ function mu(t) {
     return Wi(t, "remoteDocumentsV14");
 }
 
 /**
  * Returns a key that can be used for document lookups on the
  * `DbRemoteDocumentDocumentKeyIndex` index.
- */ function mu(t) {
+ */ function yu(t) {
     var e = t.path.toArray();
     return [ 
     /* prefix path */ e.slice(0, e.length - 2), 
@@ -9736,7 +9736,7 @@ e) {
         return this.indexManager.getCollectionParents(t, i).next((function(u) {
             return xt.forEach(u, (function(u) {
                 var a = function(t, e) {
-                    return new mn(e, 
+                    return new yn(e, 
                     /*collectionGroup=*/ null, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
                 }(e, u.child(i));
                 return r.getDocumentsMatchingCollectionQuery(t, a, n).next((function(t) {
@@ -11533,8 +11533,8 @@ function ju(t, r) {
                         for (var d = 0, p = r; d < p.length; d++) {
                             var v = p[d];
                             o.push(v.batchId);
-                            for (var y = 0, m = v.mutations; y < m.length; y++) {
-                                var g = m[y];
+                            for (var m = 0, y = v.mutations; m < y.length; m++) {
+                                var g = y[m];
                                 u = u.add(g.key);
                             }
                         }
@@ -12454,12 +12454,12 @@ var aa = /** @class */ function() {
     t.C = function() {
         return "undefined" != typeof window && void 0 !== window.addEventListener && void 0 !== window.removeEventListener;
     }, t;
-}(), ya = {
+}(), ma = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery",
     RunAggregationQuery: "runAggregationQuery"
-}, ma = /** @class */ function() {
+}, ya = /** @class */ function() {
     function t(t) {
         this.Yr = t.Yr, this.Zr = t.Zr;
     }
@@ -12573,7 +12573,7 @@ var aa = /** @class */ function() {
         u.encodeInitMessageHeaders = !0;
         var a = r.join("");
         M("Connection", "Creating WebChannel: " + a, u);
-        var s = i.createWebChannel(a, u), c = !1, l = !1, h = new ma({
+        var s = i.createWebChannel(a, u), c = !1, l = !1, h = new ya({
             Yr: function(t) {
                 l ? M("Connection", "Not sending because WebChannel is closed:", t) : (c || (M("Connection", "Opening WebChannel transport."), 
                 s.open(), c = !0), M("Connection", "WebChannel sending:", t), s.send(t));
@@ -12634,7 +12634,7 @@ var aa = /** @class */ function() {
                         // lookup by string
                         // eslint-disable-next-line @typescript-eslint/no-explicit-any
                         var e = hr[t];
-                        if (void 0 !== e) return mr(e);
+                        if (void 0 !== e) return yr(e);
                     }(o), a = i.message;
                     void 0 === u && (u = G.INTERNAL, a = "Unknown error status: " + o + " with message " + i.message), 
                     // Mark closed so no further events are propagated
@@ -12697,7 +12697,7 @@ var aa = /** @class */ function() {
             return t[n] = e;
         }));
     }, t.prototype.fo = function(t, e) {
-        var n = ya[t];
+        var n = ma[t];
         return "".concat(this.co, "/v1/").concat(e, ":").concat(n);
     }, t;
 }());
@@ -13126,7 +13126,7 @@ function wa() {
                     return t.yt ? (U(void 0 === e || "string" == typeof e), Zt.fromBase64String(e || "")) : (U(void 0 === e || e instanceof Uint8Array), 
                     Zt.fromUint8Array(e || new Uint8Array));
                 }(t, e.targetChange.resumeToken), u = e.targetChange.cause, a = u && function(t) {
-                    var e = void 0 === t.code ? G.UNKNOWN : mr(t.code);
+                    var e = void 0 === t.code ? G.UNKNOWN : yr(t.code);
                     return new j(e, t.message || "");
                 }(u);
                 n = new Vr(r, i, o, a || null);
@@ -13142,9 +13142,9 @@ function wa() {
                 n = new Rr(p, v, d.key, d);
             } else if ("documentDelete" in e) {
                 e.documentDelete;
-                var y = e.documentDelete;
-                y.document;
-                var m = $r(t, y.document), g = y.readTime ? Hr(y.readTime) : at.min(), w = sn.newNoDocument(m, g), b = y.removedTargetIds || [];
+                var m = e.documentDelete;
+                m.document;
+                var y = $r(t, m.document), g = m.readTime ? Hr(m.readTime) : at.min(), w = sn.newNoDocument(y, g), b = m.removedTargetIds || [];
                 n = new Rr([], b, w.key, w);
             } else if ("documentRemove" in e) {
                 e.documentRemove;
@@ -13993,7 +13993,7 @@ function Ya(t, r) {
                         return n(this, (function(n) {
                             switch (n.label) {
                               case 0:
-                                return yr(i = r.code) && i !== G.ABORTED ? (e = t._u.shift(), 
+                                return mr(i = r.code) && i !== G.ABORTED ? (e = t._u.shift(), 
                                 // In this case it's also unlikely that the server itself is melting
                                 // down -- this was just a bad request so inhibit backoff on the next
                                 // restart.
@@ -14634,7 +14634,7 @@ function fs(t) {
     }, t.prototype.tr = function(t) {
         return Hr(t);
     }, t;
-}(), ys = /** @class */ function() {
+}(), ms = /** @class */ function() {
     function t(t, e, n) {
         this.$u = t, this.localStore = e, this.Tt = n, 
         /** Batched queries to be saved into storage */
@@ -14642,7 +14642,7 @@ function fs(t) {
         /** Batched documents to be saved into storage */
         this.documents = [], 
         /** The collection groups affected by this bundle. */
-        this.collectionGroups = new Set, this.progress = ms(t)
+        this.collectionGroups = new Set, this.progress = ys(t)
         /**
      * Adds an element from the bundle to the loader.
      *
@@ -14732,7 +14732,7 @@ function fs(t) {
  * Returns a `LoadBundleTaskProgress` representing the initial progress of
  * loading a bundle.
  */
-function ms(t) {
+function ys(t) {
     return {
         taskState: "Running",
         documentsLoaded: 0,
@@ -15881,7 +15881,7 @@ function Ws(t, r) {
 
 function Hs(t, r, i) {
     return e(this, void 0, void 0, (function() {
-        var e, i, o, u, a, s, c, l, h, f, d, p, v, y;
+        var e, i, o, u, a, s, c, l, h, f, d, p, v, m;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
@@ -15913,10 +15913,10 @@ function Hs(t, r, i) {
                 return [ 4 /*yield*/ , Zu(e.localStore, s) ];
 
               case 8:
-                return y = n.sent(), [ 4 /*yield*/ , Yu(e.localStore, y) ];
+                return m = n.sent(), [ 4 /*yield*/ , Yu(e.localStore, m) ];
 
               case 9:
-                return c = n.sent(), [ 4 /*yield*/ , _s(e, Xs(y), s, 
+                return c = n.sent(), [ 4 /*yield*/ , _s(e, Xs(m), s, 
                 /*current=*/ !1, c.resumeToken) ];
 
               case 10:
@@ -16129,7 +16129,7 @@ function ec(t, r, i) {
                     }(e)), Promise.resolve(new Set)) ];
 
                   case 4:
-                    return i._updateProgress(ms(e)), o = new ys(e, t.localStore, r.Tt), [ 4 /*yield*/ , r.yc() ];
+                    return i._updateProgress(ys(e)), o = new ms(e, t.localStore, r.Tt), [ 4 /*yield*/ , r.yc() ];
 
                   case 5:
                     u = n.sent(), n.label = 6;
@@ -16483,7 +16483,7 @@ function uc(t, r) {
             }));
         },
         releaseLock: function() {},
-        closed: Promise.reject("unimplemented")
+        closed: Promise.resolve()
     };
 }
 
@@ -16928,7 +16928,7 @@ function uc(t, r) {
             // In transactions, the backend will fail outdated reads with FAILED_PRECONDITION and
             // non-matching document versions with ABORTED. These errors should be retried.
             var e = t.code;
-            return "aborted" === e || "failed-precondition" === e || "already-exists" === e || !yr(e);
+            return "aborted" === e || "failed-precondition" === e || "already-exists" === e || !mr(e);
         }
         return !1;
     }, t;
@@ -17155,13 +17155,13 @@ function vc(t) {
     }));
 }
 
-function yc(t) {
+function mc(t) {
     return pc(t).then((function(t) {
         return t.persistence;
     }));
 }
 
-function mc(t) {
+function yc(t) {
     return pc(t).then((function(t) {
         return t.localStore;
     }));
@@ -17539,7 +17539,7 @@ function Rc(t, e, n, r) {
         if ("string" == typeof r.mockUserToken) u = r.mockUserToken, a = C.MOCK_USER; else {
             // Let createMockUserToken validate first (catches common mistakes like
             // invalid field "uid" and missing field "sub" / "user_id".)
-            u = m(r.mockUserToken, null === (i = t._app) || void 0 === i ? void 0 : i.options.projectId);
+            u = y(r.mockUserToken, null === (i = t._app) || void 0 === i ? void 0 : i.options.projectId);
             var s = r.mockUserToken.sub || r.mockUserToken.user_id;
             if (!s) throw new j(G.INVALID_ARGUMENT, "mockUserToken must contain 'sub' or 'user_id' field!");
             a = new C(s);
@@ -17703,7 +17703,7 @@ function Rc(t, e, n, r) {
     if (t = Cc(t, Fc), _c("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new j(G.INVALID_ARGUMENT, "Invalid collection ID '".concat(e, "' passed to function collectionGroup(). Collection IDs must not contain '/'."));
     return new Vc(t, 
     /* converter= */ null, function(t) {
-        return new mn(ct.emptyPath(), t);
+        return new yn(ct.emptyPath(), t);
     }(e));
 }
 
@@ -18358,7 +18358,7 @@ function nl(t) {
                 return n(this, (function(n) {
                     switch (n.label) {
                       case 0:
-                        return [ 4 /*yield*/ , yc(t) ];
+                        return [ 4 /*yield*/ , mc(t) ];
 
                       case 1:
                         return e = n.sent(), [ 4 /*yield*/ , gc(t) ];
@@ -18392,7 +18392,7 @@ function nl(t) {
                 return n(this, (function(o) {
                     switch (o.label) {
                       case 0:
-                        return [ 4 /*yield*/ , yc(t) ];
+                        return [ 4 /*yield*/ , mc(t) ];
 
                       case 1:
                         return r = o.sent(), [ 4 /*yield*/ , gc(t) ];
@@ -18533,7 +18533,7 @@ function al(t, r) {
                             return n.persistence.runTransaction("Get named query", "readonly", (function(t) {
                                 return n.Os.getNamedQuery(t, e);
                             }));
-                        }, [ 4 /*yield*/ , mc(t) ];
+                        }, [ 4 /*yield*/ , yc(t) ];
 
                       case 1:
                         return [ 2 /*return*/ , e.apply(void 0, [ n.sent(), r ]) ];
@@ -18790,7 +18790,7 @@ function(t) {
     t.prototype._compareTo = function(t) {
         return rt(this._lat, t._lat) || rt(this._long, t._long);
     }, t;
-}(), yl = /^__.*__$/, ml = /** @class */ function() {
+}(), ml = /^__.*__$/, yl = /** @class */ function() {
     function t(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
@@ -18922,7 +18922,7 @@ function(t) {
         if (this.path) for (var t = 0; t < this.path.length; t++) this.aa(this.path.get(t));
     }, t.prototype.aa = function(t) {
         if (0 === t.length) throw this.fa("Document fields must not be empty");
-        if (wl(this.ra) && yl.test(t)) throw this.fa('Document fields cannot begin and end with "__"');
+        if (wl(this.ra) && ml.test(t)) throw this.fa('Document fields cannot begin and end with "__"');
     }, t;
 }(), Il = /** @class */ function() {
     function t(t, e, n) {
@@ -18964,7 +18964,7 @@ function(t) {
             return a.covers(t.field);
         }));
     } else a = null, s = u.fieldTransforms;
-    return new ml(new un(c), a, s);
+    return new yl(new un(c), a, s);
 }
 
 var Sl = /** @class */ function(e) {
@@ -19090,12 +19090,12 @@ var Dl = /** @class */ function(e) {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
         p = v(p);
-        var y = u.ha(d);
+        var m = u.ha(d);
         if (p instanceof Sl) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(d); else {
-            var m = Fl(p, y);
-            null != m && (l.push(d), h.set(d, m));
+            var y = Fl(p, m);
+            null != y && (l.push(d), h.set(d, y));
         }
     }
     var g = new on(l);
@@ -19600,7 +19600,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 yh("or", t);
+        return mh("or", t);
     })), Jl._create("or" /* CompositeOperator.OR */ , t)
     /**
  * Creates a new {@link QueryCompositeFilterConstraint} that is a conjunction of
@@ -19619,7 +19619,7 @@ function Zl() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // Only support QueryFilterConstraints
         return t.forEach((function(t) {
-        return yh("and", t);
+        return mh("and", t);
     })), Jl._create("and" /* CompositeOperator.AND */ , t)
     /**
  * A `QueryOrderByConstraint` is used to sort the set of documents returned by a
@@ -19660,7 +19660,7 @@ var th = /** @class */ function(e) {
         return new Vc(t.firestore, t.converter, function(t, e) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             var n = t.explicitOrderBy.concat([ e ]);
-            return new mn(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new yn(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }, n;
 }(Wl);
@@ -19752,7 +19752,7 @@ var oh = /** @class */ function(e) {
     }, n.prototype._apply = function(t) {
         var e = hh(t, this.type, this._docOrFields, this._inclusive);
         return new Vc(t.firestore, t.converter, function(t, e) {
-            return new mn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+            return new yn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }, n;
 }(Wl);
@@ -19791,7 +19791,7 @@ function ah() {
     }, n.prototype._apply = function(t) {
         var e = hh(t, this.type, this._docOrFields, this._inclusive);
         return new Vc(t.firestore, t.converter, function(t, e) {
-            return new mn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+            return new yn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }, n;
 }(Wl);
@@ -19820,7 +19820,7 @@ function lh() {
         // results.
         for (var o = [], u = 0, a = Sn(t); u < a.length; u++) {
             var s = a[u];
-            if (s.field.isKeyField()) o.push(ye(e, r.key)); else {
+            if (s.field.isKeyField()) o.push(me(e, r.key)); else {
                 var c = r.data.field(s.field);
                 if (ie(c)) throw new j(G.INVALID_ARGUMENT, 'Invalid query. You are trying to start or end a query using a document for which the field "' + s.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
                 if (null === c) {
@@ -19845,7 +19845,7 @@ function lh() {
                 var l = t.path.child(ct.fromString(c));
                 if (!ft.isDocumentKey(l)) throw new j(G.INVALID_ARGUMENT, "Invalid query. When querying a collection group and ordering by documentId(), the value passed to ".concat(r, "() must result in a valid document path, but '").concat(l, "' is not because it contains an odd number of segments."));
                 var h = new ft(l);
-                a.push(ye(e, h));
+                a.push(me(e, h));
             } else {
                 var f = Ol(n, r, c);
                 a.push(f);
@@ -19861,9 +19861,9 @@ function fh(t, e, n) {
         if (!En(e) && -1 !== n.indexOf("/")) throw new j(G.INVALID_ARGUMENT, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '".concat(n, "' contains a '/' character."));
         var r = e.path.child(ct.fromString(n));
         if (!ft.isDocumentKey(r)) throw new j(G.INVALID_ARGUMENT, "Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '".concat(r, "' is not because it has an odd number of segments (").concat(r.length, ")."));
-        return ye(t, new ft(r));
+        return me(t, new ft(r));
     }
-    if (n instanceof Mc) return ye(t, n._key);
+    if (n instanceof Mc) return me(t, n._key);
     throw new j(G.INVALID_ARGUMENT, "Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ".concat(Nc(n), "."));
 }
 
@@ -19872,20 +19872,17 @@ function fh(t, e, n) {
  * array requirements.
  */ function dh(t, e) {
     if (!Array.isArray(t) || 0 === t.length) throw new j(G.INVALID_ARGUMENT, "Invalid Query. A non-empty array is required for '".concat(e.toString(), "' filters."));
-    if (t.length > 10) throw new j(G.INVALID_ARGUMENT, "Invalid Query. '".concat(e.toString(), "' filters support a maximum of 10 elements in the value array."));
 }
 
 /**
  * Given an operator, returns the set of operators that cannot be used with it.
  *
- * Operators in a query must adhere to the following set of rules:
- * 1. Only one array operator is allowed.
- * 2. Only one disjunctive operator is allowed.
- * 3. `NOT_EQUAL` cannot be used with another `NOT_EQUAL` operator.
- * 4. `NOT_IN` cannot be used with array, disjunctive, or `NOT_EQUAL` operators.
+ * This is not a comprehensive check, and this function should be removed in the
+ * long term. Validations should occur in the Firestore backend.
  *
- * Array operators: `ARRAY_CONTAINS`, `ARRAY_CONTAINS_ANY`
- * Disjunctive operators: `IN`, `ARRAY_CONTAINS_ANY`, `NOT_IN`
+ * Operators in a query must adhere to the following set of rules:
+ * 1. Only one inequality per query.
+ * 2. `NOT_IN` cannot be used with array, disjunctive, or `NOT_EQUAL` operators.
  */ function ph(t, e) {
     if (e.isInequality()) {
         var n = Tn(t), r = e.field;
@@ -19904,17 +19901,12 @@ function fh(t, e, n) {
           case "!=" /* Operator.NOT_EQUAL */ :
             return [ "!=" /* Operator.NOT_EQUAL */ , "not-in" /* Operator.NOT_IN */ ];
 
-          case "array-contains" /* Operator.ARRAY_CONTAINS */ :
-            return [ "array-contains" /* Operator.ARRAY_CONTAINS */ , "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ , "not-in" /* Operator.NOT_IN */ ];
-
-          case "in" /* Operator.IN */ :
-            return [ "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ , "in" /* Operator.IN */ , "not-in" /* Operator.NOT_IN */ ];
-
           case "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ :
-            return [ "array-contains" /* Operator.ARRAY_CONTAINS */ , "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ , "in" /* Operator.IN */ , "not-in" /* Operator.NOT_IN */ ];
+          case "in" /* Operator.IN */ :
+            return [ "not-in" /* Operator.NOT_IN */ ];
 
           case "not-in" /* Operator.NOT_IN */ :
-            return [ "array-contains" /* Operator.ARRAY_CONTAINS */ , "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ , "in" /* Operator.IN */ , "not-in" /* Operator.NOT_IN */ , "!=" /* Operator.NOT_EQUAL */ ];
+            return [ "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ , "in" /* Operator.IN */ , "not-in" /* Operator.NOT_IN */ , "!=" /* Operator.NOT_EQUAL */ ];
 
           default:
             return [];
@@ -19929,11 +19921,11 @@ function vh(t, e, n) {
     if (!n.isEqual(e)) throw new j(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 yh(t, e) {
+function mh(t, e) {
     if (!(e instanceof Xl || e instanceof Jl)) throw new j(G.INVALID_ARGUMENT, "Function ".concat(t, "() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'."));
 }
 
-var mh = /** @class */ function() {
+var yh = /** @class */ function() {
     function t() {}
     return t.prototype.convertValue = function(t, e) {
         switch (void 0 === e && (e = "none"), ce(t)) {
@@ -20053,7 +20045,7 @@ var wh = /** @class */ function(e) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
         return new Mc(this.firestore, /* converter= */ null, e);
     }, n;
-}(mh);
+}(yh);
 
 /**
  * @license
@@ -20408,7 +20400,7 @@ var Oh = /** @class */ function(e) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
         return new Mc(this.firestore, /* converter= */ null, e);
     }, n;
-}(mh);
+}(yh);
 
 /**
  * Reads the document referred to by this `DocumentReference` from cache.
@@ -20453,7 +20445,7 @@ var Oh = /** @class */ function(e) {
                                     }
                                 }));
                             }));
-                        }, [ 4 /*yield*/ , mc(t) ];
+                        }, [ 4 /*yield*/ , yc(t) ];
 
                       case 1:
                         return [ 2 /*return*/ , i.apply(void 0, [ u.sent(), r, o ]) ];
@@ -20540,7 +20532,7 @@ function Vh(t) {
                                     }
                                 }));
                             }));
-                        }, [ 4 /*yield*/ , mc(t) ];
+                        }, [ 4 /*yield*/ , yc(t) ];
 
                       case 1:
                         return [ 2 /*return*/ , i.apply(void 0, [ u.sent(), r, o ]) ];
@@ -20632,12 +20624,12 @@ function Kh(t) {
         error: u[c + 1],
         complete: u[c + 2]
     }; else {
-        var y = Cc(t, Vc);
-        h = Cc(y.firestore, Wc), f = y._query;
-        var m = new Oh(h);
+        var m = Cc(t, Vc);
+        h = Cc(m.firestore, Wc), f = m._query;
+        var y = new Oh(h);
         l = {
             next: function(t) {
-                u[c] && u[c](new Ah(h, m, y, t));
+                u[c] && u[c](new Ah(h, y, m, t));
             },
             error: u[c + 1],
             complete: u[c + 2]
@@ -21318,13 +21310,13 @@ function af(t, i) {
             var o = i[r], u = sf(o, "collectionGroup"), a = [];
             if (Array.isArray(o.fields)) for (var s = 0, c = o.fields; s < c.length; s++) {
                 var l = c[s], h = ql("setIndexConfiguration", sf(l, "fieldPath"));
-                "CONTAINS" === l.arrayConfig ? a.push(new mt(h, 2 /* IndexKind.CONTAINS */)) : "ASCENDING" === l.order ? a.push(new mt(h, 0 /* IndexKind.ASCENDING */)) : "DESCENDING" === l.order && a.push(new mt(h, 1 /* IndexKind.DESCENDING */));
+                "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()));
         }
         return n;
     }(i);
-    return mc(u).then((function(t) {
+    return yc(u).then((function(t) {
         return function(t, i) {
             return e(this, void 0, void 0, (function() {
                 var e, o, u;
@@ -21345,7 +21337,7 @@ function af(t, i) {
                                 }
                                 for (;s < a; ) i(e[s++]);
                                 for (;c < u; ) o(t[c++]);
-                            }(e, i, yt, (function(e) {
+                            }(e, i, mt, (function(e) {
                                 u.push(o.addFieldIndex(t, e));
                             }), (function(e) {
                                 u.push(o.deleteFieldIndex(t, e));
@@ -21377,9 +21369,9 @@ function sf(t, e) {
     return r = Object.assign({
         useFetchStreams: Jh
     }, r), o._setSettings(r), o;
-}), "PUBLIC").setMultipleInstances(!0)), u(N, "3.8.3-canary.c8a6e08b0", void 0), 
+}), "PUBLIC").setMultipleInstances(!0)), u(N, "3.8.3-canary.d5d78cbcf", void 0), 
 // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-u(N, "3.8.3-canary.c8a6e08b0", "esm5");
+u(N, "3.8.3-canary.d5d78cbcf", "esm5");
 
-export { mh as AbstractUserDataWriter, cl as AggregateField, ll as AggregateQuerySnapshot, hl as Bytes, zc as CACHE_SIZE_UNLIMITED, Lc as CollectionReference, Mc as DocumentReference, Dh as DocumentSnapshot, fl as FieldPath, pl as FieldValue, Wc as Firestore, j as FirestoreError, vl as GeoPoint, Qc as LoadBundleTask, Vc as Query, Jl as QueryCompositeFilterConstraint, Wl as QueryConstraint, xh as QueryDocumentSnapshot, sh as QueryEndAtConstraint, Xl as QueryFieldFilterConstraint, nh as QueryLimitConstraint, th as QueryOrderByConstraint, Ah as QuerySnapshot, oh as QueryStartAtConstraint, _h as SnapshotMetadata, ut as Timestamp, $h as Transaction, Xh as WriteBatch, jt as _DatabaseId, ft as _DocumentKey, tt as _EmptyAppCheckTokenProvider, W as _EmptyAuthCredentialsProvider, ht as _FieldPath, Cc as _cast, B as _debugAssert, $t as _isBase64Available, L as _logWarn, Dc as _validateIsNotUsedTogether, Bh as addDoc, Eh as aggregateFieldEqual, Sh as aggregateQuerySnapshotEqual, Zl as and, rf as arrayRemove, nf as arrayUnion, Ih as average, el as clearIndexedDbPersistence, Pc as collection, qc as collectionGroup, Rc as connectFirestoreEmulator, Th as count, Uh as deleteDoc, tf as deleteField, il as disableNetwork, Uc as doc, dl as documentId, $c as enableIndexedDbPersistence, Zc as enableMultiTabIndexedDbPersistence, rl as enableNetwork, lh as endAt, ch as endBefore, Yc as ensureFirestoreConfigured, jh as executeWrite, Wh as getAggregateFromServer, zh as getCountFromServer, kh as getDoc, Fh as getDocFromCache, Rh as getDocFromServer, Mh as getDocs, Vh as getDocsFromCache, Lh as getDocsFromServer, Xc as getFirestore, of as increment, Hc as initializeFirestore, rh as limit, ih as limitToLast, ul as loadBundle, al as namedQuery, Kh as onSnapshot, Gh as onSnapshotsInSync, $l as or, eh as orderBy, Hl as query, Kc as queryEqual, Bc as refEqual, Zh as runTransaction, ef as serverTimestamp, Ph as setDoc, af as setIndexConfiguration, R as setLogLevel, Ch as snapshotEqual, ah as startAfter, uh as startAt, bh as sum, ol as terminate, qh as updateDoc, nl as waitForPendingWrites, Yl as where, uf as writeBatch };
+export { yh as AbstractUserDataWriter, cl as AggregateField, ll as AggregateQuerySnapshot, hl as Bytes, zc as CACHE_SIZE_UNLIMITED, Lc as CollectionReference, Mc as DocumentReference, Dh as DocumentSnapshot, fl as FieldPath, pl as FieldValue, Wc as Firestore, j as FirestoreError, vl as GeoPoint, Qc as LoadBundleTask, Vc as Query, Jl as QueryCompositeFilterConstraint, Wl as QueryConstraint, xh as QueryDocumentSnapshot, sh as QueryEndAtConstraint, Xl as QueryFieldFilterConstraint, nh as QueryLimitConstraint, th as QueryOrderByConstraint, Ah as QuerySnapshot, oh as QueryStartAtConstraint, _h as SnapshotMetadata, ut as Timestamp, $h as Transaction, Xh as WriteBatch, jt as _DatabaseId, ft as _DocumentKey, tt as _EmptyAppCheckTokenProvider, W as _EmptyAuthCredentialsProvider, ht as _FieldPath, Cc as _cast, B as _debugAssert, $t as _isBase64Available, L as _logWarn, Dc as _validateIsNotUsedTogether, Bh as addDoc, Eh as aggregateFieldEqual, Sh as aggregateQuerySnapshotEqual, Zl as and, rf as arrayRemove, nf as arrayUnion, Ih as average, el as clearIndexedDbPersistence, Pc as collection, qc as collectionGroup, Rc as connectFirestoreEmulator, Th as count, Uh as deleteDoc, tf as deleteField, il as disableNetwork, Uc as doc, dl as documentId, $c as enableIndexedDbPersistence, Zc as enableMultiTabIndexedDbPersistence, rl as enableNetwork, lh as endAt, ch as endBefore, Yc as ensureFirestoreConfigured, jh as executeWrite, Wh as getAggregateFromServer, zh as getCountFromServer, kh as getDoc, Fh as getDocFromCache, Rh as getDocFromServer, Mh as getDocs, Vh as getDocsFromCache, Lh as getDocsFromServer, Xc as getFirestore, of as increment, Hc as initializeFirestore, rh as limit, ih as limitToLast, ul as loadBundle, al as namedQuery, Kh as onSnapshot, Gh as onSnapshotsInSync, $l as or, eh as orderBy, Hl as query, Kc as queryEqual, Bc as refEqual, Zh as runTransaction, ef as serverTimestamp, Ph as setDoc, af as setIndexConfiguration, R as setLogLevel, Ch as snapshotEqual, ah as startAfter, uh as startAt, bh as sum, ol as terminate, qh as updateDoc, nl as waitForPendingWrites, Yl as where, uf as writeBatch };
 //# sourceMappingURL=index.esm5.js.map