@firebase/firestore 3.8.4 → 3.9.0-20230314181055

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

@@ -66,7 +66,7 @@ m.MOCK_USER = new m("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let p = "9.17.2";
+let p = "9.18.0-20230314181055";
 
 /**
  * @license
@@ -803,6 +803,54 @@ function lt(t, e) {
     if (e <= 0) throw new B($, `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.
+ */
+/**
+ * The value returned from the most recent invocation of
+ * `generateUniqueDebugId()`, or null if it has never been invoked.
+ */ let ft = null;
+
+/**
+ * Generates and returns an initial value for `lastUniqueDebugId`.
+ *
+ * The returned value is randomly selected from a range of integers that are
+ * represented as 8 hexadecimal digits. This means that (within reason) any
+ * numbers generated by incrementing the returned number by 1 will also be
+ * represented by 8 hexadecimal digits. This leads to all "IDs" having the same
+ * length when converted to a hexadecimal string, making reading logs containing
+ * these IDs easier to follow. And since the return value is randomly selected
+ * it will help to differentiate between logs from different executions.
+ */
+/**
+ * Generates and returns a unique ID as a hexadecimal string.
+ *
+ * The returned ID is intended to be used in debug logging messages to help
+ * correlate log messages that may be spatially separated in the logs, but
+ * logically related. For example, a network connection could include the same
+ * "debug ID" string in all of its log messages to help trace a specific
+ * connection over time.
+ *
+ * @return the 10-character generated ID (e.g. "0xa1b2c3d4").
+ */
+function dt() {
+    return null === ft ? ft = 268435456 + Math.round(2147483648 * Math.random()) : ft++, 
+    "0x" + ft.toString(16);
+}
+
 /**
  * @license
  * Copyright 2017 Google LLC
@@ -821,11 +869,11 @@ function lt(t, e) {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function ft(t) {
+ */ function wt(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function dt(t) {
+/** Returns whether the value represents -0. */ function mt(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;
@@ -851,7 +899,7 @@ function lt(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const wt = {
+const pt = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery",
@@ -889,7 +937,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 yt, gt;
 
 /**
  * Converts an HTTP Status Code to the equivalent error code.
@@ -898,7 +946,7 @@ var mt, pt;
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function yt(t) {
+function _t(t) {
     if (void 0 === t) return v("RPC_ERROR", "HTTP error has no status"), V;
     // 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
@@ -991,16 +1039,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";
+ */ (gt = yt || (yt = {}))[gt.OK = 0] = "OK", gt[gt.CANCELLED = 1] = "CANCELLED", 
+gt[gt.UNKNOWN = 2] = "UNKNOWN", gt[gt.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+gt[gt.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", gt[gt.NOT_FOUND = 5] = "NOT_FOUND", 
+gt[gt.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", gt[gt.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+gt[gt.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", gt[gt.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+gt[gt.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", gt[gt.ABORTED = 10] = "ABORTED", 
+gt[gt.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", gt[gt.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+gt[gt.INTERNAL = 13] = "INTERNAL", gt[gt.UNAVAILABLE = 14] = "UNAVAILABLE", gt[gt.DATA_LOSS = 15] = "DATA_LOSS";
 
-class gt extends 
+class vt extends 
 /**
  * Base class for all Rest-based connections to the backend (WebChannel and
  * HTTP).
@@ -1017,12 +1065,12 @@ class {
         return !1;
     }
     A(t, e, n, r, s) {
-        const i = this.I(t, e);
-        _("RestConnection", "Sending: ", i, n);
-        const o = {};
-        return this.T(o, r, s), this.R(t, i, o, n).then((t => (_("RestConnection", "Received: ", t), 
-        t)), (e => {
-            throw b("RestConnection", `${t} failed with error: `, e, "url: ", i, "request:", n), 
+        const i = dt(), o = this.I(t, e);
+        _("RestConnection", `Sending RPC '${t}' ${i}:`, o, n);
+        const u = {};
+        return this.T(u, r, s), this.R(t, o, u, n).then((e => (_("RestConnection", `Received RPC '${t}' ${i}: `, e), 
+        e)), (e => {
+            throw b("RestConnection", `RPC '${t}' ${i} failed with error: `, e, "url: ", o, "request:", n), 
             e;
         }));
     }
@@ -1044,7 +1092,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 = pt[t];
         return `${this.p}/v1/${e}:${n}`;
     }
 } {
@@ -1070,13 +1118,13 @@ class {
             });
         } catch (t) {
             const e = t;
-            throw new B(yt(e.status), "Request failed with error: " + e.statusText);
+            throw new B(_t(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 B(yt(o.status), `Request failed with error: ${null != e ? e : o.statusText}`);
+            throw new B(_t(o.status), `Request failed with error: ${null != e ? e : o.statusText}`);
         }
         return o.json();
     }
@@ -1115,12 +1163,12 @@ class {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const _t = /^[_a-zA-Z][_a-zA-Z0-9]*(?:\.[_a-zA-Z][_a-zA-Z0-9]*)*$/;
+const bt = /^[_a-zA-Z][_a-zA-Z0-9]*(?:\.[_a-zA-Z][_a-zA-Z0-9]*)*$/;
 
 /**
  * An alias for aggregation results.
  * @internal
- */ class vt {
+ */ class Et {
     /**
      * @internal
      * @param alias Un-escaped alias representation
@@ -1131,13 +1179,13 @@ const _t = /^[_a-zA-Z][_a-zA-Z0-9]*(?:\.[_a-zA-Z][_a-zA-Z0-9]*)*$/;
     /**
      * Returns true if the string could be used as an alias.
      */    static N(t) {
-        return _t.test(t);
+        return bt.test(t);
     }
     /**
      * Return an escaped and quoted string representation of the alias.
      */    canonicalString() {
         let t = this.alias.replace(/\\/g, "\\\\").replace(/`/g, "\\`");
-        return vt.N(t) || (t = "`" + t + "`"), t;
+        return Et.N(t) || (t = "`" + t + "`"), t;
     }
 }
 
@@ -1159,7 +1207,7 @@ const _t = /^[_a-zA-Z][_a-zA-Z0-9]*(?:\.[_a-zA-Z][_a-zA-Z0-9]*)*$/;
  */
 /**
  * Concrete implementation of the Aggregate type.
- */ class bt {
+ */ class At {
     constructor(t, e, n) {
         this.alias = t, this.D = e, this.fieldPath = n;
     }
@@ -1185,7 +1233,7 @@ const _t = /^[_a-zA-Z][_a-zA-Z0-9]*(?:\.[_a-zA-Z][_a-zA-Z0-9]*)*$/;
  * Generates `nBytes` of random bytes.
  *
  * If `nBytes < 0` , an error will be thrown.
- */ function Et(t) {
+ */ function It(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
@@ -1211,14 +1259,14 @@ const _t = /^[_a-zA-Z][_a-zA-Z0-9]*(?:\.[_a-zA-Z][_a-zA-Z0-9]*)*$/;
  * 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 At {
+ */ class Tt {
     static F() {
         // 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 = Et(40);
+            const r = It(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.
@@ -1228,11 +1276,11 @@ const _t = /^[_a-zA-Z][_a-zA-Z0-9]*(?:\.[_a-zA-Z][_a-zA-Z0-9]*)*$/;
     }
 }
 
-function It(t, e) {
+function Rt(t, e) {
     return t < e ? -1 : t > e ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function Tt(t, e, n) {
+/** Helper to compare arrays using isEqual(). */ function Pt(t, e, n) {
     return t.length === e.length && t.every(((t, r) => n(t, e[r])));
 }
 
@@ -1251,13 +1299,13 @@ function It(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 Rt(t) {
+ */ function Vt(t) {
     let e = 0;
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
 }
 
-function Pt(t, e) {
+function $t(t, e) {
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
@@ -1280,7 +1328,7 @@ function Pt(t, e) {
 /**
  * An error encountered while decoding base64 string.
  */
-class Vt extends Error {
+class Nt extends Error {
     constructor() {
         super(...arguments), this.name = "Base64DecodeError";
     }
@@ -1305,7 +1353,7 @@ class Vt extends Error {
 // WebSafe uses a different URL-encoding safe alphabet that doesn't match
 // the encoding used on the backend.
 /** Converts a Base64 encoded string to a binary string. */
-function $t(t) {
+function Dt(t) {
     try {
         return String.fromCharCode.apply(null, 
         // We use `decodeStringToByteArray()` instead of `decodeString()` since
@@ -1313,7 +1361,7 @@ function $t(t) {
         // returned by `atob()`'s Latin1 representation.
         a.decodeStringToByteArray(t, false));
     } catch (t) {
-        throw t instanceof h ? new Vt("Invalid base64 string: " + t) : t;
+        throw t instanceof h ? new Nt("Invalid base64 string: " + t) : t;
     }
 }
 
@@ -1343,13 +1391,13 @@ function $t(t) {
  * before being sent as a proto.
  * @internal
  */
-class Nt {
+class Ft {
     constructor(t) {
         this.binaryString = t;
     }
     static fromBase64String(t) {
-        const e = $t(t);
-        return new Nt(e);
+        const e = Dt(t);
+        return new Ft(e);
     }
     static fromUint8Array(t) {
         // TODO(indexing); Remove the copy of the byte string here as this method
@@ -1366,7 +1414,7 @@ class Nt {
         /**
  * Helper function to convert a binary string to an Uint8Array.
  */ (t);
-        return new Nt(e);
+        return new Ft(e);
     }
     [Symbol.iterator]() {
         let t = 0;
@@ -1416,21 +1464,21 @@ class Nt {
         return 2 * this.binaryString.length;
     }
     compareTo(t) {
-        return It(this.binaryString, t.binaryString);
+        return Rt(this.binaryString, t.binaryString);
     }
     isEqual(t) {
         return this.binaryString === t.binaryString;
     }
 }
 
-Nt.EMPTY_BYTE_STRING = new Nt("");
+Ft.EMPTY_BYTE_STRING = new Ft("");
 
-const Dt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const xt = 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 Ft(t) {
+ */ function St(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.
@@ -1439,7 +1487,7 @@ const Dt = 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 = Dt.exec(t);
+        const n = xt.exec(t);
         if (I(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = n[1];
@@ -1453,21 +1501,21 @@ const Dt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: xt(t.seconds),
-        nanos: xt(t.nanos)
+        seconds: qt(t.seconds),
+        nanos: qt(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function xt(t) {
+ */ function qt(t) {
     // TODO(bjornick): Handle int64 greater than 53 bits.
     return "number" == typeof t ? t : "string" == typeof t ? Number(t) : 0;
 }
 
-/** Converts the possible Proto types for Blobs into a ByteString. */ function St(t) {
-    return "string" == typeof t ? Nt.fromBase64String(t) : Nt.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Ot(t) {
+    return "string" == typeof t ? Ft.fromBase64String(t) : Ft.fromUint8Array(t);
 }
 
 /**
@@ -1501,7 +1549,7 @@ const Dt = 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 qt {
+class kt {
     /**
      * Creates a new timestamp.
      *
@@ -1533,7 +1581,7 @@ class qt {
      *
      * @returns a new timestamp representing the current date.
      */    static now() {
-        return qt.fromMillis(Date.now());
+        return kt.fromMillis(Date.now());
     }
     /**
      * Creates a new timestamp from the given date.
@@ -1542,7 +1590,7 @@ class qt {
      * @returns A new `Timestamp` representing the same point in time as the given
      *     date.
      */    static fromDate(t) {
-        return qt.fromMillis(t.getTime());
+        return kt.fromMillis(t.getTime());
     }
     /**
      * Creates a new timestamp from the given number of milliseconds.
@@ -1553,7 +1601,7 @@ class qt {
      *     number of milliseconds.
      */    static fromMillis(t) {
         const e = Math.floor(t / 1e3), n = Math.floor(1e6 * (t - 1e3 * e));
-        return new qt(e, n);
+        return new kt(e, n);
     }
     /**
      * Converts a `Timestamp` to a JavaScript `Date` object. This conversion
@@ -1575,7 +1623,7 @@ class qt {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }
     _compareTo(t) {
-        return this.seconds === t.seconds ? It(this.nanoseconds, t.nanoseconds) : It(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? Rt(this.nanoseconds, t.nanoseconds) : Rt(this.seconds, t.seconds);
     }
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1645,7 +1693,7 @@ class qt {
  *   FieldValueOptions to value().
  * - With respect to other ServerTimestampValues, they sort by their
  *   localWriteTime.
- */ function Ot(t) {
+ */ function Ct(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);
 }
@@ -1655,16 +1703,16 @@ class qt {
  *
  * Preserving the previous values allows the user to display the last resoled
  * value until the backend responds with the timestamp.
- */ function kt(t) {
+ */ function Lt(t) {
     const e = t.mapValue.fields.__previous_value__;
-    return Ot(e) ? kt(e) : e;
+    return Ct(e) ? Lt(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Ct(t) {
-    const e = Ft(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new qt(e.seconds, e.nanos);
+ */ function Mt(t) {
+    const e = St(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new kt(e.seconds, e.nanos);
 }
 
 /**
@@ -1682,7 +1730,7 @@ class qt {
  * 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 Lt = {
+ */ const Ut = {
     fields: {
         __type__: {
             stringValue: "__max__"
@@ -1691,8 +1739,8 @@ class qt {
 };
 
 /** Extracts the backend's type order for the provided value. */
-function Mt(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 ? Ot(t) ? 4 /* TypeOrder.ServerTimestampValue */ : 
+function jt(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 ? Ct(t) ? 4 /* TypeOrder.ServerTimestampValue */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
         return "__max__" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;
@@ -1729,10 +1777,10 @@ function Mt(t) {
  */ (t) ? 9007199254740991 /* TypeOrder.MaxValue */ : 10 /* TypeOrder.ObjectValue */ : A();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Ut(t, e) {
+/** Tests `left` and `right` for equality based on the backend semantics. */ function Bt(t, e) {
     if (t === e) return !0;
-    const n = Mt(t);
-    if (n !== Mt(e)) return !1;
+    const n = jt(t);
+    if (n !== jt(e)) return !1;
     switch (n) {
       case 0 /* TypeOrder.NullValue */ :
       case 9007199254740991 /* TypeOrder.MaxValue */ :
@@ -1742,14 +1790,14 @@ function Mt(t) {
         return t.booleanValue === e.booleanValue;
 
       case 4 /* TypeOrder.ServerTimestampValue */ :
-        return Ct(t).isEqual(Ct(e));
+        return Mt(t).isEqual(Mt(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 = Ft(t.timestampValue), r = Ft(e.timestampValue);
+            const n = St(t.timestampValue), r = St(e.timestampValue);
             return n.seconds === r.seconds && n.nanos === r.nanos;
         }(t, e);
 
@@ -1758,7 +1806,7 @@ function Mt(t) {
 
       case 6 /* TypeOrder.BlobValue */ :
         return function(t, e) {
-            return St(t.bytesValue).isEqual(St(e.bytesValue));
+            return Ot(t.bytesValue).isEqual(Ot(e.bytesValue));
         }(t, e);
 
       case 7 /* TypeOrder.RefValue */ :
@@ -1766,27 +1814,27 @@ function Mt(t) {
 
       case 8 /* TypeOrder.GeoPointValue */ :
         return function(t, e) {
-            return xt(t.geoPointValue.latitude) === xt(e.geoPointValue.latitude) && xt(t.geoPointValue.longitude) === xt(e.geoPointValue.longitude);
+            return qt(t.geoPointValue.latitude) === qt(e.geoPointValue.latitude) && qt(t.geoPointValue.longitude) === qt(e.geoPointValue.longitude);
         }(t, e);
 
       case 2 /* TypeOrder.NumberValue */ :
         return function(t, e) {
-            if ("integerValue" in t && "integerValue" in e) return xt(t.integerValue) === xt(e.integerValue);
+            if ("integerValue" in t && "integerValue" in e) return qt(t.integerValue) === qt(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
-                const n = xt(t.doubleValue), r = xt(e.doubleValue);
-                return n === r ? dt(n) === dt(r) : isNaN(n) && isNaN(r);
+                const n = qt(t.doubleValue), r = qt(e.doubleValue);
+                return n === r ? mt(n) === mt(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* TypeOrder.ArrayValue */ :
-        return Tt(t.arrayValue.values || [], e.arrayValue.values || [], Ut);
+        return Pt(t.arrayValue.values || [], e.arrayValue.values || [], Bt);
 
       case 10 /* TypeOrder.ObjectValue */ :
         return function(t, e) {
             const n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (Rt(n) !== Rt(r)) return !1;
-            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Ut(n[t], r[t]))) return !1;
+            if (Vt(n) !== Vt(r)) return !1;
+            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Bt(n[t], r[t]))) return !1;
             return !0;
         }
         /** Returns true if the ArrayValue contains the specified element. */ (t, e);
@@ -1796,42 +1844,42 @@ function Mt(t) {
     }
 }
 
-function jt(t, e) {
-    return void 0 !== (t.values || []).find((t => Ut(t, e)));
+function zt(t, e) {
+    return void 0 !== (t.values || []).find((t => Bt(t, e)));
 }
 
-function Bt(t, e) {
+function Qt(t, e) {
     if (t === e) return 0;
-    const n = Mt(t), r = Mt(e);
-    if (n !== r) return It(n, r);
+    const n = jt(t), r = jt(e);
+    if (n !== r) return Rt(n, r);
     switch (n) {
       case 0 /* TypeOrder.NullValue */ :
       case 9007199254740991 /* TypeOrder.MaxValue */ :
         return 0;
 
       case 1 /* TypeOrder.BooleanValue */ :
-        return It(t.booleanValue, e.booleanValue);
+        return Rt(t.booleanValue, e.booleanValue);
 
       case 2 /* TypeOrder.NumberValue */ :
         return function(t, e) {
-            const n = xt(t.integerValue || t.doubleValue), r = xt(e.integerValue || e.doubleValue);
+            const n = qt(t.integerValue || t.doubleValue), r = qt(e.integerValue || e.doubleValue);
             return n < r ? -1 : n > r ? 1 : n === r ? 0 : 
             // one or both are NaN.
             isNaN(n) ? isNaN(r) ? 0 : -1 : 1;
         }(t, e);
 
       case 3 /* TypeOrder.TimestampValue */ :
-        return zt(t.timestampValue, e.timestampValue);
+        return Wt(t.timestampValue, e.timestampValue);
 
       case 4 /* TypeOrder.ServerTimestampValue */ :
-        return zt(Ct(t), Ct(e));
+        return Wt(Mt(t), Mt(e));
 
       case 5 /* TypeOrder.StringValue */ :
-        return It(t.stringValue, e.stringValue);
+        return Rt(t.stringValue, e.stringValue);
 
       case 6 /* TypeOrder.BlobValue */ :
         return function(t, e) {
-            const n = St(t), r = St(e);
+            const n = Ot(t), r = Ot(e);
             return n.compareTo(r);
         }(t.bytesValue, e.bytesValue);
 
@@ -1839,34 +1887,34 @@ function Bt(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 = It(n[t], r[t]);
+                const e = Rt(n[t], r[t]);
                 if (0 !== e) return e;
             }
-            return It(n.length, r.length);
+            return Rt(n.length, r.length);
         }(t.referenceValue, e.referenceValue);
 
       case 8 /* TypeOrder.GeoPointValue */ :
         return function(t, e) {
-            const n = It(xt(t.latitude), xt(e.latitude));
+            const n = Rt(qt(t.latitude), qt(e.latitude));
             if (0 !== n) return n;
-            return It(xt(t.longitude), xt(e.longitude));
+            return Rt(qt(t.longitude), qt(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 = Bt(n[t], r[t]);
+                const e = Qt(n[t], r[t]);
                 if (e) return e;
             }
-            return It(n.length, r.length);
+            return Rt(n.length, r.length);
         }(t.arrayValue, e.arrayValue);
 
       case 10 /* TypeOrder.ObjectValue */ :
         return function(t, e) {
-            if (t === Lt && e === Lt) return 0;
-            if (t === Lt) return 1;
-            if (e === Lt) return -1;
+            if (t === Ut && e === Ut) return 0;
+            if (t === Ut) return 1;
+            if (e === Ut) 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
@@ -1874,12 +1922,12 @@ function Bt(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 = It(r[t], i[t]);
+                const e = Rt(r[t], i[t]);
                 if (0 !== e) return e;
-                const o = Bt(n[r[t]], s[i[t]]);
+                const o = Qt(n[r[t]], s[i[t]]);
                 if (0 !== o) return o;
             }
-            return It(r.length, i.length);
+            return Rt(r.length, i.length);
         }
         /** Returns a reference value for the provided database and key. */ (t.mapValue, e.mapValue);
 
@@ -1888,35 +1936,35 @@ function Bt(t, e) {
     }
 }
 
-function zt(t, e) {
-    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return It(t, e);
-    const n = Ft(t), r = Ft(e), s = It(n.seconds, r.seconds);
-    return 0 !== s ? s : It(n.nanos, r.nanos);
+function Wt(t, e) {
+    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return Rt(t, e);
+    const n = St(t), r = St(e), s = Rt(n.seconds, r.seconds);
+    return 0 !== s ? s : Rt(n.nanos, r.nanos);
 }
 
-function Qt(t, e) {
+function Gt(t, e) {
     return {
         referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${e.path.canonicalString()}`
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Wt(t) {
+/** Returns true if `value` is an ArrayValue. */ function Kt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Gt(t) {
+/** Returns true if `value` is a NullValue. */ function Yt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function Kt(t) {
+/** Returns true if `value` is NaN. */ function Ht(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function Yt(t) {
+/** Returns true if `value` is a MapValue. */ function Zt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Ht(t) {
+/** Creates a deep copy of `source`. */ function Jt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1929,7 +1977,7 @@ function Qt(t, e) {
                 fields: {}
             }
         };
-        return Pt(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Ht(n))), e;
+        return $t(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Jt(n))), e;
     }
     if (t.arrayValue) {
         const e = {
@@ -1937,24 +1985,24 @@ function Qt(t, e) {
                 values: []
             }
         };
-        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Ht(t.arrayValue.values[n]);
+        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Jt(t.arrayValue.values[n]);
         return e;
     }
     return Object.assign({}, t);
 }
 
-class Zt {
+class Xt {
     constructor(t, e) {
         this.position = t, this.inclusive = e;
     }
 }
 
-function Jt(t, e) {
+function te(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 (!Ut(t.position[n], e.position[n])) return !1;
+        if (!Bt(t.position[n], e.position[n])) return !1;
     }
     return !0;
 }
@@ -1974,24 +2022,24 @@ function Jt(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 Xt {}
+ */ class ee {}
 
-class te extends Xt {
+class ne extends ee {
     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 re(t, e, n) : "array-contains" /* Operator.ARRAY_CONTAINS */ === e ? new ue(t, n) : "in" /* Operator.IN */ === e ? new ce(t, n) : "not-in" /* Operator.NOT_IN */ === e ? new ae(t, n) : "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new he(t, n) : new te(t, e, n);
+        return t.isKeyField() ? "in" /* Operator.IN */ === e || "not-in" /* Operator.NOT_IN */ === e ? this.createKeyFieldInFilter(t, e, n) : new ie(t, e, n) : "array-contains" /* Operator.ARRAY_CONTAINS */ === e ? new ae(t, n) : "in" /* Operator.IN */ === e ? new he(t, n) : "not-in" /* Operator.NOT_IN */ === e ? new le(t, n) : "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new fe(t, n) : new ne(t, e, n);
     }
     static createKeyFieldInFilter(t, e, n) {
-        return "in" /* Operator.IN */ === e ? new se(t, n) : new ie(t, n);
+        return "in" /* Operator.IN */ === e ? new oe(t, n) : new ue(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(Bt(e, this.value)) : null !== e && Mt(this.value) === Mt(e) && this.matchesComparison(Bt(e, this.value));
+                return "!=" /* Operator.NOT_EQUAL */ === this.op ? null !== e && this.matchesComparison(Qt(e, this.value)) : null !== e && jt(this.value) === jt(e) && this.matchesComparison(Qt(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
     matchesComparison(t) {
@@ -2032,14 +2080,14 @@ class te extends Xt {
     }
 }
 
-class ee extends Xt {
+class re extends ee {
     constructor(t, e) {
         super(), this.filters = t, this.op = e, this.S = null;
     }
     /**
      * Creates a filter based on the provided arguments.
      */    static create(t, e) {
-        return new ee(t, e);
+        return new re(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)));
@@ -2065,19 +2113,19 @@ class ee extends Xt {
     }
 }
 
-function ne(t, e) {
-    return t instanceof te ? function(t, e) {
-        return e instanceof te && t.op === e.op && t.field.isEqual(e.field) && Ut(t.value, e.value);
-    }(t, e) : t instanceof ee ? function(t, e) {
-        if (e instanceof ee && t.op === e.op && t.filters.length === e.filters.length) {
-            return t.filters.reduce(((t, n, r) => t && ne(n, e.filters[r])), !0);
+function se(t, e) {
+    return t instanceof ne ? function(t, e) {
+        return e instanceof ne && t.op === e.op && t.field.isEqual(e.field) && Bt(t.value, e.value);
+    }(t, e) : t instanceof re ? function(t, e) {
+        if (e instanceof re && t.op === e.op && t.filters.length === e.filters.length) {
+            return t.filters.reduce(((t, n, r) => t && se(n, e.filters[r])), !0);
         }
         return !1;
     }
     /** Filter that matches on key fields (i.e. '__name__'). */ (t, e) : void A();
 }
 
-class re extends te {
+class ie extends ne {
     constructor(t, e, n) {
         super(t, e, n), this.key = it.fromName(n.referenceValue);
     }
@@ -2087,69 +2135,69 @@ class re extends te {
     }
 }
 
-/** Filter that matches on key fields within an array. */ class se extends te {
+/** Filter that matches on key fields within an array. */ class oe extends ne {
     constructor(t, e) {
-        super(t, "in" /* Operator.IN */ , e), this.keys = oe("in" /* Operator.IN */ , e);
+        super(t, "in" /* Operator.IN */ , e), this.keys = ce("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 ie extends te {
+/** Filter that matches on key fields not present within an array. */ class ue extends ne {
     constructor(t, e) {
-        super(t, "not-in" /* Operator.NOT_IN */ , e), this.keys = oe("not-in" /* Operator.NOT_IN */ , e);
+        super(t, "not-in" /* Operator.NOT_IN */ , e), this.keys = ce("not-in" /* Operator.NOT_IN */ , e);
     }
     matches(t) {
         return !this.keys.some((e => e.isEqual(t.key)));
     }
 }
 
-function oe(t, e) {
+function ce(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => it.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class ue extends te {
+/** A Filter that implements the array-contains operator. */ class ae extends ne {
     constructor(t, e) {
         super(t, "array-contains" /* Operator.ARRAY_CONTAINS */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return Wt(e) && jt(e.arrayValue, this.value);
+        return Kt(e) && zt(e.arrayValue, this.value);
     }
 }
 
-/** A Filter that implements the IN operator. */ class ce extends te {
+/** A Filter that implements the IN operator. */ class he extends ne {
     constructor(t, e) {
         super(t, "in" /* Operator.IN */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return null !== e && jt(this.value.arrayValue, e);
+        return null !== e && zt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the not-in operator. */ class ae extends te {
+/** A Filter that implements the not-in operator. */ class le extends ne {
     constructor(t, e) {
         super(t, "not-in" /* Operator.NOT_IN */ , e);
     }
     matches(t) {
-        if (jt(this.value.arrayValue, {
+        if (zt(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         const e = t.data.field(this.field);
-        return null !== e && !jt(this.value.arrayValue, e);
+        return null !== e && !zt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the array-contains-any operator. */ class he extends te {
+/** A Filter that implements the array-contains-any operator. */ class fe extends ne {
     constructor(t, e) {
         super(t, "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return !(!Wt(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => jt(this.value.arrayValue, t)));
+        return !(!Kt(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => zt(this.value.arrayValue, t)));
     }
 }
 
@@ -2171,13 +2219,13 @@ function oe(t, e) {
  */
 /**
  * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
- */ class le {
+ */ class de {
     constructor(t, e = "asc" /* Direction.ASCENDING */) {
         this.field = t, this.dir = e;
     }
 }
 
-function fe(t, e) {
+function we(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
@@ -2200,18 +2248,18 @@ function fe(t, e) {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ class de {
+ */ class me {
     constructor(t) {
         this.timestamp = t;
     }
     static fromTimestamp(t) {
-        return new de(t);
+        return new me(t);
     }
     static min() {
-        return new de(new qt(0, 0));
+        return new me(new kt(0, 0));
     }
     static max() {
-        return new de(new qt(253402300799, 999999999));
+        return new me(new kt(253402300799, 999999999));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -2249,17 +2297,17 @@ function fe(t, e) {
  */
 // An immutable sorted map implementation, based on a Left-leaning Red-Black
 // tree.
-class we {
+class pe {
     constructor(t, e) {
-        this.comparator = t, this.root = e || pe.EMPTY;
+        this.comparator = t, this.root = e || ge.EMPTY;
     }
     // Returns a copy of the map, with the specified key/value added or replaced.
     insert(t, e) {
-        return new we(this.comparator, this.root.insert(t, e, this.comparator).copy(null, null, pe.BLACK, null, null));
+        return new pe(this.comparator, this.root.insert(t, e, this.comparator).copy(null, null, ge.BLACK, null, null));
     }
     // Returns a copy of the map, with the specified key removed.
     remove(t) {
-        return new we(this.comparator, this.root.remove(t, this.comparator).copy(null, null, pe.BLACK, null, null));
+        return new pe(this.comparator, this.root.remove(t, this.comparator).copy(null, null, ge.BLACK, null, null));
     }
     // Returns the value of the node with the given key, or null.
     get(t) {
@@ -2325,22 +2373,22 @@ class we {
     }
     // Returns an iterator over the SortedMap.
     getIterator() {
-        return new me(this.root, null, this.comparator, !1);
+        return new ye(this.root, null, this.comparator, !1);
     }
     getIteratorFrom(t) {
-        return new me(this.root, t, this.comparator, !1);
+        return new ye(this.root, t, this.comparator, !1);
     }
     getReverseIterator() {
-        return new me(this.root, null, this.comparator, !0);
+        return new ye(this.root, null, this.comparator, !0);
     }
     getReverseIteratorFrom(t) {
-        return new me(this.root, t, this.comparator, !0);
+        return new ye(this.root, t, this.comparator, !0);
     }
 }
 
  // end SortedMap
 // An iterator over an LLRBNode.
-class me {
+class ye {
     constructor(t, e, n, r) {
         this.isReverse = r, this.nodeStack = [];
         let s = 1;
@@ -2385,14 +2433,14 @@ class me {
 
  // end SortedMapIterator
 // Represents a node in a Left-leaning Red-Black tree.
-class pe {
+class ge {
     constructor(t, e, n, r, s) {
-        this.key = t, this.value = e, this.color = null != n ? n : pe.RED, this.left = null != r ? r : pe.EMPTY, 
-        this.right = null != s ? s : pe.EMPTY, this.size = this.left.size + 1 + this.right.size;
+        this.key = t, this.value = e, this.color = null != n ? n : ge.RED, this.left = null != r ? r : ge.EMPTY, 
+        this.right = null != s ? s : ge.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 pe(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 ge(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;
@@ -2431,7 +2479,7 @@ class pe {
         r.fixUp();
     }
     removeMin() {
-        if (this.left.isEmpty()) return pe.EMPTY;
+        if (this.left.isEmpty()) return ge.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();
@@ -2443,7 +2491,7 @@ class pe {
         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 pe.EMPTY;
+                if (r.right.isEmpty()) return ge.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));
@@ -2469,11 +2517,11 @@ class pe {
         return t.left.left.isRed() && (t = t.rotateRight(), t = t.colorFlip()), t;
     }
     rotateLeft() {
-        const t = this.copy(null, null, pe.RED, null, this.right.left);
+        const t = this.copy(null, null, ge.RED, null, this.right.left);
         return this.right.copy(null, null, this.color, t, null);
     }
     rotateRight() {
-        const t = this.copy(null, null, pe.RED, this.left.right, null);
+        const t = this.copy(null, null, ge.RED, this.left.right, null);
         return this.left.copy(null, null, this.color, null, t);
     }
     colorFlip() {
@@ -2499,10 +2547,10 @@ class pe {
  // end LLRBNode
 // Empty node is shared between all LLRB trees.
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
-pe.EMPTY = null, pe.RED = !0, pe.BLACK = !1;
+ge.EMPTY = null, ge.RED = !0, ge.BLACK = !1;
 
 // end LLRBEmptyNode
-pe.EMPTY = new 
+ge.EMPTY = new 
 // Represents an empty node (a leaf node in the Red-Black Tree).
 class {
     constructor() {
@@ -2529,7 +2577,7 @@ class {
     }
     // Returns a copy of the tree, with the specified key/value added.
     insert(t, e, n) {
-        return new pe(t, e);
+        return new ge(t, e);
     }
     // Returns a copy of the tree, with the specified key removed.
     remove(t, e) {
@@ -2585,9 +2633,9 @@ class {
  * NOTE: if provided comparator returns 0 for two elements, we consider them to
  * be equal!
  */
-class ye {
+class _e {
     constructor(t) {
-        this.comparator = t, this.data = new we(this.comparator);
+        this.comparator = t, this.data = new pe(this.comparator);
     }
     has(t) {
         return null !== this.data.get(t);
@@ -2628,10 +2676,10 @@ class ye {
         return e.hasNext() ? e.getNext().key : null;
     }
     getIterator() {
-        return new ge(this.data.getIterator());
+        return new ve(this.data.getIterator());
     }
     getIteratorFrom(t) {
-        return new ge(this.data.getIteratorFrom(t));
+        return new ve(this.data.getIteratorFrom(t));
     }
     /** Inserts or updates an element */    add(t) {
         return this.copy(this.data.remove(t).insert(t, !0));
@@ -2650,7 +2698,7 @@ class ye {
         })), e;
     }
     isEqual(t) {
-        if (!(t instanceof ye)) return !1;
+        if (!(t instanceof _e)) return !1;
         if (this.size !== t.size) return !1;
         const e = this.data.getIterator(), n = t.data.getIterator();
         for (;e.hasNext(); ) {
@@ -2670,12 +2718,12 @@ class ye {
         return this.forEach((e => t.push(e))), "SortedSet(" + t.toString() + ")";
     }
     copy(t) {
-        const e = new ye(this.comparator);
+        const e = new _e(this.comparator);
         return e.data = t, e;
     }
 }
 
-class ge {
+class ve {
     constructor(t) {
         this.iter = t;
     }
@@ -2712,7 +2760,7 @@ class ge {
  *   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 _e {
+ */ class be {
     constructor(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
@@ -2720,16 +2768,16 @@ class ge {
         t.sort(st.comparator);
     }
     static empty() {
-        return new _e([]);
+        return new be([]);
     }
     /**
      * 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 ye(st.comparator);
+        let e = new _e(st.comparator);
         for (const t of this.fields) e = e.add(t);
         for (const n of t) e = e.add(n);
-        return new _e(e.toArray());
+        return new be(e.toArray());
     }
     /**
      * Verifies that `fieldPath` is included by at least one field in this field
@@ -2741,7 +2789,7 @@ class ge {
         return !1;
     }
     isEqual(t) {
-        return Tt(this.fields, t.fields, ((t, e) => t.isEqual(e)));
+        return Pt(this.fields, t.fields, ((t, e) => t.isEqual(e)));
     }
 }
 
@@ -2764,12 +2812,12 @@ class ge {
 /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ class ve {
+ */ class Ee {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new ve({
+        return new Ee({
             mapValue: {}
         });
     }
@@ -2783,7 +2831,7 @@ class ge {
         {
             let e = this.value;
             for (let n = 0; n < t.length - 1; ++n) if (e = (e.mapValue.fields || {})[t.get(n)], 
-            !Yt(e)) return null;
+            !Zt(e)) return null;
             return e = (e.mapValue.fields || {})[t.lastSegment()], e || null;
         }
     }
@@ -2793,7 +2841,7 @@ class ge {
      * @param path - The field path to set.
      * @param value - The value to set.
      */    set(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Ht(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Jt(e);
     }
     /**
      * Sets the provided fields to the provided values.
@@ -2807,7 +2855,7 @@ class ge {
                 const t = this.getFieldsMap(e);
                 this.applyChanges(t, n, r), n = {}, r = [], e = s.popLast();
             }
-            t ? n[s.lastSegment()] = Ht(t) : r.push(s.lastSegment());
+            t ? n[s.lastSegment()] = Jt(t) : r.push(s.lastSegment());
         }));
         const s = this.getFieldsMap(e);
         this.applyChanges(s, n, r);
@@ -2819,10 +2867,10 @@ class ge {
      * @param path - The field path to remove.
      */    delete(t) {
         const e = this.field(t.popLast());
-        Yt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        Zt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }
     isEqual(t) {
-        return Ut(this.value, t.value);
+        return Bt(this.value, t.value);
     }
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -2834,7 +2882,7 @@ class ge {
         });
         for (let n = 0; n < t.length; ++n) {
             let r = e.mapValue.fields[t.get(n)];
-            Yt(r) && r.mapValue.fields || (r = {
+            Zt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -2846,11 +2894,11 @@ class ge {
      * Modifies `fieldsMap` by adding, replacing or deleting the specified
      * entries.
      */    applyChanges(t, e, n) {
-        Pt(e, ((e, n) => t[e] = n));
+        $t(e, ((e, n) => t[e] = n));
         for (const e of n) delete t[e];
     }
     clone() {
-        return new ve(Ht(this.value));
+        return new Ee(Jt(this.value));
     }
 }
 
@@ -2879,7 +2927,7 @@ class ge {
  * 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 be {
+ */ class Ae {
     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;
@@ -2888,35 +2936,35 @@ class ge {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new be(t, 0 /* DocumentType.INVALID */ , 
-        /* version */ de.min(), 
-        /* readTime */ de.min(), 
-        /* createTime */ de.min(), ve.empty(), 0 /* DocumentState.SYNCED */);
+        return new Ae(t, 0 /* DocumentType.INVALID */ , 
+        /* version */ me.min(), 
+        /* readTime */ me.min(), 
+        /* createTime */ me.min(), Ee.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 be(t, 1 /* DocumentType.FOUND_DOCUMENT */ , 
+        return new Ae(t, 1 /* DocumentType.FOUND_DOCUMENT */ , 
         /* version */ e, 
-        /* readTime */ de.min(), 
+        /* readTime */ me.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 be(t, 2 /* DocumentType.NO_DOCUMENT */ , 
+        return new Ae(t, 2 /* DocumentType.NO_DOCUMENT */ , 
         /* version */ e, 
-        /* readTime */ de.min(), 
-        /* createTime */ de.min(), ve.empty(), 0 /* DocumentState.SYNCED */);
+        /* readTime */ me.min(), 
+        /* createTime */ me.min(), Ee.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 be(t, 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
+        return new Ae(t, 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
         /* version */ e, 
-        /* readTime */ de.min(), 
-        /* createTime */ de.min(), ve.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
+        /* readTime */ me.min(), 
+        /* createTime */ me.min(), Ee.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2927,7 +2975,7 @@ class ge {
         // 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(de.min()) || 2 /* DocumentType.NO_DOCUMENT */ !== this.documentType && 0 /* DocumentType.INVALID */ !== this.documentType || (this.createTime = t), 
+        return !this.createTime.isEqual(me.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;
     }
@@ -2936,7 +2984,7 @@ class ge {
      * version.
      */    convertToNoDocument(t) {
         return this.version = t, this.documentType = 2 /* DocumentType.NO_DOCUMENT */ , 
-        this.data = ve.empty(), this.documentState = 0 /* DocumentState.SYNCED */ , this;
+        this.data = Ee.empty(), this.documentState = 0 /* DocumentState.SYNCED */ , this;
     }
     /**
      * Changes the document type to indicate that it exists at a given version but
@@ -2944,14 +2992,14 @@ class ge {
      * base document).
      */    convertToUnknownDocument(t) {
         return this.version = t, this.documentType = 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
-        this.data = ve.empty(), this.documentState = 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ , 
+        this.data = Ee.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 = de.min(), 
+        return this.documentState = 1 /* DocumentState.HAS_LOCAL_MUTATIONS */ , this.version = me.min(), 
         this;
     }
     setReadTime(t) {
@@ -2979,10 +3027,10 @@ class ge {
         return 3 /* DocumentType.UNKNOWN_DOCUMENT */ === this.documentType;
     }
     isEqual(t) {
-        return t instanceof be && 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 Ae && 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 be(this.key, this.documentType, this.version, this.readTime, this.createTime, this.data.clone(), this.documentState);
+        return new Ae(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}})`;
@@ -3006,7 +3054,7 @@ class ge {
  * limitations under the License.
  */
 // Visible for testing
-class Ee {
+class Ie {
     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.O = null;
@@ -3020,8 +3068,8 @@ class Ee {
  * NOTE: you should always construct `Target` from `Query.toTarget` instead of
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
- */ function Ae(t, e = null, n = [], r = [], s = null, i = null, o = null) {
-    return new Ee(t, e, n, r, s, i, o);
+ */ function Te(t, e = null, n = [], r = [], s = null, i = null, o = null) {
+    return new Ie(t, e, n, r, s, i, o);
 }
 
 /**
@@ -3047,7 +3095,7 @@ class Ee {
  *
  * Visible for testing.
  */
-class Ie {
+class Re {
     /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -3060,11 +3108,11 @@ class Ie {
     }
 }
 
-/** Creates a new Query for a query that matches all documents at `path` */ function Te(t) {
+/** Creates a new Query for a query that matches all documents at `path` */ function Pe(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function Re(t) {
+function Ve(t) {
     for (const e of t.filters) {
         const t = e.getFirstInequalityField();
         if (null !== t) return t;
@@ -3080,7 +3128,7 @@ function Re(t) {
  * Returns whether the query matches a collection group rather than a specific
  * collection.
  */
-function Pe(t) {
+function $e(t) {
     return null !== t.collectionGroup;
 }
 
@@ -3088,23 +3136,23 @@ function Pe(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 Ve(t) {
+ */ function Ne(t) {
     const e = T(t);
     if (null === e.k) {
         e.k = [];
-        const t = Re(e), n = Te(e);
+        const t = Ve(e), n = Pe(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.k.push(new le(t)), e.k.push(new le(st.keyField(), "asc" /* Direction.ASCENDING */)); else {
+        t.isKeyField() || e.k.push(new de(t)), e.k.push(new de(st.keyField(), "asc" /* Direction.ASCENDING */)); else {
             let t = !1;
             for (const n of e.explicitOrderBy) e.k.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.k.push(new le(st.keyField(), t));
+                e.k.push(new de(st.keyField(), t));
             }
         }
     }
@@ -3113,38 +3161,38 @@ function Pe(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function $e(t) {
+ */ function De(t) {
     const e = T(t);
-    if (!e.C) if ("F" /* LimitType.First */ === e.limitType) e.C = Ae(e.path, e.collectionGroup, Ve(e), e.filters, e.limit, e.startAt, e.endAt); else {
+    if (!e.C) if ("F" /* LimitType.First */ === e.limitType) e.C = Te(e.path, e.collectionGroup, Ne(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 Ve(e)) {
+        for (const n of Ne(e)) {
             const e = "desc" /* Direction.DESCENDING */ === n.dir ? "asc" /* Direction.ASCENDING */ : "desc" /* Direction.DESCENDING */;
-            t.push(new le(n.field, e));
+            t.push(new de(n.field, e));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                const n = e.endAt ? new Zt(e.endAt.position, e.endAt.inclusive) : null, r = e.startAt ? new Zt(e.startAt.position, e.startAt.inclusive) : null;
+                const n = e.endAt ? new Xt(e.endAt.position, e.endAt.inclusive) : null, r = e.startAt ? new Xt(e.startAt.position, e.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
-        e.C = Ae(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
+        e.C = Te(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
     }
     return e.C;
 }
 
-function Ne(t, e) {
-    e.getFirstInequalityField(), Re(t);
+function Fe(t, e) {
+    e.getFirstInequalityField(), Ve(t);
     const n = t.filters.concat([ e ]);
-    return new Ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+    return new Re(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
 }
 
-function De(t, e) {
+function xe(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 (!fe(t.orderBy[n], e.orderBy[n])) return !1;
+        for (let n = 0; n < t.orderBy.length; n++) if (!we(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 (!ne(t.filters[n], e.filters[n])) return !1;
-        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!Jt(t.startAt, e.startAt) && Jt(t.endAt, e.endAt);
-    }($e(t), $e(e)) && t.limitType === e.limitType;
+        for (let n = 0; n < t.filters.length; n++) if (!se(t.filters[n], e.filters[n])) return !1;
+        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!te(t.startAt, e.startAt) && te(t.endAt, e.endAt);
+    }(De(t), De(e)) && t.limitType === e.limitType;
 }
 
 /**
@@ -3172,9 +3220,9 @@ function De(t, e) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function Fe(t, e) {
+function Se(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) && !mt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
     /**
  * Returns an IntegerValue for `value`.
@@ -3196,7 +3244,7 @@ function Fe(t, e) {
             };
         }
         return {
-            doubleValue: dt(e) ? "-0" : e
+            doubleValue: mt(e) ? "-0" : e
         };
     }(t, e);
 }
@@ -3217,7 +3265,7 @@ function Fe(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Used to represent a field transform on a mutation. */ class xe {
+/** Used to represent a field transform on a mutation. */ class qe {
     constructor() {
         // Make sure that the structural type of `TransformOperation` is unique.
         // See https://github.com/microsoft/TypeScript/issues/5451
@@ -3225,15 +3273,15 @@ function Fe(t, e) {
     }
 }
 
-/** Transforms a value into a server-generated timestamp. */ class Se extends xe {}
+/** Transforms a value into a server-generated timestamp. */ class Oe extends qe {}
 
-/** Transforms an array value via a union operation. */ class qe extends xe {
+/** Transforms an array value via a union operation. */ class ke extends qe {
     constructor(t) {
         super(), this.elements = t;
     }
 }
 
-/** Transforms an array value via a remove operation. */ class Oe extends xe {
+/** Transforms an array value via a remove operation. */ class Ce extends qe {
     constructor(t) {
         super(), this.elements = t;
     }
@@ -3244,7 +3292,7 @@ function Fe(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 ke extends xe {
+ */ class Le extends qe {
     constructor(t, e) {
         super(), this.M = t, this.U = e;
     }
@@ -3266,7 +3314,7 @@ function Fe(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 Ce {
+/** A field path and the TransformOperation to perform upon it. */ class Me {
     constructor(t, e) {
         this.field = t, this.transform = e;
     }
@@ -3276,18 +3324,18 @@ function Fe(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 Le {
+ */ class Ue {
     constructor(t, e) {
         this.updateTime = t, this.exists = e;
     }
     /** Creates a new empty Precondition. */    static none() {
-        return new Le;
+        return new Ue;
     }
     /** Creates a new Precondition with an exists flag. */    static exists(t) {
-        return new Le(void 0, t);
+        return new Ue(void 0, t);
     }
     /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {
-        return new Le(t);
+        return new Ue(t);
     }
     /** Returns whether this Precondition is empty. */    get isNone() {
         return void 0 === this.updateTime && void 0 === this.exists;
@@ -3340,12 +3388,12 @@ function Fe(t, e) {
  * applyToLocalView() to implement the actual behavior of applying the mutation
  * to some source document (see `setMutationApplyToRemoteDocument()` for an
  * example).
- */ class Me {}
+ */ class je {}
 
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class Ue extends Me {
+ */ class Be extends je {
     constructor(t, e, n, r = []) {
         super(), this.key = t, this.value = e, this.precondition = n, this.fieldTransforms = r, 
         this.type = 0 /* MutationType.Set */;
@@ -3367,7 +3415,7 @@ function Fe(t, e) {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ class je extends Me {
+ */ class ze extends je {
     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 */;
@@ -3377,7 +3425,7 @@ function Fe(t, e) {
     }
 }
 
-/** A mutation that deletes the document at the given key. */ class Be extends Me {
+/** A mutation that deletes the document at the given key. */ class Qe extends je {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 2 /* MutationType.Delete */ , 
         this.fieldTransforms = [];
@@ -3393,7 +3441,7 @@ function Fe(t, e) {
  *
  * The `verify` operation is only used in Transactions, and this class serves
  * primarily to facilitate serialization into protos.
- */ class ze extends Me {
+ */ class We extends je {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 3 /* MutationType.Verify */ , 
         this.fieldTransforms = [];
@@ -3418,13 +3466,13 @@ function Fe(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 Qe = (() => {
+ */ const Ge = (() => {
     const t = {
         asc: "ASCENDING",
         desc: "DESCENDING"
     };
     return t;
-})(), We = (() => {
+})(), Ke = (() => {
     const t = {
         "<": "LESS_THAN",
         "<=": "LESS_THAN_OR_EQUAL",
@@ -3438,7 +3486,7 @@ function Fe(t, e) {
         "array-contains-any": "ARRAY_CONTAINS_ANY"
     };
     return t;
-})(), Ge = (() => {
+})(), Ye = (() => {
     const t = {
         and: "AND",
         or: "OR"
@@ -3460,7 +3508,7 @@ function Fe(t, e) {
  * TODO(klimt): We can remove the databaseId argument if we keep the full
  * resource name in documents.
  */
-class Ke {
+class He {
     constructor(t, e) {
         this.databaseId = t, this.L = e;
     }
@@ -3477,7 +3525,7 @@ class Ke {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Ye(t, e) {
+function Ze(t, e) {
     if (t.L) {
         return `${new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + e.nanoseconds).slice(-9)}Z`;
     }
@@ -3492,35 +3540,35 @@ function Ye(t, e) {
  *
  * Visible for testing.
  */
-function He(t, e) {
+function Je(t, e) {
     return t.L ? e.toBase64() : e.toUint8Array();
 }
 
-function Ze(t, e) {
-    return Ye(t, e.toTimestamp());
+function Xe(t, e) {
+    return Ze(t, e.toTimestamp());
 }
 
-function Je(t) {
-    return I(!!t), de.fromTimestamp(function(t) {
-        const e = Ft(t);
-        return new qt(e.seconds, e.nanos);
+function tn(t) {
+    return I(!!t), me.fromTimestamp(function(t) {
+        const e = St(t);
+        return new kt(e.seconds, e.nanos);
     }(t));
 }
 
-function Xe(t, e) {
+function en(t, e) {
     return function(t) {
         return new nt([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
-function tn(t, e) {
-    return Xe(t.databaseId, e.path);
+function nn(t, e) {
+    return en(t.databaseId, e.path);
 }
 
-function en(t, e) {
+function rn(t, e) {
     const n = function(t) {
         const e = nt.fromString(t);
-        return I(mn(e)), e;
+        return I(yn(e)), e;
     }(e);
     if (n.get(1) !== t.databaseId.projectId) throw new B($, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
     if (n.get(3) !== t.databaseId.database) throw new B($, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
@@ -3528,98 +3576,98 @@ function en(t, e) {
     var r;
     /** Creates a Document proto from key and fields (but no create/update time) */}
 
-function nn(t, e) {
-    return Xe(t.databaseId, e);
+function sn(t, e) {
+    return en(t.databaseId, e);
 }
 
-function rn(t) {
+function on(t) {
     return new nt([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function sn(t, e, n) {
+function un(t, e, n) {
     return {
-        name: tn(t, e),
+        name: nn(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function on(t, e) {
+function cn(t, e) {
     return "found" in e ? function(t, e) {
         I(!!e.found), e.found.name, e.found.updateTime;
-        const n = en(t, e.found.name), r = Je(e.found.updateTime), s = e.found.createTime ? Je(e.found.createTime) : de.min(), i = new ve({
+        const n = rn(t, e.found.name), r = tn(e.found.updateTime), s = e.found.createTime ? tn(e.found.createTime) : me.min(), i = new Ee({
             mapValue: {
                 fields: e.found.fields
             }
         });
-        return be.newFoundDocument(n, r, s, i);
+        return Ae.newFoundDocument(n, r, s, i);
     }(t, e) : "missing" in e ? function(t, e) {
         I(!!e.missing), I(!!e.readTime);
-        const n = en(t, e.missing), r = Je(e.readTime);
-        return be.newNoDocument(n, r);
+        const n = rn(t, e.missing), r = tn(e.readTime);
+        return Ae.newNoDocument(n, r);
     }(t, e) : A();
 }
 
-function un(t, e) {
+function an(t, e) {
     let n;
-    if (e instanceof Ue) n = {
-        update: sn(t, e.key, e.value)
-    }; else if (e instanceof Be) n = {
-        delete: tn(t, e.key)
-    }; else if (e instanceof je) n = {
-        update: sn(t, e.key, e.data),
-        updateMask: wn(e.fieldMask)
+    if (e instanceof Be) n = {
+        update: un(t, e.key, e.value)
+    }; else if (e instanceof Qe) n = {
+        delete: nn(t, e.key)
+    }; else if (e instanceof ze) n = {
+        update: un(t, e.key, e.data),
+        updateMask: pn(e.fieldMask)
     }; else {
-        if (!(e instanceof ze)) return A();
+        if (!(e instanceof We)) return A();
         n = {
-            verify: tn(t, e.key)
+            verify: nn(t, e.key)
         };
     }
     return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((t => function(t, e) {
         const n = e.transform;
-        if (n instanceof Se) return {
+        if (n instanceof Oe) return {
             fieldPath: e.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
-        if (n instanceof qe) return {
+        if (n instanceof ke) return {
             fieldPath: e.field.canonicalString(),
             appendMissingElements: {
                 values: n.elements
             }
         };
-        if (n instanceof Oe) return {
+        if (n instanceof Ce) return {
             fieldPath: e.field.canonicalString(),
             removeAllFromArray: {
                 values: n.elements
             }
         };
-        if (n instanceof ke) return {
+        if (n instanceof Le) return {
             fieldPath: e.field.canonicalString(),
             increment: n.U
         };
         throw A();
     }(0, t)))), e.precondition.isNone || (n.currentDocument = function(t, e) {
         return void 0 !== e.updateTime ? {
-            updateTime: Ze(t, e.updateTime)
+            updateTime: Xe(t, e.updateTime)
         } : void 0 !== e.exists ? {
             exists: e.exists
         } : A();
     }(t, e.precondition)), n;
 }
 
-function cn(t, e) {
+function hn(t, e) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const n = {
         structuredQuery: {}
     }, r = e.path;
-    null !== e.collectionGroup ? (n.parent = nn(t, r), n.structuredQuery.from = [ {
+    null !== e.collectionGroup ? (n.parent = sn(t, r), n.structuredQuery.from = [ {
         collectionId: e.collectionGroup,
         allDescendants: !0
-    } ]) : (n.parent = nn(t, r.popLast()), n.structuredQuery.from = [ {
+    } ]) : (n.parent = sn(t, r.popLast()), n.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     const s = function(t) {
         if (0 === t.length) return;
-        return dn(ee.create(t, "and" /* CompositeOperator.AND */));
+        return mn(re.create(t, "and" /* CompositeOperator.AND */));
     }(e.filters);
     s && (n.structuredQuery.where = s);
     const i = function(t) {
@@ -3628,8 +3676,8 @@ function cn(t, e) {
         // visible for testing
         function(t) {
             return {
-                field: fn(t.field),
-                direction: an(t.dir)
+                field: wn(t.field),
+                direction: ln(t.dir)
             };
         }
         // visible for testing
@@ -3637,7 +3685,7 @@ function cn(t, e) {
     }(e.orderBy);
     i && (n.structuredQuery.orderBy = i);
     const o = function(t, e) {
-        return t.L || ft(e) ? e : {
+        return t.L || wt(e) ? e : {
             value: e
         };
     }(t, e.limit);
@@ -3655,81 +3703,81 @@ function cn(t, e) {
     (e.endAt)), n;
 }
 
-function an(t) {
-    return Qe[t];
+function ln(t) {
+    return Ge[t];
 }
 
 // visible for testing
-function hn(t) {
-    return We[t];
+function fn(t) {
+    return Ke[t];
 }
 
-function ln(t) {
-    return Ge[t];
+function dn(t) {
+    return Ye[t];
 }
 
-function fn(t) {
+function wn(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function dn(t) {
-    return t instanceof te ? function(t) {
+function mn(t) {
+    return t instanceof ne ? function(t) {
         if ("==" /* Operator.EQUAL */ === t.op) {
-            if (Kt(t.value)) return {
+            if (Ht(t.value)) return {
                 unaryFilter: {
-                    field: fn(t.field),
+                    field: wn(t.field),
                     op: "IS_NAN"
                 }
             };
-            if (Gt(t.value)) return {
+            if (Yt(t.value)) return {
                 unaryFilter: {
-                    field: fn(t.field),
+                    field: wn(t.field),
                     op: "IS_NULL"
                 }
             };
         } else if ("!=" /* Operator.NOT_EQUAL */ === t.op) {
-            if (Kt(t.value)) return {
+            if (Ht(t.value)) return {
                 unaryFilter: {
-                    field: fn(t.field),
+                    field: wn(t.field),
                     op: "IS_NOT_NAN"
                 }
             };
-            if (Gt(t.value)) return {
+            if (Yt(t.value)) return {
                 unaryFilter: {
-                    field: fn(t.field),
+                    field: wn(t.field),
                     op: "IS_NOT_NULL"
                 }
             };
         }
         return {
             fieldFilter: {
-                field: fn(t.field),
-                op: hn(t.op),
+                field: wn(t.field),
+                op: fn(t.op),
                 value: t.value
             }
         };
-    }(t) : t instanceof ee ? function(t) {
-        const e = t.getFilters().map((t => dn(t)));
+    }(t) : t instanceof re ? function(t) {
+        const e = t.getFilters().map((t => mn(t)));
         if (1 === e.length) return e[0];
         return {
             compositeFilter: {
-                op: ln(t.op),
+                op: dn(t.op),
                 filters: e
             }
         };
     }(t) : A();
 }
 
-function wn(t) {
+function pn(t) {
     const e = [];
     return t.fields.forEach((t => e.push(t.canonicalString()))), {
         fieldPaths: e
     };
 }
 
-function mn(t) {
+function yn(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -3749,8 +3797,8 @@ function mn(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 pn(t) {
-    return new Ke(t, /* useProto3Json= */ !0);
+ */ function gn(t) {
+    return new He(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -3778,7 +3826,7 @@ function mn(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class yn {
+class _n {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3876,7 +3924,7 @@ class yn {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class gn extends class {} {
+class vn extends class {} {
     constructor(t, e, n, r) {
         super(), this.authCredentials = t, this.appCheckCredentials = e, this.connection = n, 
         this.M = r, this.et = !1;
@@ -3903,19 +3951,19 @@ class gn extends class {} {
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function _n(t, e) {
-    const n = T(t), r = rn(n.M) + "/documents", s = {
-        writes: e.map((t => un(n.M, t)))
+async function bn(t, e) {
+    const n = T(t), r = on(n.M) + "/documents", s = {
+        writes: e.map((t => an(n.M, t)))
     };
     await n.A("Commit", r, s);
 }
 
-async function vn(t, e) {
-    const n = T(t), r = rn(n.M) + "/documents", s = {
-        documents: e.map((t => tn(n.M, t)))
+async function En(t, e) {
+    const n = T(t), r = on(n.M) + "/documents", s = {
+        documents: e.map((t => nn(n.M, t)))
     }, i = await n.P("BatchGetDocuments", r, s, e.length), o = new Map;
     i.forEach((t => {
-        const e = on(n.M, t);
+        const e = cn(n.M, t);
         o.set(e.key.toString(), e);
     }));
     const u = [];
@@ -3925,23 +3973,23 @@ async function vn(t, e) {
     })), u;
 }
 
-async function bn(t, e) {
-    const n = T(t), r = cn(n.M, $e(e));
+async function An(t, e) {
+    const n = T(t), r = hn(n.M, De(e));
     return (await n.P("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, e, n) {
-        const r = en(t, e.name), s = Je(e.updateTime), i = e.createTime ? Je(e.createTime) : de.min(), o = new ve({
+        const r = rn(t, e.name), s = tn(e.updateTime), i = e.createTime ? tn(e.createTime) : me.min(), o = new Ee({
             mapValue: {
                 fields: e.fields
             }
-        }), u = be.newFoundDocument(r, s, i, o);
+        }), u = Ae.newFoundDocument(r, s, i, o);
         return n && u.setHasCommittedMutations(), n ? u.setHasCommittedMutations() : u;
     }(n.M, t.document, void 0)));
 }
 
-async function En(t, e, n) {
+async function In(t, e, n) {
     const r = T(t), s = function(t, e, n) {
-        const r = cn(t, e), s = [];
+        const r = hn(t, e), s = [];
         return n.forEach((t => {
             "count" === t.D ? s.push({
                 alias: t.alias.canonicalString(),
@@ -3949,12 +3997,12 @@ async function En(t, e, n) {
             }) : "avg" === t.D ? s.push({
                 alias: t.alias.canonicalString(),
                 avg: {
-                    field: fn(t.fieldPath)
+                    field: wn(t.fieldPath)
                 }
             }) : "sum" === t.D && s.push({
                 alias: t.alias.canonicalString(),
                 sum: {
-                    field: fn(t.fieldPath)
+                    field: wn(t.fieldPath)
                 }
             });
         })), {
@@ -3964,11 +4012,11 @@ async function En(t, e, n) {
             },
             parent: r.parent
         };
-    }(r.M, $e(e), n), i = s.parent;
+    }(r.M, De(e), n), i = s.parent;
     r.connection.v || delete s.parent;
     const o = (await r.P("RunAggregationQuery", i, s, /*expectedResponseCount=*/ 1)).filter((t => !!t.result));
     // Omit RunAggregationQueryResponse that only contain readTimes.
-        return I(1 === o.length), (u = o[0]).result, u.result.aggregateFields, new ve({
+        return I(1 === o.length), (u = o[0]).result, u.result.aggregateFields, new Ee({
         mapValue: {
             fields: null === (c = u.result) || void 0 === c ? void 0 : c.aggregateFields
         }
@@ -3991,7 +4039,7 @@ async function En(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 An = new Map;
+ */ const Tn = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -4002,17 +4050,17 @@ async function En(t, e, n) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function In(t) {
+function Rn(t) {
     if (t._terminated) throw new B(O, "The client has already been terminated.");
-    if (!An.has(t)) {
+    if (!Tn.has(t)) {
         _("ComponentProvider", "Initializing Datastore");
         const i = function(t) {
-            return new gt(t, fetch.bind(null));
+            return new vt(t, fetch.bind(null));
         }((e = t._databaseId, n = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
-        new X(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = pn(t._databaseId), u = function(t, e, n, r) {
-            return new gn(t, e, n, r);
+        new X(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = gn(t._databaseId), u = function(t, e, n, r) {
+            return new vn(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, i, o);
-        An.set(t, u);
+        Tn.set(t, u);
     }
     var e, n, r, s;
     /**
@@ -4030,7 +4078,7 @@ function In(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 An.get(t);
+ */    return Tn.get(t);
 }
 
 /**
@@ -4042,7 +4090,7 @@ function In(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 Tn {
+class Pn {
     constructor(t) {
         var e;
         if (void 0 === t.host) {
@@ -4084,7 +4132,7 @@ class Tn {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link (getFirestore:1)}.
- */ class Rn {
+ */ class Vn {
     /** @hideconstructor */
     constructor(t, e, n, r) {
         this._authCredentials = t, this._appCheckCredentials = e, this._databaseId = n, 
@@ -4092,7 +4140,7 @@ class Tn {
         /**
          * Whether it's a Firestore or Firestore Lite instance.
          */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new Tn({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new Pn({}), 
         this._settingsFrozen = !1;
     }
     /**
@@ -4110,7 +4158,7 @@ class Tn {
     }
     _setSettings(t) {
         if (this._settingsFrozen) throw new B(O, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
-        this._settings = new Tn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new Pn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new W;
             switch (t.type) {
               case "gapi":
@@ -4149,13 +4197,13 @@ class Tn {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const e = An.get(t);
-            e && (_("ComponentProvider", "Removing Datastore"), An.delete(t), e.terminate());
+            const e = Tn.get(t);
+            e && (_("ComponentProvider", "Removing Datastore"), Tn.delete(t), e.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function Pn(t, e, n) {
+function $n(t, e, n) {
     n || (n = "(default)");
     const r = _getProvider(t, "firestore/lite");
     if (r.isInitialized(n)) throw new B(O, "Firestore can only be initialized once per app.");
@@ -4165,13 +4213,13 @@ function Pn(t, e, n) {
     });
 }
 
-function Vn(e, n) {
+function Nn(e, n) {
     const r = "object" == typeof e ? e : t(), s = "string" == typeof e ? e : n || "(default)", i = _getProvider(r, "firestore/lite").getImmediate({
         identifier: s
     });
     if (!i._initialized) {
         const t = l("firestore");
-        t && $n(i, ...t);
+        t && Dn(i, ...t);
     }
     return i;
 }
@@ -4188,9 +4236,9 @@ function Vn(e, n) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function $n(t, e, n, r = {}) {
+ */ function Dn(t, e, n, r = {}) {
     var s;
-    const i = (t = ht(t, Rn))._getSettings();
+    const i = (t = ht(t, Vn))._getSettings();
     if ("firestore.googleapis.com" !== i.host && i.host !== e && b("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, i), {
         host: `${e}:${n}`,
@@ -4228,8 +4276,8 @@ function Vn(e, n) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function Nn(t) {
-    return t = ht(t, Rn), e(t.app, "firestore/lite"), t._delete();
+ */ function Fn(t) {
+    return t = ht(t, Vn), e(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -4268,7 +4316,7 @@ function Vn(e, n) {
  * Represents an aggregation that can be performed by Firestore.
  */
 // eslint-disable-next-line @typescript-eslint/no-unused-vars
-class Dn {
+class xn {
     /**
      * Create a new AggregateField<T>
      * @param _aggregateType Specifies the type of aggregation operation to perform.
@@ -4286,7 +4334,7 @@ class Dn {
 
 /**
  * The results of executing an aggregation query.
- */ class Fn {
+ */ class Sn {
     /** @hideconstructor */
     constructor(t, e, n) {
         this._userDataWriter = e, this._data = n, 
@@ -4328,7 +4376,7 @@ class Dn {
  * A `DocumentReference` refers to a document location in a Firestore database
  * and can be used to write, read, or listen to the location. The document at
  * the referenced location may or may not exist.
- */ class xn {
+ */ class qn {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -4356,17 +4404,17 @@ class Dn {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new qn(this.firestore, this.converter, this._key.path.popLast());
+        return new kn(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new xn(this.firestore, t, this._key);
+        return new qn(this.firestore, t, this._key);
     }
 }
 
 /**
  * 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 Sn {
+ */ class On {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -4379,17 +4427,17 @@ class Dn {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new Sn(this.firestore, t, this._query);
+        return new On(this.firestore, t, this._query);
     }
 }
 
 /**
  * A `CollectionReference` object can be used for adding documents, getting
- * document references, and querying for documents (using {@link query}).
- */ class qn extends Sn {
+ * document references, and querying for documents (using {@link (query:1)}).
+ */ class kn extends On {
     /** @hideconstructor */
     constructor(t, e, n) {
-        super(t, e, new Ie(n)), this._path = n, 
+        super(t, e, new Re(n)), this._path = n, 
         /** The type of this Firestore reference. */
         this.type = "collection";
     }
@@ -4407,23 +4455,23 @@ class Dn {
      * subcollection. If this isn't a subcollection, the reference is null.
      */    get parent() {
         const t = this._path.popLast();
-        return t.isEmpty() ? null : new xn(this.firestore, 
+        return t.isEmpty() ? null : new qn(this.firestore, 
         /* converter= */ null, new it(t));
     }
     withConverter(t) {
-        return new qn(this.firestore, t, this._path);
+        return new kn(this.firestore, t, this._path);
     }
 }
 
-function On(t, e, ...n) {
-    if (t = d(t), ot("collection", "path", e), t instanceof Rn) {
+function Cn(t, e, ...n) {
+    if (t = d(t), ot("collection", "path", e), t instanceof Vn) {
         const r = nt.fromString(e, ...n);
-        return ct(r), new qn(t, /* converter= */ null, r);
+        return ct(r), new kn(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof xn || t instanceof qn)) throw new B($, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof qn || t instanceof kn)) throw new B($, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(nt.fromString(e, ...n));
-        return ct(r), new qn(t.firestore, 
+        return ct(r), new kn(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -4440,27 +4488,27 @@ function On(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 kn(t, e) {
-    if (t = ht(t, Rn), ot("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new B($, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new Sn(t, 
+ */ function Ln(t, e) {
+    if (t = ht(t, Vn), ot("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new B($, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new On(t, 
     /* converter= */ null, function(t) {
-        return new Ie(nt.emptyPath(), t);
+        return new Re(nt.emptyPath(), t);
     }(e));
 }
 
-function Cn(t, e, ...n) {
+function Mn(t, e, ...n) {
     if (t = d(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = At.F()), ot("doc", "path", e), t instanceof Rn) {
+    1 === arguments.length && (e = Tt.F()), ot("doc", "path", e), t instanceof Vn) {
         const r = nt.fromString(e, ...n);
-        return ut(r), new xn(t, 
+        return ut(r), new qn(t, 
         /* converter= */ null, new it(r));
     }
     {
-        if (!(t instanceof xn || t instanceof qn)) throw new B($, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof qn || t instanceof kn)) throw new B($, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(nt.fromString(e, ...n));
-        return ut(r), new xn(t.firestore, t instanceof qn ? t.converter : null, new it(r));
+        return ut(r), new qn(t.firestore, t instanceof kn ? t.converter : null, new it(r));
     }
 }
 
@@ -4471,8 +4519,8 @@ function Cn(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 Ln(t, e) {
-    return t = d(t), e = d(e), (t instanceof xn || t instanceof qn) && (e instanceof xn || e instanceof qn) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+ */ function Un(t, e) {
+    return t = d(t), e = d(e), (t instanceof qn || t instanceof kn) && (e instanceof qn || e instanceof kn) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -4483,8 +4531,8 @@ function Cn(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 Mn(t, e) {
-    return t = d(t), e = d(e), t instanceof Sn && e instanceof Sn && (t.firestore === e.firestore && De(t._query, e._query) && t.converter === e.converter);
+ */ function jn(t, e) {
+    return t = d(t), e = d(e), t instanceof On && e instanceof On && (t.firestore === e.firestore && xe(t._query, e._query) && t.converter === e.converter);
 }
 
 /**
@@ -4505,7 +4553,7 @@ function Cn(t, e, ...n) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class Un {
+ */ class Bn {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -4517,7 +4565,7 @@ function Cn(t, e, ...n) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new Un(Nt.fromBase64String(t));
+            return new Bn(Ft.fromBase64String(t));
         } catch (t) {
             throw new B($, "Failed to construct data from Base64 string: " + t);
         }
@@ -4527,7 +4575,7 @@ function Cn(t, e, ...n) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new Un(Nt.fromUint8Array(t));
+        return new Bn(Ft.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -4583,7 +4631,7 @@ function Cn(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 jn {
+ */ class zn {
     /**
      * 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.
@@ -4607,8 +4655,8 @@ function Cn(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 Bn() {
-    return new jn("__name__");
+ */ function Qn() {
+    return new zn("__name__");
 }
 
 /**
@@ -4630,7 +4678,7 @@ function Cn(t, e, ...n) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class zn {
+ */ class Wn {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -4662,7 +4710,7 @@ function Cn(t, e, ...n) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ class Qn {
+ */ class Gn {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -4702,7 +4750,7 @@ function Cn(t, e, ...n) {
      * Actually private to JS consumers of our API, so this function is prefixed
      * with an underscore.
      */    _compareTo(t) {
-        return It(this._lat, t._lat) || It(this._long, t._long);
+        return Rt(this._lat, t._lat) || Rt(this._long, t._long);
     }
 }
 
@@ -4721,29 +4769,29 @@ function Cn(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 Wn = /^__.*__$/;
+ */ const Kn = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class Gn {
+/** The result of parsing document data (e.g. for a setData call). */ class Yn {
     constructor(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return null !== this.fieldMask ? new je(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Ue(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new ze(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Be(t, this.data, e, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class Kn {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class Hn {
     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 je(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new ze(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }
 }
 
-function Yn(t) {
+function Zn(t) {
     switch (t) {
       case 0 /* UserDataSource.Set */ :
  // fall through
@@ -4761,7 +4809,7 @@ function Yn(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class Hn {
+/** A "context" object passed around while parsing user data. */ class Jn {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -4793,7 +4841,7 @@ function Yn(t) {
         return this.settings.st;
     }
     /** Returns a new context with the specified settings overwritten. */    it(t) {
-        return new Hn(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.M, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+        return new Jn(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.M, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
     ot(t) {
         var e;
@@ -4820,7 +4868,7 @@ function Yn(t) {
         });
     }
     lt(t) {
-        return pr(t, this.settings.methodName, this.settings.ft || !1, this.path, this.settings.dt);
+        return gr(t, this.settings.methodName, this.settings.ft || !1, this.path, this.settings.dt);
     }
     /** 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)));
@@ -4832,19 +4880,19 @@ function Yn(t) {
     }
     ct(t) {
         if (0 === t.length) throw this.lt("Document fields must not be empty");
-        if (Yn(this.st) && Wn.test(t)) throw this.lt('Document fields cannot begin and end with "__"');
+        if (Zn(this.st) && Kn.test(t)) throw this.lt('Document fields cannot begin and end with "__"');
     }
 }
 
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ class Zn {
+ */ class Xn {
     constructor(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.M = n || pn(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.M = n || gn(t);
     }
     /** Creates a new top-level parse context. */    wt(t, e, n, r = !1) {
-        return new Hn({
+        return new Jn({
             st: t,
             methodName: e,
             dt: n,
@@ -4855,29 +4903,29 @@ function Yn(t) {
     }
 }
 
-function Jn(t) {
-    const e = t._freezeSettings(), n = pn(t._databaseId);
-    return new Zn(t._databaseId, !!e.ignoreUndefinedProperties, n);
+function tr(t) {
+    const e = t._freezeSettings(), n = gn(t._databaseId);
+    return new Xn(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function Xn(t, e, n, r, s, i = {}) {
+/** Parse document data from a set() call. */ function er(t, e, n, r, s, i = {}) {
     const o = t.wt(i.merge || i.mergeFields ? 2 /* UserDataSource.MergeSet */ : 0 /* UserDataSource.Set */ , e, n, s);
-    fr("Data must be an object, but it was:", o, r);
-    const u = hr(r, o);
+    wr("Data must be an object, but it was:", o, r);
+    const u = fr(r, o);
     let c, a;
-    if (i.merge) c = new _e(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
+    if (i.merge) c = new be(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
         const t = [];
         for (const r of i.mergeFields) {
-            const s = dr(e, r, n);
+            const s = mr(e, r, n);
             if (!o.contains(s)) throw new B($, `Field '${s}' is specified in your field mask but missing from your input data.`);
-            yr(t, s) || t.push(s);
+            _r(t, s) || t.push(s);
         }
-        c = new _e(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
+        c = new be(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
     } else c = null, a = o.fieldTransforms;
-    return new Gn(new ve(u), c, a);
+    return new Yn(new Ee(u), c, a);
 }
 
-class tr extends zn {
+class nr extends Wn {
     _toFieldTransform(t) {
         if (2 /* UserDataSource.MergeSet */ !== t.st) throw 1 /* UserDataSource.Update */ === t.st ? t.lt(`${this._methodName}() can only appear at the top level of your update data`) : t.lt(`${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
@@ -4885,7 +4933,7 @@ class tr extends zn {
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof tr;
+        return t instanceof nr;
     }
 }
 
@@ -4904,8 +4952,8 @@ class tr extends zn {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function er(t, e, n) {
-    return new Hn({
+ */ function rr(t, e, n) {
+    return new Jn({
         st: 3 /* UserDataSource.Argument */ ,
         dt: e.settings.dt,
         methodName: t._methodName,
@@ -4913,23 +4961,23 @@ class tr extends zn {
     }, e.databaseId, e.M, e.ignoreUndefinedProperties);
 }
 
-class nr extends zn {
+class sr extends Wn {
     _toFieldTransform(t) {
-        return new Ce(t.path, new Se);
+        return new Me(t.path, new Oe);
     }
     isEqual(t) {
-        return t instanceof nr;
+        return t instanceof sr;
     }
 }
 
-class rr extends zn {
+class ir extends Wn {
     constructor(t, e) {
         super(t), this.yt = e;
     }
     _toFieldTransform(t) {
-        const e = er(this, t, 
-        /*array=*/ !0), n = this.yt.map((t => ar(t, e))), r = new qe(n);
-        return new Ce(t.path, r);
+        const e = rr(this, t, 
+        /*array=*/ !0), n = this.yt.map((t => lr(t, e))), r = new ke(n);
+        return new Me(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4937,14 +4985,14 @@ class rr extends zn {
     }
 }
 
-class sr extends zn {
+class or extends Wn {
     constructor(t, e) {
         super(t), this.yt = e;
     }
     _toFieldTransform(t) {
-        const e = er(this, t, 
-        /*array=*/ !0), n = this.yt.map((t => ar(t, e))), r = new Oe(n);
-        return new Ce(t.path, r);
+        const e = rr(this, t, 
+        /*array=*/ !0), n = this.yt.map((t => lr(t, e))), r = new Ce(n);
+        return new Me(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4952,13 +5000,13 @@ class sr extends zn {
     }
 }
 
-class ir extends zn {
+class ur extends Wn {
     constructor(t, e) {
         super(t), this.gt = e;
     }
     _toFieldTransform(t) {
-        const e = new ke(t.M, Fe(t.M, this.gt));
-        return new Ce(t.path, e);
+        const e = new Le(t.M, Se(t.M, this.gt));
+        return new Me(t.path, e);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4966,50 +5014,50 @@ class ir extends zn {
     }
 }
 
-/** Parse update data from an update() call. */ function or(t, e, n, r) {
+/** Parse update data from an update() call. */ function cr(t, e, n, r) {
     const s = t.wt(1 /* UserDataSource.Update */ , e, n);
-    fr("Data must be an object, but it was:", s, r);
-    const i = [], o = ve.empty();
-    Pt(r, ((t, r) => {
-        const u = mr(e, t, n);
+    wr("Data must be an object, but it was:", s, r);
+    const i = [], o = Ee.empty();
+    $t(r, ((t, r) => {
+        const u = yr(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = d(r);
         const c = s.at(u);
-        if (r instanceof tr) 
+        if (r instanceof nr) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = ar(r, c);
+            const t = lr(r, c);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
-    const u = new _e(i);
-    return new Kn(o, u, s.fieldTransforms);
+    const u = new be(i);
+    return new Hn(o, u, s.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function ur(t, e, n, r, s, i) {
-    const o = t.wt(1 /* UserDataSource.Update */ , e, n), u = [ dr(e, r, n) ], c = [ s ];
+/** Parse update data from a list of field/value arguments. */ function ar(t, e, n, r, s, i) {
+    const o = t.wt(1 /* UserDataSource.Update */ , e, n), u = [ mr(e, r, n) ], c = [ s ];
     if (i.length % 2 != 0) throw new B($, `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(dr(e, i[t])), c.push(i[t + 1]);
-    const a = [], h = ve.empty();
+    for (let t = 0; t < i.length; t += 2) u.push(mr(e, i[t])), c.push(i[t + 1]);
+    const a = [], h = Ee.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 (!yr(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!_r(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 = d(n);
         const r = o.at(e);
-        if (n instanceof tr) 
+        if (n instanceof nr) 
         // Add it to the field mask, but don't add anything to updateData.
         a.push(e); else {
-            const t = ar(n, r);
+            const t = lr(n, r);
             null != t && (a.push(e), h.set(e, t));
         }
     }
-    const l = new _e(a);
-    return new Kn(h, l, o.fieldTransforms);
+    const l = new be(a);
+    return new Hn(h, l, o.fieldTransforms);
 }
 
 /**
@@ -5018,8 +5066,8 @@ class ir extends zn {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function cr(t, e, n, r = !1) {
-    return ar(n, t.wt(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
+ */ function hr(t, e, n, r = !1) {
+    return lr(n, t.wt(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
 }
 
 /**
@@ -5030,12 +5078,12 @@ class ir extends zn {
  * 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 ar(t, e) {
-    if (lr(
+ */ function lr(t, e) {
+    if (dr(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = d(t))) return fr("Unsupported field value:", e, t), hr(t, e);
-    if (t instanceof zn) 
+    t = d(t))) return wr("Unsupported field value:", e, t), fr(t, e);
+    if (t instanceof Wn) 
     // 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
@@ -5047,7 +5095,7 @@ class ir extends zn {
  */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Yn(e.st)) throw e.lt(`${t._methodName}() can only be used with update() and set()`);
+        if (!Zn(e.st)) throw e.lt(`${t._methodName}() can only be used with update() and set()`);
         if (!e.path) throw e.lt(`${t._methodName}() is not currently supported inside arrays`);
         const n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
@@ -5077,7 +5125,7 @@ class ir extends zn {
             const n = [];
             let r = 0;
             for (const s of t) {
-                let t = ar(s, e.ht(r));
+                let t = lr(s, e.ht(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -5096,7 +5144,7 @@ class ir extends zn {
         if (null === (t = d(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return Fe(e.M, t);
+        if ("number" == typeof t) return Se(e.M, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -5104,34 +5152,34 @@ class ir extends zn {
             stringValue: t
         };
         if (t instanceof Date) {
-            const n = qt.fromDate(t);
+            const n = kt.fromDate(t);
             return {
-                timestampValue: Ye(e.M, n)
+                timestampValue: Ze(e.M, n)
             };
         }
-        if (t instanceof qt) {
+        if (t instanceof kt) {
             // 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 qt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            const n = new kt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Ye(e.M, n)
+                timestampValue: Ze(e.M, n)
             };
         }
-        if (t instanceof Qn) return {
+        if (t instanceof Gn) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof Un) return {
-            bytesValue: He(e.M, t._byteString)
+        if (t instanceof Bn) return {
+            bytesValue: Je(e.M, t._byteString)
         };
-        if (t instanceof xn) {
+        if (t instanceof qn) {
             const n = e.databaseId, r = t.firestore._databaseId;
             if (!r.isEqual(n)) throw e.lt(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${n.projectId}/${n.database}`);
             return {
-                referenceValue: Xe(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: en(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
         throw e.lt(`Unsupported field value: ${at(t)}`);
@@ -5145,13 +5193,13 @@ class ir extends zn {
  */ (t, e);
 }
 
-function hr(t, e) {
+function fr(t, e) {
     const n = {};
     return !function(t) {
         for (const e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
         return !0;
-    }(t) ? Pt(t, ((t, r) => {
-        const s = ar(r, e.ot(t));
+    }(t) ? $t(t, ((t, r) => {
+        const s = lr(r, e.ot(t));
         null != s && (n[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -5163,12 +5211,12 @@ function hr(t, e) {
     };
 }
 
-function lr(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof qt || t instanceof Qn || t instanceof Un || t instanceof xn || t instanceof zn);
+function dr(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof kt || t instanceof Gn || t instanceof Bn || t instanceof qn || t instanceof Wn);
 }
 
-function fr(t, e, n) {
-    if (!lr(n) || !function(t) {
+function wr(t, e, n) {
+    if (!dr(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         const r = at(n);
@@ -5178,20 +5226,20 @@ function fr(t, e, n) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function dr(t, e, n) {
+ */ function mr(t, e, n) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    e = d(e)) instanceof jn) return e._internalPath;
-    if ("string" == typeof e) return mr(t, e);
-    throw pr("Field path arguments must be of type string or ", t, 
+    e = d(e)) instanceof zn) return e._internalPath;
+    if ("string" == typeof e) return yr(t, e);
+    throw gr("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 wr = new RegExp("[~\\*/\\[\\]]");
+ */ const pr = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -5201,20 +5249,20 @@ function fr(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function mr(t, e, n) {
-    if (e.search(wr) >= 0) throw pr(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function yr(t, e, n) {
+    if (e.search(pr) >= 0) throw gr(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return new jn(...e.split("."))._internalPath;
+        return new zn(...e.split("."))._internalPath;
     } catch (r) {
-        throw pr(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw gr(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function pr(t, e, n, r, s) {
+function gr(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 += ". ";
@@ -5223,7 +5271,7 @@ function pr(t, e, n, r, s) {
     c += ")"), new B($, u + t + c);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function yr(t, e) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function _r(t, e) {
     return t.some((t => t.isEqual(e)));
 }
 
@@ -5251,7 +5299,7 @@ function pr(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 gr {
+ */ class vr {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -5267,7 +5315,7 @@ function pr(t, e, n, r, s) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new xn(this._firestore, this._converter, this._key);
+        return new qn(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -5287,7 +5335,7 @@ function pr(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 _r(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new br(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -5307,7 +5355,7 @@ function pr(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(Er("DocumentSnapshot.get", t));
+            const e = this._document.data.field(Ir("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }
@@ -5323,7 +5371,7 @@ function pr(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 _r extends gr {
+ */ class br extends vr {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -5341,7 +5389,7 @@ function pr(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 vr {
+ */ class Er {
     /** @hideconstructor */
     constructor(t, e) {
         this._docs = e, this.query = t;
@@ -5372,14 +5420,14 @@ function pr(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 br(t, e) {
-    return t = d(t), e = d(e), t instanceof gr && e instanceof gr ? 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 vr && e instanceof vr && (Mn(t.query, e.query) && Tt(t.docs, e.docs, br));
+ */ function Ar(t, e) {
+    return t = d(t), e = d(e), t instanceof vr && e instanceof vr ? 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 Er && e instanceof Er && (jn(t.query, e.query) && Pt(t.docs, e.docs, Ar));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function Er(t, e) {
-    return "string" == typeof e ? mr(t, e) : e instanceof jn ? e._internalPath : e._delegate._internalPath;
+ */ function Ir(t, e) {
+    return "string" == typeof e ? yr(t, e) : e instanceof zn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -5402,21 +5450,21 @@ function pr(t, e, n, r, s) {
  * An `AppliableConstraint` is an abstraction of a constraint that can be applied
  * to a Firestore query.
  */
-class Ar {}
+class Tr {}
 
 /**
  * A `QueryConstraint` is used to narrow the set of documents returned by a
  * Firestore query. `QueryConstraint`s are created by invoking {@link where},
- * {@link orderBy}, {@link startAt}, {@link startAfter}, {@link
- * endBefore}, {@link endAt}, {@link limit}, {@link limitToLast} and
- * can then be passed to {@link query} to create a new query instance that
+ * {@link orderBy}, {@link (startAt:1)}, {@link (startAfter:1)}, {@link
+ * (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 Ir extends Ar {}
+ */ class Rr extends Tr {}
 
-function Tr(t, e, ...n) {
+function Pr(t, e, ...n) {
     let r = [];
-    e instanceof Ar && r.push(e), r = r.concat(n), function(t) {
-        const e = t.filter((t => t instanceof Vr)).length, n = t.filter((t => t instanceof Rr)).length;
+    e instanceof Tr && r.push(e), r = r.concat(n), function(t) {
+        const e = t.filter((t => t instanceof Nr)).length, n = t.filter((t => t instanceof Vr)).length;
         if (e > 1 || e > 0 && n > 0) throw new B($, "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(...)))`.");
     }
     /**
@@ -5449,9 +5497,9 @@ function Tr(t, e, ...n) {
  * A `QueryFieldFilterConstraint` is used to narrow the set of documents returned by
  * a Firestore query by filtering on one or more document fields.
  * `QueryFieldFilterConstraint`s are created by invoking {@link where} and can then
- * be passed to {@link query} to create a new query instance that also contains
+ * be passed to {@link (query:1)} to create a new query instance that also contains
  * this `QueryFieldFilterConstraint`.
- */ class Rr extends Ir {
+ */ class Vr extends Rr {
     /**
      * @internal
      */
@@ -5461,31 +5509,31 @@ function Tr(t, e, ...n) {
         this.type = "where";
     }
     static _create(t, e, n) {
-        return new Rr(t, e, n);
+        return new Vr(t, e, n);
     }
     _apply(t) {
         const e = this._parse(t);
-        return Qr(t._query, e), new Sn(t.firestore, t.converter, Ne(t._query, e));
+        return Gr(t._query, e), new On(t.firestore, t.converter, Fe(t._query, e));
     }
     _parse(t) {
-        const e = Jn(t.firestore), n = function(t, e, n, r, s, i, o) {
+        const e = tr(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 B($, `Invalid Query. You can't perform '${i}' queries on documentId().`);
                 if ("in" /* Operator.IN */ === i || "not-in" /* Operator.NOT_IN */ === i) {
-                    zr(o, i);
+                    Wr(o, i);
                     const e = [];
-                    for (const n of o) e.push(Br(r, t, n));
+                    for (const n of o) e.push(Qr(r, t, n));
                     u = {
                         arrayValue: {
                             values: e
                         }
                     };
-                } else u = Br(r, t, o);
-            } else "in" /* Operator.IN */ !== i && "not-in" /* Operator.NOT_IN */ !== i && "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ !== i || zr(o, i), 
-            u = cr(n, e, o, 
+                } else u = Qr(r, t, o);
+            } else "in" /* Operator.IN */ !== i && "not-in" /* Operator.NOT_IN */ !== i && "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ !== i || Wr(o, i), 
+            u = hr(n, e, o, 
             /* allowArrays= */ "in" /* Operator.IN */ === i || "not-in" /* Operator.NOT_IN */ === i);
-            return te.create(s, i, u);
+            return ne.create(s, i, u);
         }(t._query, "where", e, t.firestore._databaseId, this._field, this._op, this._value);
         return n;
     }
@@ -5501,9 +5549,9 @@ function Tr(t, e, ...n) {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link QueryFieldFilterConstraint}.
- */ function Pr(t, e, n) {
-    const r = e, s = Er("where", t);
-    return Rr._create(s, r, n);
+ */ function $r(t, e, n) {
+    const r = e, s = Ir("where", t);
+    return Vr._create(s, r, n);
 }
 
 /**
@@ -5511,10 +5559,9 @@ function Tr(t, e, ...n) {
  * returned by a Firestore query by performing the logical OR or AND of multiple
  * {@link QueryFieldFilterConstraint}s or {@link QueryCompositeFilterConstraint}s.
  * `QueryCompositeFilterConstraint`s are created by invoking {@link or} or
- * {@link and} and can then be passed to {@link query} to create a new query
+ * {@link and} and can then be passed to {@link (query:1)} to create a new query
  * instance that also contains the `QueryCompositeFilterConstraint`.
- * @internal TODO remove this internal tag with OR Query support in the server
- */ class Vr extends Ar {
+ */ class Nr extends Tr {
     /**
      * @internal
      */
@@ -5524,22 +5571,22 @@ function Tr(t, e, ...n) {
         super(), this.type = t, this._queryConstraints = e;
     }
     static _create(t, e) {
-        return new Vr(t, e);
+        return new Nr(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] : ee.create(e, this._getOperator());
+        return 1 === e.length ? e[0] : re.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) Qr(n, t), n = Ne(n, t);
+            for (const t of r) Gr(n, t), n = Fe(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 Sn(t.firestore, t.converter, Ne(t._query, e)));
+        (t._query, e), new On(t.firestore, t.converter, Fe(t._query, e)));
     }
     _getQueryConstraints() {
         return this._queryConstraints;
@@ -5558,10 +5605,9 @@ function Tr(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}.
- * @internal TODO remove this internal tag with OR Query support in the server
- */ function $r(...t) {
+ */ function Dr(...t) {
     // Only support QueryFilterConstraints
-    return t.forEach((t => Gr("or", t))), Vr._create("or" /* CompositeOperator.OR */ , t);
+    return t.forEach((t => Yr("or", t))), Nr._create("or" /* CompositeOperator.OR */ , t);
 }
 
 /**
@@ -5573,21 +5619,20 @@ function Tr(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}.
- * @internal TODO remove this internal tag with OR Query support in the server
- */ function Nr(...t) {
+ */ function Fr(...t) {
     // Only support QueryFilterConstraints
-    return t.forEach((t => Gr("and", t))), Vr._create("and" /* CompositeOperator.AND */ , t);
+    return t.forEach((t => Yr("and", t))), Nr._create("and" /* CompositeOperator.AND */ , t);
 }
 
 /**
  * A `QueryOrderByConstraint` is used to sort the set of documents returned by a
  * Firestore query. `QueryOrderByConstraint`s are created by invoking
- * {@link orderBy} and can then be passed to {@link query} to create a new query
+ * {@link orderBy} and can then be passed to {@link (query:1)} to create a new query
  * instance that also contains this `QueryOrderByConstraint`.
  *
  * Note: Documents that do not contain the orderBy field will not be present in
  * the query result.
- */ class Dr extends Ir {
+ */ class xr extends Rr {
     /**
      * @internal
      */
@@ -5597,18 +5642,18 @@ function Tr(t, e, ...n) {
         this.type = "orderBy";
     }
     static _create(t, e) {
-        return new Dr(t, e);
+        return new xr(t, e);
     }
     _apply(t) {
         const e = function(t, e, n) {
             if (null !== t.startAt) throw new B($, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
             if (null !== t.endAt) throw new B($, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            const r = new le(e, n);
+            const r = new de(e, n);
             return function(t, e) {
-                if (null === Te(t)) {
+                if (null === Pe(t)) {
                     // This is the first order by. It must match any inequality.
-                    const n = Re(t);
-                    null !== n && Wr(t, n, e.field);
+                    const n = Ve(t);
+                    null !== n && Kr(t, n, e.field);
                 }
             }(t, r), r;
         }
@@ -5623,10 +5668,10 @@ function Tr(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 Sn(t.firestore, t.converter, function(t, e) {
+        return new On(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 Ie(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new Re(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }
 }
@@ -5642,18 +5687,18 @@ function Tr(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 Fr(t, e = "asc") {
-    const n = e, r = Er("orderBy", t);
-    return Dr._create(r, n);
+ */ function Sr(t, e = "asc") {
+    const n = e, r = Ir("orderBy", t);
+    return xr._create(r, n);
 }
 
 /**
  * A `QueryLimitConstraint` is used to limit the number of documents returned by
  * a Firestore query.
  * `QueryLimitConstraint`s are created by invoking {@link limit} or
- * {@link limitToLast} and can then be passed to {@link query} to create a new
+ * {@link limitToLast} and can then be passed to {@link (query:1)} to create a new
  * query instance that also contains this `QueryLimitConstraint`.
- */ class xr extends Ir {
+ */ class qr extends Rr {
     /**
      * @internal
      */
@@ -5663,11 +5708,11 @@ function Tr(t, e, ...n) {
         super(), this.type = t, this._limit = e, this._limitType = n;
     }
     static _create(t, e, n) {
-        return new xr(t, e, n);
+        return new qr(t, e, n);
     }
     _apply(t) {
-        return new Sn(t.firestore, t.converter, function(t, e, n) {
-            return new Ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        return new On(t.firestore, t.converter, function(t, e, n) {
+            return new Re(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
         }(t._query, this._limit, this._limitType));
     }
 }
@@ -5678,8 +5723,8 @@ function Tr(t, e, ...n) {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link QueryLimitConstraint}.
- */ function Sr(t) {
-    return lt("limit", t), xr._create("limit", t, "F" /* LimitType.First */);
+ */ function Or(t) {
+    return lt("limit", t), qr._create("limit", t, "F" /* LimitType.First */);
 }
 
 /**
@@ -5691,17 +5736,17 @@ function Tr(t, e, ...n) {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link QueryLimitConstraint}.
- */ function qr(t) {
-    return lt("limitToLast", t), xr._create("limitToLast", t, "L" /* LimitType.Last */);
+ */ function kr(t) {
+    return lt("limitToLast", t), qr._create("limitToLast", t, "L" /* LimitType.Last */);
 }
 
 /**
  * A `QueryStartAtConstraint` is used to exclude documents from the start of a
  * result set returned by a Firestore query.
  * `QueryStartAtConstraint`s are created by invoking {@link (startAt:1)} or
- * {@link (startAfter:1)} and can then be passed to {@link query} to create a
+ * {@link (startAfter:1)} and can then be passed to {@link (query:1)} to create a
  * new query instance that also contains this `QueryStartAtConstraint`.
- */ class Or extends Ir {
+ */ class Cr extends Rr {
     /**
      * @internal
      */
@@ -5711,23 +5756,23 @@ function Tr(t, e, ...n) {
         super(), this.type = t, this._docOrFields = e, this._inclusive = n;
     }
     static _create(t, e, n) {
-        return new Or(t, e, n);
+        return new Cr(t, e, n);
     }
     _apply(t) {
-        const e = jr(t, this.type, this._docOrFields, this._inclusive);
-        return new Sn(t.firestore, t.converter, function(t, e) {
-            return new Ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+        const e = zr(t, this.type, this._docOrFields, this._inclusive);
+        return new On(t.firestore, t.converter, function(t, e) {
+            return new Re(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
 }
 
-function kr(...t) {
-    return Or._create("startAt", t, 
+function Lr(...t) {
+    return Cr._create("startAt", t, 
     /*inclusive=*/ !0);
 }
 
-function Cr(...t) {
-    return Or._create("startAfter", t, 
+function Mr(...t) {
+    return Cr._create("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
@@ -5735,9 +5780,9 @@ function Cr(...t) {
  * A `QueryEndAtConstraint` is used to exclude documents from the end of a
  * result set returned by a Firestore query.
  * `QueryEndAtConstraint`s are created by invoking {@link (endAt:1)} or
- * {@link (endBefore:1)} and can then be passed to {@link query} to create a new
+ * {@link (endBefore:1)} and can then be passed to {@link (query:1)} to create a new
  * query instance that also contains this `QueryEndAtConstraint`.
- */ class Lr extends Ir {
+ */ class Ur extends Rr {
     /**
      * @internal
      */
@@ -5747,28 +5792,28 @@ function Cr(...t) {
         super(), this.type = t, this._docOrFields = e, this._inclusive = n;
     }
     static _create(t, e, n) {
-        return new Lr(t, e, n);
+        return new Ur(t, e, n);
     }
     _apply(t) {
-        const e = jr(t, this.type, this._docOrFields, this._inclusive);
-        return new Sn(t.firestore, t.converter, function(t, e) {
-            return new Ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+        const e = zr(t, this.type, this._docOrFields, this._inclusive);
+        return new On(t.firestore, t.converter, function(t, e) {
+            return new Re(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
 }
 
-function Mr(...t) {
-    return Lr._create("endBefore", t, 
+function jr(...t) {
+    return Ur._create("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function Ur(...t) {
-    return Lr._create("endAt", t, 
+function Br(...t) {
+    return Ur._create("endAt", t, 
     /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function jr(t, e, n, r) {
-    if (n[0] = d(n[0]), n[0] instanceof gr) return function(t, e, n, r, s) {
+/** Helper function to create a bound from a document or fields */ function zr(t, e, n, r) {
+    if (n[0] = d(n[0]), n[0] instanceof vr) return function(t, e, n, r, s) {
         if (!r) throw new B(D, `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
@@ -5778,22 +5823,22 @@ function Ur(...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 Ve(t)) if (n.field.isKeyField()) i.push(Qt(e, r.key)); else {
+                for (const n of Ne(t)) if (n.field.isKeyField()) i.push(Gt(e, r.key)); else {
             const t = r.data.field(n.field);
-            if (Ot(t)) throw new B($, '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 (Ct(t)) throw new B($, '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 B($, `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 Zt(i, s);
+        return new Xt(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 = Jn(t.firestore);
+        const s = tr(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;
@@ -5803,17 +5848,17 @@ function Ur(...t) {
                 const c = s[i];
                 if (o[i].field.isKeyField()) {
                     if ("string" != typeof c) throw new B($, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
-                    if (!Pe(t) && -1 !== c.indexOf("/")) throw new B($, `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 (!$e(t) && -1 !== c.indexOf("/")) throw new B($, `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(nt.fromString(c));
                     if (!it.isDocumentKey(n)) throw new B($, `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 it(n);
-                    u.push(Qt(e, s));
+                    u.push(Gt(e, s));
                 } else {
-                    const t = cr(n, r, c);
+                    const t = hr(n, r, c);
                     u.push(t);
                 }
             }
-            return new Zt(u, i);
+            return new Xt(u, i);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -5823,22 +5868,22 @@ function Ur(...t) {
     }
 }
 
-function Br(t, e, n) {
+function Qr(t, e, n) {
     if ("string" == typeof (n = d(n))) {
         if ("" === n) throw new B($, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!Pe(e) && -1 !== n.indexOf("/")) throw new B($, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
+        if (!$e(e) && -1 !== n.indexOf("/")) throw new B($, `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(nt.fromString(n));
         if (!it.isDocumentKey(r)) throw new B($, `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 Qt(t, new it(r));
+        return Gt(t, new it(r));
     }
-    if (n instanceof xn) return Qt(t, n._key);
+    if (n instanceof qn) return Gt(t, n._key);
     throw new B($, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${at(n)}.`);
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function zr(t, e) {
+ */ function Wr(t, e) {
     if (!Array.isArray(t) || 0 === t.length) throw new B($, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);
 }
 
@@ -5851,12 +5896,12 @@ function Br(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 Qr(t, e) {
+ */ function Gr(t, e) {
     if (e.isInequality()) {
-        const n = Re(t), r = e.field;
+        const n = Ve(t), r = e.field;
         if (null !== n && !n.isEqual(r)) throw new B($, `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 = Te(t);
-        null !== s && Wr(t, r, s);
+        const s = Pe(t);
+        null !== s && Kr(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;
@@ -5882,12 +5927,12 @@ function Br(t, e, n) {
     throw n === e.op ? new B($, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new B($, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
 }
 
-function Wr(t, e, n) {
+function Kr(t, e, n) {
     if (!n.isEqual(e)) throw new B($, `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 Gr(t, e) {
-    if (!(e instanceof Rr || e instanceof Vr)) throw new B($, `Function ${t}() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'.`);
+function Yr(t, e) {
+    if (!(e instanceof Vr || e instanceof Nr)) throw new B($, `Function ${t}() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'.`);
 }
 
 /**
@@ -5915,7 +5960,7 @@ function Gr(t, e) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function Kr(t, e, n) {
+function Hr(t, e, n) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -5924,9 +5969,9 @@ function Kr(t, e, n) {
     r;
 }
 
-class Yr extends class {
+class Zr extends class {
     convertValue(t, e = "none") {
-        switch (Mt(t)) {
+        switch (jt(t)) {
           case 0 /* TypeOrder.NullValue */ :
             return null;
 
@@ -5934,7 +5979,7 @@ class Yr extends class {
             return t.booleanValue;
 
           case 2 /* TypeOrder.NumberValue */ :
-            return xt(t.integerValue || t.doubleValue);
+            return qt(t.integerValue || t.doubleValue);
 
           case 3 /* TypeOrder.TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -5946,7 +5991,7 @@ class Yr extends class {
             return t.stringValue;
 
           case 6 /* TypeOrder.BlobValue */ :
-            return this.convertBytes(St(t.bytesValue));
+            return this.convertBytes(Ot(t.bytesValue));
 
           case 7 /* TypeOrder.RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -5966,12 +6011,12 @@ class Yr extends class {
     }
     convertObject(t, e) {
         const n = {};
-        return Pt(t.fields, ((t, r) => {
+        return $t(t.fields, ((t, r) => {
             n[t] = this.convertValue(r, e);
         })), n;
     }
     convertGeoPoint(t) {
-        return new Qn(xt(t.latitude), xt(t.longitude));
+        return new Gn(qt(t.latitude), qt(t.longitude));
     }
     convertArray(t, e) {
         return (t.values || []).map((t => this.convertValue(t, e)));
@@ -5979,23 +6024,23 @@ class Yr extends class {
     convertServerTimestamp(t, e) {
         switch (e) {
           case "previous":
-            const n = kt(t);
+            const n = Lt(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Ct(t));
+            return this.convertTimestamp(Mt(t));
 
           default:
             return null;
         }
     }
     convertTimestamp(t) {
-        const e = Ft(t);
-        return new qt(e.seconds, e.nanos);
+        const e = St(t);
+        return new kt(e.seconds, e.nanos);
     }
     convertDocumentKey(t, e) {
         const n = nt.fromString(t);
-        I(mn(n));
+        I(yn(n));
         const r = new tt(n.get(1), n.get(3)), s = new it(n.popFirst(5));
         return r.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
@@ -6007,11 +6052,11 @@ class Yr extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new Un(t);
+        return new Bn(t);
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new xn(this.firestore, /* converter= */ null, e);
+        return new qn(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -6027,12 +6072,12 @@ class Yr extends class {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function Hr(t) {
-    const e = In((t = ht(t, xn)).firestore), n = new Yr(t.firestore);
-    return vn(e, [ t._key ]).then((e => {
+ */ function Jr(t) {
+    const e = Rn((t = ht(t, qn)).firestore), n = new Zr(t.firestore);
+    return En(e, [ t._key ]).then((e => {
         I(1 === e.length);
         const r = e[0];
-        return new gr(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new vr(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -6047,33 +6092,33 @@ class Yr extends class {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function Zr(t) {
+ */ function Xr(t) {
     !function(t) {
         if ("L" /* LimitType.Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new B(L, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = ht(t, Sn))._query);
-    const e = In(t.firestore), n = new Yr(t.firestore);
-    return bn(e, t._query).then((e => {
-        const r = e.map((e => new _r(t.firestore, n, e.key, e, t.converter)));
+    }((t = ht(t, On))._query);
+    const e = Rn(t.firestore), n = new Zr(t.firestore);
+    return An(e, t._query).then((e => {
+        const r = e.map((e => new br(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 vr(t, r);
+        r.reverse(), new Er(t, r);
     }));
 }
 
-function Jr(t, e, n) {
-    const r = Kr((t = ht(t, xn)).converter, e, n), s = Xn(Jn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return _n(In(t.firestore), [ s.toMutation(t._key, Le.none()) ]);
+function ts(t, e, n) {
+    const r = Hr((t = ht(t, qn)).converter, e, n), s = er(tr(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return bn(Rn(t.firestore), [ s.toMutation(t._key, Ue.none()) ]);
 }
 
-function Xr(t, e, n, ...r) {
-    const s = Jn((t = ht(t, xn)).firestore);
+function es(t, e, n, ...r) {
+    const s = tr((t = ht(t, qn)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    i = "string" == typeof (e = d(e)) || e instanceof jn ? ur(s, "updateDoc", t._key, e, n, r) : or(s, "updateDoc", t._key, e);
-    return _n(In(t.firestore), [ i.toMutation(t._key, Le.exists(!0)) ]);
+    i = "string" == typeof (e = d(e)) || e instanceof zn ? ar(s, "updateDoc", t._key, e, n, r) : cr(s, "updateDoc", t._key, e);
+    return bn(Rn(t.firestore), [ i.toMutation(t._key, Ue.exists(!0)) ]);
 }
 
 /**
@@ -6087,8 +6132,8 @@ function Xr(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 ts(t) {
-    return _n(In((t = ht(t, xn)).firestore), [ new Be(t._key, Le.none()) ]);
+ */ function ns(t) {
+    return bn(Rn((t = ht(t, qn)).firestore), [ new Qe(t._key, Ue.none()) ]);
 }
 
 /**
@@ -6105,9 +6150,9 @@ function Xr(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 es(t, e) {
-    const n = Cn(t = ht(t, qn)), r = Kr(t.converter, e), s = Xn(Jn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return _n(In(t.firestore), [ s.toMutation(n._key, Le.exists(!1)) ]).then((() => n));
+ */ function rs(t, e) {
+    const n = Mn(t = ht(t, kn)), r = Hr(t.converter, e), s = er(tr(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return bn(Rn(t.firestore), [ s.toMutation(n._key, Ue.exists(!1)) ]).then((() => n));
 }
 
 /**
@@ -6139,9 +6184,9 @@ function Xr(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 ns(t) {
-    return rs(t, {
-        count: os()
+ */ function ss(t) {
+    return is(t, {
+        count: cs()
     });
 }
 
@@ -6171,16 +6216,16 @@ function Xr(t, e, n, ...r) {
  * const averageScore: number | null = aggregateSnapshot.data().averageScore;
  * ```
  * @internal TODO (sum/avg) remove when public
- */ function rs(t, e) {
-    const n = ht(t.firestore, Rn), r = In(n), s = function(t, e) {
+ */ function is(t, e) {
+    const n = ht(t.firestore, Vn), r = Rn(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 bt(new vt(e), t._aggregateType, t._internalFieldPath)));
+    }(e, ((t, e) => new At(new Et(e), t._aggregateType, t._internalFieldPath)));
     // Run the aggregation and convert the results
-    return En(r, t._query, s).then((e => function(t, e, n) {
-        const r = new Yr(t);
-        return new Fn(e, r, n);
+    return In(r, t._query, s).then((e => function(t, e, n) {
+        const r = new Zr(t);
+        return new Sn(e, r, n);
     }
     /**
  * Create an AggregateField object that can be used to compute the sum of
@@ -6190,8 +6235,8 @@ function Xr(t, e, n, ...r) {
  */ (n, t, e)));
 }
 
-function ss(t) {
-    return new Dn("sum", dr("sum", t));
+function os(t) {
+    return new xn("sum", mr("sum", t));
 }
 
 /**
@@ -6199,16 +6244,16 @@ function ss(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 is(t) {
-    return new Dn("avg", dr("average", t));
+ */ function us(t) {
+    return new xn("avg", mr("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 os() {
-    return new Dn("count");
+ */ function cs() {
+    return new xn("count");
 }
 
 /**
@@ -6217,9 +6262,9 @@ function ss(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 us(t, e) {
+ */ function as(t, e) {
     var n, r;
-    return t instanceof Dn && e instanceof Dn && 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 xn && e instanceof xn && 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());
 }
 
 /**
@@ -6233,8 +6278,8 @@ function ss(t) {
  *
  * @returns `true` if the objects are "equal", as defined above, or `false`
  * otherwise.
- */ function cs(t, e) {
-    return Mn(t.query, e.query) && w(t.data(), e.data());
+ */ function hs(t, e) {
+    return jn(t.query, e.query) && w(t.data(), e.data());
 }
 
 /**
@@ -6256,15 +6301,15 @@ function ss(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 as() {
-    return new tr("deleteField");
+ */ function ls() {
+    return new nr("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 hs() {
-    return new nr("serverTimestamp");
+ */ function fs() {
+    return new sr("serverTimestamp");
 }
 
 /**
@@ -6278,10 +6323,10 @@ function ss(t) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function ls(...t) {
+ */ function ds(...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 rr("arrayUnion", t);
+    return new ir("arrayUnion", t);
 }
 
 /**
@@ -6294,10 +6339,10 @@ function ss(t) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function fs(...t) {
+ */ function ws(...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 sr("arrayRemove", t);
+    return new or("arrayRemove", t);
 }
 
 /**
@@ -6318,8 +6363,8 @@ function ss(t) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function ds(t) {
-    return new ir("increment", t);
+ */ function ms(t) {
+    return new ur("increment", t);
 }
 
 /**
@@ -6345,25 +6390,25 @@ function ss(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 ws {
+ */ class ps {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = Jn(t);
+        this._dataReader = tr(t);
     }
     set(t, e, n) {
         this._verifyNotCommitted();
-        const r = ms(t, this._firestore), s = Kr(r.converter, e, n), i = Xn(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, n);
-        return this._mutations.push(i.toMutation(r._key, Le.none())), this;
+        const r = ys(t, this._firestore), s = Hr(r.converter, e, n), i = er(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, n);
+        return this._mutations.push(i.toMutation(r._key, Ue.none())), this;
     }
     update(t, e, n, ...r) {
         this._verifyNotCommitted();
-        const s = ms(t, this._firestore);
+        const s = ys(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (e = d(e)) || e instanceof jn ? ur(this._dataReader, "WriteBatch.update", s._key, e, n, r) : or(this._dataReader, "WriteBatch.update", s._key, e), 
-        this._mutations.push(i.toMutation(s._key, Le.exists(!0))), this;
+        return i = "string" == typeof (e = d(e)) || e instanceof zn ? ar(this._dataReader, "WriteBatch.update", s._key, e, n, r) : cr(this._dataReader, "WriteBatch.update", s._key, e), 
+        this._mutations.push(i.toMutation(s._key, Ue.exists(!0))), this;
     }
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -6372,8 +6417,8 @@ function ss(t) {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const e = ms(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Be(e._key, Le.none())), this;
+        const e = ys(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Qe(e._key, Ue.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -6394,7 +6439,7 @@ function ss(t) {
     }
 }
 
-function ms(t, e) {
+function ys(t, e) {
     if ((t = d(t)).firestore !== e) throw new B($, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -6411,9 +6456,9 @@ function ms(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function ps(t) {
-    const e = In(t = ht(t, Rn));
-    return new ws(t, (t => _n(e, t)));
+ */ function gs(t) {
+    const e = Rn(t = ht(t, Vn));
+    return new ps(t, (t => bn(e, t)));
 }
 
 /**
@@ -6435,7 +6480,7 @@ function ms(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ class ys {
+ */ class _s {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -6455,7 +6500,7 @@ function ms(t, e) {
     }
     async lookup(t) {
         if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new B($, "Firestore transactions require all reads to be executed before all writes.");
-        const e = await vn(this.datastore, t);
+        const e = await En(this.datastore, t);
         return e.forEach((t => this.recordVersion(t))), e;
     }
     set(t, e) {
@@ -6470,7 +6515,7 @@ function ms(t, e) {
         this.writtenDocs.add(t.toString());
     }
     delete(t) {
-        this.write(new Be(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Qe(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }
     async commit() {
         if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
@@ -6483,15 +6528,15 @@ function ms(t, e) {
         // a `verify` operation.
         t.forEach(((t, e) => {
             const n = it.fromPath(e);
-            this.mutations.push(new ze(n, this.precondition(n)));
-        })), await _n(this.datastore, this.mutations), this.committed = !0;
+            this.mutations.push(new We(n, this.precondition(n)));
+        })), await bn(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let e;
         if (t.isFoundDocument()) e = t.version; else {
             if (!t.isNoDocument()) throw A();
             // Represent a deleted doc using SnapshotVersion.min().
-            e = de.min();
+            e = me.min();
         }
         const n = this.readVersions.get(t.key.toString());
         if (n) {
@@ -6505,7 +6550,7 @@ function ms(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(de.min()) ? Le.exists(!1) : Le.updateTime(e) : Le.none();
+        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(me.min()) ? Ue.exists(!1) : Ue.updateTime(e) : Ue.none();
     }
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -6514,7 +6559,7 @@ function ms(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(de.min())) 
+            if (e.isEqual(me.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
@@ -6526,11 +6571,11 @@ function ms(t, e) {
             // transaction.
             throw new B($, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return Le.updateTime(e);
+                        return Ue.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-        return Le.exists(!0);
+        return Ue.exists(!0);
     }
     write(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
@@ -6553,7 +6598,7 @@ function ms(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 gs = {
+ */ const vs = {
     maxAttempts: 5
 };
 
@@ -6577,17 +6622,17 @@ function ms(t, e) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class _s {
+class bs {
     constructor(t, e, n, r, s) {
         this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
-        this.deferred = s, this._t = n.maxAttempts, this.vt = new yn(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */);
+        this.deferred = s, this._t = n.maxAttempts, this.vt = new _n(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
         this._t -= 1, this.bt();
     }
     bt() {
         this.vt.J((async () => {
-            const t = new ys(this.datastore), e = this.Et(t);
+            const t = new _s(this.datastore), e = this.Et(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
@@ -6602,7 +6647,7 @@ class _s {
     Et(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 !wt(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.
@@ -6677,7 +6722,7 @@ class _s {
  * 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 vs() {
+/** The Platform's 'document' implementation or null if not available. */ function Es() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -6709,7 +6754,7 @@ class _s {
  * 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 bs {
+ */ class As {
     constructor(t, e, n, r, s) {
         this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = r, this.removalCallback = s, 
         this.deferred = new z, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
@@ -6732,7 +6777,7 @@ class _s {
      *   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 bs(t, e, i, r, s);
+        const i = Date.now() + n, o = new As(t, e, i, r, s);
         return o.start(n), o;
     }
     /**
@@ -6781,7 +6826,7 @@ class _s {
  * 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 Es {
+ */ class Is {
     constructor() {
         // The last promise in the queue.
         this.Tt = Promise.resolve(), 
@@ -6804,15 +6849,15 @@ class _s {
         // List of TimerIds to fast-forward delays for.
         this.Ft = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.vt = new yn(this, "async_queue_retry" /* TimerId.AsyncQueueRetry */), 
+        this.vt = new _n(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.xt = () => {
-            const t = vs();
+            const t = Es();
             t && _("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.vt.tt();
         };
-        const t = vs();
+        const t = Es();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.xt);
     }
     get isShuttingDown() {
@@ -6833,7 +6878,7 @@ class _s {
     enterRestrictedMode(t) {
         if (!this.Pt) {
             this.Pt = !0, this.Dt = t || !1;
-            const e = vs();
+            const e = Es();
             e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.xt);
         }
     }
@@ -6965,7 +7010,7 @@ class _s {
         this.St(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ft.indexOf(t) > -1 && (e = 0);
-        const r = bs.createAndSchedule(this, t, e, n, (t => this.kt(t)));
+        const r = As.createAndSchedule(this, t, e, n, (t => this.kt(t)));
         return this.Vt.push(r), r;
     }
     St() {
@@ -7019,10 +7064,10 @@ class _s {
     }
 }
 
-class As {
+class Ts {
     /** @hideconstructor */
     constructor(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = Jn(t);
+        this._firestore = t, this._transaction = e, this._dataReader = tr(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -7030,25 +7075,25 @@ class As {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const e = ms(t, this._firestore), n = new Yr(this._firestore);
+        const e = ys(t, this._firestore), n = new Zr(this._firestore);
         return this._transaction.lookup([ e._key ]).then((t => {
             if (!t || 1 !== t.length) return A();
             const r = t[0];
-            if (r.isFoundDocument()) return new gr(this._firestore, n, r.key, r, e.converter);
-            if (r.isNoDocument()) return new gr(this._firestore, n, e._key, null, e.converter);
+            if (r.isFoundDocument()) return new vr(this._firestore, n, r.key, r, e.converter);
+            if (r.isNoDocument()) return new vr(this._firestore, n, e._key, null, e.converter);
             throw A();
         }));
     }
     set(t, e, n) {
-        const r = ms(t, this._firestore), s = Kr(r.converter, e, n), i = Xn(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, n);
+        const r = ys(t, this._firestore), s = Hr(r.converter, e, n), i = er(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 = ms(t, this._firestore);
+        const s = ys(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (e = d(e)) || e instanceof jn ? ur(this._dataReader, "Transaction.update", s._key, e, n, r) : or(this._dataReader, "Transaction.update", s._key, e), 
+        return i = "string" == typeof (e = d(e)) || e instanceof zn ? ar(this._dataReader, "Transaction.update", s._key, e, n, r) : cr(this._dataReader, "Transaction.update", s._key, e), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -7057,7 +7102,7 @@ class As {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const e = ms(t, this._firestore);
+        const e = ys(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }
 }
@@ -7080,13 +7125,13 @@ class As {
  * (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 Is(t, e, n) {
-    const r = In(t = ht(t, Rn)), s = Object.assign(Object.assign({}, gs), n);
+ */ function Rs(t, e, n) {
+    const r = Rn(t = ht(t, Vn)), s = Object.assign(Object.assign({}, vs), n);
     !function(t) {
         if (t.maxAttempts < 1) throw new B($, "Max attempts must be at least 1");
     }(s);
     const i = new z;
-    return new _s(new Es, r, s, (n => e(new As(t, n))), i).run(), i.promise;
+    return new bs(new Is, r, s, (n => e(new Ts(t, n))), i).run(), i.promise;
 }
 
 /**
@@ -7099,7 +7144,7 @@ class As {
  */ !function(t) {
     p = t;
 }(`${s}_lite`), n(new i("firestore/lite", ((t, {instanceIdentifier: e, options: n}) => {
-    const r = t.getProvider("app").getImmediate(), s = new Rn(new K(t.getProvider("auth-internal")), new J(t.getProvider("app-check-internal")), function(t, e) {
+    const r = t.getProvider("app").getImmediate(), s = new Vn(new K(t.getProvider("auth-internal")), new J(t.getProvider("app-check-internal")), function(t, e) {
         if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new B($, '"projectId" not provided in firebase.initializeApp.');
         return new tt(t.options.projectId, e);
     }
@@ -7122,7 +7167,7 @@ class As {
     return n && s._setSettings(n), s;
 }), "PUBLIC").setMultipleInstances(!0)), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-r("firestore-lite", "3.8.4", "rn"), r("firestore-lite", "3.8.4", "esm2017");
+r("firestore-lite", "3.9.0-20230314181055", "rn"), r("firestore-lite", "3.9.0-20230314181055", "esm2017");
 
-export { Dn as AggregateField, Fn as AggregateQuerySnapshot, Un as Bytes, qn as CollectionReference, xn as DocumentReference, gr as DocumentSnapshot, jn as FieldPath, zn as FieldValue, Rn as Firestore, B as FirestoreError, Qn as GeoPoint, Sn as Query, Vr as QueryCompositeFilterConstraint, Ir as QueryConstraint, _r as QueryDocumentSnapshot, Lr as QueryEndAtConstraint, Rr as QueryFieldFilterConstraint, xr as QueryLimitConstraint, Dr as QueryOrderByConstraint, vr as QuerySnapshot, Or as QueryStartAtConstraint, qt as Timestamp, As as Transaction, ws as WriteBatch, es as addDoc, us as aggregateFieldEqual, cs as aggregateQuerySnapshotEqual, Nr as and, fs as arrayRemove, ls as arrayUnion, is as average, On as collection, kn as collectionGroup, $n as connectFirestoreEmulator, os as count, ts as deleteDoc, as as deleteField, Cn as doc, Bn as documentId, Ur as endAt, Mr as endBefore, rs as getAggregate, ns as getCount, Hr as getDoc, Zr as getDocs, Vn as getFirestore, ds as increment, Pn as initializeFirestore, Sr as limit, qr as limitToLast, $r as or, Fr as orderBy, Tr as query, Mn as queryEqual, Ln as refEqual, Is as runTransaction, hs as serverTimestamp, Jr as setDoc, g as setLogLevel, br as snapshotEqual, Cr as startAfter, kr as startAt, ss as sum, Nn as terminate, Xr as updateDoc, Pr as where, ps as writeBatch };
+export { xn as AggregateField, Sn as AggregateQuerySnapshot, Bn as Bytes, kn as CollectionReference, qn as DocumentReference, vr as DocumentSnapshot, zn as FieldPath, Wn as FieldValue, Vn as Firestore, B as FirestoreError, Gn as GeoPoint, On as Query, Nr as QueryCompositeFilterConstraint, Rr as QueryConstraint, br as QueryDocumentSnapshot, Ur as QueryEndAtConstraint, Vr as QueryFieldFilterConstraint, qr as QueryLimitConstraint, xr as QueryOrderByConstraint, Er as QuerySnapshot, Cr as QueryStartAtConstraint, kt as Timestamp, Ts as Transaction, ps as WriteBatch, rs as addDoc, as as aggregateFieldEqual, hs as aggregateQuerySnapshotEqual, Fr as and, ws as arrayRemove, ds as arrayUnion, us as average, Cn as collection, Ln as collectionGroup, Dn as connectFirestoreEmulator, cs as count, ns as deleteDoc, ls as deleteField, Mn as doc, Qn as documentId, Br as endAt, jr as endBefore, is as getAggregate, ss as getCount, Jr as getDoc, Xr as getDocs, Nn as getFirestore, ms as increment, $n as initializeFirestore, Or as limit, kr as limitToLast, Dr as or, Sr as orderBy, Pr as query, jn as queryEqual, Un as refEqual, Rs as runTransaction, fs as serverTimestamp, ts as setDoc, g as setLogLevel, Ar as snapshotEqual, Mr as startAfter, Lr as startAt, os as sum, Fn as terminate, es as updateDoc, $r as where, gs as writeBatch };
 //# sourceMappingURL=index.rn.esm2017.js.map