@firebase/firestore 3.4.8 → 3.4.9

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

@@ -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.11", v = new l("@firebase/firestore");
+var y = "9.8.0", v = new l("@firebase/firestore");
 
 /**
  * @license
@@ -204,7 +204,7 @@ function E(t, e) {
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function I(t, 
+ */ function A(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     return t;
@@ -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", N = "permission-denied", q = "unauthenticated", F = "resource-exhausted", O = "failed-precondition", C = "aborted", L = "out-of-range", j = "unimplemented", R = "internal", M = "unavailable", x = /** @class */ function(e) {
+ */ var I = "cancelled", k = "unknown", V = "invalid-argument", D = "deadline-exceeded", P = "not-found", N = "permission-denied", q = "unauthenticated", F = "resource-exhausted", O = "failed-precondition", C = "aborted", j = "out-of-range", L = "unimplemented", R = "internal", x = "unavailable", M = /** @class */ function(e) {
     /** @hideconstructor */
     function n(
     /**
@@ -446,7 +446,7 @@ function(t, e, n, r, i, o, a, s) {
         // for legacy reasons and should not be used frequently).
                 for (var r = [], i = 0, o = t; i < o.length; i++) {
             var a = o[i];
-            if (a.indexOf("//") >= 0) throw new x(V, "Invalid segment (" + a + "). Paths must not contain // in them.");
+            if (a.indexOf("//") >= 0) throw new M(V, "Invalid segment (" + a + "). Paths must not contain // in them.");
             // Strip leading and traling slashed.
                         r.push.apply(r, a.split("/").filter((function(t) {
                 return t.length > 0;
@@ -501,18 +501,18 @@ function(t, e, n, r, i, o, a, s) {
      */
     n.fromServerFormat = function(t) {
         for (var e = [], r = "", i = 0, o = function() {
-            if (0 === r.length) throw new x(V, "Invalid field path (" + t + "). Paths must not be empty, begin with '.', end with '.', or contain '..'");
+            if (0 === r.length) throw new M(V, "Invalid field path (" + t + "). Paths must not be empty, begin with '.', end with '.', or contain '..'");
             e.push(r), r = "";
         }, a = !1; i < t.length; ) {
             var s = t[i];
             if ("\\" === s) {
-                if (i + 1 === t.length) throw new x(V, "Path has trailing escape character: " + t);
+                if (i + 1 === t.length) throw new M(V, "Path has trailing escape character: " + t);
                 var u = t[i + 1];
-                if ("\\" !== u && "." !== u && "`" !== u) throw new x(V, "Path has invalid escape sequence: " + t);
+                if ("\\" !== u && "." !== u && "`" !== u) throw new M(V, "Path has invalid escape sequence: " + t);
                 r += u, i += 2;
             } else "`" === s ? (a = !a, i++) : "." !== s || a ? (r += s, i++) : (o(), i++);
         }
-        if (o(), a) throw new x(V, "Unterminated ` in path: " + t);
+        if (o(), a) throw new M(V, "Unterminated ` in path: " + t);
         return new n(e);
     }, n.emptyPath = function() {
         return new n([]);
@@ -580,7 +580,7 @@ function(t, e, n, r, i, o, a, s) {
  * limitations under the License.
  */
 function rt(t, e, n) {
-    if (!n) throw new x(V, "Function " + t + "() cannot be called with an empty " + e + ".");
+    if (!n) throw new M(V, "Function " + t + "() cannot be called with an empty " + e + ".");
 }
 
 /**
@@ -591,14 +591,14 @@ function rt(t, e, n) {
  * Validates that `path` refers to a document (indicated by the fact it contains
  * an even numbers of segments).
  */ function it(t) {
-    if (!nt.isDocumentKey(t)) throw new x(V, "Invalid document reference. Document references must have an even number of segments, but " + t + " has " + t.length + ".");
+    if (!nt.isDocumentKey(t)) throw new M(V, "Invalid document reference. Document references must have an even number of segments, but " + t + " has " + t.length + ".");
 }
 
 /**
  * Validates that `path` refers to a collection (indicated by the fact it
  * contains an odd numbers of segments).
  */ function ot(t) {
-    if (nt.isDocumentKey(t)) throw new x(V, "Invalid collection reference. Collection references must have an odd number of segments, but " + t + " has " + t.length + ".");
+    if (nt.isDocumentKey(t)) throw new M(V, "Invalid collection reference. Collection references must have an odd number of segments, but " + t + " has " + t.length + ".");
 }
 
 /**
@@ -630,15 +630,15 @@ e) {
     // Unwrap Compat types
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     t = t._delegate), !(t instanceof e)) {
-        if (e.name === t.constructor.name) throw new x(V, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
+        if (e.name === t.constructor.name) throw new M(V, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         var n = at(t);
-        throw new x(V, "Expected type '" + e.name + "', but it was: " + n);
+        throw new M(V, "Expected type '" + e.name + "', but it was: " + n);
     }
     return t;
 }
 
 function ut(t, e) {
-    if (e <= 0) throw new x(V, "Function " + t + "() requires a positive number, but it was: " + e + ".");
+    if (e <= 0) throw new M(V, "Function " + t + "() requires a positive number, but it was: " + e + ".");
 }
 
 /**
@@ -771,7 +771,7 @@ function dt(t) {
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return L;
+        return j;
 
       case 429:
         // Too Many Requests
@@ -779,7 +779,7 @@ function dt(t) {
 
       case 499:
         // Client Closed Request
-        return A;
+        return I;
 
       case 500:
         // Internal Server Error
@@ -790,11 +790,11 @@ function dt(t) {
         // return Code.DATA_LOSS;
               case 501:
         // Unimplemented
-        return j;
+        return L;
 
       case 503:
         // Service Unavailable
-        return M;
+        return x;
 
       case 504:
         // Gateway Timeout
@@ -840,13 +840,13 @@ var mt = /** @class */ function(r) {
      */
     function i(t, e) {
         var n = this;
-        return (n = r.call(this, t) || this).I = e, n;
+        return (n = r.call(this, t) || this).A = e, n;
     }
     /**
      * Base class for all Rest-based connections to the backend (WebChannel and
      * HTTP).
      */
-    return t(i, r), i.prototype.A = function(t, e) {
+    return t(i, r), i.prototype.I = function(t, e) {
         throw new Error("Not supported by FetchConnection");
     }, i.prototype.v = function(t, r, i, o) {
         return e(this, void 0, void 0, (function() {
@@ -857,7 +857,7 @@ var mt = /** @class */ function(r) {
                     t = JSON.stringify(o), n.label = 1;
 
                   case 1:
-                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.I(r, {
+                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.A(r, {
                         method: "POST",
                         headers: i,
                         body: t
@@ -867,10 +867,10 @@ var mt = /** @class */ function(r) {
                     return e = n.sent(), [ 3 /*break*/ , 4 ];
 
                   case 3:
-                    throw a = n.sent(), new x(dt(a.status), "Request failed with error: " + a.statusText);
+                    throw a = n.sent(), new M(dt(a.status), "Request failed with error: " + a.statusText);
 
                   case 4:
-                    if (!e.ok) throw new x(dt(e.status), "Request failed with error: " + e.statusText);
+                    if (!e.ok) throw new M(dt(e.status), "Request failed with error: " + e.statusText);
                     return [ 2 /*return*/ , e.json() ];
                 }
             }));
@@ -1058,11 +1058,11 @@ function gt(t, e) {
      * The fractions of a second at nanosecond resolution.*
      */
     e) {
-        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new x(V, "Timestamp nanoseconds out of range: " + e);
-        if (e >= 1e9) throw new x(V, "Timestamp nanoseconds out of range: " + e);
-        if (t < -62135596800) throw new x(V, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new M(V, "Timestamp nanoseconds out of range: " + e);
+        if (e >= 1e9) throw new M(V, "Timestamp nanoseconds out of range: " + e);
+        if (t < -62135596800) throw new M(V, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new x(V, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new M(V, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
@@ -1270,7 +1270,7 @@ function St(t, e) {
             return t.isEqual(e);
         }));
     }, t;
-}(), It = /** @class */ function() {
+}(), At = /** @class */ function() {
     function t(t) {
         this.binaryString = t;
     }
@@ -1359,9 +1359,9 @@ function St(t, e) {
  * the proto byte string in a common class that must be converted into a string
  * before being sent as a proto.
  * @internal
- */ It.EMPTY_BYTE_STRING = new It("");
+ */ At.EMPTY_BYTE_STRING = new At("");
 
-var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+var It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
 /**
  * Converts the possible Proto values for a timestamp value into a "seconds and
@@ -1374,7 +1374,7 @@ var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         // The date string can have higher precision (nanos) than the Date class
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
-        var e = 0, n = At.exec(t);
+        var e = 0, n = It.exec(t);
         if (E(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             var r = n[1];
@@ -1402,7 +1402,7 @@ var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 }
 
 /** Converts the possible Proto types for Blobs into a ByteString. */ function Dt(t) {
-    return "string" == typeof t ? It.fromBase64String(t) : It.fromUint8Array(t);
+    return "string" == typeof t ? At.fromBase64String(t) : At.fromUint8Array(t);
 }
 
 /**
@@ -1475,19 +1475,26 @@ var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * 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.
- */
-/** Extracts the backend's type order for the provided value. */ function Ft(t) {
+ */ var Ft = {
+    fields: {
+        __type__: {
+            stringValue: "__max__"
+        }
+    }
+};
+
+/** Extracts the backend's type order for the provided value. */ function Ot(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 */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
         return "__max__" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;
-    }(t) ? 9 /* ArrayValue */ : 10 /* ObjectValue */ : S();
+    }(t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : S();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Ot(t, e) {
+/** Tests `left` and `right` for equality based on the backend semantics. */ function Ct(t, e) {
     if (t === e) return !0;
-    var n = Ft(t);
-    if (n !== Ft(e)) return !1;
+    var n = Ot(t);
+    if (n !== Ot(e)) return !1;
     switch (n) {
       case 0 /* NullValue */ :
       case 9007199254740991 /* MaxValue */ :
@@ -1535,13 +1542,13 @@ var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         }(t, e);
 
       case 9 /* ArrayValue */ :
-        return wt(t.arrayValue.values || [], e.arrayValue.values || [], Ot);
+        return wt(t.arrayValue.values || [], e.arrayValue.values || [], Ct);
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
             var n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
             if (Tt(n) !== Tt(r)) return !1;
-            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !Ot(n[i], r[i]))) return !1;
+            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !Ct(n[i], r[i]))) return !1;
             return !0;
         }(t, e);
 
@@ -1550,15 +1557,15 @@ var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     }
 }
 
-function Ct(t, e) {
+function jt(t, e) {
     return void 0 !== (t.values || []).find((function(t) {
-        return Ot(t, e);
+        return Ct(t, e);
     }));
 }
 
 function Lt(t, e) {
     if (t === e) return 0;
-    var n = Ft(t), r = Ft(e);
+    var n = Ot(t), r = Ot(e);
     if (n !== r) return gt(n, r);
     switch (n) {
       case 0 /* NullValue */ :
@@ -1577,10 +1584,10 @@ function Lt(t, e) {
         }(t, e);
 
       case 3 /* TimestampValue */ :
-        return jt(t.timestampValue, e.timestampValue);
+        return Rt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return jt(qt(t), qt(e));
+        return Rt(qt(t), qt(e));
 
       case 5 /* StringValue */ :
         return gt(t.stringValue, e.stringValue);
@@ -1617,6 +1624,9 @@ function Lt(t, e) {
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
+            if (t === Ft && e === Ft) return 0;
+            if (t === Ft) return 1;
+            if (e === Ft) return -1;
             var n = t.fields || {}, r = Object.keys(n), i = e.fields || {}, o = Object.keys(i);
             // Even though MapValues are likely sorted correctly based on their insertion
             // order (e.g. when received from the backend), local modifications can bring
@@ -1637,13 +1647,13 @@ function Lt(t, e) {
     }
 }
 
-function jt(t, e) {
+function Rt(t, e) {
     if ("string" == typeof t && "string" == typeof e && t.length === e.length) return gt(t, e);
     var n = kt(t), r = kt(e), i = gt(n.seconds, r.seconds);
     return 0 !== i ? i : gt(n.nanos, r.nanos);
 }
 
-function Rt(t, e) {
+function xt(t, e) {
     return {
         referenceValue: "projects/" + t.projectId + "/databases/" + t.database + "/documents/" + e.path.canonicalString()
     };
@@ -1653,19 +1663,19 @@ function Rt(t, e) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function xt(t) {
+/** Returns true if `value` is a NullValue. */ function Ut(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function Ut(t) {
+/** Returns true if `value` is NaN. */ function Bt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function Bt(t) {
+/** Returns true if `value` is a MapValue. */ function Gt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Gt(t) {
+/** Creates a deep copy of `source`. */ function zt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1679,7 +1689,7 @@ function Rt(t, e) {
             }
         };
         return St(t.mapValue.fields, (function(t, n) {
-            return e.mapValue.fields[t] = Gt(n);
+            return e.mapValue.fields[t] = zt(n);
         })), e;
     }
     if (t.arrayValue) {
@@ -1687,13 +1697,13 @@ function Rt(t, e) {
             arrayValue: {
                 values: []
             }
-        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = Gt(t.arrayValue.values[r]);
+        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = zt(t.arrayValue.values[r]);
         return n;
     }
     return Object.assign({}, t);
 }
 
-var zt = /** @class */ function() {
+var Qt = /** @class */ function() {
     function t(t) {
         this.value = t;
     }
@@ -1710,7 +1720,7 @@ var zt = /** @class */ function() {
      */
     t.prototype.field = function(t) {
         if (t.isEmpty()) return this.value;
-        for (var e = this.value, n = 0; n < t.length - 1; ++n) if (!Bt(e = (e.mapValue.fields || {})[t.get(n)])) return null;
+        for (var e = this.value, n = 0; n < t.length - 1; ++n) if (!Gt(e = (e.mapValue.fields || {})[t.get(n)])) return null;
         return (e = (e.mapValue.fields || {})[t.lastSegment()]) || null;
     }, 
     /**
@@ -1720,7 +1730,7 @@ var zt = /** @class */ function() {
      * @param value - The value to set.
      */
     t.prototype.set = function(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Gt(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = zt(e);
     }, 
     /**
      * Sets the provided fields to the provided values.
@@ -1735,7 +1745,7 @@ var zt = /** @class */ function() {
                 var a = e.getFieldsMap(n);
                 e.applyChanges(a, r, i), r = {}, i = [], n = o.popLast();
             }
-            t ? r[o.lastSegment()] = Gt(t) : i.push(o.lastSegment());
+            t ? r[o.lastSegment()] = zt(t) : i.push(o.lastSegment());
         }));
         var o = this.getFieldsMap(n);
         this.applyChanges(o, r, i);
@@ -1748,9 +1758,9 @@ var zt = /** @class */ function() {
      */
     t.prototype.delete = function(t) {
         var e = this.field(t.popLast());
-        Bt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        Gt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }, t.prototype.isEqual = function(t) {
-        return Ot(this.value, t.value);
+        return Ct(this.value, t.value);
     }, 
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -1763,7 +1773,7 @@ var zt = /** @class */ function() {
         });
         for (var n = 0; n < t.length; ++n) {
             var r = e.mapValue.fields[t.get(n)];
-            Bt(r) && r.mapValue.fields || (r = {
+            Gt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -1784,9 +1794,9 @@ var zt = /** @class */ function() {
             delete t[o];
         }
     }, t.prototype.clone = function() {
-        return new t(Gt(this.value));
+        return new t(zt(this.value));
     }, t;
-}(), Qt = /** @class */ function() {
+}(), Kt = /** @class */ function() {
     function t(t, e, n, r, i, o) {
         this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.data = i, 
         this.documentState = o
@@ -1796,7 +1806,7 @@ var zt = /** @class */ function() {
      */;
     }
     return t.newInvalidDocument = function(e) {
-        return new t(e, 0 /* INVALID */ , _t.min(), _t.min(), zt.empty(), 0 /* SYNCED */);
+        return new t(e, 0 /* INVALID */ , _t.min(), _t.min(), Qt.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist with the given data at the
@@ -1806,7 +1816,7 @@ var zt = /** @class */ function() {
         return new t(e, 1 /* FOUND_DOCUMENT */ , n, _t.min(), r, 0 /* SYNCED */);
     }, 
     /** Creates a new document that is known to not exist at the given version. */ t.newNoDocument = function(e, n) {
-        return new t(e, 2 /* NO_DOCUMENT */ , n, _t.min(), zt.empty(), 0 /* SYNCED */);
+        return new t(e, 2 /* NO_DOCUMENT */ , n, _t.min(), Qt.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist at the given version but
@@ -1814,7 +1824,7 @@ var zt = /** @class */ function() {
      * base document).
      */
     t.newUnknownDocument = function(e, n) {
-        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, _t.min(), zt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, _t.min(), Qt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }, 
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -1829,7 +1839,7 @@ var zt = /** @class */ function() {
      * version.
      */
     t.prototype.convertToNoDocument = function(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = zt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Qt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }, 
     /**
@@ -1838,7 +1848,7 @@ var zt = /** @class */ function() {
      * base document).
      */
     t.prototype.convertToUnknownDocument = function(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = zt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Qt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }, t.prototype.setHasCommittedMutations = function() {
         return this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
@@ -1879,7 +1889,7 @@ var zt = /** @class */ function() {
     }, t.prototype.toString = function() {
         return "Document(" + this.key + ", " + this.version + ", " + JSON.stringify(this.data.value) + ", {documentType: " + this.documentType + "}), {documentState: " + this.documentState + "})";
     }, t;
-}(), Kt = function(t, e, n, r, i, o, a) {
+}(), Ht = function(t, e, n, r, i, o, a) {
     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, 
@@ -1920,13 +1930,13 @@ var zt = /** @class */ function() {
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
  */
-function Ht(t, e, n, r, i, o, a) {
+function Wt(t, e, n, r, i, o, a) {
     return 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), 
-    new Kt(t, e, n, r, i, o, a);
+    new Ht(t, e, n, r, i, o, a);
 }
 
-var Wt = /** @class */ function(e) {
+var Yt = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this) || this).field = t, i.op = n, i.value = r, i;
@@ -1934,13 +1944,13 @@ var Wt = /** @class */ function(e) {
     /**
      * Creates a filter based on the provided arguments.
      */    return t(n, e), n.create = function(t, e, r) {
-        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, r) : new Yt(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Zt(t, r) : "in" /* IN */ === e ? new te(t, r) : "not-in" /* NOT_IN */ === e ? new ee(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ne(t, r) : new n(t, e, r);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, r) : new $t(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new te(t, r) : "in" /* IN */ === e ? new ee(t, r) : "not-in" /* NOT_IN */ === e ? new ne(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new re(t, r) : new n(t, e, r);
     }, n.V = function(t, e, n) {
-        return "in" /* IN */ === e ? new $t(t, n) : new Xt(t, n);
+        return "in" /* IN */ === e ? new Xt(t, n) : new Jt(t, n);
     }, 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(Lt(e, this.value)) : null !== e && Ft(this.value) === Ft(e) && this.D(Lt(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.D(Lt(e, this.value)) : null !== e && Ot(this.value) === Ot(e) && this.D(Lt(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }, n.prototype.D = function(t) {
         switch (this.op) {
@@ -1968,7 +1978,7 @@ var Wt = /** @class */ function(e) {
     }, n.prototype.N = function() {
         return [ "<" /* LESS_THAN */ , "<=" /* LESS_THAN_OR_EQUAL */ , ">" /* GREATER_THAN */ , ">=" /* GREATER_THAN_OR_EQUAL */ , "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ].indexOf(this.op) >= 0;
     }, n;
-}((function() {})), Yt = /** @class */ function(e) {
+}((function() {})), $t = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this, t, n, r) || this).key = nt.fromName(r.referenceValue), 
@@ -1978,10 +1988,10 @@ var Wt = /** @class */ function(e) {
         var e = nt.comparator(t.key, this.key);
         return this.D(e);
     }, n;
-}(Wt), $t = /** @class */ function(e) {
+}(Yt), Xt = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "in" /* IN */ , n) || this).keys = Jt("in" /* IN */ , n), 
+        return (r = e.call(this, t, "in" /* IN */ , n) || this).keys = Zt("in" /* IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1989,10 +1999,10 @@ var Wt = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Wt), Xt = /** @class */ function(e) {
+}(Yt), Jt = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "not-in" /* NOT_IN */ , n) || this).keys = Jt("not-in" /* NOT_IN */ , n), 
+        return (r = e.call(this, t, "not-in" /* NOT_IN */ , n) || this).keys = Zt("not-in" /* NOT_IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -2000,67 +2010,67 @@ var Wt = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Wt);
+}(Yt);
 
-/** Filter that matches on key fields (i.e. '__name__'). */ function Jt(t, e) {
+/** Filter that matches on key fields (i.e. '__name__'). */ function Zt(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((function(t) {
         return nt.fromName(t.referenceValue);
     }));
 }
 
-/** A Filter that implements the array-contains operator. */ var Zt = /** @class */ function(e) {
+/** A Filter that implements the array-contains operator. */ var te = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "array-contains" /* ARRAY_CONTAINS */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = t.data.field(this.field);
-        return Mt(e) && Ct(e.arrayValue, this.value);
+        return Mt(e) && jt(e.arrayValue, this.value);
     }, n;
-}(Wt), te = /** @class */ function(e) {
+}(Yt), ee = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "in" /* IN */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = t.data.field(this.field);
-        return null !== e && Ct(this.value.arrayValue, e);
+        return null !== e && jt(this.value.arrayValue, e);
     }, n;
-}(Wt), ee = /** @class */ function(e) {
+}(Yt), ne = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "not-in" /* NOT_IN */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
-        if (Ct(this.value.arrayValue, {
+        if (jt(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         var e = t.data.field(this.field);
-        return null !== e && !Ct(this.value.arrayValue, e);
+        return null !== e && !jt(this.value.arrayValue, e);
     }, n;
-}(Wt), ne = /** @class */ function(e) {
+}(Yt), re = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = this, n = t.data.field(this.field);
         return !(!Mt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
-            return Ct(e.value.arrayValue, t);
+            return jt(e.value.arrayValue, t);
         }));
     }, n;
-}(Wt), re = function(t, e) {
+}(Yt), ie = function(t, e) {
     this.position = t, this.inclusive = e;
-}, ie = function(t, e /* ASCENDING */) {
+}, oe = function(t, e /* ASCENDING */) {
     void 0 === e && (e = "asc"), this.field = t, this.dir = e;
 };
 
-/** A Filter that implements the IN operator. */ function oe(t, e) {
+/** A Filter that implements the IN operator. */ function ae(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
-function ae(t, e) {
+function se(t, e) {
     if (null === t) return null === e;
     if (null === e) return !1;
     if (t.inclusive !== e.inclusive || t.position.length !== e.position.length) return !1;
-    for (var n = 0; n < t.position.length; n++) if (!Ot(t.position[n], e.position[n])) return !1;
+    for (var n = 0; n < t.position.length; n++) if (!Ct(t.position[n], e.position[n])) return !1;
     return !0;
 }
 
@@ -2086,7 +2096,7 @@ function ae(t, e) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ var se = 
+ */ var ue = 
 /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2101,11 +2111,7 @@ function(t, e, n, r, i, o /* First */ , a, s) {
     this.S = null, this.startAt, this.endAt;
 };
 
-/** Creates a new Query for a query that matches all documents at `path` */ function ue(t) {
-    return !ct(t.limit) && "L" /* Last */ === t.limitType;
-}
-
-function ce(t) {
+/** Creates a new Query for a query that matches all documents at `path` */ function ce(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
@@ -2133,7 +2139,7 @@ function le(t) {
  * which can be different from the order by constraints the user provided (e.g.
  * the SDK and backend always orders by `__name__`).
  */ function he(t) {
-    var e = I(t);
+    var e = A(t);
     if (null === e.$) {
         e.$ = [];
         var n = le(e), r = ce(e);
@@ -2141,7 +2147,7 @@ function le(t) {
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
         // Note that the default inequality field and key ordering is ascending.
-        n.isKeyField() || e.$.push(new ie(n)), e.$.push(new ie(et.keyField(), "asc" /* ASCENDING */)); else {
+        n.isKeyField() || e.$.push(new oe(n)), e.$.push(new oe(et.keyField(), "asc" /* ASCENDING */)); else {
             for (var i = !1, o = 0, a = e.explicitOrderBy; o < a.length; o++) {
                 var s = a[o];
                 e.$.push(s), s.field.isKeyField() && (i = !0);
@@ -2150,7 +2156,7 @@ function le(t) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 var u = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* ASCENDING */;
-                e.$.push(new ie(et.keyField(), u));
+                e.$.push(new oe(et.keyField(), u));
             }
         }
     }
@@ -2160,18 +2166,18 @@ function le(t) {
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
  */ function pe(t) {
-    var e = I(t);
-    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 {
+    var e = A(t);
+    if (!e.S) if ("F" /* First */ === e.limitType) e.S = Wt(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++) {
             var o = i[r], a = "desc" /* DESCENDING */ === o.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            n.push(new ie(o.field, a));
+            n.push(new oe(o.field, a));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                var s = e.endAt ? new re(e.endAt.position, !e.endAt.inclusive) : null, u = e.startAt ? new re(e.startAt.position, !e.startAt.inclusive) : null;
+                var s = e.endAt ? new ie(e.endAt.position, e.endAt.inclusive) : null, u = e.startAt ? new ie(e.startAt.position, e.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
-                e.S = Ht(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
+                e.S = Wt(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
     }
     return e.S;
 }
@@ -2313,14 +2319,14 @@ function de(t, e) {
         a.fieldTransforms = o, a.type = 1 /* Patch */ , a;
     }
     return t(n, e), n;
-}(Te), Ie = /** @class */ function(e) {
+}(Te), Ae = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).key = t, r.precondition = n, r.type = 2 /* Delete */ , 
         r.fieldTransforms = [], r;
     }
     return t(n, e), n;
-}(Te), Ae = /** @class */ function(e) {
+}(Te), Ie = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).key = t, r.precondition = n, r.type = 3 /* Verify */ , 
@@ -2393,17 +2399,17 @@ function Ce(t, e) {
     return Oe(t.databaseId, e.path);
 }
 
-function Le(t, e) {
+function je(t, e) {
     var n, r = function(t) {
         var e = Z.fromString(t);
         return E(ze(e)), e;
     }(e);
-    if (r.get(1) !== t.databaseId.projectId) throw new x(V, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
-    if (r.get(3) !== t.databaseId.database) throw new x(V, "Tried to deserialize key from different database: " + r.get(3) + " vs " + t.databaseId.database);
+    if (r.get(1) !== t.databaseId.projectId) throw new M(V, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
+    if (r.get(3) !== t.databaseId.database) throw new M(V, "Tried to deserialize key from different database: " + r.get(3) + " vs " + t.databaseId.database);
     return new nt((E((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
 }
 
-function je(t, e) {
+function Le(t, e) {
     return Oe(t.databaseId, e);
 }
 
@@ -2411,14 +2417,14 @@ function Re(t) {
     return new Z([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Me(t, e, n) {
+function xe(t, e, n) {
     return {
         name: Ce(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function xe(t) {
+function Me(t) {
     return ke[t];
 }
 
@@ -2571,7 +2577,7 @@ function ze(t) {
         o.K = r, o.q = i, o.J = !1, o;
     }
     return t(n, e), n.prototype.X = function() {
-        if (this.J) throw new x(O, "The client has already been terminated.");
+        if (this.J) throw new M(O, "The client has already been terminated.");
     }, 
     /** Invokes the provided RPC with auth and AppCheck tokens. */ n.prototype.m = function(t, e, n) {
         var r = this;
@@ -2580,7 +2586,7 @@ function ze(t) {
             return r.K.m(t, e, n, o, a);
         })).catch((function(t) {
             throw "FirebaseError" === t.name ? (t.code === q && (r.authCredentials.invalidateToken(), 
-            r.appCheckCredentials.invalidateToken()), t) : new x(k, t.toString());
+            r.appCheckCredentials.invalidateToken()), t) : new M(k, t.toString());
         }));
     }, 
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */ n.prototype.T = function(t, e, n) {
@@ -2590,7 +2596,7 @@ function ze(t) {
             return r.K.T(t, e, n, o, a);
         })).catch((function(t) {
             throw "FirebaseError" === t.name ? (t.code === q && (r.authCredentials.invalidateToken(), 
-            r.appCheckCredentials.invalidateToken()), t) : new x(k, t.toString());
+            r.appCheckCredentials.invalidateToken()), t) : new M(k, t.toString());
         }));
     }, n.prototype.terminate = function() {
         this.J = !0;
@@ -2630,19 +2636,19 @@ function We(t, r) {
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = I(t), i = Re(e.q) + "/documents", o = {
+                return e = A(t), i = Re(e.q) + "/documents", o = {
                     writes: r.map((function(t) {
                         return function(t, e) {
                             var n;
                             if (e instanceof Se) n = {
-                                update: Me(t, e.key, e.value)
-                            }; else if (e instanceof Ie) n = {
+                                update: xe(t, e.key, e.value)
+                            }; else if (e instanceof Ae) n = {
                                 delete: Ce(t, e.key)
                             }; else if (e instanceof Ee) n = {
-                                update: Me(t, e.key, e.data),
+                                update: xe(t, e.key, e.data),
                                 updateMask: Ge(e.fieldMask)
                             }; else {
-                                if (!(e instanceof Ae)) return S();
+                                if (!(e instanceof Ie)) return S();
                                 n = {
                                     verify: Ce(t, e.key)
                                 };
@@ -2696,7 +2702,7 @@ function Ye(t, r) {
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = I(t), i = Re(e.q) + "/documents", o = {
+                return e = A(t), i = Re(e.q) + "/documents", o = {
                     documents: r.map((function(t) {
                         return Ce(e.q, t);
                     }))
@@ -2707,16 +2713,16 @@ function Ye(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 = Le(t, e.found.name), r = Fe(e.found.updateTime), i = new zt({
+                            var n = je(t, e.found.name), r = Fe(e.found.updateTime), i = new Qt({
                                 mapValue: {
                                     fields: e.found.fields
                                 }
                             });
-                            return Qt.newFoundDocument(n, r, i);
+                            return Kt.newFoundDocument(n, r, i);
                         }(t, e) : "missing" in e ? function(t, e) {
                             E(!!e.missing), E(!!e.readTime);
-                            var n = Le(t, e.missing), r = Fe(e.readTime);
-                            return Qt.newNoDocument(n, r);
+                            var n = je(t, e.missing), r = Fe(e.readTime);
+                            return Kt.newNoDocument(n, r);
                         }(t, e) : S();
                     }(e.q, t);
                     s.set(n.key.toString(), n);
@@ -2735,15 +2741,15 @@ function $e(t, r) {
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = I(t), i = function(t, e) {
+                return e = A(t), i = function(t, e) {
                     // Dissect the path into parent, collectionId, and optional key filter.
                     var n = {
                         structuredQuery: {}
                     }, r = e.path;
-                    null !== e.collectionGroup ? (n.parent = je(t, r), n.structuredQuery.from = [ {
+                    null !== e.collectionGroup ? (n.parent = Le(t, r), n.structuredQuery.from = [ {
                         collectionId: e.collectionGroup,
                         allDescendants: !0
-                    } ]) : (n.parent = je(t, r.popLast()), n.structuredQuery.from = [ {
+                    } ]) : (n.parent = Le(t, r.popLast()), n.structuredQuery.from = [ {
                         collectionId: r.lastSegment()
                     } ]);
                     var i = function(t) {
@@ -2752,26 +2758,26 @@ function $e(t, r) {
                                 // visible for testing
                                 return function(t) {
                                     if ("==" /* EQUAL */ === t.op) {
-                                        if (Ut(t.value)) return {
+                                        if (Bt(t.value)) return {
                                             unaryFilter: {
                                                 field: Be(t.field),
                                                 op: "IS_NAN"
                                             }
                                         };
-                                        if (xt(t.value)) return {
+                                        if (Ut(t.value)) return {
                                             unaryFilter: {
                                                 field: Be(t.field),
                                                 op: "IS_NULL"
                                             }
                                         };
                                     } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                                        if (Ut(t.value)) return {
+                                        if (Bt(t.value)) return {
                                             unaryFilter: {
                                                 field: Be(t.field),
                                                 op: "IS_NOT_NAN"
                                             }
                                         };
-                                        if (xt(t.value)) return {
+                                        if (Ut(t.value)) return {
                                             unaryFilter: {
                                                 field: Be(t.field),
                                                 op: "IS_NOT_NULL"
@@ -2802,7 +2808,7 @@ function $e(t, r) {
                             return function(t) {
                                 return {
                                     field: Be(t.field),
-                                    direction: xe(t.dir)
+                                    direction: Me(t.dir)
                                 };
                             }(t);
                         }));
@@ -2831,11 +2837,11 @@ function $e(t, r) {
                     return !!t.document;
                 })).map((function(t) {
                     return function(t, e, n) {
-                        var r = Le(t, e.name), i = Fe(e.updateTime), o = new zt({
+                        var r = je(t, e.name), i = Fe(e.updateTime), o = new Qt({
                             mapValue: {
                                 fields: e.fields
                             }
-                        }), a = Qt.newFoundDocument(r, i, o);
+                        }), a = Kt.newFoundDocument(r, i, o);
                         return a;
                     }(e.q, t.document);
                 })) ];
@@ -2870,7 +2876,7 @@ function $e(t, r) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */ function Je(t) {
-    if (t._terminated) throw new x(O, "The client has already been terminated.");
+    if (t._terminated) throw new M(O, "The client has already been terminated.");
     if (!Xe.has(t)) {
         w("ComponentProvider", "Initializing Datastore");
         var e = function(t) {
@@ -2912,17 +2918,17 @@ function $e(t, r) {
     function t(t) {
         var e;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new x(V, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new M(V, "Can't provide ssl option if host option is not set");
             this.host = "firestore.googleapis.com", this.ssl = !0;
         } else this.host = t.host, this.ssl = null === (e = t.ssl) || void 0 === e || e;
         if (this.credentials = t.credentials, this.ignoreUndefinedProperties = !!t.ignoreUndefinedProperties, 
         void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
-            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new x(V, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new M(V, "cacheSizeBytes must be at least 1048576");
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
         this.useFetchStreams = !!t.useFetchStreams, function(t, e, n, r) {
-            if (!0 === e && !0 === r) throw new x(V, "experimentalForceLongPolling and experimentalAutoDetectLongPolling cannot be used together.");
+            if (!0 === e && !0 === r) throw new M(V, "experimentalForceLongPolling and experimentalAutoDetectLongPolling cannot be used together.");
         }(0, t.experimentalForceLongPolling, 0, t.experimentalAutoDetectLongPolling);
     }
     return t.prototype.isEqual = function(t) {
@@ -2938,7 +2944,7 @@ function $e(t, r) {
         this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new Ze({}), 
         this._settingsFrozen = !1, t instanceof X ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
-            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new x(V, '"projectId" not provided in firebase.initializeApp.');
+            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new M(V, '"projectId" not provided in firebase.initializeApp.');
             return new X(t.options.projectId);
         }(t));
     }
@@ -2948,7 +2954,7 @@ function $e(t, r) {
          * instance.
          */
         get: function() {
-            if (!this._app) throw new x(O, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+            if (!this._app) throw new M(O, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
             return this._app;
         },
         enumerable: !1,
@@ -2966,7 +2972,7 @@ function $e(t, r) {
         enumerable: !1,
         configurable: !0
     }), t.prototype._setSettings = function(t) {
-        if (this._settingsFrozen) throw new x(O, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
+        if (this._settingsFrozen) throw new M(O, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
         this._settings = new Ze(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new G;
             switch (t.type) {
@@ -2980,7 +2986,7 @@ function $e(t, r) {
                 return t.client;
 
               default:
-                throw new x(V, "makeAuthCredentialsProvider failed due to invalid credential type");
+                throw new M(V, "makeAuthCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }, t.prototype._getSettings = function() {
@@ -3033,7 +3039,7 @@ function $e(t, r) {
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
  */ function en(t, e) {
     var n = _getProvider(t, "firestore/lite");
-    if (n.isInitialized()) throw new x(O, "Firestore can only be initialized once per app.");
+    if (n.isInitialized()) throw new M(O, "Firestore can only be initialized once per app.");
     return n.initialize({
         options: e
     });
@@ -3078,7 +3084,7 @@ function $e(t, r) {
             // invalid field "uid" and missing field "sub" / "user_id".)
             a = d(r.mockUserToken, null === (i = t._app) || void 0 === i ? void 0 : i.options.projectId);
             var u = r.mockUserToken.sub || r.mockUserToken.user_id;
-            if (!u) throw new x(V, "mockUserToken must contain 'sub' or 'user_id' field!");
+            if (!u) throw new M(V, "mockUserToken must contain 'sub' or 'user_id' field!");
             s = new m(u);
         }
         t._authCredentials = new z(new B(a, s));
@@ -3212,7 +3218,7 @@ var an = /** @class */ function() {
     /** @hideconstructor */
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this, t, n, new se(r)) || this)._path = r, 
+        return (i = e.call(this, t, n, new ue(r)) || this)._path = r, 
         /** The type of this Firestore reference. */
         i.type = "collection", i;
     }
@@ -3258,7 +3264,7 @@ var an = /** @class */ function() {
         var o = Z.fromString.apply(Z, r([ e ], n));
         return ot(o), new un(t, /* converter= */ null, o);
     }
-    if (!(t instanceof an || t instanceof un)) throw new x(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    if (!(t instanceof an || t instanceof un)) throw new M(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
     var a = t._path.child(Z.fromString.apply(Z, r([ e ], n)));
     return ot(a), new un(t.firestore, 
     /* converter= */ null, a);
@@ -3277,7 +3283,7 @@ var an = /** @class */ function() {
  * will be included. Cannot contain a slash.
  * @returns The created `Query`.
  */ function ln(t, e) {
-    if (t = st(t, tn), rt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new x(V, "Invalid collection ID '" + e + "' passed to function collectionGroup(). Collection IDs must not contain '/'.");
+    if (t = st(t, tn), rt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new M(V, "Invalid collection ID '" + e + "' passed to function collectionGroup(). Collection IDs must not contain '/'.");
     return new sn(t, 
     /* converter= */ null, 
     /**
@@ -3285,7 +3291,7 @@ var an = /** @class */ function() {
  * within the provided collection group.
  */
     function(t) {
-        return new se(Z.emptyPath(), t);
+        return new ue(Z.emptyPath(), t);
     }(e));
 }
 
@@ -3299,7 +3305,7 @@ function fn(t, e) {
         return it(o), new an(t, 
         /* converter= */ null, new nt(o));
     }
-    if (!(t instanceof an || t instanceof un)) throw new x(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    if (!(t instanceof an || t instanceof un)) throw new M(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
     var a = t._path.child(Z.fromString.apply(Z, r([ e ], n)));
     return it(a), new an(t.firestore, t instanceof un ? t.converter : null, new nt(a));
 }
@@ -3329,12 +3335,12 @@ function pn(t, e) {
         return function(t, e) {
             if (t.limit !== e.limit) return !1;
             if (t.orderBy.length !== e.orderBy.length) return !1;
-            for (var n = 0; n < t.orderBy.length; n++) if (!oe(t.orderBy[n], e.orderBy[n])) return !1;
+            for (var n = 0; n < t.orderBy.length; n++) if (!ae(t.orderBy[n], e.orderBy[n])) return !1;
             if (t.filters.length !== e.filters.length) return !1;
             for (var r = 0; r < t.filters.length; r++) if (i = t.filters[r], o = e.filters[r], 
-            i.op !== o.op || !i.field.isEqual(o.field) || !Ot(i.value, o.value)) return !1;
+            i.op !== o.op || !i.field.isEqual(o.field) || !Ct(i.value, o.value)) return !1;
             var i, o;
-            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!ae(t.startAt, e.startAt) && ae(t.endAt, e.endAt);
+            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!se(t.startAt, e.startAt) && se(t.endAt, e.endAt);
         }(pe(t), pe(e)) && t.limitType === e.limitType;
     }(t._query, e._query) && t.converter === e.converter
     /**
@@ -3372,7 +3378,7 @@ var dn = /** @class */ function() {
      */
     function t() {
         for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-        for (var n = 0; n < t.length; ++n) if (0 === t[n].length) throw new x(V, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        for (var n = 0; n < t.length; ++n) if (0 === t[n].length) throw new M(V, "Invalid field name at argument $(i + 1). Field names must not be empty.");
         this._internalPath = new et(t);
     }
     /**
@@ -3422,9 +3428,9 @@ var dn = /** @class */ function() {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    return t.fromBase64String = function(e) {
         try {
-            return new t(It.fromBase64String(e));
+            return new t(At.fromBase64String(e));
         } catch (e) {
-            throw new x(V, "Failed to construct data from Base64 string: " + e);
+            throw new M(V, "Failed to construct data from Base64 string: " + e);
         }
     }, 
     /**
@@ -3433,7 +3439,7 @@ var dn = /** @class */ function() {
      * @param array - The Uint8Array used to create the `Bytes` object.
      */
     t.fromUint8Array = function(e) {
-        return new t(It.fromUint8Array(e));
+        return new t(At.fromUint8Array(e));
     }, 
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3483,8 +3489,8 @@ function(t) {
      * @param longitude - The longitude as number between -180 and 180.
      */
     function t(t, e) {
-        if (!isFinite(t) || t < -90 || t > 90) throw new x(V, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(e) || e < -180 || e > 180) throw new x(V, "Longitude must be a number between -180 and 180, but was: " + e);
+        if (!isFinite(t) || t < -90 || t > 90) throw new M(V, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(e) || e < -180 || e > 180) throw new M(V, "Longitude must be a number between -180 and 180, but was: " + e);
         this._lat = t, this._long = e;
     }
     return Object.defineProperty(t.prototype, "latitude", {
@@ -3679,27 +3685,27 @@ function(t) {
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ function In(t) {
+ */ function An(t) {
     var e = t._freezeSettings(), n = Qe(t._databaseId);
     return new En(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function An(t, e, n, r, i, o) {
+/** Parse document data from a set() call. */ function In(t, e, n, r, i, o) {
     void 0 === o && (o = {});
     var a = t.ht(o.merge || o.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
-    Mn("Data must be an object, but it was:", a, r);
-    var s, u, c = jn(r, a);
+    xn("Data must be an object, but it was:", a, r);
+    var s, u, c = Ln(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);
-            if (!a.contains(p)) throw new x(V, "Field '" + p + "' is specified in your field mask but missing from your input data.");
+            var p = Mn(e, h[f], n);
+            if (!a.contains(p)) throw new M(V, "Field '" + p + "' is specified in your field mask but missing from your input data.");
             zn(l, p) || l.push(p);
         }
         s = new Et(l), u = a.fieldTransforms.filter((function(t) {
             return s.covers(t.field);
         }));
     } else s = null, u = a.fieldTransforms;
-    return new bn(new zt(c), s, u);
+    return new bn(new Qt(c), s, u);
 }
 
 var kn = /** @class */ function(e) {
@@ -3757,7 +3763,7 @@ var Dn = /** @class */ function(e) {
     return t(n, e), n.prototype._toFieldTransform = function(t) {
         var e = Vn(this, t, 
         /*array=*/ !0), n = this.lt.map((function(t) {
-            return Ln(t, e);
+            return jn(t, e);
         })), r = new ve(n);
         return new be(t.path, r);
     }, n.prototype.isEqual = function(t) {
@@ -3772,7 +3778,7 @@ var Dn = /** @class */ function(e) {
     return t(n, e), n.prototype._toFieldTransform = function(t) {
         var e = Vn(this, t, 
         /*array=*/ !0), n = this.lt.map((function(t) {
-            return Ln(t, e);
+            return jn(t, e);
         })), r = new ge(n);
         return new be(t.path, r);
     }, n.prototype.isEqual = function(t) {
@@ -3795,8 +3801,8 @@ var Dn = /** @class */ function(e) {
 
 /** Parse update data from an update() call. */ function Fn(t, e, n, r) {
     var i = t.ht(1 /* Update */ , e, n);
-    Mn("Data must be an object, but it was:", i, r);
-    var o = [], a = zt.empty();
+    xn("Data must be an object, but it was:", i, r);
+    var o = [], a = Qt.empty();
     St(r, (function(t, r) {
         var s = Bn(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
@@ -3806,7 +3812,7 @@ var Dn = /** @class */ function(e) {
         if (r instanceof kn) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(s); else {
-            var c = Ln(r, u);
+            var c = jn(r, u);
             null != c && (o.push(s), a.set(s, c));
         }
     }));
@@ -3815,12 +3821,12 @@ var Dn = /** @class */ function(e) {
 }
 
 /** Parse update data from a list of field/value arguments. */ function On(t, e, n, r, i, o) {
-    var a = t.ht(1 /* Update */ , e, n), s = [ xn(e, r, n) ], u = [ i ];
-    if (o.length % 2 != 0) throw new x(V, "Function " + e + "() needs to be called with an even number of arguments that alternate between field names and values.");
-    for (var c = 0; c < o.length; c += 2) s.push(xn(e, o[c])), u.push(o[c + 1]);
+    var a = t.ht(1 /* Update */ , e, n), s = [ Mn(e, r, n) ], u = [ i ];
+    if (o.length % 2 != 0) throw new M(V, "Function " + e + "() needs to be called with an even number of arguments that alternate between field names and values.");
+    for (var c = 0; c < o.length; c += 2) s.push(Mn(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 (!zn(l, s[h])) {
+    for (var l = [], f = Qt.empty(), h = s.length - 1; h >= 0; --h) if (!zn(l, s[h])) {
         var d = s[h], m = u[h];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
@@ -3829,7 +3835,7 @@ var Dn = /** @class */ function(e) {
         if (m instanceof kn) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(d); else {
-            var v = Ln(m, y);
+            var v = jn(m, y);
             null != v && (l.push(d), f.set(d, v));
         }
     }
@@ -3844,7 +3850,7 @@ var Dn = /** @class */ function(e) {
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
  */ function Cn(t, e, n, r) {
-    return void 0 === r && (r = !1), Ln(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+    return void 0 === r && (r = !1), jn(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -3855,11 +3861,11 @@ var Dn = /** @class */ function(e) {
  * the source of the data being parsed, etc.
  * @returns The parsed value, or null if the value was a FieldValue sentinel
  * that should not be included in the resulting parsed data.
- */ function Ln(t, e) {
+ */ function jn(t, e) {
     if (Rn(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = p(t))) return Mn("Unsupported field value:", e, t), jn(t, e);
+    t = p(t))) return xn("Unsupported field value:", e, t), Ln(t, e);
     if (t instanceof vn) 
     // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
@@ -3895,7 +3901,7 @@ var Dn = /** @class */ function(e) {
         if (e.settings.rt && 4 /* ArrayArgument */ !== e.tt) throw e.ut("Nested arrays are not supported");
         return function(t, e) {
             for (var n = [], r = 0, i = 0, o = t; i < o.length; i++) {
-                var a = Ln(o[i], e.ot(r));
+                var a = jn(o[i], e.ot(r));
                 null == a && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -3956,7 +3962,7 @@ var Dn = /** @class */ function(e) {
     }(t, e);
 }
 
-function jn(t, e) {
+function Ln(t, e) {
     var n = {};
     return function(t) {
         for (var e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
@@ -3965,7 +3971,7 @@ function jn(t, e) {
     // If we encounter an empty object, we explicitly add it to the update
     // mask to ensure that the server creates a map entry.
     e.path && e.path.length > 0 && e.fieldMask.push(e.path) : St(t, (function(t, r) {
-        var i = Ln(r, e.nt(t));
+        var i = jn(r, e.nt(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -3978,7 +3984,7 @@ function Rn(t) {
     return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof bt || t instanceof gn || t instanceof yn || t instanceof an || t instanceof vn);
 }
 
-function Mn(t, e, n) {
+function xn(t, e, n) {
     if (!Rn(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
@@ -3989,7 +3995,7 @@ function Mn(t, e, n) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function xn(t, e, n) {
+ */ function Mn(t, e, n) {
     if (
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
@@ -4030,7 +4036,7 @@ function Gn(t, e, n, r, i) {
     n && (s += " (via `toFirestore()`)");
     var u = "";
     return (o || a) && (u += " (found", o && (u += " in field " + r), a && (u += " in document " + i), 
-    u += ")"), new x(V, (s += ". ") + t + u)
+    u += ")"), new M(V, (s += ". ") + t + u)
     /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */;
 }
 
@@ -4260,10 +4266,10 @@ var Jn = /** @class */ function(e) {
         i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = In(t.firestore), n = function(t, e, n, r, i, o, a) {
+        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 x(V, "Invalid Query. You can't perform '" + o + "' queries on documentId().");
+                if ("array-contains" /* ARRAY_CONTAINS */ === o || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === o) throw new M(V, "Invalid Query. You can't perform '" + o + "' queries on documentId().");
                 if ("in" /* IN */ === o || "not-in" /* NOT_IN */ === o) {
                     pr(a, o);
                     for (var u = [], c = 0, l = a; c < l.length; c++) {
@@ -4279,11 +4285,11 @@ var Jn = /** @class */ function(e) {
             } else "in" /* IN */ !== o && "not-in" /* NOT_IN */ !== o && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== o || pr(a, o), 
             s = Cn(n, "where", a, 
             /* allowArrays= */ "in" /* IN */ === o || "not-in" /* NOT_IN */ === o);
-            var h = Wt.create(i, o, s);
+            var h = Yt.create(i, o, s);
             return function(t, e) {
                 if (e.N()) {
                     var n = le(t);
-                    if (null !== n && !n.isEqual(e.field)) throw new x(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() + "'");
+                    if (null !== n && !n.isEqual(e.field)) throw new M(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 && dr(t, e.field, r);
                 }
@@ -4329,12 +4335,12 @@ var Jn = /** @class */ function(e) {
                 }(e.op));
                 if (null !== i) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
-                throw i === e.op ? new x(V, "Invalid query. You cannot use more than one '" + e.op.toString() + "' filter.") : new x(V, "Invalid query. You cannot use '" + e.op.toString() + "' filters with '" + i.toString() + "' filters.");
+                throw i === e.op ? new M(V, "Invalid query. You cannot use more than one '" + e.op.toString() + "' filter.") : new M(V, "Invalid query. You cannot use '" + e.op.toString() + "' filters with '" + i.toString() + "' filters.");
             }(t, h), h;
         }(t._query, 0, e, t.firestore._databaseId, this.dt, this.wt, this.yt);
         return new sn(t.firestore, t.converter, function(t, e) {
             var n = t.filters.concat([ e ]);
-            return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }, n;
 }($n);
@@ -4361,9 +4367,9 @@ var tr = /** @class */ function(e) {
     }
     return t(n, e), n.prototype._apply = function(t) {
         var e = function(t, e, n) {
-            if (null !== t.startAt) throw new x(V, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
-            if (null !== t.endAt) throw new x(V, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            var r = new ie(e, n);
+            if (null !== t.startAt) throw new M(V, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new M(V, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            var r = new oe(e, n);
             return function(t, e) {
                 if (null === ce(t)) {
                     // This is the first order by. It must match any inequality.
@@ -4375,7 +4381,7 @@ var tr = /** @class */ function(e) {
         return new sn(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 se(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new ue(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }, n;
 }($n);
@@ -4397,12 +4403,12 @@ var tr = /** @class */ function(e) {
 var nr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.gt = n, i.vt = r, i;
+        return (i = e.call(this) || this).type = t, i.gt = n, i.bt = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
         return new sn(t.firestore, t.converter, function(t, e, n) {
-            return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
-        }(t._query, this.gt, this.vt));
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        }(t._query, this.gt, this.bt));
     }, n;
 }($n);
 
@@ -4431,12 +4437,12 @@ function ir(t) {
 var or = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.bt = n, i.Et = r, i;
+        return (i = e.call(this) || this).type = t, i.vt = n, i.Et = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = fr(t, this.type, this.bt, this.Et);
+        var e = fr(t, this.type, this.vt, this.Et);
         return new sn(t.firestore, t.converter, function(t, e) {
-            return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }, n;
 }($n);
@@ -4456,12 +4462,12 @@ function sr() {
 var ur = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.bt = n, i.Et = r, i;
+        return (i = e.call(this) || this).type = t, i.vt = n, i.Et = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = fr(t, this.type, this.bt, this.Et);
+        var e = fr(t, this.type, this.vt, this.Et);
         return new sn(t.firestore, t.converter, function(t, e) {
-            return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }, n;
 }($n);
@@ -4479,7 +4485,7 @@ function lr() {
 
 /** Helper function to create a bound from a document or fields */ function fr(t, e, n, r) {
     if (n[0] = p(n[0]), n[0] instanceof Qn) return function(t, e, n, r, i) {
-        if (!r) throw new x(P, "Can't use a DocumentSnapshot that doesn't exist for " + n + "().");
+        if (!r) throw new M(P, "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
@@ -4489,63 +4495,63 @@ function lr() {
         // results.
         for (var o = [], a = 0, s = he(t); a < s.length; a++) {
             var u = s[a];
-            if (u.field.isKeyField()) o.push(Rt(e, r.key)); else {
+            if (u.field.isKeyField()) o.push(xt(e, r.key)); else {
                 var c = r.data.field(u.field);
-                if (Pt(c)) throw new x(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 (Pt(c)) throw new M(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 x(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.");
+                    throw new M(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.");
                 }
                 o.push(c);
             }
         }
-        return new re(o, i);
+        return new ie(o, i);
     }(t._query, t.firestore._databaseId, e, n[0]._document, r);
-    var i = In(t.firestore);
+    var i = An(t.firestore);
     return function(t, e, n, r, i, o) {
         // Use explicit order by's because it has to match the query the user made
         var a = t.explicitOrderBy;
-        if (i.length > a.length) throw new x(V, "Too many arguments provided to " + r + "(). The number of arguments must be less than or equal to the number of orderBy() clauses");
+        if (i.length > a.length) throw new M(V, "Too many arguments provided to " + r + "(). The number of arguments must be less than or equal to the number of orderBy() clauses");
         for (var s = [], u = 0; u < i.length; u++) {
             var c = i[u];
             if (a[u].field.isKeyField()) {
-                if ("string" != typeof c) throw new x(V, "Invalid query. Expected a string for document ID in " + r + "(), but got a " + typeof c);
-                if (!fe(t) && -1 !== c.indexOf("/")) throw new x(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.");
+                if ("string" != typeof c) throw new M(V, "Invalid query. Expected a string for document ID in " + r + "(), but got a " + typeof c);
+                if (!fe(t) && -1 !== c.indexOf("/")) throw new M(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 l = t.path.child(Z.fromString(c));
-                if (!nt.isDocumentKey(l)) throw new x(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 '" + l + "' is not because it contains an odd number of segments.");
+                if (!nt.isDocumentKey(l)) throw new M(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 '" + l + "' is not because it contains an odd number of segments.");
                 var f = new nt(l);
-                s.push(Rt(e, f));
+                s.push(xt(e, f));
             } else {
                 var h = Cn(n, r, c);
                 s.push(h);
             }
         }
-        return new re(s, o);
+        return new ie(s, o);
     }(t._query, t.firestore._databaseId, i, e, n, r);
 }
 
 function hr(t, e, n) {
     if ("string" == typeof (n = p(n))) {
-        if ("" === n) throw new x(V, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!fe(e) && -1 !== n.indexOf("/")) throw new x(V, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '" + n + "' contains a '/' character.");
+        if ("" === n) throw new M(V, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!fe(e) && -1 !== n.indexOf("/")) throw new M(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 x(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 (!nt.isDocumentKey(r)) throw new M(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 xt(t, new nt(r));
     }
-    if (n instanceof an) return Rt(t, n._key);
-    throw new x(V, "Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: " + at(n) + ".");
+    if (n instanceof an) return xt(t, n._key);
+    throw new M(V, "Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: " + at(n) + ".");
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
  */ function pr(t, e) {
-    if (!Array.isArray(t) || 0 === t.length) throw new x(V, "Invalid Query. A non-empty array is required for '" + e.toString() + "' filters.");
-    if (t.length > 10) throw new x(V, "Invalid Query. '" + e.toString() + "' filters support a maximum of 10 elements in the value array.");
+    if (!Array.isArray(t) || 0 === t.length) throw new M(V, "Invalid Query. A non-empty array is required for '" + e.toString() + "' filters.");
+    if (t.length > 10) throw new M(V, "Invalid Query. '" + e.toString() + "' filters support a maximum of 10 elements in the value array.");
 }
 
 function dr(t, e, n) {
-    if (!n.isEqual(e)) throw new x(V, "Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '" + e.toString() + "' and so you must also use '" + e.toString() + "' as your first argument to orderBy(), but your first orderBy() is on field '" + n.toString() + "' instead.");
+    if (!n.isEqual(e)) throw new M(V, "Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '" + e.toString() + "' and so you must also use '" + e.toString() + "' as your first argument to orderBy(), but your first orderBy() is on field '" + n.toString() + "' instead.");
 }
 
 /**
@@ -4615,7 +4621,7 @@ var yr = /** @class */ function(e) {
 }(/** @class */ function() {
     function t() {}
     return t.prototype.convertValue = function(t, e) {
-        switch (void 0 === e && (e = "none"), Ft(t)) {
+        switch (void 0 === e && (e = "none"), Ot(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -4724,14 +4730,14 @@ var yr = /** @class */ function(e) {
  * @returns A Promise that will be resolved with the results of the query.
  */ function gr(t) {
     !function(t) {
-        if (ue(t) && 0 === t.explicitOrderBy.length) throw new x(j, "limitToLast() queries require specifying at least one orderBy() clause");
+        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new M(L, "limitToLast() queries require specifying at least one orderBy() clause");
     }((t = st(t, sn))._query);
     var e = Je(t.firestore), n = new yr(t.firestore);
     return $e(e, t._query).then((function(e) {
         var r = e.map((function(e) {
             return new Kn(t.firestore, n, e.key, e, t.converter);
         }));
-        return ue(t._query) && 
+        return "L" /* Last */ === t._query.limitType && 
         // Limit to last queries reverse the orderBy constraint that was
         // specified by the user. As such, we need to reverse the order of the
         // results to return the documents in the expected order.
@@ -4740,13 +4746,13 @@ var yr = /** @class */ function(e) {
 }
 
 function wr(t, e, n) {
-    var r = mr((t = st(t, an)).converter, e, n), i = An(In(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    var r = mr((t = st(t, an)).converter, e, n), i = In(An(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
     return We(Je(t.firestore), [ i.toMutation(t._key, _e.none()) ]);
 }
 
 function br(t, e, n) {
     for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-    var o, a = In((t = st(t, an)).firestore);
+    var o, a = An((t = st(t, an)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         return o = "string" == typeof (e = p(e)) || e instanceof dn ? On(a, "updateDoc", t._key, e, n, r) : Fn(a, "updateDoc", t._key, e), 
@@ -4765,7 +4771,7 @@ function br(t, e, n) {
  * @returns A `Promise` resolved once the document has been successfully
  * deleted from the backend.
  */ function _r(t) {
-    return We(Je((t = st(t, an)).firestore), [ new Ie(t._key, _e.none()) ]);
+    return We(Je((t = st(t, an)).firestore), [ new Ae(t._key, _e.none()) ]);
 }
 
 /**
@@ -4783,7 +4789,7 @@ function br(t, e, n) {
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
  */ function Tr(t, e) {
-    var n = fn(t = st(t, un)), r = mr(t.converter, e), i = An(In(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    var n = fn(t = st(t, un)), r = mr(t.converter, e), i = In(An(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
     return We(Je(t.firestore), [ i.toMutation(n._key, _e.exists(!1)) ]).then((function() {
         return n;
     }));
@@ -4830,7 +4836,7 @@ function br(t, e, n) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function Ir() {
+ */ function Ar() {
     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.
@@ -4847,7 +4853,7 @@ function br(t, e, n) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Ar() {
+ */ function Ir() {
     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.
@@ -4903,11 +4909,11 @@ function br(t, e, n) {
     /** @hideconstructor */
     function t(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = In(t);
+        this._dataReader = An(t);
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = Dr(t, this._firestore), i = mr(r.converter, e, n), o = An(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
+        var r = Dr(t, this._firestore), i = mr(r.converter, e, n), o = In(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];
@@ -4927,7 +4933,7 @@ function br(t, e, n) {
     t.prototype.delete = function(t) {
         this._verifyNotCommitted();
         var e = Dr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Ie(e._key, _e.none())), this;
+        return this._mutations = this._mutations.concat(new Ae(e._key, _e.none())), this;
     }, 
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -4944,12 +4950,12 @@ function br(t, e, n) {
     t.prototype.commit = function() {
         return this._verifyNotCommitted(), this._committed = !0, this._mutations.length > 0 ? this._commitHandler(this._mutations) : Promise.resolve();
     }, t.prototype._verifyNotCommitted = function() {
-        if (this._committed) throw new x(O, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new M(O, "A write batch can no longer be used after commit() has been called.");
     }, t;
 }();
 
 function Dr(t, e) {
-    if ((t = p(t)).firestore !== e) throw new x(V, "Provided document reference is from a different Firestore instance.");
+    if ((t = p(t)).firestore !== e) throw new M(V, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -5015,7 +5021,7 @@ function Dr(t, e) {
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new x(V, "Firestore transactions require all reads to be executed before all writes.");
+                    if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new M(V, "Firestore transactions require all reads to be executed before all writes.");
                     return [ 4 /*yield*/ , Ye(this.datastore, t) ];
 
                   case 1:
@@ -5035,7 +5041,7 @@ function Dr(t, e) {
         }
         this.writtenDocs.add(t.toString());
     }, t.prototype.delete = function(t) {
-        this.write(new Ie(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Ae(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }, t.prototype.commit = function() {
         return e(this, void 0, void 0, (function() {
             var t, e = this;
@@ -5052,7 +5058,7 @@ function Dr(t, e) {
                     // a `verify` operation.
                     t.forEach((function(t, n) {
                         var r = nt.fromPath(n);
-                        e.mutations.push(new Ae(r, e.precondition(r)));
+                        e.mutations.push(new Ie(r, e.precondition(r)));
                     })), [ 4 /*yield*/ , We(this.datastore, this.mutations) ];
 
                   case 1:
@@ -5072,7 +5078,7 @@ function Dr(t, e) {
         if (n) {
             if (!e.isEqual(n)) 
             // This transaction will fail no matter what.
-            throw new x(C, "Document version changed between two reads.");
+            throw new M(C, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }, 
     /**
@@ -5101,7 +5107,7 @@ function Dr(t, e) {
             // express that to the backend, we have to validate locally.
             // Note: this can change once we can send separate verify writes in the
             // transaction.
-            throw new x(V, "Can't update a document that doesn't exist.");
+            throw new M(V, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
                         return _e.updateTime(e);
         }
@@ -5111,17 +5117,19 @@ function Dr(t, e) {
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), qr = /** @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 Ke(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
+}(), qr = {
+    maxAttempts: 5
+}, Fr = /** @class */ function() {
+    function t(t, e, n, r, i) {
+        this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
+        this.deferred = i, this.Tt = n.maxAttempts, this.At = new Ke(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.run = function() {
-        this.Tt -= 1, this.At();
-    }, t.prototype.At = function() {
+        this.Tt -= 1, this.It();
+    }, t.prototype.It = function() {
         var t = this;
-        this.It.W((function() {
+        this.At.W((function() {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
@@ -5151,7 +5159,7 @@ function Dr(t, e) {
     }, 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();
+            return e.It(), Promise.resolve();
         }))) : this.deferred.reject(t);
     }, t.prototype.Vt = function(t) {
         if ("FirebaseError" === t.name) {
@@ -5170,12 +5178,12 @@ function Dr(t, e) {
                   default:
                     return S();
 
-                  case A:
+                  case I:
                   case k:
                   case D:
                   case F:
                   case R:
-                  case M:
+                  case x:
  // Unauthenticated means something went wrong with our token and we need
                     // to retry with new credentials which will happen automatically.
                                       case q:
@@ -5190,8 +5198,8 @@ function Dr(t, e) {
                     // the context and should handled individually by the calling code.
                     // See https://cloud.google.com/apis/design/errors.
                                       case C:
-                  case L:
                   case j:
+                  case L:
                   case "data-loss":
                     return !0;
                 }
@@ -5203,7 +5211,7 @@ function Dr(t, e) {
 
 /**
  * @license
- * Copyright 2019 Google LLC
+ * Copyright 2022 Google LLC
  *
  * Licensed under the Apache License, Version 2.0 (the "License");
  * you may not use this file except in compliance with the License.
@@ -5217,10 +5225,6 @@ function Dr(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/**
- * TransactionRunner encapsulates the logic needed to run and retry transactions
- * with backoff.
- */
 /**
  * @license
  * Copyright 2020 Google LLC
@@ -5237,7 +5241,7 @@ function Dr(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** The Platform's 'document' implementation or null if not available. */ function Fr() {
+/** The Platform's 'document' implementation or null if not available. */ function Or() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5269,7 +5273,7 @@ function Dr(t, e) {
  * Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type
  * in newer versions of TypeScript defines `finally`, which is not available in
  * IE.
- */ var Or = /** @class */ function() {
+ */ var Cr = /** @class */ function() {
     function t(t, e, n, r, i) {
         this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = r, this.removalCallback = i, 
         this.deferred = new U, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
@@ -5321,7 +5325,7 @@ function Dr(t, e) {
      * guarantee that the operation will not be run.
      */
     t.prototype.cancel = function(t) {
-        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new x(A, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new M(I, "Operation cancelled" + (t ? ": " + t : ""))));
     }, t.prototype.handleDelayElapsed = function() {
         var t = this;
         this.asyncQueue.enqueueAndForget((function() {
@@ -5333,7 +5337,7 @@ function Dr(t, e) {
         null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle), 
         this.timerHandle = null);
     }, t;
-}(), Cr = /** @class */ function() {
+}(), jr = /** @class */ function() {
     function t() {
         var t = this;
         // The last promise in the queue.
@@ -5348,24 +5352,24 @@ function Dr(t, e) {
         // automatically removed after they are run or canceled.
         this.St = [], 
         // visible for testing
-        this.Ft = null, 
+        this.xt = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.xt = !1, 
+        this.Ft = !1, 
         // Enabled during shutdown on Safari to prevent future access to IndexedDB.
         this.qt = !1, 
         // List of TimerIds to fast-forward delays for.
         this.Ot = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new Ke(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.At = new Ke(this, "async_queue_retry" /* AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
         this.Ct = function() {
-            var e = Fr();
-            e && w("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.It.H();
+            var e = Or();
+            e && w("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.At.H();
         };
-        var e = Fr();
+        var e = Or();
         e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Ct);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
@@ -5389,7 +5393,7 @@ function Dr(t, e) {
     }, t.prototype.enterRestrictedMode = function(t) {
         if (!this.$t) {
             this.$t = !0, this.qt = t || !1;
-            var e = Fr();
+            var e = Or();
             e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ct);
         }
     }, t.prototype.enqueue = function(t) {
@@ -5429,7 +5433,7 @@ function Dr(t, e) {
                     return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.Nt[0]() ];
 
                   case 2:
-                    return n.sent(), this.Nt.shift(), this.It.reset(), [ 3 /*break*/ , 4 ];
+                    return n.sent(), this.Nt.shift(), this.At.reset(), [ 3 /*break*/ , 4 ];
 
                   case 3:
                     if (t = n.sent(), "IndexedDbTransactionError" !== t.name) throw t;
@@ -5449,7 +5453,7 @@ function Dr(t, e) {
                     // Since `backoffAndRun()` cancels an existing backoff and schedules a
                     // new backoff on every call, there is only ever a single additional
                     // operation in the queue.
-                    this.It.W((function() {
+                    this.At.W((function() {
                         return e.kt();
                     })), n.label = 5;
 
@@ -5460,8 +5464,8 @@ function Dr(t, e) {
         }));
     }, t.prototype.Ut = function(t) {
         var e = this, n = this.Dt.then((function() {
-            return e.xt = !0, t().catch((function(t) {
-                e.Ft = t, e.xt = !1;
+            return e.Ft = !0, t().catch((function(t) {
+                e.xt = t, e.Ft = !1;
                 var n = 
                 /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -5478,7 +5482,7 @@ function Dr(t, e) {
                 // and return the rejected Promise.
                                 throw b("INTERNAL UNHANDLED ERROR: ", n), t;
             })).then((function(t) {
-                return e.xt = !1, t;
+                return e.Ft = !1, t;
             }));
         }));
         return this.Dt = n, n;
@@ -5487,12 +5491,12 @@ function Dr(t, e) {
         this.Lt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ot.indexOf(t) > -1 && (e = 0);
-        var i = Or.createAndSchedule(this, t, e, n, (function(t) {
+        var i = Cr.createAndSchedule(this, t, e, n, (function(t) {
             return r.jt(t);
         }));
         return this.St.push(i), i;
     }, t.prototype.Lt = function() {
-        this.Ft && S();
+        this.xt && S();
     }, t.prototype.verifyOperationInProgress = function() {}, 
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
@@ -5565,7 +5569,7 @@ function Dr(t, e) {
 }(), Lr = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = In(t)
+        this._firestore = t, this._transaction = e, this._dataReader = An(t)
         /**
      * Reads the document referenced by the provided {@link DocumentReference}.
      *
@@ -5583,7 +5587,7 @@ function Dr(t, e) {
             throw S();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = Dr(t, this._firestore), i = mr(r.converter, e, n), o = An(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
+        var r = Dr(t, this._firestore), i = mr(r.converter, e, n), o = In(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];
@@ -5638,11 +5642,15 @@ function Dr(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */
-function jr(t, e) {
-    var n = Je(t = st(t, tn)), r = new U;
-    return new qr(new Cr, n, (function(n) {
+function Rr(t, e, n) {
+    var r = Je(t = st(t, tn)), i = Object.assign(Object.assign({}, qr), n);
+    !function(t) {
+        if (t.maxAttempts < 1) throw new M(V, "Max attempts must be at least 1");
+    }(i);
+    var o = new U;
+    return new Fr(new jr, r, i, (function(n) {
         return e(new Lr(t, n));
-    }), r).run(), r.promise
+    }), o).run(), o.promise
     /**
  * Firestore Lite
  *
@@ -5658,7 +5666,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.8", ""), a("firestore-lite", "3.4.8", "esm5");
+a("firestore-lite", "3.4.9", ""), a("firestore-lite", "3.4.9", "esm5");
 
-export { yn as Bytes, un as CollectionReference, an as DocumentReference, Qn as DocumentSnapshot, dn as FieldPath, vn as FieldValue, tn as Firestore, x as FirestoreError, gn as GeoPoint, sn as Query, $n as QueryConstraint, Kn as QueryDocumentSnapshot, Hn as QuerySnapshot, bt as Timestamp, Lr as Transaction, Vr as WriteBatch, Tr as addDoc, Ar as arrayRemove, Ir as arrayUnion, cn as collection, ln as collectionGroup, rn as connectFirestoreEmulator, _r as deleteDoc, Sr as deleteField, fn as doc, mn as documentId, lr as endAt, cr as endBefore, vr as getDoc, gr as getDocs, nn as getFirestore, kr as increment, en as initializeFirestore, rr as limit, ir as limitToLast, er as orderBy, Xn as query, pn as queryEqual, hn as refEqual, jr as runTransaction, Er as serverTimestamp, wr as setDoc, g as setLogLevel, Wn as snapshotEqual, sr as startAfter, ar as startAt, on as terminate, br as updateDoc, Zn as where, Pr as writeBatch };
+export { yn as Bytes, un as CollectionReference, an as DocumentReference, Qn as DocumentSnapshot, dn as FieldPath, vn as FieldValue, tn as Firestore, M as FirestoreError, gn as GeoPoint, sn as Query, $n as QueryConstraint, Kn as QueryDocumentSnapshot, Hn as QuerySnapshot, bt as Timestamp, Lr as Transaction, Vr as WriteBatch, Tr as addDoc, Ir as arrayRemove, Ar as arrayUnion, cn as collection, ln as collectionGroup, rn as connectFirestoreEmulator, _r as deleteDoc, Sr as deleteField, fn as doc, mn as documentId, lr as endAt, cr as endBefore, vr as getDoc, gr as getDocs, nn as getFirestore, kr as increment, en as initializeFirestore, rr as limit, ir as limitToLast, er as orderBy, Xn as query, pn as queryEqual, hn as refEqual, Rr as runTransaction, Er as serverTimestamp, wr as setDoc, g as setLogLevel, Wn as snapshotEqual, sr as startAfter, ar as startAt, on as terminate, br as updateDoc, Zn as where, Pr as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map