@firebase/firestore 3.4.2-canary.c271d16a9 → 3.4.2-canary.ff2f7d4c8

package/dist/lite/index.browser.esm5.js

@@ -4,7 +4,7 @@ import { SDK_VERSION as i, _registerComponent as o, registerVersion as a, _getPr
 
 import { Component as c } from "@firebase/component";
 
-import { Logger as l, LogLevel as f } from "@firebase/logger";
+import { Logger as f, LogLevel as l } from "@firebase/logger";
 
 import { FirebaseError as h, getModularInstance as p, createMockUserToken as d } from "@firebase/util";
 
@@ -67,7 +67,7 @@ m.MOCK_USER = new m("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var y = "9.6.2-canary.c271d16a9", v = new l("@firebase/firestore");
+var y = "9.6.2-canary.ff2f7d4c8", v = new f("@firebase/firestore");
 
 /**
  * @license
@@ -104,7 +104,7 @@ function g(t) {
 
 function w(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (v.logLevel <= f.DEBUG) {
+    if (v.logLevel <= l.DEBUG) {
         var i = e.map(T);
         v.debug.apply(v, r([ "Firestore (" + y + "): " + t ], i));
     }
@@ -112,7 +112,7 @@ function w(t) {
 
 function b(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (v.logLevel <= f.ERROR) {
+    if (v.logLevel <= l.ERROR) {
         var i = e.map(T);
         v.error.apply(v, r([ "Firestore (" + y + "): " + t ], i));
     }
@@ -122,7 +122,7 @@ function b(t) {
  * @internal
  */ function _(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (v.logLevel <= f.WARN) {
+    if (v.logLevel <= l.WARN) {
         var i = e.map(T);
         v.warn.apply(v, r([ "Firestore (" + y + "): " + t ], i));
     }
@@ -225,7 +225,7 @@ e) {
  * 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 A = "cancelled", k = "unknown", V = "invalid-argument", D = "deadline-exceeded", P = "not-found", F = "permission-denied", N = "unauthenticated", q = "resource-exhausted", O = "failed-precondition", C = "aborted", j = "out-of-range", L = "unimplemented", R = "internal", M = "unavailable", U = /** @class */ function(e) {
+ */ var A = "cancelled", k = "unknown", V = "invalid-argument", D = "deadline-exceeded", N = "not-found", P = "permission-denied", q = "unauthenticated", F = "resource-exhausted", O = "failed-precondition", C = "aborted", j = "out-of-range", L = "unimplemented", R = "internal", M = "unavailable", U = /** @class */ function(e) {
     /** @hideconstructor */
     function n(
     /**
@@ -647,7 +647,7 @@ function ut(t, e) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function lt(t) {
+/** Returns whether the value represents -0. */ function ft(t) {
     // Detect if the value is -0.0. Based on polyfill from
     // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
     return 0 === t && 1 / t == -1 / 0;
@@ -672,7 +672,7 @@ function ut(t, e) {
  * 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 ft, ht, pt = {
+ */ var lt, ht, pt = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery"
@@ -737,15 +737,15 @@ function dt(t) {
         // return Code.OUT_OF_RANGE;
               case 401:
         // Unauthorized
-        return N;
+        return q;
 
       case 403:
         // Forbidden
-        return F;
+        return P;
 
       case 404:
         // Not Found
-        return P;
+        return N;
 
       case 409:
         // Conflict
@@ -759,7 +759,7 @@ function dt(t) {
 
       case 429:
         // Too Many Requests
-        return q;
+        return F;
 
       case 499:
         // Client Closed Request
@@ -808,7 +808,7 @@ function dt(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (ht = ft || (ft = {}))[ht.OK = 0] = "OK", ht[ht.CANCELLED = 1] = "CANCELLED", 
+ */ (ht = lt || (lt = {}))[ht.OK = 0] = "OK", ht[ht.CANCELLED = 1] = "CANCELLED", 
 ht[ht.UNKNOWN = 2] = "UNKNOWN", ht[ht.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
 ht[ht.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", ht[ht.NOT_FOUND = 5] = "NOT_FOUND", 
 ht[ht.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", ht[ht.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
@@ -968,7 +968,7 @@ var mt = /** @class */ function(r) {
  * limitations under the License.
  */ var vt = /** @class */ function() {
     function t() {}
-    return t.P = function() {
+    return t.R = function() {
         for (
         // Alphanumeric characters
         var t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", e = Math.floor(256 / t.length) * t.length, n = ""
@@ -1418,7 +1418,7 @@ var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *   FieldValueOptions to value().
  * - With respect to other ServerTimestampValues, they sort by their
  *   localWriteTime.
- */ function Pt(t) {
+ */ function Nt(t) {
     var e, n;
     return "server_timestamp" === (null === (n = ((null === (e = null == t ? void 0 : t.mapValue) || void 0 === e ? void 0 : e.fields) || {}).__type__) || void 0 === n ? void 0 : n.stringValue);
 }
@@ -1428,14 +1428,14 @@ var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *
  * Preserving the previous values allows the user to display the last resoled
  * value until the backend responds with the timestamp.
- */ function Ft(t) {
+ */ function Pt(t) {
     var e = t.mapValue.fields.__previous_value__;
-    return Pt(e) ? Ft(e) : e;
+    return Nt(e) ? Pt(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Nt(t) {
+ */ function qt(t) {
     var e = kt(t.mapValue.fields.__local_write_time__.timestampValue);
     return new bt(e.seconds, e.nanos);
 }
@@ -1456,14 +1456,14 @@ var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Extracts the backend's type order for the provided value. */ function qt(t) {
-    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Pt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : S();
+/** Extracts the backend's type order for the provided value. */ function Ft(t) {
+    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Nt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : S();
 }
 
 /** Tests `left` and `right` for equality based on the backend semantics. */ function Ot(t, e) {
     if (t === e) return !0;
-    var n = qt(t);
-    if (n !== qt(e)) return !1;
+    var n = Ft(t);
+    if (n !== Ft(e)) return !1;
     switch (n) {
       case 0 /* NullValue */ :
         return !0;
@@ -1472,7 +1472,7 @@ var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         return t.booleanValue === e.booleanValue;
 
       case 4 /* ServerTimestampValue */ :
-        return Nt(t).isEqual(Nt(e));
+        return qt(t).isEqual(qt(e));
 
       case 3 /* TimestampValue */ :
         return function(t, e) {
@@ -1504,7 +1504,7 @@ var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
             if ("integerValue" in t && "integerValue" in e) return Vt(t.integerValue) === Vt(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
                 var n = Vt(t.doubleValue), r = Vt(e.doubleValue);
-                return n === r ? lt(n) === lt(r) : isNaN(n) && isNaN(r);
+                return n === r ? ft(n) === ft(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
@@ -1533,7 +1533,7 @@ function Ct(t, e) {
 
 function jt(t, e) {
     if (t === e) return 0;
-    var n = qt(t), r = qt(e);
+    var n = Ft(t), r = Ft(e);
     if (n !== r) return gt(n, r);
     switch (n) {
       case 0 /* NullValue */ :
@@ -1554,7 +1554,7 @@ function jt(t, e) {
         return Lt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return Lt(Nt(t), Nt(e));
+        return Lt(qt(t), qt(e));
 
       case 5 /* StringValue */ :
         return gt(t.stringValue, e.stringValue);
@@ -1873,7 +1873,7 @@ function Rt(t, e) {
     void 0 === e && (e = null), void 0 === n && (n = []), void 0 === r && (r = []), 
     void 0 === i && (i = null), void 0 === o && (o = null), void 0 === a && (a = null), 
     this.path = t, this.collectionGroup = e, this.orderBy = n, this.filters = r, this.limit = i, 
-    this.startAt = o, this.endAt = a, this.R = null;
+    this.startAt = o, this.endAt = a, this.P = null;
 };
 
 /**
@@ -1930,7 +1930,7 @@ var Wt = /** @class */ function(e) {
     }, n.prototype.matches = function(t) {
         var e = t.data.field(this.field);
         // Types do not have to match in NOT_EQUAL filters.
-                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.D(jt(e, this.value)) : null !== e && qt(this.value) === qt(e) && this.D(jt(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.D(jt(e, this.value)) : null !== e && Ft(this.value) === Ft(e) && this.D(jt(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }, n.prototype.D = function(t) {
         switch (this.op) {
@@ -2088,7 +2088,7 @@ function(t, e, n, r, i, o /* First */ , a, s) {
     this.filters = r, this.limit = i, this.limitType = o, this.startAt = a, this.endAt = s, 
     this.$ = null, 
     // The corresponding `Target` of this `Query` instance.
-    this.F = null, this.startAt, this.endAt;
+    this.S = null, this.startAt, this.endAt;
 };
 
 /** Creates a new Query for a query that matches all documents at `path` */ function ue(t) {
@@ -2099,7 +2099,7 @@ function ce(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function le(t) {
+function fe(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
         var r = n[e];
         if (r.N()) return r.field;
@@ -2114,7 +2114,7 @@ function le(t) {
 /**
  * Returns whether the query matches a collection group rather than a specific
  * collection.
- */ function fe(t) {
+ */ function le(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2126,7 +2126,7 @@ function le(t) {
     var e = I(t);
     if (null === e.$) {
         e.$ = [];
-        var n = le(e), r = ce(e);
+        var n = fe(e), r = ce(e);
         if (null !== n && null === r) 
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
@@ -2151,7 +2151,7 @@ function le(t) {
  * Converts this `Query` instance to it's corresponding `Target` representation.
  */ function pe(t) {
     var e = I(t);
-    if (!e.F) if ("F" /* First */ === e.limitType) e.F = Ht(e.path, e.collectionGroup, he(e), e.filters, e.limit, e.startAt, e.endAt); else {
+    if (!e.S) if ("F" /* First */ === e.limitType) e.S = Ht(e.path, e.collectionGroup, he(e), e.filters, e.limit, e.startAt, e.endAt); else {
         for (
         // Flip the orderBy directions since we want the last results
         var n = [], r = 0, i = he(e); r < i.length; r++) {
@@ -2161,9 +2161,9 @@ function le(t) {
         // We need to swap the cursors to match the now-flipped query ordering.
                 var s = e.endAt ? new re(e.endAt.position, !e.endAt.before) : null, u = e.startAt ? new re(e.startAt.position, !e.startAt.before) : null;
         // Now return as a LimitType.First query.
-                e.F = Ht(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
+                e.S = Ht(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
     }
-    return e.F;
+    return e.S;
 }
 
 /**
@@ -2193,7 +2193,7 @@ function le(t) {
  */
 function de(t, e) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !lt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !ft(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
     /**
      * Returns an IntegerValue for `value`.
@@ -2203,7 +2203,7 @@ function de(t, e) {
             integerValue: "" + t
         };
     }(e) : function(t, e) {
-        if (t.S) {
+        if (t.F) {
             if (isNaN(e)) return {
                 doubleValue: "NaN"
             };
@@ -2215,7 +2215,7 @@ function de(t, e) {
             };
         }
         return {
-            doubleValue: lt(e) ? "-0" : e
+            doubleValue: ft(e) ? "-0" : e
         };
     }(t, e);
 }
@@ -2332,7 +2332,7 @@ function de(t, e) {
     "not-in": "NOT_IN",
     "array-contains-any": "ARRAY_CONTAINS_ANY"
 }, De = function(t, e) {
-    this.databaseId = t, this.S = e;
+    this.databaseId = t, this.F = e;
 };
 
 /** Transforms a value into a server-generated timestamp. */
@@ -2347,8 +2347,8 @@ function de(t, e) {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Pe(t, e) {
-    return t.S ? new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "") + "." + ("000000000" + e.nanoseconds).slice(-9) + "Z" : {
+function Ne(t, e) {
+    return t.F ? new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "") + "." + ("000000000" + e.nanoseconds).slice(-9) + "Z" : {
         seconds: "" + e.seconds,
         nanos: e.nanoseconds
     };
@@ -2358,15 +2358,15 @@ function Pe(t, e) {
  * Returns a value for bytes that's appropriate to put in a proto.
  *
  * Visible for testing.
- */ function Fe(t, e) {
-    return t.S ? e.toBase64() : e.toUint8Array();
+ */ function Pe(t, e) {
+    return t.F ? e.toBase64() : e.toUint8Array();
 }
 
-function Ne(t, e) {
-    return Pe(t, e.toTimestamp());
+function qe(t, e) {
+    return Ne(t, e.toTimestamp());
 }
 
-function qe(t) {
+function Fe(t) {
     return E(!!t), _t.fromTimestamp(function(t) {
         var e = kt(t);
         return new bt(e.seconds, e.nanos);
@@ -2577,7 +2577,7 @@ function Qe(t) {
             var o = i[0], a = i[1];
             return r.K.m(t, e, n, o, a);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === N && (r.authCredentials.invalidateToken(), 
+            throw "FirebaseError" === t.name ? (t.code === q && (r.authCredentials.invalidateToken(), 
             r.appCheckCredentials.invalidateToken()), t) : new U(k, t.toString());
         }));
     }, 
@@ -2587,7 +2587,7 @@ function Qe(t) {
             var o = i[0], a = i[1];
             return r.K.T(t, e, n, o, a);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === N && (r.authCredentials.invalidateToken(), 
+            throw "FirebaseError" === t.name ? (t.code === q && (r.authCredentials.invalidateToken(), 
             r.appCheckCredentials.invalidateToken()), t) : new U(k, t.toString());
         }));
     }, n.prototype.terminate = function() {
@@ -2672,7 +2672,7 @@ function Ye(t, r) {
                                 }(0, t);
                             }))), e.precondition.isNone || (n.currentDocument = function(t, e) {
                                 return void 0 !== e.updateTime ? {
-                                    updateTime: Ne(t, e.updateTime)
+                                    updateTime: qe(t, e.updateTime)
                                 } : void 0 !== e.exists ? {
                                     exists: e.exists
                                 } : S();
@@ -2705,7 +2705,7 @@ function $e(t, r) {
                     var n = function(t, e) {
                         return "found" in e ? function(t, e) {
                             E(!!e.found), e.found.name, e.found.updateTime;
-                            var n = je(t, e.found.name), r = qe(e.found.updateTime), i = new zt({
+                            var n = je(t, e.found.name), r = Fe(e.found.updateTime), i = new zt({
                                 mapValue: {
                                     fields: e.found.fields
                                 }
@@ -2713,7 +2713,7 @@ function $e(t, r) {
                             return Qt.newFoundDocument(n, r, i);
                         }(t, e) : "missing" in e ? function(t, e) {
                             E(!!e.missing), E(!!e.readTime);
-                            var n = je(t, e.missing), r = qe(e.readTime);
+                            var n = je(t, e.missing), r = Fe(e.readTime);
                             return Qt.newNoDocument(n, r);
                         }(t, e) : S();
                     }(e.q, t);
@@ -2807,7 +2807,7 @@ function Xe(t, r) {
                     }(e.orderBy);
                     o && (n.structuredQuery.orderBy = o);
                     var a = function(t, e) {
-                        return t.S || ct(e) ? e : {
+                        return t.F || ct(e) ? e : {
                             value: e
                         };
                     }(t, e.limit);
@@ -2822,7 +2822,7 @@ function Xe(t, r) {
                     return !!t.document;
                 })).map((function(t) {
                     return function(t, e, n) {
-                        var r = je(t, e.name), i = qe(e.updateTime), o = new zt({
+                        var r = je(t, e.name), i = Fe(e.updateTime), o = new zt({
                             mapValue: {
                                 fields: e.fields
                             }
@@ -3243,7 +3243,7 @@ var sn = /** @class */ function() {
 /**
  * A `Query` refers to a query which you can read or listen to. You can also
  * construct refined `Query` objects by adding filters and ordering.
- */ function ln(t, e) {
+ */ function fn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
     if (t = p(t), rt("collection", "path", e), t instanceof en) {
         var o = Z.fromString.apply(Z, r([ e ], n));
@@ -3267,7 +3267,7 @@ var sn = /** @class */ function() {
  * collection or subcollection with this ID as the last segment of its path
  * will be included. Cannot contain a slash.
  * @returns The created `Query`.
- */ function fn(t, e) {
+ */ function ln(t, e) {
     if (t = st(t, en), rt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new U(V, "Invalid collection ID '" + e + "' passed to function collectionGroup(). Collection IDs must not contain '/'.");
     return new un(t, 
     /* converter= */ null, 
@@ -3285,7 +3285,7 @@ function hn(t, e) {
     if (t = p(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = vt.P()), rt("doc", "path", e), t instanceof en) {
+    1 === arguments.length && (e = vt.R()), rt("doc", "path", e), t instanceof en) {
         var o = Z.fromString.apply(Z, r([ e ], n));
         return it(o), new sn(t, 
         /* converter= */ null, new nt(o));
@@ -3681,12 +3681,12 @@ function(t) {
     Un("Data must be an object, but it was:", a, r);
     var s, u, c = Rn(r, a);
     if (o.merge) s = new Et(a.fieldMask), u = a.fieldTransforms; else if (o.mergeFields) {
-        for (var l = [], f = 0, h = o.mergeFields; f < h.length; f++) {
-            var p = xn(e, h[f], n);
+        for (var f = [], l = 0, h = o.mergeFields; l < h.length; l++) {
+            var p = xn(e, h[l], n);
             if (!a.contains(p)) throw new U(V, "Field '" + p + "' is specified in your field mask but missing from your input data.");
-            Qn(l, p) || l.push(p);
+            Qn(f, p) || f.push(p);
         }
-        s = new Et(l), u = a.fieldTransforms.filter((function(t) {
+        s = new Et(f), u = a.fieldTransforms.filter((function(t) {
             return s.covers(t.field);
         }));
     } else s = null, u = a.fieldTransforms;
@@ -3731,7 +3731,7 @@ var Vn = /** @class */ function(e) {
     }, e.databaseId, e.q, e.ignoreUndefinedProperties);
 }
 
-var Pn = /** @class */ function(e) {
+var Nn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -3740,7 +3740,7 @@ var Pn = /** @class */ function(e) {
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(gn), Fn = /** @class */ function(e) {
+}(gn), Pn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).lt = n, r;
@@ -3755,7 +3755,7 @@ var Pn = /** @class */ function(e) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(gn), Nn = /** @class */ function(e) {
+}(gn), qn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).lt = n, r;
@@ -3770,7 +3770,7 @@ var Pn = /** @class */ function(e) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(gn), qn = /** @class */ function(e) {
+}(gn), Fn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).ft = n, r;
@@ -3811,7 +3811,7 @@ var Pn = /** @class */ function(e) {
     for (var c = 0; c < o.length; c += 2) s.push(xn(e, o[c])), u.push(o[c + 1]);
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
-    for (var l = [], f = zt.empty(), h = s.length - 1; h >= 0; --h) if (!Qn(l, s[h])) {
+    for (var f = [], l = zt.empty(), h = s.length - 1; h >= 0; --h) if (!Qn(f, s[h])) {
         var d = s[h], m = u[h];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
@@ -3819,13 +3819,13 @@ var Pn = /** @class */ function(e) {
         var y = a.it(d);
         if (m instanceof Vn) 
         // Add it to the field mask, but don't add anything to updateData.
-        l.push(d); else {
+        f.push(d); else {
             var v = Ln(m, y);
-            null != v && (l.push(d), f.set(d, v));
+            null != v && (f.push(d), l.set(d, v));
         }
     }
-    var g = new Et(l);
-    return new Tn(f, g, a.fieldTransforms);
+    var g = new Et(f);
+    return new Tn(l, g, a.fieldTransforms);
 }
 
 /**
@@ -3852,7 +3852,7 @@ var Pn = /** @class */ function(e) {
     // from firestore-exp.
     t = p(t))) return Un("Unsupported field value:", e, t), Rn(t, e);
     if (t instanceof gn) 
-    // FieldValues usually parse into transforms (except FieldValue.delete())
+    // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
     // (as doing so will overwrite the field directly prior to the transform
     // trying to transform it). So we don't add this location to
@@ -3915,7 +3915,7 @@ var Pn = /** @class */ function(e) {
         if (t instanceof Date) {
             var n = bt.fromDate(t);
             return {
-                timestampValue: Pe(e.q, n)
+                timestampValue: Ne(e.q, n)
             };
         }
         if (t instanceof bt) {
@@ -3924,7 +3924,7 @@ var Pn = /** @class */ function(e) {
             // truncation immediately without waiting for the backend to do that.
             var r = new bt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Pe(e.q, r)
+                timestampValue: Ne(e.q, r)
             };
         }
         if (t instanceof wn) return {
@@ -3934,7 +3934,7 @@ var Pn = /** @class */ function(e) {
             }
         };
         if (t instanceof vn) return {
-            bytesValue: Fe(e.q, t._byteString)
+            bytesValue: Pe(e.q, t._byteString)
         };
         if (t instanceof sn) {
             var i = e.databaseId, o = t.firestore._databaseId;
@@ -3986,7 +3986,7 @@ function Un(t, e, n) {
     // FieldPath.
     (e = p(e)) instanceof mn) return e._internalPath;
     if ("string" == typeof e) return Gn(t, e);
-    throw zn("Field path arguments must be of type string or FieldPath.", t, 
+    throw zn("Field path arguments must be of type string or ", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
 }
@@ -4254,12 +4254,12 @@ var Zn = /** @class */ function(e) {
         var e = An(t.firestore), n = function(t, e, n, r, i, o, a) {
             var s;
             if (i.isKeyField()) {
-                if ("array-contains" /* ARRAY_CONTAINS */ === o || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === o) throw new U(V, "Invalid Query. You can't perform '" + o + "' queries on FieldPath.documentId().");
+                if ("array-contains" /* ARRAY_CONTAINS */ === o || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === o) throw new U(V, "Invalid Query. You can't perform '" + o + "' queries on documentId().");
                 if ("in" /* IN */ === o || "not-in" /* NOT_IN */ === o) {
                     dr(a, o);
-                    for (var u = [], c = 0, l = a; c < l.length; c++) {
-                        var f = l[c];
-                        u.push(pr(r, t, f));
+                    for (var u = [], c = 0, f = a; c < f.length; c++) {
+                        var l = f[c];
+                        u.push(pr(r, t, l));
                     }
                     s = {
                         arrayValue: {
@@ -4273,7 +4273,7 @@ var Zn = /** @class */ function(e) {
             var h = Wt.create(i, o, s);
             return function(t, e) {
                 if (e.N()) {
-                    var n = le(t);
+                    var n = fe(t);
                     if (null !== n && !n.isEqual(e.field)) throw new U(V, "Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '" + n.toString() + "' and '" + e.field.toString() + "'");
                     var r = ce(t);
                     null !== r && mr(t, e.field, r);
@@ -4358,7 +4358,7 @@ var er = /** @class */ function(e) {
             return function(t, e) {
                 if (null === ce(t)) {
                     // This is the first order by. It must match any inequality.
-                    var n = le(t);
+                    var n = fe(t);
                     null !== n && mr(t, n, e.field);
                 }
             }(t, r), r;
@@ -4456,19 +4456,19 @@ var cr = /** @class */ function(e) {
     }, n;
 }(Xn);
 
-function lr() {
+function fr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     return new cr("endBefore", t, /*before=*/ !0);
 }
 
-function fr() {
+function lr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     return new cr("endAt", t, /*before=*/ !1);
 }
 
 /** Helper function to create a bound from a document or fields */ function hr(t, e, n, r) {
     if (n[0] = p(n[0]), n[0] instanceof Kn) return function(t, e, n, r, i) {
-        if (!r) throw new U(P, "Can't use a DocumentSnapshot that doesn't exist for " + n + "().");
+        if (!r) throw new U(N, "Can't use a DocumentSnapshot that doesn't exist for " + n + "().");
         // Because people expect to continue/end a query at the exact document
         // provided, we need to use the implicit sort order rather than the explicit
         // sort order, because it's guaranteed to contain the document key. That way
@@ -4480,10 +4480,10 @@ function fr() {
             var u = s[a];
             if (u.field.isKeyField()) o.push(Rt(e, r.key)); else {
                 var c = r.data.field(u.field);
-                if (Pt(c)) throw new U(V, 'Invalid query. You are trying to start or end a query using a document for which the field "' + u.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+                if (Nt(c)) throw new U(V, 'Invalid query. You are trying to start or end a query using a document for which the field "' + u.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) {
-                    var l = u.field.canonicalString();
-                    throw new U(V, "Invalid query. You are trying to start or end a query using a document for which the field '" + l + "' (used as the orderBy) does not exist.");
+                    var f = u.field.canonicalString();
+                    throw new U(V, "Invalid query. You are trying to start or end a query using a document for which the field '" + f + "' (used as the orderBy) does not exist.");
                 }
                 o.push(c);
             }
@@ -4499,11 +4499,11 @@ function fr() {
             var c = i[u];
             if (a[u].field.isKeyField()) {
                 if ("string" != typeof c) throw new U(V, "Invalid query. Expected a string for document ID in " + r + "(), but got a " + typeof c);
-                if (!fe(t) && -1 !== c.indexOf("/")) throw new U(V, "Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to " + r + "() must be a plain document ID, but '" + c + "' contains a slash.");
-                var l = t.path.child(Z.fromString(c));
-                if (!nt.isDocumentKey(l)) throw new U(V, "Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to " + r + "() must result in a valid document path, but '" + l + "' is not because it contains an odd number of segments.");
-                var f = new nt(l);
-                s.push(Rt(e, f));
+                if (!le(t) && -1 !== c.indexOf("/")) throw new U(V, "Invalid query. When querying a collection and ordering by documentId(), the value passed to " + r + "() must be a plain document ID, but '" + c + "' contains a slash.");
+                var f = t.path.child(Z.fromString(c));
+                if (!nt.isDocumentKey(f)) throw new U(V, "Invalid query. When querying a collection group and ordering by documentId(), the value passed to " + r + "() must result in a valid document path, but '" + f + "' is not because it contains an odd number of segments.");
+                var l = new nt(f);
+                s.push(Rt(e, l));
             } else {
                 var h = jn(n, r, c);
                 s.push(h);
@@ -4515,14 +4515,14 @@ function fr() {
 
 function pr(t, e, n) {
     if ("string" == typeof (n = p(n))) {
-        if ("" === n) throw new U(V, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!fe(e) && -1 !== n.indexOf("/")) throw new U(V, "Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '" + n + "' contains a '/' character.");
+        if ("" === n) throw new U(V, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!le(e) && -1 !== n.indexOf("/")) throw new U(V, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '" + n + "' contains a '/' character.");
         var r = e.path.child(Z.fromString(n));
-        if (!nt.isDocumentKey(r)) throw new U(V, "Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '" + r + "' is not because it has an odd number of segments (" + r.length + ").");
+        if (!nt.isDocumentKey(r)) throw new U(V, "Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '" + r + "' is not because it has an odd number of segments (" + r.length + ").");
         return Rt(t, new nt(r));
     }
     if (n instanceof sn) return Rt(t, n._key);
-    throw new U(V, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: " + at(n) + ".");
+    throw new U(V, "Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: " + at(n) + ".");
 }
 
 /**
@@ -4604,7 +4604,7 @@ var vr = /** @class */ function(e) {
 }(/** @class */ function() {
     function t() {}
     return t.prototype.convertValue = function(t, e) {
-        switch (void 0 === e && (e = "none"), qt(t)) {
+        switch (void 0 === e && (e = "none"), Ft(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -4656,11 +4656,11 @@ var vr = /** @class */ function(e) {
     }, t.prototype.convertServerTimestamp = function(t, e) {
         switch (e) {
           case "previous":
-            var n = Ft(t);
+            var n = Pt(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Nt(t));
+            return this.convertTimestamp(qt(t));
 
           default:
             return null;
@@ -4805,7 +4805,7 @@ function _r(t, e, n) {
  * Returns a sentinel used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link @firebase/firestore/lite#(updateDoc:1)} to
  * include a server-generated timestamp in the written data.
  */ function Ir() {
-    return new Pn("serverTimestamp");
+    return new Nn("serverTimestamp");
 }
 
 /**
@@ -4823,7 +4823,7 @@ function _r(t, e, n) {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-        return new Fn("arrayUnion", t);
+        return new Pn("arrayUnion", t);
 }
 
 /**
@@ -4840,7 +4840,7 @@ function _r(t, e, n) {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-        return new Nn("arrayRemove", t);
+        return new qn("arrayRemove", t);
 }
 
 /**
@@ -4862,7 +4862,7 @@ function _r(t, e, n) {
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
  */ function Vr(t) {
-    return new qn("increment", t);
+    return new Fn("increment", t);
 }
 
 /**
@@ -4896,12 +4896,12 @@ function _r(t, e, n) {
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = Pr(t, this._firestore), i = yr(r.converter, e, n), o = kn(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
+        var r = Nr(t, this._firestore), i = yr(r.converter, e, n), o = kn(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
         return this._mutations.push(o.toMutation(r._key, _e.none())), this;
     }, t.prototype.update = function(t, e, n) {
         for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
         this._verifyNotCommitted();
-        var o, a = Pr(t, this._firestore);
+        var o, a = Nr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 return o = "string" == typeof (e = p(e)) || e instanceof mn ? Cn(this._dataReader, "WriteBatch.update", a._key, e, n, r) : On(this._dataReader, "WriteBatch.update", a._key, e), 
@@ -4915,7 +4915,7 @@ function _r(t, e, n) {
      */
     t.prototype.delete = function(t) {
         this._verifyNotCommitted();
-        var e = Pr(t, this._firestore);
+        var e = Nr(t, this._firestore);
         return this._mutations = this._mutations.concat(new Ie(e._key, _e.none())), this;
     }, 
     /**
@@ -4937,7 +4937,7 @@ function _r(t, e, n) {
     }, t;
 }();
 
-function Pr(t, e) {
+function Nr(t, e) {
     if ((t = p(t)).firestore !== e) throw new U(V, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -4954,7 +4954,7 @@ function Pr(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Fr(t) {
+ */ function Pr(t) {
     var e = Ze(t = st(t, en));
     return new Dr(t, (function(t) {
         return Ye(e, t);
@@ -4980,7 +4980,7 @@ function Pr(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ var Nr = /** @class */ function() {
+ */ var qr = /** @class */ function() {
     function t(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5100,7 +5100,7 @@ function Pr(t, e) {
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), qr = /** @class */ function() {
+}(), Fr = /** @class */ function() {
     function t(t, e, n, r) {
         this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = r, 
         this.Tt = 5, this.It = new He(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
@@ -5114,21 +5114,21 @@ function Pr(t, e) {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new Nr(this.datastore), (e = this.Pt(t)) && e.then((function(e) {
+                    return t = new qr(this.datastore), (e = this.Rt(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
                             })).catch((function(t) {
-                                r.Rt(t);
+                                r.Pt(t);
                             }));
                         }));
                     })).catch((function(t) {
-                        r.Rt(t);
+                        r.Pt(t);
                     })), [ 2 /*return*/ ];
                 }));
             }));
         }));
-    }, t.prototype.Pt = function(t) {
+    }, t.prototype.Rt = function(t) {
         try {
             var e = this.updateFunction(t);
             return !ct(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
@@ -5137,7 +5137,7 @@ function Pr(t, e) {
             // Do not retry errors thrown by user provided updateFunction.
             return this.deferred.reject(t), null;
         }
-    }, t.prototype.Rt = function(t) {
+    }, t.prototype.Pt = function(t) {
         var e = this;
         this.Tt > 0 && this.Vt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((function() {
             return e.At(), Promise.resolve();
@@ -5162,18 +5162,18 @@ function Pr(t, e) {
                   case A:
                   case k:
                   case D:
-                  case q:
+                  case F:
                   case R:
                   case M:
  // Unauthenticated means something went wrong with our token and we need
                     // to retry with new credentials which will happen automatically.
-                                      case N:
+                                      case q:
                     return !1;
 
                   case V:
-                  case P:
+                  case N:
                   case "already-exists":
-                  case F:
+                  case P:
                   case O:
  // Aborted might be retried in some scenarios, but that is dependant on
                     // the context and should handled individually by the calling code.
@@ -5335,9 +5335,9 @@ function Pr(t, e) {
         this.$t = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.Ft = [], 
+        this.St = [], 
         // visible for testing
-        this.St = null, 
+        this.Ft = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
         this.xt = !1, 
@@ -5450,7 +5450,7 @@ function Pr(t, e) {
     }, t.prototype.Ut = function(t) {
         var e = this, n = this.Dt.then((function() {
             return e.xt = !0, t().catch((function(t) {
-                e.St = t, e.xt = !1;
+                e.Ft = t, e.xt = !1;
                 var n = 
                 /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -5479,9 +5479,9 @@ function Pr(t, e) {
         var i = Cr.createAndSchedule(this, t, e, n, (function(t) {
             return r.jt(t);
         }));
-        return this.Ft.push(i), i;
+        return this.St.push(i), i;
     }, t.prototype.Lt = function() {
-        this.St && S();
+        this.Ft && S();
     }, t.prototype.verifyOperationInProgress = function() {}, 
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
@@ -5513,7 +5513,7 @@ function Pr(t, e) {
      * exists.
      */
     t.prototype.Bt = function(t) {
-        for (var e = 0, n = this.Ft; e < n.length; e++) {
+        for (var e = 0, n = this.St; e < n.length; e++) {
             if (n[e].timerId === t) return !0;
         }
         return !1;
@@ -5530,10 +5530,10 @@ function Pr(t, e) {
         // Note that draining may generate more delayed ops, so we do that first.
                 return this.Mt().then((function() {
             // Run ops in the same order they'd run if they ran naturally.
-            e.Ft.sort((function(t, e) {
+            e.St.sort((function(t, e) {
                 return t.targetTimeMs - e.targetTimeMs;
             }));
-            for (var n = 0, r = e.Ft; n < r.length; n++) {
+            for (var n = 0, r = e.St; n < r.length; n++) {
                 var i = r[n];
                 if (i.skipDelay(), "all" /* All */ !== t && i.timerId === t) break;
             }
@@ -5548,8 +5548,8 @@ function Pr(t, e) {
     }, 
     /** Called once a DelayedOperation is run or canceled. */ t.prototype.jt = function(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        var e = this.Ft.indexOf(t);
-        this.Ft.splice(e, 1);
+        var e = this.St.indexOf(t);
+        this.St.splice(e, 1);
     }, t;
 }(), Lr = /** @class */ function() {
     /** @hideconstructor */
@@ -5563,7 +5563,7 @@ function Pr(t, e) {
      */;
     }
     return t.prototype.get = function(t) {
-        var e = this, n = Pr(t, this._firestore), r = new vr(this._firestore);
+        var e = this, n = Nr(t, this._firestore), r = new vr(this._firestore);
         return this._transaction.lookup([ n._key ]).then((function(t) {
             if (!t || 1 !== t.length) return S();
             var i = t[0];
@@ -5572,11 +5572,11 @@ function Pr(t, e) {
             throw S();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = Pr(t, this._firestore), i = yr(r.converter, e, n), o = kn(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
+        var r = Nr(t, this._firestore), i = yr(r.converter, e, n), o = kn(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
         return this._transaction.set(r._key, o), this;
     }, t.prototype.update = function(t, e, n) {
         for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-        var o, a = Pr(t, this._firestore);
+        var o, a = Nr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 return o = "string" == typeof (e = p(e)) || e instanceof mn ? Cn(this._dataReader, "Transaction.update", a._key, e, n, r) : On(this._dataReader, "Transaction.update", a._key, e), 
@@ -5589,7 +5589,7 @@ function Pr(t, e) {
      * @returns This `Transaction` instance. Used for chaining method calls.
      */
     t.prototype.delete = function(t) {
-        var e = Pr(t, this._firestore);
+        var e = Nr(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }, t;
 }();
@@ -5629,7 +5629,7 @@ function Pr(t, e) {
  */
 function Rr(t, e) {
     var n = Ze(t = st(t, en)), r = new x;
-    return new qr(new jr, n, (function(n) {
+    return new Fr(new jr, n, (function(n) {
         return e(new Lr(t, n));
     }), r).run(), r.promise
     /**
@@ -5647,7 +5647,7 @@ y = i + "_lite", o(new c("firestore/lite", (function(t, e) {
     return n && i._setSettings(n), i;
 }), "PUBLIC")), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-a("firestore-lite", "3.4.2-canary.c271d16a9", ""), a("firestore-lite", "3.4.2-canary.c271d16a9", "esm5");
+a("firestore-lite", "3.4.2-canary.ff2f7d4c8", ""), a("firestore-lite", "3.4.2-canary.ff2f7d4c8", "esm5");
 
-export { vn as Bytes, cn as CollectionReference, sn as DocumentReference, Kn as DocumentSnapshot, mn as FieldPath, gn as FieldValue, en as Firestore, U as FirestoreError, wn as GeoPoint, un as Query, Xn as QueryConstraint, Hn as QueryDocumentSnapshot, Wn as QuerySnapshot, bt as Timestamp, Lr as Transaction, Dr as WriteBatch, Sr as addDoc, kr as arrayRemove, Ar as arrayUnion, ln as collection, fn as collectionGroup, on as connectFirestoreEmulator, Tr as deleteDoc, Er as deleteField, hn as doc, yn as documentId, fr as endAt, lr as endBefore, gr as getDoc, wr as getDocs, rn as getFirestore, Vr as increment, nn as initializeFirestore, ir as limit, or as limitToLast, nr as orderBy, Jn as query, dn as queryEqual, pn as refEqual, Rr as runTransaction, Ir as serverTimestamp, br as setDoc, g as setLogLevel, Yn as snapshotEqual, ur as startAfter, sr as startAt, an as terminate, _r as updateDoc, tr as where, Fr as writeBatch };
+export { vn as Bytes, cn as CollectionReference, sn as DocumentReference, Kn as DocumentSnapshot, mn as FieldPath, gn as FieldValue, en as Firestore, U as FirestoreError, wn as GeoPoint, un as Query, Xn as QueryConstraint, Hn as QueryDocumentSnapshot, Wn as QuerySnapshot, bt as Timestamp, Lr as Transaction, Dr as WriteBatch, Sr as addDoc, kr as arrayRemove, Ar as arrayUnion, fn as collection, ln as collectionGroup, on as connectFirestoreEmulator, Tr as deleteDoc, Er as deleteField, hn as doc, yn as documentId, lr as endAt, fr as endBefore, gr as getDoc, wr as getDocs, rn as getFirestore, Vr as increment, nn as initializeFirestore, ir as limit, or as limitToLast, nr as orderBy, Jn as query, dn as queryEqual, pn as refEqual, Rr as runTransaction, Ir as serverTimestamp, br as setDoc, g as setLogLevel, Yn as snapshotEqual, ur as startAfter, sr as startAt, an as terminate, _r as updateDoc, tr as where, Pr as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map