@firebase/firestore 3.4.8-canary.aa41fd662 → 3.4.8-canary.adb9aaa34

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

@@ -63,7 +63,7 @@ l.MOCK_USER = new l("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let f = "9.6.11-canary.aa41fd662";
+let f = "9.7.0-canary.adb9aaa34";
 
 /**
  * @license
@@ -190,14 +190,14 @@ function p(t, ...e) {
  * given message if it did.
  *
  * Messages are stripped in production builds.
- */ function v(t, e) {
+ */ function b(t, e) {
     t || g();
 }
 
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function b(t, 
+ */ function v(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     return t;
@@ -218,7 +218,7 @@ e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const E = "ok", T = "cancelled", I = "unknown", A = "invalid-argument", R = "deadline-exceeded", P = "not-found", V = "already-exists", D = "permission-denied", N = "unauthenticated", $ = "resource-exhausted", S = "failed-precondition", F = "aborted", x = "out-of-range", q = "unimplemented", O = "internal", C = "unavailable", L = "data-loss";
+ */ const E = "ok", T = "cancelled", A = "unknown", I = "invalid-argument", R = "deadline-exceeded", P = "not-found", V = "already-exists", D = "permission-denied", N = "unauthenticated", $ = "resource-exhausted", S = "failed-precondition", x = "aborted", F = "out-of-range", q = "unimplemented", O = "internal", C = "unavailable", L = "data-loss";
 
 /** An error returned by a Firestore operation. */ class U extends FirebaseError {
     /** @hideconstructor */
@@ -332,7 +332,7 @@ e) {
         }));
     }
     getToken() {
-        return this.auth ? this.auth.getToken().then((t => t ? (v("string" == typeof t.accessToken), 
+        return this.auth ? this.auth.getToken().then((t => t ? (b("string" == typeof t.accessToken), 
         new j(t.accessToken, new l(this.auth.getUid()))) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
@@ -386,7 +386,7 @@ class W {
         }));
     }
     getToken() {
-        return this.appCheck ? this.appCheck.getToken().then((t => t ? (v("string" == typeof t.token), 
+        return this.appCheck ? this.appCheck.getToken().then((t => t ? (b("string" == typeof t.token), 
         new W(t.token)) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
@@ -570,7 +570,7 @@ class J {
         // for legacy reasons and should not be used frequently).
         const e = [];
         for (const n of t) {
-            if (n.indexOf("//") >= 0) throw new U(A, `Invalid segment (${n}). Paths must not contain // in them.`);
+            if (n.indexOf("//") >= 0) throw new U(I, `Invalid segment (${n}). Paths must not contain // in them.`);
             // Strip leading and traling slashed.
                         e.push(...n.split("/").filter((t => t.length > 0)));
         }
@@ -626,20 +626,20 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
         const e = [];
         let n = "", r = 0;
         const s = () => {
-            if (0 === n.length) throw new U(A, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
+            if (0 === n.length) throw new U(I, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
             e.push(n), n = "";
         };
         let i = !1;
         for (;r < t.length; ) {
             const e = t[r];
             if ("\\" === e) {
-                if (r + 1 === t.length) throw new U(A, "Path has trailing escape character: " + t);
+                if (r + 1 === t.length) throw new U(I, "Path has trailing escape character: " + t);
                 const e = t[r + 1];
-                if ("\\" !== e && "." !== e && "`" !== e) throw new U(A, "Path has invalid escape sequence: " + t);
+                if ("\\" !== e && "." !== e && "`" !== e) throw new U(I, "Path has invalid escape sequence: " + t);
                 n += e, r += 2;
             } else "`" === e ? (i = !i, r++) : "." !== e || i ? (n += e, r++) : (s(), r++);
         }
-        if (s(), i) throw new U(A, "Unterminated ` in path: " + t);
+        if (s(), i) throw new U(I, "Unterminated ` in path: " + t);
         return new tt(e);
     }
     static emptyPath() {
@@ -728,7 +728,7 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */ function nt(t, e, n) {
-    if (!n) throw new U(A, `Function ${t}() cannot be called with an empty ${e}.`);
+    if (!n) throw new U(I, `Function ${t}() cannot be called with an empty ${e}.`);
 }
 
 /**
@@ -740,14 +740,14 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  * an even numbers of segments).
  */
 function rt(t) {
-    if (!et.isDocumentKey(t)) throw new U(A, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
+    if (!et.isDocumentKey(t)) throw new U(I, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
  * Validates that `path` refers to a collection (indicated by the fact it
  * contains an odd numbers of segments).
  */ function st(t) {
-    if (et.isDocumentKey(t)) throw new U(A, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
+    if (et.isDocumentKey(t)) throw new U(I, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
@@ -791,17 +791,17 @@ e) {
     // Unwrap Compat types
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     t = t._delegate), !(t instanceof e)) {
-        if (e.name === t.constructor.name) throw new U(A, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
+        if (e.name === t.constructor.name) throw new U(I, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
             const n = it(t);
-            throw new U(A, `Expected type '${e.name}', but it was: ${n}`);
+            throw new U(I, `Expected type '${e.name}', but it was: ${n}`);
         }
     }
     return t;
 }
 
 function ut(t, e) {
-    if (e <= 0) throw new U(A, `Function ${t}() requires a positive number, but it was: ${e}.`);
+    if (e <= 0) throw new U(I, `Function ${t}() requires a positive number, but it was: ${e}.`);
 }
 
 /**
@@ -822,11 +822,11 @@ function ut(t, e) {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function ct(t) {
+ */ function at(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function at(t) {
+/** Returns whether the value represents -0. */ function ct(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;
@@ -899,7 +899,7 @@ var lt, ft;
  *     Code.UNKNOWN.
  */
 function dt(t) {
-    if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), I;
+    if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), A;
     // The canonical error codes for Google APIs [1] specify mapping onto HTTP
     // status codes but the mapping is not bijective. In each case of ambiguity
     // this function chooses a primary error.
@@ -932,13 +932,13 @@ function dt(t) {
 
       case 409:
         // Conflict
-        return F;
+        return x;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return x;
+        return F;
 
       case 429:
         // Too Many Requests
@@ -950,7 +950,7 @@ function dt(t) {
 
       case 500:
         // Internal Server Error
-        return I;
+        return A;
 
         // Other possibilities:
         // return Code.INTERNAL;
@@ -968,7 +968,7 @@ function dt(t) {
         return R;
 
       default:
-        return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? S : t >= 500 && t < 600 ? O : I;
+        return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? S : t >= 500 && t < 600 ? O : A;
     }
 }
 
@@ -1048,16 +1048,16 @@ class {
      * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.
      */
     constructor(t, e) {
-        super(t), this.I = e;
+        super(t), this.A = e;
     }
-    A(t, e) {
+    I(t, e) {
         throw new Error("Not supported by FetchConnection");
     }
     async v(t, e, n, r) {
         const s = JSON.stringify(r);
         let i;
         try {
-            i = await this.I(e, {
+            i = await this.A(e, {
                 method: "POST",
                 headers: n,
                 body: s
@@ -1211,11 +1211,11 @@ class gt {
      * The fractions of a second at nanosecond resolution.*
      */
     e) {
-        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new U(A, "Timestamp nanoseconds out of range: " + e);
-        if (e >= 1e9) throw new U(A, "Timestamp nanoseconds out of range: " + e);
-        if (t < -62135596800) throw new U(A, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new U(I, "Timestamp nanoseconds out of range: " + e);
+        if (e >= 1e9) throw new U(I, "Timestamp nanoseconds out of range: " + e);
+        if (t < -62135596800) throw new U(I, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new U(A, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new U(I, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
@@ -1320,18 +1320,18 @@ class gt {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ class vt {
+ */ class bt {
     constructor(t) {
         this.timestamp = t;
     }
     static fromTimestamp(t) {
-        return new vt(t);
+        return new bt(t);
     }
     static min() {
-        return new vt(new gt(0, 0));
+        return new bt(new gt(0, 0));
     }
     static max() {
-        return new vt(new gt(253402300799, 999999999));
+        return new bt(new gt(253402300799, 999999999));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -1366,7 +1366,7 @@ class gt {
  * 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 bt(t) {
+ */ function vt(t) {
     let e = 0;
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
@@ -1465,13 +1465,13 @@ class Tt {
  * before being sent as a proto.
  * @internal
  */
-class It {
+class At {
     constructor(t) {
         this.binaryString = t;
     }
     static fromBase64String(t) {
         const e = atob(t);
-        return new It(e);
+        return new At(e);
     }
     static fromUint8Array(t) {
         // TODO(indexing); Remove the copy of the byte string here as this method
@@ -1488,7 +1488,7 @@ class It {
         /**
  * Helper function to convert a binary string to an Uint8Array.
  */ (t);
-        return new It(e);
+        return new At(e);
     }
     [Symbol.iterator]() {
         let t = 0;
@@ -1543,9 +1543,9 @@ class It {
     }
 }
 
-It.EMPTY_BYTE_STRING = new It("");
+At.EMPTY_BYTE_STRING = new At("");
 
-const At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
 /**
  * Converts the possible Proto values for a timestamp value into a "seconds and
@@ -1554,13 +1554,13 @@ const At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     // The json interface (for the browser) will return an iso timestamp string,
     // while the proto js library (for node) will return a
     // google.protobuf.Timestamp instance.
-    if (v(!!t), "string" == typeof t) {
+    if (b(!!t), "string" == typeof t) {
         // The date string can have higher precision (nanos) than the Date class
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
         let e = 0;
-        const n = At.exec(t);
-        if (v(!!n), n[1]) {
+        const n = It.exec(t);
+        if (b(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = n[1];
             t = (t + "000000000").substr(0, 9), e = Number(t);
@@ -1587,7 +1587,7 @@ const At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 }
 
 /** Converts the possible Proto types for Blobs into a ByteString. */ function Vt(t) {
-    return "string" == typeof t ? It.fromBase64String(t) : It.fromUint8Array(t);
+    return "string" == typeof t ? At.fromBase64String(t) : At.fromUint8Array(t);
 }
 
 /**
@@ -1660,9 +1660,16 @@ const At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * 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 St = {
+    fields: {
+        __type__: {
+            stringValue: "__max__"
+        }
+    }
+};
+
 /** Extracts the backend's type order for the provided value. */
-function St(t) {
+function xt(t) {
     return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Dt(t) ? 4 /* ServerTimestampValue */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
@@ -1687,13 +1694,13 @@ function St(t) {
     /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ (t) ? 9 /* ArrayValue */ : 10 /* ObjectValue */ : g();
+ */ (t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : g();
 }
 
 /** Tests `left` and `right` for equality based on the backend semantics. */ function Ft(t, e) {
     if (t === e) return !0;
-    const n = St(t);
-    if (n !== St(e)) return !1;
+    const n = xt(t);
+    if (n !== xt(e)) return !1;
     switch (n) {
       case 0 /* NullValue */ :
       case 9007199254740991 /* MaxValue */ :
@@ -1735,7 +1742,7 @@ function St(t) {
             if ("integerValue" in t && "integerValue" in e) return Pt(t.integerValue) === Pt(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
                 const n = Pt(t.doubleValue), r = Pt(e.doubleValue);
-                return n === r ? at(n) === at(r) : isNaN(n) && isNaN(r);
+                return n === r ? ct(n) === ct(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
@@ -1746,7 +1753,7 @@ function St(t) {
       case 10 /* ObjectValue */ :
         return function(t, e) {
             const n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (bt(n) !== bt(r)) return !1;
+            if (vt(n) !== vt(r)) return !1;
             for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Ft(n[t], r[t]))) return !1;
             return !0;
         }
@@ -1757,13 +1764,13 @@ function St(t) {
     }
 }
 
-function xt(t, e) {
+function qt(t, e) {
     return void 0 !== (t.values || []).find((t => Ft(t, e)));
 }
 
-function qt(t, e) {
+function Ot(t, e) {
     if (t === e) return 0;
-    const n = St(t), r = St(e);
+    const n = xt(t), r = xt(e);
     if (n !== r) return yt(n, r);
     switch (n) {
       case 0 /* NullValue */ :
@@ -1782,10 +1789,10 @@ function qt(t, e) {
         }(t, e);
 
       case 3 /* TimestampValue */ :
-        return Ot(t.timestampValue, e.timestampValue);
+        return Ct(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return Ot($t(t), $t(e));
+        return Ct($t(t), $t(e));
 
       case 5 /* StringValue */ :
         return yt(t.stringValue, e.stringValue);
@@ -1817,7 +1824,7 @@ function qt(t, e) {
         return function(t, e) {
             const n = t.values || [], r = e.values || [];
             for (let t = 0; t < n.length && t < r.length; ++t) {
-                const e = qt(n[t], r[t]);
+                const e = Ot(n[t], r[t]);
                 if (e) return e;
             }
             return yt(n.length, r.length);
@@ -1825,6 +1832,9 @@ function qt(t, e) {
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
+            if (t === St && e === St) return 0;
+            if (t === St) return 1;
+            if (e === St) 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
@@ -1834,7 +1844,7 @@ function qt(t, e) {
             for (let t = 0; t < r.length && t < i.length; ++t) {
                 const e = yt(r[t], i[t]);
                 if (0 !== e) return e;
-                const o = qt(n[r[t]], s[i[t]]);
+                const o = Ot(n[r[t]], s[i[t]]);
                 if (0 !== o) return o;
             }
             return yt(r.length, i.length);
@@ -1846,35 +1856,35 @@ function qt(t, e) {
     }
 }
 
-function Ot(t, e) {
+function Ct(t, e) {
     if ("string" == typeof t && "string" == typeof e && t.length === e.length) return yt(t, e);
     const n = Rt(t), r = Rt(e), s = yt(n.seconds, r.seconds);
     return 0 !== s ? s : yt(n.nanos, r.nanos);
 }
 
-function Ct(t, e) {
+function Lt(t, e) {
     return {
         referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${e.path.canonicalString()}`
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Lt(t) {
+/** Returns true if `value` is an ArrayValue. */ function Ut(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Ut(t) {
+/** Returns true if `value` is a NullValue. */ function kt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function kt(t) {
+/** Returns true if `value` is NaN. */ function jt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function jt(t) {
+/** Returns true if `value` is a MapValue. */ function Mt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Mt(t) {
+/** Creates a deep copy of `source`. */ function Bt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1887,7 +1897,7 @@ function Ct(t, e) {
                 fields: {}
             }
         };
-        return Et(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Mt(n))), e;
+        return Et(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Bt(n))), e;
     }
     if (t.arrayValue) {
         const e = {
@@ -1895,18 +1905,18 @@ function Ct(t, e) {
                 values: []
             }
         };
-        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Mt(t.arrayValue.values[n]);
+        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Bt(t.arrayValue.values[n]);
         return e;
     }
     return Object.assign({}, t);
 }
 
-class Bt {
+class zt {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new Bt({
+        return new zt({
             mapValue: {}
         });
     }
@@ -1920,7 +1930,7 @@ class Bt {
         {
             let e = this.value;
             for (let n = 0; n < t.length - 1; ++n) if (e = (e.mapValue.fields || {})[t.get(n)], 
-            !jt(e)) return null;
+            !Mt(e)) return null;
             return e = (e.mapValue.fields || {})[t.lastSegment()], e || null;
         }
     }
@@ -1930,7 +1940,7 @@ class Bt {
      * @param path - The field path to set.
      * @param value - The value to set.
      */    set(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Mt(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Bt(e);
     }
     /**
      * Sets the provided fields to the provided values.
@@ -1944,7 +1954,7 @@ class Bt {
                 const t = this.getFieldsMap(e);
                 this.applyChanges(t, n, r), n = {}, r = [], e = s.popLast();
             }
-            t ? n[s.lastSegment()] = Mt(t) : r.push(s.lastSegment());
+            t ? n[s.lastSegment()] = Bt(t) : r.push(s.lastSegment());
         }));
         const s = this.getFieldsMap(e);
         this.applyChanges(s, n, r);
@@ -1956,7 +1966,7 @@ class Bt {
      * @param path - The field path to remove.
      */    delete(t) {
         const e = this.field(t.popLast());
-        jt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        Mt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }
     isEqual(t) {
         return Ft(this.value, t.value);
@@ -1971,7 +1981,7 @@ class Bt {
         });
         for (let n = 0; n < t.length; ++n) {
             let r = e.mapValue.fields[t.get(n)];
-            jt(r) && r.mapValue.fields || (r = {
+            Mt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -1987,7 +1997,7 @@ class Bt {
         for (const e of n) delete t[e];
     }
     clone() {
-        return new Bt(Mt(this.value));
+        return new zt(Bt(this.value));
     }
 }
 
@@ -2016,7 +2026,7 @@ class Bt {
  * 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 zt {
+ */ class Gt {
     constructor(t, e, n, r, s, i) {
         this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.data = s, 
         this.documentState = i;
@@ -2025,23 +2035,23 @@ class Bt {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new zt(t, 0 /* INVALID */ , vt.min(), vt.min(), Bt.empty(), 0 /* SYNCED */);
+        return new Gt(t, 0 /* INVALID */ , bt.min(), bt.min(), zt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist with the given data at the
      * given version.
      */    static newFoundDocument(t, e, n) {
-        return new zt(t, 1 /* FOUND_DOCUMENT */ , e, vt.min(), n, 0 /* SYNCED */);
+        return new Gt(t, 1 /* FOUND_DOCUMENT */ , e, bt.min(), n, 0 /* SYNCED */);
     }
     /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, e) {
-        return new zt(t, 2 /* NO_DOCUMENT */ , e, vt.min(), Bt.empty(), 0 /* SYNCED */);
+        return new Gt(t, 2 /* NO_DOCUMENT */ , e, bt.min(), zt.empty(), 0 /* 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 zt(t, 3 /* UNKNOWN_DOCUMENT */ , e, vt.min(), Bt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new Gt(t, 3 /* UNKNOWN_DOCUMENT */ , e, bt.min(), zt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2054,7 +2064,7 @@ class Bt {
      * Changes the document type to indicate that it doesn't exist at the given
      * version.
      */    convertToNoDocument(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Bt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = zt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }
     /**
@@ -2062,7 +2072,7 @@ class Bt {
      * that its data is not known (e.g. a document that was updated without a known
      * base document).
      */    convertToUnknownDocument(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Bt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = zt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasCommittedMutations() {
@@ -2096,10 +2106,10 @@ class Bt {
         return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
     }
     isEqual(t) {
-        return t instanceof zt && 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 Gt && 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 zt(this.key, this.documentType, this.version, this.readTime, this.data.clone(), this.documentState);
+        return new Gt(this.key, this.documentType, this.version, this.readTime, this.data.clone(), this.documentState);
     }
     toString() {
         return `Document(${this.key}, ${this.version}, ${JSON.stringify(this.data.value)}, {documentType: ${this.documentType}}), {documentState: ${this.documentState}})`;
@@ -2123,7 +2133,7 @@ class Bt {
  * limitations under the License.
  */
 // Visible for testing
-class Gt {
+class Qt {
     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.P = null;
@@ -2137,26 +2147,26 @@ class Gt {
  * NOTE: you should always construct `Target` from `Query.toTarget` instead of
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
- */ function Qt(t, e = null, n = [], r = [], s = null, i = null, o = null) {
-    return new Gt(t, e, n, r, s, i, o);
+ */ function Wt(t, e = null, n = [], r = [], s = null, i = null, o = null) {
+    return new Qt(t, e, n, r, s, i, o);
 }
 
-class Wt extends class {} {
+class Yt extends class {} {
     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" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, n) : new Yt(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Xt(t, n) : "in" /* IN */ === e ? new Zt(t, n) : "not-in" /* NOT_IN */ === e ? new te(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ee(t, n) : new Wt(t, e, n);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, n) : new Ht(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Zt(t, n) : "in" /* IN */ === e ? new te(t, n) : "not-in" /* NOT_IN */ === e ? new ee(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ne(t, n) : new Yt(t, e, n);
     }
     static V(t, e, n) {
-        return "in" /* IN */ === e ? new Ht(t, n) : new Kt(t, n);
+        return "in" /* IN */ === e ? new Kt(t, n) : new Jt(t, n);
     }
     matches(t) {
         const e = t.data.field(this.field);
         // Types do not have to match in NOT_EQUAL filters.
-                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.D(qt(e, this.value)) : null !== e && St(this.value) === St(e) && this.D(qt(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.D(Ot(e, this.value)) : null !== e && xt(this.value) === xt(e) && this.D(Ot(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
     D(t) {
@@ -2189,7 +2199,7 @@ class Wt extends class {} {
 }
 
 /** Filter that matches on key fields (i.e. '__name__'). */
-class Yt extends Wt {
+class Ht extends Yt {
     constructor(t, e, n) {
         super(t, e, n), this.key = et.fromName(n.referenceValue);
     }
@@ -2199,69 +2209,69 @@ class Yt extends Wt {
     }
 }
 
-/** Filter that matches on key fields within an array. */ class Ht extends Wt {
+/** Filter that matches on key fields within an array. */ class Kt extends Yt {
     constructor(t, e) {
-        super(t, "in" /* IN */ , e), this.keys = Jt("in" /* IN */ , e);
+        super(t, "in" /* IN */ , e), this.keys = Xt("in" /* 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 Kt extends Wt {
+/** Filter that matches on key fields not present within an array. */ class Jt extends Yt {
     constructor(t, e) {
-        super(t, "not-in" /* NOT_IN */ , e), this.keys = Jt("not-in" /* NOT_IN */ , e);
+        super(t, "not-in" /* NOT_IN */ , e), this.keys = Xt("not-in" /* NOT_IN */ , e);
     }
     matches(t) {
         return !this.keys.some((e => e.isEqual(t.key)));
     }
 }
 
-function Jt(t, e) {
+function Xt(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => et.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class Xt extends Wt {
+/** A Filter that implements the array-contains operator. */ class Zt extends Yt {
     constructor(t, e) {
         super(t, "array-contains" /* ARRAY_CONTAINS */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return Lt(e) && xt(e.arrayValue, this.value);
+        return Ut(e) && qt(e.arrayValue, this.value);
     }
 }
 
-/** A Filter that implements the IN operator. */ class Zt extends Wt {
+/** A Filter that implements the IN operator. */ class te extends Yt {
     constructor(t, e) {
         super(t, "in" /* IN */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return null !== e && xt(this.value.arrayValue, e);
+        return null !== e && qt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the not-in operator. */ class te extends Wt {
+/** A Filter that implements the not-in operator. */ class ee extends Yt {
     constructor(t, e) {
         super(t, "not-in" /* NOT_IN */ , e);
     }
     matches(t) {
-        if (xt(this.value.arrayValue, {
+        if (qt(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         const e = t.data.field(this.field);
-        return null !== e && !xt(this.value.arrayValue, e);
+        return null !== e && !qt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the array-contains-any operator. */ class ee extends Wt {
+/** A Filter that implements the array-contains-any operator. */ class ne extends Yt {
     constructor(t, e) {
         super(t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return !(!Lt(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => xt(this.value.arrayValue, t)));
+        return !(!Ut(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => qt(this.value.arrayValue, t)));
     }
 }
 
@@ -2278,7 +2288,7 @@ function Jt(t, e) {
  * Bound provides a function to determine whether a document comes before or
  * after a bound. This is influenced by whether the position is just before or
  * just after the provided values.
- */ class ne {
+ */ class re {
     constructor(t, e) {
         this.position = t, this.inclusive = e;
     }
@@ -2286,17 +2296,17 @@ function Jt(t, e) {
 
 /**
  * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
- */ class re {
+ */ class se {
     constructor(t, e = "asc" /* ASCENDING */) {
         this.field = t, this.dir = e;
     }
 }
 
-function se(t, e) {
+function ie(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
-function ie(t, e) {
+function oe(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;
@@ -2328,7 +2338,7 @@ function ie(t, e) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ class oe {
+ */ class ue {
     /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2341,7 +2351,7 @@ function ie(t, e) {
     }
 }
 
-/** Creates a new Query for a query that matches all documents at `path` */ function ue(t) {
+/** Creates a new Query for a query that matches all documents at `path` */ function ae(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
@@ -2358,7 +2368,7 @@ function ce(t) {
  * Returns whether the query matches a collection group rather than a specific
  * collection.
  */
-function ae(t) {
+function he(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2366,23 +2376,23 @@ function ae(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 he(t) {
-    const e = b(t);
+ */ function le(t) {
+    const e = v(t);
     if (null === e.$) {
         e.$ = [];
-        const t = ce(e), n = ue(e);
+        const t = ce(e), n = ae(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.$.push(new re(t)), e.$.push(new re(tt.keyField(), "asc" /* ASCENDING */)); else {
+        t.isKeyField() || e.$.push(new se(t)), e.$.push(new se(tt.keyField(), "asc" /* ASCENDING */)); else {
             let t = !1;
             for (const n of e.explicitOrderBy) e.$.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" /* ASCENDING */;
-                e.$.push(new re(tt.keyField(), t));
+                e.$.push(new se(tt.keyField(), t));
             }
         }
     }
@@ -2391,34 +2401,34 @@ function ae(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function le(t) {
-    const e = b(t);
-    if (!e.S) if ("F" /* First */ === e.limitType) e.S = Qt(e.path, e.collectionGroup, he(e), e.filters, e.limit, e.startAt, e.endAt); else {
+ */ function fe(t) {
+    const e = v(t);
+    if (!e.S) if ("F" /* First */ === e.limitType) e.S = Wt(e.path, e.collectionGroup, le(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 he(e)) {
+        for (const n of le(e)) {
             const e = "desc" /* DESCENDING */ === n.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            t.push(new re(n.field, e));
+            t.push(new se(n.field, e));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                const n = e.endAt ? new ne(e.endAt.position, !e.endAt.inclusive) : null, r = e.startAt ? new ne(e.startAt.position, !e.startAt.inclusive) : null;
+                const n = e.endAt ? new re(e.endAt.position, e.endAt.inclusive) : null, r = e.startAt ? new re(e.startAt.position, e.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
-        e.S = Qt(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
+        e.S = Wt(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
     }
     return e.S;
 }
 
-function fe(t, e) {
+function de(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 (!se(t.orderBy[n], e.orderBy[n])) return !1;
+        for (let n = 0; n < t.orderBy.length; n++) if (!ie(t.orderBy[n], e.orderBy[n])) return !1;
         if (t.filters.length !== e.filters.length) return !1;
         for (let s = 0; s < t.filters.length; s++) if (n = t.filters[s], r = e.filters[s], 
         n.op !== r.op || !n.field.isEqual(r.field) || !Ft(n.value, r.value)) return !1;
         var n, r;
-        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!ie(t.startAt, e.startAt) && ie(t.endAt, e.endAt);
-    }(le(t), le(e)) && t.limitType === e.limitType;
+        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!oe(t.startAt, e.startAt) && oe(t.endAt, e.endAt);
+    }(fe(t), fe(e)) && t.limitType === e.limitType;
 }
 
 /**
@@ -2446,9 +2456,9 @@ function fe(t, e) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function de(t, e) {
+function we(t, e) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !at(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !ct(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
     /**
  * Returns an IntegerValue for `value`.
@@ -2470,7 +2480,7 @@ function de(t, e) {
             };
         }
         return {
-            doubleValue: at(e) ? "-0" : e
+            doubleValue: ct(e) ? "-0" : e
         };
     }(t, e);
 }
@@ -2491,7 +2501,7 @@ function de(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 we {
+/** Used to represent a field transform on a mutation. */ class me {
     constructor() {
         // Make sure that the structural type of `TransformOperation` is unique.
         // See https://github.com/microsoft/TypeScript/issues/5451
@@ -2499,15 +2509,15 @@ function de(t, e) {
     }
 }
 
-/** Transforms a value into a server-generated timestamp. */ class me extends we {}
+/** Transforms a value into a server-generated timestamp. */ class pe extends me {}
 
-/** Transforms an array value via a union operation. */ class pe extends we {
+/** Transforms an array value via a union operation. */ class ye extends me {
     constructor(t) {
         super(), this.elements = t;
     }
 }
 
-/** Transforms an array value via a remove operation. */ class ye extends we {
+/** Transforms an array value via a remove operation. */ class _e extends me {
     constructor(t) {
         super(), this.elements = t;
     }
@@ -2518,7 +2528,7 @@ function de(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 _e extends we {
+ */ class ge extends me {
     constructor(t, e) {
         super(), this.q = t, this.O = e;
     }
@@ -2540,7 +2550,7 @@ function de(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 ge {
+/** A field path and the TransformOperation to perform upon it. */ class be {
     constructor(t, e) {
         this.field = t, this.transform = e;
     }
@@ -2614,12 +2624,12 @@ function de(t, e) {
  * applyToLocalView() to implement the actual behavior of applying the mutation
  * to some source document (see `setMutationApplyToRemoteDocument()` for an
  * example).
- */ class be {}
+ */ class Ee {}
 
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class Ee extends be {
+ */ class Te extends Ee {
     constructor(t, e, n, r = []) {
         super(), this.key = t, this.value = e, this.precondition = n, this.fieldTransforms = r, 
         this.type = 0 /* Set */;
@@ -2638,14 +2648,14 @@ function de(t, e) {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ class Te extends be {
+ */ class Ae extends Ee {
     constructor(t, e, n, r, s = []) {
         super(), this.key = t, this.data = e, this.fieldMask = n, this.precondition = r, 
         this.fieldTransforms = s, this.type = 1 /* Patch */;
     }
 }
 
-/** A mutation that deletes the document at the given key. */ class Ie extends be {
+/** A mutation that deletes the document at the given key. */ class Ie extends Ee {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 2 /* Delete */ , this.fieldTransforms = [];
     }
@@ -2657,7 +2667,7 @@ function de(t, e) {
  *
  * The `verify` operation is only used in Transactions, and this class serves
  * primarily to facilitate serialization into protos.
- */ class Ae extends be {
+ */ class Re extends Ee {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 3 /* Verify */ , this.fieldTransforms = [];
     }
@@ -2678,13 +2688,13 @@ function de(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 Re = (() => {
+ */ const Pe = (() => {
     const t = {
         asc: "ASCENDING",
         desc: "DESCENDING"
     };
     return t;
-})(), Pe = (() => {
+})(), Ve = (() => {
     const t = {
         "<": "LESS_THAN",
         "<=": "LESS_THAN_OR_EQUAL",
@@ -2714,7 +2724,7 @@ function de(t, e) {
  * TODO(klimt): We can remove the databaseId argument if we keep the full
  * resource name in documents.
  */
-class Ve {
+class De {
     constructor(t, e) {
         this.databaseId = t, this.F = e;
     }
@@ -2731,7 +2741,7 @@ class Ve {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function De(t, e) {
+function Ne(t, e) {
     if (t.F) {
         return `${new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + e.nanoseconds).slice(-9)}Z`;
     }
@@ -2746,16 +2756,16 @@ function De(t, e) {
  *
  * Visible for testing.
  */
-function Ne(t, e) {
+function $e(t, e) {
     return t.F ? e.toBase64() : e.toUint8Array();
 }
 
-function $e(t, e) {
-    return De(t, e.toTimestamp());
+function Se(t, e) {
+    return Ne(t, e.toTimestamp());
 }
 
-function Se(t) {
-    return v(!!t), vt.fromTimestamp(function(t) {
+function xe(t) {
+    return b(!!t), bt.fromTimestamp(function(t) {
         const e = Rt(t);
         return new gt(e.seconds, e.nanos);
     }(t));
@@ -2767,108 +2777,108 @@ function Fe(t, e) {
     }(t).child("documents").child(e).canonicalString();
 }
 
-function xe(t, e) {
+function qe(t, e) {
     return Fe(t.databaseId, e.path);
 }
 
-function qe(t, e) {
+function Oe(t, e) {
     const n = function(t) {
         const e = X.fromString(t);
-        return v(Qe(e)), e;
+        return b(We(e)), e;
     }(e);
-    if (n.get(1) !== t.databaseId.projectId) throw new U(A, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
-    if (n.get(3) !== t.databaseId.database) throw new U(A, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
-    return new et((v((r = n).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
+    if (n.get(1) !== t.databaseId.projectId) throw new U(I, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
+    if (n.get(3) !== t.databaseId.database) throw new U(I, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
+    return new et((b((r = n).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
     var r;
     /** Creates a Document proto from key and fields (but no create/update time) */}
 
-function Oe(t, e) {
+function Ce(t, e) {
     return Fe(t.databaseId, e);
 }
 
-function Ce(t) {
+function Le(t) {
     return new X([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Le(t, e, n) {
+function Ue(t, e, n) {
     return {
-        name: xe(t, e),
+        name: qe(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function Ue(t, e) {
+function ke(t, e) {
     return "found" in e ? function(t, e) {
-        v(!!e.found), e.found.name, e.found.updateTime;
-        const n = qe(t, e.found.name), r = Se(e.found.updateTime), s = new Bt({
+        b(!!e.found), e.found.name, e.found.updateTime;
+        const n = Oe(t, e.found.name), r = xe(e.found.updateTime), s = new zt({
             mapValue: {
                 fields: e.found.fields
             }
         });
-        return zt.newFoundDocument(n, r, s);
+        return Gt.newFoundDocument(n, r, s);
     }(t, e) : "missing" in e ? function(t, e) {
-        v(!!e.missing), v(!!e.readTime);
-        const n = qe(t, e.missing), r = Se(e.readTime);
-        return zt.newNoDocument(n, r);
+        b(!!e.missing), b(!!e.readTime);
+        const n = Oe(t, e.missing), r = xe(e.readTime);
+        return Gt.newNoDocument(n, r);
     }(t, e) : g();
 }
 
-function ke(t, e) {
+function je(t, e) {
     let n;
-    if (e instanceof Ee) n = {
-        update: Le(t, e.key, e.value)
+    if (e instanceof Te) n = {
+        update: Ue(t, e.key, e.value)
     }; else if (e instanceof Ie) n = {
-        delete: xe(t, e.key)
-    }; else if (e instanceof Te) n = {
-        update: Le(t, e.key, e.data),
-        updateMask: Ge(e.fieldMask)
+        delete: qe(t, e.key)
+    }; else if (e instanceof Ae) n = {
+        update: Ue(t, e.key, e.data),
+        updateMask: Qe(e.fieldMask)
     }; else {
-        if (!(e instanceof Ae)) return g();
+        if (!(e instanceof Re)) return g();
         n = {
-            verify: xe(t, e.key)
+            verify: qe(t, e.key)
         };
     }
     return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((t => function(t, e) {
         const n = e.transform;
-        if (n instanceof me) return {
+        if (n instanceof pe) return {
             fieldPath: e.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
-        if (n instanceof pe) return {
+        if (n instanceof ye) return {
             fieldPath: e.field.canonicalString(),
             appendMissingElements: {
                 values: n.elements
             }
         };
-        if (n instanceof ye) return {
+        if (n instanceof _e) return {
             fieldPath: e.field.canonicalString(),
             removeAllFromArray: {
                 values: n.elements
             }
         };
-        if (n instanceof _e) return {
+        if (n instanceof ge) return {
             fieldPath: e.field.canonicalString(),
             increment: n.O
         };
         throw g();
     }(0, t)))), e.precondition.isNone || (n.currentDocument = function(t, e) {
         return void 0 !== e.updateTime ? {
-            updateTime: $e(t, e.updateTime)
+            updateTime: Se(t, e.updateTime)
         } : void 0 !== e.exists ? {
             exists: e.exists
         } : g();
     }(t, e.precondition)), n;
 }
 
-function je(t, e) {
+function Me(t, e) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const n = {
         structuredQuery: {}
     }, r = e.path;
-    null !== e.collectionGroup ? (n.parent = Oe(t, r), n.structuredQuery.from = [ {
+    null !== e.collectionGroup ? (n.parent = Ce(t, r), n.structuredQuery.from = [ {
         collectionId: e.collectionGroup,
         allDescendants: !0
-    } ]) : (n.parent = Oe(t, r.popLast()), n.structuredQuery.from = [ {
+    } ]) : (n.parent = Ce(t, r.popLast()), n.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     const s = function(t) {
@@ -2877,36 +2887,36 @@ function je(t, e) {
         // visible for testing
         function(t) {
             if ("==" /* EQUAL */ === t.op) {
-                if (kt(t.value)) return {
+                if (jt(t.value)) return {
                     unaryFilter: {
-                        field: ze(t.field),
+                        field: Ge(t.field),
                         op: "IS_NAN"
                     }
                 };
-                if (Ut(t.value)) return {
+                if (kt(t.value)) return {
                     unaryFilter: {
-                        field: ze(t.field),
+                        field: Ge(t.field),
                         op: "IS_NULL"
                     }
                 };
             } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                if (kt(t.value)) return {
+                if (jt(t.value)) return {
                     unaryFilter: {
-                        field: ze(t.field),
+                        field: Ge(t.field),
                         op: "IS_NOT_NAN"
                     }
                 };
-                if (Ut(t.value)) return {
+                if (kt(t.value)) return {
                     unaryFilter: {
-                        field: ze(t.field),
+                        field: Ge(t.field),
                         op: "IS_NOT_NULL"
                     }
                 };
             }
             return {
                 fieldFilter: {
-                    field: ze(t.field),
-                    op: Be(t.op),
+                    field: Ge(t.field),
+                    op: ze(t.op),
                     value: t.value
                 }
             };
@@ -2926,14 +2936,14 @@ function je(t, e) {
         // visible for testing
         function(t) {
             return {
-                field: ze(t.field),
-                direction: Me(t.dir)
+                field: Ge(t.field),
+                direction: Be(t.dir)
             };
         }(t)));
     }(e.orderBy);
     i && (n.structuredQuery.orderBy = i);
     const o = function(t, e) {
-        return t.F || ct(e) ? e : {
+        return t.F || at(e) ? e : {
             value: e
         };
     }(t, e.limit);
@@ -2951,29 +2961,29 @@ function je(t, e) {
     (e.endAt)), n;
 }
 
-function Me(t) {
-    return Re[t];
-}
-
-// visible for testing
 function Be(t) {
     return Pe[t];
 }
 
+// visible for testing
 function ze(t) {
+    return Ve[t];
+}
+
+function Ge(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Ge(t) {
+function Qe(t) {
     const e = [];
     return t.fields.forEach((t => e.push(t.canonicalString()))), {
         fieldPaths: e
     };
 }
 
-function Qe(t) {
+function We(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2993,8 +3003,8 @@ function Qe(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 We(t) {
-    return new Ve(t, /* useProto3Json= */ !0);
+ */ function Ye(t) {
+    return new De(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -3022,7 +3032,7 @@ function Qe(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class Ye {
+class He {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3120,7 +3130,7 @@ class Ye {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class He extends class {} {
+class Ke extends class {} {
     constructor(t, e, n, r) {
         super(), this.authCredentials = t, this.appCheckCredentials = e, this.K = n, this.q = r, 
         this.J = !1;
@@ -3131,13 +3141,13 @@ class He extends class {} {
     /** Invokes the provided RPC with auth and AppCheck tokens. */    m(t, e, n) {
         return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.K.m(t, e, n, r, s))).catch((t => {
             throw "FirebaseError" === t.name ? (t.code === N && (this.authCredentials.invalidateToken(), 
-            this.appCheckCredentials.invalidateToken()), t) : new U(I, t.toString());
+            this.appCheckCredentials.invalidateToken()), t) : new U(A, t.toString());
         }));
     }
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */    T(t, e, n) {
         return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.K.T(t, e, n, r, s))).catch((t => {
             throw "FirebaseError" === t.name ? (t.code === N && (this.authCredentials.invalidateToken(), 
-            this.appCheckCredentials.invalidateToken()), t) : new U(I, t.toString());
+            this.appCheckCredentials.invalidateToken()), t) : new U(A, t.toString());
         }));
     }
     terminate() {
@@ -3147,38 +3157,38 @@ class He extends class {} {
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function Ke(t, e) {
-    const n = b(t), r = Ce(n.q) + "/documents", s = {
-        writes: e.map((t => ke(n.q, t)))
+async function Je(t, e) {
+    const n = v(t), r = Le(n.q) + "/documents", s = {
+        writes: e.map((t => je(n.q, t)))
     };
     await n.m("Commit", r, s);
 }
 
-async function Je(t, e) {
-    const n = b(t), r = Ce(n.q) + "/documents", s = {
-        documents: e.map((t => xe(n.q, t)))
+async function Xe(t, e) {
+    const n = v(t), r = Le(n.q) + "/documents", s = {
+        documents: e.map((t => qe(n.q, t)))
     }, i = await n.T("BatchGetDocuments", r, s), o = new Map;
     i.forEach((t => {
-        const e = Ue(n.q, t);
+        const e = ke(n.q, t);
         o.set(e.key.toString(), e);
     }));
     const u = [];
     return e.forEach((t => {
         const e = o.get(t.toString());
-        v(!!e), u.push(e);
+        b(!!e), u.push(e);
     })), u;
 }
 
-async function Xe(t, e) {
-    const n = b(t), r = je(n.q, le(e));
+async function Ze(t, e) {
+    const n = v(t), r = Me(n.q, fe(e));
     return (await n.T("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, e, n) {
-        const r = qe(t, e.name), s = Se(e.updateTime), i = new Bt({
+        const r = Oe(t, e.name), s = xe(e.updateTime), i = new zt({
             mapValue: {
                 fields: e.fields
             }
-        }), o = zt.newFoundDocument(r, s, i);
+        }), o = Gt.newFoundDocument(r, s, i);
         return n && o.setHasCommittedMutations(), n ? o.setHasCommittedMutations() : o;
     }(n.q, t.document, void 0)));
 }
@@ -3198,7 +3208,7 @@ async function Xe(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 Ze = new Map;
+ */ const tn = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3209,17 +3219,17 @@ async function Xe(t, e) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function tn(t) {
+function en(t) {
     if (t._terminated) throw new U(S, "The client has already been terminated.");
-    if (!Ze.has(t)) {
+    if (!tn.has(t)) {
         m("ComponentProvider", "Initializing Datastore");
         const i = function(t) {
             return new wt(t, fetch.bind(null));
         }((e = t._databaseId, n = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
-        new H(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = We(t._databaseId), u = function(t, e, n, r) {
-            return new He(t, e, n, r);
+        new H(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Ye(t._databaseId), u = function(t, e, n, r) {
+            return new Ke(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, i, o);
-        Ze.set(t, u);
+        tn.set(t, u);
     }
     var e, n, r, s;
     /**
@@ -3237,7 +3247,7 @@ function tn(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 Ze.get(t);
+ */    return tn.get(t);
 }
 
 /**
@@ -3249,21 +3259,21 @@ function tn(t) {
  * user-supplied `FirestoreSettings` object. This is a separate type so that
  * defaults can be supplied and the value can be checked for equality.
  */
-class en {
+class nn {
     constructor(t) {
         var e;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new U(A, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new U(I, "Can't provide ssl option if host option is not set");
             this.host = "firestore.googleapis.com", this.ssl = true;
         } else this.host = t.host, this.ssl = null === (e = t.ssl) || void 0 === e || e;
         if (this.credentials = t.credentials, this.ignoreUndefinedProperties = !!t.ignoreUndefinedProperties, 
         void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
-            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new U(A, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new U(I, "cacheSizeBytes must be at least 1048576");
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
         this.useFetchStreams = !!t.useFetchStreams, function(t, e, n, r) {
-            if (!0 === e && !0 === r) throw new U(A, `${t} and ${n} cannot be used together.`);
+            if (!0 === e && !0 === r) throw new U(I, `${t} and ${n} cannot be used together.`);
         }("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
     }
     isEqual(t) {
@@ -3291,17 +3301,17 @@ class en {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class nn {
+ */ class rn {
     /** @hideconstructor */
     constructor(t, e, n) {
         this._authCredentials = e, this._appCheckCredentials = n, 
         /**
          * Whether it's a Firestore or Firestore Lite instance.
          */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new en({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new nn({}), 
         this._settingsFrozen = !1, t instanceof K ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
-            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(A, '"projectId" not provided in firebase.initializeApp.');
+            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(I, '"projectId" not provided in firebase.initializeApp.');
             return new K(t.options.projectId);
         }
         /**
@@ -3331,20 +3341,20 @@ class en {
     }
     _setSettings(t) {
         if (this._settingsFrozen) throw new U(S, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
-        this._settings = new en(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new nn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new M;
             switch (t.type) {
               case "gapi":
                 const e = t.client;
                 // Make sure this really is a Gapi client.
-                                return v(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
+                                return b(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
                 new Q(e, t.sessionIndex || "0", t.iamToken || null);
 
               case "provider":
                 return t.client;
 
               default:
-                throw new U(A, "makeAuthCredentialsProvider failed due to invalid credential type");
+                throw new U(I, "makeAuthCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }
@@ -3372,13 +3382,13 @@ class en {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const e = Ze.get(t);
-            e && (m("ComponentProvider", "Removing Datastore"), Ze.delete(t), e.terminate());
+            const e = tn.get(t);
+            e && (m("ComponentProvider", "Removing Datastore"), tn.delete(t), e.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function rn(t, e) {
+function sn(t, e) {
     const n = _getProvider(t, "firestore/lite");
     if (n.isInitialized()) throw new U(S, "Firestore can only be initialized once per app.");
     return n.initialize({
@@ -3394,7 +3404,7 @@ function rn(t, e) {
  * @param app - The {@link @firebase/app#FirebaseApp} instance that the returned `Firestore`
  * instance is associated with.
  * @returns The `Firestore` instance of the provided app.
- */ function sn(e = getApp()) {
+ */ function on(e = getApp()) {
     return _getProvider(e, "firestore/lite").getImmediate();
 }
 
@@ -3410,9 +3420,9 @@ function rn(t, e) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function on(t, e, n, r = {}) {
+ */ function un(t, e, n, r = {}) {
     var s;
-    const i = (t = ot(t, nn))._getSettings();
+    const i = (t = ot(t, rn))._getSettings();
     if ("firestore.googleapis.com" !== i.host && i.host !== e && y("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, i), {
         host: `${e}:${n}`,
@@ -3424,7 +3434,7 @@ function rn(t, e) {
             // invalid field "uid" and missing field "sub" / "user_id".)
             e = createMockUserToken(r.mockUserToken, null === (s = t._app) || void 0 === s ? void 0 : s.options.projectId);
             const i = r.mockUserToken.sub || r.mockUserToken.user_id;
-            if (!i) throw new U(A, "mockUserToken must contain 'sub' or 'user_id' field!");
+            if (!i) throw new U(I, "mockUserToken must contain 'sub' or 'user_id' field!");
             n = new l(i);
         }
         t._authCredentials = new B(new j(e, n));
@@ -3450,8 +3460,8 @@ function rn(t, e) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function un(t) {
-    return t = ot(t, nn), _removeServiceInstance(t.app, "firestore/lite"), t._delete();
+ */ function an(t) {
+    return t = ot(t, rn), _removeServiceInstance(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3519,7 +3529,7 @@ class cn {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new hn(this.firestore, this.converter, this._key.path.popLast());
+        return new ln(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
         return new cn(this.firestore, t, this._key);
@@ -3529,7 +3539,7 @@ class cn {
 /**
  * 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 an {
+ */ class hn {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -3542,17 +3552,17 @@ class cn {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new an(this.firestore, t, this._query);
+        return new hn(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 hn extends an {
+ */ class ln extends hn {
     /** @hideconstructor */
     constructor(t, e, n) {
-        super(t, e, new oe(n)), this._path = n, 
+        super(t, e, new ue(n)), this._path = n, 
         /** The type of this Firestore reference. */
         this.type = "collection";
     }
@@ -3574,19 +3584,19 @@ class cn {
         /* converter= */ null, new et(t));
     }
     withConverter(t) {
-        return new hn(this.firestore, t, this._path);
+        return new ln(this.firestore, t, this._path);
     }
 }
 
-function ln(t, e, ...n) {
-    if (t = getModularInstance(t), nt("collection", "path", e), t instanceof nn) {
+function fn(t, e, ...n) {
+    if (t = getModularInstance(t), nt("collection", "path", e), t instanceof rn) {
         const r = X.fromString(e, ...n);
-        return st(r), new hn(t, /* converter= */ null, r);
+        return st(r), new ln(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof cn || t instanceof hn)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof cn || t instanceof ln)) throw new U(I, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(X.fromString(e, ...n));
-        return st(r), new hn(t.firestore, 
+        return st(r), new ln(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -3603,32 +3613,32 @@ function ln(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 fn(t, e) {
-    if (t = ot(t, nn), nt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new U(A, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new an(t, 
+ */ function dn(t, e) {
+    if (t = ot(t, rn), nt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new U(I, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new hn(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
  * within the provided collection group.
  */
     function(t) {
-        return new oe(X.emptyPath(), t);
+        return new ue(X.emptyPath(), t);
     }(e));
 }
 
-function dn(t, e, ...n) {
+function wn(t, e, ...n) {
     if (t = getModularInstance(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = pt.R()), nt("doc", "path", e), t instanceof nn) {
+    1 === arguments.length && (e = pt.R()), nt("doc", "path", e), t instanceof rn) {
         const r = X.fromString(e, ...n);
         return rt(r), new cn(t, 
         /* converter= */ null, new et(r));
     }
     {
-        if (!(t instanceof cn || t instanceof hn)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof cn || t instanceof ln)) throw new U(I, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(X.fromString(e, ...n));
-        return rt(r), new cn(t.firestore, t instanceof hn ? t.converter : null, new et(r));
+        return rt(r), new cn(t.firestore, t instanceof ln ? t.converter : null, new et(r));
     }
 }
 
@@ -3639,8 +3649,8 @@ function dn(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 wn(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof cn || t instanceof hn) && (e instanceof cn || e instanceof hn) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+ */ function mn(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof cn || t instanceof ln) && (e instanceof cn || e instanceof ln) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -3651,8 +3661,8 @@ function dn(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 = getModularInstance(t), e = getModularInstance(e), t instanceof an && e instanceof an && (t.firestore === e.firestore && fe(t._query, e._query) && t.converter === e.converter);
+ */ function pn(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), t instanceof hn && e instanceof hn && (t.firestore === e.firestore && de(t._query, e._query) && t.converter === e.converter);
 }
 
 /**
@@ -3678,7 +3688,7 @@ function dn(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 pn {
+ */ class yn {
     /**
      * 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.
@@ -3686,7 +3696,7 @@ function dn(t, e, ...n) {
      * @param fieldNames - A list of field names.
      */
     constructor(...t) {
-        for (let e = 0; e < t.length; ++e) if (0 === t[e].length) throw new U(A, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        for (let e = 0; e < t.length; ++e) if (0 === t[e].length) throw new U(I, "Invalid field name at argument $(i + 1). Field names must not be empty.");
         this._internalPath = new tt(t);
     }
     /**
@@ -3702,8 +3712,8 @@ function dn(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 yn() {
-    return new pn("__name__");
+ */ function _n() {
+    return new yn("__name__");
 }
 
 /**
@@ -3724,7 +3734,7 @@ function dn(t, e, ...n) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class _n {
+ */ class gn {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -3736,9 +3746,9 @@ function dn(t, e, ...n) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new _n(It.fromBase64String(t));
+            return new gn(At.fromBase64String(t));
         } catch (t) {
-            throw new U(A, "Failed to construct data from Base64 string: " + t);
+            throw new U(I, "Failed to construct data from Base64 string: " + t);
         }
     }
     /**
@@ -3746,7 +3756,7 @@ function dn(t, e, ...n) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new _n(It.fromUint8Array(t));
+        return new gn(At.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3798,7 +3808,7 @@ function dn(t, e, ...n) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class gn {
+ */ class bn {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -3838,8 +3848,8 @@ function dn(t, e, ...n) {
      * @param longitude - The longitude as number between -180 and 180.
      */
     constructor(t, e) {
-        if (!isFinite(t) || t < -90 || t > 90) throw new U(A, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(e) || e < -180 || e > 180) throw new U(A, "Longitude must be a number between -180 and 180, but was: " + e);
+        if (!isFinite(t) || t < -90 || t > 90) throw new U(I, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(e) || e < -180 || e > 180) throw new U(I, "Longitude must be a number between -180 and 180, but was: " + e);
         this._lat = t, this._long = e;
     }
     /**
@@ -3889,25 +3899,25 @@ function dn(t, e, ...n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const bn = /^__.*__$/;
+ */ const En = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class En {
+/** The result of parsing document data (e.g. for a setData call). */ class Tn {
     constructor(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return null !== this.fieldMask ? new Te(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Ee(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new Ae(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Te(t, this.data, e, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class Tn {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class An {
     constructor(t, 
     // The fieldMask does not include document transforms.
     e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return new Te(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new Ae(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }
 }
 
@@ -3929,7 +3939,7 @@ function In(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class An {
+/** A "context" object passed around while parsing user data. */ class Rn {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3961,7 +3971,7 @@ function In(t) {
         return this.settings.tt;
     }
     /** Returns a new context with the specified settings overwritten. */    et(t) {
-        return new An(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+        return new Rn(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
     nt(t) {
         var e;
@@ -3988,7 +3998,7 @@ function In(t) {
         });
     }
     ut(t) {
-        return Gn(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
+        return Qn(t, this.settings.methodName, this.settings.at || !1, this.path, this.settings.ct);
     }
     /** 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)));
@@ -4000,52 +4010,52 @@ function In(t) {
     }
     st(t) {
         if (0 === t.length) throw this.ut("Document fields must not be empty");
-        if (In(this.tt) && bn.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
+        if (In(this.tt) && En.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
     }
 }
 
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ class Rn {
+ */ class Pn {
     constructor(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.q = n || We(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.q = n || Ye(t);
     }
     /** Creates a new top-level parse context. */    ht(t, e, n, r = !1) {
-        return new An({
+        return new Rn({
             tt: t,
             methodName: e,
-            at: n,
+            ct: n,
             path: tt.emptyPath(),
             rt: !1,
-            ct: r
+            at: r
         }, this.databaseId, this.q, this.ignoreUndefinedProperties);
     }
 }
 
-function Pn(t) {
-    const e = t._freezeSettings(), n = We(t._databaseId);
-    return new Rn(t._databaseId, !!e.ignoreUndefinedProperties, n);
+function Vn(t) {
+    const e = t._freezeSettings(), n = Ye(t._databaseId);
+    return new Pn(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function Vn(t, e, n, r, s, i = {}) {
+/** Parse document data from a set() call. */ function Dn(t, e, n, r, s, i = {}) {
     const o = t.ht(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, s);
-    jn("Data must be an object, but it was:", o, r);
-    const u = Un(r, o);
-    let c, a;
-    if (i.merge) c = new Tt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
+    Mn("Data must be an object, but it was:", o, r);
+    const u = kn(r, o);
+    let a, c;
+    if (i.merge) a = new Tt(o.fieldMask), c = o.fieldTransforms; else if (i.mergeFields) {
         const t = [];
         for (const r of i.mergeFields) {
-            const s = Mn(e, r, n);
-            if (!o.contains(s)) throw new U(A, `Field '${s}' is specified in your field mask but missing from your input data.`);
-            Qn(t, s) || t.push(s);
+            const s = Bn(e, r, n);
+            if (!o.contains(s)) throw new U(I, `Field '${s}' is specified in your field mask but missing from your input data.`);
+            Wn(t, s) || t.push(s);
         }
-        c = new Tt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
-    } else c = null, a = o.fieldTransforms;
-    return new En(new Bt(u), c, a);
+        a = new Tt(t), c = o.fieldTransforms.filter((t => a.covers(t.field)));
+    } else a = null, c = o.fieldTransforms;
+    return new Tn(new zt(u), a, c);
 }
 
-class Dn extends gn {
+class Nn extends bn {
     _toFieldTransform(t) {
         if (2 /* MergeSet */ !== t.tt) throw 1 /* Update */ === t.tt ? t.ut(`${this._methodName}() can only appear at the top level of your update data`) : t.ut(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
         // No transform to add for a delete, but we need to add it to our
@@ -4053,7 +4063,7 @@ class Dn extends gn {
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof Dn;
+        return t instanceof Nn;
     }
 }
 
@@ -4072,32 +4082,32 @@ class Dn extends gn {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function Nn(t, e, n) {
-    return new An({
+ */ function $n(t, e, n) {
+    return new Rn({
         tt: 3 /* Argument */ ,
-        at: e.settings.at,
+        ct: e.settings.ct,
         methodName: t._methodName,
         rt: n
     }, e.databaseId, e.q, e.ignoreUndefinedProperties);
 }
 
-class $n extends gn {
+class Sn extends bn {
     _toFieldTransform(t) {
-        return new ge(t.path, new me);
+        return new be(t.path, new pe);
     }
     isEqual(t) {
-        return t instanceof $n;
+        return t instanceof Sn;
     }
 }
 
-class Sn extends gn {
+class xn extends bn {
     constructor(t, e) {
         super(t), this.lt = e;
     }
     _toFieldTransform(t) {
-        const e = Nn(this, t, 
-        /*array=*/ !0), n = this.lt.map((t => Ln(t, e))), r = new pe(n);
-        return new ge(t.path, r);
+        const e = $n(this, t, 
+        /*array=*/ !0), n = this.lt.map((t => Un(t, e))), r = new ye(n);
+        return new be(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4105,14 +4115,14 @@ class Sn extends gn {
     }
 }
 
-class Fn extends gn {
+class Fn extends bn {
     constructor(t, e) {
         super(t), this.lt = e;
     }
     _toFieldTransform(t) {
-        const e = Nn(this, t, 
-        /*array=*/ !0), n = this.lt.map((t => Ln(t, e))), r = new ye(n);
-        return new ge(t.path, r);
+        const e = $n(this, t, 
+        /*array=*/ !0), n = this.lt.map((t => Un(t, e))), r = new _e(n);
+        return new be(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4120,13 +4130,13 @@ class Fn extends gn {
     }
 }
 
-class xn extends gn {
+class qn extends bn {
     constructor(t, e) {
         super(t), this.ft = e;
     }
     _toFieldTransform(t) {
-        const e = new _e(t.q, de(t.q, this.ft));
-        return new ge(t.path, e);
+        const e = new ge(t.q, we(t.q, this.ft));
+        return new be(t.path, e);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4134,50 +4144,50 @@ class xn extends gn {
     }
 }
 
-/** Parse update data from an update() call. */ function qn(t, e, n, r) {
+/** Parse update data from an update() call. */ function On(t, e, n, r) {
     const s = t.ht(1 /* Update */ , e, n);
-    jn("Data must be an object, but it was:", s, r);
-    const i = [], o = Bt.empty();
+    Mn("Data must be an object, but it was:", s, r);
+    const i = [], o = zt.empty();
     Et(r, ((t, r) => {
-        const u = zn(e, t, n);
+        const u = Gn(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = getModularInstance(r);
-        const c = s.it(u);
-        if (r instanceof Dn) 
+        const a = s.it(u);
+        if (r instanceof Nn) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = Ln(r, c);
+            const t = Un(r, a);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
     const u = new Tt(i);
-    return new Tn(o, u, s.fieldTransforms);
+    return new An(o, u, s.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function On(t, e, n, r, s, i) {
-    const o = t.ht(1 /* Update */ , e, n), u = [ Mn(e, r, n) ], c = [ s ];
-    if (i.length % 2 != 0) throw new U(A, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
-    for (let t = 0; t < i.length; t += 2) u.push(Mn(e, i[t])), c.push(i[t + 1]);
-    const a = [], l = Bt.empty();
+/** Parse update data from a list of field/value arguments. */ function Cn(t, e, n, r, s, i) {
+    const o = t.ht(1 /* Update */ , e, n), u = [ Bn(e, r, n) ], a = [ s ];
+    if (i.length % 2 != 0) throw new U(I, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
+    for (let t = 0; t < i.length; t += 2) u.push(Bn(e, i[t])), a.push(i[t + 1]);
+    const c = [], l = zt.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 (!Qn(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!Wn(c, u[t])) {
         const e = u[t];
-        let n = c[t];
+        let n = a[t];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 n = getModularInstance(n);
         const r = o.it(e);
-        if (n instanceof Dn) 
+        if (n instanceof Nn) 
         // Add it to the field mask, but don't add anything to updateData.
-        a.push(e); else {
-            const t = Ln(n, r);
-            null != t && (a.push(e), l.set(e, t));
+        c.push(e); else {
+            const t = Un(n, r);
+            null != t && (c.push(e), l.set(e, t));
         }
     }
-    const f = new Tt(a);
-    return new Tn(l, f, o.fieldTransforms);
+    const f = new Tt(c);
+    return new An(l, f, o.fieldTransforms);
 }
 
 /**
@@ -4186,8 +4196,8 @@ class xn extends gn {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function Cn(t, e, n, r = !1) {
-    return Ln(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+ */ function Ln(t, e, n, r = !1) {
+    return Un(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -4198,12 +4208,12 @@ class xn extends gn {
  * 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 Ln(t, e) {
-    if (kn(
+ */ function Un(t, e) {
+    if (jn(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = getModularInstance(t))) return jn("Unsupported field value:", e, t), Un(t, e);
-    if (t instanceof gn) 
+    t = getModularInstance(t))) return Mn("Unsupported field value:", e, t), kn(t, e);
+    if (t instanceof bn) 
     // 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
@@ -4245,7 +4255,7 @@ class xn extends gn {
             const n = [];
             let r = 0;
             for (const s of t) {
-                let t = Ln(s, e.ot(r));
+                let t = Un(s, e.ot(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4264,7 +4274,7 @@ class xn extends gn {
         if (null === (t = getModularInstance(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return de(e.q, t);
+        if ("number" == typeof t) return we(e.q, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4274,7 +4284,7 @@ class xn extends gn {
         if (t instanceof Date) {
             const n = gt.fromDate(t);
             return {
-                timestampValue: De(e.q, n)
+                timestampValue: Ne(e.q, n)
             };
         }
         if (t instanceof gt) {
@@ -4283,7 +4293,7 @@ class xn extends gn {
             // truncation immediately without waiting for the backend to do that.
             const n = new gt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: De(e.q, n)
+                timestampValue: Ne(e.q, n)
             };
         }
         if (t instanceof vn) return {
@@ -4292,8 +4302,8 @@ class xn extends gn {
                 longitude: t.longitude
             }
         };
-        if (t instanceof _n) return {
-            bytesValue: Ne(e.q, t._byteString)
+        if (t instanceof gn) return {
+            bytesValue: $e(e.q, t._byteString)
         };
         if (t instanceof cn) {
             const n = e.databaseId, r = t.firestore._databaseId;
@@ -4313,13 +4323,13 @@ class xn extends gn {
  */ (t, e);
 }
 
-function Un(t, e) {
+function kn(t, e) {
     const n = {};
     return !function(t) {
         for (const e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
         return !0;
     }(t) ? Et(t, ((t, r) => {
-        const s = Ln(r, e.nt(t));
+        const s = Un(r, e.nt(t));
         null != s && (n[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -4331,12 +4341,12 @@ function Un(t, e) {
     };
 }
 
-function kn(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof gt || t instanceof vn || t instanceof _n || t instanceof cn || t instanceof gn);
+function jn(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof gt || t instanceof vn || t instanceof gn || t instanceof cn || t instanceof bn);
 }
 
-function jn(t, e, n) {
-    if (!kn(n) || !function(t) {
+function Mn(t, e, n) {
+    if (!jn(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         const r = it(n);
@@ -4346,20 +4356,20 @@ function jn(t, e, n) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function Mn(t, e, n) {
+ */ function Bn(t, e, n) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    e = getModularInstance(e)) instanceof pn) return e._internalPath;
-    if ("string" == typeof e) return zn(t, e);
-    throw Gn("Field path arguments must be of type string or ", t, 
+    e = getModularInstance(e)) instanceof yn) return e._internalPath;
+    if ("string" == typeof e) return Gn(t, e);
+    throw Qn("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 Bn = new RegExp("[~\\*/\\[\\]]");
+ */ const zn = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4369,29 +4379,29 @@ function jn(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function zn(t, e, n) {
-    if (e.search(Bn) >= 0) throw Gn(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function Gn(t, e, n) {
+    if (e.search(zn) >= 0) throw Qn(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return new pn(...e.split("."))._internalPath;
+        return new yn(...e.split("."))._internalPath;
     } catch (r) {
-        throw Gn(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw Qn(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function Gn(t, e, n, r, s) {
+function Qn(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 += ". ";
-    let c = "";
-    return (i || o) && (c += " (found", i && (c += ` in field ${r}`), o && (c += ` in document ${s}`), 
-    c += ")"), new U(A, u + t + c);
+    let a = "";
+    return (i || o) && (a += " (found", i && (a += ` in field ${r}`), o && (a += ` in document ${s}`), 
+    a += ")"), new U(I, u + t + a);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Qn(t, e) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Wn(t, e) {
     return t.some((t => t.isEqual(e)));
 }
 
@@ -4419,7 +4429,7 @@ function Gn(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 Wn {
+ */ class Yn {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4455,7 +4465,7 @@ function Gn(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 Yn(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new Hn(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4475,7 +4485,7 @@ function Gn(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(Jn("DocumentSnapshot.get", t));
+            const e = this._document.data.field(Xn("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }
@@ -4491,7 +4501,7 @@ function Gn(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 Yn extends Wn {
+ */ class Hn extends Yn {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -4509,7 +4519,7 @@ function Gn(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 Hn {
+ */ class Kn {
     /** @hideconstructor */
     constructor(t, e) {
         this._docs = e, this.query = t;
@@ -4540,14 +4550,14 @@ function Gn(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 Kn(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), t instanceof Wn && e instanceof Wn ? 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 Hn && e instanceof Hn && (mn(t.query, e.query) && _t(t.docs, e.docs, Kn));
+ */ function Jn(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), t instanceof Yn && e instanceof Yn ? 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 Kn && e instanceof Kn && (pn(t.query, e.query) && _t(t.docs, e.docs, Jn));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function Jn(t, e) {
-    return "string" == typeof e ? zn(t, e) : e instanceof pn ? e._internalPath : e._delegate._internalPath;
+ */ function Xn(t, e) {
+    return "string" == typeof e ? Gn(t, e) : e instanceof yn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4574,7 +4584,7 @@ function Gn(t, e, n, r, s) {
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
  */
-class Xn {}
+class Zn {}
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4584,40 +4594,40 @@ class Xn {}
  * @param queryConstraints - The list of {@link QueryConstraint}s to apply.
  * @throws if any of the provided query constraints cannot be combined with the
  * existing or new constraints.
- */ function Zn(t, ...e) {
+ */ function tr(t, ...e) {
     for (const n of e) t = n._apply(t);
     return t;
 }
 
-class tr extends Xn {
+class er extends Zn {
     constructor(t, e, n) {
         super(), this.dt = t, this.wt = e, this.yt = n, this.type = "where";
     }
     _apply(t) {
-        const e = Pn(t.firestore), n = function(t, e, n, r, s, i, o) {
+        const e = Vn(t.firestore), n = function(t, e, n, r, s, i, o) {
             let u;
             if (s.isKeyField()) {
-                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new U(A, `Invalid Query. You can't perform '${i}' queries on documentId().`);
+                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new U(I, `Invalid Query. You can't perform '${i}' queries on documentId().`);
                 if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
-                    mr(o, i);
+                    pr(o, i);
                     const e = [];
-                    for (const n of o) e.push(wr(r, t, n));
+                    for (const n of o) e.push(mr(r, t, n));
                     u = {
                         arrayValue: {
                             values: e
                         }
                     };
-                } else u = wr(r, t, o);
-            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || mr(o, i), 
-            u = Cn(n, e, o, 
+                } else u = mr(r, t, o);
+            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || pr(o, i), 
+            u = Ln(n, e, o, 
             /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
-            const c = Wt.create(s, i, u);
+            const a = Yt.create(s, i, u);
             return function(t, e) {
                 if (e.N()) {
                     const n = ce(t);
-                    if (null !== n && !n.isEqual(e.field)) throw new U(A, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${n.toString()}' and '${e.field.toString()}'`);
-                    const r = ue(t);
-                    null !== r && pr(t, e.field, r);
+                    if (null !== n && !n.isEqual(e.field)) throw new U(I, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${n.toString()}' and '${e.field.toString()}'`);
+                    const r = ae(t);
+                    null !== r && yr(t, e.field, r);
                 }
                 const n = function(t, e) {
                     for (const n of t.filters) if (e.indexOf(n.op) >= 0) return n.op;
@@ -4658,12 +4668,12 @@ class tr extends Xn {
                 }(e.op));
                 if (null !== n) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
-                throw n === e.op ? new U(A, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new U(A, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
-            }(t, c), c;
+                throw n === e.op ? new U(I, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new U(I, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
+            }(t, a), a;
         }(t._query, "where", e, t.firestore._databaseId, this.dt, this.wt, this.yt);
-        return new an(t.firestore, t.converter, function(t, e) {
+        return new hn(t.firestore, t.converter, function(t, e) {
             const n = t.filters.concat([ e ]);
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }
 }
@@ -4678,25 +4688,25 @@ class tr extends Xn {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function er(t, e, n) {
-    const r = e, s = Jn("where", t);
-    return new tr(s, r, n);
+ */ function nr(t, e, n) {
+    const r = e, s = Xn("where", t);
+    return new er(s, r, n);
 }
 
-class nr extends Xn {
+class rr extends Zn {
     constructor(t, e) {
         super(), this.dt = t, this._t = e, this.type = "orderBy";
     }
     _apply(t) {
         const e = function(t, e, n) {
-            if (null !== t.startAt) throw new U(A, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
-            if (null !== t.endAt) throw new U(A, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            const r = new re(e, n);
+            if (null !== t.startAt) throw new U(I, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new U(I, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            const r = new se(e, n);
             return function(t, e) {
-                if (null === ue(t)) {
+                if (null === ae(t)) {
                     // This is the first order by. It must match any inequality.
                     const n = ce(t);
-                    null !== n && pr(t, n, e.field);
+                    null !== n && yr(t, n, e.field);
                 }
             }(t, r), r;
         }
@@ -4711,10 +4721,10 @@ class nr extends Xn {
  * of the query or if any of the fields in the order by are an uncommitted
  * server timestamp.
  */ (t._query, this.dt, this._t);
-        return new an(t.firestore, t.converter, function(t, e) {
+        return new hn(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 oe(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new ue(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }
 }
@@ -4727,19 +4737,19 @@ class nr extends Xn {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function rr(t, e = "asc") {
-    const n = e, r = Jn("orderBy", t);
-    return new nr(r, n);
+ */ function sr(t, e = "asc") {
+    const n = e, r = Xn("orderBy", t);
+    return new rr(r, n);
 }
 
-class sr extends Xn {
+class ir extends Zn {
     constructor(t, e, n) {
-        super(), this.type = t, this.gt = e, this.vt = n;
+        super(), this.type = t, this.gt = e, this.bt = n;
     }
     _apply(t) {
-        return new an(t.firestore, t.converter, function(t, e, n) {
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
-        }(t._query, this.gt, this.vt));
+        return new hn(t.firestore, t.converter, function(t, e, n) {
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        }(t._query, this.gt, this.bt));
     }
 }
 
@@ -4748,8 +4758,8 @@ class sr extends Xn {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function ir(t) {
-    return ut("limit", t), new sr("limit", t, "F" /* First */);
+ */ function or(t) {
+    return ut("limit", t), new ir("limit", t, "F" /* First */);
 }
 
 /**
@@ -4760,55 +4770,55 @@ class sr extends Xn {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function or(t) {
-    return ut("limitToLast", t), new sr("limitToLast", t, "L" /* Last */);
+ */ function ur(t) {
+    return ut("limitToLast", t), new ir("limitToLast", t, "L" /* Last */);
 }
 
-class ur extends Xn {
+class ar extends Zn {
     constructor(t, e, n) {
-        super(), this.type = t, this.bt = e, this.Et = n;
+        super(), this.type = t, this.vt = e, this.Et = n;
     }
     _apply(t) {
-        const e = dr(t, this.type, this.bt, this.Et);
-        return new an(t.firestore, t.converter, function(t, e) {
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+        const e = wr(t, this.type, this.vt, this.Et);
+        return new hn(t.firestore, t.converter, function(t, e) {
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
 }
 
 function cr(...t) {
-    return new ur("startAt", t, 
+    return new ar("startAt", t, 
     /*inclusive=*/ !0);
 }
 
-function ar(...t) {
-    return new ur("startAfter", t, 
+function hr(...t) {
+    return new ar("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
-class hr extends Xn {
+class lr extends Zn {
     constructor(t, e, n) {
-        super(), this.type = t, this.bt = e, this.Et = n;
+        super(), this.type = t, this.vt = e, this.Et = n;
     }
     _apply(t) {
-        const e = dr(t, this.type, this.bt, this.Et);
-        return new an(t.firestore, t.converter, function(t, e) {
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+        const e = wr(t, this.type, this.vt, this.Et);
+        return new hn(t.firestore, t.converter, function(t, e) {
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
 }
 
-function lr(...t) {
-    return new hr("endBefore", t, 
+function fr(...t) {
+    return new lr("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function fr(...t) {
-    return new hr("endAt", t, /*inclusive=*/ !0);
+function dr(...t) {
+    return new lr("endAt", t, /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function dr(t, e, n, r) {
-    if (n[0] = getModularInstance(n[0]), n[0] instanceof Wn) return function(t, e, n, r, s) {
+/** Helper function to create a bound from a document or fields */ function wr(t, e, n, r) {
+    if (n[0] = getModularInstance(n[0]), n[0] instanceof Yn) return function(t, e, n, r, s) {
         if (!r) throw new U(P, `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
@@ -4818,42 +4828,42 @@ function fr(...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 he(t)) if (n.field.isKeyField()) i.push(Ct(e, r.key)); else {
+                for (const n of le(t)) if (n.field.isKeyField()) i.push(Lt(e, r.key)); else {
             const t = r.data.field(n.field);
-            if (Dt(t)) throw new U(A, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+            if (Dt(t)) throw new U(I, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
             if (null === t) {
                 const t = n.field.canonicalString();
-                throw new U(A, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
+                throw new U(I, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
             }
             i.push(t);
         }
-        return new ne(i, s);
+        return new re(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 = Pn(t.firestore);
+        const s = Vn(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;
-            if (s.length > o.length) throw new U(A, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
+            if (s.length > o.length) throw new U(I, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
             const u = [];
             for (let i = 0; i < s.length; i++) {
-                const c = s[i];
+                const a = s[i];
                 if (o[i].field.isKeyField()) {
-                    if ("string" != typeof c) throw new U(A, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
-                    if (!ae(t) && -1 !== c.indexOf("/")) throw new U(A, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
-                    const n = t.path.child(X.fromString(c));
-                    if (!et.isDocumentKey(n)) throw new U(A, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
+                    if ("string" != typeof a) throw new U(I, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof a}`);
+                    if (!he(t) && -1 !== a.indexOf("/")) throw new U(I, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${r}() must be a plain document ID, but '${a}' contains a slash.`);
+                    const n = t.path.child(X.fromString(a));
+                    if (!et.isDocumentKey(n)) throw new U(I, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
                     const s = new et(n);
-                    u.push(Ct(e, s));
+                    u.push(Lt(e, s));
                 } else {
-                    const t = Cn(n, r, c);
+                    const t = Ln(n, r, a);
                     u.push(t);
                 }
             }
-            return new ne(u, i);
+            return new re(u, i);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -4863,28 +4873,28 @@ function fr(...t) {
     }
 }
 
-function wr(t, e, n) {
+function mr(t, e, n) {
     if ("string" == typeof (n = getModularInstance(n))) {
-        if ("" === n) throw new U(A, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!ae(e) && -1 !== n.indexOf("/")) throw new U(A, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
+        if ("" === n) throw new U(I, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!he(e) && -1 !== n.indexOf("/")) throw new U(I, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
         const r = e.path.child(X.fromString(n));
-        if (!et.isDocumentKey(r)) throw new U(A, `Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
-        return Ct(t, new et(r));
+        if (!et.isDocumentKey(r)) throw new U(I, `Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
+        return Lt(t, new et(r));
     }
-    if (n instanceof cn) return Ct(t, n._key);
-    throw new U(A, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${it(n)}.`);
+    if (n instanceof cn) return Lt(t, n._key);
+    throw new U(I, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${it(n)}.`);
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function mr(t, e) {
-    if (!Array.isArray(t) || 0 === t.length) throw new U(A, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);
-    if (t.length > 10) throw new U(A, `Invalid Query. '${e.toString()}' filters support a maximum of 10 elements in the value array.`);
+ */ function pr(t, e) {
+    if (!Array.isArray(t) || 0 === t.length) throw new U(I, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);
+    if (t.length > 10) throw new U(I, `Invalid Query. '${e.toString()}' filters support a maximum of 10 elements in the value array.`);
 }
 
-function pr(t, e, n) {
-    if (!n.isEqual(e)) throw new U(A, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${e.toString()}' and so you must also use '${e.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${n.toString()}' instead.`);
+function yr(t, e, n) {
+    if (!n.isEqual(e)) throw new U(I, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${e.toString()}' and so you must also use '${e.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${n.toString()}' instead.`);
 }
 
 /**
@@ -4934,7 +4944,7 @@ function pr(t, e, n) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function yr(t, e, n) {
+function _r(t, e, n) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -4943,9 +4953,9 @@ function yr(t, e, n) {
     r;
 }
 
-class _r extends class {
+class gr extends class {
     convertValue(t, e = "none") {
-        switch (St(t)) {
+        switch (xt(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -5014,7 +5024,7 @@ class _r extends class {
     }
     convertDocumentKey(t, e) {
         const n = X.fromString(t);
-        v(Qe(n));
+        b(We(n));
         const r = new K(n.get(1), n.get(3)), s = new et(n.popFirst(5));
         return r.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
@@ -5026,7 +5036,7 @@ class _r extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new _n(t);
+        return new gn(t);
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
@@ -5046,12 +5056,12 @@ class _r extends class {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function gr(t) {
-    const e = tn((t = ot(t, cn)).firestore), n = new _r(t.firestore);
-    return Je(e, [ t._key ]).then((e => {
-        v(1 === e.length);
+ */ function br(t) {
+    const e = en((t = ot(t, cn)).firestore), n = new gr(t.firestore);
+    return Xe(e, [ t._key ]).then((e => {
+        b(1 === e.length);
         const r = e[0];
-        return new Wn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new Yn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5069,30 +5079,30 @@ class _r extends class {
  */ function vr(t) {
     !function(t) {
         if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new U(q, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = ot(t, an))._query);
-    const e = tn(t.firestore), n = new _r(t.firestore);
-    return Xe(e, t._query).then((e => {
-        const r = e.map((e => new Yn(t.firestore, n, e.key, e, t.converter)));
+    }((t = ot(t, hn))._query);
+    const e = en(t.firestore), n = new gr(t.firestore);
+    return Ze(e, t._query).then((e => {
+        const r = e.map((e => new Hn(t.firestore, n, e.key, e, t.converter)));
         return "L" /* Last */ === t._query.limitType && 
         // Limit to last queries reverse the orderBy constraint that was
         // specified by the user. As such, we need to reverse the order of the
         // results to return the documents in the expected order.
-        r.reverse(), new Hn(t, r);
+        r.reverse(), new Kn(t, r);
     }));
 }
 
-function br(t, e, n) {
-    const r = yr((t = ot(t, cn)).converter, e, n), s = Vn(Pn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return Ke(tn(t.firestore), [ s.toMutation(t._key, ve.none()) ]);
+function Er(t, e, n) {
+    const r = _r((t = ot(t, cn)).converter, e, n), s = Dn(Vn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return Je(en(t.firestore), [ s.toMutation(t._key, ve.none()) ]);
 }
 
-function Er(t, e, n, ...r) {
-    const s = Pn((t = ot(t, cn)).firestore);
+function Tr(t, e, n, ...r) {
+    const s = Vn((t = ot(t, cn)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    i = "string" == typeof (e = getModularInstance(e)) || e instanceof pn ? On(s, "updateDoc", t._key, e, n, r) : qn(s, "updateDoc", t._key, e);
-    return Ke(tn(t.firestore), [ i.toMutation(t._key, ve.exists(!0)) ]);
+    i = "string" == typeof (e = getModularInstance(e)) || e instanceof yn ? Cn(s, "updateDoc", t._key, e, n, r) : On(s, "updateDoc", t._key, e);
+    return Je(en(t.firestore), [ i.toMutation(t._key, ve.exists(!0)) ]);
 }
 
 /**
@@ -5106,8 +5116,8 @@ function Er(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 Tr(t) {
-    return Ke(tn((t = ot(t, cn)).firestore), [ new Ie(t._key, ve.none()) ]);
+ */ function Ar(t) {
+    return Je(en((t = ot(t, cn)).firestore), [ new Ie(t._key, ve.none()) ]);
 }
 
 /**
@@ -5125,8 +5135,8 @@ function Er(t, e, n, ...r) {
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
  */ function Ir(t, e) {
-    const n = dn(t = ot(t, hn)), r = yr(t.converter, e), s = Vn(Pn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return Ke(tn(t.firestore), [ s.toMutation(n._key, ve.exists(!1)) ]).then((() => n));
+    const n = wn(t = ot(t, ln)), r = _r(t.converter, e), s = Dn(Vn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return Je(en(t.firestore), [ s.toMutation(n._key, ve.exists(!1)) ]).then((() => n));
 }
 
 /**
@@ -5148,15 +5158,15 @@ function Er(t, e, n, ...r) {
 /**
  * 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 Ar() {
-    return new Dn("deleteField");
+ */ function Rr() {
+    return new Nn("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 Rr() {
-    return new $n("serverTimestamp");
+ */ function Pr() {
+    return new Sn("serverTimestamp");
 }
 
 /**
@@ -5170,10 +5180,10 @@ function Er(t, e, n, ...r) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function Pr(...t) {
+ */ function Vr(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-    return new Sn("arrayUnion", t);
+    return new xn("arrayUnion", t);
 }
 
 /**
@@ -5186,7 +5196,7 @@ function Er(t, e, n, ...r) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Vr(...t) {
+ */ function Dr(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
     return new Fn("arrayRemove", t);
@@ -5210,8 +5220,8 @@ function Er(t, e, n, ...r) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Dr(t) {
-    return new xn("increment", t);
+ */ function Nr(t) {
+    return new qn("increment", t);
 }
 
 /**
@@ -5237,24 +5247,24 @@ function Er(t, e, n, ...r) {
  * 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 Nr {
+ */ class $r {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = Pn(t);
+        this._dataReader = Vn(t);
     }
     set(t, e, n) {
         this._verifyNotCommitted();
-        const r = $r(t, this._firestore), s = yr(r.converter, e, n), i = Vn(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, n);
+        const r = Sr(t, this._firestore), s = _r(r.converter, e, n), i = Dn(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, n);
         return this._mutations.push(i.toMutation(r._key, ve.none())), this;
     }
     update(t, e, n, ...r) {
         this._verifyNotCommitted();
-        const s = $r(t, this._firestore);
+        const s = Sr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof pn ? On(this._dataReader, "WriteBatch.update", s._key, e, n, r) : qn(this._dataReader, "WriteBatch.update", s._key, e), 
+        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof yn ? Cn(this._dataReader, "WriteBatch.update", s._key, e, n, r) : On(this._dataReader, "WriteBatch.update", s._key, e), 
         this._mutations.push(i.toMutation(s._key, ve.exists(!0))), this;
     }
     /**
@@ -5264,7 +5274,7 @@ function Er(t, e, n, ...r) {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const e = $r(t, this._firestore);
+        const e = Sr(t, this._firestore);
         return this._mutations = this._mutations.concat(new Ie(e._key, ve.none())), this;
     }
     /**
@@ -5286,8 +5296,8 @@ function Er(t, e, n, ...r) {
     }
 }
 
-function $r(t, e) {
-    if ((t = getModularInstance(t)).firestore !== e) throw new U(A, "Provided document reference is from a different Firestore instance.");
+function Sr(t, e) {
+    if ((t = getModularInstance(t)).firestore !== e) throw new U(I, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -5303,9 +5313,9 @@ function $r(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Sr(t) {
-    const e = tn(t = ot(t, nn));
-    return new Nr(t, (t => Ke(e, t)));
+ */ function xr(t) {
+    const e = en(t = ot(t, rn));
+    return new $r(t, (t => Je(e, t)));
 }
 
 /**
@@ -5346,8 +5356,8 @@ function $r(t, e) {
         this.writtenDocs = new Set;
     }
     async lookup(t) {
-        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(A, "Firestore transactions require all reads to be executed before all writes.");
-        const e = await Je(this.datastore, t);
+        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(I, "Firestore transactions require all reads to be executed before all writes.");
+        const e = await Xe(this.datastore, t);
         return e.forEach((t => this.recordVersion(t))), e;
     }
     set(t, e) {
@@ -5375,21 +5385,21 @@ function $r(t, e) {
         // a `verify` operation.
         t.forEach(((t, e) => {
             const n = et.fromPath(e);
-            this.mutations.push(new Ae(n, this.precondition(n)));
-        })), await Ke(this.datastore, this.mutations), this.committed = !0;
+            this.mutations.push(new Re(n, this.precondition(n)));
+        })), await Je(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let e;
         if (t.isFoundDocument()) e = t.version; else {
             if (!t.isNoDocument()) throw g();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
-            e = vt.min();
+            e = bt.min();
         }
         const n = this.readVersions.get(t.key.toString());
         if (n) {
             if (!e.isEqual(n)) 
             // This transaction will fail no matter what.
-            throw new U(F, "Document version changed between two reads.");
+            throw new U(x, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }
     /**
@@ -5406,7 +5416,7 @@ function $r(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(vt.min())) 
+            if (e.isEqual(bt.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
@@ -5416,7 +5426,7 @@ function $r(t, e) {
             // express that to the backend, we have to validate locally.
             // Note: this can change once we can send separate verify writes in the
             // transaction.
-            throw new U(A, "Can't update a document that doesn't exist.");
+            throw new U(I, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
                         return ve.updateTime(e);
         }
@@ -5430,6 +5440,25 @@ function $r(t, e) {
     ensureCommitNotCalled() {}
 }
 
+/**
+ * @license
+ * Copyright 2022 Google LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ const qr = {
+    maxAttempts: 5
+};
+
 /**
  * @license
  * Copyright 2019 Google LLC
@@ -5450,16 +5479,16 @@ function $r(t, e) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class xr {
-    constructor(t, e, n, r) {
-        this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = r, 
-        this.Tt = 5, this.It = new Ye(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+class Or {
+    constructor(t, e, n, r, s) {
+        this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
+        this.deferred = s, this.Tt = n.maxAttempts, this.At = new He(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
-        this.Tt -= 1, this.At();
+        this.Tt -= 1, this.It();
     }
-    At() {
-        this.It.W((async () => {
+    It() {
+        this.At.W((async () => {
             const t = new Fr(this.datastore), e = this.Rt(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
@@ -5475,7 +5504,7 @@ class xr {
     Rt(t) {
         try {
             const e = this.updateFunction(t);
-            return !ct(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !at(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.
@@ -5483,7 +5512,7 @@ class xr {
         }
     }
     Pt(t) {
-        this.Tt > 0 && this.Vt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((() => (this.At(), 
+        this.Tt > 0 && this.Vt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((() => (this.It(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
     Vt(t) {
@@ -5504,7 +5533,7 @@ class xr {
                     return g();
 
                   case T:
-                  case I:
+                  case A:
                   case R:
                   case $:
                   case O:
@@ -5514,7 +5543,7 @@ class xr {
                                       case N:
                     return !1;
 
-                  case A:
+                  case I:
                   case P:
                   case V:
                   case D:
@@ -5522,8 +5551,8 @@ class xr {
  // Aborted might be retried in some scenarios, but that is dependant on
                     // the context and should handled individually by the calling code.
                     // See https://cloud.google.com/apis/design/errors.
-                                      case F:
-                  case x:
+                                      case x:
+                  case F:
                   case q:
                   case L:
                     return !0;
@@ -5550,7 +5579,7 @@ class xr {
  * 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 qr() {
+/** The Platform's 'document' implementation or null if not available. */ function Cr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5582,7 +5611,7 @@ class xr {
  * 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 Or {
+ */ class Lr {
     constructor(t, e, n, r, s) {
         this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = r, this.removalCallback = s, 
         this.deferred = new k, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
@@ -5605,7 +5634,7 @@ class xr {
      *   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 Or(t, e, i, r, s);
+        const i = Date.now() + n, o = new Lr(t, e, i, r, s);
         return o.start(n), o;
     }
     /**
@@ -5654,7 +5683,7 @@ class xr {
  * 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 Cr {
+ */ class Ur {
     constructor() {
         // The last promise in the queue.
         this.Dt = Promise.resolve(), 
@@ -5668,24 +5697,24 @@ class xr {
         // automatically removed after they are run or canceled.
         this.St = [], 
         // visible for testing
-        this.Ft = null, 
+        this.xt = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.xt = !1, 
+        this.Ft = !1, 
         // Enabled during shutdown on Safari to prevent future access to IndexedDB.
         this.qt = !1, 
         // List of TimerIds to fast-forward delays for.
         this.Ot = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new Ye(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.At = new He(this, "async_queue_retry" /* AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
         this.Ct = () => {
-            const t = qr();
-            t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
+            const t = Cr();
+            t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.At.H();
         };
-        const t = qr();
+        const t = Cr();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ct);
     }
     get isShuttingDown() {
@@ -5706,7 +5735,7 @@ class xr {
     enterRestrictedMode(t) {
         if (!this.$t) {
             this.$t = !0, this.qt = t || !1;
-            const e = qr();
+            const e = Cr();
             e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ct);
         }
     }
@@ -5730,7 +5759,7 @@ class xr {
      */    async kt() {
         if (0 !== this.Nt.length) {
             try {
-                await this.Nt[0](), this.Nt.shift(), this.It.reset();
+                await this.Nt[0](), this.Nt.shift(), this.At.reset();
             } catch (t) {
                 if (!
                 /**
@@ -5785,12 +5814,12 @@ class xr {
             // Since `backoffAndRun()` cancels an existing backoff and schedules a
             // new backoff on every call, there is only ever a single additional
             // operation in the queue.
-            this.It.W((() => this.kt()));
+            this.At.W((() => this.kt()));
         }
     }
     Ut(t) {
-        const e = this.Dt.then((() => (this.xt = !0, t().catch((t => {
-            this.Ft = t, this.xt = !1;
+        const e = this.Dt.then((() => (this.Ft = !0, t().catch((t => {
+            this.xt = t, this.Ft = !1;
             const e = 
             /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -5831,18 +5860,18 @@ class xr {
             // all further attempts to chain (via .then) will just short-circuit
             // and return the rejected Promise.
             throw p("INTERNAL UNHANDLED ERROR: ", e), t;
-        })).then((t => (this.xt = !1, t))))));
+        })).then((t => (this.Ft = !1, t))))));
         return this.Dt = e, e;
     }
     enqueueAfterDelay(t, e, n) {
         this.Lt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ot.indexOf(t) > -1 && (e = 0);
-        const r = Or.createAndSchedule(this, t, e, n, (t => this.jt(t)));
+        const r = Lr.createAndSchedule(this, t, e, n, (t => this.jt(t)));
         return this.St.push(r), r;
     }
     Lt() {
-        this.Ft && g();
+        this.xt && g();
     }
     verifyOperationInProgress() {}
     /**
@@ -5892,10 +5921,10 @@ class xr {
     }
 }
 
-class Lr {
+class kr {
     /** @hideconstructor */
     constructor(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = Pn(t);
+        this._firestore = t, this._transaction = e, this._dataReader = Vn(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -5903,25 +5932,25 @@ class Lr {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const e = $r(t, this._firestore), n = new _r(this._firestore);
+        const e = Sr(t, this._firestore), n = new gr(this._firestore);
         return this._transaction.lookup([ e._key ]).then((t => {
             if (!t || 1 !== t.length) return g();
             const r = t[0];
-            if (r.isFoundDocument()) return new Wn(this._firestore, n, r.key, r, e.converter);
-            if (r.isNoDocument()) return new Wn(this._firestore, n, e._key, null, e.converter);
+            if (r.isFoundDocument()) return new Yn(this._firestore, n, r.key, r, e.converter);
+            if (r.isNoDocument()) return new Yn(this._firestore, n, e._key, null, e.converter);
             throw g();
         }));
     }
     set(t, e, n) {
-        const r = $r(t, this._firestore), s = yr(r.converter, e, n), i = Vn(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, n);
+        const r = Sr(t, this._firestore), s = _r(r.converter, e, n), i = Dn(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 = $r(t, this._firestore);
+        const s = Sr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof pn ? On(this._dataReader, "Transaction.update", s._key, e, n, r) : qn(this._dataReader, "Transaction.update", s._key, e), 
+        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof yn ? Cn(this._dataReader, "Transaction.update", s._key, e, n, r) : On(this._dataReader, "Transaction.update", s._key, e), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -5930,7 +5959,7 @@ class Lr {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const e = $r(t, this._firestore);
+        const e = Sr(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }
 }
@@ -5951,9 +5980,13 @@ class Lr {
  * (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 Ur(t, e) {
-    const n = tn(t = ot(t, nn)), r = new k;
-    return new xr(new Cr, n, (n => e(new Lr(t, n))), r).run(), r.promise;
+ */ function jr(t, e, n) {
+    const r = en(t = ot(t, rn)), s = Object.assign(Object.assign({}, qr), n);
+    !function(t) {
+        if (t.maxAttempts < 1) throw new U(I, "Max attempts must be at least 1");
+    }(s);
+    const i = new k;
+    return new Or(new Ur, r, s, (n => e(new kr(t, n))), i).run(), i.promise;
 }
 
 /**
@@ -5966,11 +5999,11 @@ class Lr {
  */ !function(t) {
     f = t;
 }(`${SDK_VERSION}_lite`), _registerComponent(new Component("firestore/lite", ((t, {options: e}) => {
-    const n = t.getProvider("app").getImmediate(), r = new nn(n, new z(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
+    const n = t.getProvider("app").getImmediate(), r = new rn(n, new z(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
     return e && r._setSettings(e), r;
 }), "PUBLIC")), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-registerVersion("firestore-lite", "3.4.8-canary.aa41fd662", ""), registerVersion("firestore-lite", "3.4.8-canary.aa41fd662", "esm2017");
+registerVersion("firestore-lite", "3.4.8-canary.adb9aaa34", ""), registerVersion("firestore-lite", "3.4.8-canary.adb9aaa34", "esm2017");
 
-export { _n as Bytes, hn as CollectionReference, cn as DocumentReference, Wn as DocumentSnapshot, pn as FieldPath, gn as FieldValue, nn as Firestore, U as FirestoreError, vn as GeoPoint, an as Query, Xn as QueryConstraint, Yn as QueryDocumentSnapshot, Hn as QuerySnapshot, gt as Timestamp, Lr as Transaction, Nr as WriteBatch, Ir as addDoc, Vr as arrayRemove, Pr as arrayUnion, ln as collection, fn as collectionGroup, on as connectFirestoreEmulator, Tr as deleteDoc, Ar as deleteField, dn as doc, yn as documentId, fr as endAt, lr as endBefore, gr as getDoc, vr as getDocs, sn as getFirestore, Dr as increment, rn as initializeFirestore, ir as limit, or as limitToLast, rr as orderBy, Zn as query, mn as queryEqual, wn as refEqual, Ur as runTransaction, Rr as serverTimestamp, br as setDoc, w as setLogLevel, Kn as snapshotEqual, ar as startAfter, cr as startAt, un as terminate, Er as updateDoc, er as where, Sr as writeBatch };
+export { gn as Bytes, ln as CollectionReference, cn as DocumentReference, Yn as DocumentSnapshot, yn as FieldPath, bn as FieldValue, rn as Firestore, U as FirestoreError, vn as GeoPoint, hn as Query, Zn as QueryConstraint, Hn as QueryDocumentSnapshot, Kn as QuerySnapshot, gt as Timestamp, kr as Transaction, $r as WriteBatch, Ir as addDoc, Dr as arrayRemove, Vr as arrayUnion, fn as collection, dn as collectionGroup, un as connectFirestoreEmulator, Ar as deleteDoc, Rr as deleteField, wn as doc, _n as documentId, dr as endAt, fr as endBefore, br as getDoc, vr as getDocs, on as getFirestore, Nr as increment, sn as initializeFirestore, or as limit, ur as limitToLast, sr as orderBy, tr as query, pn as queryEqual, mn as refEqual, jr as runTransaction, Pr as serverTimestamp, Er as setDoc, w as setLogLevel, Jn as snapshotEqual, hr as startAfter, cr as startAt, an as terminate, Tr as updateDoc, nr as where, xr as writeBatch };
 //# sourceMappingURL=index.browser.esm2017.js.map