@firebase/firestore 3.11.0 → 3.12.0-20230511201449

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

@@ -63,7 +63,7 @@ d.MOCK_USER = new d("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let w = "9.21.0";
+let w = "9.22.0-20230511201449";
 
 /**
  * @license
@@ -218,7 +218,7 @@ e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const T = "ok", A = "cancelled", R = "unknown", P = "invalid-argument", V = "deadline-exceeded", $ = "not-found", D = "already-exists", N = "permission-denied", F = "unauthenticated", x = "resource-exhausted", S = "failed-precondition", q = "aborted", O = "out-of-range", k = "unimplemented", C = "internal", M = "unavailable", L = "data-loss";
+ */ const T = "ok", A = "cancelled", R = "unknown", P = "invalid-argument", V = "deadline-exceeded", $ = "not-found", N = "already-exists", D = "permission-denied", F = "unauthenticated", x = "resource-exhausted", S = "failed-precondition", q = "aborted", O = "out-of-range", k = "unimplemented", C = "internal", M = "unavailable", L = "data-loss";
 
 /** An error returned by a Firestore operation. */ class U extends FirebaseError {
     /** @hideconstructor */
@@ -441,12 +441,14 @@ class J {
      * when using WebChannel as the network transport.
      * @param autoDetectLongPolling - Whether to use the detectBufferingProxy
      * option when using WebChannel as the network transport.
+     * @param longPollingOptions Options that configure long-polling.
      * @param useFetchStreams Whether to use the Fetch API instead of
      * XMLHTTPRequest
      */
-    constructor(t, e, n, r, s, i, o, u) {
+    constructor(t, e, n, r, s, i, o, u, c) {
         this.databaseId = t, this.appId = e, this.persistenceKey = n, this.host = r, this.ssl = s, 
-        this.forceLongPolling = i, this.autoDetectLongPolling = o, this.useFetchStreams = u;
+        this.forceLongPolling = i, this.autoDetectLongPolling = o, this.longPollingOptions = u, 
+        this.useFetchStreams = c;
     }
 }
 
@@ -800,6 +802,34 @@ function at(t, e) {
     if (e <= 0) throw new U(P, `Function ${t}() requires a positive number, but it was: ${e}.`);
 }
 
+/**
+ * @license
+ * Copyright 2023 Google LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * Compares two `ExperimentalLongPollingOptions` objects for equality.
+ */
+/**
+ * Creates and returns a new `ExperimentalLongPollingOptions` with the same
+ * option values as the given instance.
+ */
+function ht(t) {
+    const e = {};
+    return void 0 !== t.timeoutSeconds && (e.timeoutSeconds = t.timeoutSeconds), e;
+}
+
 /**
  * @license
  * Copyright 2023 Google LLC
@@ -819,7 +849,7 @@ function at(t, e) {
 /**
  * The value returned from the most recent invocation of
  * `generateUniqueDebugId()`, or null if it has never been invoked.
- */ let ht = null;
+ */ let lt = null;
 
 /**
  * Generates and returns an initial value for `lastUniqueDebugId`.
@@ -843,9 +873,9 @@ function at(t, e) {
  *
  * @return the 10-character generated ID (e.g. "0xa1b2c3d4").
  */
-function lt() {
-    return null === ht ? ht = 268435456 + Math.round(2147483648 * Math.random()) : ht++, 
-    "0x" + ht.toString(16);
+function ft() {
+    return null === lt ? lt = 268435456 + Math.round(2147483648 * Math.random()) : lt++, 
+    "0x" + lt.toString(16);
 }
 
 /**
@@ -866,11 +896,11 @@ function lt() {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function ft(t) {
+ */ function dt(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function dt(t) {
+/** Returns whether the value represents -0. */ function wt(t) {
     // Detect if the value is -0.0. Based on polyfill from
     // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
     return 0 === t && 1 / t == -1 / 0;
@@ -896,7 +926,7 @@ function lt() {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const wt = {
+const mt = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery",
@@ -934,7 +964,7 @@ const wt = {
  * are used for reverse lookups from the webchannel stream. Do NOT change the
  * names of these identifiers or change this into a const enum.
  */
-var mt, pt;
+var pt, yt;
 
 /**
  * Converts an HTTP Status Code to the equivalent error code.
@@ -943,7 +973,7 @@ var mt, pt;
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function yt(t) {
+function gt(t) {
     if (void 0 === t) return g("RPC_ERROR", "HTTP error has no status"), R;
     // The canonical error codes for Google APIs [1] specify mapping onto HTTP
     // status codes but the mapping is not bijective. In each case of ambiguity
@@ -969,7 +999,7 @@ function yt(t) {
 
       case 403:
         // Forbidden
-        return N;
+        return D;
 
       case 404:
         // Not Found
@@ -1036,16 +1066,16 @@ function yt(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (pt = mt || (mt = {}))[pt.OK = 0] = "OK", pt[pt.CANCELLED = 1] = "CANCELLED", 
-pt[pt.UNKNOWN = 2] = "UNKNOWN", pt[pt.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
-pt[pt.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", pt[pt.NOT_FOUND = 5] = "NOT_FOUND", 
-pt[pt.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", pt[pt.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
-pt[pt.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", pt[pt.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
-pt[pt.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", pt[pt.ABORTED = 10] = "ABORTED", 
-pt[pt.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", pt[pt.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
-pt[pt.INTERNAL = 13] = "INTERNAL", pt[pt.UNAVAILABLE = 14] = "UNAVAILABLE", pt[pt.DATA_LOSS = 15] = "DATA_LOSS";
+ */ (yt = pt || (pt = {}))[yt.OK = 0] = "OK", yt[yt.CANCELLED = 1] = "CANCELLED", 
+yt[yt.UNKNOWN = 2] = "UNKNOWN", yt[yt.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+yt[yt.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", yt[yt.NOT_FOUND = 5] = "NOT_FOUND", 
+yt[yt.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", yt[yt.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+yt[yt.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", yt[yt.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+yt[yt.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", yt[yt.ABORTED = 10] = "ABORTED", 
+yt[yt.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", yt[yt.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+yt[yt.INTERNAL = 13] = "INTERNAL", yt[yt.UNAVAILABLE = 14] = "UNAVAILABLE", yt[yt.DATA_LOSS = 15] = "DATA_LOSS";
 
-class gt extends 
+class _t extends 
 /**
  * Base class for all Rest-based connections to the backend (WebChannel and
  * HTTP).
@@ -1062,7 +1092,7 @@ class {
         return !1;
     }
     v(t, e, n, r, s) {
-        const i = lt(), o = this.I(t, e);
+        const i = ft(), o = this.I(t, e);
         y("RestConnection", `Sending RPC '${t}' ${i}:`, o, n);
         const u = {};
         return this.T(u, r, s), this.A(t, o, u, n).then((e => (y("RestConnection", `Received RPC '${t}' ${i}: `, e), 
@@ -1089,7 +1119,7 @@ class {
         e && e.headers.forEach(((e, n) => t[n] = e)), n && n.headers.forEach(((e, n) => t[n] = e));
     }
     I(t, e) {
-        const n = wt[t];
+        const n = mt[t];
         return `${this.m}/v1/${e}:${n}`;
     }
 } {
@@ -1115,13 +1145,13 @@ class {
             });
         } catch (t) {
             const e = t;
-            throw new U(yt(e.status), "Request failed with error: " + e.statusText);
+            throw new U(gt(e.status), "Request failed with error: " + e.statusText);
         }
         if (!o.ok) {
             let t = await o.json();
             Array.isArray(t) && (t = t[0]);
             const e = null === (s = null == t ? void 0 : t.error) || void 0 === s ? void 0 : s.message;
-            throw new U(yt(o.status), `Request failed with error: ${null != e ? e : o.statusText}`);
+            throw new U(gt(o.status), `Request failed with error: ${null != e ? e : o.statusText}`);
         }
         return o.json();
     }
@@ -1163,7 +1193,7 @@ class {
 /**
  * Concrete implementation of the Aggregate type.
  */
-class _t {
+class vt {
     constructor(t, e, n) {
         this.alias = t, this.$ = e, this.fieldPath = n;
     }
@@ -1189,7 +1219,7 @@ class _t {
  * Generates `nBytes` of random bytes.
  *
  * If `nBytes < 0` , an error will be thrown.
- */ function vt(t) {
+ */ function bt(t) {
     // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.
     const e = 
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
@@ -1215,14 +1245,14 @@ class _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.
- */ class bt {
-    static D() {
+ */ class Et {
+    static N() {
         // Alphanumeric characters
         const t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", e = Math.floor(256 / t.length) * t.length;
         // The largest byte value that is a multiple of `char.length`.
                 let n = "";
         for (;n.length < 20; ) {
-            const r = vt(40);
+            const r = bt(40);
             for (let s = 0; s < r.length; ++s) 
             // Only accept values that are [0, maxMultiple), this ensures they can
             // be evenly mapped to indices of `chars` via a modulo operation.
@@ -1232,11 +1262,11 @@ class _t {
     }
 }
 
-function Et(t, e) {
+function It(t, e) {
     return t < e ? -1 : t > e ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function It(t, e, n) {
+/** Helper to compare arrays using isEqual(). */ function Tt(t, e, n) {
     return t.length === e.length && t.every(((t, r) => n(t, e[r])));
 }
 
@@ -1255,13 +1285,13 @@ function Et(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function Tt(t) {
+ */ function At(t) {
     let e = 0;
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
 }
 
-function At(t, e) {
+function Rt(t, e) {
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
@@ -1284,7 +1314,7 @@ function At(t, e) {
 /**
  * An error encountered while decoding base64 string.
  */
-class Rt extends Error {
+class Pt extends Error {
     constructor() {
         super(...arguments), this.name = "Base64DecodeError";
     }
@@ -1332,7 +1362,7 @@ class Rt extends Error {
  * before being sent as a proto.
  * @internal
  */
-class Pt {
+class Vt {
     constructor(t) {
         this.binaryString = t;
     }
@@ -1344,11 +1374,11 @@ class Pt {
                 // Check that `DOMException` is defined before using it to avoid
                 // "ReferenceError: Property 'DOMException' doesn't exist" in react-native.
                 // (https://github.com/firebase/firebase-js-sdk/issues/7115)
-                throw "undefined" != typeof DOMException && t instanceof DOMException ? new Rt("Invalid base64 string: " + t) : t;
+                throw "undefined" != typeof DOMException && t instanceof DOMException ? new Pt("Invalid base64 string: " + t) : t;
             }
         }
         /** Converts a binary string to a Base64 encoded string. */ (t);
-        return new Pt(e);
+        return new Vt(e);
     }
     static fromUint8Array(t) {
         // TODO(indexing); Remove the copy of the byte string here as this method
@@ -1365,7 +1395,7 @@ class Pt {
         /**
  * Helper function to convert a binary string to an Uint8Array.
  */ (t);
-        return new Pt(e);
+        return new Vt(e);
     }
     [Symbol.iterator]() {
         let t = 0;
@@ -1412,21 +1442,21 @@ class Pt {
         return 2 * this.binaryString.length;
     }
     compareTo(t) {
-        return Et(this.binaryString, t.binaryString);
+        return It(this.binaryString, t.binaryString);
     }
     isEqual(t) {
         return this.binaryString === t.binaryString;
     }
 }
 
-Pt.EMPTY_BYTE_STRING = new Pt("");
+Vt.EMPTY_BYTE_STRING = new Vt("");
 
-const Vt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const $t = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
 /**
  * Converts the possible Proto values for a timestamp value into a "seconds and
  * nanos" representation.
- */ function $t(t) {
+ */ function Nt(t) {
     // 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.
@@ -1435,7 +1465,7 @@ const Vt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
         let e = 0;
-        const n = Vt.exec(t);
+        const n = $t.exec(t);
         if (E(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = n[1];
@@ -1462,8 +1492,8 @@ const Vt = 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 Nt(t) {
-    return "string" == typeof t ? Pt.fromBase64String(t) : Pt.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Ft(t) {
+    return "string" == typeof t ? Vt.fromBase64String(t) : Vt.fromUint8Array(t);
 }
 
 /**
@@ -1497,7 +1527,7 @@ const Vt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * For examples and further specifications, refer to the
  * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
  */
-class Ft {
+class xt {
     /**
      * Creates a new timestamp.
      *
@@ -1529,7 +1559,7 @@ class Ft {
      *
      * @returns a new timestamp representing the current date.
      */    static now() {
-        return Ft.fromMillis(Date.now());
+        return xt.fromMillis(Date.now());
     }
     /**
      * Creates a new timestamp from the given date.
@@ -1538,7 +1568,7 @@ class Ft {
      * @returns A new `Timestamp` representing the same point in time as the given
      *     date.
      */    static fromDate(t) {
-        return Ft.fromMillis(t.getTime());
+        return xt.fromMillis(t.getTime());
     }
     /**
      * Creates a new timestamp from the given number of milliseconds.
@@ -1549,7 +1579,7 @@ class Ft {
      *     number of milliseconds.
      */    static fromMillis(t) {
         const e = Math.floor(t / 1e3), n = Math.floor(1e6 * (t - 1e3 * e));
-        return new Ft(e, n);
+        return new xt(e, n);
     }
     /**
      * Converts a `Timestamp` to a JavaScript `Date` object. This conversion
@@ -1571,7 +1601,7 @@ class Ft {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }
     _compareTo(t) {
-        return this.seconds === t.seconds ? Et(this.nanoseconds, t.nanoseconds) : Et(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? It(this.nanoseconds, t.nanoseconds) : It(this.seconds, t.seconds);
     }
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1641,7 +1671,7 @@ class Ft {
  *   FieldValueOptions to value().
  * - With respect to other ServerTimestampValues, they sort by their
  *   localWriteTime.
- */ function xt(t) {
+ */ function St(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);
 }
@@ -1651,16 +1681,16 @@ class Ft {
  *
  * Preserving the previous values allows the user to display the last resoled
  * value until the backend responds with the timestamp.
- */ function St(t) {
+ */ function qt(t) {
     const e = t.mapValue.fields.__previous_value__;
-    return xt(e) ? St(e) : e;
+    return St(e) ? qt(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function qt(t) {
-    const e = $t(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new Ft(e.seconds, e.nanos);
+ */ function Ot(t) {
+    const e = Nt(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new xt(e.seconds, e.nanos);
 }
 
 /**
@@ -1678,7 +1708,7 @@ class Ft {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const Ot = {
+ */ const kt = {
     fields: {
         __type__: {
             stringValue: "__max__"
@@ -1687,8 +1717,8 @@ class Ft {
 };
 
 /** Extracts the backend's type order for the provided value. */
-function kt(t) {
-    return "nullValue" in t ? 0 /* TypeOrder.NullValue */ : "booleanValue" in t ? 1 /* TypeOrder.BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* TypeOrder.NumberValue */ : "timestampValue" in t ? 3 /* TypeOrder.TimestampValue */ : "stringValue" in t ? 5 /* TypeOrder.StringValue */ : "bytesValue" in t ? 6 /* TypeOrder.BlobValue */ : "referenceValue" in t ? 7 /* TypeOrder.RefValue */ : "geoPointValue" in t ? 8 /* TypeOrder.GeoPointValue */ : "arrayValue" in t ? 9 /* TypeOrder.ArrayValue */ : "mapValue" in t ? xt(t) ? 4 /* TypeOrder.ServerTimestampValue */ : 
+function Ct(t) {
+    return "nullValue" in t ? 0 /* TypeOrder.NullValue */ : "booleanValue" in t ? 1 /* TypeOrder.BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* TypeOrder.NumberValue */ : "timestampValue" in t ? 3 /* TypeOrder.TimestampValue */ : "stringValue" in t ? 5 /* TypeOrder.StringValue */ : "bytesValue" in t ? 6 /* TypeOrder.BlobValue */ : "referenceValue" in t ? 7 /* TypeOrder.RefValue */ : "geoPointValue" in t ? 8 /* TypeOrder.GeoPointValue */ : "arrayValue" in t ? 9 /* TypeOrder.ArrayValue */ : "mapValue" in t ? St(t) ? 4 /* TypeOrder.ServerTimestampValue */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
         return "__max__" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;
@@ -1725,10 +1755,10 @@ function kt(t) {
  */ (t) ? 9007199254740991 /* TypeOrder.MaxValue */ : 10 /* TypeOrder.ObjectValue */ : b();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Ct(t, e) {
+/** Tests `left` and `right` for equality based on the backend semantics. */ function Mt(t, e) {
     if (t === e) return !0;
-    const n = kt(t);
-    if (n !== kt(e)) return !1;
+    const n = Ct(t);
+    if (n !== Ct(e)) return !1;
     switch (n) {
       case 0 /* TypeOrder.NullValue */ :
       case 9007199254740991 /* TypeOrder.MaxValue */ :
@@ -1738,14 +1768,14 @@ function kt(t) {
         return t.booleanValue === e.booleanValue;
 
       case 4 /* TypeOrder.ServerTimestampValue */ :
-        return qt(t).isEqual(qt(e));
+        return Ot(t).isEqual(Ot(e));
 
       case 3 /* TypeOrder.TimestampValue */ :
         return function(t, e) {
             if ("string" == typeof t.timestampValue && "string" == typeof e.timestampValue && t.timestampValue.length === e.timestampValue.length) 
             // Use string equality for ISO 8601 timestamps
             return t.timestampValue === e.timestampValue;
-            const n = $t(t.timestampValue), r = $t(e.timestampValue);
+            const n = Nt(t.timestampValue), r = Nt(e.timestampValue);
             return n.seconds === r.seconds && n.nanos === r.nanos;
         }(t, e);
 
@@ -1754,7 +1784,7 @@ function kt(t) {
 
       case 6 /* TypeOrder.BlobValue */ :
         return function(t, e) {
-            return Nt(t.bytesValue).isEqual(Nt(e.bytesValue));
+            return Ft(t.bytesValue).isEqual(Ft(e.bytesValue));
         }(t, e);
 
       case 7 /* TypeOrder.RefValue */ :
@@ -1770,19 +1800,19 @@ function kt(t) {
             if ("integerValue" in t && "integerValue" in e) return Dt(t.integerValue) === Dt(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
                 const n = Dt(t.doubleValue), r = Dt(e.doubleValue);
-                return n === r ? dt(n) === dt(r) : isNaN(n) && isNaN(r);
+                return n === r ? wt(n) === wt(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* TypeOrder.ArrayValue */ :
-        return It(t.arrayValue.values || [], e.arrayValue.values || [], Ct);
+        return Tt(t.arrayValue.values || [], e.arrayValue.values || [], Mt);
 
       case 10 /* TypeOrder.ObjectValue */ :
         return function(t, e) {
             const n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (Tt(n) !== Tt(r)) return !1;
-            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Ct(n[t], r[t]))) return !1;
+            if (At(n) !== At(r)) return !1;
+            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Mt(n[t], r[t]))) return !1;
             return !0;
         }
         /** Returns true if the ArrayValue contains the specified element. */ (t, e);
@@ -1792,21 +1822,21 @@ function kt(t) {
     }
 }
 
-function Mt(t, e) {
-    return void 0 !== (t.values || []).find((t => Ct(t, e)));
+function Lt(t, e) {
+    return void 0 !== (t.values || []).find((t => Mt(t, e)));
 }
 
-function Lt(t, e) {
+function Ut(t, e) {
     if (t === e) return 0;
-    const n = kt(t), r = kt(e);
-    if (n !== r) return Et(n, r);
+    const n = Ct(t), r = Ct(e);
+    if (n !== r) return It(n, r);
     switch (n) {
       case 0 /* TypeOrder.NullValue */ :
       case 9007199254740991 /* TypeOrder.MaxValue */ :
         return 0;
 
       case 1 /* TypeOrder.BooleanValue */ :
-        return Et(t.booleanValue, e.booleanValue);
+        return It(t.booleanValue, e.booleanValue);
 
       case 2 /* TypeOrder.NumberValue */ :
         return function(t, e) {
@@ -1817,17 +1847,17 @@ function Lt(t, e) {
         }(t, e);
 
       case 3 /* TypeOrder.TimestampValue */ :
-        return Ut(t.timestampValue, e.timestampValue);
+        return jt(t.timestampValue, e.timestampValue);
 
       case 4 /* TypeOrder.ServerTimestampValue */ :
-        return Ut(qt(t), qt(e));
+        return jt(Ot(t), Ot(e));
 
       case 5 /* TypeOrder.StringValue */ :
-        return Et(t.stringValue, e.stringValue);
+        return It(t.stringValue, e.stringValue);
 
       case 6 /* TypeOrder.BlobValue */ :
         return function(t, e) {
-            const n = Nt(t), r = Nt(e);
+            const n = Ft(t), r = Ft(e);
             return n.compareTo(r);
         }(t.bytesValue, e.bytesValue);
 
@@ -1835,34 +1865,34 @@ function Lt(t, e) {
         return function(t, e) {
             const n = t.split("/"), r = e.split("/");
             for (let t = 0; t < n.length && t < r.length; t++) {
-                const e = Et(n[t], r[t]);
+                const e = It(n[t], r[t]);
                 if (0 !== e) return e;
             }
-            return Et(n.length, r.length);
+            return It(n.length, r.length);
         }(t.referenceValue, e.referenceValue);
 
       case 8 /* TypeOrder.GeoPointValue */ :
         return function(t, e) {
-            const n = Et(Dt(t.latitude), Dt(e.latitude));
+            const n = It(Dt(t.latitude), Dt(e.latitude));
             if (0 !== n) return n;
-            return Et(Dt(t.longitude), Dt(e.longitude));
+            return It(Dt(t.longitude), Dt(e.longitude));
         }(t.geoPointValue, e.geoPointValue);
 
       case 9 /* TypeOrder.ArrayValue */ :
         return function(t, e) {
             const n = t.values || [], r = e.values || [];
             for (let t = 0; t < n.length && t < r.length; ++t) {
-                const e = Lt(n[t], r[t]);
+                const e = Ut(n[t], r[t]);
                 if (e) return e;
             }
-            return Et(n.length, r.length);
+            return It(n.length, r.length);
         }(t.arrayValue, e.arrayValue);
 
       case 10 /* TypeOrder.ObjectValue */ :
         return function(t, e) {
-            if (t === Ot && e === Ot) return 0;
-            if (t === Ot) return 1;
-            if (e === Ot) return -1;
+            if (t === kt && e === kt) return 0;
+            if (t === kt) return 1;
+            if (e === kt) return -1;
             const n = t.fields || {}, r = Object.keys(n), s = e.fields || {}, i = Object.keys(s);
             // Even though MapValues are likely sorted correctly based on their insertion
             // order (e.g. when received from the backend), local modifications can bring
@@ -1870,12 +1900,12 @@ function Lt(t, e) {
             // canonical IDs are independent of insertion order.
             r.sort(), i.sort();
             for (let t = 0; t < r.length && t < i.length; ++t) {
-                const e = Et(r[t], i[t]);
+                const e = It(r[t], i[t]);
                 if (0 !== e) return e;
-                const o = Lt(n[r[t]], s[i[t]]);
+                const o = Ut(n[r[t]], s[i[t]]);
                 if (0 !== o) return o;
             }
-            return Et(r.length, i.length);
+            return It(r.length, i.length);
         }
         /** Returns a reference value for the provided database and key. */ (t.mapValue, e.mapValue);
 
@@ -1884,35 +1914,35 @@ function Lt(t, e) {
     }
 }
 
-function Ut(t, e) {
-    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return Et(t, e);
-    const n = $t(t), r = $t(e), s = Et(n.seconds, r.seconds);
-    return 0 !== s ? s : Et(n.nanos, r.nanos);
+function jt(t, e) {
+    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return It(t, e);
+    const n = Nt(t), r = Nt(e), s = It(n.seconds, r.seconds);
+    return 0 !== s ? s : It(n.nanos, r.nanos);
 }
 
-function jt(t, e) {
+function Bt(t, e) {
     return {
         referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${e.path.canonicalString()}`
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Bt(t) {
+/** Returns true if `value` is an ArrayValue. */ function Qt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Qt(t) {
+/** Returns true if `value` is a NullValue. */ function zt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function zt(t) {
+/** Returns true if `value` is NaN. */ function Wt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function Wt(t) {
+/** Returns true if `value` is a MapValue. */ function Gt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Gt(t) {
+/** Creates a deep copy of `source`. */ function Kt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1925,7 +1955,7 @@ function jt(t, e) {
                 fields: {}
             }
         };
-        return At(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Gt(n))), e;
+        return Rt(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Kt(n))), e;
     }
     if (t.arrayValue) {
         const e = {
@@ -1933,24 +1963,24 @@ function jt(t, e) {
                 values: []
             }
         };
-        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Gt(t.arrayValue.values[n]);
+        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Kt(t.arrayValue.values[n]);
         return e;
     }
     return Object.assign({}, t);
 }
 
-class Kt {
+class Yt {
     constructor(t, e) {
         this.position = t, this.inclusive = e;
     }
 }
 
-function Yt(t, e) {
+function Ht(t, e) {
     if (null === t) return null === e;
     if (null === e) return !1;
     if (t.inclusive !== e.inclusive || t.position.length !== e.position.length) return !1;
     for (let n = 0; n < t.position.length; n++) {
-        if (!Ct(t.position[n], e.position[n])) return !1;
+        if (!Mt(t.position[n], e.position[n])) return !1;
     }
     return !0;
 }
@@ -1970,24 +2000,24 @@ function Yt(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class Ht {}
+ */ class Jt {}
 
-class Jt extends Ht {
+class Xt extends Jt {
     constructor(t, e, n) {
         super(), this.field = t, this.op = e, this.value = n;
     }
     /**
      * Creates a filter based on the provided arguments.
      */    static create(t, e, n) {
-        return t.isKeyField() ? "in" /* Operator.IN */ === e || "not-in" /* Operator.NOT_IN */ === e ? this.createKeyFieldInFilter(t, e, n) : new te(t, e, n) : "array-contains" /* Operator.ARRAY_CONTAINS */ === e ? new se(t, n) : "in" /* Operator.IN */ === e ? new ie(t, n) : "not-in" /* Operator.NOT_IN */ === e ? new oe(t, n) : "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new ue(t, n) : new Jt(t, e, n);
+        return t.isKeyField() ? "in" /* Operator.IN */ === e || "not-in" /* Operator.NOT_IN */ === e ? this.createKeyFieldInFilter(t, e, n) : new ee(t, e, n) : "array-contains" /* Operator.ARRAY_CONTAINS */ === e ? new ie(t, n) : "in" /* Operator.IN */ === e ? new oe(t, n) : "not-in" /* Operator.NOT_IN */ === e ? new ue(t, n) : "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new ce(t, n) : new Xt(t, e, n);
     }
     static createKeyFieldInFilter(t, e, n) {
-        return "in" /* Operator.IN */ === e ? new ee(t, n) : new ne(t, n);
+        return "in" /* Operator.IN */ === e ? new ne(t, n) : new re(t, n);
     }
     matches(t) {
         const e = t.data.field(this.field);
         // Types do not have to match in NOT_EQUAL filters.
-                return "!=" /* Operator.NOT_EQUAL */ === this.op ? null !== e && this.matchesComparison(Lt(e, this.value)) : null !== e && kt(this.value) === kt(e) && this.matchesComparison(Lt(e, this.value));
+                return "!=" /* Operator.NOT_EQUAL */ === this.op ? null !== e && this.matchesComparison(Ut(e, this.value)) : null !== e && Ct(this.value) === Ct(e) && this.matchesComparison(Ut(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
     matchesComparison(t) {
@@ -2028,21 +2058,21 @@ class Jt extends Ht {
     }
 }
 
-class Xt extends Ht {
+class Zt extends Jt {
     constructor(t, e) {
-        super(), this.filters = t, this.op = e, this.N = null;
+        super(), this.filters = t, this.op = e, this.D = null;
     }
     /**
      * Creates a filter based on the provided arguments.
      */    static create(t, e) {
-        return new Xt(t, e);
+        return new Zt(t, e);
     }
     matches(t) {
         return "and" /* CompositeOperator.AND */ === this.op ? void 0 === this.filters.find((e => !e.matches(t))) : void 0 !== this.filters.find((e => e.matches(t)));
     }
     getFlattenedFilters() {
-        return null !== this.N || (this.N = this.filters.reduce(((t, e) => t.concat(e.getFlattenedFilters())), [])), 
-        this.N;
+        return null !== this.D || (this.D = this.filters.reduce(((t, e) => t.concat(e.getFlattenedFilters())), [])), 
+        this.D;
     }
     // Returns a mutable copy of `this.filters`
     getFilters() {
@@ -2061,19 +2091,19 @@ class Xt extends Ht {
     }
 }
 
-function Zt(t, e) {
-    return t instanceof Jt ? function(t, e) {
-        return e instanceof Jt && t.op === e.op && t.field.isEqual(e.field) && Ct(t.value, e.value);
-    }(t, e) : t instanceof Xt ? function(t, e) {
-        if (e instanceof Xt && t.op === e.op && t.filters.length === e.filters.length) {
-            return t.filters.reduce(((t, n, r) => t && Zt(n, e.filters[r])), !0);
+function te(t, e) {
+    return t instanceof Xt ? function(t, e) {
+        return e instanceof Xt && t.op === e.op && t.field.isEqual(e.field) && Mt(t.value, e.value);
+    }(t, e) : t instanceof Zt ? function(t, e) {
+        if (e instanceof Zt && t.op === e.op && t.filters.length === e.filters.length) {
+            return t.filters.reduce(((t, n, r) => t && te(n, e.filters[r])), !0);
         }
         return !1;
     }
     /** Filter that matches on key fields (i.e. '__name__'). */ (t, e) : void b();
 }
 
-class te extends Jt {
+class ee extends Xt {
     constructor(t, e, n) {
         super(t, e, n), this.key = rt.fromName(n.referenceValue);
     }
@@ -2083,69 +2113,69 @@ class te extends Jt {
     }
 }
 
-/** Filter that matches on key fields within an array. */ class ee extends Jt {
+/** Filter that matches on key fields within an array. */ class ne extends Xt {
     constructor(t, e) {
-        super(t, "in" /* Operator.IN */ , e), this.keys = re("in" /* Operator.IN */ , e);
+        super(t, "in" /* Operator.IN */ , e), this.keys = se("in" /* Operator.IN */ , e);
     }
     matches(t) {
         return this.keys.some((e => e.isEqual(t.key)));
     }
 }
 
-/** Filter that matches on key fields not present within an array. */ class ne extends Jt {
+/** Filter that matches on key fields not present within an array. */ class re extends Xt {
     constructor(t, e) {
-        super(t, "not-in" /* Operator.NOT_IN */ , e), this.keys = re("not-in" /* Operator.NOT_IN */ , e);
+        super(t, "not-in" /* Operator.NOT_IN */ , e), this.keys = se("not-in" /* Operator.NOT_IN */ , e);
     }
     matches(t) {
         return !this.keys.some((e => e.isEqual(t.key)));
     }
 }
 
-function re(t, e) {
+function se(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => rt.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class se extends Jt {
+/** A Filter that implements the array-contains operator. */ class ie extends Xt {
     constructor(t, e) {
         super(t, "array-contains" /* Operator.ARRAY_CONTAINS */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return Bt(e) && Mt(e.arrayValue, this.value);
+        return Qt(e) && Lt(e.arrayValue, this.value);
     }
 }
 
-/** A Filter that implements the IN operator. */ class ie extends Jt {
+/** A Filter that implements the IN operator. */ class oe extends Xt {
     constructor(t, e) {
         super(t, "in" /* Operator.IN */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return null !== e && Mt(this.value.arrayValue, e);
+        return null !== e && Lt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the not-in operator. */ class oe extends Jt {
+/** A Filter that implements the not-in operator. */ class ue extends Xt {
     constructor(t, e) {
         super(t, "not-in" /* Operator.NOT_IN */ , e);
     }
     matches(t) {
-        if (Mt(this.value.arrayValue, {
+        if (Lt(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         const e = t.data.field(this.field);
-        return null !== e && !Mt(this.value.arrayValue, e);
+        return null !== e && !Lt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the array-contains-any operator. */ class ue extends Jt {
+/** A Filter that implements the array-contains-any operator. */ class ce extends Xt {
     constructor(t, e) {
         super(t, "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return !(!Bt(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => Mt(this.value.arrayValue, t)));
+        return !(!Qt(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => Lt(this.value.arrayValue, t)));
     }
 }
 
@@ -2167,13 +2197,13 @@ function re(t, e) {
  */
 /**
  * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
- */ class ce {
+ */ class ae {
     constructor(t, e = "asc" /* Direction.ASCENDING */) {
         this.field = t, this.dir = e;
     }
 }
 
-function ae(t, e) {
+function he(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
@@ -2196,18 +2226,18 @@ function ae(t, e) {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ class he {
+ */ class le {
     constructor(t) {
         this.timestamp = t;
     }
     static fromTimestamp(t) {
-        return new he(t);
+        return new le(t);
     }
     static min() {
-        return new he(new Ft(0, 0));
+        return new le(new xt(0, 0));
     }
     static max() {
-        return new he(new Ft(253402300799, 999999999));
+        return new le(new xt(253402300799, 999999999));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -2245,17 +2275,17 @@ function ae(t, e) {
  */
 // An immutable sorted map implementation, based on a Left-leaning Red-Black
 // tree.
-class le {
+class fe {
     constructor(t, e) {
-        this.comparator = t, this.root = e || de.EMPTY;
+        this.comparator = t, this.root = e || we.EMPTY;
     }
     // Returns a copy of the map, with the specified key/value added or replaced.
     insert(t, e) {
-        return new le(this.comparator, this.root.insert(t, e, this.comparator).copy(null, null, de.BLACK, null, null));
+        return new fe(this.comparator, this.root.insert(t, e, this.comparator).copy(null, null, we.BLACK, null, null));
     }
     // Returns a copy of the map, with the specified key removed.
     remove(t) {
-        return new le(this.comparator, this.root.remove(t, this.comparator).copy(null, null, de.BLACK, null, null));
+        return new fe(this.comparator, this.root.remove(t, this.comparator).copy(null, null, we.BLACK, null, null));
     }
     // Returns the value of the node with the given key, or null.
     get(t) {
@@ -2321,22 +2351,22 @@ class le {
     }
     // Returns an iterator over the SortedMap.
     getIterator() {
-        return new fe(this.root, null, this.comparator, !1);
+        return new de(this.root, null, this.comparator, !1);
     }
     getIteratorFrom(t) {
-        return new fe(this.root, t, this.comparator, !1);
+        return new de(this.root, t, this.comparator, !1);
     }
     getReverseIterator() {
-        return new fe(this.root, null, this.comparator, !0);
+        return new de(this.root, null, this.comparator, !0);
     }
     getReverseIteratorFrom(t) {
-        return new fe(this.root, t, this.comparator, !0);
+        return new de(this.root, t, this.comparator, !0);
     }
 }
 
  // end SortedMap
 // An iterator over an LLRBNode.
-class fe {
+class de {
     constructor(t, e, n, r) {
         this.isReverse = r, this.nodeStack = [];
         let s = 1;
@@ -2381,14 +2411,14 @@ class fe {
 
  // end SortedMapIterator
 // Represents a node in a Left-leaning Red-Black tree.
-class de {
+class we {
     constructor(t, e, n, r, s) {
-        this.key = t, this.value = e, this.color = null != n ? n : de.RED, this.left = null != r ? r : de.EMPTY, 
-        this.right = null != s ? s : de.EMPTY, this.size = this.left.size + 1 + this.right.size;
+        this.key = t, this.value = e, this.color = null != n ? n : we.RED, this.left = null != r ? r : we.EMPTY, 
+        this.right = null != s ? s : we.EMPTY, this.size = this.left.size + 1 + this.right.size;
     }
     // Returns a copy of the current node, optionally replacing pieces of it.
     copy(t, e, n, r, s) {
-        return new de(null != t ? t : this.key, null != e ? e : this.value, null != n ? n : this.color, null != r ? r : this.left, null != s ? s : this.right);
+        return new we(null != t ? t : this.key, null != e ? e : this.value, null != n ? n : this.color, null != r ? r : this.left, null != s ? s : this.right);
     }
     isEmpty() {
         return !1;
@@ -2427,7 +2457,7 @@ class de {
         r.fixUp();
     }
     removeMin() {
-        if (this.left.isEmpty()) return de.EMPTY;
+        if (this.left.isEmpty()) return we.EMPTY;
         let t = this;
         return t.left.isRed() || t.left.left.isRed() || (t = t.moveRedLeft()), t = t.copy(null, null, null, t.left.removeMin(), null), 
         t.fixUp();
@@ -2439,7 +2469,7 @@ class de {
         r = r.copy(null, null, null, r.left.remove(t, e), null); else {
             if (r.left.isRed() && (r = r.rotateRight()), r.right.isEmpty() || r.right.isRed() || r.right.left.isRed() || (r = r.moveRedRight()), 
             0 === e(t, r.key)) {
-                if (r.right.isEmpty()) return de.EMPTY;
+                if (r.right.isEmpty()) return we.EMPTY;
                 n = r.right.min(), r = r.copy(n.key, n.value, null, null, r.right.removeMin());
             }
             r = r.copy(null, null, null, null, r.right.remove(t, e));
@@ -2465,11 +2495,11 @@ class de {
         return t.left.left.isRed() && (t = t.rotateRight(), t = t.colorFlip()), t;
     }
     rotateLeft() {
-        const t = this.copy(null, null, de.RED, null, this.right.left);
+        const t = this.copy(null, null, we.RED, null, this.right.left);
         return this.right.copy(null, null, this.color, t, null);
     }
     rotateRight() {
-        const t = this.copy(null, null, de.RED, this.left.right, null);
+        const t = this.copy(null, null, we.RED, this.left.right, null);
         return this.left.copy(null, null, this.color, null, t);
     }
     colorFlip() {
@@ -2495,10 +2525,10 @@ class de {
  // end LLRBNode
 // Empty node is shared between all LLRB trees.
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
-de.EMPTY = null, de.RED = !0, de.BLACK = !1;
+we.EMPTY = null, we.RED = !0, we.BLACK = !1;
 
 // end LLRBEmptyNode
-de.EMPTY = new 
+we.EMPTY = new 
 // Represents an empty node (a leaf node in the Red-Black Tree).
 class {
     constructor() {
@@ -2525,7 +2555,7 @@ class {
     }
     // Returns a copy of the tree, with the specified key/value added.
     insert(t, e, n) {
-        return new de(t, e);
+        return new we(t, e);
     }
     // Returns a copy of the tree, with the specified key removed.
     remove(t, e) {
@@ -2581,9 +2611,9 @@ class {
  * NOTE: if provided comparator returns 0 for two elements, we consider them to
  * be equal!
  */
-class we {
+class me {
     constructor(t) {
-        this.comparator = t, this.data = new le(this.comparator);
+        this.comparator = t, this.data = new fe(this.comparator);
     }
     has(t) {
         return null !== this.data.get(t);
@@ -2624,10 +2654,10 @@ class we {
         return e.hasNext() ? e.getNext().key : null;
     }
     getIterator() {
-        return new me(this.data.getIterator());
+        return new pe(this.data.getIterator());
     }
     getIteratorFrom(t) {
-        return new me(this.data.getIteratorFrom(t));
+        return new pe(this.data.getIteratorFrom(t));
     }
     /** Inserts or updates an element */    add(t) {
         return this.copy(this.data.remove(t).insert(t, !0));
@@ -2646,7 +2676,7 @@ class we {
         })), e;
     }
     isEqual(t) {
-        if (!(t instanceof we)) return !1;
+        if (!(t instanceof me)) return !1;
         if (this.size !== t.size) return !1;
         const e = this.data.getIterator(), n = t.data.getIterator();
         for (;e.hasNext(); ) {
@@ -2666,12 +2696,12 @@ class we {
         return this.forEach((e => t.push(e))), "SortedSet(" + t.toString() + ")";
     }
     copy(t) {
-        const e = new we(this.comparator);
+        const e = new me(this.comparator);
         return e.data = t, e;
     }
 }
 
-class me {
+class pe {
     constructor(t) {
         this.iter = t;
     }
@@ -2708,7 +2738,7 @@ class me {
  *   foo.bar - Overwrites only the field bar of the object foo.
  *             If foo is not an object, foo is replaced with an object
  *             containing foo
- */ class pe {
+ */ class ye {
     constructor(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
@@ -2716,16 +2746,16 @@ class me {
         t.sort(nt.comparator);
     }
     static empty() {
-        return new pe([]);
+        return new ye([]);
     }
     /**
      * Returns a new FieldMask object that is the result of adding all the given
      * fields paths to this field mask.
      */    unionWith(t) {
-        let e = new we(nt.comparator);
+        let e = new me(nt.comparator);
         for (const t of this.fields) e = e.add(t);
         for (const n of t) e = e.add(n);
-        return new pe(e.toArray());
+        return new ye(e.toArray());
     }
     /**
      * Verifies that `fieldPath` is included by at least one field in this field
@@ -2737,7 +2767,7 @@ class me {
         return !1;
     }
     isEqual(t) {
-        return It(this.fields, t.fields, ((t, e) => t.isEqual(e)));
+        return Tt(this.fields, t.fields, ((t, e) => t.isEqual(e)));
     }
 }
 
@@ -2760,12 +2790,12 @@ class me {
 /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ class ye {
+ */ class ge {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new ye({
+        return new ge({
             mapValue: {}
         });
     }
@@ -2779,7 +2809,7 @@ class me {
         {
             let e = this.value;
             for (let n = 0; n < t.length - 1; ++n) if (e = (e.mapValue.fields || {})[t.get(n)], 
-            !Wt(e)) return null;
+            !Gt(e)) return null;
             return e = (e.mapValue.fields || {})[t.lastSegment()], e || null;
         }
     }
@@ -2789,7 +2819,7 @@ class me {
      * @param path - The field path to set.
      * @param value - The value to set.
      */    set(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Gt(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Kt(e);
     }
     /**
      * Sets the provided fields to the provided values.
@@ -2803,7 +2833,7 @@ class me {
                 const t = this.getFieldsMap(e);
                 this.applyChanges(t, n, r), n = {}, r = [], e = s.popLast();
             }
-            t ? n[s.lastSegment()] = Gt(t) : r.push(s.lastSegment());
+            t ? n[s.lastSegment()] = Kt(t) : r.push(s.lastSegment());
         }));
         const s = this.getFieldsMap(e);
         this.applyChanges(s, n, r);
@@ -2815,10 +2845,10 @@ class me {
      * @param path - The field path to remove.
      */    delete(t) {
         const e = this.field(t.popLast());
-        Wt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        Gt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }
     isEqual(t) {
-        return Ct(this.value, t.value);
+        return Mt(this.value, t.value);
     }
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -2830,7 +2860,7 @@ class me {
         });
         for (let n = 0; n < t.length; ++n) {
             let r = e.mapValue.fields[t.get(n)];
-            Wt(r) && r.mapValue.fields || (r = {
+            Gt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -2842,11 +2872,11 @@ class me {
      * Modifies `fieldsMap` by adding, replacing or deleting the specified
      * entries.
      */    applyChanges(t, e, n) {
-        At(e, ((e, n) => t[e] = n));
+        Rt(e, ((e, n) => t[e] = n));
         for (const e of n) delete t[e];
     }
     clone() {
-        return new ye(Gt(this.value));
+        return new ge(Kt(this.value));
     }
 }
 
@@ -2875,7 +2905,7 @@ class me {
  * not transition to one of these states even after all mutations have been
  * applied, `isValidDocument()` returns false and the document should be removed
  * from all views.
- */ class ge {
+ */ class _e {
     constructor(t, e, n, r, s, i, o) {
         this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.createTime = s, 
         this.data = i, this.documentState = o;
@@ -2884,35 +2914,35 @@ class me {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new ge(t, 0 /* DocumentType.INVALID */ , 
-        /* version */ he.min(), 
-        /* readTime */ he.min(), 
-        /* createTime */ he.min(), ye.empty(), 0 /* DocumentState.SYNCED */);
+        return new _e(t, 0 /* DocumentType.INVALID */ , 
+        /* version */ le.min(), 
+        /* readTime */ le.min(), 
+        /* createTime */ le.min(), ge.empty(), 0 /* DocumentState.SYNCED */);
     }
     /**
      * Creates a new document that is known to exist with the given data at the
      * given version.
      */    static newFoundDocument(t, e, n, r) {
-        return new ge(t, 1 /* DocumentType.FOUND_DOCUMENT */ , 
+        return new _e(t, 1 /* DocumentType.FOUND_DOCUMENT */ , 
         /* version */ e, 
-        /* readTime */ he.min(), 
+        /* readTime */ le.min(), 
         /* createTime */ n, r, 0 /* DocumentState.SYNCED */);
     }
     /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, e) {
-        return new ge(t, 2 /* DocumentType.NO_DOCUMENT */ , 
+        return new _e(t, 2 /* DocumentType.NO_DOCUMENT */ , 
         /* version */ e, 
-        /* readTime */ he.min(), 
-        /* createTime */ he.min(), ye.empty(), 0 /* DocumentState.SYNCED */);
+        /* readTime */ le.min(), 
+        /* createTime */ le.min(), ge.empty(), 0 /* DocumentState.SYNCED */);
     }
     /**
      * Creates a new document that is known to exist at the given version but
      * whose data is not known (e.g. a document that was updated without a known
      * base document).
      */    static newUnknownDocument(t, e) {
-        return new ge(t, 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
+        return new _e(t, 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
         /* version */ e, 
-        /* readTime */ he.min(), 
-        /* createTime */ he.min(), ye.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
+        /* readTime */ le.min(), 
+        /* createTime */ le.min(), ge.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2923,7 +2953,7 @@ class me {
         // update from Watch or due to applying a local set mutation on top
         // of a deleted document, our best guess about its createTime would be the
         // version at which the document transitioned to a FOUND_DOCUMENT.
-        return !this.createTime.isEqual(he.min()) || 2 /* DocumentType.NO_DOCUMENT */ !== this.documentType && 0 /* DocumentType.INVALID */ !== this.documentType || (this.createTime = t), 
+        return !this.createTime.isEqual(le.min()) || 2 /* DocumentType.NO_DOCUMENT */ !== this.documentType && 0 /* DocumentType.INVALID */ !== this.documentType || (this.createTime = t), 
         this.version = t, this.documentType = 1 /* DocumentType.FOUND_DOCUMENT */ , this.data = e, 
         this.documentState = 0 /* DocumentState.SYNCED */ , this;
     }
@@ -2932,7 +2962,7 @@ class me {
      * version.
      */    convertToNoDocument(t) {
         return this.version = t, this.documentType = 2 /* DocumentType.NO_DOCUMENT */ , 
-        this.data = ye.empty(), this.documentState = 0 /* DocumentState.SYNCED */ , this;
+        this.data = ge.empty(), this.documentState = 0 /* DocumentState.SYNCED */ , this;
     }
     /**
      * Changes the document type to indicate that it exists at a given version but
@@ -2940,14 +2970,14 @@ class me {
      * base document).
      */    convertToUnknownDocument(t) {
         return this.version = t, this.documentType = 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
-        this.data = ye.empty(), this.documentState = 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ , 
+        this.data = ge.empty(), this.documentState = 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ , 
         this;
     }
     setHasCommittedMutations() {
         return this.documentState = 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasLocalMutations() {
-        return this.documentState = 1 /* DocumentState.HAS_LOCAL_MUTATIONS */ , this.version = he.min(), 
+        return this.documentState = 1 /* DocumentState.HAS_LOCAL_MUTATIONS */ , this.version = le.min(), 
         this;
     }
     setReadTime(t) {
@@ -2975,10 +3005,10 @@ class me {
         return 3 /* DocumentType.UNKNOWN_DOCUMENT */ === this.documentType;
     }
     isEqual(t) {
-        return t instanceof ge && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
+        return t instanceof _e && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
     }
     mutableCopy() {
-        return new ge(this.key, this.documentType, this.version, this.readTime, this.createTime, this.data.clone(), this.documentState);
+        return new _e(this.key, this.documentType, this.version, this.readTime, this.createTime, this.data.clone(), this.documentState);
     }
     toString() {
         return `Document(${this.key}, ${this.version}, ${JSON.stringify(this.data.value)}, {createTime: ${this.createTime}}), {documentType: ${this.documentType}}), {documentState: ${this.documentState}})`;
@@ -3002,7 +3032,7 @@ class me {
  * limitations under the License.
  */
 // Visible for testing
-class _e {
+class ve {
     constructor(t, e = null, n = [], r = [], s = null, i = null, o = null) {
         this.path = t, this.collectionGroup = e, this.orderBy = n, this.filters = r, this.limit = s, 
         this.startAt = i, this.endAt = o, this.S = null;
@@ -3016,8 +3046,8 @@ class _e {
  * NOTE: you should always construct `Target` from `Query.toTarget` instead of
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
- */ function ve(t, e = null, n = [], r = [], s = null, i = null, o = null) {
-    return new _e(t, e, n, r, s, i, o);
+ */ function be(t, e = null, n = [], r = [], s = null, i = null, o = null) {
+    return new ve(t, e, n, r, s, i, o);
 }
 
 /**
@@ -3043,7 +3073,7 @@ class _e {
  *
  * Visible for testing.
  */
-class be {
+class Ee {
     /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -3056,11 +3086,11 @@ class be {
     }
 }
 
-/** Creates a new Query for a query that matches all documents at `path` */ function Ee(t) {
+/** Creates a new Query for a query that matches all documents at `path` */ function Ie(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function Ie(t) {
+function Te(t) {
     for (const e of t.filters) {
         const t = e.getFirstInequalityField();
         if (null !== t) return t;
@@ -3076,7 +3106,7 @@ function Ie(t) {
  * Returns whether the query matches a collection group rather than a specific
  * collection.
  */
-function Te(t) {
+function Ae(t) {
     return null !== t.collectionGroup;
 }
 
@@ -3084,23 +3114,23 @@ function Te(t) {
  * Returns the implicit order by constraint that is used to execute the Query,
  * which can be different from the order by constraints the user provided (e.g.
  * the SDK and backend always orders by `__name__`).
- */ function Ae(t) {
+ */ function Re(t) {
     const e = I(t);
     if (null === e.q) {
         e.q = [];
-        const t = Ie(e), n = Ee(e);
+        const t = Te(e), n = Ie(e);
         if (null !== t && null === n) 
         // 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.
-        t.isKeyField() || e.q.push(new ce(t)), e.q.push(new ce(nt.keyField(), "asc" /* Direction.ASCENDING */)); else {
+        t.isKeyField() || e.q.push(new ae(t)), e.q.push(new ae(nt.keyField(), "asc" /* Direction.ASCENDING */)); else {
             let t = !1;
             for (const n of e.explicitOrderBy) e.q.push(n), n.field.isKeyField() && (t = !0);
             if (!t) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 const t = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* Direction.ASCENDING */;
-                e.q.push(new ce(nt.keyField(), t));
+                e.q.push(new ae(nt.keyField(), t));
             }
         }
     }
@@ -3109,38 +3139,38 @@ function Te(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function Re(t) {
+ */ function Pe(t) {
     const e = I(t);
-    if (!e.O) if ("F" /* LimitType.First */ === e.limitType) e.O = ve(e.path, e.collectionGroup, Ae(e), e.filters, e.limit, e.startAt, e.endAt); else {
+    if (!e.O) if ("F" /* LimitType.First */ === e.limitType) e.O = be(e.path, e.collectionGroup, Re(e), e.filters, e.limit, e.startAt, e.endAt); else {
         // Flip the orderBy directions since we want the last results
         const t = [];
-        for (const n of Ae(e)) {
+        for (const n of Re(e)) {
             const e = "desc" /* Direction.DESCENDING */ === n.dir ? "asc" /* Direction.ASCENDING */ : "desc" /* Direction.DESCENDING */;
-            t.push(new ce(n.field, e));
+            t.push(new ae(n.field, e));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                const n = e.endAt ? new Kt(e.endAt.position, e.endAt.inclusive) : null, r = e.startAt ? new Kt(e.startAt.position, e.startAt.inclusive) : null;
+                const n = e.endAt ? new Yt(e.endAt.position, e.endAt.inclusive) : null, r = e.startAt ? new Yt(e.startAt.position, e.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
-        e.O = ve(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
+        e.O = be(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
     }
     return e.O;
 }
 
-function Pe(t, e) {
-    e.getFirstInequalityField(), Ie(t);
+function Ve(t, e) {
+    e.getFirstInequalityField(), Te(t);
     const n = t.filters.concat([ e ]);
-    return new be(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+    return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
 }
 
-function Ve(t, e) {
+function $e(t, e) {
     return function(t, e) {
         if (t.limit !== e.limit) return !1;
         if (t.orderBy.length !== e.orderBy.length) return !1;
-        for (let n = 0; n < t.orderBy.length; n++) if (!ae(t.orderBy[n], e.orderBy[n])) return !1;
+        for (let n = 0; n < t.orderBy.length; n++) if (!he(t.orderBy[n], e.orderBy[n])) return !1;
         if (t.filters.length !== e.filters.length) return !1;
-        for (let n = 0; n < t.filters.length; n++) if (!Zt(t.filters[n], e.filters[n])) return !1;
-        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!Yt(t.startAt, e.startAt) && Yt(t.endAt, e.endAt);
-    }(Re(t), Re(e)) && t.limitType === e.limitType;
+        for (let n = 0; n < t.filters.length; n++) if (!te(t.filters[n], e.filters[n])) return !1;
+        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!Ht(t.startAt, e.startAt) && Ht(t.endAt, e.endAt);
+    }(Pe(t), Pe(e)) && t.limitType === e.limitType;
 }
 
 /**
@@ -3168,9 +3198,9 @@ function Ve(t, e) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function $e(t, e) {
+function Ne(t, e) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !dt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !wt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
     /**
  * Returns an IntegerValue for `value`.
@@ -3192,7 +3222,7 @@ function $e(t, e) {
             };
         }
         return {
-            doubleValue: dt(e) ? "-0" : e
+            doubleValue: wt(e) ? "-0" : e
         };
     }(t, e);
 }
@@ -3221,15 +3251,15 @@ function $e(t, e) {
     }
 }
 
-/** Transforms a value into a server-generated timestamp. */ class Ne extends De {}
+/** Transforms a value into a server-generated timestamp. */ class Fe extends De {}
 
-/** Transforms an array value via a union operation. */ class Fe extends De {
+/** Transforms an array value via a union operation. */ class xe extends De {
     constructor(t) {
         super(), this.elements = t;
     }
 }
 
-/** Transforms an array value via a remove operation. */ class xe extends De {
+/** Transforms an array value via a remove operation. */ class Se extends De {
     constructor(t) {
         super(), this.elements = t;
     }
@@ -3240,7 +3270,7 @@ function $e(t, e) {
  * transforms. Converts all field values to integers or doubles, but unlike the
  * backend does not cap integer values at 2^63. Instead, JavaScript number
  * arithmetic is used and precision loss can occur for values greater than 2^53.
- */ class Se extends De {
+ */ class qe extends De {
     constructor(t, e) {
         super(), this.serializer = t, this.k = e;
     }
@@ -3262,7 +3292,7 @@ function $e(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** A field path and the TransformOperation to perform upon it. */ class qe {
+/** A field path and the TransformOperation to perform upon it. */ class Oe {
     constructor(t, e) {
         this.field = t, this.transform = e;
     }
@@ -3272,18 +3302,18 @@ function $e(t, e) {
  * Encodes a precondition for a mutation. This follows the model that the
  * backend accepts with the special case of an explicit "empty" precondition
  * (meaning no precondition).
- */ class Oe {
+ */ class ke {
     constructor(t, e) {
         this.updateTime = t, this.exists = e;
     }
     /** Creates a new empty Precondition. */    static none() {
-        return new Oe;
+        return new ke;
     }
     /** Creates a new Precondition with an exists flag. */    static exists(t) {
-        return new Oe(void 0, t);
+        return new ke(void 0, t);
     }
     /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {
-        return new Oe(t);
+        return new ke(t);
     }
     /** Returns whether this Precondition is empty. */    get isNone() {
         return void 0 === this.updateTime && void 0 === this.exists;
@@ -3336,12 +3366,12 @@ function $e(t, e) {
  * applyToLocalView() to implement the actual behavior of applying the mutation
  * to some source document (see `setMutationApplyToRemoteDocument()` for an
  * example).
- */ class ke {}
+ */ class Ce {}
 
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class Ce extends ke {
+ */ class Me extends Ce {
     constructor(t, e, n, r = []) {
         super(), this.key = t, this.value = e, this.precondition = n, this.fieldTransforms = r, 
         this.type = 0 /* MutationType.Set */;
@@ -3363,7 +3393,7 @@ function $e(t, e) {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ class Me extends ke {
+ */ class Le extends Ce {
     constructor(t, e, n, r, s = []) {
         super(), this.key = t, this.data = e, this.fieldMask = n, this.precondition = r, 
         this.fieldTransforms = s, this.type = 1 /* MutationType.Patch */;
@@ -3373,7 +3403,7 @@ function $e(t, e) {
     }
 }
 
-/** A mutation that deletes the document at the given key. */ class Le extends ke {
+/** A mutation that deletes the document at the given key. */ class Ue extends Ce {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 2 /* MutationType.Delete */ , 
         this.fieldTransforms = [];
@@ -3389,7 +3419,7 @@ function $e(t, e) {
  *
  * The `verify` operation is only used in Transactions, and this class serves
  * primarily to facilitate serialization into protos.
- */ class Ue extends ke {
+ */ class je extends Ce {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 3 /* MutationType.Verify */ , 
         this.fieldTransforms = [];
@@ -3414,13 +3444,13 @@ function $e(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const je = (() => {
+ */ const Be = (() => {
     const t = {
         asc: "ASCENDING",
         desc: "DESCENDING"
     };
     return t;
-})(), Be = (() => {
+})(), Qe = (() => {
     const t = {
         "<": "LESS_THAN",
         "<=": "LESS_THAN_OR_EQUAL",
@@ -3434,7 +3464,7 @@ function $e(t, e) {
         "array-contains-any": "ARRAY_CONTAINS_ANY"
     };
     return t;
-})(), Qe = (() => {
+})(), ze = (() => {
     const t = {
         and: "AND",
         or: "OR"
@@ -3456,7 +3486,7 @@ function $e(t, e) {
  * TODO(klimt): We can remove the databaseId argument if we keep the full
  * resource name in documents.
  */
-class ze {
+class We {
     constructor(t, e) {
         this.databaseId = t, this.useProto3Json = e;
     }
@@ -3473,7 +3503,7 @@ class ze {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function We(t, e) {
+function Ge(t, e) {
     if (t.useProto3Json) {
         return `${new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + e.nanoseconds).slice(-9)}Z`;
     }
@@ -3488,35 +3518,35 @@ function We(t, e) {
  *
  * Visible for testing.
  */
-function Ge(t, e) {
+function Ke(t, e) {
     return t.useProto3Json ? e.toBase64() : e.toUint8Array();
 }
 
-function Ke(t, e) {
-    return We(t, e.toTimestamp());
+function Ye(t, e) {
+    return Ge(t, e.toTimestamp());
 }
 
-function Ye(t) {
-    return E(!!t), he.fromTimestamp(function(t) {
-        const e = $t(t);
-        return new Ft(e.seconds, e.nanos);
+function He(t) {
+    return E(!!t), le.fromTimestamp(function(t) {
+        const e = Nt(t);
+        return new xt(e.seconds, e.nanos);
     }(t));
 }
 
-function He(t, e) {
+function Je(t, e) {
     return function(t) {
         return new tt([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
-function Je(t, e) {
-    return He(t.databaseId, e.path);
+function Xe(t, e) {
+    return Je(t.databaseId, e.path);
 }
 
-function Xe(t, e) {
+function Ze(t, e) {
     const n = function(t) {
         const e = tt.fromString(t);
-        return E(fn(e)), e;
+        return E(dn(e)), e;
     }(e);
     if (n.get(1) !== t.databaseId.projectId) throw new U(P, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
     if (n.get(3) !== t.databaseId.database) throw new U(P, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
@@ -3524,98 +3554,98 @@ function Xe(t, e) {
     var r;
     /** Creates a Document proto from key and fields (but no create/update time) */}
 
-function Ze(t, e) {
-    return He(t.databaseId, e);
+function tn(t, e) {
+    return Je(t.databaseId, e);
 }
 
-function tn(t) {
+function en(t) {
     return new tt([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function en(t, e, n) {
+function nn(t, e, n) {
     return {
-        name: Je(t, e),
+        name: Xe(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function nn(t, e) {
+function rn(t, e) {
     return "found" in e ? function(t, e) {
         E(!!e.found), e.found.name, e.found.updateTime;
-        const n = Xe(t, e.found.name), r = Ye(e.found.updateTime), s = e.found.createTime ? Ye(e.found.createTime) : he.min(), i = new ye({
+        const n = Ze(t, e.found.name), r = He(e.found.updateTime), s = e.found.createTime ? He(e.found.createTime) : le.min(), i = new ge({
             mapValue: {
                 fields: e.found.fields
             }
         });
-        return ge.newFoundDocument(n, r, s, i);
+        return _e.newFoundDocument(n, r, s, i);
     }(t, e) : "missing" in e ? function(t, e) {
         E(!!e.missing), E(!!e.readTime);
-        const n = Xe(t, e.missing), r = Ye(e.readTime);
-        return ge.newNoDocument(n, r);
+        const n = Ze(t, e.missing), r = He(e.readTime);
+        return _e.newNoDocument(n, r);
     }(t, e) : b();
 }
 
-function rn(t, e) {
+function sn(t, e) {
     let n;
-    if (e instanceof Ce) n = {
-        update: en(t, e.key, e.value)
+    if (e instanceof Me) n = {
+        update: nn(t, e.key, e.value)
+    }; else if (e instanceof Ue) n = {
+        delete: Xe(t, e.key)
     }; else if (e instanceof Le) n = {
-        delete: Je(t, e.key)
-    }; else if (e instanceof Me) n = {
-        update: en(t, e.key, e.data),
-        updateMask: ln(e.fieldMask)
+        update: nn(t, e.key, e.data),
+        updateMask: fn(e.fieldMask)
     }; else {
-        if (!(e instanceof Ue)) return b();
+        if (!(e instanceof je)) return b();
         n = {
-            verify: Je(t, e.key)
+            verify: Xe(t, e.key)
         };
     }
     return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((t => function(t, e) {
         const n = e.transform;
-        if (n instanceof Ne) return {
+        if (n instanceof Fe) return {
             fieldPath: e.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
-        if (n instanceof Fe) return {
+        if (n instanceof xe) return {
             fieldPath: e.field.canonicalString(),
             appendMissingElements: {
                 values: n.elements
             }
         };
-        if (n instanceof xe) return {
+        if (n instanceof Se) return {
             fieldPath: e.field.canonicalString(),
             removeAllFromArray: {
                 values: n.elements
             }
         };
-        if (n instanceof Se) return {
+        if (n instanceof qe) return {
             fieldPath: e.field.canonicalString(),
             increment: n.k
         };
         throw b();
     }(0, t)))), e.precondition.isNone || (n.currentDocument = function(t, e) {
         return void 0 !== e.updateTime ? {
-            updateTime: Ke(t, e.updateTime)
+            updateTime: Ye(t, e.updateTime)
         } : void 0 !== e.exists ? {
             exists: e.exists
         } : b();
     }(t, e.precondition)), n;
 }
 
-function sn(t, e) {
+function on(t, e) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const n = {
         structuredQuery: {}
     }, r = e.path;
-    null !== e.collectionGroup ? (n.parent = Ze(t, r), n.structuredQuery.from = [ {
+    null !== e.collectionGroup ? (n.parent = tn(t, r), n.structuredQuery.from = [ {
         collectionId: e.collectionGroup,
         allDescendants: !0
-    } ]) : (n.parent = Ze(t, r.popLast()), n.structuredQuery.from = [ {
+    } ]) : (n.parent = tn(t, r.popLast()), n.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     const s = function(t) {
         if (0 === t.length) return;
-        return hn(Xt.create(t, "and" /* CompositeOperator.AND */));
+        return ln(Zt.create(t, "and" /* CompositeOperator.AND */));
     }(e.filters);
     s && (n.structuredQuery.where = s);
     const i = function(t) {
@@ -3624,8 +3654,8 @@ function sn(t, e) {
         // visible for testing
         function(t) {
             return {
-                field: an(t.field),
-                direction: on(t.dir)
+                field: hn(t.field),
+                direction: un(t.dir)
             };
         }
         // visible for testing
@@ -3633,7 +3663,7 @@ function sn(t, e) {
     }(e.orderBy);
     i && (n.structuredQuery.orderBy = i);
     const o = function(t, e) {
-        return t.useProto3Json || ft(e) ? e : {
+        return t.useProto3Json || dt(e) ? e : {
             value: e
         };
     }(t, e.limit);
@@ -3651,81 +3681,81 @@ function sn(t, e) {
     (e.endAt)), n;
 }
 
-function on(t) {
-    return je[t];
-}
-
-// visible for testing
 function un(t) {
     return Be[t];
 }
 
+// visible for testing
 function cn(t) {
     return Qe[t];
 }
 
 function an(t) {
+    return ze[t];
+}
+
+function hn(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function hn(t) {
-    return t instanceof Jt ? function(t) {
+function ln(t) {
+    return t instanceof Xt ? function(t) {
         if ("==" /* Operator.EQUAL */ === t.op) {
-            if (zt(t.value)) return {
+            if (Wt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: hn(t.field),
                     op: "IS_NAN"
                 }
             };
-            if (Qt(t.value)) return {
+            if (zt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: hn(t.field),
                     op: "IS_NULL"
                 }
             };
         } else if ("!=" /* Operator.NOT_EQUAL */ === t.op) {
-            if (zt(t.value)) return {
+            if (Wt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: hn(t.field),
                     op: "IS_NOT_NAN"
                 }
             };
-            if (Qt(t.value)) return {
+            if (zt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: hn(t.field),
                     op: "IS_NOT_NULL"
                 }
             };
         }
         return {
             fieldFilter: {
-                field: an(t.field),
-                op: un(t.op),
+                field: hn(t.field),
+                op: cn(t.op),
                 value: t.value
             }
         };
-    }(t) : t instanceof Xt ? function(t) {
-        const e = t.getFilters().map((t => hn(t)));
+    }(t) : t instanceof Zt ? function(t) {
+        const e = t.getFilters().map((t => ln(t)));
         if (1 === e.length) return e[0];
         return {
             compositeFilter: {
-                op: cn(t.op),
+                op: an(t.op),
                 filters: e
             }
         };
     }(t) : b();
 }
 
-function ln(t) {
+function fn(t) {
     const e = [];
     return t.fields.forEach((t => e.push(t.canonicalString()))), {
         fieldPaths: e
     };
 }
 
-function fn(t) {
+function dn(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -3745,8 +3775,8 @@ function fn(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 dn(t) {
-    return new ze(t, /* useProto3Json= */ !0);
+ */ function wn(t) {
+    return new We(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -3774,7 +3804,7 @@ function fn(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class wn {
+class mn {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3872,7 +3902,7 @@ class wn {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class mn extends class {} {
+class pn extends class {} {
     constructor(t, e, n, r) {
         super(), this.authCredentials = t, this.appCheckCredentials = e, this.connection = n, 
         this.serializer = r, this.J = !1;
@@ -3899,19 +3929,19 @@ class mn extends class {} {
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function pn(t, e) {
-    const n = I(t), r = tn(n.serializer) + "/documents", s = {
-        writes: e.map((t => rn(n.serializer, t)))
+async function yn(t, e) {
+    const n = I(t), r = en(n.serializer) + "/documents", s = {
+        writes: e.map((t => sn(n.serializer, t)))
     };
     await n.v("Commit", r, s);
 }
 
-async function yn(t, e) {
-    const n = I(t), r = tn(n.serializer) + "/documents", s = {
-        documents: e.map((t => Je(n.serializer, t)))
+async function gn(t, e) {
+    const n = I(t), r = en(n.serializer) + "/documents", s = {
+        documents: e.map((t => Xe(n.serializer, t)))
     }, i = await n.R("BatchGetDocuments", r, s, e.length), o = new Map;
     i.forEach((t => {
-        const e = nn(n.serializer, t);
+        const e = rn(n.serializer, t);
         o.set(e.key.toString(), e);
     }));
     const u = [];
@@ -3921,24 +3951,24 @@ async function yn(t, e) {
     })), u;
 }
 
-async function gn(t, e) {
-    const n = I(t), r = sn(n.serializer, Re(e));
+async function _n(t, e) {
+    const n = I(t), r = on(n.serializer, Pe(e));
     return (await n.R("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, e, n) {
-        const r = Xe(t, e.name), s = Ye(e.updateTime), i = e.createTime ? Ye(e.createTime) : he.min(), o = new ye({
+        const r = Ze(t, e.name), s = He(e.updateTime), i = e.createTime ? He(e.createTime) : le.min(), o = new ge({
             mapValue: {
                 fields: e.fields
             }
-        }), u = ge.newFoundDocument(r, s, i, o);
+        }), u = _e.newFoundDocument(r, s, i, o);
         return n && u.setHasCommittedMutations(), n ? u.setHasCommittedMutations() : u;
     }(n.serializer, t.document, void 0)));
 }
 
-async function _n(t, e, n) {
+async function vn(t, e, n) {
     var r;
     const s = I(t), {request: i, Z: o} = function(t, e, n) {
-        const r = sn(t, e), s = {}, i = [];
+        const r = on(t, e), s = {}, i = [];
         let o = 0;
         return n.forEach((t => {
             // Map all client-side aliases to a unique short-form
@@ -3951,12 +3981,12 @@ async function _n(t, e, n) {
             }) : "avg" === t.$ ? i.push({
                 alias: e,
                 avg: {
-                    field: an(t.fieldPath)
+                    field: hn(t.fieldPath)
                 }
             }) : "sum" === t.$ && i.push({
                 alias: e,
                 sum: {
-                    field: an(t.fieldPath)
+                    field: hn(t.fieldPath)
                 }
             });
         })), {
@@ -3969,7 +3999,7 @@ async function _n(t, e, n) {
             },
             Z: s
         };
-    }(s.serializer, Re(e), n), u = i.parent;
+    }(s.serializer, Pe(e), n), u = i.parent;
     s.connection.g || delete i.parent;
     const c = (await s.R("RunAggregationQuery", u, i, /*expectedResponseCount=*/ 1)).filter((t => !!t.result));
     // Omit RunAggregationQueryResponse that only contain readTimes.
@@ -3996,7 +4026,7 @@ async function _n(t, e, n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const vn = new Map;
+ */ const bn = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -4007,17 +4037,17 @@ async function _n(t, e, n) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function bn(t) {
+function En(t) {
     if (t._terminated) throw new U(S, "The client has already been terminated.");
-    if (!vn.has(t)) {
+    if (!bn.has(t)) {
         y("ComponentProvider", "Initializing Datastore");
         const i = function(t) {
-            return new gt(t, fetch.bind(null));
+            return new _t(t, fetch.bind(null));
         }((e = t._databaseId, n = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
-        new J(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = dn(t._databaseId), u = function(t, e, n, r) {
-            return new mn(t, e, n, r);
+        new J(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, ht(s.experimentalLongPollingOptions), s.useFetchStreams))), o = wn(t._databaseId), u = function(t, e, n, r) {
+            return new pn(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, i, o);
-        vn.set(t, u);
+        bn.set(t, u);
     }
     var e, n, r, s;
     /**
@@ -4035,7 +4065,7 @@ function bn(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.
- */    return vn.get(t);
+ */    return bn.get(t);
 }
 
 /**
@@ -4047,9 +4077,9 @@ function bn(t) {
  * user-supplied `FirestoreSettings` object. This is a separate type so that
  * defaults can be supplied and the value can be checked for equality.
  */
-class En {
+class In {
     constructor(t) {
-        var e;
+        var e, n;
         if (void 0 === t.host) {
             if (void 0 !== t.ssl) throw new U(P, "Can't provide ssl option if host option is not set");
             this.host = "firestore.googleapis.com", this.ssl = true;
@@ -4062,19 +4092,20 @@ class En {
         !function(t, e, n, r) {
             if (!0 === e && !0 === r) throw new U(P, `${t} and ${n} cannot be used together.`);
         }("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling), 
-        this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalForceLongPolling ? this.experimentalAutoDetectLongPolling = !1 : void 0 === t.experimentalAutoDetectLongPolling ? this.experimentalAutoDetectLongPolling = false : 
+        this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalForceLongPolling ? this.experimentalAutoDetectLongPolling = !1 : void 0 === t.experimentalAutoDetectLongPolling ? this.experimentalAutoDetectLongPolling = true : 
         // For backwards compatibility, coerce the value to boolean even though
         // the TypeScript compiler has narrowed the type to boolean already.
         // noinspection PointlessBooleanExpressionJS
         this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
-        this.useFetchStreams = !!t.useFetchStreams;
-    }
-    isEqual(t) {
-        return this.host === t.host && this.ssl === t.ssl && this.credentials === t.credentials && this.cacheSizeBytes === t.cacheSizeBytes && this.experimentalForceLongPolling === t.experimentalForceLongPolling && this.experimentalAutoDetectLongPolling === t.experimentalAutoDetectLongPolling && this.ignoreUndefinedProperties === t.ignoreUndefinedProperties && this.useFetchStreams === t.useFetchStreams;
-    }
-}
-
-/**
+        this.experimentalLongPollingOptions = ht(null !== (n = t.experimentalLongPollingOptions) && void 0 !== n ? n : {}), 
+        function(t) {
+            if (void 0 !== t.timeoutSeconds) {
+                if (isNaN(t.timeoutSeconds)) throw new U(P, `invalid long polling timeout: ${t.timeoutSeconds} (must not be NaN)`);
+                if (t.timeoutSeconds < 5) throw new U(P, `invalid long polling timeout: ${t.timeoutSeconds} (minimum allowed value is 5)`);
+                if (t.timeoutSeconds > 30) throw new U(P, `invalid long polling timeout: ${t.timeoutSeconds} (maximum allowed value is 30)`);
+            }
+        }
+        /**
  * @license
  * Copyright 2020 Google LLC
  *
@@ -4090,11 +4121,20 @@ class En {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/**
+        /**
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link (getFirestore:1)}.
- */ class In {
+ */ (this.experimentalLongPollingOptions), this.useFetchStreams = !!t.useFetchStreams;
+    }
+    isEqual(t) {
+        return this.host === t.host && this.ssl === t.ssl && this.credentials === t.credentials && this.cacheSizeBytes === t.cacheSizeBytes && this.experimentalForceLongPolling === t.experimentalForceLongPolling && this.experimentalAutoDetectLongPolling === t.experimentalAutoDetectLongPolling && (e = this.experimentalLongPollingOptions, 
+        n = t.experimentalLongPollingOptions, e.timeoutSeconds === n.timeoutSeconds) && this.ignoreUndefinedProperties === t.ignoreUndefinedProperties && this.useFetchStreams === t.useFetchStreams;
+        var e, n;
+    }
+}
+
+class Tn {
     /** @hideconstructor */
     constructor(t, e, n, r) {
         this._authCredentials = t, this._appCheckCredentials = e, this._databaseId = n, 
@@ -4102,7 +4142,7 @@ class En {
         /**
          * Whether it's a Firestore or Firestore Lite instance.
          */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new En({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new In({}), 
         this._settingsFrozen = !1;
     }
     /**
@@ -4120,7 +4160,7 @@ class En {
     }
     _setSettings(t) {
         if (this._settingsFrozen) throw new U(S, "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 En(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new In(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new Q;
             switch (t.type) {
               case "firstParty":
@@ -4158,13 +4198,13 @@ class En {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const e = vn.get(t);
-            e && (y("ComponentProvider", "Removing Datastore"), vn.delete(t), e.terminate());
+            const e = bn.get(t);
+            e && (y("ComponentProvider", "Removing Datastore"), bn.delete(t), e.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function Tn(t, e, n) {
+function An(t, e, n) {
     n || (n = "(default)");
     const r = _getProvider(t, "firestore/lite");
     if (r.isInitialized(n)) throw new U(S, "Firestore can only be initialized once per app.");
@@ -4174,13 +4214,13 @@ function Tn(t, e, n) {
     });
 }
 
-function An(e, n) {
+function Rn(e, n) {
     const r = "object" == typeof e ? e : getApp(), s = "string" == typeof e ? e : n || "(default)", i = _getProvider(r, "firestore/lite").getImmediate({
         identifier: s
     });
     if (!i._initialized) {
         const t = getDefaultEmulatorHostnameAndPort("firestore");
-        t && Rn(i, ...t);
+        t && Pn(i, ...t);
     }
     return i;
 }
@@ -4197,9 +4237,9 @@ function An(e, n) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function Rn(t, e, n, r = {}) {
+ */ function Pn(t, e, n, r = {}) {
     var s;
-    const i = (t = ct(t, In))._getSettings();
+    const i = (t = ct(t, Tn))._getSettings();
     if ("firestore.googleapis.com" !== i.host && i.host !== e && _("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, i), {
         host: `${e}:${n}`,
@@ -4237,8 +4277,8 @@ function An(e, n) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function Pn(t) {
-    return t = ct(t, In), _removeServiceInstance(t.app, "firestore/lite"), t._delete();
+ */ function Vn(t) {
+    return t = ct(t, Tn), _removeServiceInstance(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -4277,7 +4317,7 @@ function An(e, n) {
  * Represents an aggregation that can be performed by Firestore.
  */
 // eslint-disable-next-line @typescript-eslint/no-unused-vars
-class Vn {
+class $n {
     /**
      * Create a new AggregateField<T>
      * @param _aggregateType Specifies the type of aggregation operation to perform.
@@ -4295,7 +4335,7 @@ class Vn {
 
 /**
  * The results of executing an aggregation query.
- */ class $n {
+ */ class Nn {
     /** @hideconstructor */
     constructor(t, e, n) {
         this._userDataWriter = e, this._data = n, 
@@ -4365,7 +4405,7 @@ class Vn {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new Fn(this.firestore, this.converter, this._key.path.popLast());
+        return new xn(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
         return new Dn(this.firestore, t, this._key);
@@ -4375,7 +4415,7 @@ class Vn {
 /**
  * A `Query` refers to a query which you can read or listen to. You can also
  * construct refined `Query` objects by adding filters and ordering.
- */ class Nn {
+ */ class Fn {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -4388,17 +4428,17 @@ class Vn {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new Nn(this.firestore, t, this._query);
+        return new Fn(this.firestore, t, this._query);
     }
 }
 
 /**
  * A `CollectionReference` object can be used for adding documents, getting
  * document references, and querying for documents (using {@link (query:1)}).
- */ class Fn extends Nn {
+ */ class xn extends Fn {
     /** @hideconstructor */
     constructor(t, e, n) {
-        super(t, e, new be(n)), this._path = n, 
+        super(t, e, new Ee(n)), this._path = n, 
         /** The type of this Firestore reference. */
         this.type = "collection";
     }
@@ -4420,19 +4460,19 @@ class Vn {
         /* converter= */ null, new rt(t));
     }
     withConverter(t) {
-        return new Fn(this.firestore, t, this._path);
+        return new xn(this.firestore, t, this._path);
     }
 }
 
-function xn(t, e, ...n) {
-    if (t = getModularInstance(t), st("collection", "path", e), t instanceof In) {
+function Sn(t, e, ...n) {
+    if (t = getModularInstance(t), st("collection", "path", e), t instanceof Tn) {
         const r = tt.fromString(e, ...n);
-        return ot(r), new Fn(t, /* converter= */ null, r);
+        return ot(r), new xn(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof Dn || t instanceof Fn)) throw new U(P, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof Dn || t instanceof xn)) throw new U(P, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(tt.fromString(e, ...n));
-        return ot(r), new Fn(t.firestore, 
+        return ot(r), new xn(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -4449,27 +4489,27 @@ function xn(t, e, ...n) {
  * collection or subcollection with this ID as the last segment of its path
  * will be included. Cannot contain a slash.
  * @returns The created `Query`.
- */ function Sn(t, e) {
-    if (t = ct(t, In), st("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new U(P, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new Nn(t, 
+ */ function qn(t, e) {
+    if (t = ct(t, Tn), st("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new U(P, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new Fn(t, 
     /* converter= */ null, function(t) {
-        return new be(tt.emptyPath(), t);
+        return new Ee(tt.emptyPath(), t);
     }(e));
 }
 
-function qn(t, e, ...n) {
+function On(t, e, ...n) {
     if (t = getModularInstance(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = bt.D()), st("doc", "path", e), t instanceof In) {
+    1 === arguments.length && (e = Et.N()), st("doc", "path", e), t instanceof Tn) {
         const r = tt.fromString(e, ...n);
         return it(r), new Dn(t, 
         /* converter= */ null, new rt(r));
     }
     {
-        if (!(t instanceof Dn || t instanceof Fn)) throw new U(P, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof Dn || t instanceof xn)) throw new U(P, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(tt.fromString(e, ...n));
-        return it(r), new Dn(t.firestore, t instanceof Fn ? t.converter : null, new rt(r));
+        return it(r), new Dn(t.firestore, t instanceof xn ? t.converter : null, new rt(r));
     }
 }
 
@@ -4480,8 +4520,8 @@ function qn(t, e, ...n) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function On(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof Dn || t instanceof Fn) && (e instanceof Dn || e instanceof Fn) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+ */ function kn(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof Dn || t instanceof xn) && (e instanceof Dn || e instanceof xn) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -4492,8 +4532,8 @@ function qn(t, e, ...n) {
  * @param right - A `Query` to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function kn(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), t instanceof Nn && e instanceof Nn && (t.firestore === e.firestore && Ve(t._query, e._query) && t.converter === e.converter);
+ */ function Cn(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), t instanceof Fn && e instanceof Fn && (t.firestore === e.firestore && $e(t._query, e._query) && t.converter === e.converter);
 }
 
 /**
@@ -4514,7 +4554,7 @@ function qn(t, e, ...n) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class Cn {
+ */ class Mn {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -4526,7 +4566,7 @@ function qn(t, e, ...n) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new Cn(Pt.fromBase64String(t));
+            return new Mn(Vt.fromBase64String(t));
         } catch (t) {
             throw new U(P, "Failed to construct data from Base64 string: " + t);
         }
@@ -4536,7 +4576,7 @@ function qn(t, e, ...n) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new Cn(Pt.fromUint8Array(t));
+        return new Mn(Vt.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -4592,7 +4632,7 @@ function qn(t, e, ...n) {
  *
  * Create a `FieldPath` by providing field names. If more than one field
  * name is provided, the path will point to a nested field in a document.
- */ class Mn {
+ */ class Ln {
     /**
      * Creates a `FieldPath` from the provided field names. If more than one field
      * name is provided, the path will point to a nested field in a document.
@@ -4616,8 +4656,8 @@ function qn(t, e, ...n) {
 /**
  * Returns a special sentinel `FieldPath` to refer to the ID of a document.
  * It can be used in queries to sort or filter by the document ID.
- */ function Ln() {
-    return new Mn("__name__");
+ */ function Un() {
+    return new Ln("__name__");
 }
 
 /**
@@ -4639,7 +4679,7 @@ function qn(t, e, ...n) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class Un {
+ */ class jn {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -4671,7 +4711,7 @@ function qn(t, e, ...n) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ class jn {
+ */ class Bn {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -4711,7 +4751,7 @@ function qn(t, e, ...n) {
      * Actually private to JS consumers of our API, so this function is prefixed
      * with an underscore.
      */    _compareTo(t) {
-        return Et(this._lat, t._lat) || Et(this._long, t._long);
+        return It(this._lat, t._lat) || It(this._long, t._long);
     }
 }
 
@@ -4730,29 +4770,29 @@ function qn(t, e, ...n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const Bn = /^__.*__$/;
+ */ const Qn = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class Qn {
+/** The result of parsing document data (e.g. for a setData call). */ class zn {
     constructor(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return null !== this.fieldMask ? new Me(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Ce(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new Le(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Me(t, this.data, e, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class zn {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class Wn {
     constructor(t, 
     // The fieldMask does not include document transforms.
     e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return new Me(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new Le(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }
 }
 
-function Wn(t) {
+function Gn(t) {
     switch (t) {
       case 0 /* UserDataSource.Set */ :
  // fall through
@@ -4770,7 +4810,7 @@ function Wn(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class Gn {
+/** A "context" object passed around while parsing user data. */ class Kn {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -4802,7 +4842,7 @@ function Wn(t) {
         return this.settings.et;
     }
     /** Returns a new context with the specified settings overwritten. */    nt(t) {
-        return new Gn(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.serializer, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+        return new Kn(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.serializer, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
     rt(t) {
         var e;
@@ -4829,7 +4869,7 @@ function Wn(t) {
         });
     }
     ct(t) {
-        return dr(t, this.settings.methodName, this.settings.at || !1, this.path, this.settings.ht);
+        return wr(t, this.settings.methodName, this.settings.at || !1, this.path, this.settings.ht);
     }
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */    contains(t) {
         return void 0 !== this.fieldMask.find((e => t.isPrefixOf(e))) || void 0 !== this.fieldTransforms.find((e => t.isPrefixOf(e.field)));
@@ -4841,19 +4881,19 @@ function Wn(t) {
     }
     it(t) {
         if (0 === t.length) throw this.ct("Document fields must not be empty");
-        if (Wn(this.et) && Bn.test(t)) throw this.ct('Document fields cannot begin and end with "__"');
+        if (Gn(this.et) && Qn.test(t)) throw this.ct('Document fields cannot begin and end with "__"');
     }
 }
 
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ class Kn {
+ */ class Yn {
     constructor(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.serializer = n || dn(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.serializer = n || wn(t);
     }
     /** Creates a new top-level parse context. */    lt(t, e, n, r = !1) {
-        return new Gn({
+        return new Kn({
             et: t,
             methodName: e,
             ht: n,
@@ -4864,29 +4904,29 @@ function Wn(t) {
     }
 }
 
-function Yn(t) {
-    const e = t._freezeSettings(), n = dn(t._databaseId);
-    return new Kn(t._databaseId, !!e.ignoreUndefinedProperties, n);
+function Hn(t) {
+    const e = t._freezeSettings(), n = wn(t._databaseId);
+    return new Yn(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function Hn(t, e, n, r, s, i = {}) {
+/** Parse document data from a set() call. */ function Jn(t, e, n, r, s, i = {}) {
     const o = t.lt(i.merge || i.mergeFields ? 2 /* UserDataSource.MergeSet */ : 0 /* UserDataSource.Set */ , e, n, s);
-    ar("Data must be an object, but it was:", o, r);
-    const u = ur(r, o);
+    hr("Data must be an object, but it was:", o, r);
+    const u = cr(r, o);
     let c, a;
-    if (i.merge) c = new pe(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
+    if (i.merge) c = new ye(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
         const t = [];
         for (const r of i.mergeFields) {
-            const s = hr(e, r, n);
+            const s = lr(e, r, n);
             if (!o.contains(s)) throw new U(P, `Field '${s}' is specified in your field mask but missing from your input data.`);
-            wr(t, s) || t.push(s);
+            mr(t, s) || t.push(s);
         }
-        c = new pe(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
+        c = new ye(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
     } else c = null, a = o.fieldTransforms;
-    return new Qn(new ye(u), c, a);
+    return new zn(new ge(u), c, a);
 }
 
-class Jn extends Un {
+class Xn extends jn {
     _toFieldTransform(t) {
         if (2 /* UserDataSource.MergeSet */ !== t.et) throw 1 /* UserDataSource.Update */ === t.et ? t.ct(`${this._methodName}() can only appear at the top level of your update data`) : t.ct(`${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
@@ -4894,7 +4934,7 @@ class Jn extends Un {
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof Jn;
+        return t instanceof Xn;
     }
 }
 
@@ -4913,8 +4953,8 @@ class Jn extends Un {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function Xn(t, e, n) {
-    return new Gn({
+ */ function Zn(t, e, n) {
+    return new Kn({
         et: 3 /* UserDataSource.Argument */ ,
         ht: e.settings.ht,
         methodName: t._methodName,
@@ -4922,23 +4962,23 @@ class Jn extends Un {
     }, e.databaseId, e.serializer, e.ignoreUndefinedProperties);
 }
 
-class Zn extends Un {
+class tr extends jn {
     _toFieldTransform(t) {
-        return new qe(t.path, new Ne);
+        return new Oe(t.path, new Fe);
     }
     isEqual(t) {
-        return t instanceof Zn;
+        return t instanceof tr;
     }
 }
 
-class tr extends Un {
+class er extends jn {
     constructor(t, e) {
         super(t), this.ft = e;
     }
     _toFieldTransform(t) {
-        const e = Xn(this, t, 
-        /*array=*/ !0), n = this.ft.map((t => or(t, e))), r = new Fe(n);
-        return new qe(t.path, r);
+        const e = Zn(this, t, 
+        /*array=*/ !0), n = this.ft.map((t => ur(t, e))), r = new xe(n);
+        return new Oe(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4946,14 +4986,14 @@ class tr extends Un {
     }
 }
 
-class er extends Un {
+class nr extends jn {
     constructor(t, e) {
         super(t), this.ft = e;
     }
     _toFieldTransform(t) {
-        const e = Xn(this, t, 
-        /*array=*/ !0), n = this.ft.map((t => or(t, e))), r = new xe(n);
-        return new qe(t.path, r);
+        const e = Zn(this, t, 
+        /*array=*/ !0), n = this.ft.map((t => ur(t, e))), r = new Se(n);
+        return new Oe(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4961,13 +5001,13 @@ class er extends Un {
     }
 }
 
-class nr extends Un {
+class rr extends jn {
     constructor(t, e) {
         super(t), this.dt = e;
     }
     _toFieldTransform(t) {
-        const e = new Se(t.serializer, $e(t.serializer, this.dt));
-        return new qe(t.path, e);
+        const e = new qe(t.serializer, Ne(t.serializer, this.dt));
+        return new Oe(t.path, e);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4975,50 +5015,50 @@ class nr extends Un {
     }
 }
 
-/** Parse update data from an update() call. */ function rr(t, e, n, r) {
+/** Parse update data from an update() call. */ function sr(t, e, n, r) {
     const s = t.lt(1 /* UserDataSource.Update */ , e, n);
-    ar("Data must be an object, but it was:", s, r);
-    const i = [], o = ye.empty();
-    At(r, ((t, r) => {
-        const u = fr(e, t, n);
+    hr("Data must be an object, but it was:", s, r);
+    const i = [], o = ge.empty();
+    Rt(r, ((t, r) => {
+        const u = dr(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = getModularInstance(r);
         const c = s.ot(u);
-        if (r instanceof Jn) 
+        if (r instanceof Xn) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = or(r, c);
+            const t = ur(r, c);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
-    const u = new pe(i);
-    return new zn(o, u, s.fieldTransforms);
+    const u = new ye(i);
+    return new Wn(o, u, s.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function sr(t, e, n, r, s, i) {
-    const o = t.lt(1 /* UserDataSource.Update */ , e, n), u = [ hr(e, r, n) ], c = [ s ];
+/** Parse update data from a list of field/value arguments. */ function ir(t, e, n, r, s, i) {
+    const o = t.lt(1 /* UserDataSource.Update */ , e, n), u = [ lr(e, r, n) ], c = [ s ];
     if (i.length % 2 != 0) throw new U(P, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
-    for (let t = 0; t < i.length; t += 2) u.push(hr(e, i[t])), c.push(i[t + 1]);
-    const a = [], h = ye.empty();
+    for (let t = 0; t < i.length; t += 2) u.push(lr(e, i[t])), c.push(i[t + 1]);
+    const a = [], h = ge.empty();
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
-    for (let t = u.length - 1; t >= 0; --t) if (!wr(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!mr(a, u[t])) {
         const e = u[t];
         let n = c[t];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 n = getModularInstance(n);
         const r = o.ot(e);
-        if (n instanceof Jn) 
+        if (n instanceof Xn) 
         // Add it to the field mask, but don't add anything to updateData.
         a.push(e); else {
-            const t = or(n, r);
+            const t = ur(n, r);
             null != t && (a.push(e), h.set(e, t));
         }
     }
-    const f = new pe(a);
-    return new zn(h, f, o.fieldTransforms);
+    const f = new ye(a);
+    return new Wn(h, f, o.fieldTransforms);
 }
 
 /**
@@ -5027,8 +5067,8 @@ class nr extends Un {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function ir(t, e, n, r = !1) {
-    return or(n, t.lt(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
+ */ function or(t, e, n, r = !1) {
+    return ur(n, t.lt(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
 }
 
 /**
@@ -5039,12 +5079,12 @@ class nr extends Un {
  * the source of the data being parsed, etc.
  * @returns The parsed value, or null if the value was a FieldValue sentinel
  * that should not be included in the resulting parsed data.
- */ function or(t, e) {
-    if (cr(
+ */ function ur(t, e) {
+    if (ar(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = getModularInstance(t))) return ar("Unsupported field value:", e, t), ur(t, e);
-    if (t instanceof Un) 
+    t = getModularInstance(t))) return hr("Unsupported field value:", e, t), cr(t, e);
+    if (t instanceof jn) 
     // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
     // (as doing so will overwrite the field directly prior to the transform
@@ -5056,7 +5096,7 @@ class nr extends Un {
  */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Wn(e.et)) throw e.ct(`${t._methodName}() can only be used with update() and set()`);
+        if (!Gn(e.et)) throw e.ct(`${t._methodName}() can only be used with update() and set()`);
         if (!e.path) throw e.ct(`${t._methodName}() is not currently supported inside arrays`);
         const n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
@@ -5086,7 +5126,7 @@ class nr extends Un {
             const n = [];
             let r = 0;
             for (const s of t) {
-                let t = or(s, e.ut(r));
+                let t = ur(s, e.ut(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -5105,7 +5145,7 @@ class nr extends Un {
         if (null === (t = getModularInstance(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return $e(e.serializer, t);
+        if ("number" == typeof t) return Ne(e.serializer, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -5113,34 +5153,34 @@ class nr extends Un {
             stringValue: t
         };
         if (t instanceof Date) {
-            const n = Ft.fromDate(t);
+            const n = xt.fromDate(t);
             return {
-                timestampValue: We(e.serializer, n)
+                timestampValue: Ge(e.serializer, n)
             };
         }
-        if (t instanceof Ft) {
+        if (t instanceof xt) {
             // Firestore backend truncates precision down to microseconds. To ensure
             // offline mode works the same with regards to truncation, perform the
             // truncation immediately without waiting for the backend to do that.
-            const n = new Ft(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            const n = new xt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: We(e.serializer, n)
+                timestampValue: Ge(e.serializer, n)
             };
         }
-        if (t instanceof jn) return {
+        if (t instanceof Bn) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof Cn) return {
-            bytesValue: Ge(e.serializer, t._byteString)
+        if (t instanceof Mn) return {
+            bytesValue: Ke(e.serializer, t._byteString)
         };
         if (t instanceof Dn) {
             const n = e.databaseId, r = t.firestore._databaseId;
             if (!r.isEqual(n)) throw e.ct(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${n.projectId}/${n.database}`);
             return {
-                referenceValue: He(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: Je(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
         throw e.ct(`Unsupported field value: ${ut(t)}`);
@@ -5154,13 +5194,13 @@ class nr extends Un {
  */ (t, e);
 }
 
-function ur(t, e) {
+function cr(t, e) {
     const n = {};
     return !function(t) {
         for (const e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
         return !0;
-    }(t) ? At(t, ((t, r) => {
-        const s = or(r, e.rt(t));
+    }(t) ? Rt(t, ((t, r) => {
+        const s = ur(r, e.rt(t));
         null != s && (n[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -5172,12 +5212,12 @@ function ur(t, e) {
     };
 }
 
-function cr(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof Ft || t instanceof jn || t instanceof Cn || t instanceof Dn || t instanceof Un);
+function ar(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof xt || t instanceof Bn || t instanceof Mn || t instanceof Dn || t instanceof jn);
 }
 
-function ar(t, e, n) {
-    if (!cr(n) || !function(t) {
+function hr(t, e, n) {
+    if (!ar(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         const r = ut(n);
@@ -5187,20 +5227,20 @@ function ar(t, e, n) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function hr(t, e, n) {
+ */ function lr(t, e, n) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    e = getModularInstance(e)) instanceof Mn) return e._internalPath;
-    if ("string" == typeof e) return fr(t, e);
-    throw dr("Field path arguments must be of type string or ", t, 
+    e = getModularInstance(e)) instanceof Ln) return e._internalPath;
+    if ("string" == typeof e) return dr(t, e);
+    throw wr("Field path arguments must be of type string or ", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
 }
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ const lr = new RegExp("[~\\*/\\[\\]]");
+ */ const fr = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -5210,20 +5250,20 @@ function ar(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function fr(t, e, n) {
-    if (e.search(lr) >= 0) throw dr(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function dr(t, e, n) {
+    if (e.search(fr) >= 0) throw wr(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return new Mn(...e.split("."))._internalPath;
+        return new Ln(...e.split("."))._internalPath;
     } catch (r) {
-        throw dr(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw wr(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function dr(t, e, n, r, s) {
+function wr(t, e, n, r, s) {
     const i = r && !r.isEmpty(), o = void 0 !== s;
     let u = `Function ${e}() called with invalid data`;
     n && (u += " (via `toFirestore()`)"), u += ". ";
@@ -5232,7 +5272,7 @@ function dr(t, e, n, r, s) {
     c += ")"), new U(P, u + t + c);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function wr(t, e) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function mr(t, e) {
     return t.some((t => t.isEqual(e)));
 }
 
@@ -5260,7 +5300,7 @@ function dr(t, e, n, r, s) {
  * 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.
- */ class mr {
+ */ class pr {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -5296,7 +5336,7 @@ function dr(t, e, n, r, s) {
             if (this._converter) {
                 // We only want to use the converter and create a new DocumentSnapshot
                 // if a converter has been provided.
-                const t = new pr(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new yr(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -5316,7 +5356,7 @@ function dr(t, e, n, r, s) {
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     get(t) {
         if (this._document) {
-            const e = this._document.data.field(_r("DocumentSnapshot.get", t));
+            const e = this._document.data.field(vr("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }
@@ -5332,7 +5372,7 @@ function dr(t, e, n, r, s) {
  * `DocumentSnapshot`. Since query results contain only existing documents, the
  * `exists` property will always be true and `data()` will never return
  * 'undefined'.
- */ class pr extends mr {
+ */ class yr extends pr {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -5350,7 +5390,7 @@ function dr(t, e, n, r, s) {
  * array via the `docs` property or enumerated using the `forEach` method. The
  * number of documents can be determined via the `empty` and `size`
  * properties.
- */ class yr {
+ */ class gr {
     /** @hideconstructor */
     constructor(t, e) {
         this._docs = e, this.query = t;
@@ -5381,14 +5421,14 @@ function dr(t, e, n, r, s) {
  * @param left - A snapshot to compare.
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
- */ function gr(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), t instanceof mr && e instanceof mr ? 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 yr && e instanceof yr && (kn(t.query, e.query) && It(t.docs, e.docs, gr));
+ */ function _r(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), t instanceof pr && e instanceof pr ? 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 gr && e instanceof gr && (Cn(t.query, e.query) && Tt(t.docs, e.docs, _r));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function _r(t, e) {
-    return "string" == typeof e ? fr(t, e) : e instanceof Mn ? e._internalPath : e._delegate._internalPath;
+ */ function vr(t, e) {
+    return "string" == typeof e ? dr(t, e) : e instanceof Ln ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -5411,7 +5451,7 @@ function dr(t, e, n, r, s) {
  * An `AppliableConstraint` is an abstraction of a constraint that can be applied
  * to a Firestore query.
  */
-class vr {}
+class br {}
 
 /**
  * A `QueryConstraint` is used to narrow the set of documents returned by a
@@ -5420,12 +5460,12 @@ class vr {}
  * (endBefore:1)}, {@link (endAt:1)}, {@link limit}, {@link limitToLast} and
  * can then be passed to {@link (query:1)} to create a new query instance that
  * also contains this `QueryConstraint`.
- */ class br extends vr {}
+ */ class Er extends br {}
 
-function Er(t, e, ...n) {
+function Ir(t, e, ...n) {
     let r = [];
-    e instanceof vr && r.push(e), r = r.concat(n), function(t) {
-        const e = t.filter((t => t instanceof Ar)).length, n = t.filter((t => t instanceof Ir)).length;
+    e instanceof br && r.push(e), r = r.concat(n), function(t) {
+        const e = t.filter((t => t instanceof Rr)).length, n = t.filter((t => t instanceof Tr)).length;
         if (e > 1 || e > 0 && n > 0) throw new U(P, "InvalidQuery. When using composite filters, you cannot use more than one filter at the top level. Consider nesting the multiple filters within an `and(...)` statement. For example: change `query(query, where(...), or(...))` to `query(query, and(where(...), or(...)))`.");
     }
     /**
@@ -5460,7 +5500,7 @@ function Er(t, e, ...n) {
  * `QueryFieldFilterConstraint`s are created by invoking {@link where} and can then
  * be passed to {@link (query:1)} to create a new query instance that also contains
  * this `QueryFieldFilterConstraint`.
- */ class Ir extends br {
+ */ class Tr extends Er {
     /**
      * @internal
      */
@@ -5470,31 +5510,31 @@ function Er(t, e, ...n) {
         this.type = "where";
     }
     static _create(t, e, n) {
-        return new Ir(t, e, n);
+        return new Tr(t, e, n);
     }
     _apply(t) {
         const e = this._parse(t);
-        return jr(t._query, e), new Nn(t.firestore, t.converter, Pe(t._query, e));
+        return Br(t._query, e), new Fn(t.firestore, t.converter, Ve(t._query, e));
     }
     _parse(t) {
-        const e = Yn(t.firestore), n = function(t, e, n, r, s, i, o) {
+        const e = Hn(t.firestore), n = function(t, e, n, r, s, i, o) {
             let u;
             if (s.isKeyField()) {
                 if ("array-contains" /* Operator.ARRAY_CONTAINS */ === i || "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === i) throw new U(P, `Invalid Query. You can't perform '${i}' queries on documentId().`);
                 if ("in" /* Operator.IN */ === i || "not-in" /* Operator.NOT_IN */ === i) {
-                    Ur(o, i);
+                    jr(o, i);
                     const e = [];
-                    for (const n of o) e.push(Lr(r, t, n));
+                    for (const n of o) e.push(Ur(r, t, n));
                     u = {
                         arrayValue: {
                             values: e
                         }
                     };
-                } else u = Lr(r, t, o);
-            } else "in" /* Operator.IN */ !== i && "not-in" /* Operator.NOT_IN */ !== i && "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ !== i || Ur(o, i), 
-            u = ir(n, e, o, 
+                } else u = Ur(r, t, o);
+            } else "in" /* Operator.IN */ !== i && "not-in" /* Operator.NOT_IN */ !== i && "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ !== i || jr(o, i), 
+            u = or(n, e, o, 
             /* allowArrays= */ "in" /* Operator.IN */ === i || "not-in" /* Operator.NOT_IN */ === i);
-            return Jt.create(s, i, u);
+            return Xt.create(s, i, u);
         }(t._query, "where", e, t.firestore._databaseId, this._field, this._op, this._value);
         return n;
     }
@@ -5510,9 +5550,9 @@ function Er(t, e, ...n) {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link QueryFieldFilterConstraint}.
- */ function Tr(t, e, n) {
-    const r = e, s = _r("where", t);
-    return Ir._create(s, r, n);
+ */ function Ar(t, e, n) {
+    const r = e, s = vr("where", t);
+    return Tr._create(s, r, n);
 }
 
 /**
@@ -5522,7 +5562,7 @@ function Er(t, e, ...n) {
  * `QueryCompositeFilterConstraint`s are created by invoking {@link or} or
  * {@link and} and can then be passed to {@link (query:1)} to create a new query
  * instance that also contains the `QueryCompositeFilterConstraint`.
- */ class Ar extends vr {
+ */ class Rr extends br {
     /**
      * @internal
      */
@@ -5532,22 +5572,22 @@ function Er(t, e, ...n) {
         super(), this.type = t, this._queryConstraints = e;
     }
     static _create(t, e) {
-        return new Ar(t, e);
+        return new Rr(t, e);
     }
     _parse(t) {
         const e = this._queryConstraints.map((e => e._parse(t))).filter((t => t.getFilters().length > 0));
-        return 1 === e.length ? e[0] : Xt.create(e, this._getOperator());
+        return 1 === e.length ? e[0] : Zt.create(e, this._getOperator());
     }
     _apply(t) {
         const e = this._parse(t);
         return 0 === e.getFilters().length ? t : (function(t, e) {
             let n = t;
             const r = e.getFlattenedFilters();
-            for (const t of r) jr(n, t), n = Pe(n, t);
+            for (const t of r) Br(n, t), n = Ve(n, t);
         }
         // Checks if any of the provided filter operators are included in the given list of filters and
         // returns the first one that is, or null if none are.
-        (t._query, e), new Nn(t.firestore, t.converter, Pe(t._query, e)));
+        (t._query, e), new Fn(t.firestore, t.converter, Ve(t._query, e)));
     }
     _getQueryConstraints() {
         return this._queryConstraints;
@@ -5566,9 +5606,9 @@ function Er(t, e, ...n) {
  * {@link QueryFilterConstraint}s to perform a disjunction for. These must be
  * created with calls to {@link where}, {@link or}, or {@link and}.
  * @returns The newly created {@link QueryCompositeFilterConstraint}.
- */ function Rr(...t) {
+ */ function Pr(...t) {
     // Only support QueryFilterConstraints
-    return t.forEach((t => Qr("or", t))), Ar._create("or" /* CompositeOperator.OR */ , t);
+    return t.forEach((t => zr("or", t))), Rr._create("or" /* CompositeOperator.OR */ , t);
 }
 
 /**
@@ -5580,9 +5620,9 @@ function Er(t, e, ...n) {
  * {@link QueryFilterConstraint}s to perform a conjunction for. These must be
  * created with calls to {@link where}, {@link or}, or {@link and}.
  * @returns The newly created {@link QueryCompositeFilterConstraint}.
- */ function Pr(...t) {
+ */ function Vr(...t) {
     // Only support QueryFilterConstraints
-    return t.forEach((t => Qr("and", t))), Ar._create("and" /* CompositeOperator.AND */ , t);
+    return t.forEach((t => zr("and", t))), Rr._create("and" /* CompositeOperator.AND */ , t);
 }
 
 /**
@@ -5593,7 +5633,7 @@ function Er(t, e, ...n) {
  *
  * Note: Documents that do not contain the orderBy field will not be present in
  * the query result.
- */ class Vr extends br {
+ */ class $r extends Er {
     /**
      * @internal
      */
@@ -5603,18 +5643,18 @@ function Er(t, e, ...n) {
         this.type = "orderBy";
     }
     static _create(t, e) {
-        return new Vr(t, e);
+        return new $r(t, e);
     }
     _apply(t) {
         const e = function(t, e, n) {
             if (null !== t.startAt) throw new U(P, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
             if (null !== t.endAt) throw new U(P, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            const r = new ce(e, n);
+            const r = new ae(e, n);
             return function(t, e) {
-                if (null === Ee(t)) {
+                if (null === Ie(t)) {
                     // This is the first order by. It must match any inequality.
-                    const n = Ie(t);
-                    null !== n && Br(t, n, e.field);
+                    const n = Te(t);
+                    null !== n && Qr(t, n, e.field);
                 }
             }(t, r), r;
         }
@@ -5629,10 +5669,10 @@ function Er(t, e, ...n) {
  * of the query or if any of the fields in the order by are an uncommitted
  * server timestamp.
  */ (t._query, this._field, this._direction);
-        return new Nn(t.firestore, t.converter, function(t, e) {
+        return new Fn(t.firestore, t.converter, function(t, e) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             const n = t.explicitOrderBy.concat([ e ]);
-            return new be(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new Ee(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }
 }
@@ -5648,9 +5688,9 @@ function Er(t, e, ...n) {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link QueryOrderByConstraint}.
- */ function $r(t, e = "asc") {
-    const n = e, r = _r("orderBy", t);
-    return Vr._create(r, n);
+ */ function Nr(t, e = "asc") {
+    const n = e, r = vr("orderBy", t);
+    return $r._create(r, n);
 }
 
 /**
@@ -5659,7 +5699,7 @@ function Er(t, e, ...n) {
  * `QueryLimitConstraint`s are created by invoking {@link limit} or
  * {@link limitToLast} and can then be passed to {@link (query:1)} to create a new
  * query instance that also contains this `QueryLimitConstraint`.
- */ class Dr extends br {
+ */ class Dr extends Er {
     /**
      * @internal
      */
@@ -5672,8 +5712,8 @@ function Er(t, e, ...n) {
         return new Dr(t, e, n);
     }
     _apply(t) {
-        return new Nn(t.firestore, t.converter, function(t, e, n) {
-            return new be(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        return new Fn(t.firestore, t.converter, function(t, e, n) {
+            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
         }(t._query, this._limit, this._limitType));
     }
 }
@@ -5684,7 +5724,7 @@ function Er(t, e, ...n) {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link QueryLimitConstraint}.
- */ function Nr(t) {
+ */ function Fr(t) {
     return at("limit", t), Dr._create("limit", t, "F" /* LimitType.First */);
 }
 
@@ -5697,7 +5737,7 @@ function Er(t, e, ...n) {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link QueryLimitConstraint}.
- */ function Fr(t) {
+ */ function xr(t) {
     return at("limitToLast", t), Dr._create("limitToLast", t, "L" /* LimitType.Last */);
 }
 
@@ -5707,7 +5747,7 @@ function Er(t, e, ...n) {
  * `QueryStartAtConstraint`s are created by invoking {@link (startAt:1)} or
  * {@link (startAfter:1)} and can then be passed to {@link (query:1)} to create a
  * new query instance that also contains this `QueryStartAtConstraint`.
- */ class xr extends br {
+ */ class Sr extends Er {
     /**
      * @internal
      */
@@ -5717,23 +5757,23 @@ function Er(t, e, ...n) {
         super(), this.type = t, this._docOrFields = e, this._inclusive = n;
     }
     static _create(t, e, n) {
-        return new xr(t, e, n);
+        return new Sr(t, e, n);
     }
     _apply(t) {
-        const e = Mr(t, this.type, this._docOrFields, this._inclusive);
-        return new Nn(t.firestore, t.converter, function(t, e) {
-            return new be(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+        const e = Lr(t, this.type, this._docOrFields, this._inclusive);
+        return new Fn(t.firestore, t.converter, function(t, e) {
+            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
 }
 
-function Sr(...t) {
-    return xr._create("startAt", t, 
+function qr(...t) {
+    return Sr._create("startAt", t, 
     /*inclusive=*/ !0);
 }
 
-function qr(...t) {
-    return xr._create("startAfter", t, 
+function Or(...t) {
+    return Sr._create("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
@@ -5743,7 +5783,7 @@ function qr(...t) {
  * `QueryEndAtConstraint`s are created by invoking {@link (endAt:1)} or
  * {@link (endBefore:1)} and can then be passed to {@link (query:1)} to create a new
  * query instance that also contains this `QueryEndAtConstraint`.
- */ class Or extends br {
+ */ class kr extends Er {
     /**
      * @internal
      */
@@ -5753,28 +5793,28 @@ function qr(...t) {
         super(), this.type = t, this._docOrFields = e, this._inclusive = n;
     }
     static _create(t, e, n) {
-        return new Or(t, e, n);
+        return new kr(t, e, n);
     }
     _apply(t) {
-        const e = Mr(t, this.type, this._docOrFields, this._inclusive);
-        return new Nn(t.firestore, t.converter, function(t, e) {
-            return new be(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+        const e = Lr(t, this.type, this._docOrFields, this._inclusive);
+        return new Fn(t.firestore, t.converter, function(t, e) {
+            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
 }
 
-function kr(...t) {
-    return Or._create("endBefore", t, 
+function Cr(...t) {
+    return kr._create("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function Cr(...t) {
-    return Or._create("endAt", t, 
+function Mr(...t) {
+    return kr._create("endAt", t, 
     /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function Mr(t, e, n, r) {
-    if (n[0] = getModularInstance(n[0]), n[0] instanceof mr) return function(t, e, n, r, s) {
+/** Helper function to create a bound from a document or fields */ function Lr(t, e, n, r) {
+    if (n[0] = getModularInstance(n[0]), n[0] instanceof pr) return function(t, e, n, r, s) {
         if (!r) throw new U($, `Can't use a DocumentSnapshot that doesn't exist for ${n}().`);
         const i = [];
         // Because people expect to continue/end a query at the exact document
@@ -5784,22 +5824,22 @@ function Cr(...t) {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-                for (const n of Ae(t)) if (n.field.isKeyField()) i.push(jt(e, r.key)); else {
+                for (const n of Re(t)) if (n.field.isKeyField()) i.push(Bt(e, r.key)); else {
             const t = r.data.field(n.field);
-            if (xt(t)) throw new U(P, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+            if (St(t)) throw new U(P, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
             if (null === t) {
                 const t = n.field.canonicalString();
                 throw new U(P, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
             }
             i.push(t);
         }
-        return new Kt(i, s);
+        return new Yt(i, s);
     }
     /**
  * Converts a list of field values to a `Bound` for the given query.
  */ (t._query, t.firestore._databaseId, e, n[0]._document, r);
     {
-        const s = Yn(t.firestore);
+        const s = Hn(t.firestore);
         return function(t, e, n, r, s, i) {
             // Use explicit order by's because it has to match the query the user made
             const o = t.explicitOrderBy;
@@ -5809,17 +5849,17 @@ function Cr(...t) {
                 const c = s[i];
                 if (o[i].field.isKeyField()) {
                     if ("string" != typeof c) throw new U(P, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
-                    if (!Te(t) && -1 !== c.indexOf("/")) throw new U(P, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
+                    if (!Ae(t) && -1 !== c.indexOf("/")) throw new U(P, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
                     const n = t.path.child(tt.fromString(c));
                     if (!rt.isDocumentKey(n)) throw new U(P, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
                     const s = new rt(n);
-                    u.push(jt(e, s));
+                    u.push(Bt(e, s));
                 } else {
-                    const t = ir(n, r, c);
+                    const t = or(n, r, c);
                     u.push(t);
                 }
             }
-            return new Kt(u, i);
+            return new Yt(u, i);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -5829,22 +5869,22 @@ function Cr(...t) {
     }
 }
 
-function Lr(t, e, n) {
+function Ur(t, e, n) {
     if ("string" == typeof (n = getModularInstance(n))) {
         if ("" === n) throw new U(P, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!Te(e) && -1 !== n.indexOf("/")) throw new U(P, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
+        if (!Ae(e) && -1 !== n.indexOf("/")) throw new U(P, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
         const r = e.path.child(tt.fromString(n));
         if (!rt.isDocumentKey(r)) throw new U(P, `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 jt(t, new rt(r));
+        return Bt(t, new rt(r));
     }
-    if (n instanceof Dn) return jt(t, n._key);
+    if (n instanceof Dn) return Bt(t, n._key);
     throw new U(P, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${ut(n)}.`);
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function Ur(t, e) {
+ */ function jr(t, e) {
     if (!Array.isArray(t) || 0 === t.length) throw new U(P, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);
 }
 
@@ -5857,12 +5897,12 @@ function Lr(t, e, n) {
  * Operators in a query must adhere to the following set of rules:
  * 1. Only one inequality per query.
  * 2. `NOT_IN` cannot be used with array, disjunctive, or `NOT_EQUAL` operators.
- */ function jr(t, e) {
+ */ function Br(t, e) {
     if (e.isInequality()) {
-        const n = Ie(t), r = e.field;
+        const n = Te(t), r = e.field;
         if (null !== n && !n.isEqual(r)) throw new U(P, `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 '${r.toString()}'`);
-        const s = Ee(t);
-        null !== s && Br(t, r, s);
+        const s = Ie(t);
+        null !== s && Qr(t, r, s);
     }
     const n = function(t, e) {
         for (const n of t) for (const t of n.getFlattenedFilters()) if (e.indexOf(t.op) >= 0) return t.op;
@@ -5888,12 +5928,12 @@ function Lr(t, e, n) {
     throw n === e.op ? new U(P, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new U(P, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
 }
 
-function Br(t, e, n) {
+function Qr(t, e, n) {
     if (!n.isEqual(e)) throw new U(P, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${e.toString()}' and so you must also use '${e.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${n.toString()}' instead.`);
 }
 
-function Qr(t, e) {
-    if (!(e instanceof Ir || e instanceof Ar)) throw new U(P, `Function ${t}() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'.`);
+function zr(t, e) {
+    if (!(e instanceof Tr || e instanceof Rr)) throw new U(P, `Function ${t}() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'.`);
 }
 
 /**
@@ -5921,7 +5961,7 @@ function Qr(t, e) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function zr(t, e, n) {
+function Wr(t, e, n) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -5930,9 +5970,9 @@ function zr(t, e, n) {
     r;
 }
 
-class Wr extends class {
+class Gr extends class {
     convertValue(t, e = "none") {
-        switch (kt(t)) {
+        switch (Ct(t)) {
           case 0 /* TypeOrder.NullValue */ :
             return null;
 
@@ -5952,7 +5992,7 @@ class Wr extends class {
             return t.stringValue;
 
           case 6 /* TypeOrder.BlobValue */ :
-            return this.convertBytes(Nt(t.bytesValue));
+            return this.convertBytes(Ft(t.bytesValue));
 
           case 7 /* TypeOrder.RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -5977,12 +6017,12 @@ class Wr extends class {
      * @internal
      */    convertObjectMap(t, e = "none") {
         const n = {};
-        return At(t, ((t, r) => {
+        return Rt(t, ((t, r) => {
             n[t] = this.convertValue(r, e);
         })), n;
     }
     convertGeoPoint(t) {
-        return new jn(Dt(t.latitude), Dt(t.longitude));
+        return new Bn(Dt(t.latitude), Dt(t.longitude));
     }
     convertArray(t, e) {
         return (t.values || []).map((t => this.convertValue(t, e)));
@@ -5990,23 +6030,23 @@ class Wr extends class {
     convertServerTimestamp(t, e) {
         switch (e) {
           case "previous":
-            const n = St(t);
+            const n = qt(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(qt(t));
+            return this.convertTimestamp(Ot(t));
 
           default:
             return null;
         }
     }
     convertTimestamp(t) {
-        const e = $t(t);
-        return new Ft(e.seconds, e.nanos);
+        const e = Nt(t);
+        return new xt(e.seconds, e.nanos);
     }
     convertDocumentKey(t, e) {
         const n = tt.fromString(t);
-        E(fn(n));
+        E(dn(n));
         const r = new X(n.get(1), n.get(3)), s = new rt(n.popFirst(5));
         return r.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
@@ -6018,7 +6058,7 @@ class Wr extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new Cn(t);
+        return new Mn(t);
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
@@ -6038,12 +6078,12 @@ class Wr extends class {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function Gr(t) {
-    const e = bn((t = ct(t, Dn)).firestore), n = new Wr(t.firestore);
-    return yn(e, [ t._key ]).then((e => {
+ */ function Kr(t) {
+    const e = En((t = ct(t, Dn)).firestore), n = new Gr(t.firestore);
+    return gn(e, [ t._key ]).then((e => {
         E(1 === e.length);
         const r = e[0];
-        return new mr(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new pr(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -6058,33 +6098,33 @@ class Wr extends class {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function Kr(t) {
+ */ function Yr(t) {
     !function(t) {
         if ("L" /* LimitType.Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new U(k, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = ct(t, Nn))._query);
-    const e = bn(t.firestore), n = new Wr(t.firestore);
-    return gn(e, t._query).then((e => {
-        const r = e.map((e => new pr(t.firestore, n, e.key, e, t.converter)));
+    }((t = ct(t, Fn))._query);
+    const e = En(t.firestore), n = new Gr(t.firestore);
+    return _n(e, t._query).then((e => {
+        const r = e.map((e => new yr(t.firestore, n, e.key, e, t.converter)));
         return "L" /* LimitType.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 yr(t, r);
+        r.reverse(), new gr(t, r);
     }));
 }
 
-function Yr(t, e, n) {
-    const r = zr((t = ct(t, Dn)).converter, e, n), s = Hn(Yn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return pn(bn(t.firestore), [ s.toMutation(t._key, Oe.none()) ]);
+function Hr(t, e, n) {
+    const r = Wr((t = ct(t, Dn)).converter, e, n), s = Jn(Hn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return yn(En(t.firestore), [ s.toMutation(t._key, ke.none()) ]);
 }
 
-function Hr(t, e, n, ...r) {
-    const s = Yn((t = ct(t, Dn)).firestore);
+function Jr(t, e, n, ...r) {
+    const s = Hn((t = ct(t, Dn)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    i = "string" == typeof (e = getModularInstance(e)) || e instanceof Mn ? sr(s, "updateDoc", t._key, e, n, r) : rr(s, "updateDoc", t._key, e);
-    return pn(bn(t.firestore), [ i.toMutation(t._key, Oe.exists(!0)) ]);
+    i = "string" == typeof (e = getModularInstance(e)) || e instanceof Ln ? ir(s, "updateDoc", t._key, e, n, r) : sr(s, "updateDoc", t._key, e);
+    return yn(En(t.firestore), [ i.toMutation(t._key, ke.exists(!0)) ]);
 }
 
 /**
@@ -6098,8 +6138,8 @@ function Hr(t, e, n, ...r) {
  * @param reference - A reference to the document to delete.
  * @returns A `Promise` resolved once the document has been successfully
  * deleted from the backend.
- */ function Jr(t) {
-    return pn(bn((t = ct(t, Dn)).firestore), [ new Le(t._key, Oe.none()) ]);
+ */ function Xr(t) {
+    return yn(En((t = ct(t, Dn)).firestore), [ new Ue(t._key, ke.none()) ]);
 }
 
 /**
@@ -6116,9 +6156,9 @@ function Hr(t, e, n, ...r) {
  * @throws Error - If the provided input is not a valid Firestore document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function Xr(t, e) {
-    const n = qn(t = ct(t, Fn)), r = zr(t.converter, e), s = Hn(Yn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return pn(bn(t.firestore), [ s.toMutation(n._key, Oe.exists(!1)) ]).then((() => n));
+ */ function Zr(t, e) {
+    const n = On(t = ct(t, xn)), r = Wr(t.converter, e), s = Jn(Hn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return yn(En(t.firestore), [ s.toMutation(n._key, ke.exists(!1)) ]).then((() => n));
 }
 
 /**
@@ -6150,9 +6190,9 @@ function Hr(t, e, n, ...r) {
  * @returns A Promise that will be resolved with the count; the count can be
  * retrieved from `snapshot.data().count`, where `snapshot` is the
  * `AggregateQuerySnapshot` to which the returned Promise resolves.
- */ function Zr(t) {
-    return ts(t, {
-        count: rs()
+ */ function ts(t) {
+    return es(t, {
+        count: ss()
     });
 }
 
@@ -6182,16 +6222,16 @@ function Hr(t, e, n, ...r) {
  * const averageScore: number | null = aggregateSnapshot.data().averageScore;
  * ```
  * @internal TODO (sum/avg) remove when public
- */ function ts(t, e) {
-    const n = ct(t.firestore, In), r = bn(n), s = function(t, e) {
+ */ function es(t, e) {
+    const n = ct(t.firestore, Tn), r = En(n), s = function(t, e) {
         const n = [];
         for (const r in t) Object.prototype.hasOwnProperty.call(t, r) && n.push(e(t[r], r, t));
         return n;
-    }(e, ((t, e) => new _t(e, t._aggregateType, t._internalFieldPath)));
+    }(e, ((t, e) => new vt(e, t._aggregateType, t._internalFieldPath)));
     // Run the aggregation and convert the results
-    return _n(r, t._query, s).then((e => function(t, e, n) {
-        const r = new Wr(t);
-        return new $n(e, r, n);
+    return vn(r, t._query, s).then((e => function(t, e, n) {
+        const r = new Gr(t);
+        return new Nn(e, r, n);
     }
     /**
  * Create an AggregateField object that can be used to compute the sum of
@@ -6201,8 +6241,8 @@ function Hr(t, e, n, ...r) {
  */ (n, t, e)));
 }
 
-function es(t) {
-    return new Vn("sum", hr("sum", t));
+function ns(t) {
+    return new $n("sum", lr("sum", t));
 }
 
 /**
@@ -6210,16 +6250,16 @@ function es(t) {
  * a specified field over a range of documents in the result set of a query.
  * @param field Specifies the field to average across the result set.
  * @internal TODO (sum/avg) remove when public
- */ function ns(t) {
-    return new Vn("avg", hr("average", t));
+ */ function rs(t) {
+    return new $n("avg", lr("average", t));
 }
 
 /**
  * Create an AggregateField object that can be used to compute the count of
  * documents in the result set of a query.
  * @internal TODO (sum/avg) remove when public
- */ function rs() {
-    return new Vn("count");
+ */ function ss() {
+    return new $n("count");
 }
 
 /**
@@ -6228,9 +6268,9 @@ function es(t) {
  * @param left Compare this AggregateField to the `right`.
  * @param right Compare this AggregateField to the `left`.
  * @internal TODO (sum/avg) remove when public
- */ function ss(t, e) {
+ */ function is(t, e) {
     var n, r;
-    return t instanceof Vn && e instanceof Vn && t._aggregateType === e._aggregateType && (null === (n = t._internalFieldPath) || void 0 === n ? void 0 : n.canonicalString()) === (null === (r = e._internalFieldPath) || void 0 === r ? void 0 : r.canonicalString());
+    return t instanceof $n && e instanceof $n && t._aggregateType === e._aggregateType && (null === (n = t._internalFieldPath) || void 0 === n ? void 0 : n.canonicalString()) === (null === (r = e._internalFieldPath) || void 0 === r ? void 0 : r.canonicalString());
 }
 
 /**
@@ -6244,8 +6284,8 @@ function es(t) {
  *
  * @returns `true` if the objects are "equal", as defined above, or `false`
  * otherwise.
- */ function is(t, e) {
-    return kn(t.query, e.query) && deepEqual(t.data(), e.data());
+ */ function os(t, e) {
+    return Cn(t.query, e.query) && deepEqual(t.data(), e.data());
 }
 
 /**
@@ -6267,15 +6307,15 @@ function es(t) {
 /**
  * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or
  * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.
- */ function os() {
-    return new Jn("deleteField");
+ */ function us() {
+    return new Xn("deleteField");
 }
 
 /**
  * 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 us() {
-    return new Zn("serverTimestamp");
+ */ function cs() {
+    return new tr("serverTimestamp");
 }
 
 /**
@@ -6289,10 +6329,10 @@ function es(t) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function cs(...t) {
+ */ function as(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-    return new tr("arrayUnion", t);
+    return new er("arrayUnion", t);
 }
 
 /**
@@ -6305,10 +6345,10 @@ function es(t) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function as(...t) {
+ */ function hs(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-    return new er("arrayRemove", t);
+    return new nr("arrayRemove", t);
 }
 
 /**
@@ -6329,8 +6369,8 @@ function es(t) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function hs(t) {
-    return new nr("increment", t);
+ */ function ls(t) {
+    return new rr("increment", t);
 }
 
 /**
@@ -6356,25 +6396,25 @@ function es(t) {
  * provides methods for adding writes to the write batch. None of the writes
  * will be committed (or visible locally) until {@link WriteBatch.commit} is
  * called.
- */ class ls {
+ */ class fs {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = Yn(t);
+        this._dataReader = Hn(t);
     }
     set(t, e, n) {
         this._verifyNotCommitted();
-        const r = fs(t, this._firestore), s = zr(r.converter, e, n), i = Hn(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, n);
-        return this._mutations.push(i.toMutation(r._key, Oe.none())), this;
+        const r = ds(t, this._firestore), s = Wr(r.converter, e, n), i = Jn(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, n);
+        return this._mutations.push(i.toMutation(r._key, ke.none())), this;
     }
     update(t, e, n, ...r) {
         this._verifyNotCommitted();
-        const s = fs(t, this._firestore);
+        const s = ds(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof Mn ? sr(this._dataReader, "WriteBatch.update", s._key, e, n, r) : rr(this._dataReader, "WriteBatch.update", s._key, e), 
-        this._mutations.push(i.toMutation(s._key, Oe.exists(!0))), this;
+        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof Ln ? ir(this._dataReader, "WriteBatch.update", s._key, e, n, r) : sr(this._dataReader, "WriteBatch.update", s._key, e), 
+        this._mutations.push(i.toMutation(s._key, ke.exists(!0))), this;
     }
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -6383,8 +6423,8 @@ function es(t) {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const e = fs(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Le(e._key, Oe.none())), this;
+        const e = ds(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Ue(e._key, ke.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -6405,7 +6445,7 @@ function es(t) {
     }
 }
 
-function fs(t, e) {
+function ds(t, e) {
     if ((t = getModularInstance(t)).firestore !== e) throw new U(P, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -6422,9 +6462,9 @@ function fs(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function ds(t) {
-    const e = bn(t = ct(t, In));
-    return new ls(t, (t => pn(e, t)));
+ */ function ws(t) {
+    const e = En(t = ct(t, Tn));
+    return new fs(t, (t => yn(e, t)));
 }
 
 /**
@@ -6446,7 +6486,7 @@ function fs(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ class ws {
+ */ class ms {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -6466,7 +6506,7 @@ function fs(t, e) {
     }
     async lookup(t) {
         if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(P, "Firestore transactions require all reads to be executed before all writes.");
-        const e = await yn(this.datastore, t);
+        const e = await gn(this.datastore, t);
         return e.forEach((t => this.recordVersion(t))), e;
     }
     set(t, e) {
@@ -6481,7 +6521,7 @@ function fs(t, e) {
         this.writtenDocs.add(t.toString());
     }
     delete(t) {
-        this.write(new Le(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Ue(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }
     async commit() {
         if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
@@ -6494,15 +6534,15 @@ function fs(t, e) {
         // a `verify` operation.
         t.forEach(((t, e) => {
             const n = rt.fromPath(e);
-            this.mutations.push(new Ue(n, this.precondition(n)));
-        })), await pn(this.datastore, this.mutations), this.committed = !0;
+            this.mutations.push(new je(n, this.precondition(n)));
+        })), await yn(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let e;
         if (t.isFoundDocument()) e = t.version; else {
             if (!t.isNoDocument()) throw b();
             // Represent a deleted doc using SnapshotVersion.min().
-            e = he.min();
+            e = le.min();
         }
         const n = this.readVersions.get(t.key.toString());
         if (n) {
@@ -6516,7 +6556,7 @@ function fs(t, e) {
      * as a precondition, or no precondition if it was not read.
      */    precondition(t) {
         const e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(he.min()) ? Oe.exists(!1) : Oe.updateTime(e) : Oe.none();
+        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(le.min()) ? ke.exists(!1) : ke.updateTime(e) : ke.none();
     }
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -6525,7 +6565,7 @@ function fs(t, e) {
         // The first time a document is written, we want to take into account the
         // read time and existence
                 if (!this.writtenDocs.has(t.toString()) && e) {
-            if (e.isEqual(he.min())) 
+            if (e.isEqual(le.min())) 
             // The document doesn't exist, so fail the transaction.
             // This has to be validated locally because you can't send a
             // precondition that a document does not exist without changing the
@@ -6537,11 +6577,11 @@ function fs(t, e) {
             // transaction.
             throw new U(P, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return Oe.updateTime(e);
+                        return ke.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-        return Oe.exists(!0);
+        return ke.exists(!0);
     }
     write(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
@@ -6564,7 +6604,7 @@ function fs(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const ms = {
+ */ const ps = {
     maxAttempts: 5
 };
 
@@ -6588,17 +6628,17 @@ function fs(t, e) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class ps {
+class ys {
     constructor(t, e, n, r, s) {
         this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
-        this.deferred = s, this.wt = n.maxAttempts, this.yt = new wn(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */);
+        this.deferred = s, this.wt = n.maxAttempts, this.yt = new mn(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
         this.wt -= 1, this.gt();
     }
     gt() {
         this.yt.K((async () => {
-            const t = new ws(this.datastore), e = this._t(t);
+            const t = new ms(this.datastore), e = this._t(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
@@ -6613,7 +6653,7 @@ class ps {
     _t(t) {
         try {
             const e = this.updateFunction(t);
-            return !ft(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !dt(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
             null);
         } catch (t) {
             // Do not retry errors thrown by user provided updateFunction.
@@ -6654,8 +6694,8 @@ class ps {
 
                   case P:
                   case $:
-                  case D:
                   case N:
+                  case D:
                   case S:
  // Aborted might be retried in some scenarios, but that is dependant on
                     // the context and should handled individually by the calling code.
@@ -6688,7 +6728,7 @@ class ps {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** The Platform's 'document' implementation or null if not available. */ function ys() {
+/** The Platform's 'document' implementation or null if not available. */ function gs() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -6720,7 +6760,7 @@ class ps {
  * Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type
  * in newer versions of TypeScript defines `finally`, which is not available in
  * IE.
- */ class gs {
+ */ class _s {
     constructor(t, e, n, r, s) {
         this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = r, this.removalCallback = s, 
         this.deferred = new j, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
@@ -6743,7 +6783,7 @@ class ps {
      *   PORTING NOTE: This exists to prevent making removeDelayedOperation() and
      *   the DelayedOperation class public.
      */    static createAndSchedule(t, e, n, r, s) {
-        const i = Date.now() + n, o = new gs(t, e, i, r, s);
+        const i = Date.now() + n, o = new _s(t, e, i, r, s);
         return o.start(n), o;
     }
     /**
@@ -6792,7 +6832,7 @@ class ps {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class _s {
+ */ class vs {
     constructor() {
         // The last promise in the queue.
         this.Et = Promise.resolve(), 
@@ -6815,16 +6855,16 @@ class ps {
         // List of TimerIds to fast-forward delays for.
         this.$t = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.yt = new wn(this, "async_queue_retry" /* TimerId.AsyncQueueRetry */), 
+        this.yt = new mn(this, "async_queue_retry" /* TimerId.AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
-        this.Dt = () => {
-            const t = ys();
+        this.Nt = () => {
+            const t = gs();
             t && y("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.yt.H();
         };
-        const t = ys();
-        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Dt);
+        const t = gs();
+        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Nt);
     }
     get isShuttingDown() {
         return this.Tt;
@@ -6837,19 +6877,19 @@ class ps {
         this.enqueue(t);
     }
     enqueueAndForgetEvenWhileRestricted(t) {
-        this.Nt(), 
+        this.Dt(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
         this.Ft(t);
     }
     enterRestrictedMode(t) {
         if (!this.Tt) {
             this.Tt = !0, this.Vt = t || !1;
-            const e = ys();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Dt);
+            const e = gs();
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Nt);
         }
     }
     enqueue(t) {
-        if (this.Nt(), this.Tt) 
+        if (this.Dt(), this.Tt) 
         // Return a Promise which never resolves.
         return new Promise((() => {}));
         // Create a deferred Promise that we can return to the callee. This
@@ -6973,13 +7013,13 @@ class ps {
         return this.Et = e, e;
     }
     enqueueAfterDelay(t, e, n) {
-        this.Nt(), 
+        this.Dt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.$t.indexOf(t) > -1 && (e = 0);
-        const r = gs.createAndSchedule(this, t, e, n, (t => this.St(t)));
+        const r = _s.createAndSchedule(this, t, e, n, (t => this.St(t)));
         return this.At.push(r), r;
     }
-    Nt() {
+    Dt() {
         this.Rt && b();
     }
     verifyOperationInProgress() {}
@@ -7030,10 +7070,10 @@ class ps {
     }
 }
 
-class vs {
+class bs {
     /** @hideconstructor */
     constructor(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = Yn(t);
+        this._firestore = t, this._transaction = e, this._dataReader = Hn(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -7041,25 +7081,25 @@ class vs {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const e = fs(t, this._firestore), n = new Wr(this._firestore);
+        const e = ds(t, this._firestore), n = new Gr(this._firestore);
         return this._transaction.lookup([ e._key ]).then((t => {
             if (!t || 1 !== t.length) return b();
             const r = t[0];
-            if (r.isFoundDocument()) return new mr(this._firestore, n, r.key, r, e.converter);
-            if (r.isNoDocument()) return new mr(this._firestore, n, e._key, null, e.converter);
+            if (r.isFoundDocument()) return new pr(this._firestore, n, r.key, r, e.converter);
+            if (r.isNoDocument()) return new pr(this._firestore, n, e._key, null, e.converter);
             throw b();
         }));
     }
     set(t, e, n) {
-        const r = fs(t, this._firestore), s = zr(r.converter, e, n), i = Hn(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, n);
+        const r = ds(t, this._firestore), s = Wr(r.converter, e, n), i = Jn(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, n);
         return this._transaction.set(r._key, i), this;
     }
     update(t, e, n, ...r) {
-        const s = fs(t, this._firestore);
+        const s = ds(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof Mn ? sr(this._dataReader, "Transaction.update", s._key, e, n, r) : rr(this._dataReader, "Transaction.update", s._key, e), 
+        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof Ln ? ir(this._dataReader, "Transaction.update", s._key, e, n, r) : sr(this._dataReader, "Transaction.update", s._key, e), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -7068,7 +7108,7 @@ class vs {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const e = fs(t, this._firestore);
+        const e = ds(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }
 }
@@ -7091,13 +7131,13 @@ class vs {
  * (the `updateFunction` returned a failed promise), the promise returned by the
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
- */ function bs(t, e, n) {
-    const r = bn(t = ct(t, In)), s = Object.assign(Object.assign({}, ms), n);
+ */ function Es(t, e, n) {
+    const r = En(t = ct(t, Tn)), s = Object.assign(Object.assign({}, ps), n);
     !function(t) {
         if (t.maxAttempts < 1) throw new U(P, "Max attempts must be at least 1");
     }(s);
     const i = new j;
-    return new ps(new _s, r, s, (n => e(new vs(t, n))), i).run(), i.promise;
+    return new ys(new vs, r, s, (n => e(new bs(t, n))), i).run(), i.promise;
 }
 
 /**
@@ -7110,7 +7150,7 @@ class vs {
  */ !function(t) {
     w = t;
 }(`${SDK_VERSION}_lite`), _registerComponent(new Component("firestore/lite", ((t, {instanceIdentifier: e, options: n}) => {
-    const r = t.getProvider("app").getImmediate(), s = new In(new W(t.getProvider("auth-internal")), new H(t.getProvider("app-check-internal")), function(t, e) {
+    const r = t.getProvider("app").getImmediate(), s = new Tn(new W(t.getProvider("auth-internal")), new H(t.getProvider("app-check-internal")), function(t, e) {
         if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(P, '"projectId" not provided in firebase.initializeApp.');
         return new X(t.options.projectId, e);
     }
@@ -7133,7 +7173,7 @@ class vs {
     return n && s._setSettings(n), s;
 }), "PUBLIC").setMultipleInstances(!0)), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-registerVersion("firestore-lite", "3.11.0", ""), registerVersion("firestore-lite", "3.11.0", "esm2017");
+registerVersion("firestore-lite", "3.12.0-20230511201449", ""), registerVersion("firestore-lite", "3.12.0-20230511201449", "esm2017");
 
-export { Vn as AggregateField, $n as AggregateQuerySnapshot, Cn as Bytes, Fn as CollectionReference, Dn as DocumentReference, mr as DocumentSnapshot, Mn as FieldPath, Un as FieldValue, In as Firestore, U as FirestoreError, jn as GeoPoint, Nn as Query, Ar as QueryCompositeFilterConstraint, br as QueryConstraint, pr as QueryDocumentSnapshot, Or as QueryEndAtConstraint, Ir as QueryFieldFilterConstraint, Dr as QueryLimitConstraint, Vr as QueryOrderByConstraint, yr as QuerySnapshot, xr as QueryStartAtConstraint, Ft as Timestamp, vs as Transaction, ls as WriteBatch, Xr as addDoc, ss as aggregateFieldEqual, is as aggregateQuerySnapshotEqual, Pr as and, as as arrayRemove, cs as arrayUnion, ns as average, xn as collection, Sn as collectionGroup, Rn as connectFirestoreEmulator, rs as count, Jr as deleteDoc, os as deleteField, qn as doc, Ln as documentId, Cr as endAt, kr as endBefore, ts as getAggregate, Zr as getCount, Gr as getDoc, Kr as getDocs, An as getFirestore, hs as increment, Tn as initializeFirestore, Nr as limit, Fr as limitToLast, Rr as or, $r as orderBy, Er as query, kn as queryEqual, On as refEqual, bs as runTransaction, us as serverTimestamp, Yr as setDoc, p as setLogLevel, gr as snapshotEqual, qr as startAfter, Sr as startAt, es as sum, Pn as terminate, Hr as updateDoc, Tr as where, ds as writeBatch };
+export { $n as AggregateField, Nn as AggregateQuerySnapshot, Mn as Bytes, xn as CollectionReference, Dn as DocumentReference, pr as DocumentSnapshot, Ln as FieldPath, jn as FieldValue, Tn as Firestore, U as FirestoreError, Bn as GeoPoint, Fn as Query, Rr as QueryCompositeFilterConstraint, Er as QueryConstraint, yr as QueryDocumentSnapshot, kr as QueryEndAtConstraint, Tr as QueryFieldFilterConstraint, Dr as QueryLimitConstraint, $r as QueryOrderByConstraint, gr as QuerySnapshot, Sr as QueryStartAtConstraint, xt as Timestamp, bs as Transaction, fs as WriteBatch, Zr as addDoc, is as aggregateFieldEqual, os as aggregateQuerySnapshotEqual, Vr as and, hs as arrayRemove, as as arrayUnion, rs as average, Sn as collection, qn as collectionGroup, Pn as connectFirestoreEmulator, ss as count, Xr as deleteDoc, us as deleteField, On as doc, Un as documentId, Mr as endAt, Cr as endBefore, es as getAggregate, ts as getCount, Kr as getDoc, Yr as getDocs, Rn as getFirestore, ls as increment, An as initializeFirestore, Fr as limit, xr as limitToLast, Pr as or, Nr as orderBy, Ir as query, Cn as queryEqual, kn as refEqual, Es as runTransaction, cs as serverTimestamp, Hr as setDoc, p as setLogLevel, _r as snapshotEqual, Or as startAfter, qr as startAt, ns as sum, Vn as terminate, Jr as updateDoc, Ar as where, ws as writeBatch };
 //# sourceMappingURL=index.browser.esm2017.js.map