@firebase/firestore 3.4.8-canary.69baecadd → 3.4.8-canary.6ceff4db0

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

@@ -63,7 +63,7 @@ l.MOCK_USER = new l("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let f = "9.7.0-canary.69baecadd";
+let f = "9.7.0-canary.6ceff4db0";
 
 /**
  * @license
@@ -218,7 +218,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.
- */ const E = "ok", T = "cancelled", I = "unknown", A = "invalid-argument", R = "deadline-exceeded", P = "not-found", V = "already-exists", D = "permission-denied", N = "unauthenticated", $ = "resource-exhausted", S = "failed-precondition", F = "aborted", x = "out-of-range", q = "unimplemented", O = "internal", C = "unavailable", L = "data-loss";
+ */ const E = "ok", T = "cancelled", A = "unknown", I = "invalid-argument", R = "deadline-exceeded", P = "not-found", V = "already-exists", D = "permission-denied", N = "unauthenticated", $ = "resource-exhausted", S = "failed-precondition", x = "aborted", F = "out-of-range", q = "unimplemented", O = "internal", C = "unavailable", L = "data-loss";
 
 /** An error returned by a Firestore operation. */ class U extends FirebaseError {
     /** @hideconstructor */
@@ -570,7 +570,7 @@ class J {
         // for legacy reasons and should not be used frequently).
         const e = [];
         for (const n of t) {
-            if (n.indexOf("//") >= 0) throw new U(A, `Invalid segment (${n}). Paths must not contain // in them.`);
+            if (n.indexOf("//") >= 0) throw new U(I, `Invalid segment (${n}). Paths must not contain // in them.`);
             // Strip leading and traling slashed.
                         e.push(...n.split("/").filter((t => t.length > 0)));
         }
@@ -626,20 +626,20 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
         const e = [];
         let n = "", r = 0;
         const s = () => {
-            if (0 === n.length) throw new U(A, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
+            if (0 === n.length) throw new U(I, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
             e.push(n), n = "";
         };
         let i = !1;
         for (;r < t.length; ) {
             const e = t[r];
             if ("\\" === e) {
-                if (r + 1 === t.length) throw new U(A, "Path has trailing escape character: " + t);
+                if (r + 1 === t.length) throw new U(I, "Path has trailing escape character: " + t);
                 const e = t[r + 1];
-                if ("\\" !== e && "." !== e && "`" !== e) throw new U(A, "Path has invalid escape sequence: " + t);
+                if ("\\" !== e && "." !== e && "`" !== e) throw new U(I, "Path has invalid escape sequence: " + t);
                 n += e, r += 2;
             } else "`" === e ? (i = !i, r++) : "." !== e || i ? (n += e, r++) : (s(), r++);
         }
-        if (s(), i) throw new U(A, "Unterminated ` in path: " + t);
+        if (s(), i) throw new U(I, "Unterminated ` in path: " + t);
         return new tt(e);
     }
     static emptyPath() {
@@ -728,7 +728,7 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */ function nt(t, e, n) {
-    if (!n) throw new U(A, `Function ${t}() cannot be called with an empty ${e}.`);
+    if (!n) throw new U(I, `Function ${t}() cannot be called with an empty ${e}.`);
 }
 
 /**
@@ -740,14 +740,14 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  * an even numbers of segments).
  */
 function rt(t) {
-    if (!et.isDocumentKey(t)) throw new U(A, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
+    if (!et.isDocumentKey(t)) throw new U(I, `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 st(t) {
-    if (et.isDocumentKey(t)) throw new U(A, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
+    if (et.isDocumentKey(t)) throw new U(I, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
@@ -791,17 +791,17 @@ 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 U(A, "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 U(I, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
             const n = it(t);
-            throw new U(A, `Expected type '${e.name}', but it was: ${n}`);
+            throw new U(I, `Expected type '${e.name}', but it was: ${n}`);
         }
     }
     return t;
 }
 
 function ut(t, e) {
-    if (e <= 0) throw new U(A, `Function ${t}() requires a positive number, but it was: ${e}.`);
+    if (e <= 0) throw new U(I, `Function ${t}() requires a positive number, but it was: ${e}.`);
 }
 
 /**
@@ -899,7 +899,7 @@ var lt, ft;
  *     Code.UNKNOWN.
  */
 function dt(t) {
-    if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), I;
+    if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), A;
     // The canonical error codes for Google APIs [1] specify mapping onto HTTP
     // status codes but the mapping is not bijective. In each case of ambiguity
     // this function chooses a primary error.
@@ -932,13 +932,13 @@ function dt(t) {
 
       case 409:
         // Conflict
-        return F;
+        return x;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return x;
+        return F;
 
       case 429:
         // Too Many Requests
@@ -950,7 +950,7 @@ function dt(t) {
 
       case 500:
         // Internal Server Error
-        return I;
+        return A;
 
         // Other possibilities:
         // return Code.INTERNAL;
@@ -968,7 +968,7 @@ function dt(t) {
         return R;
 
       default:
-        return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? S : t >= 500 && t < 600 ? O : I;
+        return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? S : t >= 500 && t < 600 ? O : A;
     }
 }
 
@@ -1048,16 +1048,16 @@ class {
      * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.
      */
     constructor(t, e) {
-        super(t), this.I = e;
+        super(t), this.A = e;
     }
-    A(t, e) {
+    I(t, e) {
         throw new Error("Not supported by FetchConnection");
     }
     async v(t, e, n, r) {
         const s = JSON.stringify(r);
         let i;
         try {
-            i = await this.I(e, {
+            i = await this.A(e, {
                 method: "POST",
                 headers: n,
                 body: s
@@ -1211,11 +1211,11 @@ class gt {
      * The fractions of a second at nanosecond resolution.*
      */
     e) {
-        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new U(A, "Timestamp nanoseconds out of range: " + e);
-        if (e >= 1e9) throw new U(A, "Timestamp nanoseconds out of range: " + e);
-        if (t < -62135596800) throw new U(A, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new U(I, "Timestamp nanoseconds out of range: " + e);
+        if (e >= 1e9) throw new U(I, "Timestamp nanoseconds out of range: " + e);
+        if (t < -62135596800) throw new U(I, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new U(A, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new U(I, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
@@ -1465,13 +1465,13 @@ class Tt {
  * before being sent as a proto.
  * @internal
  */
-class It {
+class At {
     constructor(t) {
         this.binaryString = t;
     }
     static fromBase64String(t) {
         const e = atob(t);
-        return new It(e);
+        return new At(e);
     }
     static fromUint8Array(t) {
         // TODO(indexing); Remove the copy of the byte string here as this method
@@ -1488,7 +1488,7 @@ class It {
         /**
  * Helper function to convert a binary string to an Uint8Array.
  */ (t);
-        return new It(e);
+        return new At(e);
     }
     [Symbol.iterator]() {
         let t = 0;
@@ -1543,9 +1543,9 @@ class It {
     }
 }
 
-It.EMPTY_BYTE_STRING = new It("");
+At.EMPTY_BYTE_STRING = new At("");
 
-const At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const 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
@@ -1559,7 +1559,7 @@ const At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
         let e = 0;
-        const n = At.exec(t);
+        const n = It.exec(t);
         if (b(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = n[1];
@@ -1587,7 +1587,7 @@ const 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 Vt(t) {
-    return "string" == typeof t ? It.fromBase64String(t) : It.fromUint8Array(t);
+    return "string" == typeof t ? At.fromBase64String(t) : At.fromUint8Array(t);
 }
 
 /**
@@ -1669,7 +1669,7 @@ const At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 };
 
 /** Extracts the backend's type order for the provided value. */
-function Ft(t) {
+function xt(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 ? Dt(t) ? 4 /* ServerTimestampValue */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
@@ -1697,10 +1697,10 @@ function Ft(t) {
  */ (t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : g();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function xt(t, e) {
+/** Tests `left` and `right` for equality based on the backend semantics. */ function Ft(t, e) {
     if (t === e) return !0;
-    const n = Ft(t);
-    if (n !== Ft(e)) return !1;
+    const n = xt(t);
+    if (n !== xt(e)) return !1;
     switch (n) {
       case 0 /* NullValue */ :
       case 9007199254740991 /* MaxValue */ :
@@ -1748,13 +1748,13 @@ function Ft(t) {
         }(t, e);
 
       case 9 /* ArrayValue */ :
-        return _t(t.arrayValue.values || [], e.arrayValue.values || [], xt);
+        return _t(t.arrayValue.values || [], e.arrayValue.values || [], Ft);
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
             const n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
             if (vt(n) !== vt(r)) return !1;
-            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !xt(n[t], r[t]))) return !1;
+            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Ft(n[t], r[t]))) return !1;
             return !0;
         }
         /** Returns true if the ArrayValue contains the specified element. */ (t, e);
@@ -1765,12 +1765,12 @@ function Ft(t) {
 }
 
 function qt(t, e) {
-    return void 0 !== (t.values || []).find((t => xt(t, e)));
+    return void 0 !== (t.values || []).find((t => Ft(t, e)));
 }
 
 function Ot(t, e) {
     if (t === e) return 0;
-    const n = Ft(t), r = Ft(e);
+    const n = xt(t), r = xt(e);
     if (n !== r) return yt(n, r);
     switch (n) {
       case 0 /* NullValue */ :
@@ -1969,7 +1969,7 @@ class zt {
         Mt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }
     isEqual(t) {
-        return xt(this.value, t.value);
+        return Ft(this.value, t.value);
     }
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -2166,7 +2166,7 @@ class Yt extends class {} {
     matches(t) {
         const 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(Ot(e, this.value)) : null !== e && Ft(this.value) === Ft(e) && this.D(Ot(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.D(Ot(e, this.value)) : null !== e && xt(this.value) === xt(e) && this.D(Ot(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
     D(t) {
@@ -2311,7 +2311,7 @@ function oe(t, e) {
     if (null === e) return !1;
     if (t.inclusive !== e.inclusive || t.position.length !== e.position.length) return !1;
     for (let n = 0; n < t.position.length; n++) {
-        if (!xt(t.position[n], e.position[n])) return !1;
+        if (!Ft(t.position[n], e.position[n])) return !1;
     }
     return !0;
 }
@@ -2425,7 +2425,7 @@ function de(t, e) {
         for (let n = 0; n < t.orderBy.length; n++) if (!ie(t.orderBy[n], e.orderBy[n])) return !1;
         if (t.filters.length !== e.filters.length) return !1;
         for (let s = 0; s < t.filters.length; s++) if (n = t.filters[s], r = e.filters[s], 
-        n.op !== r.op || !n.field.isEqual(r.field) || !xt(n.value, r.value)) return !1;
+        n.op !== r.op || !n.field.isEqual(r.field) || !Ft(n.value, r.value)) return !1;
         var n, r;
         return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!oe(t.startAt, e.startAt) && oe(t.endAt, e.endAt);
     }(fe(t), fe(e)) && t.limitType === e.limitType;
@@ -2648,14 +2648,14 @@ function we(t, e) {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ class Ie extends Ee {
+ */ class Ae extends Ee {
     constructor(t, e, n, r, s = []) {
         super(), this.key = t, this.data = e, this.fieldMask = n, this.precondition = r, 
         this.fieldTransforms = s, this.type = 1 /* Patch */;
     }
 }
 
-/** A mutation that deletes the document at the given key. */ class Ae extends Ee {
+/** A mutation that deletes the document at the given key. */ class Ie extends Ee {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 2 /* Delete */ , this.fieldTransforms = [];
     }
@@ -2764,21 +2764,21 @@ function Se(t, e) {
     return Ne(t, e.toTimestamp());
 }
 
-function Fe(t) {
+function xe(t) {
     return b(!!t), bt.fromTimestamp(function(t) {
         const e = Rt(t);
         return new gt(e.seconds, e.nanos);
     }(t));
 }
 
-function xe(t, e) {
+function Fe(t, e) {
     return function(t) {
         return new X([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
 function qe(t, e) {
-    return xe(t.databaseId, e.path);
+    return Fe(t.databaseId, e.path);
 }
 
 function Oe(t, e) {
@@ -2786,14 +2786,14 @@ function Oe(t, e) {
         const e = X.fromString(t);
         return b(We(e)), e;
     }(e);
-    if (n.get(1) !== t.databaseId.projectId) throw new U(A, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
-    if (n.get(3) !== t.databaseId.database) throw new U(A, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
+    if (n.get(1) !== t.databaseId.projectId) throw new U(I, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
+    if (n.get(3) !== t.databaseId.database) throw new U(I, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
     return new et((b((r = n).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
     var r;
     /** Creates a Document proto from key and fields (but no create/update time) */}
 
 function Ce(t, e) {
-    return xe(t.databaseId, e);
+    return Fe(t.databaseId, e);
 }
 
 function Le(t) {
@@ -2810,7 +2810,7 @@ function Ue(t, e, n) {
 function ke(t, e) {
     return "found" in e ? function(t, e) {
         b(!!e.found), e.found.name, e.found.updateTime;
-        const n = Oe(t, e.found.name), r = Fe(e.found.updateTime), s = new zt({
+        const n = Oe(t, e.found.name), r = xe(e.found.updateTime), s = new zt({
             mapValue: {
                 fields: e.found.fields
             }
@@ -2818,7 +2818,7 @@ function ke(t, e) {
         return Gt.newFoundDocument(n, r, s);
     }(t, e) : "missing" in e ? function(t, e) {
         b(!!e.missing), b(!!e.readTime);
-        const n = Oe(t, e.missing), r = Fe(e.readTime);
+        const n = Oe(t, e.missing), r = xe(e.readTime);
         return Gt.newNoDocument(n, r);
     }(t, e) : g();
 }
@@ -2827,9 +2827,9 @@ function je(t, e) {
     let n;
     if (e instanceof Te) n = {
         update: Ue(t, e.key, e.value)
-    }; else if (e instanceof Ae) n = {
-        delete: qe(t, e.key)
     }; else if (e instanceof Ie) n = {
+        delete: qe(t, e.key)
+    }; else if (e instanceof Ae) n = {
         update: Ue(t, e.key, e.data),
         updateMask: Qe(e.fieldMask)
     }; else {
@@ -3141,13 +3141,13 @@ class Ke extends class {} {
     /** Invokes the provided RPC with auth and AppCheck tokens. */    m(t, e, n) {
         return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.K.m(t, e, n, r, s))).catch((t => {
             throw "FirebaseError" === t.name ? (t.code === N && (this.authCredentials.invalidateToken(), 
-            this.appCheckCredentials.invalidateToken()), t) : new U(I, t.toString());
+            this.appCheckCredentials.invalidateToken()), t) : new U(A, t.toString());
         }));
     }
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */    T(t, e, n) {
         return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.K.T(t, e, n, r, s))).catch((t => {
             throw "FirebaseError" === t.name ? (t.code === N && (this.authCredentials.invalidateToken(), 
-            this.appCheckCredentials.invalidateToken()), t) : new U(I, t.toString());
+            this.appCheckCredentials.invalidateToken()), t) : new U(A, t.toString());
         }));
     }
     terminate() {
@@ -3184,7 +3184,7 @@ async function Ze(t, e) {
     return (await n.T("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, e, n) {
-        const r = Oe(t, e.name), s = Fe(e.updateTime), i = new zt({
+        const r = Oe(t, e.name), s = xe(e.updateTime), i = new zt({
             mapValue: {
                 fields: e.fields
             }
@@ -3263,17 +3263,17 @@ class nn {
     constructor(t) {
         var e;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new U(A, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new U(I, "Can't provide ssl option if host option is not set");
             this.host = "firestore.googleapis.com", this.ssl = true;
         } 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 U(A, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new U(I, "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 U(A, `${t} and ${n} cannot be used together.`);
+            if (!0 === e && !0 === r) throw new U(I, `${t} and ${n} cannot be used together.`);
         }("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
     }
     isEqual(t) {
@@ -3311,7 +3311,7 @@ class nn {
         this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new nn({}), 
         this._settingsFrozen = !1, t instanceof K ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
-            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(A, '"projectId" not provided in firebase.initializeApp.');
+            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(I, '"projectId" not provided in firebase.initializeApp.');
             return new K(t.options.projectId);
         }
         /**
@@ -3354,7 +3354,7 @@ class nn {
                 return t.client;
 
               default:
-                throw new U(A, "makeAuthCredentialsProvider failed due to invalid credential type");
+                throw new U(I, "makeAuthCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }
@@ -3434,7 +3434,7 @@ function sn(t, e) {
             // invalid field "uid" and missing field "sub" / "user_id".)
             e = createMockUserToken(r.mockUserToken, null === (s = t._app) || void 0 === s ? void 0 : s.options.projectId);
             const i = r.mockUserToken.sub || r.mockUserToken.user_id;
-            if (!i) throw new U(A, "mockUserToken must contain 'sub' or 'user_id' field!");
+            if (!i) throw new U(I, "mockUserToken must contain 'sub' or 'user_id' field!");
             n = new l(i);
         }
         t._authCredentials = new B(new j(e, n));
@@ -3594,7 +3594,7 @@ function fn(t, e, ...n) {
         return st(r), new ln(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof an || t instanceof ln)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof an || t instanceof ln)) throw new U(I, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(X.fromString(e, ...n));
         return st(r), new ln(t.firestore, 
         /* converter= */ null, r);
@@ -3614,7 +3614,7 @@ function fn(t, e, ...n) {
  * will be included. Cannot contain a slash.
  * @returns The created `Query`.
  */ function dn(t, e) {
-    if (t = ot(t, rn), nt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new U(A, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    if (t = ot(t, rn), nt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new U(I, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
     return new hn(t, 
     /* converter= */ null, 
     /**
@@ -3636,7 +3636,7 @@ function wn(t, e, ...n) {
         /* converter= */ null, new et(r));
     }
     {
-        if (!(t instanceof an || t instanceof ln)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof an || t instanceof ln)) throw new U(I, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(X.fromString(e, ...n));
         return rt(r), new an(t.firestore, t instanceof ln ? t.converter : null, new et(r));
     }
@@ -3696,7 +3696,7 @@ function wn(t, e, ...n) {
      * @param fieldNames - A list of field names.
      */
     constructor(...t) {
-        for (let e = 0; e < t.length; ++e) if (0 === t[e].length) throw new U(A, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        for (let e = 0; e < t.length; ++e) if (0 === t[e].length) throw new U(I, "Invalid field name at argument $(i + 1). Field names must not be empty.");
         this._internalPath = new tt(t);
     }
     /**
@@ -3746,9 +3746,9 @@ function wn(t, e, ...n) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new gn(It.fromBase64String(t));
+            return new gn(At.fromBase64String(t));
         } catch (t) {
-            throw new U(A, "Failed to construct data from Base64 string: " + t);
+            throw new U(I, "Failed to construct data from Base64 string: " + t);
         }
     }
     /**
@@ -3756,7 +3756,7 @@ function wn(t, e, ...n) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new gn(It.fromUint8Array(t));
+        return new gn(At.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3848,8 +3848,8 @@ function wn(t, e, ...n) {
      * @param longitude - The longitude as number between -180 and 180.
      */
     constructor(t, e) {
-        if (!isFinite(t) || t < -90 || t > 90) throw new U(A, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(e) || e < -180 || e > 180) throw new U(A, "Longitude must be a number between -180 and 180, but was: " + e);
+        if (!isFinite(t) || t < -90 || t > 90) throw new U(I, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(e) || e < -180 || e > 180) throw new U(I, "Longitude must be a number between -180 and 180, but was: " + e);
         this._lat = t, this._long = e;
     }
     /**
@@ -3906,22 +3906,22 @@ function wn(t, e, ...n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return null !== this.fieldMask ? new Ie(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Te(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new Ae(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Te(t, this.data, e, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class In {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class An {
     constructor(t, 
     // The fieldMask does not include document transforms.
     e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return new Ie(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new Ae(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }
 }
 
-function An(t) {
+function In(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -4010,7 +4010,7 @@ function An(t) {
     }
     st(t) {
         if (0 === t.length) throw this.ut("Document fields must not be empty");
-        if (An(this.tt) && En.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
+        if (In(this.tt) && En.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
     }
 }
 
@@ -4047,7 +4047,7 @@ function Vn(t) {
         const t = [];
         for (const r of i.mergeFields) {
             const s = Bn(e, r, n);
-            if (!o.contains(s)) throw new U(A, `Field '${s}' is specified in your field mask but missing from your input data.`);
+            if (!o.contains(s)) throw new U(I, `Field '${s}' is specified in your field mask but missing from your input data.`);
             Wn(t, s) || t.push(s);
         }
         c = new Tt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
@@ -4100,7 +4100,7 @@ class Sn extends bn {
     }
 }
 
-class Fn extends bn {
+class xn extends bn {
     constructor(t, e) {
         super(t), this.lt = e;
     }
@@ -4115,7 +4115,7 @@ class Fn extends bn {
     }
 }
 
-class xn extends bn {
+class Fn extends bn {
     constructor(t, e) {
         super(t), this.lt = e;
     }
@@ -4162,12 +4162,12 @@ class qn extends bn {
         }
     }));
     const u = new Tt(i);
-    return new In(o, u, s.fieldTransforms);
+    return new An(o, u, s.fieldTransforms);
 }
 
 /** Parse update data from a list of field/value arguments. */ function Cn(t, e, n, r, s, i) {
     const o = t.ht(1 /* Update */ , e, n), u = [ Bn(e, r, n) ], c = [ s ];
-    if (i.length % 2 != 0) throw new U(A, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
+    if (i.length % 2 != 0) throw new U(I, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
     for (let t = 0; t < i.length; t += 2) u.push(Bn(e, i[t])), c.push(i[t + 1]);
     const a = [], l = zt.empty();
     // We iterate in reverse order to pick the last value for a field if the
@@ -4187,7 +4187,7 @@ class qn extends bn {
         }
     }
     const f = new Tt(a);
-    return new In(l, f, o.fieldTransforms);
+    return new An(l, f, o.fieldTransforms);
 }
 
 /**
@@ -4225,7 +4225,7 @@ class qn extends bn {
  */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!An(e.tt)) throw e.ut(`${t._methodName}() can only be used with update() and set()`);
+        if (!In(e.tt)) throw e.ut(`${t._methodName}() can only be used with update() and set()`);
         if (!e.path) throw e.ut(`${t._methodName}() is not currently supported inside arrays`);
         const n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
@@ -4309,7 +4309,7 @@ class qn extends bn {
             const n = e.databaseId, r = t.firestore._databaseId;
             if (!r.isEqual(n)) throw e.ut(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${n.projectId}/${n.database}`);
             return {
-                referenceValue: xe(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: Fe(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
         throw e.ut(`Unsupported field value: ${it(t)}`);
@@ -4398,7 +4398,7 @@ function Qn(t, e, n, r, s) {
     n && (u += " (via `toFirestore()`)"), u += ". ";
     let c = "";
     return (i || o) && (c += " (found", i && (c += ` in field ${r}`), o && (c += ` in document ${s}`), 
-    c += ")"), new U(A, u + t + c);
+    c += ")"), new U(I, u + t + c);
 }
 
 /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Wn(t, e) {
@@ -4607,7 +4607,7 @@ class er extends Zn {
         const e = Vn(t.firestore), n = function(t, e, n, r, s, i, o) {
             let u;
             if (s.isKeyField()) {
-                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new U(A, `Invalid Query. You can't perform '${i}' queries on documentId().`);
+                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new U(I, `Invalid Query. You can't perform '${i}' queries on documentId().`);
                 if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
                     pr(o, i);
                     const e = [];
@@ -4625,7 +4625,7 @@ class er extends Zn {
             return function(t, e) {
                 if (e.N()) {
                     const n = ae(t);
-                    if (null !== n && !n.isEqual(e.field)) throw new U(A, `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 U(I, `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()}'`);
                     const r = ce(t);
                     null !== r && yr(t, e.field, r);
                 }
@@ -4668,7 +4668,7 @@ class er extends Zn {
                 }(e.op));
                 if (null !== n) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
-                throw n === e.op ? new U(A, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new U(A, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
+                throw n === e.op ? new U(I, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new U(I, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
             }(t, c), c;
         }(t._query, "where", e, t.firestore._databaseId, this.dt, this.wt, this.yt);
         return new hn(t.firestore, t.converter, function(t, e) {
@@ -4699,8 +4699,8 @@ class rr extends Zn {
     }
     _apply(t) {
         const e = function(t, e, n) {
-            if (null !== t.startAt) throw new U(A, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
-            if (null !== t.endAt) throw new U(A, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            if (null !== t.startAt) throw new U(I, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new U(I, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
             const r = new se(e, n);
             return function(t, e) {
                 if (null === ce(t)) {
@@ -4830,10 +4830,10 @@ function dr(...t) {
         // results.
                 for (const n of le(t)) if (n.field.isKeyField()) i.push(Lt(e, r.key)); else {
             const t = r.data.field(n.field);
-            if (Dt(t)) throw new U(A, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+            if (Dt(t)) throw new U(I, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
             if (null === t) {
                 const t = n.field.canonicalString();
-                throw new U(A, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
+                throw new U(I, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
             }
             i.push(t);
         }
@@ -4847,15 +4847,15 @@ function dr(...t) {
         return function(t, e, n, r, s, i) {
             // Use explicit order by's because it has to match the query the user made
             const o = t.explicitOrderBy;
-            if (s.length > o.length) throw new U(A, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
+            if (s.length > o.length) throw new U(I, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
             const u = [];
             for (let i = 0; i < s.length; i++) {
                 const c = s[i];
                 if (o[i].field.isKeyField()) {
-                    if ("string" != typeof c) throw new U(A, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
-                    if (!he(t) && -1 !== c.indexOf("/")) throw new U(A, `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 U(I, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
+                    if (!he(t) && -1 !== c.indexOf("/")) throw new U(I, `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.`);
                     const n = t.path.child(X.fromString(c));
-                    if (!et.isDocumentKey(n)) throw new U(A, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
+                    if (!et.isDocumentKey(n)) throw new U(I, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
                     const s = new et(n);
                     u.push(Lt(e, s));
                 } else {
@@ -4875,26 +4875,26 @@ function dr(...t) {
 
 function mr(t, e, n) {
     if ("string" == typeof (n = getModularInstance(n))) {
-        if ("" === n) throw new U(A, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!he(e) && -1 !== n.indexOf("/")) throw new U(A, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
+        if ("" === n) throw new U(I, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!he(e) && -1 !== n.indexOf("/")) throw new U(I, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
         const r = e.path.child(X.fromString(n));
-        if (!et.isDocumentKey(r)) throw new U(A, `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}).`);
+        if (!et.isDocumentKey(r)) throw new U(I, `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 Lt(t, new et(r));
     }
     if (n instanceof an) return Lt(t, n._key);
-    throw new U(A, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${it(n)}.`);
+    throw new U(I, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${it(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 U(A, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);
-    if (t.length > 10) throw new U(A, `Invalid Query. '${e.toString()}' filters support a maximum of 10 elements in the value array.`);
+    if (!Array.isArray(t) || 0 === t.length) throw new U(I, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);
+    if (t.length > 10) throw new U(I, `Invalid Query. '${e.toString()}' filters support a maximum of 10 elements in the value array.`);
 }
 
 function yr(t, e, n) {
-    if (!n.isEqual(e)) throw new U(A, `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 U(I, `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.`);
 }
 
 /**
@@ -4955,7 +4955,7 @@ function _r(t, e, n) {
 
 class gr extends class {
     convertValue(t, e = "none") {
-        switch (Ft(t)) {
+        switch (xt(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -5116,8 +5116,8 @@ function Tr(t, e, n, ...r) {
  * @param reference - A reference to the document to delete.
  * @returns A `Promise` resolved once the document has been successfully
  * deleted from the backend.
- */ function Ir(t) {
-    return Je(en((t = ot(t, an)).firestore), [ new Ae(t._key, ve.none()) ]);
+ */ function Ar(t) {
+    return Je(en((t = ot(t, an)).firestore), [ new Ie(t._key, ve.none()) ]);
 }
 
 /**
@@ -5134,7 +5134,7 @@ function Tr(t, e, n, ...r) {
  * @throws Error - If the provided input is not a valid Firestore document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function Ar(t, e) {
+ */ function Ir(t, e) {
     const n = wn(t = ot(t, ln)), r = _r(t.converter, e), s = Dn(Vn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
     return Je(en(t.firestore), [ s.toMutation(n._key, ve.exists(!1)) ]).then((() => n));
 }
@@ -5183,7 +5183,7 @@ function Tr(t, e, n, ...r) {
  */ function Vr(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-    return new Fn("arrayUnion", t);
+    return new xn("arrayUnion", t);
 }
 
 /**
@@ -5199,7 +5199,7 @@ function Tr(t, e, n, ...r) {
  */ function Dr(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-    return new xn("arrayRemove", t);
+    return new Fn("arrayRemove", t);
 }
 
 /**
@@ -5275,7 +5275,7 @@ function Tr(t, e, n, ...r) {
      */    delete(t) {
         this._verifyNotCommitted();
         const e = Sr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Ae(e._key, ve.none())), this;
+        return this._mutations = this._mutations.concat(new Ie(e._key, ve.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5297,7 +5297,7 @@ function Tr(t, e, n, ...r) {
 }
 
 function Sr(t, e) {
-    if ((t = getModularInstance(t)).firestore !== e) throw new U(A, "Provided document reference is from a different Firestore instance.");
+    if ((t = getModularInstance(t)).firestore !== e) throw new U(I, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -5313,7 +5313,7 @@ function Sr(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Fr(t) {
+ */ function xr(t) {
     const e = en(t = ot(t, rn));
     return new $r(t, (t => Je(e, t)));
 }
@@ -5337,7 +5337,7 @@ function Sr(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ class xr {
+ */ class Fr {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5356,7 +5356,7 @@ function Sr(t, e) {
         this.writtenDocs = new Set;
     }
     async lookup(t) {
-        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(A, "Firestore transactions require all reads to be executed before all writes.");
+        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(I, "Firestore transactions require all reads to be executed before all writes.");
         const e = await Xe(this.datastore, t);
         return e.forEach((t => this.recordVersion(t))), e;
     }
@@ -5372,7 +5372,7 @@ function Sr(t, e) {
         this.writtenDocs.add(t.toString());
     }
     delete(t) {
-        this.write(new Ae(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Ie(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }
     async commit() {
         if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
@@ -5399,7 +5399,7 @@ function Sr(t, e) {
         if (n) {
             if (!e.isEqual(n)) 
             // This transaction will fail no matter what.
-            throw new U(F, "Document version changed between two reads.");
+            throw new U(x, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }
     /**
@@ -5426,7 +5426,7 @@ function Sr(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 U(A, "Can't update a document that doesn't exist.");
+            throw new U(I, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
                         return ve.updateTime(e);
         }
@@ -5440,6 +5440,25 @@ function Sr(t, e) {
     ensureCommitNotCalled() {}
 }
 
+/**
+ * @license
+ * 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.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * 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.
+ */ const qr = {
+    maxAttempts: 5
+};
+
 /**
  * @license
  * Copyright 2019 Google LLC
@@ -5460,17 +5479,17 @@ function Sr(t, e) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class qr {
-    constructor(t, e, n, r) {
-        this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = r, 
-        this.Tt = 5, this.It = new He(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+class Or {
+    constructor(t, e, n, r, s) {
+        this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
+        this.deferred = s, this.Tt = n.maxAttempts, this.At = new He(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
-        this.Tt -= 1, this.At();
+        this.Tt -= 1, this.It();
     }
-    At() {
-        this.It.W((async () => {
-            const t = new xr(this.datastore), e = this.Rt(t);
+    It() {
+        this.At.W((async () => {
+            const t = new Fr(this.datastore), e = this.Rt(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
@@ -5493,7 +5512,7 @@ class qr {
         }
     }
     Pt(t) {
-        this.Tt > 0 && this.Vt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((() => (this.At(), 
+        this.Tt > 0 && this.Vt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((() => (this.It(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
     Vt(t) {
@@ -5514,7 +5533,7 @@ class qr {
                     return g();
 
                   case T:
-                  case I:
+                  case A:
                   case R:
                   case $:
                   case O:
@@ -5524,7 +5543,7 @@ class qr {
                                       case N:
                     return !1;
 
-                  case A:
+                  case I:
                   case P:
                   case V:
                   case D:
@@ -5532,8 +5551,8 @@ class qr {
  // Aborted might be retried in some scenarios, but that is dependant on
                     // the context and should handled individually by the calling code.
                     // See https://cloud.google.com/apis/design/errors.
-                                      case F:
-                  case x:
+                                      case x:
+                  case F:
                   case q:
                   case L:
                     return !0;
@@ -5560,7 +5579,7 @@ class qr {
  * 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 Or() {
+/** The Platform's 'document' implementation or null if not available. */ function Cr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5592,7 +5611,7 @@ class qr {
  * Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type
  * in newer versions of TypeScript defines `finally`, which is not available in
  * IE.
- */ class Cr {
+ */ class Lr {
     constructor(t, e, n, r, s) {
         this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = r, this.removalCallback = s, 
         this.deferred = new k, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
@@ -5615,7 +5634,7 @@ class qr {
      *   PORTING NOTE: This exists to prevent making removeDelayedOperation() and
      *   the DelayedOperation class public.
      */    static createAndSchedule(t, e, n, r, s) {
-        const i = Date.now() + n, o = new Cr(t, e, i, r, s);
+        const i = Date.now() + n, o = new Lr(t, e, i, r, s);
         return o.start(n), o;
     }
     /**
@@ -5664,7 +5683,7 @@ class qr {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class Lr {
+ */ class Ur {
     constructor() {
         // The last promise in the queue.
         this.Dt = Promise.resolve(), 
@@ -5678,24 +5697,24 @@ class qr {
         // 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 He(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.At = new He(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 = () => {
-            const t = Or();
-            t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
+            const t = Cr();
+            t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.At.H();
         };
-        const t = Or();
+        const t = Cr();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ct);
     }
     get isShuttingDown() {
@@ -5716,7 +5735,7 @@ class qr {
     enterRestrictedMode(t) {
         if (!this.$t) {
             this.$t = !0, this.qt = t || !1;
-            const e = Or();
+            const e = Cr();
             e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ct);
         }
     }
@@ -5740,7 +5759,7 @@ class qr {
      */    async kt() {
         if (0 !== this.Nt.length) {
             try {
-                await this.Nt[0](), this.Nt.shift(), this.It.reset();
+                await this.Nt[0](), this.Nt.shift(), this.At.reset();
             } catch (t) {
                 if (!
                 /**
@@ -5795,12 +5814,12 @@ class qr {
             // 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((() => this.kt()));
+            this.At.W((() => this.kt()));
         }
     }
     Ut(t) {
-        const e = this.Dt.then((() => (this.xt = !0, t().catch((t => {
-            this.Ft = t, this.xt = !1;
+        const e = this.Dt.then((() => (this.Ft = !0, t().catch((t => {
+            this.xt = t, this.Ft = !1;
             const e = 
             /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -5841,18 +5860,18 @@ class qr {
             // all further attempts to chain (via .then) will just short-circuit
             // and return the rejected Promise.
             throw p("INTERNAL UNHANDLED ERROR: ", e), t;
-        })).then((t => (this.xt = !1, t))))));
+        })).then((t => (this.Ft = !1, t))))));
         return this.Dt = e, e;
     }
     enqueueAfterDelay(t, e, n) {
         this.Lt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ot.indexOf(t) > -1 && (e = 0);
-        const r = Cr.createAndSchedule(this, t, e, n, (t => this.jt(t)));
+        const r = Lr.createAndSchedule(this, t, e, n, (t => this.jt(t)));
         return this.St.push(r), r;
     }
     Lt() {
-        this.Ft && g();
+        this.xt && g();
     }
     verifyOperationInProgress() {}
     /**
@@ -5902,7 +5921,7 @@ class qr {
     }
 }
 
-class Ur {
+class kr {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._transaction = e, this._dataReader = Vn(t);
@@ -5961,9 +5980,13 @@ class Ur {
  * (the `updateFunction` returned a failed promise), the promise returned by the
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
- */ function kr(t, e) {
-    const n = en(t = ot(t, rn)), r = new k;
-    return new qr(new Lr, n, (n => e(new Ur(t, n))), r).run(), r.promise;
+ */ function jr(t, e, n) {
+    const r = en(t = ot(t, rn)), s = Object.assign(Object.assign({}, qr), n);
+    !function(t) {
+        if (t.maxAttempts < 1) throw new U(I, "Max attempts must be at least 1");
+    }(s);
+    const i = new k;
+    return new Or(new Ur, r, s, (n => e(new kr(t, n))), i).run(), i.promise;
 }
 
 /**
@@ -5980,7 +6003,7 @@ class Ur {
     return e && r._setSettings(e), r;
 }), "PUBLIC")), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-registerVersion("firestore-lite", "3.4.8-canary.69baecadd", ""), registerVersion("firestore-lite", "3.4.8-canary.69baecadd", "esm2017");
+registerVersion("firestore-lite", "3.4.8-canary.6ceff4db0", ""), registerVersion("firestore-lite", "3.4.8-canary.6ceff4db0", "esm2017");
 
-export { gn as Bytes, ln as CollectionReference, an as DocumentReference, Yn as DocumentSnapshot, yn as FieldPath, bn as FieldValue, rn as Firestore, U as FirestoreError, vn as GeoPoint, hn as Query, Zn as QueryConstraint, Hn as QueryDocumentSnapshot, Kn as QuerySnapshot, gt as Timestamp, Ur as Transaction, $r as WriteBatch, Ar as addDoc, Dr as arrayRemove, Vr as arrayUnion, fn as collection, dn as collectionGroup, un as connectFirestoreEmulator, Ir as deleteDoc, Rr as deleteField, wn as doc, _n as documentId, dr as endAt, fr as endBefore, br as getDoc, vr as getDocs, on as getFirestore, Nr as increment, sn as initializeFirestore, or as limit, ur as limitToLast, sr as orderBy, tr as query, pn as queryEqual, mn as refEqual, kr as runTransaction, Pr as serverTimestamp, Er as setDoc, w as setLogLevel, Jn as snapshotEqual, hr as startAfter, ar as startAt, cn as terminate, Tr as updateDoc, nr as where, Fr as writeBatch };
+export { gn as Bytes, ln as CollectionReference, an as DocumentReference, Yn as DocumentSnapshot, yn as FieldPath, bn as FieldValue, rn as Firestore, U as FirestoreError, vn as GeoPoint, hn as Query, Zn as QueryConstraint, Hn as QueryDocumentSnapshot, Kn as QuerySnapshot, gt as Timestamp, kr as Transaction, $r as WriteBatch, Ir as addDoc, Dr as arrayRemove, Vr as arrayUnion, fn as collection, dn as collectionGroup, un as connectFirestoreEmulator, Ar as deleteDoc, Rr as deleteField, wn as doc, _n as documentId, dr as endAt, fr as endBefore, br as getDoc, vr as getDocs, on as getFirestore, Nr as increment, sn as initializeFirestore, or as limit, ur as limitToLast, sr as orderBy, tr as query, pn as queryEqual, mn as refEqual, jr as runTransaction, Pr as serverTimestamp, Er as setDoc, w as setLogLevel, Jn as snapshotEqual, hr as startAfter, ar as startAt, cn as terminate, Tr as updateDoc, nr as where, xr as writeBatch };
 //# sourceMappingURL=index.browser.esm2017.js.map