@firebase/firestore 3.3.0 → 3.3.1-canary.086df7c7e

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

@@ -66,7 +66,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.4.0";
+let f = "9.5.0-canary.086df7c7e";
 
 /**
  * @license
@@ -221,9 +221,9 @@ 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 E = "ok", I = "cancelled", T = "unknown", A = "invalid-argument", P = "deadline-exceeded", R = "not-found", V = "already-exists", N = "permission-denied", D = "unauthenticated", $ = "resource-exhausted", F = "failed-precondition", S = "aborted", q = "out-of-range", x = "unimplemented", O = "internal", C = "unavailable", L = "data-loss";
+ */ const E = "ok", T = "cancelled", I = "unknown", A = "invalid-argument", P = "deadline-exceeded", R = "not-found", V = "already-exists", N = "permission-denied", D = "unauthenticated", $ = "resource-exhausted", F = "failed-precondition", S = "aborted", q = "out-of-range", x = "unimplemented", O = "internal", C = "unavailable", L = "data-loss";
 
-/** An error returned by a Firestore operation. */ class U extends Error {
+/** An error returned by a Firestore operation. */ class k extends Error {
     /** @hideconstructor */
     constructor(
     /**
@@ -259,7 +259,7 @@ 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.
- */ class j {
+ */ class U {
     constructor() {
         this.promise = new Promise(((t, n) => {
             this.resolve = t, this.reject = n;
@@ -282,11 +282,9 @@ 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.
- */ class k {
+ */ class j {
     constructor(t, n) {
-        this.user = n, this.type = "OAuth", this.authHeaders = {}, 
-        // Set the headers using Object Literal notation to avoid minification
-        this.authHeaders.Authorization = `Bearer ${t}`;
+        this.user = n, this.type = "OAuth", this.headers = new Map, this.headers.set("Authorization", `Bearer ${t}`);
     }
 }
 
@@ -332,7 +330,7 @@ n) {
     }
 }
 
-/** Credential provider for the Lite SDK. */ class Q {
+/** Credential provider for the Lite SDK. */ class z {
     constructor(t) {
         this.auth = null, t.onInit((t => {
             this.auth = t;
@@ -340,7 +338,7 @@ n) {
     }
     getToken() {
         return this.auth ? this.auth.getToken().then((t => t ? (v("string" == typeof t.accessToken), 
-        new k(t.accessToken, new l(this.auth.getUid()))) : null)) : Promise.resolve(null);
+        new j(t.accessToken, new l(this.auth.getUid()))) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, n) {}
@@ -353,17 +351,11 @@ n) {
  * Technically this may no longer be necessary since the SDK should gracefully
  * recover from unauthenticated errors (see b/33147818 for context), but it's
  * safer to keep the implementation as-is.
- */ class z {
+ */ class Q {
     constructor(t, n, e) {
-        this.t = t, this.i = n, this.o = e, this.type = "FirstParty", this.user = l.FIRST_PARTY;
-    }
-    get authHeaders() {
-        const t = {
-            "X-Goog-AuthUser": this.i
-        }, n = this.t.auth.getAuthHeaderValueForFirstParty([]);
-        // Use array notation to prevent minification
-                return n && (t.Authorization = n), this.o && (t["X-Goog-Iam-Authorization-Token"] = this.o), 
-        t;
+        this.type = "FirstParty", this.user = l.FIRST_PARTY, this.headers = new Map, this.headers.set("X-Goog-AuthUser", n);
+        const r = t.auth.getAuthHeaderValueForFirstParty([]);
+        r && this.headers.set("Authorization", r), e && this.headers.set("X-Goog-Iam-Authorization-Token", e);
     }
 }
 
@@ -371,12 +363,12 @@ n) {
  * Provides user credentials required for the Firestore JavaScript SDK
  * to authenticate the user, using technique that is only available
  * to applications hosted by Google.
- */ class W {
+ */ class G {
     constructor(t, n, e) {
         this.t = t, this.i = n, this.o = e;
     }
     getToken() {
-        return Promise.resolve(new z(this.t, this.i, this.o));
+        return Promise.resolve(new Q(this.t, this.i, this.o));
     }
     start(t, n) {
         // Fire with initial uid.
@@ -386,6 +378,27 @@ n) {
     invalidateToken() {}
 }
 
+class W {
+    constructor(t) {
+        this.value = t, this.type = "AppCheck", this.headers = new Map, t && t.length > 0 && this.headers.set("x-firebase-appcheck", this.value);
+    }
+}
+
+/** AppCheck token provider for the Lite SDK. */ class Y {
+    constructor(t) {
+        this.u = t, this.appCheck = null, t.onInit((t => {
+            this.appCheck = t;
+        }));
+    }
+    getToken() {
+        return this.appCheck ? this.appCheck.getToken().then((t => t ? (v("string" == typeof t.token), 
+        new W(t.token)) : null)) : Promise.resolve(null);
+    }
+    invalidateToken() {}
+    start(t, n) {}
+    shutdown() {}
+}
+
 /**
  * Builds a CredentialsProvider depending on the type of
  * the credentials passed in.
@@ -406,7 +419,7 @@ n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-class G {
+class H {
     /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -435,7 +448,7 @@ class G {
  * Represents the database ID a Firestore client is associated with.
  * @internal
  */
-class H {
+class K {
     constructor(t, n) {
         this.projectId = t, this.database = n || "(default)";
     }
@@ -443,7 +456,7 @@ class H {
         return "(default)" === this.database;
     }
     isEqual(t) {
-        return t instanceof H && t.projectId === this.projectId && t.database === this.database;
+        return t instanceof K && t.projectId === this.projectId && t.database === this.database;
     }
 }
 
@@ -466,7 +479,7 @@ class H {
 /**
  * Path represents an ordered sequence of string segments.
  */
-class Y {
+class J {
     constructor(t, n, e) {
         void 0 === n ? n = 0 : n > t.length && g(), void 0 === e ? e = t.length - n : e > t.length - n && g(), 
         this.segments = t, this.offset = n, this.len = e;
@@ -475,11 +488,11 @@ class Y {
         return this.len;
     }
     isEqual(t) {
-        return 0 === Y.comparator(this, t);
+        return 0 === J.comparator(this, t);
     }
     child(t) {
         const n = this.segments.slice(this.offset, this.limit());
-        return t instanceof Y ? t.forEach((t => {
+        return t instanceof J ? t.forEach((t => {
             n.push(t);
         })) : n.push(t), this.construct(n);
     }
@@ -536,9 +549,9 @@ class Y {
  * within Firestore.
  *
  * @internal
- */ class K extends Y {
+ */ class X extends J {
     construct(t, n, e) {
-        return new K(t, n, e);
+        return new X(t, n, e);
     }
     canonicalString() {
         // NOTE: The client is ignorant of any path segments containing escape
@@ -559,35 +572,35 @@ class Y {
         // for legacy reasons and should not be used frequently).
         const n = [];
         for (const e of t) {
-            if (e.indexOf("//") >= 0) throw new U(A, `Invalid segment (${e}). Paths must not contain // in them.`);
+            if (e.indexOf("//") >= 0) throw new k(A, `Invalid segment (${e}). Paths must not contain // in them.`);
             // Strip leading and traling slashed.
                         n.push(...e.split("/").filter((t => t.length > 0)));
         }
-        return new K(n);
+        return new X(n);
     }
     static emptyPath() {
-        return new K([]);
+        return new X([]);
     }
 }
 
-const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
+const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
 
 /**
  * A dot-separated path for navigating sub-objects within a document.
  * @internal
- */ class Z extends Y {
+ */ class tt extends J {
     construct(t, n, e) {
-        return new Z(t, n, e);
+        return new tt(t, n, e);
     }
     /**
      * Returns true if the string could be used as a segment in a field path
      * without escaping.
      */    static isValidIdentifier(t) {
-        return J.test(t);
+        return Z.test(t);
     }
     canonicalString() {
         return this.toArray().map((t => (t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"), 
-        Z.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
+        tt.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
     }
     toString() {
         return this.canonicalString();
@@ -600,7 +613,7 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
     /**
      * The field designating the key of a document.
      */    static keyField() {
-        return new Z([ "__name__" ]);
+        return new tt([ "__name__" ]);
     }
     /**
      * Parses a field string from the given server-formatted string.
@@ -615,24 +628,24 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
         const n = [];
         let e = "", r = 0;
         const s = () => {
-            if (0 === e.length) throw new U(A, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
+            if (0 === e.length) throw new k(A, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
             n.push(e), e = "";
         };
         let i = !1;
         for (;r < t.length; ) {
             const n = t[r];
             if ("\\" === n) {
-                if (r + 1 === t.length) throw new U(A, "Path has trailing escape character: " + t);
+                if (r + 1 === t.length) throw new k(A, "Path has trailing escape character: " + t);
                 const n = t[r + 1];
-                if ("\\" !== n && "." !== n && "`" !== n) throw new U(A, "Path has invalid escape sequence: " + t);
+                if ("\\" !== n && "." !== n && "`" !== n) throw new k(A, "Path has invalid escape sequence: " + t);
                 e += n, r += 2;
             } else "`" === n ? (i = !i, r++) : "." !== n || i ? (e += n, r++) : (s(), r++);
         }
-        if (s(), i) throw new U(A, "Unterminated ` in path: " + t);
-        return new Z(n);
+        if (s(), i) throw new k(A, "Unterminated ` in path: " + t);
+        return new tt(n);
     }
     static emptyPath() {
-        return new Z([]);
+        return new tt([]);
     }
 }
 
@@ -654,27 +667,27 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  */
 /**
  * @internal
- */ class X {
+ */ class nt {
     constructor(t) {
         this.path = t;
     }
     static fromPath(t) {
-        return new X(K.fromString(t));
+        return new nt(X.fromString(t));
     }
     static fromName(t) {
-        return new X(K.fromString(t).popFirst(5));
+        return new nt(X.fromString(t).popFirst(5));
     }
     /** Returns true if the document is in the specified collectionId. */    hasCollectionId(t) {
         return this.path.length >= 2 && this.path.get(this.path.length - 2) === t;
     }
     isEqual(t) {
-        return null !== t && 0 === K.comparator(this.path, t.path);
+        return null !== t && 0 === X.comparator(this.path, t.path);
     }
     toString() {
         return this.path.toString();
     }
     static comparator(t, n) {
-        return K.comparator(t.path, n.path);
+        return X.comparator(t.path, n.path);
     }
     static isDocumentKey(t) {
         return t.length % 2 == 0;
@@ -685,7 +698,7 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
      * @param segments - The segments of the path to the document
      * @returns A new instance of DocumentKey
      */    static fromSegments(t) {
-        return new X(new K(t.slice()));
+        return new nt(new X(t.slice()));
     }
 }
 
@@ -704,8 +717,8 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function tt(t, n, e) {
-    if (!e) throw new U(A, `Function ${t}() cannot be called with an empty ${n}.`);
+ */ function et(t, n, e) {
+    if (!e) throw new k(A, `Function ${t}() cannot be called with an empty ${n}.`);
 }
 
 /**
@@ -716,15 +729,15 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  * Validates that `path` refers to a document (indicated by the fact it contains
  * an even numbers of segments).
  */
-function nt(t) {
-    if (!X.isDocumentKey(t)) throw new U(A, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
+function rt(t) {
+    if (!nt.isDocumentKey(t)) throw new k(A, `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 et(t) {
-    if (X.isDocumentKey(t)) throw new U(A, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
+ */ function st(t) {
+    if (nt.isDocumentKey(t)) throw new k(A, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
@@ -732,7 +745,7 @@ function nt(t) {
  * (i.e. excludes Array, Date, etc.).
  */
 /** Returns a string describing the type / value of the provided input. */
-function rt(t) {
+function it(t) {
     if (void 0 === t) return "undefined";
     if (null === t) return "null";
     if ("string" == typeof t) return t.length > 20 && (t = `${t.substring(0, 20)}...`), 
@@ -761,24 +774,24 @@ function rt(t) {
     return "function" == typeof t ? "a function" : g();
 }
 
-function st(t, 
+function ot(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 n) {
     if ("_delegate" in t && (
     // Unwrap Compat types
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     t = t._delegate), !(t instanceof n)) {
-        if (n.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 (n.name === t.constructor.name) throw new k(A, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
-            const e = rt(t);
-            throw new U(A, `Expected type '${n.name}', but it was: ${e}`);
+            const e = it(t);
+            throw new k(A, `Expected type '${n.name}', but it was: ${e}`);
         }
     }
     return t;
 }
 
-function it(t, n) {
-    if (n <= 0) throw new U(A, `Function ${t}() requires a positive number, but it was: ${n}.`);
+function ut(t, n) {
+    if (n <= 0) throw new k(A, `Function ${t}() requires a positive number, but it was: ${n}.`);
 }
 
 /**
@@ -799,11 +812,11 @@ function it(t, n) {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function ot(t) {
+ */ function ct(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function ut(t) {
+/** Returns whether the value represents -0. */ function at(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;
@@ -829,7 +842,7 @@ function it(t, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const ct = {
+const ht = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery"
@@ -866,7 +879,7 @@ const ct = {
  * are used for reverse lookups from the webchannel stream. Do NOT change the
  * names of these identifiers or change this into a const enum.
  */
-var at, ht;
+var lt, ft;
 
 /**
  * Converts an HTTP Status Code to the equivalent error code.
@@ -875,8 +888,8 @@ var at, ht;
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function lt(t) {
-    if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), T;
+function dt(t) {
+    if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), I;
     // 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.
@@ -923,11 +936,11 @@ function lt(t) {
 
       case 499:
         // Client Closed Request
-        return I;
+        return T;
 
       case 500:
         // Internal Server Error
-        return T;
+        return I;
 
         // Other possibilities:
         // return Code.INTERNAL;
@@ -945,7 +958,7 @@ function lt(t) {
         return P;
 
       default:
-        return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? F : t >= 500 && t < 600 ? O : T;
+        return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? F : t >= 500 && t < 600 ? O : I;
     }
 }
 
@@ -968,16 +981,16 @@ function lt(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (ht = at || (at = {}))[ht.OK = 0] = "OK", ht[ht.CANCELLED = 1] = "CANCELLED", 
-ht[ht.UNKNOWN = 2] = "UNKNOWN", ht[ht.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
-ht[ht.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", ht[ht.NOT_FOUND = 5] = "NOT_FOUND", 
-ht[ht.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", ht[ht.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
-ht[ht.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", ht[ht.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
-ht[ht.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", ht[ht.ABORTED = 10] = "ABORTED", 
-ht[ht.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", ht[ht.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
-ht[ht.INTERNAL = 13] = "INTERNAL", ht[ht.UNAVAILABLE = 14] = "UNAVAILABLE", ht[ht.DATA_LOSS = 15] = "DATA_LOSS";
+ */ (ft = lt || (lt = {}))[ft.OK = 0] = "OK", ft[ft.CANCELLED = 1] = "CANCELLED", 
+ft[ft.UNKNOWN = 2] = "UNKNOWN", ft[ft.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+ft[ft.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", ft[ft.NOT_FOUND = 5] = "NOT_FOUND", 
+ft[ft.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", ft[ft.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+ft[ft.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", ft[ft.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+ft[ft.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", ft[ft.ABORTED = 10] = "ABORTED", 
+ft[ft.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", ft[ft.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+ft[ft.INTERNAL = 13] = "INTERNAL", ft[ft.UNAVAILABLE = 14] = "UNAVAILABLE", ft[ft.DATA_LOSS = 15] = "DATA_LOSS";
 
-class ft extends 
+class wt extends 
 /**
  * Base class for all Rest-based connections to the backend (WebChannel and
  * HTTP).
@@ -986,38 +999,38 @@ class {
     constructor(t) {
         this.databaseInfo = t, this.databaseId = t.databaseId;
         const n = t.ssl ? "https" : "http";
-        this.u = n + "://" + t.host, this.h = "projects/" + this.databaseId.projectId + "/databases/" + this.databaseId.database + "/documents";
+        this.h = n + "://" + t.host, this.l = "projects/" + this.databaseId.projectId + "/databases/" + this.databaseId.database + "/documents";
     }
-    l(t, n, e, r) {
-        const s = this.m(t, n);
-        m("RestConnection", "Sending: ", s, e);
-        const i = {};
-        return this.p(i, r), this.g(t, s, i, e).then((t => (m("RestConnection", "Received: ", t), 
+    m(t, n, e, r, s) {
+        const i = this.p(t, n);
+        m("RestConnection", "Sending: ", i, e);
+        const o = {};
+        return this.g(o, r, s), this.v(t, i, o, e).then((t => (m("RestConnection", "Received: ", t), 
         t)), (n => {
-            throw y("RestConnection", `${t} failed with error: `, n, "url: ", s, "request:", e), 
+            throw y("RestConnection", `${t} failed with error: `, n, "url: ", i, "request:", e), 
             n;
         }));
     }
-    v(t, n, e, r) {
+    T(t, n, e, r, s) {
         // The REST API automatically aggregates all of the streamed results, so we
         // can just use the normal invoke() method.
-        return this.l(t, n, e, r);
+        return this.m(t, n, e, r, s);
     }
     /**
      * Modifies the headers for a request, adding any authorization token if
      * present and any additional headers for the request.
-     */    p(t, n) {
-        if (t["X-Goog-Api-Client"] = "gl-js/ fire/" + f, 
+     */    g(t, n, e) {
+        t["X-Goog-Api-Client"] = "gl-js/ fire/" + f, 
         // Content-Type: text/plain will avoid preflight requests which might
         // mess with CORS and redirects by proxies. If we add custom headers
         // we will need to change this code to potentially use the $httpOverwrite
         // parameter supported by ESF to avoid triggering preflight requests.
         t["Content-Type"] = "text/plain", this.databaseInfo.appId && (t["X-Firebase-GMPID"] = this.databaseInfo.appId), 
-        n) for (const e in n.authHeaders) n.authHeaders.hasOwnProperty(e) && (t[e] = n.authHeaders[e]);
+        n && n.headers.forEach(((n, e) => t[e] = n)), e && e.headers.forEach(((n, e) => t[e] = n));
     }
-    m(t, n) {
-        const e = ct[t];
-        return `${this.u}/v1/${n}:${e}`;
+    p(t, n) {
+        const e = ht[t];
+        return `${this.h}/v1/${n}:${e}`;
     }
 } {
     /**
@@ -1027,10 +1040,10 @@ class {
     constructor(t, n) {
         super(t), this.I = n;
     }
-    T(t, n) {
+    A(t, n) {
         throw new Error("Not supported by FetchConnection");
     }
-    async g(t, n, e, r) {
+    async v(t, n, e, r) {
         const s = JSON.stringify(r);
         let i;
         try {
@@ -1040,9 +1053,9 @@ class {
                 body: s
             });
         } catch (t) {
-            throw new U(lt(t.status), "Request failed with error: " + t.statusText);
+            throw new k(dt(t.status), "Request failed with error: " + t.statusText);
         }
-        if (!i.ok) throw new U(lt(i.status), "Request failed with error: " + i.statusText);
+        if (!i.ok) throw new k(dt(i.status), "Request failed with error: " + i.statusText);
         return i.json();
     }
 }
@@ -1085,7 +1098,7 @@ class {
  *
  * If `nBytes < 0` , an error will be thrown.
  */
-function dt(t) {
+function mt(t) {
     // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.
     const n = 
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
@@ -1111,14 +1124,14 @@ function dt(t) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class wt {
-    static A() {
+ */ class pt {
+    static P() {
         // Alphanumeric characters
         const t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", n = Math.floor(256 / t.length) * t.length;
         // The largest byte value that is a multiple of `char.length`.
                 let e = "";
         for (;e.length < 20; ) {
-            const r = dt(40);
+            const r = mt(40);
             for (let s = 0; s < r.length; ++s) 
             // Only accept values that are [0, maxMultiple), this ensures they can
             // be evenly mapped to indices of `chars` via a modulo operation.
@@ -1128,11 +1141,11 @@ function dt(t) {
     }
 }
 
-function mt(t, n) {
+function yt(t, n) {
     return t < n ? -1 : t > n ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function pt(t, n, e) {
+/** Helper to compare arrays using isEqual(). */ function _t(t, n, e) {
     return t.length === n.length && t.every(((t, r) => e(t, n[r])));
 }
 
@@ -1167,7 +1180,7 @@ function mt(t, n) {
  * For examples and further specifications, refer to the
  * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
  */
-class yt {
+class gt {
     /**
      * Creates a new timestamp.
      *
@@ -1188,18 +1201,18 @@ class yt {
      * The fractions of a second at nanosecond resolution.*
      */
     n) {
-        if (this.seconds = t, this.nanoseconds = n, n < 0) throw new U(A, "Timestamp nanoseconds out of range: " + n);
-        if (n >= 1e9) throw new U(A, "Timestamp nanoseconds out of range: " + n);
-        if (t < -62135596800) throw new U(A, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = n, n < 0) throw new k(A, "Timestamp nanoseconds out of range: " + n);
+        if (n >= 1e9) throw new k(A, "Timestamp nanoseconds out of range: " + n);
+        if (t < -62135596800) throw new k(A, "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 k(A, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
      *
      * @returns a new timestamp representing the current date.
      */    static now() {
-        return yt.fromMillis(Date.now());
+        return gt.fromMillis(Date.now());
     }
     /**
      * Creates a new timestamp from the given date.
@@ -1208,7 +1221,7 @@ class yt {
      * @returns A new `Timestamp` representing the same point in time as the given
      *     date.
      */    static fromDate(t) {
-        return yt.fromMillis(t.getTime());
+        return gt.fromMillis(t.getTime());
     }
     /**
      * Creates a new timestamp from the given number of milliseconds.
@@ -1219,7 +1232,7 @@ class yt {
      *     number of milliseconds.
      */    static fromMillis(t) {
         const n = Math.floor(t / 1e3), e = Math.floor(1e6 * (t - 1e3 * n));
-        return new yt(n, e);
+        return new gt(n, e);
     }
     /**
      * Converts a `Timestamp` to a JavaScript `Date` object. This conversion
@@ -1241,7 +1254,7 @@ class yt {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }
     _compareTo(t) {
-        return this.seconds === t.seconds ? mt(this.nanoseconds, t.nanoseconds) : mt(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? yt(this.nanoseconds, t.nanoseconds) : yt(this.seconds, t.seconds);
     }
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1297,15 +1310,15 @@ class yt {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ class _t {
+ */ class vt {
     constructor(t) {
         this.timestamp = t;
     }
     static fromTimestamp(t) {
-        return new _t(t);
+        return new vt(t);
     }
     static min() {
-        return new _t(new yt(0, 0));
+        return new vt(new gt(0, 0));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -1340,13 +1353,13 @@ class yt {
  * 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 gt(t) {
+ */ function bt(t) {
     let n = 0;
     for (const e in t) Object.prototype.hasOwnProperty.call(t, e) && n++;
     return n;
 }
 
-function vt(t, n) {
+function Et(t, n) {
     for (const e in t) Object.prototype.hasOwnProperty.call(t, e) && n(e, t[e]);
 }
 
@@ -1376,12 +1389,12 @@ function vt(t, n) {
  *             If foo is not an object, foo is replaced with an object
  *             containing foo
  */
-class bt {
+class Tt {
     constructor(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
         // Sort the field mask to support `FieldMask.isEqual()` and assert below.
-        t.sort(Z.comparator);
+        t.sort(tt.comparator);
     }
     /**
      * Verifies that `fieldPath` is included by at least one field in this field
@@ -1393,7 +1406,7 @@ class bt {
         return !1;
     }
     isEqual(t) {
-        return pt(this.fields, t.fields, ((t, n) => t.isEqual(n)));
+        return _t(this.fields, t.fields, ((t, n) => t.isEqual(n)));
     }
 }
 
@@ -1416,7 +1429,7 @@ class bt {
 // WebSafe uses a different URL-encoding safe alphabet that doesn't match
 // the encoding used on the backend.
 /** Converts a Base64 encoded string to a binary string. */
-function Et(t) {
+function It(t) {
     return String.fromCharCode.apply(null, 
     // We use `decodeStringToByteArray()` instead of `decodeString()` since
     // `decodeString()` returns Unicode strings, which doesn't match the values
@@ -1450,13 +1463,13 @@ function Et(t) {
  * before being sent as a proto.
  * @internal
  */
-class It {
+class At {
     constructor(t) {
         this.binaryString = t;
     }
     static fromBase64String(t) {
-        const n = Et(t);
-        return new It(n);
+        const n = It(t);
+        return new At(n);
     }
     static fromUint8Array(t) {
         const n = 
@@ -1471,7 +1484,7 @@ class It {
         /**
  * Helper function to convert a binary string to an Uint8Array.
  */ (t);
-        return new It(n);
+        return new At(n);
     }
     toBase64() {
         return function(t) {
@@ -1509,21 +1522,21 @@ class It {
         return 2 * this.binaryString.length;
     }
     compareTo(t) {
-        return mt(this.binaryString, t.binaryString);
+        return yt(this.binaryString, t.binaryString);
     }
     isEqual(t) {
         return this.binaryString === t.binaryString;
     }
 }
 
-It.EMPTY_BYTE_STRING = new It("");
+At.EMPTY_BYTE_STRING = new At("");
 
-const Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
 /**
  * Converts the possible Proto values for a timestamp value into a "seconds and
  * nanos" representation.
- */ function At(t) {
+ */ function Rt(t) {
     // The json interface (for the browser) will return an iso timestamp string,
     // while the proto js library (for node) will return a
     // google.protobuf.Timestamp instance.
@@ -1532,7 +1545,7 @@ const Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
         let n = 0;
-        const e = Tt.exec(t);
+        const e = Pt.exec(t);
         if (v(!!e), e[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = e[1];
@@ -1546,21 +1559,21 @@ const Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: Pt(t.seconds),
-        nanos: Pt(t.nanos)
+        seconds: Vt(t.seconds),
+        nanos: Vt(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function Pt(t) {
+ */ function Vt(t) {
     // TODO(bjornick): Handle int64 greater than 53 bits.
     return "number" == typeof t ? t : "string" == typeof t ? Number(t) : 0;
 }
 
-/** Converts the possible Proto types for Blobs into a ByteString. */ function Rt(t) {
-    return "string" == typeof t ? It.fromBase64String(t) : It.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Nt(t) {
+    return "string" == typeof t ? At.fromBase64String(t) : At.fromUint8Array(t);
 }
 
 /**
@@ -1596,7 +1609,7 @@ const Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *   FieldValueOptions to value().
  * - With respect to other ServerTimestampValues, they sort by their
  *   localWriteTime.
- */ function Vt(t) {
+ */ function Dt(t) {
     var n, e;
     return "server_timestamp" === (null === (e = ((null === (n = null == t ? void 0 : t.mapValue) || void 0 === n ? void 0 : n.fields) || {}).__type__) || void 0 === e ? void 0 : e.stringValue);
 }
@@ -1606,16 +1619,16 @@ const Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *
  * Preserving the previous values allows the user to display the last resoled
  * value until the backend responds with the timestamp.
- */ function Nt(t) {
+ */ function $t(t) {
     const n = t.mapValue.fields.__previous_value__;
-    return Vt(n) ? Nt(n) : n;
+    return Dt(n) ? $t(n) : n;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Dt(t) {
-    const n = At(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new yt(n.seconds, n.nanos);
+ */ function Ft(t) {
+    const n = Rt(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new gt(n.seconds, n.nanos);
 }
 
 /**
@@ -1634,13 +1647,13 @@ const Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Extracts the backend's type order for the provided value. */ function $t(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 ? Vt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : g();
+/** Extracts the backend's type order for the provided value. */ function St(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 */ : 10 /* ObjectValue */ : g();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Ft(t, n) {
-    const e = $t(t);
-    if (e !== $t(n)) return !1;
+/** Tests `left` and `right` for equality based on the backend semantics. */ function qt(t, n) {
+    const e = St(t);
+    if (e !== St(n)) return !1;
     switch (e) {
       case 0 /* NullValue */ :
         return !0;
@@ -1649,14 +1662,14 @@ const Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         return t.booleanValue === n.booleanValue;
 
       case 4 /* ServerTimestampValue */ :
-        return Dt(t).isEqual(Dt(n));
+        return Ft(t).isEqual(Ft(n));
 
       case 3 /* TimestampValue */ :
         return function(t, n) {
             if ("string" == typeof t.timestampValue && "string" == typeof n.timestampValue && t.timestampValue.length === n.timestampValue.length) 
             // Use string equality for ISO 8601 timestamps
             return t.timestampValue === n.timestampValue;
-            const e = At(t.timestampValue), r = At(n.timestampValue);
+            const e = Rt(t.timestampValue), r = Rt(n.timestampValue);
             return e.seconds === r.seconds && e.nanos === r.nanos;
         }(t, n);
 
@@ -1665,7 +1678,7 @@ const Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 6 /* BlobValue */ :
         return function(t, n) {
-            return Rt(t.bytesValue).isEqual(Rt(n.bytesValue));
+            return Nt(t.bytesValue).isEqual(Nt(n.bytesValue));
         }(t, n);
 
       case 7 /* RefValue */ :
@@ -1673,27 +1686,27 @@ const Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 8 /* GeoPointValue */ :
         return function(t, n) {
-            return Pt(t.geoPointValue.latitude) === Pt(n.geoPointValue.latitude) && Pt(t.geoPointValue.longitude) === Pt(n.geoPointValue.longitude);
+            return Vt(t.geoPointValue.latitude) === Vt(n.geoPointValue.latitude) && Vt(t.geoPointValue.longitude) === Vt(n.geoPointValue.longitude);
         }(t, n);
 
       case 2 /* NumberValue */ :
         return function(t, n) {
-            if ("integerValue" in t && "integerValue" in n) return Pt(t.integerValue) === Pt(n.integerValue);
+            if ("integerValue" in t && "integerValue" in n) return Vt(t.integerValue) === Vt(n.integerValue);
             if ("doubleValue" in t && "doubleValue" in n) {
-                const e = Pt(t.doubleValue), r = Pt(n.doubleValue);
-                return e === r ? ut(e) === ut(r) : isNaN(e) && isNaN(r);
+                const e = Vt(t.doubleValue), r = Vt(n.doubleValue);
+                return e === r ? at(e) === at(r) : isNaN(e) && isNaN(r);
             }
             return !1;
         }(t, n);
 
       case 9 /* ArrayValue */ :
-        return pt(t.arrayValue.values || [], n.arrayValue.values || [], Ft);
+        return _t(t.arrayValue.values || [], n.arrayValue.values || [], qt);
 
       case 10 /* ObjectValue */ :
         return function(t, n) {
             const e = t.mapValue.fields || {}, r = n.mapValue.fields || {};
-            if (gt(e) !== gt(r)) return !1;
-            for (const t in e) if (e.hasOwnProperty(t) && (void 0 === r[t] || !Ft(e[t], r[t]))) return !1;
+            if (bt(e) !== bt(r)) return !1;
+            for (const t in e) if (e.hasOwnProperty(t) && (void 0 === r[t] || !qt(e[t], r[t]))) return !1;
             return !0;
         }
         /** Returns true if the ArrayValue contains the specified element. */ (t, n);
@@ -1703,40 +1716,40 @@ const Tt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     }
 }
 
-function St(t, n) {
-    return void 0 !== (t.values || []).find((t => Ft(t, n)));
+function xt(t, n) {
+    return void 0 !== (t.values || []).find((t => qt(t, n)));
 }
 
-function qt(t, n) {
-    const e = $t(t), r = $t(n);
-    if (e !== r) return mt(e, r);
+function Ot(t, n) {
+    const e = St(t), r = St(n);
+    if (e !== r) return yt(e, r);
     switch (e) {
       case 0 /* NullValue */ :
         return 0;
 
       case 1 /* BooleanValue */ :
-        return mt(t.booleanValue, n.booleanValue);
+        return yt(t.booleanValue, n.booleanValue);
 
       case 2 /* NumberValue */ :
         return function(t, n) {
-            const e = Pt(t.integerValue || t.doubleValue), r = Pt(n.integerValue || n.doubleValue);
+            const e = Vt(t.integerValue || t.doubleValue), r = Vt(n.integerValue || n.doubleValue);
             return e < r ? -1 : e > r ? 1 : e === r ? 0 : 
             // one or both are NaN.
             isNaN(e) ? isNaN(r) ? 0 : -1 : 1;
         }(t, n);
 
       case 3 /* TimestampValue */ :
-        return xt(t.timestampValue, n.timestampValue);
+        return Ct(t.timestampValue, n.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return xt(Dt(t), Dt(n));
+        return Ct(Ft(t), Ft(n));
 
       case 5 /* StringValue */ :
-        return mt(t.stringValue, n.stringValue);
+        return yt(t.stringValue, n.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, n) {
-            const e = Rt(t), r = Rt(n);
+            const e = Nt(t), r = Nt(n);
             return e.compareTo(r);
         }(t.bytesValue, n.bytesValue);
 
@@ -1744,27 +1757,27 @@ function qt(t, n) {
         return function(t, n) {
             const e = t.split("/"), r = n.split("/");
             for (let t = 0; t < e.length && t < r.length; t++) {
-                const n = mt(e[t], r[t]);
+                const n = yt(e[t], r[t]);
                 if (0 !== n) return n;
             }
-            return mt(e.length, r.length);
+            return yt(e.length, r.length);
         }(t.referenceValue, n.referenceValue);
 
       case 8 /* GeoPointValue */ :
         return function(t, n) {
-            const e = mt(Pt(t.latitude), Pt(n.latitude));
+            const e = yt(Vt(t.latitude), Vt(n.latitude));
             if (0 !== e) return e;
-            return mt(Pt(t.longitude), Pt(n.longitude));
+            return yt(Vt(t.longitude), Vt(n.longitude));
         }(t.geoPointValue, n.geoPointValue);
 
       case 9 /* ArrayValue */ :
         return function(t, n) {
             const e = t.values || [], r = n.values || [];
             for (let t = 0; t < e.length && t < r.length; ++t) {
-                const n = qt(e[t], r[t]);
+                const n = Ot(e[t], r[t]);
                 if (n) return n;
             }
-            return mt(e.length, r.length);
+            return yt(e.length, r.length);
         }(t.arrayValue, n.arrayValue);
 
       case 10 /* ObjectValue */ :
@@ -1776,12 +1789,12 @@ function qt(t, n) {
             // canonical IDs are independent of insertion order.
             r.sort(), i.sort();
             for (let t = 0; t < r.length && t < i.length; ++t) {
-                const n = mt(r[t], i[t]);
+                const n = yt(r[t], i[t]);
                 if (0 !== n) return n;
-                const o = qt(e[r[t]], s[i[t]]);
+                const o = Ot(e[r[t]], s[i[t]]);
                 if (0 !== o) return o;
             }
-            return mt(r.length, i.length);
+            return yt(r.length, i.length);
         }
         /** Returns a reference value for the provided database and key. */ (t.mapValue, n.mapValue);
 
@@ -1790,35 +1803,35 @@ function qt(t, n) {
     }
 }
 
-function xt(t, n) {
-    if ("string" == typeof t && "string" == typeof n && t.length === n.length) return mt(t, n);
-    const e = At(t), r = At(n), s = mt(e.seconds, r.seconds);
-    return 0 !== s ? s : mt(e.nanos, r.nanos);
+function Ct(t, n) {
+    if ("string" == typeof t && "string" == typeof n && t.length === n.length) return yt(t, n);
+    const e = Rt(t), r = Rt(n), s = yt(e.seconds, r.seconds);
+    return 0 !== s ? s : yt(e.nanos, r.nanos);
 }
 
-function Ot(t, n) {
+function Lt(t, n) {
     return {
         referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${n.path.canonicalString()}`
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Ct(t) {
+/** Returns true if `value` is an ArrayValue. */ function kt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Lt(t) {
+/** Returns true if `value` is a NullValue. */ function Ut(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function Ut(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 kt(t) {
+/** Creates a deep copy of `source`. */ function Bt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1831,7 +1844,7 @@ function Ot(t, n) {
                 fields: {}
             }
         };
-        return vt(t.mapValue.fields, ((t, e) => n.mapValue.fields[t] = kt(e))), n;
+        return Et(t.mapValue.fields, ((t, e) => n.mapValue.fields[t] = Bt(e))), n;
     }
     if (t.arrayValue) {
         const n = {
@@ -1839,7 +1852,7 @@ function Ot(t, n) {
                 values: []
             }
         };
-        for (let e = 0; e < (t.arrayValue.values || []).length; ++e) n.arrayValue.values[e] = kt(t.arrayValue.values[e]);
+        for (let e = 0; e < (t.arrayValue.values || []).length; ++e) n.arrayValue.values[e] = Bt(t.arrayValue.values[e]);
         return n;
     }
     return Object.assign({}, t);
@@ -1864,12 +1877,12 @@ function Ot(t, n) {
 /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ class Mt {
+ */ class zt {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new Mt({
+        return new zt({
             mapValue: {}
         });
     }
@@ -1883,7 +1896,7 @@ function Ot(t, n) {
         {
             let n = this.value;
             for (let e = 0; e < t.length - 1; ++e) if (n = (n.mapValue.fields || {})[t.get(e)], 
-            !jt(n)) return null;
+            !Mt(n)) return null;
             return n = (n.mapValue.fields || {})[t.lastSegment()], n || null;
         }
     }
@@ -1893,21 +1906,21 @@ function Ot(t, n) {
      * @param path - The field path to set.
      * @param value - The value to set.
      */    set(t, n) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = kt(n);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Bt(n);
     }
     /**
      * Sets the provided fields to the provided values.
      *
      * @param data - A map of fields to values (or null for deletes).
      */    setAll(t) {
-        let n = Z.emptyPath(), e = {}, r = [];
+        let n = tt.emptyPath(), e = {}, r = [];
         t.forEach(((t, s) => {
             if (!n.isImmediateParentOf(s)) {
                 // Insert the accumulated changes at this parent location
                 const t = this.getFieldsMap(n);
                 this.applyChanges(t, e, r), e = {}, r = [], n = s.popLast();
             }
-            t ? e[s.lastSegment()] = kt(t) : r.push(s.lastSegment());
+            t ? e[s.lastSegment()] = Bt(t) : r.push(s.lastSegment());
         }));
         const s = this.getFieldsMap(n);
         this.applyChanges(s, e, r);
@@ -1919,10 +1932,10 @@ function Ot(t, n) {
      * @param path - The field path to remove.
      */    delete(t) {
         const n = this.field(t.popLast());
-        jt(n) && n.mapValue.fields && delete n.mapValue.fields[t.lastSegment()];
+        Mt(n) && n.mapValue.fields && delete n.mapValue.fields[t.lastSegment()];
     }
     isEqual(t) {
-        return Ft(this.value, t.value);
+        return qt(this.value, t.value);
     }
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -1934,7 +1947,7 @@ function Ot(t, n) {
         });
         for (let e = 0; e < t.length; ++e) {
             let r = n.mapValue.fields[t.get(e)];
-            jt(r) && r.mapValue.fields || (r = {
+            Mt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -1946,11 +1959,11 @@ function Ot(t, n) {
      * Modifies `fieldsMap` by adding, replacing or deleting the specified
      * entries.
      */    applyChanges(t, n, e) {
-        vt(n, ((n, e) => t[n] = e));
+        Et(n, ((n, e) => t[n] = e));
         for (const n of e) delete t[n];
     }
     clone() {
-        return new Mt(kt(this.value));
+        return new zt(Bt(this.value));
     }
 }
 
@@ -1979,7 +1992,7 @@ function Ot(t, n) {
  * 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 Bt {
+ */ class Qt {
     constructor(t, n, e, r, s) {
         this.key = t, this.documentType = n, this.version = e, this.data = r, this.documentState = s;
     }
@@ -1987,23 +2000,23 @@ function Ot(t, n) {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new Bt(t, 0 /* INVALID */ , _t.min(), Mt.empty(), 0 /* SYNCED */);
+        return new Qt(t, 0 /* INVALID */ , vt.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, n, e) {
-        return new Bt(t, 1 /* FOUND_DOCUMENT */ , n, e, 0 /* SYNCED */);
+        return new Qt(t, 1 /* FOUND_DOCUMENT */ , n, e, 0 /* SYNCED */);
     }
     /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, n) {
-        return new Bt(t, 2 /* NO_DOCUMENT */ , n, Mt.empty(), 0 /* SYNCED */);
+        return new Qt(t, 2 /* NO_DOCUMENT */ , n, 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, n) {
-        return new Bt(t, 3 /* UNKNOWN_DOCUMENT */ , n, Mt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new Qt(t, 3 /* UNKNOWN_DOCUMENT */ , n, zt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2016,7 +2029,7 @@ function Ot(t, n) {
      * 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 = Mt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = zt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }
     /**
@@ -2024,7 +2037,7 @@ function Ot(t, n) {
      * 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 = Mt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = zt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasCommittedMutations() {
@@ -2055,10 +2068,10 @@ function Ot(t, n) {
         return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
     }
     isEqual(t) {
-        return t instanceof Bt && 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 Qt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
     }
     clone() {
-        return new Bt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
+        return new Qt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
     }
     toString() {
         return `Document(${this.key}, ${this.version}, ${JSON.stringify(this.data.value)}, {documentType: ${this.documentType}}), {documentState: ${this.documentState}})`;
@@ -2082,10 +2095,10 @@ function Ot(t, n) {
  * limitations under the License.
  */
 // Visible for testing
-class Qt {
+class Gt {
     constructor(t, n = null, e = [], r = [], s = null, i = null, o = null) {
         this.path = t, this.collectionGroup = n, this.orderBy = e, this.filters = r, this.limit = s, 
-        this.startAt = i, this.endAt = o, this.P = null;
+        this.startAt = i, this.endAt = o, this.R = null;
     }
 }
 
@@ -2096,29 +2109,29 @@ class Qt {
  * NOTE: you should always construct `Target` from `Query.toTarget` instead of
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
- */ function zt(t, n = null, e = [], r = [], s = null, i = null, o = null) {
-    return new Qt(t, n, e, r, s, i, o);
+ */ function Wt(t, n = null, e = [], r = [], s = null, i = null, o = null) {
+    return new Gt(t, n, e, r, s, i, o);
 }
 
-class Wt extends class {} {
+class Yt extends class {} {
     constructor(t, n, e) {
         super(), this.field = t, this.op = n, this.value = e;
     }
     /**
      * Creates a filter based on the provided arguments.
      */    static create(t, n, e) {
-        return t.isKeyField() ? "in" /* IN */ === n || "not-in" /* NOT_IN */ === n ? this.R(t, n, e) : new Gt(t, n, e) : "array-contains" /* ARRAY_CONTAINS */ === n ? new Jt(t, e) : "in" /* IN */ === n ? new Zt(t, e) : "not-in" /* NOT_IN */ === n ? new Xt(t, e) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === n ? new tn(t, e) : new Wt(t, n, e);
+        return t.isKeyField() ? "in" /* IN */ === n || "not-in" /* NOT_IN */ === n ? this.V(t, n, e) : new Ht(t, n, e) : "array-contains" /* ARRAY_CONTAINS */ === n ? new Zt(t, e) : "in" /* IN */ === n ? new tn(t, e) : "not-in" /* NOT_IN */ === n ? new nn(t, e) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === n ? new en(t, e) : new Yt(t, n, e);
     }
-    static R(t, n, e) {
-        return "in" /* IN */ === n ? new Ht(t, e) : new Yt(t, e);
+    static V(t, n, e) {
+        return "in" /* IN */ === n ? new Kt(t, e) : new Jt(t, e);
     }
     matches(t) {
         const n = t.data.field(this.field);
         // Types do not have to match in NOT_EQUAL filters.
-                return "!=" /* NOT_EQUAL */ === this.op ? null !== n && this.V(qt(n, this.value)) : null !== n && $t(this.value) === $t(n) && this.V(qt(n, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== n && this.N(Ot(n, this.value)) : null !== n && St(this.value) === St(n) && this.N(Ot(n, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
-    V(t) {
+    N(t) {
         switch (this.op) {
           case "<" /* LESS_THAN */ :
             return t < 0;
@@ -2142,85 +2155,85 @@ class Wt extends class {} {
             return g();
         }
     }
-    N() {
+    D() {
         return [ "<" /* LESS_THAN */ , "<=" /* LESS_THAN_OR_EQUAL */ , ">" /* GREATER_THAN */ , ">=" /* GREATER_THAN_OR_EQUAL */ , "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ].indexOf(this.op) >= 0;
     }
 }
 
 /** Filter that matches on key fields (i.e. '__name__'). */
-class Gt extends Wt {
+class Ht extends Yt {
     constructor(t, n, e) {
-        super(t, n, e), this.key = X.fromName(e.referenceValue);
+        super(t, n, e), this.key = nt.fromName(e.referenceValue);
     }
     matches(t) {
-        const n = X.comparator(t.key, this.key);
-        return this.V(n);
+        const n = nt.comparator(t.key, this.key);
+        return this.N(n);
     }
 }
 
-/** 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, n) {
-        super(t, "in" /* IN */ , n), this.keys = Kt("in" /* IN */ , n);
+        super(t, "in" /* IN */ , n), this.keys = Xt("in" /* IN */ , n);
     }
     matches(t) {
         return this.keys.some((n => n.isEqual(t.key)));
     }
 }
 
-/** Filter that matches on key fields not present within an array. */ class Yt extends Wt {
+/** Filter that matches on key fields not present within an array. */ class Jt extends Yt {
     constructor(t, n) {
-        super(t, "not-in" /* NOT_IN */ , n), this.keys = Kt("not-in" /* NOT_IN */ , n);
+        super(t, "not-in" /* NOT_IN */ , n), this.keys = Xt("not-in" /* NOT_IN */ , n);
     }
     matches(t) {
         return !this.keys.some((n => n.isEqual(t.key)));
     }
 }
 
-function Kt(t, n) {
+function Xt(t, n) {
     var e;
-    return ((null === (e = n.arrayValue) || void 0 === e ? void 0 : e.values) || []).map((t => X.fromName(t.referenceValue)));
+    return ((null === (e = n.arrayValue) || void 0 === e ? void 0 : e.values) || []).map((t => nt.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class Jt extends Wt {
+/** A Filter that implements the array-contains operator. */ class Zt extends Yt {
     constructor(t, n) {
         super(t, "array-contains" /* ARRAY_CONTAINS */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return Ct(n) && St(n.arrayValue, this.value);
+        return kt(n) && xt(n.arrayValue, this.value);
     }
 }
 
-/** A Filter that implements the IN operator. */ class Zt extends Wt {
+/** A Filter that implements the IN operator. */ class tn extends Yt {
     constructor(t, n) {
         super(t, "in" /* IN */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return null !== n && St(this.value.arrayValue, n);
+        return null !== n && xt(this.value.arrayValue, n);
     }
 }
 
-/** A Filter that implements the not-in operator. */ class Xt extends Wt {
+/** A Filter that implements the not-in operator. */ class nn extends Yt {
     constructor(t, n) {
         super(t, "not-in" /* NOT_IN */ , n);
     }
     matches(t) {
-        if (St(this.value.arrayValue, {
+        if (xt(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         const n = t.data.field(this.field);
-        return null !== n && !St(this.value.arrayValue, n);
+        return null !== n && !xt(this.value.arrayValue, n);
     }
 }
 
-/** A Filter that implements the array-contains-any operator. */ class tn extends Wt {
+/** A Filter that implements the array-contains-any operator. */ class en extends Yt {
     constructor(t, n) {
         super(t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return !(!Ct(n) || !n.arrayValue.values) && n.arrayValue.values.some((t => St(this.value.arrayValue, t)));
+        return !(!kt(n) || !n.arrayValue.values) && n.arrayValue.values.some((t => xt(this.value.arrayValue, t)));
     }
 }
 
@@ -2237,7 +2250,7 @@ function Kt(t, n) {
  * 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 nn {
+ */ class rn {
     constructor(t, n) {
         this.position = t, this.before = n;
     }
@@ -2245,22 +2258,22 @@ function Kt(t, n) {
 
 /**
  * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
- */ class en {
+ */ class sn {
     constructor(t, n = "asc" /* ASCENDING */) {
         this.field = t, this.dir = n;
     }
 }
 
-function rn(t, n) {
+function on(t, n) {
     return t.dir === n.dir && t.field.isEqual(n.field);
 }
 
-function sn(t, n) {
+function un(t, n) {
     if (null === t) return null === n;
     if (null === n) return !1;
     if (t.before !== n.before || t.position.length !== n.position.length) return !1;
     for (let e = 0; e < t.position.length; e++) {
-        if (!Ft(t.position[e], n.position[e])) return !1;
+        if (!qt(t.position[e], n.position[e])) return !1;
     }
     return !0;
 }
@@ -2287,29 +2300,29 @@ function sn(t, n) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ class on {
+ */ class cn {
     /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
      */
     constructor(t, n = null, e = [], r = [], s = null, i = "F" /* First */ , o = null, u = null) {
         this.path = t, this.collectionGroup = n, this.explicitOrderBy = e, this.filters = r, 
-        this.limit = s, this.limitType = i, this.startAt = o, this.endAt = u, this.D = null, 
+        this.limit = s, this.limitType = i, this.startAt = o, this.endAt = u, this.$ = null, 
         // The corresponding `Target` of this `Query` instance.
-        this.$ = null, this.startAt, this.endAt;
+        this.F = null, this.startAt, this.endAt;
     }
 }
 
-/** Creates a new Query for a query that matches all documents at `path` */ function un(t) {
-    return !ot(t.limit) && "L" /* Last */ === t.limitType;
+/** Creates a new Query for a query that matches all documents at `path` */ function an(t) {
+    return !ct(t.limit) && "L" /* Last */ === t.limitType;
 }
 
-function cn(t) {
+function hn(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function an(t) {
-    for (const n of t.filters) if (n.N()) return n.field;
+function ln(t) {
+    for (const n of t.filters) if (n.D()) return n.field;
     return null;
 }
 
@@ -2321,7 +2334,7 @@ function an(t) {
  * Returns whether the query matches a collection group rather than a specific
  * collection.
  */
-function hn(t) {
+function fn(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2329,59 +2342,59 @@ function hn(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 ln(t) {
+ */ function dn(t) {
     const n = b(t);
-    if (null === n.D) {
-        n.D = [];
-        const t = an(n), e = cn(n);
+    if (null === n.$) {
+        n.$ = [];
+        const t = ln(n), e = hn(n);
         if (null !== t && null === e) 
         // 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() || n.D.push(new en(t)), n.D.push(new en(Z.keyField(), "asc" /* ASCENDING */)); else {
+        t.isKeyField() || n.$.push(new sn(t)), n.$.push(new sn(tt.keyField(), "asc" /* ASCENDING */)); else {
             let t = !1;
-            for (const e of n.explicitOrderBy) n.D.push(e), e.field.isKeyField() && (t = !0);
+            for (const e of n.explicitOrderBy) n.$.push(e), e.field.isKeyField() && (t = !0);
             if (!t) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 const t = n.explicitOrderBy.length > 0 ? n.explicitOrderBy[n.explicitOrderBy.length - 1].dir : "asc" /* ASCENDING */;
-                n.D.push(new en(Z.keyField(), t));
+                n.$.push(new sn(tt.keyField(), t));
             }
         }
     }
-    return n.D;
+    return n.$;
 }
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function fn(t) {
+ */ function wn(t) {
     const n = b(t);
-    if (!n.$) if ("F" /* First */ === n.limitType) n.$ = zt(n.path, n.collectionGroup, ln(n), n.filters, n.limit, n.startAt, n.endAt); else {
+    if (!n.F) if ("F" /* First */ === n.limitType) n.F = Wt(n.path, n.collectionGroup, dn(n), n.filters, n.limit, n.startAt, n.endAt); else {
         // Flip the orderBy directions since we want the last results
         const t = [];
-        for (const e of ln(n)) {
+        for (const e of dn(n)) {
             const n = "desc" /* DESCENDING */ === e.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            t.push(new en(e.field, n));
+            t.push(new sn(e.field, n));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                const e = n.endAt ? new nn(n.endAt.position, !n.endAt.before) : null, r = n.startAt ? new nn(n.startAt.position, !n.startAt.before) : null;
+                const e = n.endAt ? new rn(n.endAt.position, !n.endAt.before) : null, r = n.startAt ? new rn(n.startAt.position, !n.startAt.before) : null;
         // Now return as a LimitType.First query.
-        n.$ = zt(n.path, n.collectionGroup, t, n.filters, n.limit, e, r);
+        n.F = Wt(n.path, n.collectionGroup, t, n.filters, n.limit, e, r);
     }
-    return n.$;
+    return n.F;
 }
 
-function dn(t, n) {
+function mn(t, n) {
     return function(t, n) {
         if (t.limit !== n.limit) return !1;
         if (t.orderBy.length !== n.orderBy.length) return !1;
-        for (let e = 0; e < t.orderBy.length; e++) if (!rn(t.orderBy[e], n.orderBy[e])) return !1;
+        for (let e = 0; e < t.orderBy.length; e++) if (!on(t.orderBy[e], n.orderBy[e])) return !1;
         if (t.filters.length !== n.filters.length) return !1;
         for (let s = 0; s < t.filters.length; s++) if (e = t.filters[s], r = n.filters[s], 
-        e.op !== r.op || !e.field.isEqual(r.field) || !Ft(e.value, r.value)) return !1;
+        e.op !== r.op || !e.field.isEqual(r.field) || !qt(e.value, r.value)) return !1;
         var e, r;
-        return t.collectionGroup === n.collectionGroup && !!t.path.isEqual(n.path) && !!sn(t.startAt, n.startAt) && sn(t.endAt, n.endAt);
-    }(fn(t), fn(n)) && t.limitType === n.limitType;
+        return t.collectionGroup === n.collectionGroup && !!t.path.isEqual(n.path) && !!un(t.startAt, n.startAt) && un(t.endAt, n.endAt);
+    }(wn(t), wn(n)) && t.limitType === n.limitType;
 }
 
 /**
@@ -2409,9 +2422,9 @@ function dn(t, n) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function wn(t, n) {
+function pn(t, n) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !ut(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !at(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(n) ? 
     /**
  * Returns an IntegerValue for `value`.
@@ -2421,7 +2434,7 @@ function wn(t, n) {
             integerValue: "" + t
         };
     }(n) : function(t, n) {
-        if (t.F) {
+        if (t.S) {
             if (isNaN(n)) return {
                 doubleValue: "NaN"
             };
@@ -2433,7 +2446,7 @@ function wn(t, n) {
             };
         }
         return {
-            doubleValue: ut(n) ? "-0" : n
+            doubleValue: at(n) ? "-0" : n
         };
     }(t, n);
 }
@@ -2454,7 +2467,7 @@ function wn(t, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Used to represent a field transform on a mutation. */ class mn {
+/** Used to represent a field transform on a mutation. */ class yn {
     constructor() {
         // Make sure that the structural type of `TransformOperation` is unique.
         // See https://github.com/microsoft/TypeScript/issues/5451
@@ -2462,15 +2475,15 @@ function wn(t, n) {
     }
 }
 
-/** Transforms a value into a server-generated timestamp. */ class pn extends mn {}
+/** Transforms a value into a server-generated timestamp. */ class _n extends yn {}
 
-/** Transforms an array value via a union operation. */ class yn extends mn {
+/** Transforms an array value via a union operation. */ class gn extends yn {
     constructor(t) {
         super(), this.elements = t;
     }
 }
 
-/** Transforms an array value via a remove operation. */ class _n extends mn {
+/** Transforms an array value via a remove operation. */ class vn extends yn {
     constructor(t) {
         super(), this.elements = t;
     }
@@ -2481,9 +2494,9 @@ function wn(t, n) {
  * 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 gn extends mn {
+ */ class bn extends yn {
     constructor(t, n) {
-        super(), this.S = t, this.q = n;
+        super(), this.q = t, this.O = n;
     }
 }
 
@@ -2503,7 +2516,7 @@ function wn(t, n) {
  * 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 vn {
+/** A field path and the TransformOperation to perform upon it. */ class En {
     constructor(t, n) {
         this.field = t, this.transform = n;
     }
@@ -2513,18 +2526,18 @@ function wn(t, n) {
  * Encodes a precondition for a mutation. This follows the model that the
  * backend accepts with the special case of an explicit "empty" precondition
  * (meaning no precondition).
- */ class bn {
+ */ class Tn {
     constructor(t, n) {
         this.updateTime = t, this.exists = n;
     }
     /** Creates a new empty Precondition. */    static none() {
-        return new bn;
+        return new Tn;
     }
     /** Creates a new Precondition with an exists flag. */    static exists(t) {
-        return new bn(void 0, t);
+        return new Tn(void 0, t);
     }
     /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {
-        return new bn(t);
+        return new Tn(t);
     }
     /** Returns whether this Precondition is empty. */    get isNone() {
         return void 0 === this.updateTime && void 0 === this.exists;
@@ -2577,12 +2590,12 @@ function wn(t, n) {
  * applyToLocalView() to implement the actual behavior of applying the mutation
  * to some source document (see `setMutationApplyToRemoteDocument()` for an
  * example).
- */ class En {}
+ */ class In {}
 
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class In extends En {
+ */ class An extends In {
     constructor(t, n, e, r = []) {
         super(), this.key = t, this.value = n, this.precondition = e, this.fieldTransforms = r, 
         this.type = 0 /* Set */;
@@ -2601,14 +2614,14 @@ function wn(t, n) {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ class Tn extends En {
+ */ class Pn extends In {
     constructor(t, n, e, r, s = []) {
         super(), this.key = t, this.data = n, this.fieldMask = e, this.precondition = r, 
         this.fieldTransforms = s, this.type = 1 /* Patch */;
     }
 }
 
-/** A mutation that deletes the document at the given key. */ class An extends En {
+/** A mutation that deletes the document at the given key. */ class Rn extends In {
     constructor(t, n) {
         super(), this.key = t, this.precondition = n, this.type = 2 /* Delete */ , this.fieldTransforms = [];
     }
@@ -2620,7 +2633,7 @@ function wn(t, n) {
  *
  * The `verify` operation is only used in Transactions, and this class serves
  * primarily to facilitate serialization into protos.
- */ class Pn extends En {
+ */ class Vn extends In {
     constructor(t, n) {
         super(), this.key = t, this.precondition = n, this.type = 3 /* Verify */ , this.fieldTransforms = [];
     }
@@ -2641,13 +2654,13 @@ function wn(t, 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 Rn = (() => {
+ */ const Nn = (() => {
     const t = {
         asc: "ASCENDING",
         desc: "DESCENDING"
     };
     return t;
-})(), Vn = (() => {
+})(), Dn = (() => {
     const t = {
         "<": "LESS_THAN",
         "<=": "LESS_THAN_OR_EQUAL",
@@ -2677,9 +2690,9 @@ function wn(t, n) {
  * TODO(klimt): We can remove the databaseId argument if we keep the full
  * resource name in documents.
  */
-class Nn {
+class $n {
     constructor(t, n) {
-        this.databaseId = t, this.F = n;
+        this.databaseId = t, this.S = n;
     }
 }
 
@@ -2694,8 +2707,8 @@ class Nn {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Dn(t, n) {
-    if (t.F) {
+function Fn(t, n) {
+    if (t.S) {
         return `${new Date(1e3 * n.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + n.nanoseconds).slice(-9)}Z`;
     }
     return {
@@ -2709,129 +2722,129 @@ function Dn(t, n) {
  *
  * Visible for testing.
  */
-function $n(t, n) {
-    return t.F ? n.toBase64() : n.toUint8Array();
+function Sn(t, n) {
+    return t.S ? n.toBase64() : n.toUint8Array();
 }
 
-function Fn(t, n) {
-    return Dn(t, n.toTimestamp());
+function qn(t, n) {
+    return Fn(t, n.toTimestamp());
 }
 
-function Sn(t) {
-    return v(!!t), _t.fromTimestamp(function(t) {
-        const n = At(t);
-        return new yt(n.seconds, n.nanos);
+function xn(t) {
+    return v(!!t), vt.fromTimestamp(function(t) {
+        const n = Rt(t);
+        return new gt(n.seconds, n.nanos);
     }(t));
 }
 
-function qn(t, n) {
+function On(t, n) {
     return function(t) {
-        return new K([ "projects", t.projectId, "databases", t.database ]);
+        return new X([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(n).canonicalString();
 }
 
-function xn(t, n) {
-    return qn(t.databaseId, n.path);
+function Cn(t, n) {
+    return On(t.databaseId, n.path);
 }
 
-function On(t, n) {
+function Ln(t, n) {
     const e = function(t) {
-        const n = K.fromString(t);
-        return v(Hn(n)), n;
+        const n = X.fromString(t);
+        return v(Kn(n)), n;
     }(n);
-    if (e.get(1) !== t.databaseId.projectId) throw new U(A, "Tried to deserialize key from different project: " + e.get(1) + " vs " + t.databaseId.projectId);
-    if (e.get(3) !== t.databaseId.database) throw new U(A, "Tried to deserialize key from different database: " + e.get(3) + " vs " + t.databaseId.database);
-    return new X((v((r = e).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
+    if (e.get(1) !== t.databaseId.projectId) throw new k(A, "Tried to deserialize key from different project: " + e.get(1) + " vs " + t.databaseId.projectId);
+    if (e.get(3) !== t.databaseId.database) throw new k(A, "Tried to deserialize key from different database: " + e.get(3) + " vs " + t.databaseId.database);
+    return new nt((v((r = e).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 Cn(t, n) {
-    return qn(t.databaseId, n);
+function kn(t, n) {
+    return On(t.databaseId, n);
 }
 
-function Ln(t) {
-    return new K([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
+function Un(t) {
+    return new X([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Un(t, n, e) {
+function jn(t, n, e) {
     return {
-        name: xn(t, n),
+        name: Cn(t, n),
         fields: e.value.mapValue.fields
     };
 }
 
-function jn(t, n) {
+function Mn(t, n) {
     return "found" in n ? function(t, n) {
         v(!!n.found), n.found.name, n.found.updateTime;
-        const e = On(t, n.found.name), r = Sn(n.found.updateTime), s = new Mt({
+        const e = Ln(t, n.found.name), r = xn(n.found.updateTime), s = new zt({
             mapValue: {
                 fields: n.found.fields
             }
         });
-        return Bt.newFoundDocument(e, r, s);
+        return Qt.newFoundDocument(e, r, s);
     }(t, n) : "missing" in n ? function(t, n) {
         v(!!n.missing), v(!!n.readTime);
-        const e = On(t, n.missing), r = Sn(n.readTime);
-        return Bt.newNoDocument(e, r);
+        const e = Ln(t, n.missing), r = xn(n.readTime);
+        return Qt.newNoDocument(e, r);
     }(t, n) : g();
 }
 
-function kn(t, n) {
+function Bn(t, n) {
     let e;
-    if (n instanceof In) e = {
-        update: Un(t, n.key, n.value)
-    }; else if (n instanceof An) e = {
-        delete: xn(t, n.key)
-    }; else if (n instanceof Tn) e = {
-        update: Un(t, n.key, n.data),
-        updateMask: Gn(n.fieldMask)
+    if (n instanceof An) e = {
+        update: jn(t, n.key, n.value)
+    }; else if (n instanceof Rn) e = {
+        delete: Cn(t, n.key)
+    }; else if (n instanceof Pn) e = {
+        update: jn(t, n.key, n.data),
+        updateMask: Hn(n.fieldMask)
     }; else {
-        if (!(n instanceof Pn)) return g();
+        if (!(n instanceof Vn)) return g();
         e = {
-            verify: xn(t, n.key)
+            verify: Cn(t, n.key)
         };
     }
     return n.fieldTransforms.length > 0 && (e.updateTransforms = n.fieldTransforms.map((t => function(t, n) {
         const e = n.transform;
-        if (e instanceof pn) return {
+        if (e instanceof _n) return {
             fieldPath: n.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
-        if (e instanceof yn) return {
+        if (e instanceof gn) return {
             fieldPath: n.field.canonicalString(),
             appendMissingElements: {
                 values: e.elements
             }
         };
-        if (e instanceof _n) return {
+        if (e instanceof vn) return {
             fieldPath: n.field.canonicalString(),
             removeAllFromArray: {
                 values: e.elements
             }
         };
-        if (e instanceof gn) return {
+        if (e instanceof bn) return {
             fieldPath: n.field.canonicalString(),
-            increment: e.q
+            increment: e.O
         };
         throw g();
     }(0, t)))), n.precondition.isNone || (e.currentDocument = function(t, n) {
         return void 0 !== n.updateTime ? {
-            updateTime: Fn(t, n.updateTime)
+            updateTime: qn(t, n.updateTime)
         } : void 0 !== n.exists ? {
             exists: n.exists
         } : g();
     }(t, n.precondition)), e;
 }
 
-function Mn(t, n) {
+function zn(t, n) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const e = {
         structuredQuery: {}
     }, r = n.path;
-    null !== n.collectionGroup ? (e.parent = Cn(t, r), e.structuredQuery.from = [ {
+    null !== n.collectionGroup ? (e.parent = kn(t, r), e.structuredQuery.from = [ {
         collectionId: n.collectionGroup,
         allDescendants: !0
-    } ]) : (e.parent = Cn(t, r.popLast()), e.structuredQuery.from = [ {
+    } ]) : (e.parent = kn(t, r.popLast()), e.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     const s = function(t) {
@@ -2840,36 +2853,36 @@ function Mn(t, n) {
         // visible for testing
         function(t) {
             if ("==" /* EQUAL */ === t.op) {
-                if (Ut(t.value)) return {
+                if (jt(t.value)) return {
                     unaryFilter: {
-                        field: Wn(t.field),
+                        field: Yn(t.field),
                         op: "IS_NAN"
                     }
                 };
-                if (Lt(t.value)) return {
+                if (Ut(t.value)) return {
                     unaryFilter: {
-                        field: Wn(t.field),
+                        field: Yn(t.field),
                         op: "IS_NULL"
                     }
                 };
             } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                if (Ut(t.value)) return {
+                if (jt(t.value)) return {
                     unaryFilter: {
-                        field: Wn(t.field),
+                        field: Yn(t.field),
                         op: "IS_NOT_NAN"
                     }
                 };
-                if (Lt(t.value)) return {
+                if (Ut(t.value)) return {
                     unaryFilter: {
-                        field: Wn(t.field),
+                        field: Yn(t.field),
                         op: "IS_NOT_NULL"
                     }
                 };
             }
             return {
                 fieldFilter: {
-                    field: Wn(t.field),
-                    op: zn(t.op),
+                    field: Yn(t.field),
+                    op: Wn(t.op),
                     value: t.value
                 }
             };
@@ -2889,22 +2902,22 @@ function Mn(t, n) {
         // visible for testing
         function(t) {
             return {
-                field: Wn(t.field),
-                direction: Qn(t.dir)
+                field: Yn(t.field),
+                direction: Gn(t.dir)
             };
         }(t)));
     }(n.orderBy);
     i && (e.structuredQuery.orderBy = i);
     const o = function(t, n) {
-        return t.F || ot(n) ? n : {
+        return t.S || ct(n) ? n : {
             value: n
         };
     }(t, n.limit);
-    return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = Bn(n.startAt)), 
-    n.endAt && (e.structuredQuery.endAt = Bn(n.endAt)), e;
+    return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = Qn(n.startAt)), 
+    n.endAt && (e.structuredQuery.endAt = Qn(n.endAt)), e;
 }
 
-function Bn(t) {
+function Qn(t) {
     return {
         before: t.before,
         values: t.position
@@ -2912,29 +2925,29 @@ function Bn(t) {
 }
 
 // visible for testing
-function Qn(t) {
-    return Rn[t];
+function Gn(t) {
+    return Nn[t];
 }
 
 // visible for testing
-function zn(t) {
-    return Vn[t];
+function Wn(t) {
+    return Dn[t];
 }
 
-function Wn(t) {
+function Yn(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Gn(t) {
+function Hn(t) {
     const n = [];
     return t.fields.forEach((t => n.push(t.canonicalString()))), {
         fieldPaths: n
     };
 }
 
-function Hn(t) {
+function Kn(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2954,8 +2967,8 @@ function Hn(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 Yn(t) {
-    return new Nn(t, /* useProto3Json= */ !0);
+ */ function Jn(t) {
+    return new $n(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -2983,7 +2996,7 @@ function Hn(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class Kn {
+class Xn {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3008,9 +3021,9 @@ class Kn {
      * Note that jitter will still be applied, so the actual delay could be as
      * much as 1.5*maxDelayMs.
      */ , s = 6e4) {
-        this.O = t, this.timerId = n, this.C = e, this.L = r, this.U = s, this.j = 0, this.k = null, 
+        this.C = t, this.timerId = n, this.L = e, this.k = r, this.U = s, this.j = 0, this.M = null, 
         /** The last backoff attempt, as epoch milliseconds. */
-        this.M = Date.now(), this.reset();
+        this.B = Date.now(), this.reset();
     }
     /**
      * Resets the backoff delay.
@@ -3024,7 +3037,7 @@ class Kn {
     /**
      * Resets the backoff delay to the maximum delay (e.g. for use after a
      * RESOURCE_EXHAUSTED error).
-     */    B() {
+     */    G() {
         this.j = this.U;
     }
     /**
@@ -3036,22 +3049,22 @@ class Kn {
         this.cancel();
         // First schedule using the current base (which may be 0 and should be
         // honored as such).
-        const n = Math.floor(this.j + this.G()), e = Math.max(0, Date.now() - this.M), r = Math.max(0, n - e);
+        const n = Math.floor(this.j + this.Y()), e = Math.max(0, Date.now() - this.B), r = Math.max(0, n - e);
         // Guard against lastAttemptTime being in the future due to a clock change.
                 r > 0 && m("ExponentialBackoff", `Backing off for ${r} ms (base delay: ${this.j} ms, delay with jitter: ${n} ms, last attempt: ${e} ms ago)`), 
-        this.k = this.O.enqueueAfterDelay(this.timerId, r, (() => (this.M = Date.now(), 
+        this.M = this.C.enqueueAfterDelay(this.timerId, r, (() => (this.B = Date.now(), 
         t()))), 
         // Apply backoff factor to determine next delay and ensure it is within
         // bounds.
-        this.j *= this.L, this.j < this.C && (this.j = this.C), this.j > this.U && (this.j = this.U);
+        this.j *= this.k, this.j < this.L && (this.j = this.L), this.j > this.U && (this.j = this.U);
     }
     H() {
-        null !== this.k && (this.k.skipDelay(), this.k = null);
+        null !== this.M && (this.M.skipDelay(), this.M = null);
     }
     cancel() {
-        null !== this.k && (this.k.cancel(), this.k = null);
+        null !== this.M && (this.M.cancel(), this.M = null);
     }
-    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */    G() {
+    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */    Y() {
         return (Math.random() - .5) * this.j;
     }
 }
@@ -3081,45 +3094,46 @@ class Kn {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class Jn extends class {} {
-    constructor(t, n, e) {
-        super(), this.credentials = t, this.Y = n, this.S = e, this.K = !1;
+class Zn extends class {} {
+    constructor(t, n, e, r) {
+        super(), this.authCredentials = t, this.appCheckCredentials = n, this.K = e, this.q = r, 
+        this.J = !1;
     }
-    J() {
-        if (this.K) throw new U(F, "The client has already been terminated.");
+    X() {
+        if (this.J) throw new k(F, "The client has already been terminated.");
     }
-    /** Gets an auth token and invokes the provided RPC. */    l(t, n, e) {
-        return this.J(), this.credentials.getToken().then((r => this.Y.l(t, n, e, r))).catch((t => {
-            throw "FirebaseError" === t.name ? (t.code === D && this.credentials.invalidateToken(), 
-            t) : new U(T, t.toString());
+    /** Invokes the provided RPC with auth and AppCheck tokens. */    m(t, n, e) {
+        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.K.m(t, n, e, r, s))).catch((t => {
+            throw "FirebaseError" === t.name ? (t.code === D && (this.authCredentials.invalidateToken(), 
+            this.appCheckCredentials.invalidateToken()), t) : new k(I, t.toString());
         }));
     }
-    /** Gets an auth token and invokes the provided RPC with streamed results. */    v(t, n, e) {
-        return this.J(), this.credentials.getToken().then((r => this.Y.v(t, n, e, r))).catch((t => {
-            throw "FirebaseError" === t.name ? (t.code === D && this.credentials.invalidateToken(), 
-            t) : new U(T, t.toString());
+    /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */    T(t, n, e) {
+        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.K.T(t, n, e, r, s))).catch((t => {
+            throw "FirebaseError" === t.name ? (t.code === D && (this.authCredentials.invalidateToken(), 
+            this.appCheckCredentials.invalidateToken()), t) : new k(I, t.toString());
         }));
     }
     terminate() {
-        this.K = !0;
+        this.J = !0;
     }
 }
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function Zn(t, n) {
-    const e = b(t), r = Ln(e.S) + "/documents", s = {
-        writes: n.map((t => kn(e.S, t)))
+async function te(t, n) {
+    const e = b(t), r = Un(e.q) + "/documents", s = {
+        writes: n.map((t => Bn(e.q, t)))
     };
-    await e.l("Commit", r, s);
+    await e.m("Commit", r, s);
 }
 
-async function Xn(t, n) {
-    const e = b(t), r = Ln(e.S) + "/documents", s = {
-        documents: n.map((t => xn(e.S, t)))
-    }, i = await e.v("BatchGetDocuments", r, s), o = new Map;
+async function ne(t, n) {
+    const e = b(t), r = Un(e.q) + "/documents", s = {
+        documents: n.map((t => Cn(e.q, t)))
+    }, i = await e.T("BatchGetDocuments", r, s), o = new Map;
     i.forEach((t => {
-        const n = jn(e.S, t);
+        const n = Mn(e.q, t);
         o.set(n.key.toString(), n);
     }));
     const u = [];
@@ -3129,18 +3143,18 @@ async function Xn(t, n) {
     })), u;
 }
 
-async function te(t, n) {
-    const e = b(t), r = Mn(e.S, fn(n));
-    return (await e.v("RunQuery", r.parent, {
+async function ee(t, n) {
+    const e = b(t), r = zn(e.q, wn(n));
+    return (await e.T("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, n, e) {
-        const r = On(t, n.name), s = Sn(n.updateTime), i = new Mt({
+        const r = Ln(t, n.name), s = xn(n.updateTime), i = new zt({
             mapValue: {
                 fields: n.fields
             }
-        }), o = Bt.newFoundDocument(r, s, i);
+        }), o = Qt.newFoundDocument(r, s, i);
         return e && o.setHasCommittedMutations(), e ? o.setHasCommittedMutations() : o;
-    }(e.S, t.document, void 0)));
+    }(e.q, t.document, void 0)));
 }
 
 /**
@@ -3158,7 +3172,7 @@ async function te(t, 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 ne = new Map;
+ */ const re = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3169,17 +3183,17 @@ async function te(t, n) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function ee(t) {
-    if (t._terminated) throw new U(F, "The client has already been terminated.");
-    if (!ne.has(t)) {
+function se(t) {
+    if (t._terminated) throw new k(F, "The client has already been terminated.");
+    if (!re.has(t)) {
         m("ComponentProvider", "Initializing Datastore");
         const i = function(t) {
-            return new ft(t, fetch.bind(null));
+            return new wt(t, fetch.bind(null));
         }((n = t._databaseId, e = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
-        new G(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Yn(t._databaseId), u = function(t, n, e) {
-            return new Jn(t, n, e);
-        }(t._credentials, i, o);
-        ne.set(t, u);
+        new H(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Jn(t._databaseId), u = function(t, n, e, r) {
+            return new Zn(t, n, e, r);
+        }(t._authCredentials, t._appCheckCredentials, i, o);
+        re.set(t, u);
     }
     var n, e, r, s;
     /**
@@ -3197,7 +3211,7 @@ function ee(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 ne.get(t);
+ */    return re.get(t);
 }
 
 /**
@@ -3209,21 +3223,21 @@ function ee(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 re {
+class ie {
     constructor(t) {
         var n;
         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 k(A, "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 === (n = t.ssl) || void 0 === n || n;
         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 k(A, "cacheSizeBytes must be at least 1048576");
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
         this.useFetchStreams = !!t.useFetchStreams, function(t, n, e, r) {
-            if (!0 === n && !0 === r) throw new U(A, `${t} and ${e} cannot be used together.`);
+            if (!0 === n && !0 === r) throw new k(A, `${t} and ${e} cannot be used together.`);
         }("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
     }
     isEqual(t) {
@@ -3251,18 +3265,18 @@ class re {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class se {
+ */ class oe {
     /** @hideconstructor */
-    constructor(t, n) {
-        this._credentials = n, 
+    constructor(t, n, e) {
+        this._authCredentials = n, this._appCheckCredentials = e, 
         /**
          * Whether it's a Firestore or Firestore Lite instance.
          */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new re({}), 
-        this._settingsFrozen = !1, t instanceof H ? this._databaseId = t : (this._app = t, 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new ie({}), 
+        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.');
-            return new H(t.options.projectId);
+            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new k(A, '"projectId" not provided in firebase.initializeApp.');
+            return new K(t.options.projectId);
         }
         /**
  * Initializes a new instance of Cloud Firestore with the provided settings.
@@ -3280,7 +3294,7 @@ class re {
      * The {@link @firebase/app#FirebaseApp} associated with this `Firestore` service
      * instance.
      */    get app() {
-        if (!this._app) throw new U(F, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+        if (!this._app) throw new k(F, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
         return this._app;
     }
     get _initialized() {
@@ -3290,21 +3304,21 @@ class re {
         return void 0 !== this._terminateTask;
     }
     _setSettings(t) {
-        if (this._settingsFrozen) throw new U(F, "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 re(t), void 0 !== t.credentials && (this._credentials = function(t) {
+        if (this._settingsFrozen) throw new k(F, "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 ie(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new M;
             switch (t.type) {
               case "gapi":
                 const n = t.client;
                 // Make sure this really is a Gapi client.
                                 return v(!("object" != typeof n || null === n || !n.auth || !n.auth.getAuthHeaderValueForFirstParty)), 
-                new W(n, t.sessionIndex || "0", t.iamToken || null);
+                new G(n, t.sessionIndex || "0", t.iamToken || null);
 
               case "provider":
                 return t.client;
 
               default:
-                throw new U(A, "makeCredentialsProvider failed due to invalid credential type");
+                throw new k(A, "makeAuthCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }
@@ -3332,15 +3346,15 @@ class re {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const n = ne.get(t);
-            n && (m("ComponentProvider", "Removing Datastore"), ne.delete(t), n.terminate());
+            const n = re.get(t);
+            n && (m("ComponentProvider", "Removing Datastore"), re.delete(t), n.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function ie(t, n) {
+function ue(t, n) {
     const e = _getProvider(t, "firestore/lite");
-    if (e.isInitialized()) throw new U(F, "Firestore can only be initialized once per app.");
+    if (e.isInitialized()) throw new k(F, "Firestore can only be initialized once per app.");
     return e.initialize({
         options: n
     });
@@ -3354,7 +3368,7 @@ function ie(t, n) {
  * @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 oe(n = t()) {
+ */ function ce(n = t()) {
     return _getProvider(n, "firestore/lite").getImmediate();
 }
 
@@ -3370,9 +3384,9 @@ function ie(t, n) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function ue(t, n, e, r = {}) {
+ */ function ae(t, n, e, r = {}) {
     var s;
-    const i = (t = st(t, se))._getSettings();
+    const i = (t = ot(t, oe))._getSettings();
     if ("firestore.googleapis.com" !== i.host && i.host !== n && y("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, i), {
         host: `${n}:${e}`,
@@ -3384,10 +3398,10 @@ function ie(t, n) {
             // invalid field "uid" and missing field "sub" / "user_id".)
             n = a(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 k(A, "mockUserToken must contain 'sub' or 'user_id' field!");
             e = new l(i);
         }
-        t._credentials = new B(new k(n, e));
+        t._authCredentials = new B(new j(n, e));
     }
 }
 
@@ -3410,8 +3424,8 @@ function ie(t, n) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function ce(t) {
-    return t = st(t, se), n(t.app, "firestore/lite"), t._delete();
+ */ function he(t) {
+    return t = ot(t, oe), n(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3451,7 +3465,7 @@ function ie(t, n) {
  * and can be used to write, read, or listen to the location. The document at
  * the referenced location may or may not exist.
  */
-class ae {
+class le {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -3479,17 +3493,17 @@ class ae {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new le(this.firestore, this.converter, this._key.path.popLast());
+        return new de(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new ae(this.firestore, t, this._key);
+        return new le(this.firestore, t, this._key);
     }
 }
 
 /**
  * A `Query` refers to a query which you can read or listen to. You can also
  * construct refined `Query` objects by adding filters and ordering.
- */ class he {
+ */ class fe {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -3502,17 +3516,17 @@ class ae {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new he(this.firestore, t, this._query);
+        return new fe(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 le extends he {
+ */ class de extends fe {
     /** @hideconstructor */
     constructor(t, n, e) {
-        super(t, n, new on(e)), this._path = e, 
+        super(t, n, new cn(e)), this._path = e, 
         /** The type of this Firestore reference. */
         this.type = "collection";
     }
@@ -3530,23 +3544,23 @@ class ae {
      * subcollection. If this isn't a subcollection, the reference is null.
      */    get parent() {
         const t = this._path.popLast();
-        return t.isEmpty() ? null : new ae(this.firestore, 
-        /* converter= */ null, new X(t));
+        return t.isEmpty() ? null : new le(this.firestore, 
+        /* converter= */ null, new nt(t));
     }
     withConverter(t) {
-        return new le(this.firestore, t, this._path);
+        return new de(this.firestore, t, this._path);
     }
 }
 
-function fe(t, n, ...e) {
-    if (t = h(t), tt("collection", "path", n), t instanceof se) {
-        const r = K.fromString(n, ...e);
-        return et(r), new le(t, /* converter= */ null, r);
+function we(t, n, ...e) {
+    if (t = h(t), et("collection", "path", n), t instanceof oe) {
+        const r = X.fromString(n, ...e);
+        return st(r), new de(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof ae || t instanceof le)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-        const r = t._path.child(K.fromString(n, ...e));
-        return et(r), new le(t.firestore, 
+        if (!(t instanceof le || t instanceof de)) throw new k(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        const r = t._path.child(X.fromString(n, ...e));
+        return st(r), new de(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -3563,32 +3577,32 @@ function fe(t, n, ...e) {
  * 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 de(t, n) {
-    if (t = st(t, se), tt("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new U(A, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new he(t, 
+ */ function me(t, n) {
+    if (t = ot(t, oe), et("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new k(A, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new fe(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 on(K.emptyPath(), t);
+        return new cn(X.emptyPath(), t);
     }(n));
 }
 
-function we(t, n, ...e) {
+function pe(t, n, ...e) {
     if (t = h(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (n = wt.A()), tt("doc", "path", n), t instanceof se) {
-        const r = K.fromString(n, ...e);
-        return nt(r), new ae(t, 
-        /* converter= */ null, new X(r));
+    1 === arguments.length && (n = pt.P()), et("doc", "path", n), t instanceof oe) {
+        const r = X.fromString(n, ...e);
+        return rt(r), new le(t, 
+        /* converter= */ null, new nt(r));
     }
     {
-        if (!(t instanceof ae || t instanceof le)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-        const r = t._path.child(K.fromString(n, ...e));
-        return nt(r), new ae(t.firestore, t instanceof le ? t.converter : null, new X(r));
+        if (!(t instanceof le || t instanceof de)) throw new k(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        const r = t._path.child(X.fromString(n, ...e));
+        return rt(r), new le(t.firestore, t instanceof de ? t.converter : null, new nt(r));
     }
 }
 
@@ -3599,8 +3613,8 @@ function we(t, n, ...e) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function me(t, n) {
-    return t = h(t), n = h(n), (t instanceof ae || t instanceof le) && (n instanceof ae || n instanceof le) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
+ */ function ye(t, n) {
+    return t = h(t), n = h(n), (t instanceof le || t instanceof de) && (n instanceof le || n instanceof de) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
 }
 
 /**
@@ -3611,8 +3625,8 @@ function we(t, n, ...e) {
  * @param right - A `Query` to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function pe(t, n) {
-    return t = h(t), n = h(n), t instanceof he && n instanceof he && (t.firestore === n.firestore && dn(t._query, n._query) && t.converter === n.converter);
+ */ function _e(t, n) {
+    return t = h(t), n = h(n), t instanceof fe && n instanceof fe && (t.firestore === n.firestore && mn(t._query, n._query) && t.converter === n.converter);
 }
 
 /**
@@ -3638,7 +3652,7 @@ function we(t, n, ...e) {
  *
  * 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 ye {
+ */ class ge {
     /**
      * 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.
@@ -3646,8 +3660,8 @@ function we(t, n, ...e) {
      * @param fieldNames - A list of field names.
      */
     constructor(...t) {
-        for (let n = 0; n < t.length; ++n) if (0 === t[n].length) throw new U(A, "Invalid field name at argument $(i + 1). Field names must not be empty.");
-        this._internalPath = new Z(t);
+        for (let n = 0; n < t.length; ++n) if (0 === t[n].length) throw new k(A, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        this._internalPath = new tt(t);
     }
     /**
      * Returns true if this `FieldPath` is equal to the provided one.
@@ -3662,8 +3676,8 @@ function we(t, n, ...e) {
 /**
  * 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 _e() {
-    return new ye("__name__");
+ */ function ve() {
+    return new ge("__name__");
 }
 
 /**
@@ -3684,7 +3698,7 @@ function we(t, n, ...e) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class ge {
+ */ class be {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -3696,9 +3710,9 @@ function we(t, n, ...e) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new ge(It.fromBase64String(t));
+            return new be(At.fromBase64String(t));
         } catch (t) {
-            throw new U(A, "Failed to construct data from Base64 string: " + t);
+            throw new k(A, "Failed to construct data from Base64 string: " + t);
         }
     }
     /**
@@ -3706,7 +3720,7 @@ function we(t, n, ...e) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new ge(It.fromUint8Array(t));
+        return new be(At.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3758,7 +3772,7 @@ function we(t, n, ...e) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class ve {
+ */ class Ee {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -3790,7 +3804,7 @@ function we(t, n, ...e) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ class be {
+ */ class Te {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3798,8 +3812,8 @@ function we(t, n, ...e) {
      * @param longitude - The longitude as number between -180 and 180.
      */
     constructor(t, n) {
-        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(n) || n < -180 || n > 180) throw new U(A, "Longitude must be a number between -180 and 180, but was: " + n);
+        if (!isFinite(t) || t < -90 || t > 90) throw new k(A, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(n) || n < -180 || n > 180) throw new k(A, "Longitude must be a number between -180 and 180, but was: " + n);
         this._lat = t, this._long = n;
     }
     /**
@@ -3830,7 +3844,7 @@ function we(t, n, ...e) {
      * Actually private to JS consumers of our API, so this function is prefixed
      * with an underscore.
      */    _compareTo(t) {
-        return mt(this._lat, t._lat) || mt(this._long, t._long);
+        return yt(this._lat, t._lat) || yt(this._long, t._long);
     }
 }
 
@@ -3849,29 +3863,29 @@ function we(t, n, ...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 Ee = /^__.*__$/;
+ */ const Ie = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class Ie {
+/** The result of parsing document data (e.g. for a setData call). */ class Ae {
     constructor(t, n, e) {
         this.data = t, this.fieldMask = n, this.fieldTransforms = e;
     }
     toMutation(t, n) {
-        return null !== this.fieldMask ? new Tn(t, this.data, this.fieldMask, n, this.fieldTransforms) : new In(t, this.data, n, this.fieldTransforms);
+        return null !== this.fieldMask ? new Pn(t, this.data, this.fieldMask, n, this.fieldTransforms) : new An(t, this.data, n, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class Te {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class Pe {
     constructor(t, 
     // The fieldMask does not include document transforms.
     n, e) {
         this.data = t, this.fieldMask = n, this.fieldTransforms = e;
     }
     toMutation(t, n) {
-        return new Tn(t, this.data, this.fieldMask, n, this.fieldTransforms);
+        return new Pn(t, this.data, this.fieldMask, n, this.fieldTransforms);
     }
 }
 
-function Ae(t) {
+function Re(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3889,7 +3903,7 @@ function Ae(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class Pe {
+/** A "context" object passed around while parsing user data. */ class Ve {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3909,7 +3923,7 @@ function Ae(t) {
      * compromised).
      */
     constructor(t, n, e, r, s, i) {
-        this.settings = t, this.databaseId = n, this.S = e, this.ignoreUndefinedProperties = r, 
+        this.settings = t, this.databaseId = n, this.q = e, this.ignoreUndefinedProperties = r, 
         // Minor hack: If fieldTransforms is undefined, we assume this is an
         // external call and we need to validate the entire path.
         void 0 === s && this.Z(), this.fieldTransforms = s || [], this.fieldMask = i || [];
@@ -3917,38 +3931,38 @@ function Ae(t) {
     get path() {
         return this.settings.path;
     }
-    get X() {
-        return this.settings.X;
+    get tt() {
+        return this.settings.tt;
     }
-    /** Returns a new context with the specified settings overwritten. */    tt(t) {
-        return new Pe(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.S, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+    /** Returns a new context with the specified settings overwritten. */    nt(t) {
+        return new Ve(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
-    nt(t) {
+    et(t) {
         var n;
-        const e = null === (n = this.path) || void 0 === n ? void 0 : n.child(t), r = this.tt({
+        const e = null === (n = this.path) || void 0 === n ? void 0 : n.child(t), r = this.nt({
             path: e,
-            et: !1
+            rt: !1
         });
-        return r.rt(t), r;
+        return r.st(t), r;
     }
-    st(t) {
+    it(t) {
         var n;
-        const e = null === (n = this.path) || void 0 === n ? void 0 : n.child(t), r = this.tt({
+        const e = null === (n = this.path) || void 0 === n ? void 0 : n.child(t), r = this.nt({
             path: e,
-            et: !1
+            rt: !1
         });
         return r.Z(), r;
     }
-    it(t) {
+    ot(t) {
         // TODO(b/34871131): We don't support array paths right now; so make path
         // undefined.
-        return this.tt({
+        return this.nt({
             path: void 0,
-            et: !0
+            rt: !0
         });
     }
-    ot(t) {
-        return We(t, this.settings.methodName, this.settings.ut || !1, this.path, this.settings.ct);
+    ut(t) {
+        return Ye(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
     }
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */    contains(t) {
         return void 0 !== this.fieldMask.find((n => t.isPrefixOf(n))) || void 0 !== this.fieldTransforms.find((n => t.isPrefixOf(n.field)));
@@ -3956,64 +3970,64 @@ function Ae(t) {
     Z() {
         // TODO(b/34871131): Remove null check once we have proper paths for fields
         // within arrays.
-        if (this.path) for (let t = 0; t < this.path.length; t++) this.rt(this.path.get(t));
+        if (this.path) for (let t = 0; t < this.path.length; t++) this.st(this.path.get(t));
     }
-    rt(t) {
-        if (0 === t.length) throw this.ot("Document fields must not be empty");
-        if (Ae(this.X) && Ee.test(t)) throw this.ot('Document fields cannot begin and end with "__"');
+    st(t) {
+        if (0 === t.length) throw this.ut("Document fields must not be empty");
+        if (Re(this.tt) && Ie.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 Re {
+ */ class Ne {
     constructor(t, n, e) {
-        this.databaseId = t, this.ignoreUndefinedProperties = n, this.S = e || Yn(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = n, this.q = e || Jn(t);
     }
-    /** Creates a new top-level parse context. */    at(t, n, e, r = !1) {
-        return new Pe({
-            X: t,
+    /** Creates a new top-level parse context. */    ht(t, n, e, r = !1) {
+        return new Ve({
+            tt: t,
             methodName: n,
-            ct: e,
-            path: Z.emptyPath(),
-            et: !1,
-            ut: r
-        }, this.databaseId, this.S, this.ignoreUndefinedProperties);
+            at: e,
+            path: tt.emptyPath(),
+            rt: !1,
+            ct: r
+        }, this.databaseId, this.q, this.ignoreUndefinedProperties);
     }
 }
 
-function Ve(t) {
-    const n = t._freezeSettings(), e = Yn(t._databaseId);
-    return new Re(t._databaseId, !!n.ignoreUndefinedProperties, e);
+function De(t) {
+    const n = t._freezeSettings(), e = Jn(t._databaseId);
+    return new Ne(t._databaseId, !!n.ignoreUndefinedProperties, e);
 }
 
-/** Parse document data from a set() call. */ function Ne(t, n, e, r, s, i = {}) {
-    const o = t.at(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , n, e, s);
-    Me("Data must be an object, but it was:", o, r);
-    const u = je(r, o);
+/** Parse document data from a set() call. */ function $e(t, n, e, r, s, i = {}) {
+    const o = t.ht(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , n, e, s);
+    ze("Data must be an object, but it was:", o, r);
+    const u = Me(r, o);
     let c, a;
-    if (i.merge) c = new bt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
+    if (i.merge) c = new Tt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
         const t = [];
         for (const r of i.mergeFields) {
-            const s = Be(n, r, e);
-            if (!o.contains(s)) throw new U(A, `Field '${s}' is specified in your field mask but missing from your input data.`);
-            Ge(t, s) || t.push(s);
+            const s = Qe(n, r, e);
+            if (!o.contains(s)) throw new k(A, `Field '${s}' is specified in your field mask but missing from your input data.`);
+            He(t, s) || t.push(s);
         }
-        c = new bt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
+        c = new Tt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
     } else c = null, a = o.fieldTransforms;
-    return new Ie(new Mt(u), c, a);
+    return new Ae(new zt(u), c, a);
 }
 
-class De extends ve {
+class Fe extends Ee {
     _toFieldTransform(t) {
-        if (2 /* MergeSet */ !== t.X) throw 1 /* Update */ === t.X ? t.ot(`${this._methodName}() can only appear at the top level of your update data`) : t.ot(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
+        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
         // fieldMask so it gets deleted.
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof De;
+        return t instanceof Fe;
     }
 }
 
@@ -4032,32 +4046,32 @@ class De extends ve {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function $e(t, n, e) {
-    return new Pe({
-        X: 3 /* Argument */ ,
-        ct: n.settings.ct,
+ */ function Se(t, n, e) {
+    return new Ve({
+        tt: 3 /* Argument */ ,
+        at: n.settings.at,
         methodName: t._methodName,
-        et: e
-    }, n.databaseId, n.S, n.ignoreUndefinedProperties);
+        rt: e
+    }, n.databaseId, n.q, n.ignoreUndefinedProperties);
 }
 
-class Fe extends ve {
+class qe extends Ee {
     _toFieldTransform(t) {
-        return new vn(t.path, new pn);
+        return new En(t.path, new _n);
     }
     isEqual(t) {
-        return t instanceof Fe;
+        return t instanceof qe;
     }
 }
 
-class Se extends ve {
+class xe extends Ee {
     constructor(t, n) {
-        super(t), this.ht = n;
+        super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        const n = $e(this, t, 
-        /*array=*/ !0), e = this.ht.map((t => Ue(t, n))), r = new yn(e);
-        return new vn(t.path, r);
+        const n = Se(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => je(t, n))), r = new gn(e);
+        return new En(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4065,14 +4079,14 @@ class Se extends ve {
     }
 }
 
-class qe extends ve {
+class Oe extends Ee {
     constructor(t, n) {
-        super(t), this.ht = n;
+        super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        const n = $e(this, t, 
-        /*array=*/ !0), e = this.ht.map((t => Ue(t, n))), r = new _n(e);
-        return new vn(t.path, r);
+        const n = Se(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => je(t, n))), r = new vn(e);
+        return new En(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4080,13 +4094,13 @@ class qe extends ve {
     }
 }
 
-class xe extends ve {
+class Ce extends Ee {
     constructor(t, n) {
-        super(t), this.lt = n;
+        super(t), this.ft = n;
     }
     _toFieldTransform(t) {
-        const n = new gn(t.S, wn(t.S, this.lt));
-        return new vn(t.path, n);
+        const n = new bn(t.q, pn(t.q, this.ft));
+        return new En(t.path, n);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4094,50 +4108,50 @@ class xe extends ve {
     }
 }
 
-/** Parse update data from an update() call. */ function Oe(t, n, e, r) {
-    const s = t.at(1 /* Update */ , n, e);
-    Me("Data must be an object, but it was:", s, r);
-    const i = [], o = Mt.empty();
-    vt(r, ((t, r) => {
-        const u = ze(n, t, e);
+/** Parse update data from an update() call. */ function Le(t, n, e, r) {
+    const s = t.ht(1 /* Update */ , n, e);
+    ze("Data must be an object, but it was:", s, r);
+    const i = [], o = zt.empty();
+    Et(r, ((t, r) => {
+        const u = We(n, t, e);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = h(r);
-        const c = s.st(u);
-        if (r instanceof De) 
+        const c = s.it(u);
+        if (r instanceof Fe) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = Ue(r, c);
+            const t = je(r, c);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
-    const u = new bt(i);
-    return new Te(o, u, s.fieldTransforms);
+    const u = new Tt(i);
+    return new Pe(o, u, s.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function Ce(t, n, e, r, s, i) {
-    const o = t.at(1 /* Update */ , n, e), u = [ Be(n, r, e) ], c = [ s ];
-    if (i.length % 2 != 0) throw new U(A, `Function ${n}() 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(Be(n, i[t])), c.push(i[t + 1]);
-    const a = [], l = Mt.empty();
+/** Parse update data from a list of field/value arguments. */ function ke(t, n, e, r, s, i) {
+    const o = t.ht(1 /* Update */ , n, e), u = [ Qe(n, r, e) ], c = [ s ];
+    if (i.length % 2 != 0) throw new k(A, `Function ${n}() 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(Qe(n, i[t])), c.push(i[t + 1]);
+    const a = [], 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 (!Ge(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!He(a, u[t])) {
         const n = u[t];
         let e = c[t];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 e = h(e);
-        const r = o.st(n);
-        if (e instanceof De) 
+        const r = o.it(n);
+        if (e instanceof Fe) 
         // Add it to the field mask, but don't add anything to updateData.
         a.push(n); else {
-            const t = Ue(e, r);
+            const t = je(e, r);
             null != t && (a.push(n), l.set(n, t));
         }
     }
-    const f = new bt(a);
-    return new Te(l, f, o.fieldTransforms);
+    const f = new Tt(a);
+    return new Pe(l, f, o.fieldTransforms);
 }
 
 /**
@@ -4146,8 +4160,8 @@ class xe extends ve {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function Le(t, n, e, r = !1) {
-    return Ue(e, t.at(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
+ */ function Ue(t, n, e, r = !1) {
+    return je(e, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
 }
 
 /**
@@ -4158,12 +4172,12 @@ class xe extends ve {
  * 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 Ue(t, n) {
-    if (ke(
+ */ function je(t, n) {
+    if (Be(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = h(t))) return Me("Unsupported field value:", n, t), je(t, n);
-    if (t instanceof ve) 
+    t = h(t))) return ze("Unsupported field value:", n, t), Me(t, n);
+    if (t instanceof Ee) 
     // FieldValues usually parse into transforms (except FieldValue.delete())
     // 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
@@ -4175,8 +4189,8 @@ class xe extends ve {
  */
     return function(t, n) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Ae(n.X)) throw n.ot(`${t._methodName}() can only be used with update() and set()`);
-        if (!n.path) throw n.ot(`${t._methodName}() is not currently supported inside arrays`);
+        if (!Re(n.tt)) throw n.ut(`${t._methodName}() can only be used with update() and set()`);
+        if (!n.path) throw n.ut(`${t._methodName}() is not currently supported inside arrays`);
         const e = t._toFieldTransform(n);
         e && n.fieldTransforms.push(e);
     }
@@ -4200,12 +4214,12 @@ class xe extends ve {
         // the set of values to be included for the IN query) that may directly
         // contain additional arrays (each representing an individual field
         // value), so we disable this validation.
-        if (n.settings.et && 4 /* ArrayArgument */ !== n.X) throw n.ot("Nested arrays are not supported");
+        if (n.settings.rt && 4 /* ArrayArgument */ !== n.tt) throw n.ut("Nested arrays are not supported");
         return function(t, n) {
             const e = [];
             let r = 0;
             for (const s of t) {
-                let t = Ue(s, n.it(r));
+                let t = je(s, n.ot(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4224,7 +4238,7 @@ class xe extends ve {
         if (null === (t = h(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return wn(n.S, t);
+        if ("number" == typeof t) return pn(n.q, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4232,37 +4246,37 @@ class xe extends ve {
             stringValue: t
         };
         if (t instanceof Date) {
-            const e = yt.fromDate(t);
+            const e = gt.fromDate(t);
             return {
-                timestampValue: Dn(n.S, e)
+                timestampValue: Fn(n.q, e)
             };
         }
-        if (t instanceof yt) {
+        if (t instanceof gt) {
             // Firestore backend truncates precision down to microseconds. To ensure
             // offline mode works the same with regards to truncation, perform the
             // truncation immediately without waiting for the backend to do that.
-            const e = new yt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            const e = new gt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Dn(n.S, e)
+                timestampValue: Fn(n.q, e)
             };
         }
-        if (t instanceof be) return {
+        if (t instanceof Te) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof ge) return {
-            bytesValue: $n(n.S, t._byteString)
+        if (t instanceof be) return {
+            bytesValue: Sn(n.q, t._byteString)
         };
-        if (t instanceof ae) {
+        if (t instanceof le) {
             const e = n.databaseId, r = t.firestore._databaseId;
-            if (!r.isEqual(e)) throw n.ot(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${e.projectId}/${e.database}`);
+            if (!r.isEqual(e)) throw n.ut(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${e.projectId}/${e.database}`);
             return {
-                referenceValue: qn(t.firestore._databaseId || n.databaseId, t._key.path)
+                referenceValue: On(t.firestore._databaseId || n.databaseId, t._key.path)
             };
         }
-        throw n.ot(`Unsupported field value: ${rt(t)}`);
+        throw n.ut(`Unsupported field value: ${it(t)}`);
     }
     /**
  * Checks whether an object looks like a JSON object that should be converted
@@ -4273,13 +4287,13 @@ class xe extends ve {
  */ (t, n);
 }
 
-function je(t, n) {
+function Me(t, n) {
     const e = {};
     return !function(t) {
         for (const n in t) if (Object.prototype.hasOwnProperty.call(t, n)) return !1;
         return !0;
-    }(t) ? vt(t, ((t, r) => {
-        const s = Ue(r, n.nt(t));
+    }(t) ? Et(t, ((t, r) => {
+        const s = je(r, n.et(t));
         null != s && (e[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -4291,35 +4305,35 @@ function je(t, n) {
     };
 }
 
-function ke(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof yt || t instanceof be || t instanceof ge || t instanceof ae || t instanceof ve);
+function Be(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof gt || t instanceof Te || t instanceof be || t instanceof le || t instanceof Ee);
 }
 
-function Me(t, n, e) {
-    if (!ke(e) || !function(t) {
+function ze(t, n, e) {
+    if (!Be(e) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(e)) {
-        const r = rt(e);
-        throw "an object" === r ? n.ot(t + " a custom object") : n.ot(t + " " + r);
+        const r = it(e);
+        throw "an object" === r ? n.ut(t + " a custom object") : n.ut(t + " " + r);
     }
 }
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function Be(t, n, e) {
+ */ function Qe(t, n, e) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    n = h(n)) instanceof ye) return n._internalPath;
-    if ("string" == typeof n) return ze(t, n);
-    throw We("Field path arguments must be of type string or FieldPath.", t, 
+    n = h(n)) instanceof ge) return n._internalPath;
+    if ("string" == typeof n) return We(t, n);
+    throw Ye("Field path arguments must be of type string or FieldPath.", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, e);
 }
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ const Qe = new RegExp("[~\\*/\\[\\]]");
+ */ const Ge = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4329,29 +4343,29 @@ function Me(t, n, e) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function ze(t, n, e) {
-    if (n.search(Qe) >= 0) throw We(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function We(t, n, e) {
+    if (n.search(Ge) >= 0) throw Ye(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, e);
     try {
-        return new ye(...n.split("."))._internalPath;
+        return new ge(...n.split("."))._internalPath;
     } catch (r) {
-        throw We(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw Ye(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, e);
     }
 }
 
-function We(t, n, e, r, s) {
+function Ye(t, n, e, r, s) {
     const i = r && !r.isEmpty(), o = void 0 !== s;
     let u = `Function ${n}() called with invalid data`;
     e && (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);
+    c += ")"), new k(A, u + t + c);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Ge(t, n) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function He(t, n) {
     return t.some((t => t.isEqual(n)));
 }
 
@@ -4379,7 +4393,7 @@ function We(t, n, e, 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 He {
+ */ class Ke {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4395,7 +4409,7 @@ function We(t, n, e, r, s) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new ae(this._firestore, this._converter, this._key);
+        return new le(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -4415,7 +4429,7 @@ function We(t, n, e, 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 Ye(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new Je(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4435,7 +4449,7 @@ function We(t, n, e, r, s) {
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     get(t) {
         if (this._document) {
-            const n = this._document.data.field(Ze("DocumentSnapshot.get", t));
+            const n = this._document.data.field(tr("DocumentSnapshot.get", t));
             if (null !== n) return this._userDataWriter.convertValue(n);
         }
     }
@@ -4451,7 +4465,7 @@ function We(t, n, e, r, s) {
  * `DocumentSnapshot`. Since query results contain only existing documents, the
  * `exists` property will always be true and `data()` will never return
  * 'undefined'.
- */ class Ye extends He {
+ */ class Je extends Ke {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -4469,7 +4483,7 @@ function We(t, n, e, 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 Ke {
+ */ class Xe {
     /** @hideconstructor */
     constructor(t, n) {
         this._docs = n, this.query = t;
@@ -4500,14 +4514,14 @@ function We(t, n, e, r, s) {
  * @param left - A snapshot to compare.
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
- */ function Je(t, n) {
-    return t = h(t), n = h(n), t instanceof He && n instanceof He ? t._firestore === n._firestore && t._key.isEqual(n._key) && (null === t._document ? null === n._document : t._document.isEqual(n._document)) && t._converter === n._converter : t instanceof Ke && n instanceof Ke && (pe(t.query, n.query) && pt(t.docs, n.docs, Je));
+ */ function Ze(t, n) {
+    return t = h(t), n = h(n), t instanceof Ke && n instanceof Ke ? t._firestore === n._firestore && t._key.isEqual(n._key) && (null === t._document ? null === n._document : t._document.isEqual(n._document)) && t._converter === n._converter : t instanceof Xe && n instanceof Xe && (_e(t.query, n.query) && _t(t.docs, n.docs, Ze));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function Ze(t, n) {
-    return "string" == typeof n ? ze(t, n) : n instanceof ye ? n._internalPath : n._delegate._internalPath;
+ */ function tr(t, n) {
+    return "string" == typeof n ? We(t, n) : n instanceof ge ? n._internalPath : n._delegate._internalPath;
 }
 
 /**
@@ -4534,7 +4548,7 @@ function We(t, n, e, r, s) {
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
  */
-class Xe {}
+class nr {}
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4544,40 +4558,40 @@ class Xe {}
  * @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 tr(t, ...n) {
+ */ function er(t, ...n) {
     for (const e of n) t = e._apply(t);
     return t;
 }
 
-class nr extends Xe {
+class rr extends nr {
     constructor(t, n, e) {
-        super(), this.ft = t, this.dt = n, this.wt = e, this.type = "where";
+        super(), this.dt = t, this.wt = n, this.yt = e, this.type = "where";
     }
     _apply(t) {
-        const n = Ve(t.firestore), e = function(t, n, e, r, s, i, o) {
+        const n = De(t.firestore), e = function(t, n, e, 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 FieldPath.documentId().`);
+                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new k(A, `Invalid Query. You can't perform '${i}' queries on FieldPath.documentId().`);
                 if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
-                    pr(o, i);
+                    _r(o, i);
                     const n = [];
-                    for (const e of o) n.push(mr(r, t, e));
+                    for (const e of o) n.push(yr(r, t, e));
                     u = {
                         arrayValue: {
                             values: n
                         }
                     };
-                } 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 = Le(e, n, o, 
+                } else u = yr(r, t, o);
+            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || _r(o, i), 
+            u = Ue(e, n, o, 
             /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
-            const c = Wt.create(s, i, u);
+            const c = Yt.create(s, i, u);
             return function(t, n) {
-                if (n.N()) {
-                    const e = an(t);
-                    if (null !== e && !e.isEqual(n.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 '${e.toString()}' and '${n.field.toString()}'`);
-                    const r = cn(t);
-                    null !== r && yr(t, n.field, r);
+                if (n.D()) {
+                    const e = ln(t);
+                    if (null !== e && !e.isEqual(n.field)) throw new k(A, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${e.toString()}' and '${n.field.toString()}'`);
+                    const r = hn(t);
+                    null !== r && gr(t, n.field, r);
                 }
                 const e = function(t, n) {
                     for (const e of t.filters) if (n.indexOf(e.op) >= 0) return e.op;
@@ -4618,12 +4632,12 @@ class nr extends Xe {
                 }(n.op));
                 if (null !== e) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
-                throw e === n.op ? new U(A, `Invalid query. You cannot use more than one '${n.op.toString()}' filter.`) : new U(A, `Invalid query. You cannot use '${n.op.toString()}' filters with '${e.toString()}' filters.`);
+                throw e === n.op ? new k(A, `Invalid query. You cannot use more than one '${n.op.toString()}' filter.`) : new k(A, `Invalid query. You cannot use '${n.op.toString()}' filters with '${e.toString()}' filters.`);
             }(t, c), c;
-        }(t._query, "where", n, t.firestore._databaseId, this.ft, this.dt, this.wt);
-        return new he(t.firestore, t.converter, function(t, n) {
+        }(t._query, "where", n, t.firestore._databaseId, this.dt, this.wt, this.yt);
+        return new fe(t.firestore, t.converter, function(t, n) {
             const e = t.filters.concat([ n ]);
-            return new on(t.path, t.collectionGroup, t.explicitOrderBy.slice(), e, t.limit, t.limitType, t.startAt, t.endAt);
+            return new cn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), e, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }
 }
@@ -4638,25 +4652,25 @@ class nr extends Xe {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function er(t, n, e) {
-    const r = n, s = Ze("where", t);
-    return new nr(s, r, e);
+ */ function sr(t, n, e) {
+    const r = n, s = tr("where", t);
+    return new rr(s, r, e);
 }
 
-class rr extends Xe {
+class ir extends nr {
     constructor(t, n) {
-        super(), this.ft = t, this.yt = n, this.type = "orderBy";
+        super(), this.dt = t, this._t = n, this.type = "orderBy";
     }
     _apply(t) {
         const n = function(t, n, e) {
-            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 en(n, e);
+            if (null !== t.startAt) throw new k(A, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new k(A, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            const r = new sn(n, e);
             return function(t, n) {
-                if (null === cn(t)) {
+                if (null === hn(t)) {
                     // This is the first order by. It must match any inequality.
-                    const e = an(t);
-                    null !== e && yr(t, e, n.field);
+                    const e = ln(t);
+                    null !== e && gr(t, e, n.field);
                 }
             }(t, r), r;
         }
@@ -4670,11 +4684,11 @@ class rr extends Xe {
  * Will throw if the document does not contain all fields of the order by
  * of the query or if any of the fields in the order by are an uncommitted
  * server timestamp.
- */ (t._query, this.ft, this.yt);
-        return new he(t.firestore, t.converter, function(t, n) {
+ */ (t._query, this.dt, this._t);
+        return new fe(t.firestore, t.converter, function(t, n) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             const e = t.explicitOrderBy.concat([ n ]);
-            return new on(t.path, t.collectionGroup, e, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new cn(t.path, t.collectionGroup, e, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }
 }
@@ -4687,19 +4701,19 @@ class rr extends Xe {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function sr(t, n = "asc") {
-    const e = n, r = Ze("orderBy", t);
-    return new rr(r, e);
+ */ function or(t, n = "asc") {
+    const e = n, r = tr("orderBy", t);
+    return new ir(r, e);
 }
 
-class ir extends Xe {
+class ur extends nr {
     constructor(t, n, e) {
-        super(), this.type = t, this._t = n, this.gt = e;
+        super(), this.type = t, this.gt = n, this.vt = e;
     }
     _apply(t) {
-        return new he(t.firestore, t.converter, function(t, n, e) {
-            return new on(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), n, e, t.startAt, t.endAt);
-        }(t._query, this._t, this.gt));
+        return new fe(t.firestore, t.converter, function(t, n, e) {
+            return new cn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), n, e, t.startAt, t.endAt);
+        }(t._query, this.gt, this.vt));
     }
 }
 
@@ -4708,8 +4722,8 @@ class ir extends Xe {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function or(t) {
-    return it("limit", t), new ir("limit", t, "F" /* First */);
+ */ function cr(t) {
+    return ut("limit", t), new ur("limit", t, "F" /* First */);
 }
 
 /**
@@ -4720,54 +4734,54 @@ class ir extends Xe {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function ur(t) {
-    return it("limitToLast", t), new ir("limitToLast", t, "L" /* Last */);
+ */ function ar(t) {
+    return ut("limitToLast", t), new ur("limitToLast", t, "L" /* Last */);
 }
 
-class cr extends Xe {
+class hr extends nr {
     constructor(t, n, e) {
-        super(), this.type = t, this.vt = n, this.bt = e;
+        super(), this.type = t, this.bt = n, this.Et = e;
     }
     _apply(t) {
-        const n = wr(t, this.type, this.vt, this.bt);
-        return new he(t.firestore, t.converter, function(t, n) {
-            return new on(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, n, t.endAt);
+        const n = pr(t, this.type, this.bt, this.Et);
+        return new fe(t.firestore, t.converter, function(t, n) {
+            return new cn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, n, t.endAt);
         }(t._query, n));
     }
 }
 
-function ar(...t) {
-    return new cr("startAt", t, /*before=*/ !0);
+function lr(...t) {
+    return new hr("startAt", t, /*before=*/ !0);
 }
 
-function hr(...t) {
-    return new cr("startAfter", t, 
+function fr(...t) {
+    return new hr("startAfter", t, 
     /*before=*/ !1);
 }
 
-class lr extends Xe {
+class dr extends nr {
     constructor(t, n, e) {
-        super(), this.type = t, this.vt = n, this.bt = e;
+        super(), this.type = t, this.bt = n, this.Et = e;
     }
     _apply(t) {
-        const n = wr(t, this.type, this.vt, this.bt);
-        return new he(t.firestore, t.converter, function(t, n) {
-            return new on(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, n);
+        const n = pr(t, this.type, this.bt, this.Et);
+        return new fe(t.firestore, t.converter, function(t, n) {
+            return new cn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, n);
         }(t._query, n));
     }
 }
 
-function fr(...t) {
-    return new lr("endBefore", t, /*before=*/ !0);
+function wr(...t) {
+    return new dr("endBefore", t, /*before=*/ !0);
 }
 
-function dr(...t) {
-    return new lr("endAt", t, /*before=*/ !1);
+function mr(...t) {
+    return new dr("endAt", t, /*before=*/ !1);
 }
 
-/** Helper function to create a bound from a document or fields */ function wr(t, n, e, r) {
-    if (e[0] = h(e[0]), e[0] instanceof He) return function(t, n, e, r, s) {
-        if (!r) throw new U(R, `Can't use a DocumentSnapshot that doesn't exist for ${e}().`);
+/** Helper function to create a bound from a document or fields */ function pr(t, n, e, r) {
+    if (e[0] = h(e[0]), e[0] instanceof Ke) return function(t, n, e, r, s) {
+        if (!r) throw new k(R, `Can't use a DocumentSnapshot that doesn't exist for ${e}().`);
         const i = [];
         // Because people expect to continue/end a query at the exact document
         // provided, we need to use the implicit sort order rather than the explicit
@@ -4776,42 +4790,42 @@ function dr(...t) {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-                for (const e of ln(t)) if (e.field.isKeyField()) i.push(Ot(n, r.key)); else {
+                for (const e of dn(t)) if (e.field.isKeyField()) i.push(Lt(n, r.key)); else {
             const t = r.data.field(e.field);
-            if (Vt(t)) throw new U(A, 'Invalid query. You are trying to start or end a query using a document for which the field "' + e.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 k(A, 'Invalid query. You are trying to start or end a query using a document for which the field "' + e.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 = e.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 k(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.`);
             }
             i.push(t);
         }
-        return new nn(i, s);
+        return new rn(i, s);
     }
     /**
  * Converts a list of field values to a `Bound` for the given query.
  */ (t._query, t.firestore._databaseId, n, e[0]._document, r);
     {
-        const s = Ve(t.firestore);
+        const s = De(t.firestore);
         return function(t, n, e, 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 k(A, `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];
                 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 (!hn(t) && -1 !== c.indexOf("/")) throw new U(A, `Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
-                    const e = t.path.child(K.fromString(c));
-                    if (!X.isDocumentKey(e)) throw new U(A, `Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to ${r}() must result in a valid document path, but '${e}' is not because it contains an odd number of segments.`);
-                    const s = new X(e);
-                    u.push(Ot(n, s));
+                    if ("string" != typeof c) throw new k(A, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
+                    if (!fn(t) && -1 !== c.indexOf("/")) throw new k(A, `Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
+                    const e = t.path.child(X.fromString(c));
+                    if (!nt.isDocumentKey(e)) throw new k(A, `Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to ${r}() must result in a valid document path, but '${e}' is not because it contains an odd number of segments.`);
+                    const s = new nt(e);
+                    u.push(Lt(n, s));
                 } else {
-                    const t = Le(e, r, c);
+                    const t = Ue(e, r, c);
                     u.push(t);
                 }
             }
-            return new nn(u, i);
+            return new rn(u, i);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -4821,28 +4835,28 @@ function dr(...t) {
     }
 }
 
-function mr(t, n, e) {
+function yr(t, n, e) {
     if ("string" == typeof (e = h(e))) {
-        if ("" === e) throw new U(A, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!hn(n) && -1 !== e.indexOf("/")) throw new U(A, `Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '${e}' contains a '/' character.`);
-        const r = n.path.child(K.fromString(e));
-        if (!X.isDocumentKey(r)) throw new U(A, `Invalid query. When querying a collection group by FieldPath.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 Ot(t, new X(r));
+        if ("" === e) throw new k(A, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!fn(n) && -1 !== e.indexOf("/")) throw new k(A, `Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '${e}' contains a '/' character.`);
+        const r = n.path.child(X.fromString(e));
+        if (!nt.isDocumentKey(r)) throw new k(A, `Invalid query. When querying a collection group by FieldPath.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 nt(r));
     }
-    if (e instanceof ae) return Ot(t, e._key);
-    throw new U(A, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${rt(e)}.`);
+    if (e instanceof le) return Lt(t, e._key);
+    throw new k(A, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${it(e)}.`);
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function pr(t, n) {
-    if (!Array.isArray(t) || 0 === t.length) throw new U(A, `Invalid Query. A non-empty array is required for '${n.toString()}' filters.`);
-    if (t.length > 10) throw new U(A, `Invalid Query. '${n.toString()}' filters support a maximum of 10 elements in the value array.`);
+ */ function _r(t, n) {
+    if (!Array.isArray(t) || 0 === t.length) throw new k(A, `Invalid Query. A non-empty array is required for '${n.toString()}' filters.`);
+    if (t.length > 10) throw new k(A, `Invalid Query. '${n.toString()}' filters support a maximum of 10 elements in the value array.`);
 }
 
-function yr(t, n, e) {
-    if (!e.isEqual(n)) throw new U(A, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${n.toString()}' and so you must also use '${n.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${e.toString()}' instead.`);
+function gr(t, n, e) {
+    if (!e.isEqual(n)) throw new k(A, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${n.toString()}' and so you must also use '${n.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${e.toString()}' instead.`);
 }
 
 /**
@@ -4892,7 +4906,7 @@ function yr(t, n, e) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function _r(t, n, e) {
+function vr(t, n, e) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -4901,9 +4915,9 @@ function _r(t, n, e) {
     r;
 }
 
-class gr extends class {
+class br extends class {
     convertValue(t, n = "none") {
-        switch ($t(t)) {
+        switch (St(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -4911,7 +4925,7 @@ class gr extends class {
             return t.booleanValue;
 
           case 2 /* NumberValue */ :
-            return Pt(t.integerValue || t.doubleValue);
+            return Vt(t.integerValue || t.doubleValue);
 
           case 3 /* TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -4923,7 +4937,7 @@ class gr extends class {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(Rt(t.bytesValue));
+            return this.convertBytes(Nt(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -4943,12 +4957,12 @@ class gr extends class {
     }
     convertObject(t, n) {
         const e = {};
-        return vt(t.fields, ((t, r) => {
+        return Et(t.fields, ((t, r) => {
             e[t] = this.convertValue(r, n);
         })), e;
     }
     convertGeoPoint(t) {
-        return new be(Pt(t.latitude), Pt(t.longitude));
+        return new Te(Vt(t.latitude), Vt(t.longitude));
     }
     convertArray(t, n) {
         return (t.values || []).map((t => this.convertValue(t, n)));
@@ -4956,24 +4970,24 @@ class gr extends class {
     convertServerTimestamp(t, n) {
         switch (n) {
           case "previous":
-            const e = Nt(t);
+            const e = $t(t);
             return null == e ? null : this.convertValue(e, n);
 
           case "estimate":
-            return this.convertTimestamp(Dt(t));
+            return this.convertTimestamp(Ft(t));
 
           default:
             return null;
         }
     }
     convertTimestamp(t) {
-        const n = At(t);
-        return new yt(n.seconds, n.nanos);
+        const n = Rt(t);
+        return new gt(n.seconds, n.nanos);
     }
     convertDocumentKey(t, n) {
-        const e = K.fromString(t);
-        v(Hn(e));
-        const r = new H(e.get(1), e.get(3)), s = new X(e.popFirst(5));
+        const e = X.fromString(t);
+        v(Kn(e));
+        const r = new K(e.get(1), e.get(3)), s = new nt(e.popFirst(5));
         return r.isEqual(n) || 
         // TODO(b/64130202): Somehow support foreign references.
         p(`Document ${s} contains a document reference within a different database (${r.projectId}/${r.database}) which is not supported. It will be treated as a reference in the current database (${n.projectId}/${n.database}) instead.`), 
@@ -4984,11 +4998,11 @@ class gr extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new ge(t);
+        return new be(t);
     }
     convertReference(t) {
         const n = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new ae(this.firestore, /* converter= */ null, n);
+        return new le(this.firestore, /* converter= */ null, n);
     }
 }
 
@@ -5004,12 +5018,12 @@ class gr extends class {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function vr(t) {
-    const n = ee((t = st(t, ae)).firestore), e = new gr(t.firestore);
-    return Xn(n, [ t._key ]).then((n => {
+ */ function Er(t) {
+    const n = se((t = ot(t, le)).firestore), e = new br(t.firestore);
+    return ne(n, [ t._key ]).then((n => {
         v(1 === n.length);
         const r = n[0];
-        return new He(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new Ke(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5024,33 +5038,33 @@ class gr extends class {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function br(t) {
+ */ function Tr(t) {
     !function(t) {
-        if (un(t) && 0 === t.explicitOrderBy.length) throw new U(x, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = st(t, he))._query);
-    const n = ee(t.firestore), e = new gr(t.firestore);
-    return te(n, t._query).then((n => {
-        const r = n.map((n => new Ye(t.firestore, e, n.key, n, t.converter)));
-        return un(t._query) && 
+        if (an(t) && 0 === t.explicitOrderBy.length) throw new k(x, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = ot(t, fe))._query);
+    const n = se(t.firestore), e = new br(t.firestore);
+    return ee(n, t._query).then((n => {
+        const r = n.map((n => new Je(t.firestore, e, n.key, n, t.converter)));
+        return an(t._query) && 
         // 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 Ke(t, r);
+        r.reverse(), new Xe(t, r);
     }));
 }
 
-function Er(t, n, e) {
-    const r = _r((t = st(t, ae)).converter, n, e), s = Ne(Ve(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
-    return Zn(ee(t.firestore), [ s.toMutation(t._key, bn.none()) ]);
+function Ir(t, n, e) {
+    const r = vr((t = ot(t, le)).converter, n, e), s = $e(De(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
+    return te(se(t.firestore), [ s.toMutation(t._key, Tn.none()) ]);
 }
 
-function Ir(t, n, e, ...r) {
-    const s = Ve((t = st(t, ae)).firestore);
+function Ar(t, n, e, ...r) {
+    const s = De((t = ot(t, le)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    i = "string" == typeof (n = h(n)) || n instanceof ye ? Ce(s, "updateDoc", t._key, n, e, r) : Oe(s, "updateDoc", t._key, n);
-    return Zn(ee(t.firestore), [ i.toMutation(t._key, bn.exists(!0)) ]);
+    i = "string" == typeof (n = h(n)) || n instanceof ge ? ke(s, "updateDoc", t._key, n, e, r) : Le(s, "updateDoc", t._key, n);
+    return te(se(t.firestore), [ i.toMutation(t._key, Tn.exists(!0)) ]);
 }
 
 /**
@@ -5064,8 +5078,8 @@ function Ir(t, n, e, ...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 Zn(ee((t = st(t, ae)).firestore), [ new An(t._key, bn.none()) ]);
+ */ function Pr(t) {
+    return te(se((t = ot(t, le)).firestore), [ new Rn(t._key, Tn.none()) ]);
 }
 
 /**
@@ -5081,9 +5095,9 @@ function Ir(t, n, e, ...r) {
  * @param data - An Object containing the data for the new document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function Ar(t, n) {
-    const e = we(t = st(t, le)), r = _r(t.converter, n), s = Ne(Ve(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
-    return Zn(ee(t.firestore), [ s.toMutation(e._key, bn.exists(!1)) ]).then((() => e));
+ */ function Rr(t, n) {
+    const e = pe(t = ot(t, de)), r = vr(t.converter, n), s = $e(De(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
+    return te(se(t.firestore), [ s.toMutation(e._key, Tn.exists(!1)) ]).then((() => e));
 }
 
 /**
@@ -5105,15 +5119,15 @@ function Ir(t, n, e, ...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 Pr() {
-    return new De("deleteField");
+ */ function Vr() {
+    return new Fe("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 Fe("serverTimestamp");
+ */ function Nr() {
+    return new qe("serverTimestamp");
 }
 
 /**
@@ -5127,10 +5141,10 @@ function Ir(t, n, e, ...r) {
  * @param elements - The elements to union into 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 Se("arrayUnion", t);
+    return new xe("arrayUnion", t);
 }
 
 /**
@@ -5143,10 +5157,10 @@ function Ir(t, n, e, ...r) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Nr(...t) {
+ */ function $r(...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 qe("arrayRemove", t);
+    return new Oe("arrayRemove", t);
 }
 
 /**
@@ -5167,8 +5181,8 @@ function Ir(t, n, e, ...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 xe("increment", t);
+ */ function Fr(t) {
+    return new Ce("increment", t);
 }
 
 /**
@@ -5194,25 +5208,25 @@ function Ir(t, n, e, ...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 $r {
+ */ class Sr {
     /** @hideconstructor */
     constructor(t, n) {
         this._firestore = t, this._commitHandler = n, this._mutations = [], this._committed = !1, 
-        this._dataReader = Ve(t);
+        this._dataReader = De(t);
     }
     set(t, n, e) {
         this._verifyNotCommitted();
-        const r = Fr(t, this._firestore), s = _r(r.converter, n, e), i = Ne(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
-        return this._mutations.push(i.toMutation(r._key, bn.none())), this;
+        const r = qr(t, this._firestore), s = vr(r.converter, n, e), i = $e(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
+        return this._mutations.push(i.toMutation(r._key, Tn.none())), this;
     }
     update(t, n, e, ...r) {
         this._verifyNotCommitted();
-        const s = Fr(t, this._firestore);
+        const s = qr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (n = h(n)) || n instanceof ye ? Ce(this._dataReader, "WriteBatch.update", s._key, n, e, r) : Oe(this._dataReader, "WriteBatch.update", s._key, n), 
-        this._mutations.push(i.toMutation(s._key, bn.exists(!0))), this;
+        return i = "string" == typeof (n = h(n)) || n instanceof ge ? ke(this._dataReader, "WriteBatch.update", s._key, n, e, r) : Le(this._dataReader, "WriteBatch.update", s._key, n), 
+        this._mutations.push(i.toMutation(s._key, Tn.exists(!0))), this;
     }
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -5221,8 +5235,8 @@ function Ir(t, n, e, ...r) {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const n = Fr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new An(n._key, bn.none())), this;
+        const n = qr(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Rn(n._key, Tn.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5239,12 +5253,12 @@ function Ir(t, n, e, ...r) {
         return this._verifyNotCommitted(), this._committed = !0, this._mutations.length > 0 ? this._commitHandler(this._mutations) : Promise.resolve();
     }
     _verifyNotCommitted() {
-        if (this._committed) throw new U(F, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new k(F, "A write batch can no longer be used after commit() has been called.");
     }
 }
 
-function Fr(t, n) {
-    if ((t = h(t)).firestore !== n) throw new U(A, "Provided document reference is from a different Firestore instance.");
+function qr(t, n) {
+    if ((t = h(t)).firestore !== n) throw new k(A, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -5260,9 +5274,9 @@ function Fr(t, n) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Sr(t) {
-    const n = ee(t = st(t, se));
-    return new $r(t, (t => Zn(n, t)));
+ */ function xr(t) {
+    const n = se(t = ot(t, oe));
+    return new Sr(t, (t => te(n, t)));
 }
 
 /**
@@ -5284,7 +5298,7 @@ function Fr(t, n) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ class qr {
+ */ class Or {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5303,8 +5317,8 @@ function Fr(t, n) {
         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 n = await Xn(this.datastore, t);
+        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new k(A, "Firestore transactions require all reads to be executed before all writes.");
+        const n = await ne(this.datastore, t);
         return n.forEach((t => this.recordVersion(t))), n;
     }
     set(t, n) {
@@ -5319,7 +5333,7 @@ function Fr(t, n) {
         this.writtenDocs.add(t.toString());
     }
     delete(t) {
-        this.write(new An(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Rn(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }
     async commit() {
         if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
@@ -5331,22 +5345,22 @@ function Fr(t, n) {
         // For each document that was read but not written to, we want to perform
         // a `verify` operation.
         t.forEach(((t, n) => {
-            const e = X.fromPath(n);
-            this.mutations.push(new Pn(e, this.precondition(e)));
-        })), await Zn(this.datastore, this.mutations), this.committed = !0;
+            const e = nt.fromPath(n);
+            this.mutations.push(new Vn(e, this.precondition(e)));
+        })), await te(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let n;
         if (t.isFoundDocument()) n = t.version; else {
             if (!t.isNoDocument()) throw g();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
-            n = _t.min();
+            n = vt.min();
         }
         const e = this.readVersions.get(t.key.toString());
         if (e) {
             if (!n.isEqual(e)) 
             // This transaction will fail no matter what.
-            throw new U(S, "Document version changed between two reads.");
+            throw new k(S, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), n);
     }
     /**
@@ -5354,7 +5368,7 @@ function Fr(t, n) {
      * as a precondition, or no precondition if it was not read.
      */    precondition(t) {
         const n = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && n ? bn.updateTime(n) : bn.none();
+        return !this.writtenDocs.has(t.toString()) && n ? Tn.updateTime(n) : Tn.none();
     }
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5363,7 +5377,7 @@ function Fr(t, n) {
         // The first time a document is written, we want to take into account the
         // read time and existence
                 if (!this.writtenDocs.has(t.toString()) && n) {
-            if (n.isEqual(_t.min())) 
+            if (n.isEqual(vt.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
@@ -5373,13 +5387,13 @@ function Fr(t, n) {
             // 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 k(A, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return bn.updateTime(n);
+                        return Tn.updateTime(n);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-        return bn.exists(!0);
+        return Tn.exists(!0);
     }
     write(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
@@ -5407,43 +5421,43 @@ function Fr(t, n) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class xr {
+class Cr {
     constructor(t, n, e, r) {
         this.asyncQueue = t, this.datastore = n, this.updateFunction = e, this.deferred = r, 
-        this.Et = 5, this.It = new Kn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.Tt = 5, this.It = new Xn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
-        this.Et -= 1, this.Tt();
+        this.Tt -= 1, this.At();
     }
-    Tt() {
+    At() {
         this.It.W((async () => {
-            const t = new qr(this.datastore), n = this.At(t);
+            const t = new Or(this.datastore), n = this.Pt(t);
             n && n.then((n => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(n);
                 })).catch((t => {
-                    this.Pt(t);
+                    this.Rt(t);
                 }))));
             })).catch((t => {
-                this.Pt(t);
+                this.Rt(t);
             }));
         }));
     }
-    At(t) {
+    Pt(t) {
         try {
             const n = this.updateFunction(t);
-            return !ot(n) && n.catch && n.then ? n : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !ct(n) && n.catch && n.then ? n : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
             null);
         } catch (t) {
             // Do not retry errors thrown by user provided updateFunction.
             return this.deferred.reject(t), null;
         }
     }
-    Pt(t) {
-        this.Et > 0 && this.Rt(t) ? (this.Et -= 1, this.asyncQueue.enqueueAndForget((() => (this.Tt(), 
+    Rt(t) {
+        this.Tt > 0 && this.Vt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((() => (this.At(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
-    Rt(t) {
+    Vt(t) {
         if ("FirebaseError" === t.name) {
             // In transactions, the backend will fail outdated reads with FAILED_PRECONDITION and
             // non-matching document versions with ABORTED. These errors should be retried.
@@ -5460,8 +5474,8 @@ class xr {
                   default:
                     return g();
 
-                  case I:
                   case T:
+                  case I:
                   case P:
                   case $:
                   case O:
@@ -5507,7 +5521,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 Or() {
+/** The Platform's 'document' implementation or null if not available. */ function Lr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5539,10 +5553,10 @@ 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 Cr {
+ */ class kr {
     constructor(t, n, e, r, s) {
         this.asyncQueue = t, this.timerId = n, this.targetTimeMs = e, this.op = r, this.removalCallback = s, 
-        this.deferred = new j, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
+        this.deferred = new U, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
         // It's normal for the deferred promise to be canceled (due to cancellation)
         // and so we attach a dummy catch callback to avoid
         // 'UnhandledPromiseRejectionWarning' log spam.
@@ -5562,7 +5576,7 @@ class xr {
      *   PORTING NOTE: This exists to prevent making removeDelayedOperation() and
      *   the DelayedOperation class public.
      */    static createAndSchedule(t, n, e, r, s) {
-        const i = Date.now() + e, o = new Cr(t, n, i, r, s);
+        const i = Date.now() + e, o = new kr(t, n, i, r, s);
         return o.start(e), o;
     }
     /**
@@ -5584,7 +5598,7 @@ class xr {
      * As long as the operation has not yet been run, calling cancel() provides a
      * guarantee that the operation will not be run.
      */    cancel(t) {
-        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new U(I, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new k(T, "Operation cancelled" + (t ? ": " + t : ""))));
     }
     handleDelayElapsed() {
         this.asyncQueue.enqueueAndForget((() => null !== this.timerHandle ? (this.clearTimeout(), 
@@ -5611,42 +5625,42 @@ 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 Lr {
+ */ class Ur {
     constructor() {
         // The last promise in the queue.
-        this.Vt = Promise.resolve(), 
+        this.Nt = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.Nt = [], 
+        this.Dt = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.Dt = !1, 
+        this.$t = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.$t = [], 
+        this.Ft = [], 
         // visible for testing
-        this.Ft = null, 
+        this.St = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.St = !1, 
-        // Enabled during shutdown on Safari to prevent future access to IndexedDB.
         this.qt = !1, 
+        // Enabled during shutdown on Safari to prevent future access to IndexedDB.
+        this.xt = !1, 
         // List of TimerIds to fast-forward delays for.
-        this.xt = [], 
+        this.Ot = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new Kn(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new Xn(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.Ot = () => {
-            const t = Or();
+        this.Ct = () => {
+            const t = Lr();
             t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
         };
-        const t = Or();
-        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ot);
+        const t = Lr();
+        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ct);
     }
     get isShuttingDown() {
-        return this.Dt;
+        return this.$t;
     }
     /**
      * Adds a new operation to the queue without waiting for it to complete (i.e.
@@ -5656,38 +5670,38 @@ class xr {
         this.enqueue(t);
     }
     enqueueAndForgetEvenWhileRestricted(t) {
-        this.Ct(), 
+        this.Lt(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.Lt(t);
+        this.kt(t);
     }
     enterRestrictedMode(t) {
-        if (!this.Dt) {
-            this.Dt = !0, this.qt = t || !1;
-            const n = Or();
-            n && "function" == typeof n.removeEventListener && n.removeEventListener("visibilitychange", this.Ot);
+        if (!this.$t) {
+            this.$t = !0, this.xt = t || !1;
+            const n = Lr();
+            n && "function" == typeof n.removeEventListener && n.removeEventListener("visibilitychange", this.Ct);
         }
     }
     enqueue(t) {
-        if (this.Ct(), this.Dt) 
+        if (this.Lt(), this.$t) 
         // Return a Promise which never resolves.
         return new Promise((() => {}));
         // Create a deferred Promise that we can return to the callee. This
         // allows us to return a "hanging Promise" only to the callee and still
         // advance the queue even when the operation is not run.
-                const n = new j;
-        return this.Lt((() => this.Dt && this.qt ? Promise.resolve() : (t().then(n.resolve, n.reject), 
+                const n = new U;
+        return this.kt((() => this.$t && this.xt ? Promise.resolve() : (t().then(n.resolve, n.reject), 
         n.promise))).then((() => n.promise));
     }
     enqueueRetryable(t) {
-        this.enqueueAndForget((() => (this.Nt.push(t), this.Ut())));
+        this.enqueueAndForget((() => (this.Dt.push(t), this.Ut())));
     }
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
      */    async Ut() {
-        if (0 !== this.Nt.length) {
+        if (0 !== this.Dt.length) {
             try {
-                await this.Nt[0](), this.Nt.shift(), this.It.reset();
+                await this.Dt[0](), this.Dt.shift(), this.It.reset();
             } catch (t) {
                 if (!
                 /**
@@ -5731,7 +5745,7 @@ class xr {
  // Failure will be handled by AsyncQueue
                                 m("AsyncQueue", "Operation failed with retryable error: " + t);
             }
-            this.Nt.length > 0 && 
+            this.Dt.length > 0 && 
             // If there are additional operations, we re-schedule `retryNextOp()`.
             // This is necessary to run retryable operations that failed during
             // their initial attempt since we don't know whether they are already
@@ -5745,9 +5759,9 @@ class xr {
             this.It.W((() => this.Ut()));
         }
     }
-    Lt(t) {
-        const n = this.Vt.then((() => (this.St = !0, t().catch((t => {
-            this.Ft = t, this.St = !1;
+    kt(t) {
+        const n = this.Nt.then((() => (this.qt = !0, t().catch((t => {
+            this.St = t, this.qt = !1;
             const n = 
             /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -5788,38 +5802,38 @@ class xr {
             // all further attempts to chain (via .then) will just short-circuit
             // and return the rejected Promise.
             throw p("INTERNAL UNHANDLED ERROR: ", n), t;
-        })).then((t => (this.St = !1, t))))));
-        return this.Vt = n, n;
+        })).then((t => (this.qt = !1, t))))));
+        return this.Nt = n, n;
     }
     enqueueAfterDelay(t, n, e) {
-        this.Ct(), 
+        this.Lt(), 
         // Fast-forward delays for timerIds that have been overriden.
-        this.xt.indexOf(t) > -1 && (n = 0);
-        const r = Cr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
-        return this.$t.push(r), r;
+        this.Ot.indexOf(t) > -1 && (n = 0);
+        const r = kr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
+        return this.Ft.push(r), r;
     }
-    Ct() {
-        this.Ft && g();
+    Lt() {
+        this.St && g();
     }
     verifyOperationInProgress() {}
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
-     */    async kt() {
+     */    async Mt() {
         // Operations in the queue prior to draining may have enqueued additional
         // operations. Keep draining the queue until the tail is no longer advanced,
         // which indicates that no more new operations were enqueued and that all
         // operations were executed.
         let t;
         do {
-            t = this.Vt, await t;
-        } while (t !== this.Vt);
+            t = this.Nt, await t;
+        } while (t !== this.Nt);
     }
     /**
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
-     */    Mt(t) {
-        for (const n of this.$t) if (n.timerId === t) return !0;
+     */    Bt(t) {
+        for (const n of this.Ft) if (n.timerId === t) return !0;
         return !1;
     }
     /**
@@ -5828,31 +5842,31 @@ class xr {
      * @param lastTimerId - Delayed operations up to and including this TimerId
      * will be drained. Pass TimerId.All to run all delayed operations.
      * @returns a Promise that resolves once all operations have been run.
-     */    Bt(t) {
+     */    zt(t) {
         // Note that draining may generate more delayed ops, so we do that first.
-        return this.kt().then((() => {
+        return this.Mt().then((() => {
             // Run ops in the same order they'd run if they ran naturally.
-            this.$t.sort(((t, n) => t.targetTimeMs - n.targetTimeMs));
-            for (const n of this.$t) if (n.skipDelay(), "all" /* All */ !== t && n.timerId === t) break;
-            return this.kt();
+            this.Ft.sort(((t, n) => t.targetTimeMs - n.targetTimeMs));
+            for (const n of this.Ft) if (n.skipDelay(), "all" /* All */ !== t && n.timerId === t) break;
+            return this.Mt();
         }));
     }
     /**
      * For Tests: Skip all subsequent delays for a timer id.
      */    Qt(t) {
-        this.xt.push(t);
+        this.Ot.push(t);
     }
     /** Called once a DelayedOperation is run or canceled. */    jt(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        const n = this.$t.indexOf(t);
-        this.$t.splice(n, 1);
+        const n = this.Ft.indexOf(t);
+        this.Ft.splice(n, 1);
     }
 }
 
-class Ur {
+class jr {
     /** @hideconstructor */
     constructor(t, n) {
-        this._firestore = t, this._transaction = n, this._dataReader = Ve(t);
+        this._firestore = t, this._transaction = n, this._dataReader = De(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -5860,25 +5874,25 @@ class Ur {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const n = Fr(t, this._firestore), e = new gr(this._firestore);
+        const n = qr(t, this._firestore), e = new br(this._firestore);
         return this._transaction.lookup([ n._key ]).then((t => {
             if (!t || 1 !== t.length) return g();
             const r = t[0];
-            if (r.isFoundDocument()) return new He(this._firestore, e, r.key, r, n.converter);
-            if (r.isNoDocument()) return new He(this._firestore, e, n._key, null, n.converter);
+            if (r.isFoundDocument()) return new Ke(this._firestore, e, r.key, r, n.converter);
+            if (r.isNoDocument()) return new Ke(this._firestore, e, n._key, null, n.converter);
             throw g();
         }));
     }
     set(t, n, e) {
-        const r = Fr(t, this._firestore), s = _r(r.converter, n, e), i = Ne(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, e);
+        const r = qr(t, this._firestore), s = vr(r.converter, n, e), i = $e(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, e);
         return this._transaction.set(r._key, i), this;
     }
     update(t, n, e, ...r) {
-        const s = Fr(t, this._firestore);
+        const s = qr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (n = h(n)) || n instanceof ye ? Ce(this._dataReader, "Transaction.update", s._key, n, e, r) : Oe(this._dataReader, "Transaction.update", s._key, n), 
+        return i = "string" == typeof (n = h(n)) || n instanceof ge ? ke(this._dataReader, "Transaction.update", s._key, n, e, r) : Le(this._dataReader, "Transaction.update", s._key, n), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -5887,7 +5901,7 @@ class Ur {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const n = Fr(t, this._firestore);
+        const n = qr(t, this._firestore);
         return this._transaction.delete(n._key), this;
     }
 }
@@ -5908,9 +5922,9 @@ class Ur {
  * (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 jr(t, n) {
-    const e = ee(t = st(t, se)), r = new j;
-    return new xr(new Lr, e, (e => n(new Ur(t, e))), r).run(), r.promise;
+ */ function Mr(t, n) {
+    const e = se(t = ot(t, oe)), r = new U;
+    return new Cr(new Ur, e, (e => n(new jr(t, e))), r).run(), r.promise;
 }
 
 /**
@@ -5923,11 +5937,11 @@ class Ur {
  */ !function(t) {
     f = t;
 }(`${s}_lite`), e(new i("firestore/lite", ((t, {options: n}) => {
-    const e = t.getProvider("app").getImmediate(), r = new se(e, new Q(t.getProvider("auth-internal")));
+    const e = t.getProvider("app").getImmediate(), r = new oe(e, new z(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
     return n && r._setSettings(n), r;
 }), "PUBLIC" /* PUBLIC */)), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-r("firestore-lite", "3.3.0", "rn"), r("firestore-lite", "3.3.0", "esm2017");
+r("firestore-lite", "3.3.1-canary.086df7c7e", "rn"), r("firestore-lite", "3.3.1-canary.086df7c7e", "esm2017");
 
-export { ge as Bytes, le as CollectionReference, ae as DocumentReference, He as DocumentSnapshot, ye as FieldPath, ve as FieldValue, se as Firestore, U as FirestoreError, be as GeoPoint, he as Query, Xe as QueryConstraint, Ye as QueryDocumentSnapshot, Ke as QuerySnapshot, yt as Timestamp, Ur as Transaction, $r as WriteBatch, Ar as addDoc, Nr as arrayRemove, Vr as arrayUnion, fe as collection, de as collectionGroup, ue as connectFirestoreEmulator, Tr as deleteDoc, Pr as deleteField, we as doc, _e as documentId, dr as endAt, fr as endBefore, vr as getDoc, br as getDocs, oe as getFirestore, Dr as increment, ie as initializeFirestore, or as limit, ur as limitToLast, sr as orderBy, tr as query, pe as queryEqual, me as refEqual, jr as runTransaction, Rr as serverTimestamp, Er as setDoc, w as setLogLevel, Je as snapshotEqual, hr as startAfter, ar as startAt, ce as terminate, Ir as updateDoc, er as where, Sr as writeBatch };
+export { be as Bytes, de as CollectionReference, le as DocumentReference, Ke as DocumentSnapshot, ge as FieldPath, Ee as FieldValue, oe as Firestore, k as FirestoreError, Te as GeoPoint, fe as Query, nr as QueryConstraint, Je as QueryDocumentSnapshot, Xe as QuerySnapshot, gt as Timestamp, jr as Transaction, Sr as WriteBatch, Rr as addDoc, $r as arrayRemove, Dr as arrayUnion, we as collection, me as collectionGroup, ae as connectFirestoreEmulator, Pr as deleteDoc, Vr as deleteField, pe as doc, ve as documentId, mr as endAt, wr as endBefore, Er as getDoc, Tr as getDocs, ce as getFirestore, Fr as increment, ue as initializeFirestore, cr as limit, ar as limitToLast, or as orderBy, er as query, _e as queryEqual, ye as refEqual, Mr as runTransaction, Nr as serverTimestamp, Ir as setDoc, w as setLogLevel, Ze as snapshotEqual, fr as startAfter, lr as startAt, he as terminate, Ar as updateDoc, sr as where, xr as writeBatch };
 //# sourceMappingURL=index.rn.esm2017.js.map