@firebase/firestore 3.4.13 → 3.4.14-canary.04dcdbb0f

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

@@ -67,7 +67,7 @@ y.MOCK_USER = new y("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var m = "9.9.1", v = new l("@firebase/firestore");
+var m = "9.9.3-canary.04dcdbb0f", v = new l("@firebase/firestore");
 
 /**
  * @license
@@ -197,14 +197,14 @@ function b(t) {
  */;
 }
 
-function S(t, e) {
+function k(t, e) {
     t || E();
 }
 
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function k(t, 
+ */ function S(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     return t;
@@ -225,7 +225,7 @@ e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ var I = "cancelled", A = "unknown", V = "invalid-argument", D = "deadline-exceeded", P = "not-found", N = "permission-denied", F = "unauthenticated", O = "resource-exhausted", q = "failed-precondition", R = "aborted", x = "out-of-range", C = "unimplemented", L = "internal", j = "unavailable", M = /** @class */ function(e) {
+ */ var I = "cancelled", A = "unknown", V = "invalid-argument", P = "deadline-exceeded", D = "not-found", N = "permission-denied", F = "unauthenticated", O = "resource-exhausted", R = "failed-precondition", q = "aborted", C = "out-of-range", x = "unimplemented", L = "internal", j = "unavailable", M = /** @class */ function(e) {
     /** @hideconstructor */
     function n(
     /**
@@ -253,7 +253,7 @@ e) {
     }));
 }, B = function(t, e) {
     this.user = e, this.type = "OAuth", this.headers = new Map, this.headers.set("Authorization", "Bearer " + t);
-}, z = /** @class */ function() {
+}, G = /** @class */ function() {
     function t() {}
     return t.prototype.getToken = function() {
         return Promise.resolve(null);
@@ -263,7 +263,7 @@ e) {
             return e(y.UNAUTHENTICATED);
         }));
     }, t.prototype.shutdown = function() {}, t;
-}(), G = /** @class */ function() {
+}(), z = /** @class */ function() {
     function t(t) {
         this.token = t, 
         /**
@@ -295,20 +295,38 @@ e) {
     return t.prototype.getToken = function() {
         var t = this;
         return this.auth ? this.auth.getToken().then((function(e) {
-            return e ? (S("string" == typeof e.accessToken), new B(e.accessToken, new y(t.auth.getUid()))) : null;
+            return e ? (k("string" == typeof e.accessToken), new B(e.accessToken, new y(t.auth.getUid()))) : null;
         })) : Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
     t.prototype.shutdown = function() {}, t;
-}(), Q = function(t, e, n) {
-    this.type = "FirstParty", this.user = y.FIRST_PARTY, this.headers = new Map, this.headers.set("X-Goog-AuthUser", e);
-    var r = t.auth.getAuthHeaderValueForFirstParty([]);
-    r && this.headers.set("Authorization", r), n && this.headers.set("X-Goog-Iam-Authorization-Token", n);
-}, W = /** @class */ function() {
-    function t(t, e, n) {
-        this.t = t, this.i = e, this.o = n;
+}(), W = /** @class */ function() {
+    function t(t, e, n, r) {
+        this.t = t, this.i = e, this.o = n, this.u = r, this.type = "FirstParty", this.user = y.FIRST_PARTY, 
+        this.h = new Map
+        /** Gets an authorization token, using a provided factory function, or falling back to First Party GAPI. */;
+    }
+    return t.prototype.l = function() {
+        return this.u ? this.u() : (
+        // Make sure this really is a Gapi client.
+        k(!("object" != typeof this.t || null === this.t || !this.t.auth || !this.t.auth.getAuthHeaderValueForFirstParty)), 
+        this.t.auth.getAuthHeaderValueForFirstParty([]));
+    }, Object.defineProperty(t.prototype, "headers", {
+        get: function() {
+            this.h.set("X-Goog-AuthUser", this.i);
+            // Use array notation to prevent minification
+            var t = this.l();
+            return t && this.h.set("Authorization", t), this.o && this.h.set("X-Goog-Iam-Authorization-Token", this.o), 
+            this.h;
+        },
+        enumerable: !1,
+        configurable: !0
+    }), t;
+}(), Q = /** @class */ function() {
+    function t(t, e, n, r) {
+        this.t = t, this.i = e, this.o = n, this.u = r;
     }
     return t.prototype.getToken = function() {
-        return Promise.resolve(new Q(this.t, this.i, this.o));
+        return Promise.resolve(new W(this.t, this.i, this.o, this.u));
     }, t.prototype.start = function(t, e) {
         // Fire with initial uid.
         t.enqueueRetryable((function() {
@@ -321,17 +339,17 @@ e) {
 }, Y = /** @class */ function() {
     function t(t) {
         var e = this;
-        this.u = t, this.appCheck = null, t.onInit((function(t) {
+        this.m = t, this.appCheck = null, t.onInit((function(t) {
             e.appCheck = t;
         }));
     }
     return t.prototype.getToken = function() {
         return this.appCheck ? this.appCheck.getToken().then((function(t) {
-            return t ? (S("string" == typeof t.token), new H(t.token)) : null;
+            return t ? (k("string" == typeof t.token), new H(t.token)) : null;
         })) : Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
     t.prototype.shutdown = function() {}, t;
-}(), $ = 
+}(), X = 
 /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -352,7 +370,7 @@ e) {
 function(t, e, n, r, i, o, a, s) {
     this.databaseId = t, this.appId = e, this.persistenceKey = n, this.host = r, this.ssl = i, 
     this.forceLongPolling = o, this.autoDetectLongPolling = a, this.useFetchStreams = s;
-}, X = /** @class */ function() {
+}, J = /** @class */ function() {
     function t(t, e) {
         this.projectId = t, this.database = e || "(default)";
     }
@@ -367,7 +385,7 @@ function(t, e, n, r, i, o, a, s) {
     }), t.prototype.isEqual = function(e) {
         return e instanceof t && e.projectId === this.projectId && e.database === this.database;
     }, t;
-}(), J = /** @class */ function() {
+}(), Z = /** @class */ function() {
     function t(t, e, n) {
         void 0 === e ? e = 0 : e > t.length && E(), void 0 === n ? n = t.length - e : n > t.length - e && E(), 
         this.segments = t, this.offset = e, this.len = n;
@@ -420,7 +438,7 @@ function(t, e, n, r, i, o, a, s) {
         }
         return t.length < e.length ? -1 : t.length > e.length ? 1 : 0;
     }, t;
-}(), Z = /** @class */ function(e) {
+}(), $ = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -456,7 +474,7 @@ function(t, e, n, r, i, o, a, s) {
     }, n.emptyPath = function() {
         return new n([]);
     }, n;
-}(J), tt = /^[_a-zA-Z][_a-zA-Z0-9]*$/, et = /** @class */ function(e) {
+}(Z), tt = /^[_a-zA-Z][_a-zA-Z0-9]*$/, et = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -517,16 +535,16 @@ function(t, e, n, r, i, o, a, s) {
     }, n.emptyPath = function() {
         return new n([]);
     }, n;
-}(J), nt = /** @class */ function() {
+}(Z), nt = /** @class */ function() {
     function t(t) {
         this.path = t;
     }
     return t.fromPath = function(e) {
-        return new t(Z.fromString(e));
+        return new t($.fromString(e));
     }, t.fromName = function(e) {
-        return new t(Z.fromString(e).popFirst(5));
+        return new t($.fromString(e).popFirst(5));
     }, t.empty = function() {
-        return new t(Z.emptyPath());
+        return new t($.emptyPath());
     }, Object.defineProperty(t.prototype, "collectionGroup", {
         get: function() {
             return this.path.popLast().lastSegment();
@@ -543,11 +561,11 @@ function(t, e, n, r, i, o, a, s) {
     /** Returns the fully qualified path to the parent collection. */ t.prototype.getCollectionPath = function() {
         return this.path.popLast();
     }, t.prototype.isEqual = function(t) {
-        return null !== t && 0 === Z.comparator(this.path, t.path);
+        return null !== t && 0 === $.comparator(this.path, t.path);
     }, t.prototype.toString = function() {
         return this.path.toString();
     }, t.comparator = function(t, e) {
-        return Z.comparator(t.path, e.path);
+        return $.comparator(t.path, e.path);
     }, t.isDocumentKey = function(t) {
         return t.length % 2 == 0;
     }, 
@@ -558,7 +576,7 @@ function(t, e, n, r, i, o, a, s) {
      * @returns A new instance of DocumentKey
      */
     t.fromSegments = function(e) {
-        return new t(new Z(e.slice()));
+        return new t(new $(e.slice()));
     }, t;
 }();
 
@@ -746,7 +764,7 @@ function dt(t) {
 
       case 400:
         // Bad Request
-        return q;
+        return R;
 
         // Other possibilities based on the forward mapping
         // return Code.INVALID_ARGUMENT;
@@ -761,17 +779,17 @@ function dt(t) {
 
       case 404:
         // Not Found
-        return P;
+        return D;
 
       case 409:
         // Conflict
-        return R;
+        return q;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return x;
+        return C;
 
       case 429:
         // Too Many Requests
@@ -790,7 +808,7 @@ function dt(t) {
         // return Code.DATA_LOSS;
               case 501:
         // Unimplemented
-        return C;
+        return x;
 
       case 503:
         // Service Unavailable
@@ -798,10 +816,10 @@ function dt(t) {
 
       case 504:
         // Gateway Timeout
-        return D;
+        return P;
 
       default:
-        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? q : t >= 500 && t < 600 ? L : A;
+        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? R : t >= 500 && t < 600 ? L : A;
     }
 }
 
@@ -840,15 +858,15 @@ var yt = /** @class */ function(r) {
      */
     function i(t, e) {
         var n = this;
-        return (n = r.call(this, t) || this).I = e, n;
+        return (n = r.call(this, t) || this).P = e, n;
     }
     /**
      * Base class for all Rest-based connections to the backend (WebChannel and
      * HTTP).
      */
-    return t(i, r), i.prototype.A = function(t, e) {
+    return t(i, r), i.prototype.V = function(t, e) {
         throw new Error("Not supported by FetchConnection");
-    }, i.prototype.v = function(t, r, i, o) {
+    }, i.prototype.A = function(t, r, i, o) {
         return e(this, void 0, void 0, (function() {
             var t, e, a;
             return n(this, (function(n) {
@@ -857,7 +875,7 @@ var yt = /** @class */ function(r) {
                     t = JSON.stringify(o), n.label = 1;
 
                   case 1:
-                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.I(r, {
+                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.P(r, {
                         method: "POST",
                         headers: i,
                         body: t
@@ -880,28 +898,28 @@ var yt = /** @class */ function(r) {
     function t(t) {
         this.databaseInfo = t, this.databaseId = t.databaseId;
         var e = t.ssl ? "https" : "http";
-        this.h = e + "://" + t.host, this.l = "projects/" + this.databaseId.projectId + "/databases/" + this.databaseId.database + "/documents";
+        this.p = e + "://" + t.host, this.g = "projects/" + this.databaseId.projectId + "/databases/" + this.databaseId.database + "/documents";
     }
-    return t.prototype.m = function(t, e, n, r, i) {
-        var o = this.p(t, e);
+    return t.prototype.v = function(t, e, n, r, i) {
+        var o = this.T(t, e);
         w("RestConnection", "Sending: ", o, n);
         var a = {};
-        return this.g(a, r, i), this.v(t, o, a, n).then((function(t) {
+        return this.I(a, r, i), this.A(t, o, a, n).then((function(t) {
             return w("RestConnection", "Received: ", t), t;
         }), (function(e) {
             throw _("RestConnection", t + " failed with error: ", e, "url: ", o, "request:", n), 
             e;
         }));
-    }, t.prototype.T = function(t, e, n, r, i, o) {
+    }, t.prototype.R = function(t, e, n, r, i, o) {
         // The REST API automatically aggregates all of the streamed results, so we
         // can just use the normal invoke() method.
-        return this.m(t, e, n, r, i);
+        return this.v(t, e, n, r, i);
     }, 
     /**
      * Modifies the headers for a request, adding any authorization token if
      * present and any additional headers for the request.
      */
-    t.prototype.g = function(t, e, n) {
+    t.prototype.I = function(t, e, n) {
         t["X-Goog-Api-Client"] = "gl-js/ fire/" + m, 
         // Content-Type: text/plain will avoid preflight requests which might
         // mess with CORS and redirects by proxies. If we add custom headers
@@ -913,9 +931,9 @@ var yt = /** @class */ function(r) {
         })), n && n.headers.forEach((function(e, n) {
             return t[n] = e;
         }));
-    }, t.prototype.p = function(t, e) {
+    }, t.prototype.T = function(t, e) {
         var n = pt[t];
-        return this.h + "/v1/" + e + ":" + n;
+        return this.p + "/v1/" + e + ":" + n;
     }, t;
 }());
 
@@ -984,7 +1002,7 @@ var yt = /** @class */ function(r) {
  * limitations under the License.
  */ var vt = /** @class */ function() {
     function t() {}
-    return t.R = function() {
+    return t.N = function() {
         for (
         // Alphanumeric characters
         var t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", e = Math.floor(256 / t.length) * t.length, n = ""
@@ -1240,7 +1258,7 @@ function Et(t, e) {
  */
 // An immutable sorted map implementation, based on a Left-leaning Red-Black
 // tree.
-var St = /** @class */ function() {
+var kt = /** @class */ function() {
     function t(t, e) {
         this.comparator = t, this.root = e || It.EMPTY;
     }
@@ -1319,15 +1337,15 @@ var St = /** @class */ function() {
     }, 
     // Returns an iterator over the SortedMap.
     t.prototype.getIterator = function() {
-        return new kt(this.root, null, this.comparator, !1);
+        return new St(this.root, null, this.comparator, !1);
     }, t.prototype.getIteratorFrom = function(t) {
-        return new kt(this.root, t, this.comparator, !1);
+        return new St(this.root, t, this.comparator, !1);
     }, t.prototype.getReverseIterator = function() {
-        return new kt(this.root, null, this.comparator, !0);
+        return new St(this.root, null, this.comparator, !0);
     }, t.prototype.getReverseIteratorFrom = function(t) {
-        return new kt(this.root, t, this.comparator, !0);
+        return new St(this.root, t, this.comparator, !0);
     }, t;
-}(), kt = /** @class */ function() {
+}(), St = /** @class */ function() {
     function t(t, e, n, r) {
         this.isReverse = r, this.nodeStack = [];
         for (var i = 1; !t.isEmpty(); ) if (i = e ? n(t.key, e) : 1, 
@@ -1563,7 +1581,7 @@ It.EMPTY = new (/** @class */ function() {
  */
 var At = /** @class */ function() {
     function t(t) {
-        this.comparator = t, this.data = new St(this.comparator);
+        this.comparator = t, this.data = new kt(this.comparator);
     }
     return t.prototype.has = function(t) {
         return null !== this.data.get(t);
@@ -1651,7 +1669,7 @@ var At = /** @class */ function() {
     }, t.prototype.hasNext = function() {
         return this.iter.hasNext();
     }, t;
-}(), Dt = /** @class */ function() {
+}(), Pt = /** @class */ function() {
     function t(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
@@ -1692,7 +1710,7 @@ var At = /** @class */ function() {
             return t.isEqual(e);
         }));
     }, t;
-}(), Pt = /** @class */ function() {
+}(), Dt = /** @class */ function() {
     function t(t) {
         this.binaryString = t;
     }
@@ -1740,7 +1758,7 @@ var At = /** @class */ function() {
     }, t;
 }();
 
-Pt.EMPTY_BYTE_STRING = new Pt("");
+Dt.EMPTY_BYTE_STRING = new Dt("");
 
 var Nt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
@@ -1751,12 +1769,12 @@ var Nt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     // The json interface (for the browser) will return an iso timestamp string,
     // while the proto js library (for node) will return a
     // google.protobuf.Timestamp instance.
-    if (S(!!t), "string" == typeof t) {
+    if (k(!!t), "string" == typeof t) {
         // 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 = Nt.exec(t);
-        if (S(!!n), n[1]) {
+        if (k(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             var r = n[1];
             r = (r + "000000000").substr(0, 9), e = Number(r);
@@ -1782,8 +1800,8 @@ var Nt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     return "number" == typeof t ? t : "string" == typeof t ? Number(t) : 0;
 }
 
-/** Converts the possible Proto types for Blobs into a ByteString. */ function qt(t) {
-    return "string" == typeof t ? Pt.fromBase64String(t) : Pt.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Rt(t) {
+    return "string" == typeof t ? Dt.fromBase64String(t) : Dt.fromUint8Array(t);
 }
 
 /**
@@ -1819,7 +1837,7 @@ var Nt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *   FieldValueOptions to value().
  * - With respect to other ServerTimestampValues, they sort by their
  *   localWriteTime.
- */ function Rt(t) {
+ */ function qt(t) {
     var e, n;
     return "server_timestamp" === (null === (n = ((null === (e = null == t ? void 0 : t.mapValue) || void 0 === e ? void 0 : e.fields) || {}).__type__) || void 0 === n ? void 0 : n.stringValue);
 }
@@ -1829,14 +1847,14 @@ var Nt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *
  * Preserving the previous values allows the user to display the last resoled
  * value until the backend responds with the timestamp.
- */ function xt(t) {
+ */ function Ct(t) {
     var e = t.mapValue.fields.__previous_value__;
-    return Rt(e) ? xt(e) : e;
+    return qt(e) ? Ct(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Ct(t) {
+ */ function xt(t) {
     var e = Ft(t.mapValue.fields.__local_write_time__.timestampValue);
     return new bt(e.seconds, e.nanos);
 }
@@ -1865,7 +1883,7 @@ var Nt = 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 jt(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 ? Rt(t) ? 4 /* ServerTimestampValue */ : 
+    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 ? qt(t) ? 4 /* ServerTimestampValue */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
         return "__max__" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;
@@ -1885,7 +1903,7 @@ var Nt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         return t.booleanValue === e.booleanValue;
 
       case 4 /* ServerTimestampValue */ :
-        return Ct(t).isEqual(Ct(e));
+        return xt(t).isEqual(xt(e));
 
       case 3 /* TimestampValue */ :
         return function(t, e) {
@@ -1901,7 +1919,7 @@ var Nt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            return qt(t.bytesValue).isEqual(qt(e.bytesValue));
+            return Rt(t.bytesValue).isEqual(Rt(e.bytesValue));
         }(t, e);
 
       case 7 /* RefValue */ :
@@ -1965,17 +1983,17 @@ function Bt(t, e) {
         }(t, e);
 
       case 3 /* TimestampValue */ :
-        return zt(t.timestampValue, e.timestampValue);
+        return Gt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return zt(Ct(t), Ct(e));
+        return Gt(xt(t), xt(e));
 
       case 5 /* StringValue */ :
         return gt(t.stringValue, e.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            var n = qt(t), r = qt(e);
+            var n = Rt(t), r = Rt(e);
             return n.compareTo(r);
         }(t.bytesValue, e.bytesValue);
 
@@ -2028,13 +2046,13 @@ function Bt(t, e) {
     }
 }
 
-function zt(t, e) {
+function Gt(t, e) {
     if ("string" == typeof t && "string" == typeof e && t.length === e.length) return gt(t, e);
     var n = Ft(t), r = Ft(e), i = gt(n.seconds, r.seconds);
     return 0 !== i ? i : gt(n.nanos, r.nanos);
 }
 
-function Gt(t, e) {
+function zt(t, e) {
     return {
         referenceValue: "projects/" + t.projectId + "/databases/" + t.database + "/documents/" + e.path.canonicalString()
     };
@@ -2044,11 +2062,11 @@ function Gt(t, e) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Qt(t) {
+/** Returns true if `value` is a NullValue. */ function Wt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function Wt(t) {
+/** Returns true if `value` is NaN. */ function Qt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
@@ -2084,7 +2102,7 @@ function Gt(t, e) {
     return Object.assign({}, t);
 }
 
-var $t = /** @class */ function() {
+var Xt = /** @class */ function() {
     function t(t) {
         this.value = t;
     }
@@ -2177,7 +2195,7 @@ var $t = /** @class */ function() {
     }, t.prototype.clone = function() {
         return new t(Yt(this.value));
     }, t;
-}(), Xt = /** @class */ function() {
+}(), Jt = /** @class */ function() {
     function t(t, e, n, r, i, o) {
         this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.data = i, 
         this.documentState = o
@@ -2187,7 +2205,7 @@ var $t = /** @class */ function() {
      */;
     }
     return t.newInvalidDocument = function(e) {
-        return new t(e, 0 /* INVALID */ , _t.min(), _t.min(), $t.empty(), 0 /* SYNCED */);
+        return new t(e, 0 /* INVALID */ , _t.min(), _t.min(), Xt.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist with the given data at the
@@ -2197,7 +2215,7 @@ var $t = /** @class */ function() {
         return new t(e, 1 /* FOUND_DOCUMENT */ , n, _t.min(), r, 0 /* SYNCED */);
     }, 
     /** Creates a new document that is known to not exist at the given version. */ t.newNoDocument = function(e, n) {
-        return new t(e, 2 /* NO_DOCUMENT */ , n, _t.min(), $t.empty(), 0 /* SYNCED */);
+        return new t(e, 2 /* NO_DOCUMENT */ , n, _t.min(), Xt.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist at the given version but
@@ -2205,7 +2223,7 @@ var $t = /** @class */ function() {
      * base document).
      */
     t.newUnknownDocument = function(e, n) {
-        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, _t.min(), $t.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, _t.min(), Xt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }, 
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2220,7 +2238,7 @@ var $t = /** @class */ function() {
      * version.
      */
     t.prototype.convertToNoDocument = function(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = $t.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Xt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }, 
     /**
@@ -2229,7 +2247,7 @@ var $t = /** @class */ function() {
      * base document).
      */
     t.prototype.convertToUnknownDocument = function(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = $t.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Xt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }, t.prototype.setHasCommittedMutations = function() {
         return this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
@@ -2271,11 +2289,11 @@ var $t = /** @class */ function() {
     }, t.prototype.toString = function() {
         return "Document(" + this.key + ", " + this.version + ", " + JSON.stringify(this.data.value) + ", {documentType: " + this.documentType + "}), {documentState: " + this.documentState + "})";
     }, t;
-}(), Jt = function(t, e, n, r, i, o, a) {
+}(), Zt = function(t, e, n, r, i, o, a) {
     void 0 === e && (e = null), void 0 === n && (n = []), void 0 === r && (r = []), 
     void 0 === i && (i = null), void 0 === o && (o = null), void 0 === a && (a = null), 
     this.path = t, this.collectionGroup = e, this.orderBy = n, this.filters = r, this.limit = i, 
-    this.startAt = o, this.endAt = a, this.P = null;
+    this.startAt = o, this.endAt = a, this.D = null;
 };
 
 /**
@@ -2312,10 +2330,10 @@ var $t = /** @class */ function() {
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
  */
-function Zt(t, e, n, r, i, o, a) {
+function $t(t, e, n, r, i, o, a) {
     return void 0 === e && (e = null), void 0 === n && (n = []), void 0 === r && (r = []), 
     void 0 === i && (i = null), void 0 === o && (o = null), void 0 === a && (a = null), 
-    new Jt(t, e, n, r, i, o, a);
+    new Zt(t, e, n, r, i, o, a);
 }
 
 var te = /** @class */ function(e) {
@@ -2326,15 +2344,15 @@ var te = /** @class */ function(e) {
     /**
      * Creates a filter based on the provided arguments.
      */    return t(n, e), n.create = function(t, e, r) {
-        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, r) : new ee(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new oe(t, r) : "in" /* IN */ === e ? new ae(t, r) : "not-in" /* NOT_IN */ === e ? new se(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ue(t, r) : new n(t, e, r);
-    }, n.V = function(t, e, n) {
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.$(t, e, r) : new ee(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new oe(t, r) : "in" /* IN */ === e ? new ae(t, r) : "not-in" /* NOT_IN */ === e ? new se(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ue(t, r) : new n(t, e, r);
+    }, n.$ = function(t, e, n) {
         return "in" /* IN */ === e ? new ne(t, n) : new re(t, n);
     }, n.prototype.matches = function(t) {
         var e = t.data.field(this.field);
         // Types do not have to match in NOT_EQUAL filters.
-                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.N(Bt(e, this.value)) : null !== e && jt(this.value) === jt(e) && this.N(Bt(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.F(Bt(e, this.value)) : null !== e && jt(this.value) === jt(e) && this.F(Bt(e, this.value));
         // Only compare types with matching backend order (such as double and int).
-        }, n.prototype.N = function(t) {
+        }, n.prototype.F = function(t) {
         switch (this.op) {
           case "<" /* LESS_THAN */ :
             return t < 0;
@@ -2357,7 +2375,7 @@ var te = /** @class */ function(e) {
           default:
             return E();
         }
-    }, n.prototype.D = function() {
+    }, n.prototype.S = function() {
         return [ "<" /* LESS_THAN */ , "<=" /* LESS_THAN_OR_EQUAL */ , ">" /* GREATER_THAN */ , ">=" /* GREATER_THAN_OR_EQUAL */ , "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ].indexOf(this.op) >= 0;
     }, n;
 }((function() {})), ee = /** @class */ function(e) {
@@ -2368,7 +2386,7 @@ var te = /** @class */ function(e) {
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = nt.comparator(t.key, this.key);
-        return this.N(e);
+        return this.F(e);
     }, n;
 }(te), ne = /** @class */ function(e) {
     function n(t, n) {
@@ -2488,9 +2506,9 @@ function(t, e, n, r, i, o /* First */ , a, s) {
     void 0 === i && (i = null), void 0 === o && (o = "F"), void 0 === a && (a = null), 
     void 0 === s && (s = null), this.path = t, this.collectionGroup = e, this.explicitOrderBy = n, 
     this.filters = r, this.limit = i, this.limitType = o, this.startAt = a, this.endAt = s, 
-    this.$ = null, 
+    this.q = null, 
     // The corresponding `Target` of this `Query` instance.
-    this.F = null, this.startAt, this.endAt;
+    this.O = null, this.startAt, this.endAt;
 };
 
 /** Creates a new Query for a query that matches all documents at `path` */ function de(t) {
@@ -2500,7 +2518,7 @@ function(t, e, n, r, i, o /* First */ , a, s) {
 function ye(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
         var r = n[e];
-        if (r.D()) return r.field;
+        if (r.S()) return r.field;
     }
     return null;
 }
@@ -2521,35 +2539,35 @@ function ye(t) {
  * which can be different from the order by constraints the user provided (e.g.
  * the SDK and backend always orders by `__name__`).
  */ function ve(t) {
-    var e = k(t);
-    if (null === e.$) {
-        e.$ = [];
+    var e = S(t);
+    if (null === e.q) {
+        e.q = [];
         var n = ye(e), r = de(e);
         if (null !== n && null === r) 
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
         // Note that the default inequality field and key ordering is ascending.
-        n.isKeyField() || e.$.push(new le(n)), e.$.push(new le(et.keyField(), "asc" /* ASCENDING */)); else {
+        n.isKeyField() || e.q.push(new le(n)), e.q.push(new le(et.keyField(), "asc" /* ASCENDING */)); else {
             for (var i = !1, o = 0, a = e.explicitOrderBy; o < a.length; o++) {
                 var s = a[o];
-                e.$.push(s), s.field.isKeyField() && (i = !0);
+                e.q.push(s), s.field.isKeyField() && (i = !0);
             }
             if (!i) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 var u = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* ASCENDING */;
-                e.$.push(new le(et.keyField(), u));
+                e.q.push(new le(et.keyField(), u));
             }
         }
     }
-    return e.$;
+    return e.q;
 }
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
  */ function ge(t) {
-    var e = k(t);
-    if (!e.F) if ("F" /* First */ === e.limitType) e.F = Zt(e.path, e.collectionGroup, ve(e), e.filters, e.limit, e.startAt, e.endAt); else {
+    var e = S(t);
+    if (!e.O) if ("F" /* First */ === e.limitType) e.O = $t(e.path, e.collectionGroup, ve(e), e.filters, e.limit, e.startAt, e.endAt); else {
         for (
         // Flip the orderBy directions since we want the last results
         var n = [], r = 0, i = ve(e); r < i.length; r++) {
@@ -2559,9 +2577,9 @@ function ye(t) {
         // We need to swap the cursors to match the now-flipped query ordering.
                 var s = e.endAt ? new ce(e.endAt.position, e.endAt.inclusive) : null, u = e.startAt ? new ce(e.startAt.position, e.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
-                e.F = Zt(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
+                e.O = $t(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
     }
-    return e.F;
+    return e.O;
 }
 
 /**
@@ -2601,7 +2619,7 @@ function we(t, e) {
             integerValue: "" + t
         };
     }(e) : function(t, e) {
-        if (t.S) {
+        if (t.k) {
             if (isNaN(e)) return {
                 doubleValue: "NaN"
             };
@@ -2655,13 +2673,13 @@ function we(t, e) {
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(be), Se = /** @class */ function(e) {
+}(be), ke = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this) || this).q = t, r.O = n, r;
+        return (r = e.call(this) || this).C = t, r.L = n, r;
     }
     return t(n, e), n;
-}(be), ke = function(t, e) {
+}(be), Se = function(t, e) {
     this.field = t, this.transform = e;
 }, Ie = /** @class */ function() {
     function t(t, e) {
@@ -2695,7 +2713,7 @@ function we(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(Ae), De = /** @class */ function(e) {
+}(Ae), Pe = /** @class */ function(e) {
     function n(t, n, r, i, o) {
         void 0 === o && (o = []);
         var a = this;
@@ -2705,7 +2723,7 @@ function we(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return this.fieldMask;
     }, n;
-}(Ae), Pe = /** @class */ function(e) {
+}(Ae), De = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).key = t, r.precondition = n, r.type = 2 /* Delete */ , 
@@ -2737,8 +2755,8 @@ function we(t, e) {
     in: "IN",
     "not-in": "NOT_IN",
     "array-contains-any": "ARRAY_CONTAINS_ANY"
-}, qe = function(t, e) {
-    this.databaseId = t, this.S = e;
+}, Re = function(t, e) {
+    this.databaseId = t, this.k = e;
 };
 
 /** Transforms a value into a server-generated timestamp. */
@@ -2753,8 +2771,8 @@ function we(t, e) {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Re(t, e) {
-    return t.S ? new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "") + "." + ("000000000" + e.nanoseconds).slice(-9) + "Z" : {
+function qe(t, e) {
+    return t.k ? new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "") + "." + ("000000000" + e.nanoseconds).slice(-9) + "Z" : {
         seconds: "" + e.seconds,
         nanos: e.nanoseconds
     };
@@ -2764,16 +2782,16 @@ function Re(t, e) {
  * Returns a value for bytes that's appropriate to put in a proto.
  *
  * Visible for testing.
- */ function xe(t, e) {
-    return t.S ? e.toBase64() : e.toUint8Array();
+ */ function Ce(t, e) {
+    return t.k ? e.toBase64() : e.toUint8Array();
 }
 
-function Ce(t, e) {
-    return Re(t, e.toTimestamp());
+function xe(t, e) {
+    return qe(t, e.toTimestamp());
 }
 
 function Le(t) {
-    return S(!!t), _t.fromTimestamp(function(t) {
+    return k(!!t), _t.fromTimestamp(function(t) {
         var e = Ft(t);
         return new bt(e.seconds, e.nanos);
     }(t));
@@ -2781,7 +2799,7 @@ function Le(t) {
 
 function je(t, e) {
     return function(t) {
-        return new Z([ "projects", t.projectId, "databases", t.database ]);
+        return new $([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
@@ -2791,23 +2809,23 @@ function Me(t, e) {
 
 function Ue(t, e) {
     var n, r = function(t) {
-        var e = Z.fromString(t);
-        return S(Ye(e)), e;
+        var e = $.fromString(t);
+        return k(Ye(e)), e;
     }(e);
     if (r.get(1) !== t.databaseId.projectId) throw new M(V, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
     if (r.get(3) !== t.databaseId.database) throw new M(V, "Tried to deserialize key from different database: " + r.get(3) + " vs " + t.databaseId.database);
-    return new nt((S((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
+    return new nt((k((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
 }
 
 function Be(t, e) {
     return je(t.databaseId, e);
 }
 
-function ze(t) {
-    return new Z([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
+function Ge(t) {
+    return new $([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Ge(t, e, n) {
+function ze(t, e, n) {
     return {
         name: Me(t, e),
         fields: n.value.mapValue.fields
@@ -2819,11 +2837,11 @@ function Ke(t) {
 }
 
 // visible for testing
-function Qe(t) {
+function We(t) {
     return Oe[t];
 }
 
-function We(t) {
+function Qe(t) {
     return {
         fieldPath: t.canonicalString()
     };
@@ -2858,8 +2876,8 @@ function Ye(t) {
  * 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.
- */ function $e(t) {
-    return new qe(t, /* useProto3Json= */ !0);
+ */ function Xe(t) {
+    return new Re(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -2886,7 +2904,7 @@ function Ye(t) {
  * backoff curve, and a +/- 50% "jitter" that is calculated and added to the
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
- */ var Xe = /** @class */ function() {
+ */ var Je = /** @class */ function() {
     function t(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -2912,9 +2930,9 @@ function Ye(t) {
      * much as 1.5*maxDelayMs.
      */ , i) {
         void 0 === n && (n = 1e3), void 0 === r && (r = 1.5), void 0 === i && (i = 6e4), 
-        this.k = t, this.timerId = e, this.C = n, this.L = r, this.M = i, this.U = 0, this.j = null, 
+        this.M = t, this.timerId = e, this.U = n, this.j = r, this.B = i, this.G = 0, this.W = null, 
         /** The last backoff attempt, as epoch milliseconds. */
-        this.B = Date.now(), this.reset();
+        this.K = Date.now(), this.reset();
     }
     /**
      * Resets the backoff delay.
@@ -2923,73 +2941,73 @@ function Ye(t) {
      * (i.e. due to an error), initialDelayMs (plus jitter) will be used, and
      * subsequent ones will increase according to the backoffFactor.
      */    return t.prototype.reset = function() {
-        this.U = 0;
+        this.G = 0;
     }, 
     /**
      * Resets the backoff delay to the maximum delay (e.g. for use after a
      * RESOURCE_EXHAUSTED error).
      */
-    t.prototype.G = function() {
-        this.U = this.M;
+    t.prototype.Y = function() {
+        this.G = this.B;
     }, 
     /**
      * Returns a promise that resolves after currentDelayMs, and increases the
      * delay for any subsequent attempts. If there was a pending backoff operation
      * already, it will be canceled.
      */
-    t.prototype.W = function(t) {
+    t.prototype.H = function(t) {
         var e = this;
         // Cancel any pending backoff operation.
                 this.cancel();
         // First schedule using the current base (which may be 0 and should be
         // honored as such).
-        var n = Math.floor(this.U + this.K()), r = Math.max(0, Date.now() - this.B), i = Math.max(0, n - r);
+        var n = Math.floor(this.G + this.J()), r = Math.max(0, Date.now() - this.K), i = Math.max(0, n - r);
         // Guard against lastAttemptTime being in the future due to a clock change.
-                i > 0 && w("ExponentialBackoff", "Backing off for " + i + " ms (base delay: " + this.U + " ms, delay with jitter: " + n + " ms, last attempt: " + r + " ms ago)"), 
-        this.j = this.k.enqueueAfterDelay(this.timerId, i, (function() {
-            return e.B = Date.now(), t();
+                i > 0 && w("ExponentialBackoff", "Backing off for " + i + " ms (base delay: " + this.G + " ms, delay with jitter: " + n + " ms, last attempt: " + r + " ms ago)"), 
+        this.W = this.M.enqueueAfterDelay(this.timerId, i, (function() {
+            return e.K = Date.now(), t();
         })), 
         // Apply backoff factor to determine next delay and ensure it is within
         // bounds.
-        this.U *= this.L, this.U < this.C && (this.U = this.C), this.U > this.M && (this.U = this.M);
-    }, t.prototype.Y = function() {
-        null !== this.j && (this.j.skipDelay(), this.j = null);
+        this.G *= this.j, this.G < this.U && (this.G = this.U), this.G > this.B && (this.G = this.B);
+    }, t.prototype.X = function() {
+        null !== this.W && (this.W.skipDelay(), this.W = null);
     }, t.prototype.cancel = function() {
-        null !== this.j && (this.j.cancel(), this.j = null);
+        null !== this.W && (this.W.cancel(), this.W = null);
     }, 
-    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.K = function() {
-        return (Math.random() - .5) * this.U;
+    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.J = function() {
+        return (Math.random() - .5) * this.G;
     }, t;
-}(), Je = /** @class */ function(e) {
+}(), Ze = /** @class */ function(e) {
     function n(t, n, r, i) {
         var o = this;
         return (o = e.call(this) || this).authCredentials = t, o.appCheckCredentials = n, 
-        o.H = r, o.q = i, o.J = !1, o;
+        o.Z = r, o.C = i, o.tt = !1, o;
     }
-    return t(n, e), n.prototype.X = function() {
-        if (this.J) throw new M(q, "The client has already been terminated.");
+    return t(n, e), n.prototype.et = function() {
+        if (this.tt) throw new M(R, "The client has already been terminated.");
     }, 
-    /** Invokes the provided RPC with auth and AppCheck tokens. */ n.prototype.m = function(t, e, n) {
+    /** Invokes the provided RPC with auth and AppCheck tokens. */ n.prototype.v = function(t, e, n) {
         var r = this;
-        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(i) {
+        return this.et(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(i) {
             var o = i[0], a = i[1];
-            return r.H.m(t, e, n, o, a);
+            return r.Z.v(t, e, n, o, a);
         })).catch((function(t) {
             throw "FirebaseError" === t.name ? (t.code === F && (r.authCredentials.invalidateToken(), 
             r.appCheckCredentials.invalidateToken()), t) : new M(A, t.toString());
         }));
     }, 
-    /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */ n.prototype.T = function(t, e, n, r) {
+    /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */ n.prototype.R = function(t, e, n, r) {
         var i = this;
-        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(o) {
+        return this.et(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(o) {
             var a = o[0], s = o[1];
-            return i.H.T(t, e, n, a, s, r);
+            return i.Z.R(t, e, n, a, s, r);
         })).catch((function(t) {
             throw "FirebaseError" === t.name ? (t.code === F && (i.authCredentials.invalidateToken(), 
             i.appCheckCredentials.invalidateToken()), t) : new M(A, t.toString());
         }));
     }, n.prototype.terminate = function() {
-        this.J = !0;
+        this.tt = !0;
     }, n;
 }((function() {}));
 
@@ -3020,22 +3038,22 @@ function Ye(t) {
  */
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-function Ze(t, r) {
+function $e(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = k(t), i = ze(e.q) + "/documents", o = {
+                return e = S(t), i = Ge(e.C) + "/documents", o = {
                     writes: r.map((function(t) {
                         return function(t, e) {
                             var n;
                             if (e instanceof Ve) n = {
-                                update: Ge(t, e.key, e.value)
-                            }; else if (e instanceof Pe) n = {
-                                delete: Me(t, e.key)
+                                update: ze(t, e.key, e.value)
                             }; else if (e instanceof De) n = {
-                                update: Ge(t, e.key, e.data),
+                                delete: Me(t, e.key)
+                            }; else if (e instanceof Pe) n = {
+                                update: ze(t, e.key, e.data),
                                 updateMask: He(e.fieldMask)
                             }; else {
                                 if (!(e instanceof Ne)) return E();
@@ -3062,22 +3080,22 @@ function Ze(t, r) {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof Se) return {
+                                    if (n instanceof ke) return {
                                         fieldPath: e.field.canonicalString(),
-                                        increment: n.O
+                                        increment: n.L
                                     };
                                     throw E();
                                 }(0, t);
                             }))), e.precondition.isNone || (n.currentDocument = function(t, e) {
                                 return void 0 !== e.updateTime ? {
-                                    updateTime: Ce(t, e.updateTime)
+                                    updateTime: xe(t, e.updateTime)
                                 } : void 0 !== e.exists ? {
                                     exists: e.exists
                                 } : E();
                             }(t, e.precondition)), n;
-                        }(e.q, t);
+                        }(e.C, t);
                     }))
-                }, [ 4 /*yield*/ , e.m("Commit", i, o) ];
+                }, [ 4 /*yield*/ , e.v("Commit", i, o) ];
 
               case 1:
                 return n.sent(), [ 2 /*return*/ ];
@@ -3092,33 +3110,33 @@ function tn(t, r) {
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = k(t), i = ze(e.q) + "/documents", o = {
+                return e = S(t), i = Ge(e.C) + "/documents", o = {
                     documents: r.map((function(t) {
-                        return Me(e.q, t);
+                        return Me(e.C, t);
                     }))
-                }, [ 4 /*yield*/ , e.T("BatchGetDocuments", i, o, r.length) ];
+                }, [ 4 /*yield*/ , e.R("BatchGetDocuments", i, o, r.length) ];
 
               case 1:
                 return a = n.sent(), s = new Map, a.forEach((function(t) {
                     var n = function(t, e) {
                         return "found" in e ? function(t, e) {
-                            S(!!e.found), e.found.name, e.found.updateTime;
-                            var n = Ue(t, e.found.name), r = Le(e.found.updateTime), i = new $t({
+                            k(!!e.found), e.found.name, e.found.updateTime;
+                            var n = Ue(t, e.found.name), r = Le(e.found.updateTime), i = new Xt({
                                 mapValue: {
                                     fields: e.found.fields
                                 }
                             });
-                            return Xt.newFoundDocument(n, r, i);
+                            return Jt.newFoundDocument(n, r, i);
                         }(t, e) : "missing" in e ? function(t, e) {
-                            S(!!e.missing), S(!!e.readTime);
+                            k(!!e.missing), k(!!e.readTime);
                             var n = Ue(t, e.missing), r = Le(e.readTime);
-                            return Xt.newNoDocument(n, r);
+                            return Jt.newNoDocument(n, r);
                         }(t, e) : E();
-                    }(e.q, t);
+                    }(e.C, t);
                     s.set(n.key.toString(), n);
                 })), u = [], [ 2 /*return*/ , (r.forEach((function(t) {
                     var e = s.get(t.toString());
-                    S(!!e), u.push(e);
+                    k(!!e), u.push(e);
                 })), u) ];
             }
         }));
@@ -3131,7 +3149,7 @@ function en(t, r) {
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = k(t), i = function(t, e) {
+                return e = S(t), i = function(t, e) {
                     // Dissect the path into parent, collectionId, and optional key filter.
                     var n = {
                         structuredQuery: {}
@@ -3148,36 +3166,36 @@ function en(t, r) {
                                 // visible for testing
                                 return function(t) {
                                     if ("==" /* EQUAL */ === t.op) {
-                                        if (Wt(t.value)) return {
+                                        if (Qt(t.value)) return {
                                             unaryFilter: {
-                                                field: We(t.field),
+                                                field: Qe(t.field),
                                                 op: "IS_NAN"
                                             }
                                         };
-                                        if (Qt(t.value)) return {
+                                        if (Wt(t.value)) return {
                                             unaryFilter: {
-                                                field: We(t.field),
+                                                field: Qe(t.field),
                                                 op: "IS_NULL"
                                             }
                                         };
                                     } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                                        if (Wt(t.value)) return {
+                                        if (Qt(t.value)) return {
                                             unaryFilter: {
-                                                field: We(t.field),
+                                                field: Qe(t.field),
                                                 op: "IS_NOT_NAN"
                                             }
                                         };
-                                        if (Qt(t.value)) return {
+                                        if (Wt(t.value)) return {
                                             unaryFilter: {
-                                                field: We(t.field),
+                                                field: Qe(t.field),
                                                 op: "IS_NOT_NULL"
                                             }
                                         };
                                     }
                                     return {
                                         fieldFilter: {
-                                            field: We(t.field),
-                                            op: Qe(t.op),
+                                            field: Qe(t.field),
+                                            op: We(t.op),
                                             value: t.value
                                         }
                                     };
@@ -3197,7 +3215,7 @@ function en(t, r) {
                             // visible for testing
                             return function(t) {
                                 return {
-                                    field: We(t.field),
+                                    field: Qe(t.field),
                                     direction: Ke(t.dir)
                                 };
                             }(t);
@@ -3205,7 +3223,7 @@ function en(t, r) {
                     }(e.orderBy);
                     o && (n.structuredQuery.orderBy = o);
                     var a, s = function(t, e) {
-                        return t.S || ct(e) ? e : {
+                        return t.k || ct(e) ? e : {
                             value: e
                         };
                     }(t, e.limit);
@@ -3218,7 +3236,7 @@ function en(t, r) {
                             values: t.position
                         };
                     }(e.endAt)), n;
-                }(e.q, ge(r)), [ 4 /*yield*/ , e.T("RunQuery", i.parent, {
+                }(e.C, ge(r)), [ 4 /*yield*/ , e.R("RunQuery", i.parent, {
                     structuredQuery: i.structuredQuery
                 }) ];
 
@@ -3227,13 +3245,13 @@ function en(t, r) {
                     return !!t.document;
                 })).map((function(t) {
                     return function(t, e, n) {
-                        var r = Ue(t, e.name), i = Le(e.updateTime), o = new $t({
+                        var r = Ue(t, e.name), i = Le(e.updateTime), o = new Xt({
                             mapValue: {
                                 fields: e.fields
                             }
-                        }), a = Xt.newFoundDocument(r, i, o);
+                        }), a = Jt.newFoundDocument(r, i, o);
                         return a;
-                    }(e.q, t.document);
+                    }(e.C, t.document);
                 })) ];
             }
         }));
@@ -3266,14 +3284,14 @@ function en(t, r) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */ function rn(t) {
-    if (t._terminated) throw new M(q, "The client has already been terminated.");
+    if (t._terminated) throw new M(R, "The client has already been terminated.");
     if (!nn.has(t)) {
         w("ComponentProvider", "Initializing Datastore");
         var e = function(t) {
             return new yt(t, fetch.bind(null));
         }((i = t._databaseId, o = t.app.options.appId || "", a = t._persistenceKey, s = t._freezeSettings(), 
-        new $(i, o, a, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), n = $e(t._databaseId), r = function(t, e, n, r) {
-            return new Je(t, e, n, r);
+        new X(i, o, a, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), n = Xe(t._databaseId), r = function(t, e, n, r) {
+            return new Ze(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, e, n);
         nn.set(t, r);
     }
@@ -3326,17 +3344,14 @@ function en(t, r) {
     }, t;
 }(), an = /** @class */ function() {
     /** @hideconstructor */
-    function t(t, e, n) {
-        this._authCredentials = e, this._appCheckCredentials = n, 
+    function t(t, e, n, r) {
+        this._authCredentials = t, this._appCheckCredentials = e, this._databaseId = n, 
+        this._app = r, 
         /**
              * Whether it's a Firestore or Firestore Lite instance.
              */
         this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new on({}), 
-        this._settingsFrozen = !1, t instanceof X ? this._databaseId = t : (this._app = t, 
-        this._databaseId = function(t) {
-            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new M(V, '"projectId" not provided in firebase.initializeApp.');
-            return new X(t.options.projectId);
-        }(t));
+        this._settingsFrozen = !1;
     }
     return Object.defineProperty(t.prototype, "app", {
         /**
@@ -3344,7 +3359,7 @@ function en(t, r) {
          * instance.
          */
         get: function() {
-            if (!this._app) throw new M(q, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+            if (!this._app) throw new M(R, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
             return this._app;
         },
         enumerable: !1,
@@ -3362,15 +3377,13 @@ function en(t, r) {
         enumerable: !1,
         configurable: !0
     }), t.prototype._setSettings = function(t) {
-        if (this._settingsFrozen) throw new M(q, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
+        if (this._settingsFrozen) throw new M(R, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
         this._settings = new on(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
-            if (!t) return new z;
+            if (!t) return new G;
             switch (t.type) {
               case "gapi":
                 var e = t.client;
-                // Make sure this really is a Gapi client.
-                                return S(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
-                new W(e, t.sessionIndex || "0", t.iamToken || null);
+                return new Q(e, t.sessionIndex || "0", t.iamToken || null, t.authTokenFactory || null);
 
               case "provider":
                 return t.client;
@@ -3427,24 +3440,21 @@ function en(t, r) {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ function sn(t, e) {
-    var n = _getProvider(t, "firestore/lite");
-    if (n.isInitialized()) throw new M(q, "Firestore can only be initialized once per app.");
-    return n.initialize({
-        options: e
+ */ function sn(t, e, n) {
+    n || (n = "(default)");
+    var r = _getProvider(t, "firestore/lite");
+    if (r.isInitialized(n)) throw new M(R, "Firestore can only be initialized once per app.");
+    return r.initialize({
+        options: e,
+        instanceIdentifier: n
     });
 }
 
-/**
- * Returns the existing `Firestore` instance that is associated with the
- * provided {@link @firebase/app#FirebaseApp}. If no instance exists, initializes a new
- * instance with default settings.
- *
- * @param app - The {@link @firebase/app#FirebaseApp} instance that the returned `Firestore`
- * instance is associated with.
- * @returns The `Firestore` instance of the provided app.
- */ function un(t) {
-    return void 0 === t && (t = s()), _getProvider(t, "firestore/lite").getImmediate();
+function un(t, e) {
+    var n = "object" == typeof t ? t : s(), r = "string" == typeof t ? t : e || "(default)";
+    return _getProvider(n, "firestore/lite").getImmediate({
+        identifier: r
+    });
 }
 
 /**
@@ -3477,7 +3487,7 @@ function en(t, r) {
             if (!u) throw new M(V, "mockUserToken must contain 'sub' or 'user_id' field!");
             s = new y(u);
         }
-        t._authCredentials = new G(new B(a, s));
+        t._authCredentials = new z(new B(a, s));
     }
 }
 
@@ -3651,11 +3661,11 @@ var fn = /** @class */ function() {
  */ function dn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
     if (t = p(t), rt("collection", "path", e), t instanceof an) {
-        var o = Z.fromString.apply(Z, r([ e ], n));
+        var o = $.fromString.apply($, r([ e ], n));
         return ot(o), new pn(t, /* converter= */ null, o);
     }
     if (!(t instanceof fn || t instanceof pn)) throw new M(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-    var a = t._path.child(Z.fromString.apply(Z, r([ e ], n)));
+    var a = t._path.child($.fromString.apply($, r([ e ], n)));
     return ot(a), new pn(t.firestore, 
     /* converter= */ null, a);
 }
@@ -3681,7 +3691,7 @@ var fn = /** @class */ function() {
  * within the provided collection group.
  */
     function(t) {
-        return new pe(Z.emptyPath(), t);
+        return new pe($.emptyPath(), t);
     }(e));
 }
 
@@ -3690,13 +3700,13 @@ function mn(t, e) {
     if (t = p(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = vt.R()), rt("doc", "path", e), t instanceof an) {
-        var o = Z.fromString.apply(Z, r([ e ], n));
+    1 === arguments.length && (e = vt.N()), rt("doc", "path", e), t instanceof an) {
+        var o = $.fromString.apply($, r([ e ], n));
         return it(o), new fn(t, 
         /* converter= */ null, new nt(o));
     }
     if (!(t instanceof fn || t instanceof pn)) throw new M(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-    var a = t._path.child(Z.fromString.apply(Z, r([ e ], n)));
+    var a = t._path.child($.fromString.apply($, r([ e ], n)));
     return it(a), new fn(t.firestore, t instanceof pn ? t.converter : null, new nt(a));
 }
 
@@ -3818,7 +3828,7 @@ var wn = /** @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(Dt.fromBase64String(e));
         } catch (e) {
             throw new M(V, "Failed to construct data from Base64 string: " + e);
         }
@@ -3829,7 +3839,7 @@ var wn = /** @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(Dt.fromUint8Array(e));
     }, 
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3924,12 +3934,12 @@ function(t) {
     t.prototype._compareTo = function(t) {
         return gt(this._lat, t._lat) || gt(this._long, t._long);
     }, t;
-}(), Sn = /^__.*__$/, kn = /** @class */ function() {
+}(), kn = /^__.*__$/, Sn = /** @class */ function() {
     function t(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     return t.prototype.toMutation = function(t, e) {
-        return null !== this.fieldMask ? new De(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Ve(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new Pe(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Ve(t, this.data, e, this.fieldTransforms);
     }, t;
 }(), In = /** @class */ function() {
     function t(t, 
@@ -3938,7 +3948,7 @@ function(t) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     return t.prototype.toMutation = function(t, e) {
-        return new De(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new Pe(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }, t;
 }();
 
@@ -3999,10 +4009,10 @@ function(t) {
      * compromised).
      */
     function t(t, e, n, r, i, o) {
-        this.settings = t, this.databaseId = e, this.q = n, this.ignoreUndefinedProperties = r, 
+        this.settings = t, this.databaseId = e, this.C = n, this.ignoreUndefinedProperties = r, 
         // Minor hack: If fieldTransforms is undefined, we assume this is an
         // external call and we need to validate the entire path.
-        void 0 === i && this.Z(), this.fieldTransforms = i || [], this.fieldMask = o || [];
+        void 0 === i && this.nt(), this.fieldTransforms = i || [], this.fieldMask = o || [];
     }
     return Object.defineProperty(t.prototype, "path", {
         get: function() {
@@ -4010,36 +4020,36 @@ function(t) {
         },
         enumerable: !1,
         configurable: !0
-    }), Object.defineProperty(t.prototype, "tt", {
+    }), Object.defineProperty(t.prototype, "rt", {
         get: function() {
-            return this.settings.tt;
+            return this.settings.rt;
         },
         enumerable: !1,
         configurable: !0
     }), 
-    /** Returns a new context with the specified settings overwritten. */ t.prototype.et = function(e) {
-        return new t(Object.assign(Object.assign({}, this.settings), e), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
-    }, t.prototype.nt = function(t) {
-        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.et({
+    /** Returns a new context with the specified settings overwritten. */ t.prototype.st = function(e) {
+        return new t(Object.assign(Object.assign({}, this.settings), e), this.databaseId, this.C, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+    }, t.prototype.it = function(t) {
+        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.st({
             path: n,
-            rt: !1
+            ot: !1
         });
-        return r.st(t), r;
-    }, t.prototype.it = function(t) {
-        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.et({
+        return r.ut(t), r;
+    }, t.prototype.ct = function(t) {
+        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.st({
             path: n,
-            rt: !1
+            ot: !1
         });
-        return r.Z(), r;
-    }, t.prototype.ot = function(t) {
+        return r.nt(), r;
+    }, t.prototype.at = function(t) {
         // TODO(b/34871131): We don't support array paths right now; so make path
         // undefined.
-        return this.et({
+        return this.st({
             path: void 0,
-            rt: !0
+            ot: !0
         });
-    }, t.prototype.ut = function(t) {
-        return Hn(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
+    }, t.prototype.ht = function(t) {
+        return Hn(t, this.settings.methodName, this.settings.lt || !1, this.path, this.settings.ft);
     }, 
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */ t.prototype.contains = function(t) {
         return void 0 !== this.fieldMask.find((function(e) {
@@ -4047,55 +4057,55 @@ function(t) {
         })) || void 0 !== this.fieldTransforms.find((function(e) {
             return t.isPrefixOf(e.field);
         }));
-    }, t.prototype.Z = function() {
+    }, t.prototype.nt = function() {
         // TODO(b/34871131): Remove null check once we have proper paths for fields
         // within arrays.
-        if (this.path) for (var t = 0; t < this.path.length; t++) this.st(this.path.get(t));
-    }, t.prototype.st = function(t) {
-        if (0 === t.length) throw this.ut("Document fields must not be empty");
-        if (An(this.tt) && Sn.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
+        if (this.path) for (var t = 0; t < this.path.length; t++) this.ut(this.path.get(t));
+    }, t.prototype.ut = function(t) {
+        if (0 === t.length) throw this.ht("Document fields must not be empty");
+        if (An(this.rt) && kn.test(t)) throw this.ht('Document fields cannot begin and end with "__"');
     }, t;
-}(), Dn = /** @class */ function() {
+}(), Pn = /** @class */ function() {
     function t(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.q = n || $e(t)
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.C = n || Xe(t)
         /** Creates a new top-level parse context. */;
     }
-    return t.prototype.ht = function(t, e, n, r) {
+    return t.prototype.dt = function(t, e, n, r) {
         return void 0 === r && (r = !1), new Vn({
-            tt: t,
+            rt: t,
             methodName: e,
-            at: n,
+            ft: n,
             path: et.emptyPath(),
-            rt: !1,
-            ct: r
-        }, this.databaseId, this.q, this.ignoreUndefinedProperties);
+            ot: !1,
+            lt: r
+        }, this.databaseId, this.C, this.ignoreUndefinedProperties);
     }, t;
 }();
 
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ function Pn(t) {
-    var e = t._freezeSettings(), n = $e(t._databaseId);
-    return new Dn(t._databaseId, !!e.ignoreUndefinedProperties, n);
+ */ function Dn(t) {
+    var e = t._freezeSettings(), n = Xe(t._databaseId);
+    return new Pn(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
 /** Parse document data from a set() call. */ function Nn(t, e, n, r, i, o) {
     void 0 === o && (o = {});
-    var a = t.ht(o.merge || o.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
-    Gn("Data must be an object, but it was:", a, r);
+    var a = t.dt(o.merge || o.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
+    zn("Data must be an object, but it was:", a, r);
     var s, u, c = Bn(r, a);
-    if (o.merge) s = new Dt(a.fieldMask), u = a.fieldTransforms; else if (o.mergeFields) {
+    if (o.merge) s = new Pt(a.fieldMask), u = a.fieldTransforms; else if (o.mergeFields) {
         for (var l = [], f = 0, h = o.mergeFields; f < h.length; f++) {
             var p = Kn(e, h[f], n);
             if (!a.contains(p)) throw new M(V, "Field '" + p + "' is specified in your field mask but missing from your input data.");
             Yn(l, p) || l.push(p);
         }
-        s = new Dt(l), u = a.fieldTransforms.filter((function(t) {
+        s = new Pt(l), u = a.fieldTransforms.filter((function(t) {
             return s.covers(t.field);
         }));
     } else s = null, u = a.fieldTransforms;
-    return new kn(new $t(c), s, u);
+    return new Sn(new Xt(c), s, u);
 }
 
 var Fn = /** @class */ function(e) {
@@ -4103,7 +4113,7 @@ var Fn = /** @class */ function(e) {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        if (2 /* MergeSet */ !== t.tt) throw 1 /* Update */ === t.tt ? t.ut(this._methodName + "() can only appear at the top level of your update data") : t.ut(this._methodName + "() cannot be used with set() unless you pass {merge:true}");
+        if (2 /* MergeSet */ !== t.rt) throw 1 /* Update */ === t.rt ? t.ht(this._methodName + "() can only appear at the top level of your update data") : t.ht(this._methodName + "() cannot be used with set() unless you pass {merge:true}");
         // No transform to add for a delete, but we need to add it to our
         // fieldMask so it gets deleted.
                 return t.fieldMask.push(t.path), null;
@@ -4129,60 +4139,60 @@ var Fn = /** @class */ function(e) {
  * @param arrayElement - Whether or not the FieldValue has an array.
  */ function On(t, e, n) {
     return new Vn({
-        tt: 3 /* Argument */ ,
-        at: e.settings.at,
+        rt: 3 /* Argument */ ,
+        ft: e.settings.ft,
         methodName: t._methodName,
-        rt: n
-    }, e.databaseId, e.q, e.ignoreUndefinedProperties);
+        ot: n
+    }, e.databaseId, e.C, e.ignoreUndefinedProperties);
 }
 
-var qn = /** @class */ function(e) {
+var Rn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        return new ke(t.path, new _e);
+        return new Se(t.path, new _e);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(Tn), Rn = /** @class */ function(e) {
+}(Tn), qn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t) || this).lt = n, r;
+        return (r = e.call(this, t) || this).wt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
         var e = On(this, t, 
-        /*array=*/ !0), n = this.lt.map((function(t) {
+        /*array=*/ !0), n = this.wt.map((function(t) {
             return Un(t, e);
         })), r = new Te(n);
-        return new ke(t.path, r);
+        return new Se(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(Tn), xn = /** @class */ function(e) {
+}(Tn), Cn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t) || this).lt = n, r;
+        return (r = e.call(this, t) || this).wt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
         var e = On(this, t, 
-        /*array=*/ !0), n = this.lt.map((function(t) {
+        /*array=*/ !0), n = this.wt.map((function(t) {
             return Un(t, e);
         })), r = new Ee(n);
-        return new ke(t.path, r);
+        return new Se(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(Tn), Cn = /** @class */ function(e) {
+}(Tn), 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).yt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = new Se(t.q, we(t.q, this.ft));
-        return new ke(t.path, e);
+        var e = new ke(t.C, we(t.C, this.yt));
+        return new Se(t.path, e);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
@@ -4190,15 +4200,15 @@ var qn = /** @class */ function(e) {
 }(Tn);
 
 /** Parse update data from an update() call. */ function Ln(t, e, n, r) {
-    var i = t.ht(1 /* Update */ , e, n);
-    Gn("Data must be an object, but it was:", i, r);
-    var o = [], a = $t.empty();
+    var i = t.dt(1 /* Update */ , e, n);
+    zn("Data must be an object, but it was:", i, r);
+    var o = [], a = Xt.empty();
     Et(r, (function(t, r) {
-        var s = Wn(e, t, n);
+        var s = Qn(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = p(r);
-        var u = i.it(s);
+        var u = i.ct(s);
         if (r instanceof Fn) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(s); else {
@@ -4206,22 +4216,22 @@ var qn = /** @class */ function(e) {
             null != c && (o.push(s), a.set(s, c));
         }
     }));
-    var s = new Dt(o);
+    var s = new Pt(o);
     return new In(a, s, i.fieldTransforms);
 }
 
 /** Parse update data from a list of field/value arguments. */ function jn(t, e, n, r, i, o) {
-    var a = t.ht(1 /* Update */ , e, n), s = [ Kn(e, r, n) ], u = [ i ];
+    var a = t.dt(1 /* Update */ , e, n), s = [ Kn(e, r, n) ], u = [ i ];
     if (o.length % 2 != 0) throw new M(V, "Function " + e + "() needs to be called with an even number of arguments that alternate between field names and values.");
     for (var c = 0; c < o.length; c += 2) s.push(Kn(e, o[c])), u.push(o[c + 1]);
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
-    for (var l = [], f = $t.empty(), h = s.length - 1; h >= 0; --h) if (!Yn(l, s[h])) {
+    for (var l = [], f = Xt.empty(), h = s.length - 1; h >= 0; --h) if (!Yn(l, s[h])) {
         var d = s[h], y = u[h];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
         y = p(y);
-        var m = a.it(d);
+        var m = a.ct(d);
         if (y instanceof Fn) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(d); else {
@@ -4229,7 +4239,7 @@ var qn = /** @class */ function(e) {
             null != v && (l.push(d), f.set(d, v));
         }
     }
-    var g = new Dt(l);
+    var g = new Pt(l);
     return new In(f, g, a.fieldTransforms);
 }
 
@@ -4240,7 +4250,7 @@ var qn = /** @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 Mn(t, e, n, r) {
-    return void 0 === r && (r = !1), Un(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+    return void 0 === r && (r = !1), Un(n, t.dt(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -4252,10 +4262,10 @@ var qn = /** @class */ function(e) {
  * @returns The parsed value, or null if the value was a FieldValue sentinel
  * that should not be included in the resulting parsed data.
  */ function Un(t, e) {
-    if (zn(
+    if (Gn(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = p(t))) return Gn("Unsupported field value:", e, t), Bn(t, e);
+    t = p(t))) return zn("Unsupported field value:", e, t), Bn(t, e);
     if (t instanceof Tn) 
     // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
@@ -4268,8 +4278,8 @@ var qn = /** @class */ function(e) {
      */
     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 (!e.path) throw e.ut(t._methodName + "() is not currently supported inside arrays");
+        if (!An(e.rt)) throw e.ht(t._methodName + "() can only be used with update() and set()");
+        if (!e.path) throw e.ht(t._methodName + "() is not currently supported inside arrays");
         var n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
     }(t, e), null;
@@ -4288,10 +4298,10 @@ var qn = /** @class */ function(e) {
         // the set of values to be included for the IN query) that may directly
         // contain additional arrays (each representing an individual field
         // value), so we disable this validation.
-        if (e.settings.rt && 4 /* ArrayArgument */ !== e.tt) throw e.ut("Nested arrays are not supported");
+        if (e.settings.ot && 4 /* ArrayArgument */ !== e.rt) throw e.ht("Nested arrays are not supported");
         return function(t, e) {
             for (var n = [], r = 0, i = 0, o = t; i < o.length; i++) {
-                var a = Un(o[i], e.ot(r));
+                var a = Un(o[i], e.at(r));
                 null == a && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4310,7 +4320,7 @@ var qn = /** @class */ function(e) {
         if (null === (t = p(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return we(e.q, t);
+        if ("number" == typeof t) return we(e.C, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4320,7 +4330,7 @@ var qn = /** @class */ function(e) {
         if (t instanceof Date) {
             var n = bt.fromDate(t);
             return {
-                timestampValue: Re(e.q, n)
+                timestampValue: qe(e.C, n)
             };
         }
         if (t instanceof bt) {
@@ -4329,7 +4339,7 @@ var qn = /** @class */ function(e) {
             // truncation immediately without waiting for the backend to do that.
             var r = new bt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Re(e.q, r)
+                timestampValue: qe(e.C, r)
             };
         }
         if (t instanceof En) return {
@@ -4339,16 +4349,16 @@ var qn = /** @class */ function(e) {
             }
         };
         if (t instanceof _n) return {
-            bytesValue: xe(e.q, t._byteString)
+            bytesValue: Ce(e.C, t._byteString)
         };
         if (t instanceof fn) {
             var i = e.databaseId, o = t.firestore._databaseId;
-            if (!o.isEqual(i)) throw e.ut("Document reference is for database " + o.projectId + "/" + o.database + " but should be for database " + i.projectId + "/" + i.database);
+            if (!o.isEqual(i)) throw e.ht("Document reference is for database " + o.projectId + "/" + o.database + " but should be for database " + i.projectId + "/" + i.database);
             return {
                 referenceValue: je(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.ut("Unsupported field value: " + at(t));
+        throw e.ht("Unsupported field value: " + at(t));
     }(t, e);
 }
 
@@ -4361,7 +4371,7 @@ function Bn(t, e) {
     // If we encounter an empty object, we explicitly add it to the update
     // mask to ensure that the server creates a map entry.
     e.path && e.path.length > 0 && e.fieldMask.push(e.path) : Et(t, (function(t, r) {
-        var i = Un(r, e.nt(t));
+        var i = Un(r, e.it(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -4370,16 +4380,16 @@ function Bn(t, e) {
     };
 }
 
-function zn(t) {
+function Gn(t) {
     return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof bt || t instanceof En || t instanceof _n || t instanceof fn || t instanceof Tn);
 }
 
-function Gn(t, e, n) {
-    if (!zn(n) || !function(t) {
+function zn(t, e, n) {
+    if (!Gn(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         var r = at(n);
-        throw "an object" === r ? e.ut(t + " a custom object") : e.ut(t + " " + r);
+        throw "an object" === r ? e.ht(t + " a custom object") : e.ht(t + " " + r);
     }
 }
 
@@ -4390,7 +4400,7 @@ function Gn(t, e, n) {
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
     (e = p(e)) instanceof wn) return e._internalPath;
-    if ("string" == typeof e) return Wn(t, e);
+    if ("string" == typeof e) return Qn(t, e);
     throw Hn("Field path arguments must be of type string or ", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
@@ -4398,7 +4408,7 @@ function Gn(t, e, n) {
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ var Qn = new RegExp("[~\\*/\\[\\]]");
+ */ var Wn = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4408,8 +4418,8 @@ function Gn(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function Wn(t, e, n) {
-    if (e.search(Qn) >= 0) throw Hn("Invalid field path (" + e + "). Paths must not contain '~', '*', '/', '[', or ']'", t, 
+ */ function Qn(t, e, n) {
+    if (e.search(Wn) >= 0) throw Hn("Invalid field path (" + e + "). Paths must not contain '~', '*', '/', '[', or ']'", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
@@ -4460,7 +4470,7 @@ function Yn(t, e) {
  * For a `DocumentSnapshot` that points to a non-existing document, any data
  * access will return 'undefined'. You can use the `exists()` method to
  * explicitly verify a document's existence.
- */ var $n = /** @class */ function() {
+ */ var Xn = /** @class */ function() {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4506,7 +4516,7 @@ function Yn(t, e) {
             if (this._converter) {
                 // We only want to use the converter and create a new DocumentSnapshot
                 // if a converter has been provided.
-                var t = new Xn(this._firestore, this._userDataWriter, this._key, this._document, 
+                var t = new Jn(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4530,7 +4540,7 @@ function Yn(t, e) {
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }, t;
-}(), Xn = /** @class */ function(e) {
+}(), Jn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4542,7 +4552,7 @@ function Yn(t, e) {
      */    return t(n, e), n.prototype.data = function() {
         return e.prototype.data.call(this);
     }, n;
-}($n), Jn = /** @class */ function() {
+}(Xn), Zn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._docs = e, this.query = t;
@@ -4596,15 +4606,15 @@ function Yn(t, e) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */
-function Zn(t, e) {
-    return t = p(t), e = p(e), t instanceof $n && e instanceof $n ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof Jn && e instanceof Jn && gn(t.query, e.query) && wt(t.docs, e.docs, Zn)
+function $n(t, e) {
+    return t = p(t), e = p(e), t instanceof Xn && e instanceof Xn ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof Zn && e instanceof Zn && gn(t.query, e.query) && wt(t.docs, e.docs, $n)
     /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */;
 }
 
 function tr(t, e) {
-    return "string" == typeof e ? Wn(t, e) : e instanceof wn ? e._internalPath : e._delegate._internalPath;
+    return "string" == typeof e ? Qn(t, e) : e instanceof wn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4652,11 +4662,11 @@ function tr(t, e) {
 var rr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).dt = t, i.wt = n, i.yt = r, i.type = "where", 
+        return (i = e.call(this) || this)._t = t, i.gt = n, i.vt = r, i.type = "where", 
         i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = Pn(t.firestore), n = function(t, e, n, r, i, o, a) {
+        var e = Dn(t.firestore), n = function(t, e, n, r, i, o, a) {
             var s;
             if (i.isKeyField()) {
                 if ("array-contains" /* ARRAY_CONTAINS */ === o || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === o) throw new M(V, "Invalid Query. You can't perform '" + o + "' queries on documentId().");
@@ -4677,7 +4687,7 @@ var rr = /** @class */ function(e) {
             /* allowArrays= */ "in" /* IN */ === o || "not-in" /* NOT_IN */ === o);
             var h = te.create(i, o, s);
             return function(t, e) {
-                if (e.D()) {
+                if (e.S()) {
                     var n = ye(t);
                     if (null !== n && !n.isEqual(e.field)) throw new M(V, "Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '" + n.toString() + "' and '" + e.field.toString() + "'");
                     var r = de(t);
@@ -4727,7 +4737,7 @@ var rr = /** @class */ function(e) {
                 // Special case when it's a duplicate op to give a slightly clearer error message.
                 throw i === e.op ? new M(V, "Invalid query. You cannot use more than one '" + e.op.toString() + "' filter.") : new M(V, "Invalid query. You cannot use '" + e.op.toString() + "' filters with '" + i.toString() + "' filters.");
             }(t, h), h;
-        }(t._query, 0, e, t.firestore._databaseId, this.dt, this.wt, this.yt);
+        }(t._query, 0, e, t.firestore._databaseId, this._t, this.gt, this.vt);
         return new hn(t.firestore, t.converter, function(t, e) {
             var n = t.filters.concat([ e ]);
             return new pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
@@ -4753,7 +4763,7 @@ var rr = /** @class */ function(e) {
 var or = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this) || this).dt = t, r._t = n, r.type = "orderBy", r;
+        return (r = e.call(this) || this)._t = t, r.bt = n, r.type = "orderBy", r;
     }
     return t(n, e), n.prototype._apply = function(t) {
         var e = function(t, e, n) {
@@ -4767,7 +4777,7 @@ var or = /** @class */ function(e) {
                     null !== n && wr(t, n, e.field);
                 }
             }(t, r), r;
-        }(t._query, this.dt, this._t);
+        }(t._query, this._t, this.bt);
         return new hn(t.firestore, t.converter, function(t, e) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             var n = t.explicitOrderBy.concat([ e ]);
@@ -4793,12 +4803,12 @@ var or = /** @class */ function(e) {
 var sr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.gt = n, i.vt = r, i;
+        return (i = e.call(this) || this).type = t, i.Et = n, i.Tt = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
         return new hn(t.firestore, t.converter, function(t, e, n) {
             return new pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
-        }(t._query, this.gt, this.vt));
+        }(t._query, this.Et, this.Tt));
     }, n;
 }(er);
 
@@ -4827,10 +4837,10 @@ function cr(t) {
 var lr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.bt = n, i.Et = r, i;
+        return (i = e.call(this) || this).type = t, i.It = n, i.At = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = mr(t, this.type, this.bt, this.Et);
+        var e = mr(t, this.type, this.It, this.At);
         return new hn(t.firestore, t.converter, function(t, e) {
             return new pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
@@ -4852,10 +4862,10 @@ function hr() {
 var pr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.bt = n, i.Et = r, i;
+        return (i = e.call(this) || this).type = t, i.It = n, i.At = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = mr(t, this.type, this.bt, this.Et);
+        var e = mr(t, this.type, this.It, this.At);
         return new hn(t.firestore, t.converter, function(t, e) {
             return new pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
@@ -4874,8 +4884,8 @@ function yr() {
 }
 
 /** Helper function to create a bound from a document or fields */ function mr(t, e, n, r) {
-    if (n[0] = p(n[0]), n[0] instanceof $n) return function(t, e, n, r, i) {
-        if (!r) throw new M(P, "Can't use a DocumentSnapshot that doesn't exist for " + n + "().");
+    if (n[0] = p(n[0]), n[0] instanceof Xn) return function(t, e, n, r, i) {
+        if (!r) throw new M(D, "Can't use a DocumentSnapshot that doesn't exist for " + n + "().");
         // Because people expect to continue/end a query at the exact document
         // provided, we need to use the implicit sort order rather than the explicit
         // sort order, because it's guaranteed to contain the document key. That way
@@ -4885,9 +4895,9 @@ function yr() {
         // results.
         for (var o = [], a = 0, s = ve(t); a < s.length; a++) {
             var u = s[a];
-            if (u.field.isKeyField()) o.push(Gt(e, r.key)); else {
+            if (u.field.isKeyField()) o.push(zt(e, r.key)); else {
                 var c = r.data.field(u.field);
-                if (Rt(c)) throw new M(V, 'Invalid query. You are trying to start or end a query using a document for which the field "' + u.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+                if (qt(c)) throw new M(V, 'Invalid query. You are trying to start or end a query using a document for which the field "' + u.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
                 if (null === c) {
                     var l = u.field.canonicalString();
                     throw new M(V, "Invalid query. You are trying to start or end a query using a document for which the field '" + l + "' (used as the orderBy) does not exist.");
@@ -4897,7 +4907,7 @@ function yr() {
         }
         return new ce(o, i);
     }(t._query, t.firestore._databaseId, e, n[0]._document, r);
-    var i = Pn(t.firestore);
+    var i = Dn(t.firestore);
     return function(t, e, n, r, i, o) {
         // Use explicit order by's because it has to match the query the user made
         var a = t.explicitOrderBy;
@@ -4907,10 +4917,10 @@ function yr() {
             if (a[u].field.isKeyField()) {
                 if ("string" != typeof c) throw new M(V, "Invalid query. Expected a string for document ID in " + r + "(), but got a " + typeof c);
                 if (!me(t) && -1 !== c.indexOf("/")) throw new M(V, "Invalid query. When querying a collection and ordering by documentId(), the value passed to " + r + "() must be a plain document ID, but '" + c + "' contains a slash.");
-                var l = t.path.child(Z.fromString(c));
+                var l = t.path.child($.fromString(c));
                 if (!nt.isDocumentKey(l)) throw new M(V, "Invalid query. When querying a collection group and ordering by documentId(), the value passed to " + r + "() must result in a valid document path, but '" + l + "' is not because it contains an odd number of segments.");
                 var f = new nt(l);
-                s.push(Gt(e, f));
+                s.push(zt(e, f));
             } else {
                 var h = Mn(n, r, c);
                 s.push(h);
@@ -4924,11 +4934,11 @@ function vr(t, e, n) {
     if ("string" == typeof (n = p(n))) {
         if ("" === n) throw new M(V, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
         if (!me(e) && -1 !== n.indexOf("/")) throw new M(V, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '" + n + "' contains a '/' character.");
-        var r = e.path.child(Z.fromString(n));
+        var r = e.path.child($.fromString(n));
         if (!nt.isDocumentKey(r)) throw new M(V, "Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '" + r + "' is not because it has an odd number of segments (" + r.length + ").");
-        return Gt(t, new nt(r));
+        return zt(t, new nt(r));
     }
-    if (n instanceof fn) return Gt(t, n._key);
+    if (n instanceof fn) return zt(t, n._key);
     throw new M(V, "Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: " + at(n) + ".");
 }
 
@@ -5031,7 +5041,7 @@ var _r = /** @class */ function(e) {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(qt(t.bytesValue));
+            return this.convertBytes(Rt(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -5063,11 +5073,11 @@ var _r = /** @class */ function(e) {
     }, t.prototype.convertServerTimestamp = function(t, e) {
         switch (e) {
           case "previous":
-            var n = xt(t);
+            var n = Ct(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Ct(t));
+            return this.convertTimestamp(xt(t));
 
           default:
             return null;
@@ -5076,9 +5086,9 @@ var _r = /** @class */ function(e) {
         var e = Ft(t);
         return new bt(e.seconds, e.nanos);
     }, t.prototype.convertDocumentKey = function(t, e) {
-        var n = Z.fromString(t);
-        S(Ye(n));
-        var r = new X(n.get(1), n.get(3)), i = new nt(n.popFirst(5));
+        var n = $.fromString(t);
+        k(Ye(n));
+        var r = new J(n.get(1), n.get(3)), i = new nt(n.popFirst(5));
         return r.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
         b("Document " + i + " contains a document reference within a different database (" + r.projectId + "/" + r.database + ") which is not supported. It will be treated as a reference in the current database (" + e.projectId + "/" + e.database + ") instead."), 
@@ -5101,9 +5111,9 @@ var _r = /** @class */ function(e) {
  */ function Tr(t) {
     var e = rn((t = st(t, fn)).firestore), n = new _r(t.firestore);
     return tn(e, [ t._key ]).then((function(e) {
-        S(1 === e.length);
+        k(1 === e.length);
         var r = e[0];
-        return new $n(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new Xn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5120,33 +5130,33 @@ var _r = /** @class */ function(e) {
  * @returns A Promise that will be resolved with the results of the query.
  */ function Er(t) {
     !function(t) {
-        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new M(C, "limitToLast() queries require specifying at least one orderBy() clause");
+        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new M(x, "limitToLast() queries require specifying at least one orderBy() clause");
     }((t = st(t, hn))._query);
     var e = rn(t.firestore), n = new _r(t.firestore);
     return en(e, t._query).then((function(e) {
         var r = e.map((function(e) {
-            return new Xn(t.firestore, n, e.key, e, t.converter);
+            return new Jn(t.firestore, n, e.key, e, t.converter);
         }));
         return "L" /* Last */ === t._query.limitType && 
         // Limit to last queries reverse the orderBy constraint that was
         // specified by the user. As such, we need to reverse the order of the
         // results to return the documents in the expected order.
-        r.reverse(), new Jn(t, r);
+        r.reverse(), new Zn(t, r);
     }));
 }
 
-function Sr(t, e, n) {
-    var r = br((t = st(t, fn)).converter, e, n), i = Nn(Pn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return Ze(rn(t.firestore), [ i.toMutation(t._key, Ie.none()) ]);
+function kr(t, e, n) {
+    var r = br((t = st(t, fn)).converter, e, n), i = Nn(Dn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return $e(rn(t.firestore), [ i.toMutation(t._key, Ie.none()) ]);
 }
 
-function kr(t, e, n) {
+function Sr(t, e, n) {
     for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-    var o, a = Pn((t = st(t, fn)).firestore);
+    var o, a = Dn((t = st(t, fn)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         return o = "string" == typeof (e = p(e)) || e instanceof wn ? jn(a, "updateDoc", t._key, e, n, r) : Ln(a, "updateDoc", t._key, e), 
-    Ze(rn(t.firestore), [ o.toMutation(t._key, Ie.exists(!0)) ]);
+    $e(rn(t.firestore), [ o.toMutation(t._key, Ie.exists(!0)) ]);
 }
 
 /**
@@ -5161,7 +5171,7 @@ function kr(t, e, n) {
  * @returns A `Promise` resolved once the document has been successfully
  * deleted from the backend.
  */ function Ir(t) {
-    return Ze(rn((t = st(t, fn)).firestore), [ new Pe(t._key, Ie.none()) ]);
+    return $e(rn((t = st(t, fn)).firestore), [ new De(t._key, Ie.none()) ]);
 }
 
 /**
@@ -5179,8 +5189,8 @@ function kr(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 Ar(t, e) {
-    var n = mn(t = st(t, pn)), r = br(t.converter, e), i = Nn(Pn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return Ze(rn(t.firestore), [ i.toMutation(n._key, Ie.exists(!1)) ]).then((function() {
+    var n = mn(t = st(t, pn)), r = br(t.converter, e), i = Nn(Dn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return $e(rn(t.firestore), [ i.toMutation(n._key, Ie.exists(!1)) ]).then((function() {
         return n;
     }));
 }
@@ -5211,8 +5221,8 @@ function kr(t, e, n) {
 /**
  * Returns a sentinel used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link @firebase/firestore/lite#(updateDoc:1)} to
  * include a server-generated timestamp in the written data.
- */ function Dr() {
-    return new qn("serverTimestamp");
+ */ function Pr() {
+    return new Rn("serverTimestamp");
 }
 
 /**
@@ -5226,11 +5236,11 @@ function kr(t, e, n) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function Pr() {
+ */ function Dr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-        return new Rn("arrayUnion", t);
+        return new qn("arrayUnion", t);
 }
 
 /**
@@ -5247,7 +5257,7 @@ function kr(t, e, n) {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-        return new xn("arrayRemove", t);
+        return new Cn("arrayRemove", t);
 }
 
 /**
@@ -5269,7 +5279,7 @@ function kr(t, e, n) {
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
  */ function Fr(t) {
-    return new Cn("increment", t);
+    return new xn("increment", t);
 }
 
 /**
@@ -5299,16 +5309,16 @@ function kr(t, e, n) {
     /** @hideconstructor */
     function t(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = Pn(t);
+        this._dataReader = Dn(t);
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = qr(t, this._firestore), i = br(r.converter, e, n), o = Nn(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
+        var r = Rr(t, this._firestore), i = br(r.converter, e, n), o = Nn(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
         return this._mutations.push(o.toMutation(r._key, Ie.none())), this;
     }, t.prototype.update = function(t, e, n) {
         for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
         this._verifyNotCommitted();
-        var o, a = qr(t, this._firestore);
+        var o, a = Rr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 return o = "string" == typeof (e = p(e)) || e instanceof wn ? jn(this._dataReader, "WriteBatch.update", a._key, e, n, r) : Ln(this._dataReader, "WriteBatch.update", a._key, e), 
@@ -5322,8 +5332,8 @@ function kr(t, e, n) {
      */
     t.prototype.delete = function(t) {
         this._verifyNotCommitted();
-        var e = qr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Pe(e._key, Ie.none())), this;
+        var e = Rr(t, this._firestore);
+        return this._mutations = this._mutations.concat(new De(e._key, Ie.none())), this;
     }, 
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5340,11 +5350,11 @@ function kr(t, e, n) {
     t.prototype.commit = function() {
         return this._verifyNotCommitted(), this._committed = !0, this._mutations.length > 0 ? this._commitHandler(this._mutations) : Promise.resolve();
     }, t.prototype._verifyNotCommitted = function() {
-        if (this._committed) throw new M(q, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new M(R, "A write batch can no longer be used after commit() has been called.");
     }, t;
 }();
 
-function qr(t, e) {
+function Rr(t, e) {
     if ((t = p(t)).firestore !== e) throw new M(V, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -5361,10 +5371,10 @@ function qr(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Rr(t) {
+ */ function qr(t) {
     var e = rn(t = st(t, an));
     return new Or(t, (function(t) {
-        return Ze(e, t);
+        return $e(e, t);
     }));
 }
 
@@ -5387,7 +5397,7 @@ function qr(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ var xr = /** @class */ function() {
+ */ var Cr = /** @class */ function() {
     function t(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5431,7 +5441,7 @@ function qr(t, e) {
         }
         this.writtenDocs.add(t.toString());
     }, t.prototype.delete = function(t) {
-        this.write(new Pe(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new De(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }, t.prototype.commit = function() {
         return e(this, void 0, void 0, (function() {
             var t, e = this;
@@ -5449,7 +5459,7 @@ function qr(t, e) {
                     t.forEach((function(t, n) {
                         var r = nt.fromPath(n);
                         e.mutations.push(new Ne(r, e.precondition(r)));
-                    })), [ 4 /*yield*/ , Ze(this.datastore, this.mutations) ];
+                    })), [ 4 /*yield*/ , $e(this.datastore, this.mutations) ];
 
                   case 1:
                     // For each mutation, note that the doc was written.
@@ -5461,14 +5471,14 @@ function qr(t, e) {
         var e;
         if (t.isFoundDocument()) e = t.version; else {
             if (!t.isNoDocument()) throw E();
-            // For deleted docs, we must use baseVersion 0 when we overwrite them.
+            // Represent a deleted doc using SnapshotVersion.min().
                         e = _t.min();
         }
         var n = this.readVersions.get(t.key.toString());
         if (n) {
             if (!e.isEqual(n)) 
             // This transaction will fail no matter what.
-            throw new M(R, "Document version changed between two reads.");
+            throw new M(q, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }, 
     /**
@@ -5477,7 +5487,7 @@ function qr(t, e) {
      */
     t.prototype.precondition = function(t) {
         var e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? Ie.updateTime(e) : Ie.none();
+        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(_t.min()) ? Ie.exists(!1) : Ie.updateTime(e) : Ie.none();
     }, 
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5507,37 +5517,37 @@ function qr(t, e) {
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), Cr = {
+}(), xr = {
     maxAttempts: 5
 }, Lr = /** @class */ function() {
     function t(t, e, n, r, i) {
         this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
-        this.deferred = i, this.Tt = n.maxAttempts, this.It = new Xe(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
+        this.deferred = i, this.Rt = n.maxAttempts, this.Pt = new Je(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.run = function() {
-        this.Tt -= 1, this.At();
-    }, t.prototype.At = function() {
+        this.Rt -= 1, this.Vt();
+    }, t.prototype.Vt = function() {
         var t = this;
-        this.It.W((function() {
+        this.Pt.H((function() {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new xr(this.datastore), (e = this.Rt(t)) && e.then((function(e) {
+                    return t = new Cr(this.datastore), (e = this.Nt(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
                             })).catch((function(t) {
-                                r.Pt(t);
+                                r.Dt(t);
                             }));
                         }));
                     })).catch((function(t) {
-                        r.Pt(t);
+                        r.Dt(t);
                     })), [ 2 /*return*/ ];
                 }));
             }));
         }));
-    }, t.prototype.Rt = function(t) {
+    }, t.prototype.Nt = function(t) {
         try {
             var e = this.updateFunction(t);
             return !ct(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
@@ -5546,12 +5556,12 @@ function qr(t, e) {
             // Do not retry errors thrown by user provided updateFunction.
             return this.deferred.reject(t), null;
         }
-    }, t.prototype.Pt = function(t) {
+    }, t.prototype.Dt = function(t) {
         var e = this;
-        this.Tt > 0 && this.Vt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((function() {
-            return e.At(), Promise.resolve();
+        this.Rt > 0 && this.$t(t) ? (this.Rt -= 1, this.asyncQueue.enqueueAndForget((function() {
+            return e.Vt(), Promise.resolve();
         }))) : this.deferred.reject(t);
-    }, t.prototype.Vt = function(t) {
+    }, t.prototype.$t = 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.
@@ -5570,7 +5580,7 @@ function qr(t, e) {
 
                   case I:
                   case A:
-                  case D:
+                  case P:
                   case O:
                   case L:
                   case j:
@@ -5580,16 +5590,16 @@ function qr(t, e) {
                     return !1;
 
                   case V:
-                  case P:
+                  case D:
                   case "already-exists":
                   case N:
-                  case q:
+                  case R:
  // 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 R:
-                  case x:
+                                      case q:
                   case C:
+                  case x:
                   case "data-loss":
                     return !0;
                 }
@@ -5731,40 +5741,40 @@ function qr(t, e) {
     function t() {
         var t = this;
         // The last promise in the queue.
-                this.Nt = Promise.resolve(), 
+                this.xt = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.Dt = [], 
+        this.Ft = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.$t = !1, 
+        this.St = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.xt = [], 
+        this.qt = [], 
         // visible for testing
-        this.Ft = null, 
+        this.Ot = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.St = !1, 
+        this.kt = !1, 
         // Enabled during shutdown on Safari to prevent future access to IndexedDB.
-        this.qt = !1, 
+        this.Ct = !1, 
         // List of TimerIds to fast-forward delays for.
-        this.Ot = [], 
+        this.Lt = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new Xe(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.Pt = new Je(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.kt = function() {
+        this.Mt = function() {
             var e = jr();
-            e && w("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.It.Y();
+            e && w("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.Pt.X();
         };
         var e = jr();
-        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.kt);
+        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Mt);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
         get: function() {
-            return this.$t;
+            return this.St;
         },
         enumerable: !1,
         configurable: !0
@@ -5777,53 +5787,53 @@ function qr(t, e) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
         this.enqueue(t);
     }, t.prototype.enqueueAndForgetEvenWhileRestricted = function(t) {
-        this.Ct(), 
+        this.Ut(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.Lt(t);
+        this.jt(t);
     }, t.prototype.enterRestrictedMode = function(t) {
-        if (!this.$t) {
-            this.$t = !0, this.qt = t || !1;
+        if (!this.St) {
+            this.St = !0, this.Ct = t || !1;
             var e = jr();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.kt);
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Mt);
         }
     }, t.prototype.enqueue = function(t) {
         var e = this;
-        if (this.Ct(), this.$t) 
+        if (this.Ut(), this.St) 
         // 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 U;
-        return this.Lt((function() {
-            return e.$t && e.qt ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
+        return this.jt((function() {
+            return e.St && e.Ct ? 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.Dt.push(t), e.Mt();
+            return e.Ft.push(t), e.Bt();
         }));
     }, 
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
      */
-    t.prototype.Mt = function() {
+    t.prototype.Bt = 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.Dt.length) return [ 3 /*break*/ , 5 ];
+                    if (0 === this.Ft.length) return [ 3 /*break*/ , 5 ];
                     n.label = 1;
 
                   case 1:
-                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.Dt[0]() ];
+                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.Ft[0]() ];
 
                   case 2:
-                    return n.sent(), this.Dt.shift(), this.It.reset(), [ 3 /*break*/ , 4 ];
+                    return n.sent(), this.Ft.shift(), this.Pt.reset(), [ 3 /*break*/ , 4 ];
 
                   case 3:
                     if (t = n.sent(), "IndexedDbTransactionError" !== t.name) throw t;
@@ -5832,7 +5842,7 @@ function qr(t, e) {
                     [ 3 /*break*/ , 4 ];
 
                   case 4:
-                    this.Dt.length > 0 && 
+                    this.Ft.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
@@ -5843,8 +5853,8 @@ function qr(t, e) {
                     // Since `backoffAndRun()` cancels an existing backoff and schedules a
                     // new backoff on every call, there is only ever a single additional
                     // operation in the queue.
-                    this.It.W((function() {
-                        return e.Mt();
+                    this.Pt.H((function() {
+                        return e.Bt();
                     })), n.label = 5;
 
                   case 5:
@@ -5852,10 +5862,10 @@ function qr(t, e) {
                 }
             }));
         }));
-    }, t.prototype.Lt = function(t) {
-        var e = this, n = this.Nt.then((function() {
-            return e.St = !0, t().catch((function(t) {
-                e.Ft = t, e.St = !1;
+    }, t.prototype.jt = function(t) {
+        var e = this, n = this.xt.then((function() {
+            return e.kt = !0, t().catch((function(t) {
+                e.Ot = t, e.kt = !1;
                 var n = 
                 /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -5872,39 +5882,39 @@ function qr(t, e) {
                 // and return the rejected Promise.
                                 throw b("INTERNAL UNHANDLED ERROR: ", n), t;
             })).then((function(t) {
-                return e.St = !1, t;
+                return e.kt = !1, t;
             }));
         }));
-        return this.Nt = n, n;
+        return this.xt = n, n;
     }, t.prototype.enqueueAfterDelay = function(t, e, n) {
         var r = this;
-        this.Ct(), 
+        this.Ut(), 
         // Fast-forward delays for timerIds that have been overriden.
-        this.Ot.indexOf(t) > -1 && (e = 0);
+        this.Lt.indexOf(t) > -1 && (e = 0);
         var i = Mr.createAndSchedule(this, t, e, n, (function(t) {
-            return r.Ut(t);
+            return r.zt(t);
         }));
-        return this.xt.push(i), i;
-    }, t.prototype.Ct = function() {
-        this.Ft && E();
+        return this.qt.push(i), i;
+    }, t.prototype.Ut = function() {
+        this.Ot && E();
     }, t.prototype.verifyOperationInProgress = function() {}, 
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
      */
-    t.prototype.jt = function() {
+    t.prototype.Gt = 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.Nt ];
+                    return [ 4 /*yield*/ , t = this.xt ];
 
                   case 1:
                     e.sent(), e.label = 2;
 
                   case 2:
-                    if (t !== this.Nt) return [ 3 /*break*/ , 0 ];
+                    if (t !== this.xt) return [ 3 /*break*/ , 0 ];
                     e.label = 3;
 
                   case 3:
@@ -5917,8 +5927,8 @@ function qr(t, e) {
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
      */
-    t.prototype.Bt = function(t) {
-        for (var e = 0, n = this.xt; e < n.length; e++) {
+    t.prototype.Wt = function(t) {
+        for (var e = 0, n = this.qt; e < n.length; e++) {
             if (n[e].timerId === t) return !0;
         }
         return !1;
@@ -5930,36 +5940,36 @@ function qr(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.zt = function(t) {
+    t.prototype.Kt = function(t) {
         var e = this;
         // Note that draining may generate more delayed ops, so we do that first.
-                return this.jt().then((function() {
+                return this.Gt().then((function() {
             // Run ops in the same order they'd run if they ran naturally.
-            e.xt.sort((function(t, e) {
+            e.qt.sort((function(t, e) {
                 return t.targetTimeMs - e.targetTimeMs;
             }));
-            for (var n = 0, r = e.xt; n < r.length; n++) {
+            for (var n = 0, r = e.qt; n < r.length; n++) {
                 var i = r[n];
                 if (i.skipDelay(), "all" /* All */ !== t && i.timerId === t) break;
             }
-            return e.jt();
+            return e.Gt();
         }));
     }, 
     /**
      * For Tests: Skip all subsequent delays for a timer id.
      */
-    t.prototype.Gt = function(t) {
-        this.Ot.push(t);
+    t.prototype.Qt = function(t) {
+        this.Lt.push(t);
     }, 
-    /** Called once a DelayedOperation is run or canceled. */ t.prototype.Ut = function(t) {
+    /** Called once a DelayedOperation is run or canceled. */ t.prototype.zt = function(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        var e = this.xt.indexOf(t);
-        this.xt.splice(e, 1);
+        var e = this.qt.indexOf(t);
+        this.qt.splice(e, 1);
     }, t;
 }(), Br = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = Pn(t)
+        this._firestore = t, this._transaction = e, this._dataReader = Dn(t)
         /**
      * Reads the document referenced by the provided {@link DocumentReference}.
      *
@@ -5968,20 +5978,20 @@ function qr(t, e) {
      */;
     }
     return t.prototype.get = function(t) {
-        var e = this, n = qr(t, this._firestore), r = new _r(this._firestore);
+        var e = this, n = Rr(t, this._firestore), r = new _r(this._firestore);
         return this._transaction.lookup([ n._key ]).then((function(t) {
             if (!t || 1 !== t.length) return E();
             var i = t[0];
-            if (i.isFoundDocument()) return new $n(e._firestore, r, i.key, i, n.converter);
-            if (i.isNoDocument()) return new $n(e._firestore, r, n._key, null, n.converter);
+            if (i.isFoundDocument()) return new Xn(e._firestore, r, i.key, i, n.converter);
+            if (i.isNoDocument()) return new Xn(e._firestore, r, n._key, null, n.converter);
             throw E();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = qr(t, this._firestore), i = br(r.converter, e, n), o = Nn(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
+        var r = Rr(t, this._firestore), i = br(r.converter, e, n), o = Nn(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
         return this._transaction.set(r._key, o), this;
     }, t.prototype.update = function(t, e, n) {
         for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-        var o, a = qr(t, this._firestore);
+        var o, a = Rr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 return o = "string" == typeof (e = p(e)) || e instanceof wn ? jn(this._dataReader, "Transaction.update", a._key, e, n, r) : Ln(this._dataReader, "Transaction.update", a._key, e), 
@@ -5994,7 +6004,7 @@ function qr(t, e) {
      * @returns This `Transaction` instance. Used for chaining method calls.
      */
     t.prototype.delete = function(t) {
-        var e = qr(t, this._firestore);
+        var e = Rr(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }, t;
 }();
@@ -6034,8 +6044,8 @@ function qr(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */
-function zr(t, e, n) {
-    var r = rn(t = st(t, an)), i = Object.assign(Object.assign({}, Cr), n);
+function Gr(t, e, n) {
+    var r = rn(t = st(t, an)), i = Object.assign(Object.assign({}, xr), n);
     !function(t) {
         if (t.maxAttempts < 1) throw new M(V, "Max attempts must be at least 1");
     }(i);
@@ -6054,11 +6064,14 @@ function zr(t, e, n) {
 }
 
 m = i + "_lite", o(new c("firestore/lite", (function(t, e) {
-    var n = e.options, r = t.getProvider("app").getImmediate(), i = new an(r, new K(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
-    return n && i._setSettings(n), i;
-}), "PUBLIC")), 
+    var n = e.instanceIdentifier, r = e.options, i = t.getProvider("app").getImmediate(), o = new an(new K(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")), function(t, e) {
+        if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new M(V, '"projectId" not provided in firebase.initializeApp.');
+        return new J(t.options.projectId, e);
+    }(i, n), i);
+    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.4.13", ""), a("firestore-lite", "3.4.13", "esm5");
+a("firestore-lite", "3.4.14-canary.04dcdbb0f", ""), a("firestore-lite", "3.4.14-canary.04dcdbb0f", "esm5");
 
-export { _n as Bytes, pn as CollectionReference, fn as DocumentReference, $n as DocumentSnapshot, wn as FieldPath, Tn as FieldValue, an as Firestore, M as FirestoreError, En as GeoPoint, hn as Query, er as QueryConstraint, Xn as QueryDocumentSnapshot, Jn as QuerySnapshot, bt as Timestamp, Br as Transaction, Or as WriteBatch, Ar as addDoc, Nr as arrayRemove, Pr as arrayUnion, dn as collection, yn as collectionGroup, cn as connectFirestoreEmulator, Ir as deleteDoc, Vr as deleteField, mn as doc, bn as documentId, yr as endAt, dr as endBefore, Tr as getDoc, Er as getDocs, un as getFirestore, Fr as increment, sn as initializeFirestore, ur as limit, cr as limitToLast, ar as orderBy, nr as query, gn as queryEqual, vn as refEqual, zr as runTransaction, Dr as serverTimestamp, Sr as setDoc, g as setLogLevel, Zn as snapshotEqual, hr as startAfter, fr as startAt, ln as terminate, kr as updateDoc, ir as where, Rr as writeBatch };
+export { _n as Bytes, pn as CollectionReference, fn as DocumentReference, Xn as DocumentSnapshot, wn as FieldPath, Tn as FieldValue, an as Firestore, M as FirestoreError, En as GeoPoint, hn as Query, er as QueryConstraint, Jn as QueryDocumentSnapshot, Zn as QuerySnapshot, bt as Timestamp, Br as Transaction, Or as WriteBatch, Ar as addDoc, Nr as arrayRemove, Dr as arrayUnion, dn as collection, yn as collectionGroup, cn as connectFirestoreEmulator, Ir as deleteDoc, Vr as deleteField, mn as doc, bn as documentId, yr as endAt, dr as endBefore, Tr as getDoc, Er as getDocs, un as getFirestore, Fr as increment, sn as initializeFirestore, ur as limit, cr as limitToLast, ar as orderBy, nr as query, gn as queryEqual, vn as refEqual, Gr as runTransaction, Pr as serverTimestamp, kr as setDoc, g as setLogLevel, $n as snapshotEqual, hr as startAfter, fr as startAt, ln as terminate, Sr as updateDoc, ir as where, qr as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map