@firebase/firestore 3.12.0-20230511201449 → 3.12.0

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

@@ -67,7 +67,7 @@ v.MOCK_USER = new v("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var g = "9.22.0-20230511201449", w = new l("@firebase/firestore");
+var g = "9.22.0", w = new l("@firebase/firestore");
 
 /**
  * @license
@@ -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 P = "cancelled", F = "unknown", O = "invalid-argument", V = "deadline-exceeded", D = "not-found", N = "permission-denied", q = "unauthenticated", R = "resource-exhausted", x = "failed-precondition", C = "aborted", j = "out-of-range", L = "unimplemented", M = "internal", U = "unavailable", B = /** @class */ function(e) {
+ */ var F = "cancelled", P = "unknown", O = "invalid-argument", V = "deadline-exceeded", D = "not-found", N = "permission-denied", q = "unauthenticated", R = "resource-exhausted", x = "failed-precondition", C = "aborted", j = "out-of-range", L = "unimplemented", M = "internal", U = "unavailable", B = /** @class */ function(e) {
     /** @hideconstructor */
     function n(
     /**
@@ -826,7 +826,7 @@ function pt(t) {
  *     Code.UNKNOWN.
  */
 function gt(t) {
-    if (void 0 === t) return T("RPC_ERROR", "HTTP error has no status"), F;
+    if (void 0 === t) return T("RPC_ERROR", "HTTP error has no status"), P;
     // 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.
@@ -872,11 +872,11 @@ function gt(t) {
 
       case 499:
         // Client Closed Request
-        return P;
+        return F;
 
       case 500:
         // Internal Server Error
-        return F;
+        return P;
 
         // Other possibilities:
         // return Code.INTERNAL;
@@ -894,7 +894,7 @@ function gt(t) {
         return V;
 
       default:
-        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? x : t >= 500 && t < 600 ? M : F;
+        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? x : t >= 500 && t < 600 ? M : P;
     }
 }
 
@@ -1187,7 +1187,7 @@ function It(t, e) {
         return (t = e.apply(this, arguments) || this).name = "Base64DecodeError", t;
     }
     return t(n, e), n;
-}(Error), Pt = /** @class */ function() {
+}(Error), Ft = /** @class */ function() {
     function t(t) {
         this.binaryString = t;
     }
@@ -1286,9 +1286,9 @@ function It(t, e) {
  * the proto byte string in a common class that must be converted into a string
  * before being sent as a proto.
  * @internal
- */ Pt.EMPTY_BYTE_STRING = new Pt("");
+ */ Ft.EMPTY_BYTE_STRING = new Ft("");
 
-var Ft = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+var Pt = 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
@@ -1301,7 +1301,7 @@ var Ft = 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 = Ft.exec(t);
+        var e = 0, n = Pt.exec(t);
         if (I(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             var r = n[1];
@@ -1329,7 +1329,7 @@ var Ft = 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 ? Pt.fromBase64String(t) : Pt.fromUint8Array(t);
+    return "string" == typeof t ? Ft.fromBase64String(t) : Ft.fromUint8Array(t);
 }
 
 /**
@@ -2833,7 +2833,7 @@ function Se(t) {
     return e.O;
 }
 
-function Pe(t, e) {
+function Fe(t, e) {
     e.getFirstInequalityField(), Se(t);
     var n = t.filters.concat([ e ]);
     return new Te(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
@@ -2864,7 +2864,7 @@ function Pe(t, e) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function Fe(t, e) {
+function Pe(t, e) {
     return function(t) {
         return "number" == typeof t && Number.isInteger(t) && !dt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
@@ -3350,7 +3350,7 @@ function ln(t) {
             return r.connection.v(t, e, n, o, a);
         })).catch((function(t) {
             throw "FirebaseError" === t.name ? (t.code === q && (r.authCredentials.invalidateToken(), 
-            r.appCheckCredentials.invalidateToken()), t) : new B(F, t.toString());
+            r.appCheckCredentials.invalidateToken()), t) : new B(P, t.toString());
         }));
     }, 
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */ n.prototype.R = function(t, e, n, r) {
@@ -3360,7 +3360,7 @@ function ln(t) {
             return i.connection.R(t, e, n, a, u, r);
         })).catch((function(t) {
             throw "FirebaseError" === t.name ? (t.code === q && (i.authCredentials.invalidateToken(), 
-            i.appCheckCredentials.invalidateToken()), t) : new B(F, t.toString());
+            i.appCheckCredentials.invalidateToken()), t) : new B(P, t.toString());
         }));
     }, n.prototype.terminate = function() {
         this.J = !0;
@@ -3864,7 +3864,7 @@ t, e) {
          * The collection this `DocumentReference` belongs to.
          */
         get: function() {
-            return new Pn(this.firestore, this.converter, this._key.path.popLast());
+            return new Fn(this.firestore, this.converter, this._key.path.popLast());
         },
         enumerable: !1,
         configurable: !0
@@ -3886,7 +3886,7 @@ t, e) {
     return t.prototype.withConverter = function(e) {
         return new t(this.firestore, e, this._query);
     }, t;
-}(), Pn = /** @class */ function(e) {
+}(), Fn = /** @class */ function(e) {
     /** @hideconstructor */
     function n(t, n, r) {
         var i = this;
@@ -3929,15 +3929,15 @@ t, e) {
 
 /**
  * The results of executing an aggregation query.
- */ function Fn(t, e) {
+ */ function Pn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
     if (t = p(t), ot("collection", "path", e), t instanceof wn) {
         var o = et.fromString.apply(et, r([ e ], n, !1));
-        return ut(o), new Pn(t, /* converter= */ null, o);
+        return ut(o), new Fn(t, /* converter= */ null, o);
     }
-    if (!(t instanceof In || t instanceof Pn)) throw new B(O, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    if (!(t instanceof In || t instanceof Fn)) throw new B(O, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
     var a = t._path.child(et.fromString.apply(et, r([ e ], n, !1)));
-    return ut(a), new Pn(t.firestore, 
+    return ut(a), new Fn(t.firestore, 
     /* converter= */ null, a);
 }
 
@@ -3971,9 +3971,9 @@ function Vn(t, e) {
         return at(o), new In(t, 
         /* converter= */ null, new it(o));
     }
-    if (!(t instanceof In || t instanceof Pn)) throw new B(O, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    if (!(t instanceof In || t instanceof Fn)) throw new B(O, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
     var a = t._path.child(et.fromString.apply(et, r([ e ], n, !1)));
-    return at(a), new In(t.firestore, t instanceof Pn ? t.converter : null, new it(a));
+    return at(a), new In(t.firestore, t instanceof Fn ? t.converter : null, new it(a));
 }
 
 /**
@@ -3984,7 +3984,7 @@ function Vn(t, e) {
  * @returns true if the references point to the same location in the same
  * Firestore database.
  */ function Dn(t, e) {
-    return t = p(t), e = p(e), (t instanceof In || t instanceof Pn) && (e instanceof In || e instanceof Pn) && t.firestore === e.firestore && t.path === e.path && t.converter === e.converter
+    return t = p(t), e = p(e), (t instanceof In || t instanceof Fn) && (e instanceof In || e instanceof Fn) && t.firestore === e.firestore && t.path === e.path && t.converter === e.converter
     /**
  * Returns true if the provided queries point to the same collection and apply
  * the same constraints.
@@ -4040,7 +4040,7 @@ var qn = /** @class */ function() {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    return t.fromBase64String = function(e) {
         try {
-            return new t(Pt.fromBase64String(e));
+            return new t(Ft.fromBase64String(e));
         } catch (e) {
             throw new B(O, "Failed to construct data from Base64 string: " + e);
         }
@@ -4051,7 +4051,7 @@ var qn = /** @class */ function() {
      * @param array - The Uint8Array used to create the `Bytes` object.
      */
     t.fromUint8Array = function(e) {
-        return new t(Pt.fromUint8Array(e));
+        return new t(Ft.fromUint8Array(e));
     }, 
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -4337,7 +4337,7 @@ function(t) {
             st: !0
         });
     }, t.prototype.ct = function(t) {
-        return cr(t, this.settings.methodName, this.settings.at || !1, this.path, this.settings.ht);
+        return cr(t, this.settings.methodName, this.settings.ht || !1, this.path, this.settings.lt);
     }, 
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */ t.prototype.contains = function(t) {
         return void 0 !== this.fieldMask.find((function(e) {
@@ -4358,14 +4358,14 @@ function(t) {
         this.databaseId = t, this.ignoreUndefinedProperties = e, this.serializer = n || fn(t)
         /** Creates a new top-level parse context. */;
     }
-    return t.prototype.lt = function(t, e, n, r) {
+    return t.prototype.ft = function(t, e, n, r) {
         return void 0 === r && (r = !1), new zn({
             et: t,
             methodName: e,
-            ht: n,
+            lt: n,
             path: rt.emptyPath(),
             st: !1,
-            at: r
+            ht: r
         }, this.databaseId, this.serializer, this.ignoreUndefinedProperties);
     }, t;
 }();
@@ -4380,7 +4380,7 @@ function(t) {
 
 /** Parse document data from a set() call. */ function Gn(t, e, n, r, i, o) {
     void 0 === o && (o = {});
-    var a = t.lt(o.merge || o.mergeFields ? 2 /* UserDataSource.MergeSet */ : 0 /* UserDataSource.Set */ , e, n, i);
+    var a = t.ft(o.merge || o.mergeFields ? 2 /* UserDataSource.MergeSet */ : 0 /* UserDataSource.Set */ , e, n, i);
     or("Data must be an object, but it was:", a, r);
     var u, s, c = rr(r, a);
     if (o.merge) u = new ve(a.fieldMask), s = a.fieldTransforms; else if (o.mergeFields) {
@@ -4428,7 +4428,7 @@ var Wn = /** @class */ function(e) {
  */ function Yn(t, e, n) {
     return new zn({
         et: 3 /* UserDataSource.Argument */ ,
-        ht: e.settings.ht,
+        lt: e.settings.lt,
         methodName: t._methodName,
         st: n
     }, e.databaseId, e.serializer, e.ignoreUndefinedProperties);
@@ -4446,11 +4446,11 @@ var Hn = /** @class */ function(e) {
 }(Cn), Jn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t) || this).ft = n, r;
+        return (r = e.call(this, t) || this).dt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
         var e = Yn(this, t, 
-        /*array=*/ !0), n = this.ft.map((function(t) {
+        /*array=*/ !0), n = this.dt.map((function(t) {
             return nr(t, e);
         })), r = new De(n);
         return new Re(t.path, r);
@@ -4461,11 +4461,11 @@ var Hn = /** @class */ function(e) {
 }(Cn), Xn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t) || this).ft = n, r;
+        return (r = e.call(this, t) || this).dt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
         var e = Yn(this, t, 
-        /*array=*/ !0), n = this.ft.map((function(t) {
+        /*array=*/ !0), n = this.dt.map((function(t) {
             return nr(t, e);
         })), r = new Ne(n);
         return new Re(t.path, r);
@@ -4476,10 +4476,10 @@ var Hn = /** @class */ function(e) {
 }(Cn), $n = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t) || this).dt = n, r;
+        return (r = e.call(this, t) || this).wt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = new qe(t.serializer, Fe(t.serializer, this.dt));
+        var e = new qe(t.serializer, Pe(t.serializer, this.wt));
         return new Re(t.path, e);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4488,7 +4488,7 @@ var Hn = /** @class */ function(e) {
 }(Cn);
 
 /** Parse update data from an update() call. */ function Zn(t, e, n, r) {
-    var i = t.lt(1 /* UserDataSource.Update */ , e, n);
+    var i = t.ft(1 /* UserDataSource.Update */ , e, n);
     or("Data must be an object, but it was:", i, r);
     var o = [], a = ge.empty();
     It(r, (function(t, r) {
@@ -4509,7 +4509,7 @@ var Hn = /** @class */ function(e) {
 }
 
 /** Parse update data from a list of field/value arguments. */ function tr(t, e, n, r, i, o) {
-    var a = t.lt(1 /* UserDataSource.Update */ , e, n), u = [ ar(e, r, n) ], s = [ i ];
+    var a = t.ft(1 /* UserDataSource.Update */ , e, n), u = [ ar(e, r, n) ], s = [ i ];
     if (o.length % 2 != 0) throw new B(O, "Function ".concat(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) u.push(ar(e, o[c])), s.push(o[c + 1]);
     // We iterate in reverse order to pick the last value for a field if the
@@ -4538,7 +4538,7 @@ var Hn = /** @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 er(t, e, n, r) {
-    return void 0 === r && (r = !1), nr(n, t.lt(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
+    return void 0 === r && (r = !1), nr(n, t.ft(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
 }
 
 /**
@@ -4608,7 +4608,7 @@ var Hn = /** @class */ function(e) {
         if (null === (t = p(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return Fe(e.serializer, t);
+        if ("number" == typeof t) return Pe(e.serializer, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4976,7 +4976,7 @@ function yr(t, e) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
         var e = this._parse(t);
-        return jr(t._query, e), new An(t.firestore, t.converter, Pe(t._query, e));
+        return jr(t._query, e), new An(t.firestore, t.converter, Fe(t._query, e));
     }, n.prototype._parse = function(t) {
         var e = Kn(t.firestore), n = function(t, e, n, r, i, o, a) {
             var u;
@@ -5049,9 +5049,9 @@ function yr(t, e) {
         return 0 === e.getFilters().length ? t : (function(t, e) {
             for (var n = t, r = 0, i = e.getFlattenedFilters(); r < i.length; r++) {
                 var o = i[r];
-                jr(n, o), n = Pe(n, o);
+                jr(n, o), n = Fe(n, o);
             }
-        }(t._query, e), new An(t.firestore, t.converter, Pe(t._query, e)));
+        }(t._query, e), new An(t.firestore, t.converter, Fe(t._query, e)));
     }, n.prototype._getQueryConstraints = function() {
         return this._queryConstraints;
     }, n.prototype._getOperator = function() {
@@ -5198,7 +5198,7 @@ var Sr = /** @class */ function(e) {
  */;
 }
 
-function Pr(t) {
+function Fr(t) {
     return lt("limitToLast", t), Ir._create("limitToLast", t, "L" /* LimitType.Last */)
     /**
  * A `QueryStartAtConstraint` is used to exclude documents from the start of a
@@ -5209,7 +5209,7 @@ function Pr(t) {
  */;
 }
 
-var Fr = /** @class */ function(e) {
+var Pr = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5232,13 +5232,13 @@ var Fr = /** @class */ function(e) {
 
 function Or() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return Fr._create("startAt", t, 
+    return Pr._create("startAt", t, 
     /*inclusive=*/ !0);
 }
 
 function Vr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return Fr._create("startAfter", t, 
+    return Pr._create("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
@@ -5645,7 +5645,7 @@ function Gr(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 Yr(t, e) {
-    var n = Vn(t = ct(t, Pn)), r = Ur(t.converter, e), i = Gn(Kn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    var n = Vn(t = ct(t, Fn)), r = Ur(t.converter, e), i = Gn(Kn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
     return dn(vn(t.firestore), [ i.toMutation(n._key, xe.exists(!1)) ]).then((function() {
         return n;
     }));
@@ -6155,32 +6155,32 @@ function si(t, e) {
 }, hi = /** @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.wt = n.maxAttempts, this.yt = new hn(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */)
+        this.deferred = i, this.yt = n.maxAttempts, this.gt = new hn(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.run = function() {
-        this.wt -= 1, this.gt();
-    }, t.prototype.gt = function() {
+        this.yt -= 1, this._t();
+    }, t.prototype._t = function() {
         var t = this;
-        this.yt.K((function() {
+        this.gt.K((function() {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new li(this.datastore), (e = this._t(t)) && e.then((function(e) {
+                    return t = new li(this.datastore), (e = this.vt(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
                             })).catch((function(t) {
-                                r.vt(t);
+                                r.bt(t);
                             }));
                         }));
                     })).catch((function(t) {
-                        r.vt(t);
+                        r.bt(t);
                     })), [ 2 /*return*/ ];
                 }));
             }));
         }));
-    }, t.prototype._t = function(t) {
+    }, t.prototype.vt = function(t) {
         try {
             var e = this.updateFunction(t);
             return !pt(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
@@ -6189,12 +6189,12 @@ function si(t, e) {
             // Do not retry errors thrown by user provided updateFunction.
             return this.deferred.reject(t), null;
         }
-    }, t.prototype.vt = function(t) {
+    }, t.prototype.bt = function(t) {
         var e = this;
-        this.wt > 0 && this.bt(t) ? (this.wt -= 1, this.asyncQueue.enqueueAndForget((function() {
-            return e.gt(), Promise.resolve();
+        this.yt > 0 && this.Et(t) ? (this.yt -= 1, this.asyncQueue.enqueueAndForget((function() {
+            return e._t(), Promise.resolve();
         }))) : this.deferred.reject(t);
-    }, t.prototype.bt = function(t) {
+    }, t.prototype.Et = function(t) {
         if ("FirebaseError" === t.name) {
             // In transactions, the backend will fail outdated reads with FAILED_PRECONDITION and
             // non-matching document versions with ABORTED. These errors should be retried.
@@ -6211,8 +6211,8 @@ function si(t, e) {
                   default:
                     return k();
 
-                  case P:
                   case F:
+                  case P:
                   case V:
                   case R:
                   case M:
@@ -6358,7 +6358,7 @@ function si(t, e) {
      * guarantee that the operation will not be run.
      */
     t.prototype.cancel = function(t) {
-        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new B(P, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new B(F, "Operation cancelled" + (t ? ": " + t : ""))));
     }, t.prototype.handleDelayElapsed = function() {
         var t = this;
         this.asyncQueue.enqueueAndForget((function() {
@@ -6374,40 +6374,40 @@ function si(t, e) {
     function t() {
         var t = this;
         // The last promise in the queue.
-                this.Et = Promise.resolve(), 
+                this.It = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.It = [], 
+        this.Tt = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.Tt = !1, 
+        this.At = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.At = [], 
+        this.Rt = [], 
         // visible for testing
-        this.Rt = null, 
+        this.Pt = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.Pt = !1, 
-        // Enabled during shutdown on Safari to prevent future access to IndexedDB.
         this.Vt = !1, 
+        // Enabled during shutdown on Safari to prevent future access to IndexedDB.
+        this.$t = !1, 
         // List of TimerIds to fast-forward delays for.
-        this.$t = [], 
+        this.Nt = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.yt = new hn(this, "async_queue_retry" /* TimerId.AsyncQueueRetry */), 
+        this.gt = new hn(this, "async_queue_retry" /* TimerId.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.Nt = function() {
+        this.Dt = function() {
             var e = pi();
-            e && b("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.yt.H();
+            e && b("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.gt.H();
         };
         var e = pi();
-        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Nt);
+        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Dt);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
         get: function() {
-            return this.Tt;
+            return this.At;
         },
         enumerable: !1,
         configurable: !0
@@ -6420,53 +6420,53 @@ function si(t, e) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
         this.enqueue(t);
     }, t.prototype.enqueueAndForgetEvenWhileRestricted = function(t) {
-        this.Dt(), 
+        this.Ft(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.Ft(t);
+        this.xt(t);
     }, t.prototype.enterRestrictedMode = function(t) {
-        if (!this.Tt) {
-            this.Tt = !0, this.Vt = t || !1;
+        if (!this.At) {
+            this.At = !0, this.$t = t || !1;
             var e = pi();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Nt);
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Dt);
         }
     }, t.prototype.enqueue = function(t) {
         var e = this;
-        if (this.Dt(), this.Tt) 
+        if (this.Ft(), this.At) 
         // Return a Promise which never resolves.
         return new Promise((function() {}));
         // Create a deferred Promise that we can return to the callee. This
         // allows us to return a "hanging Promise" only to the callee and still
         // advance the queue even when the operation is not run.
                 var n = new z;
-        return this.Ft((function() {
-            return e.Tt && e.Vt ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
+        return this.xt((function() {
+            return e.At && e.$t ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
         })).then((function() {
             return n.promise;
         }));
     }, t.prototype.enqueueRetryable = function(t) {
         var e = this;
         this.enqueueAndForget((function() {
-            return e.It.push(t), e.xt();
+            return e.Tt.push(t), e.St();
         }));
     }, 
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
      */
-    t.prototype.xt = function() {
+    t.prototype.St = function() {
         return e(this, void 0, void 0, (function() {
             var t, e = this;
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    if (0 === this.It.length) return [ 3 /*break*/ , 5 ];
+                    if (0 === this.Tt.length) return [ 3 /*break*/ , 5 ];
                     n.label = 1;
 
                   case 1:
-                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.It[0]() ];
+                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.Tt[0]() ];
 
                   case 2:
-                    return n.sent(), this.It.shift(), this.yt.reset(), [ 3 /*break*/ , 4 ];
+                    return n.sent(), this.Tt.shift(), this.gt.reset(), [ 3 /*break*/ , 4 ];
 
                   case 3:
                     if (t = n.sent(), "IndexedDbTransactionError" !== t.name) throw t;
@@ -6475,7 +6475,7 @@ function si(t, e) {
                     [ 3 /*break*/ , 4 ];
 
                   case 4:
-                    this.It.length > 0 && 
+                    this.Tt.length > 0 && 
                     // If there are additional operations, we re-schedule `retryNextOp()`.
                     // This is necessary to run retryable operations that failed during
                     // their initial attempt since we don't know whether they are already
@@ -6486,8 +6486,8 @@ function si(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.yt.K((function() {
-                        return e.xt();
+                    this.gt.K((function() {
+                        return e.St();
                     })), n.label = 5;
 
                   case 5:
@@ -6495,10 +6495,10 @@ function si(t, e) {
                 }
             }));
         }));
-    }, t.prototype.Ft = function(t) {
-        var e = this, n = this.Et.then((function() {
-            return e.Pt = !0, t().catch((function(t) {
-                e.Rt = t, e.Pt = !1;
+    }, t.prototype.xt = function(t) {
+        var e = this, n = this.It.then((function() {
+            return e.Vt = !0, t().catch((function(t) {
+                e.Pt = t, e.Vt = !1;
                 var n = 
                 /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -6515,39 +6515,39 @@ function si(t, e) {
                 // and return the rejected Promise.
                                 throw T("INTERNAL UNHANDLED ERROR: ", n), t;
             })).then((function(t) {
-                return e.Pt = !1, t;
+                return e.Vt = !1, t;
             }));
         }));
-        return this.Et = n, n;
+        return this.It = n, n;
     }, t.prototype.enqueueAfterDelay = function(t, e, n) {
         var r = this;
-        this.Dt(), 
+        this.Ft(), 
         // Fast-forward delays for timerIds that have been overriden.
-        this.$t.indexOf(t) > -1 && (e = 0);
+        this.Nt.indexOf(t) > -1 && (e = 0);
         var i = yi.createAndSchedule(this, t, e, n, (function(t) {
-            return r.St(t);
+            return r.qt(t);
         }));
-        return this.At.push(i), i;
-    }, t.prototype.Dt = function() {
-        this.Rt && k();
+        return this.Rt.push(i), i;
+    }, t.prototype.Ft = function() {
+        this.Pt && k();
     }, t.prototype.verifyOperationInProgress = function() {}, 
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
      */
-    t.prototype.qt = function() {
+    t.prototype.Ot = function() {
         return e(this, void 0, void 0, (function() {
             var t;
             return n(this, (function(e) {
                 switch (e.label) {
                   case 0:
-                    return [ 4 /*yield*/ , t = this.Et ];
+                    return [ 4 /*yield*/ , t = this.It ];
 
                   case 1:
                     e.sent(), e.label = 2;
 
                   case 2:
-                    if (t !== this.Et) return [ 3 /*break*/ , 0 ];
+                    if (t !== this.It) return [ 3 /*break*/ , 0 ];
                     e.label = 3;
 
                   case 3:
@@ -6560,8 +6560,8 @@ function si(t, e) {
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
      */
-    t.prototype.Ot = function(t) {
-        for (var e = 0, n = this.At; e < n.length; e++) {
+    t.prototype.kt = function(t) {
+        for (var e = 0, n = this.Rt; e < n.length; e++) {
             if (n[e].timerId === t) return !0;
         }
         return !1;
@@ -6573,31 +6573,31 @@ function si(t, e) {
      * will be drained. Pass TimerId.All to run all delayed operations.
      * @returns a Promise that resolves once all operations have been run.
      */
-    t.prototype.kt = function(t) {
+    t.prototype.Ct = function(t) {
         var e = this;
         // Note that draining may generate more delayed ops, so we do that first.
-                return this.qt().then((function() {
+                return this.Ot().then((function() {
             // Run ops in the same order they'd run if they ran naturally.
-            e.At.sort((function(t, e) {
+            e.Rt.sort((function(t, e) {
                 return t.targetTimeMs - e.targetTimeMs;
             }));
-            for (var n = 0, r = e.At; n < r.length; n++) {
+            for (var n = 0, r = e.Rt; n < r.length; n++) {
                 var i = r[n];
                 if (i.skipDelay(), "all" /* TimerId.All */ !== t && i.timerId === t) break;
             }
-            return e.qt();
+            return e.Ot();
         }));
     }, 
     /**
      * For Tests: Skip all subsequent delays for a timer id.
      */
-    t.prototype.Ct = function(t) {
-        this.$t.push(t);
+    t.prototype.Mt = function(t) {
+        this.Nt.push(t);
     }, 
-    /** Called once a DelayedOperation is run or canceled. */ t.prototype.St = function(t) {
+    /** Called once a DelayedOperation is run or canceled. */ t.prototype.qt = function(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        var e = this.At.indexOf(t);
-        this.At.splice(e, 1);
+        var e = this.Rt.indexOf(t);
+        this.Rt.splice(e, 1);
     }, t;
 }(), vi = /** @class */ function() {
     /** @hideconstructor */
@@ -6704,7 +6704,7 @@ di = "".concat(i, "_lite"), g = di, o(new c("firestore/lite", (function(t, e) {
     return r && o._setSettings(r), o;
 }), "PUBLIC").setMultipleInstances(!0)), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-a("firestore-lite", "3.12.0-20230511201449", ""), a("firestore-lite", "3.12.0-20230511201449", "esm5");
+a("firestore-lite", "3.12.0", ""), a("firestore-lite", "3.12.0", "esm5");
 
-export { Sn as AggregateField, kn as AggregateQuerySnapshot, qn as Bytes, Pn as CollectionReference, In as DocumentReference, fr as DocumentSnapshot, Rn as FieldPath, Cn as FieldValue, wn as Firestore, B as FirestoreError, jn as GeoPoint, An as Query, br as QueryCompositeFilterConstraint, vr as QueryConstraint, hr as QueryDocumentSnapshot, Dr as QueryEndAtConstraint, wr as QueryFieldFilterConstraint, Ir as QueryLimitConstraint, Sr as QueryOrderByConstraint, pr as QuerySnapshot, Fr as QueryStartAtConstraint, Nt as Timestamp, vi as Transaction, ui as WriteBatch, Yr as addDoc, ti as aggregateFieldEqual, ei as aggregateQuerySnapshotEqual, Er as and, oi as arrayRemove, ii as arrayUnion, $r as average, Fn as collection, On as collectionGroup, Tn as connectFirestoreEmulator, Zr as count, Wr as deleteDoc, ni as deleteField, Vn as doc, xn as documentId, qr as endAt, Nr as endBefore, Jr as getAggregate, Hr as getCount, zr as getDoc, Qr as getDocs, bn as getFirestore, ai as increment, _n as initializeFirestore, Ar as limit, Pr as limitToLast, Tr as or, kr as orderBy, gr as query, Nn as queryEqual, Dn as refEqual, gi as runTransaction, ri as serverTimestamp, Kr as setDoc, _ as setLogLevel, dr as snapshotEqual, Vr as startAfter, Or as startAt, Xr as sum, En as terminate, Gr as updateDoc, _r as where, ci as writeBatch };
+export { Sn as AggregateField, kn as AggregateQuerySnapshot, qn as Bytes, Fn as CollectionReference, In as DocumentReference, fr as DocumentSnapshot, Rn as FieldPath, Cn as FieldValue, wn as Firestore, B as FirestoreError, jn as GeoPoint, An as Query, br as QueryCompositeFilterConstraint, vr as QueryConstraint, hr as QueryDocumentSnapshot, Dr as QueryEndAtConstraint, wr as QueryFieldFilterConstraint, Ir as QueryLimitConstraint, Sr as QueryOrderByConstraint, pr as QuerySnapshot, Pr as QueryStartAtConstraint, Nt as Timestamp, vi as Transaction, ui as WriteBatch, Yr as addDoc, ti as aggregateFieldEqual, ei as aggregateQuerySnapshotEqual, Er as and, oi as arrayRemove, ii as arrayUnion, $r as average, Pn as collection, On as collectionGroup, Tn as connectFirestoreEmulator, Zr as count, Wr as deleteDoc, ni as deleteField, Vn as doc, xn as documentId, qr as endAt, Nr as endBefore, Jr as getAggregate, Hr as getCount, zr as getDoc, Qr as getDocs, bn as getFirestore, ai as increment, _n as initializeFirestore, Ar as limit, Fr as limitToLast, Tr as or, kr as orderBy, gr as query, Nn as queryEqual, Dn as refEqual, gi as runTransaction, ri as serverTimestamp, Kr as setDoc, _ as setLogLevel, dr as snapshotEqual, Vr as startAfter, Or as startAt, Xr as sum, En as terminate, Gr as updateDoc, _r as where, ci as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map