@firebase/firestore 3.4.1 → 3.4.2-202205224240

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

@@ -4,7 +4,7 @@ import { Component as i } from "@firebase/component";
 
 import { Logger as o, LogLevel as u } from "@firebase/logger";
 
-import { base64 as c, createMockUserToken as a, getModularInstance as h } from "@firebase/util";
+import { FirebaseError as c, base64 as a, createMockUserToken as h, getModularInstance as l } from "@firebase/util";
 
 /**
  * @license
@@ -26,7 +26,7 @@ import { base64 as c, createMockUserToken as a, getModularInstance as h } from "
  * Simple wrapper around a nullable UID. Mostly exists to make code more
  * readable.
  */
-class l {
+class f {
     constructor(t) {
         this.uid = t;
     }
@@ -44,11 +44,11 @@ class l {
     }
 }
 
-/** A user with a null UID. */ l.UNAUTHENTICATED = new l(null), 
+/** A user with a null UID. */ f.UNAUTHENTICATED = new f(null), 
 // TODO(mikelehen): Look into getting a proper uid-equivalent for
 // non-FirebaseAuth providers.
-l.GOOGLE_CREDENTIALS = new l("google-credentials-uid"), l.FIRST_PARTY = new l("first-party-uid"), 
-l.MOCK_USER = new l("mock-user");
+f.GOOGLE_CREDENTIALS = new f("google-credentials-uid"), f.FIRST_PARTY = new f("first-party-uid"), 
+f.MOCK_USER = new f("mock-user");
 
 /**
  * @license
@@ -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.6.1";
+let d = "9.6.2-202205224240";
 
 /**
  * @license
@@ -84,7 +84,7 @@ let f = "9.6.1";
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const d = new o("@firebase/firestore");
+const w = new o("@firebase/firestore");
 
 /**
  * Sets the verbosity of Cloud Firestore logs (debug, error, or silent).
@@ -98,36 +98,36 @@ const d = new o("@firebase/firestore");
  *     <li>`error` to log errors only.</li>
  *     <li><code>`silent` to turn off logging.</li>
  *   </ul>
- */ function w(t) {
-    d.setLogLevel(t);
+ */ function m(t) {
+    w.setLogLevel(t);
 }
 
-function m(t, ...n) {
-    if (d.logLevel <= u.DEBUG) {
-        const e = n.map(_);
-        d.debug(`Firestore (${f}): ${t}`, ...e);
+function p(t, ...n) {
+    if (w.logLevel <= u.DEBUG) {
+        const e = n.map(g);
+        w.debug(`Firestore (${d}): ${t}`, ...e);
     }
 }
 
-function p(t, ...n) {
-    if (d.logLevel <= u.ERROR) {
-        const e = n.map(_);
-        d.error(`Firestore (${f}): ${t}`, ...e);
+function y(t, ...n) {
+    if (w.logLevel <= u.ERROR) {
+        const e = n.map(g);
+        w.error(`Firestore (${d}): ${t}`, ...e);
     }
 }
 
 /**
  * @internal
- */ function y(t, ...n) {
-    if (d.logLevel <= u.WARN) {
-        const e = n.map(_);
-        d.warn(`Firestore (${f}): ${t}`, ...e);
+ */ function _(t, ...n) {
+    if (w.logLevel <= u.WARN) {
+        const e = n.map(g);
+        w.warn(`Firestore (${d}): ${t}`, ...e);
     }
 }
 
 /**
  * Converts an additional log parameter to a string representation.
- */ function _(t) {
+ */ function g(t) {
     if ("string" == typeof t) return t;
     try {
         return n = t, JSON.stringify(n);
@@ -178,14 +178,14 @@ function p(t, ...n) {
  * Returns `never` and can be used in expressions:
  * @example
  * let futureVar = fail('not implemented yet');
- */ function g(t = "Unexpected state") {
+ */ function v(t = "Unexpected state") {
     // Log the failure in addition to throw an exception, just in case the
     // exception is swallowed.
-    const n = `FIRESTORE (${f}) INTERNAL ASSERTION FAILED: ` + t;
+    const n = `FIRESTORE (${d}) INTERNAL ASSERTION FAILED: ` + t;
     // NOTE: We don't use FirestoreError here because these are internal failures
     // that cannot be handled by the user. (Also it would create a circular
     // dependency between the error and assert modules which doesn't work.)
-    throw p(n), new Error(n);
+    throw y(n), new Error(n);
 }
 
 /**
@@ -193,14 +193,14 @@ function p(t, ...n) {
  * given message if it did.
  *
  * Messages are stripped in production builds.
- */ function v(t, n) {
-    t || g();
+ */ function b(t, n) {
+    t || v();
 }
 
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function b(t, 
+ */ function E(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 n) {
     return t;
@@ -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", 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";
+ */ const T = "ok", I = "cancelled", A = "unknown", P = "invalid-argument", R = "deadline-exceeded", V = "not-found", N = "already-exists", D = "permission-denied", $ = "unauthenticated", F = "resource-exhausted", S = "failed-precondition", x = "aborted", q = "out-of-range", O = "unimplemented", C = "internal", L = "unavailable", k = "data-loss";
 
-/** An error returned by a Firestore operation. */ class k extends Error {
+/** An error returned by a Firestore operation. */ class U extends c {
     /** @hideconstructor */
     constructor(
     /**
@@ -234,9 +234,7 @@ n) {
      * A custom error description.
      */
     n) {
-        super(n), this.code = t, this.message = n, 
-        /** The custom name for all FirestoreErrors. */
-        this.name = "FirebaseError", 
+        super(t, n), this.code = t, this.message = n, 
         // HACK: We write a toString property directly because Error is not a real
         // class and so inheritance does not work correctly. We could alternatively
         // do the same "back-door inheritance" trick that FirebaseError does.
@@ -259,7 +257,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 U {
+ */ class j {
     constructor() {
         this.promise = new Promise(((t, n) => {
             this.resolve = t, this.reject = n;
@@ -282,7 +280,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 M {
     constructor(t, n) {
         this.user = n, this.type = "OAuth", this.headers = new Map, this.headers.set("Authorization", `Bearer ${t}`);
     }
@@ -291,14 +289,14 @@ n) {
 /**
  * A CredentialsProvider that always yields an empty token.
  * @internal
- */ class M {
+ */ class B {
     getToken() {
         return Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, n) {
         // Fire with initial user.
-        t.enqueueRetryable((() => n(l.UNAUTHENTICATED)));
+        t.enqueueRetryable((() => n(f.UNAUTHENTICATED)));
     }
     shutdown() {}
 }
@@ -306,7 +304,7 @@ n) {
 /**
  * A CredentialsProvider that always returns a constant token. Used for
  * emulator token mocking.
- */ class B {
+ */ class z {
     constructor(t) {
         this.token = t, 
         /**
@@ -330,15 +328,15 @@ n) {
     }
 }
 
-/** Credential provider for the Lite SDK. */ class z {
+/** Credential provider for the Lite SDK. */ class Q {
     constructor(t) {
         this.auth = null, t.onInit((t => {
             this.auth = t;
         }));
     }
     getToken() {
-        return this.auth ? this.auth.getToken().then((t => t ? (v("string" == typeof t.accessToken), 
-        new j(t.accessToken, new l(this.auth.getUid()))) : null)) : Promise.resolve(null);
+        return this.auth ? this.auth.getToken().then((t => t ? (b("string" == typeof t.accessToken), 
+        new M(t.accessToken, new f(this.auth.getUid()))) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, n) {}
@@ -351,9 +349,9 @@ 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 Q {
+ */ class G {
     constructor(t, n, e) {
-        this.type = "FirstParty", this.user = l.FIRST_PARTY, this.headers = new Map, this.headers.set("X-Goog-AuthUser", n);
+        this.type = "FirstParty", this.user = f.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);
     }
@@ -363,36 +361,36 @@ 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 G {
+ */ class W {
     constructor(t, n, e) {
         this.t = t, this.i = n, this.o = e;
     }
     getToken() {
-        return Promise.resolve(new Q(this.t, this.i, this.o));
+        return Promise.resolve(new G(this.t, this.i, this.o));
     }
     start(t, n) {
         // Fire with initial uid.
-        t.enqueueRetryable((() => n(l.FIRST_PARTY)));
+        t.enqueueRetryable((() => n(f.FIRST_PARTY)));
     }
     shutdown() {}
     invalidateToken() {}
 }
 
-class W {
+class Y {
     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 {
+/** AppCheck token provider for the Lite SDK. */ class H {
     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);
+        return this.appCheck ? this.appCheck.getToken().then((t => t ? (b("string" == typeof t.token), 
+        new Y(t.token)) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, n) {}
@@ -419,7 +417,7 @@ class W {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-class H {
+class K {
     /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -448,7 +446,7 @@ class H {
  * Represents the database ID a Firestore client is associated with.
  * @internal
  */
-class K {
+class J {
     constructor(t, n) {
         this.projectId = t, this.database = n || "(default)";
     }
@@ -456,7 +454,7 @@ class K {
         return "(default)" === this.database;
     }
     isEqual(t) {
-        return t instanceof K && t.projectId === this.projectId && t.database === this.database;
+        return t instanceof J && t.projectId === this.projectId && t.database === this.database;
     }
 }
 
@@ -479,20 +477,20 @@ class K {
 /**
  * Path represents an ordered sequence of string segments.
  */
-class J {
+class X {
     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(), 
+        void 0 === n ? n = 0 : n > t.length && v(), void 0 === e ? e = t.length - n : e > t.length - n && v(), 
         this.segments = t, this.offset = n, this.len = e;
     }
     get length() {
         return this.len;
     }
     isEqual(t) {
-        return 0 === J.comparator(this, t);
+        return 0 === X.comparator(this, t);
     }
     child(t) {
         const n = this.segments.slice(this.offset, this.limit());
-        return t instanceof J ? t.forEach((t => {
+        return t instanceof X ? t.forEach((t => {
             n.push(t);
         })) : n.push(t), this.construct(n);
     }
@@ -549,9 +547,9 @@ class J {
  * within Firestore.
  *
  * @internal
- */ class X extends J {
+ */ class Z extends X {
     construct(t, n, e) {
-        return new X(t, n, e);
+        return new Z(t, n, e);
     }
     canonicalString() {
         // NOTE: The client is ignorant of any path segments containing escape
@@ -572,35 +570,35 @@ class J {
         // for legacy reasons and should not be used frequently).
         const n = [];
         for (const e of t) {
-            if (e.indexOf("//") >= 0) throw new k(A, `Invalid segment (${e}). Paths must not contain // in them.`);
+            if (e.indexOf("//") >= 0) throw new U(P, `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 X(n);
+        return new Z(n);
     }
     static emptyPath() {
-        return new X([]);
+        return new Z([]);
     }
 }
 
-const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
+const tt = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
 
 /**
  * A dot-separated path for navigating sub-objects within a document.
  * @internal
- */ class tt extends J {
+ */ class nt extends X {
     construct(t, n, e) {
-        return new tt(t, n, e);
+        return new nt(t, n, e);
     }
     /**
      * Returns true if the string could be used as a segment in a field path
      * without escaping.
      */    static isValidIdentifier(t) {
-        return Z.test(t);
+        return tt.test(t);
     }
     canonicalString() {
         return this.toArray().map((t => (t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"), 
-        tt.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
+        nt.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
     }
     toString() {
         return this.canonicalString();
@@ -613,7 +611,7 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
     /**
      * The field designating the key of a document.
      */    static keyField() {
-        return new tt([ "__name__" ]);
+        return new nt([ "__name__" ]);
     }
     /**
      * Parses a field string from the given server-formatted string.
@@ -628,24 +626,24 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
         const n = [];
         let e = "", r = 0;
         const s = () => {
-            if (0 === e.length) throw new k(A, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
+            if (0 === e.length) throw new U(P, `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 k(A, "Path has trailing escape character: " + t);
+                if (r + 1 === t.length) throw new U(P, "Path has trailing escape character: " + t);
                 const n = t[r + 1];
-                if ("\\" !== n && "." !== n && "`" !== n) throw new k(A, "Path has invalid escape sequence: " + t);
+                if ("\\" !== n && "." !== n && "`" !== n) throw new U(P, "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 k(A, "Unterminated ` in path: " + t);
-        return new tt(n);
+        if (s(), i) throw new U(P, "Unterminated ` in path: " + t);
+        return new nt(n);
     }
     static emptyPath() {
-        return new tt([]);
+        return new nt([]);
     }
 }
 
@@ -667,27 +665,27 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  */
 /**
  * @internal
- */ class nt {
+ */ class et {
     constructor(t) {
         this.path = t;
     }
     static fromPath(t) {
-        return new nt(X.fromString(t));
+        return new et(Z.fromString(t));
     }
     static fromName(t) {
-        return new nt(X.fromString(t).popFirst(5));
+        return new et(Z.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 === X.comparator(this.path, t.path);
+        return null !== t && 0 === Z.comparator(this.path, t.path);
     }
     toString() {
         return this.path.toString();
     }
     static comparator(t, n) {
-        return X.comparator(t.path, n.path);
+        return Z.comparator(t.path, n.path);
     }
     static isDocumentKey(t) {
         return t.length % 2 == 0;
@@ -698,7 +696,7 @@ const Z = /^[_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 nt(new X(t.slice()));
+        return new et(new Z(t.slice()));
     }
 }
 
@@ -717,8 +715,8 @@ const Z = /^[_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 et(t, n, e) {
-    if (!e) throw new k(A, `Function ${t}() cannot be called with an empty ${n}.`);
+ */ function rt(t, n, e) {
+    if (!e) throw new U(P, `Function ${t}() cannot be called with an empty ${n}.`);
 }
 
 /**
@@ -729,15 +727,15 @@ const Z = /^[_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 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}.`);
+function st(t) {
+    if (!et.isDocumentKey(t)) throw new U(P, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
  * Validates that `path` refers to a collection (indicated by the fact it
  * contains an odd numbers of segments).
- */ function st(t) {
-    if (nt.isDocumentKey(t)) throw new k(A, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
+ */ function it(t) {
+    if (et.isDocumentKey(t)) throw new U(P, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
@@ -745,7 +743,7 @@ function rt(t) {
  * (i.e. excludes Array, Date, etc.).
  */
 /** Returns a string describing the type / value of the provided input. */
-function it(t) {
+function ot(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)}...`), 
@@ -771,27 +769,27 @@ function it(t) {
             return n ? `a custom ${n} object` : "an object";
         }
     }
-    return "function" == typeof t ? "a function" : g();
+    return "function" == typeof t ? "a function" : v();
 }
 
-function ot(t, 
+function ut(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 k(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 U(P, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
-            const e = it(t);
-            throw new k(A, `Expected type '${n.name}', but it was: ${e}`);
+            const e = ot(t);
+            throw new U(P, `Expected type '${n.name}', but it was: ${e}`);
         }
     }
     return t;
 }
 
-function ut(t, n) {
-    if (n <= 0) throw new k(A, `Function ${t}() requires a positive number, but it was: ${n}.`);
+function ct(t, n) {
+    if (n <= 0) throw new U(P, `Function ${t}() requires a positive number, but it was: ${n}.`);
 }
 
 /**
@@ -812,11 +810,11 @@ function ut(t, n) {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function ct(t) {
+ */ function at(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function at(t) {
+/** Returns whether the value represents -0. */ function ht(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;
@@ -842,7 +840,7 @@ function ut(t, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const ht = {
+const lt = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery"
@@ -879,7 +877,7 @@ const ht = {
  * 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 lt, ft;
+var ft, dt;
 
 /**
  * Converts an HTTP Status Code to the equivalent error code.
@@ -888,8 +886,8 @@ var lt, ft;
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function dt(t) {
-    if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), I;
+function wt(t) {
+    if (void 0 === t) return y("RPC_ERROR", "HTTP error has no status"), A;
     // The canonical error codes for Google APIs [1] specify mapping onto HTTP
     // status codes but the mapping is not bijective. In each case of ambiguity
     // this function chooses a primary error.
@@ -899,30 +897,30 @@ function dt(t) {
         switch (t) {
       case 200:
         // OK
-        return E;
+        return T;
 
       case 400:
         // Bad Request
-        return F;
+        return S;
 
         // Other possibilities based on the forward mapping
         // return Code.INVALID_ARGUMENT;
         // return Code.OUT_OF_RANGE;
               case 401:
         // Unauthorized
-        return D;
+        return $;
 
       case 403:
         // Forbidden
-        return N;
+        return D;
 
       case 404:
         // Not Found
-        return R;
+        return V;
 
       case 409:
         // Conflict
-        return S;
+        return x;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
@@ -932,33 +930,33 @@ function dt(t) {
 
       case 429:
         // Too Many Requests
-        return $;
+        return F;
 
       case 499:
         // Client Closed Request
-        return T;
+        return I;
 
       case 500:
         // Internal Server Error
-        return I;
+        return A;
 
         // Other possibilities:
         // return Code.INTERNAL;
         // return Code.DATA_LOSS;
               case 501:
         // Unimplemented
-        return x;
+        return O;
 
       case 503:
         // Service Unavailable
-        return C;
+        return L;
 
       case 504:
         // Gateway Timeout
-        return P;
+        return R;
 
       default:
-        return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? F : t >= 500 && t < 600 ? O : I;
+        return t >= 200 && t < 300 ? T : t >= 400 && t < 500 ? S : t >= 500 && t < 600 ? C : A;
     }
 }
 
@@ -981,16 +979,16 @@ function dt(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (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";
+ */ (dt = ft || (ft = {}))[dt.OK = 0] = "OK", dt[dt.CANCELLED = 1] = "CANCELLED", 
+dt[dt.UNKNOWN = 2] = "UNKNOWN", dt[dt.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+dt[dt.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", dt[dt.NOT_FOUND = 5] = "NOT_FOUND", 
+dt[dt.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", dt[dt.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+dt[dt.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", dt[dt.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+dt[dt.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", dt[dt.ABORTED = 10] = "ABORTED", 
+dt[dt.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", dt[dt.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+dt[dt.INTERNAL = 13] = "INTERNAL", dt[dt.UNAVAILABLE = 14] = "UNAVAILABLE", dt[dt.DATA_LOSS = 15] = "DATA_LOSS";
 
-class wt extends 
+class mt extends 
 /**
  * Base class for all Rest-based connections to the backend (WebChannel and
  * HTTP).
@@ -1003,11 +1001,11 @@ class {
     }
     m(t, n, e, r, s) {
         const i = this.p(t, n);
-        m("RestConnection", "Sending: ", i, e);
+        p("RestConnection", "Sending: ", i, e);
         const o = {};
-        return this.g(o, r, s), this.v(t, i, o, e).then((t => (m("RestConnection", "Received: ", t), 
+        return this.g(o, r, s), this.v(t, i, o, e).then((t => (p("RestConnection", "Received: ", t), 
         t)), (n => {
-            throw y("RestConnection", `${t} failed with error: `, n, "url: ", i, "request:", e), 
+            throw _("RestConnection", `${t} failed with error: `, n, "url: ", i, "request:", e), 
             n;
         }));
     }
@@ -1020,7 +1018,7 @@ class {
      * Modifies the headers for a request, adding any authorization token if
      * present and any additional headers for the request.
      */    g(t, n, e) {
-        t["X-Goog-Api-Client"] = "gl-js/ fire/" + f, 
+        t["X-Goog-Api-Client"] = "gl-js/ fire/" + d, 
         // 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
@@ -1029,7 +1027,7 @@ class {
         n && n.headers.forEach(((n, e) => t[e] = n)), e && e.headers.forEach(((n, e) => t[e] = n));
     }
     p(t, n) {
-        const e = ht[t];
+        const e = lt[t];
         return `${this.h}/v1/${n}:${e}`;
     }
 } {
@@ -1053,9 +1051,9 @@ class {
                 body: s
             });
         } catch (t) {
-            throw new k(dt(t.status), "Request failed with error: " + t.statusText);
+            throw new U(wt(t.status), "Request failed with error: " + t.statusText);
         }
-        if (!i.ok) throw new k(dt(i.status), "Request failed with error: " + i.statusText);
+        if (!i.ok) throw new U(wt(i.status), "Request failed with error: " + i.statusText);
         return i.json();
     }
 }
@@ -1098,7 +1096,7 @@ class {
  *
  * If `nBytes < 0` , an error will be thrown.
  */
-function mt(t) {
+function pt(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
@@ -1124,14 +1122,14 @@ function mt(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 pt {
+ */ class yt {
     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 = mt(40);
+            const r = pt(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.
@@ -1141,11 +1139,11 @@ function mt(t) {
     }
 }
 
-function yt(t, n) {
+function _t(t, n) {
     return t < n ? -1 : t > n ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function _t(t, n, e) {
+/** Helper to compare arrays using isEqual(). */ function gt(t, n, e) {
     return t.length === n.length && t.every(((t, r) => e(t, n[r])));
 }
 
@@ -1180,7 +1178,7 @@ function yt(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 gt {
+class vt {
     /**
      * Creates a new timestamp.
      *
@@ -1201,18 +1199,18 @@ class gt {
      * The fractions of a second at nanosecond resolution.*
      */
     n) {
-        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);
+        if (this.seconds = t, this.nanoseconds = n, n < 0) throw new U(P, "Timestamp nanoseconds out of range: " + n);
+        if (n >= 1e9) throw new U(P, "Timestamp nanoseconds out of range: " + n);
+        if (t < -62135596800) throw new U(P, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new k(A, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new U(P, "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 gt.fromMillis(Date.now());
+        return vt.fromMillis(Date.now());
     }
     /**
      * Creates a new timestamp from the given date.
@@ -1221,7 +1219,7 @@ class gt {
      * @returns A new `Timestamp` representing the same point in time as the given
      *     date.
      */    static fromDate(t) {
-        return gt.fromMillis(t.getTime());
+        return vt.fromMillis(t.getTime());
     }
     /**
      * Creates a new timestamp from the given number of milliseconds.
@@ -1232,7 +1230,7 @@ class gt {
      *     number of milliseconds.
      */    static fromMillis(t) {
         const n = Math.floor(t / 1e3), e = Math.floor(1e6 * (t - 1e3 * n));
-        return new gt(n, e);
+        return new vt(n, e);
     }
     /**
      * Converts a `Timestamp` to a JavaScript `Date` object. This conversion
@@ -1254,7 +1252,7 @@ class gt {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }
     _compareTo(t) {
-        return this.seconds === t.seconds ? yt(this.nanoseconds, t.nanoseconds) : yt(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? _t(this.nanoseconds, t.nanoseconds) : _t(this.seconds, t.seconds);
     }
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1310,15 +1308,15 @@ class gt {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ class vt {
+ */ class bt {
     constructor(t) {
         this.timestamp = t;
     }
     static fromTimestamp(t) {
-        return new vt(t);
+        return new bt(t);
     }
     static min() {
-        return new vt(new gt(0, 0));
+        return new bt(new vt(0, 0));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -1353,13 +1351,13 @@ class gt {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function bt(t) {
+ */ function Et(t) {
     let n = 0;
     for (const e in t) Object.prototype.hasOwnProperty.call(t, e) && n++;
     return n;
 }
 
-function Et(t, n) {
+function Tt(t, n) {
     for (const e in t) Object.prototype.hasOwnProperty.call(t, e) && n(e, t[e]);
 }
 
@@ -1389,12 +1387,12 @@ function Et(t, n) {
  *             If foo is not an object, foo is replaced with an object
  *             containing foo
  */
-class Tt {
+class It {
     constructor(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
         // Sort the field mask to support `FieldMask.isEqual()` and assert below.
-        t.sort(tt.comparator);
+        t.sort(nt.comparator);
     }
     /**
      * Verifies that `fieldPath` is included by at least one field in this field
@@ -1406,7 +1404,7 @@ class Tt {
         return !1;
     }
     isEqual(t) {
-        return _t(this.fields, t.fields, ((t, n) => t.isEqual(n)));
+        return gt(this.fields, t.fields, ((t, n) => t.isEqual(n)));
     }
 }
 
@@ -1429,12 +1427,12 @@ class Tt {
 // 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 It(t) {
+function At(t) {
     return String.fromCharCode.apply(null, 
     // We use `decodeStringToByteArray()` instead of `decodeString()` since
     // `decodeString()` returns Unicode strings, which doesn't match the values
     // returned by `atob()`'s Latin1 representation.
-    c.decodeStringToByteArray(t, false));
+    a.decodeStringToByteArray(t, false));
 }
 
 /** Converts a binary string to a Base64 encoded string. */
@@ -1463,13 +1461,13 @@ function It(t) {
  * before being sent as a proto.
  * @internal
  */
-class At {
+class Pt {
     constructor(t) {
         this.binaryString = t;
     }
     static fromBase64String(t) {
-        const n = It(t);
-        return new At(n);
+        const n = At(t);
+        return new Pt(n);
     }
     static fromUint8Array(t) {
         const n = 
@@ -1484,13 +1482,25 @@ class At {
         /**
  * Helper function to convert a binary string to an Uint8Array.
  */ (t);
-        return new At(n);
+        return new Pt(n);
+    }
+    [Symbol.iterator]() {
+        let t = 0;
+        return {
+            next: () => t < this.binaryString.length ? {
+                value: this.binaryString.charCodeAt(t++),
+                done: !1
+            } : {
+                value: void 0,
+                done: !0
+            }
+        };
     }
     toBase64() {
         return function(t) {
             const n = [];
             for (let e = 0; e < t.length; e++) n[e] = t.charCodeAt(e);
-            return c.encodeByteArray(n, !1);
+            return a.encodeByteArray(n, !1);
         }(this.binaryString);
     }
     toUint8Array() {
@@ -1522,31 +1532,31 @@ class At {
         return 2 * this.binaryString.length;
     }
     compareTo(t) {
-        return yt(this.binaryString, t.binaryString);
+        return _t(this.binaryString, t.binaryString);
     }
     isEqual(t) {
         return this.binaryString === t.binaryString;
     }
 }
 
-At.EMPTY_BYTE_STRING = new At("");
+Pt.EMPTY_BYTE_STRING = new Pt("");
 
-const Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const Rt = 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 Rt(t) {
+ */ function Vt(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.
-    if (v(!!t), "string" == typeof t) {
+    if (b(!!t), "string" == typeof t) {
         // The date string can have higher precision (nanos) than the Date class
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
         let n = 0;
-        const e = Pt.exec(t);
-        if (v(!!e), e[1]) {
+        const e = Rt.exec(t);
+        if (b(!!e), e[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = e[1];
             t = (t + "000000000").substr(0, 9), n = Number(t);
@@ -1559,21 +1569,21 @@ const Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: Vt(t.seconds),
-        nanos: Vt(t.nanos)
+        seconds: Nt(t.seconds),
+        nanos: Nt(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function Vt(t) {
+ */ function Nt(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 Nt(t) {
-    return "string" == typeof t ? At.fromBase64String(t) : At.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Dt(t) {
+    return "string" == typeof t ? Pt.fromBase64String(t) : Pt.fromUint8Array(t);
 }
 
 /**
@@ -1609,7 +1619,7 @@ const Pt = 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 Dt(t) {
+ */ function $t(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);
 }
@@ -1619,16 +1629,16 @@ const Pt = 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 $t(t) {
+ */ function Ft(t) {
     const n = t.mapValue.fields.__previous_value__;
-    return Dt(n) ? $t(n) : n;
+    return $t(n) ? Ft(n) : n;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Ft(t) {
-    const n = Rt(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new gt(n.seconds, n.nanos);
+ */ function St(t) {
+    const n = Vt(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new vt(n.seconds, n.nanos);
 }
 
 /**
@@ -1647,13 +1657,14 @@ const Pt = 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 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();
+/** Extracts the backend's type order for the provided value. */ function xt(t) {
+    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? $t(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : v();
 }
 
 /** 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;
+    if (t === n) return !0;
+    const e = xt(t);
+    if (e !== xt(n)) return !1;
     switch (e) {
       case 0 /* NullValue */ :
         return !0;
@@ -1662,14 +1673,14 @@ const Pt = 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 Ft(t).isEqual(Ft(n));
+        return St(t).isEqual(St(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 = Rt(t.timestampValue), r = Rt(n.timestampValue);
+            const e = Vt(t.timestampValue), r = Vt(n.timestampValue);
             return e.seconds === r.seconds && e.nanos === r.nanos;
         }(t, n);
 
@@ -1678,7 +1689,7 @@ const Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 6 /* BlobValue */ :
         return function(t, n) {
-            return Nt(t.bytesValue).isEqual(Nt(n.bytesValue));
+            return Dt(t.bytesValue).isEqual(Dt(n.bytesValue));
         }(t, n);
 
       case 7 /* RefValue */ :
@@ -1686,70 +1697,71 @@ const Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 8 /* GeoPointValue */ :
         return function(t, n) {
-            return Vt(t.geoPointValue.latitude) === Vt(n.geoPointValue.latitude) && Vt(t.geoPointValue.longitude) === Vt(n.geoPointValue.longitude);
+            return Nt(t.geoPointValue.latitude) === Nt(n.geoPointValue.latitude) && Nt(t.geoPointValue.longitude) === Nt(n.geoPointValue.longitude);
         }(t, n);
 
       case 2 /* NumberValue */ :
         return function(t, n) {
-            if ("integerValue" in t && "integerValue" in n) return Vt(t.integerValue) === Vt(n.integerValue);
+            if ("integerValue" in t && "integerValue" in n) return Nt(t.integerValue) === Nt(n.integerValue);
             if ("doubleValue" in t && "doubleValue" in n) {
-                const e = Vt(t.doubleValue), r = Vt(n.doubleValue);
-                return e === r ? at(e) === at(r) : isNaN(e) && isNaN(r);
+                const e = Nt(t.doubleValue), r = Nt(n.doubleValue);
+                return e === r ? ht(e) === ht(r) : isNaN(e) && isNaN(r);
             }
             return !1;
         }(t, n);
 
       case 9 /* ArrayValue */ :
-        return _t(t.arrayValue.values || [], n.arrayValue.values || [], qt);
+        return gt(t.arrayValue.values || [], n.arrayValue.values || [], qt);
 
       case 10 /* ObjectValue */ :
         return function(t, n) {
             const e = t.mapValue.fields || {}, r = n.mapValue.fields || {};
-            if (bt(e) !== bt(r)) return !1;
+            if (Et(e) !== Et(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);
 
       default:
-        return g();
+        return v();
     }
 }
 
-function xt(t, n) {
+function Ot(t, n) {
     return void 0 !== (t.values || []).find((t => qt(t, n)));
 }
 
-function Ot(t, n) {
-    const e = St(t), r = St(n);
-    if (e !== r) return yt(e, r);
+function Ct(t, n) {
+    if (t === n) return 0;
+    const e = xt(t), r = xt(n);
+    if (e !== r) return _t(e, r);
     switch (e) {
       case 0 /* NullValue */ :
         return 0;
 
       case 1 /* BooleanValue */ :
-        return yt(t.booleanValue, n.booleanValue);
+        return _t(t.booleanValue, n.booleanValue);
 
       case 2 /* NumberValue */ :
         return function(t, n) {
-            const e = Vt(t.integerValue || t.doubleValue), r = Vt(n.integerValue || n.doubleValue);
+            const e = Nt(t.integerValue || t.doubleValue), r = Nt(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 Ct(t.timestampValue, n.timestampValue);
+        return Lt(t.timestampValue, n.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return Ct(Ft(t), Ft(n));
+        return Lt(St(t), St(n));
 
       case 5 /* StringValue */ :
-        return yt(t.stringValue, n.stringValue);
+        return _t(t.stringValue, n.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, n) {
-            const e = Nt(t), r = Nt(n);
+            const e = Dt(t), r = Dt(n);
             return e.compareTo(r);
         }(t.bytesValue, n.bytesValue);
 
@@ -1757,27 +1769,27 @@ function Ot(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 = yt(e[t], r[t]);
+                const n = _t(e[t], r[t]);
                 if (0 !== n) return n;
             }
-            return yt(e.length, r.length);
+            return _t(e.length, r.length);
         }(t.referenceValue, n.referenceValue);
 
       case 8 /* GeoPointValue */ :
         return function(t, n) {
-            const e = yt(Vt(t.latitude), Vt(n.latitude));
+            const e = _t(Nt(t.latitude), Nt(n.latitude));
             if (0 !== e) return e;
-            return yt(Vt(t.longitude), Vt(n.longitude));
+            return _t(Nt(t.longitude), Nt(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 = Ot(e[t], r[t]);
+                const n = Ct(e[t], r[t]);
                 if (n) return n;
             }
-            return yt(e.length, r.length);
+            return _t(e.length, r.length);
         }(t.arrayValue, n.arrayValue);
 
       case 10 /* ObjectValue */ :
@@ -1789,49 +1801,49 @@ function Ot(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 = yt(r[t], i[t]);
+                const n = _t(r[t], i[t]);
                 if (0 !== n) return n;
-                const o = Ot(e[r[t]], s[i[t]]);
+                const o = Ct(e[r[t]], s[i[t]]);
                 if (0 !== o) return o;
             }
-            return yt(r.length, i.length);
+            return _t(r.length, i.length);
         }
         /** Returns a reference value for the provided database and key. */ (t.mapValue, n.mapValue);
 
       default:
-        throw g();
+        throw v();
     }
 }
 
-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 Lt(t, n) {
+    if ("string" == typeof t && "string" == typeof n && t.length === n.length) return _t(t, n);
+    const e = Vt(t), r = Vt(n), s = _t(e.seconds, r.seconds);
+    return 0 !== s ? s : _t(e.nanos, r.nanos);
 }
 
-function Lt(t, n) {
+function kt(t, n) {
     return {
         referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${n.path.canonicalString()}`
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function kt(t) {
+/** Returns true if `value` is an ArrayValue. */ function Ut(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Ut(t) {
+/** Returns true if `value` is a NullValue. */ function jt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function jt(t) {
+/** Returns true if `value` is NaN. */ function Mt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function Mt(t) {
+/** Returns true if `value` is a MapValue. */ function Bt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Bt(t) {
+/** Creates a deep copy of `source`. */ function zt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1844,7 +1856,7 @@ function Lt(t, n) {
                 fields: {}
             }
         };
-        return Et(t.mapValue.fields, ((t, e) => n.mapValue.fields[t] = Bt(e))), n;
+        return Tt(t.mapValue.fields, ((t, e) => n.mapValue.fields[t] = zt(e))), n;
     }
     if (t.arrayValue) {
         const n = {
@@ -1852,7 +1864,7 @@ function Lt(t, n) {
                 values: []
             }
         };
-        for (let e = 0; e < (t.arrayValue.values || []).length; ++e) n.arrayValue.values[e] = Bt(t.arrayValue.values[e]);
+        for (let e = 0; e < (t.arrayValue.values || []).length; ++e) n.arrayValue.values[e] = zt(t.arrayValue.values[e]);
         return n;
     }
     return Object.assign({}, t);
@@ -1877,12 +1889,12 @@ function Lt(t, n) {
 /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ class zt {
+ */ class Qt {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new zt({
+        return new Qt({
             mapValue: {}
         });
     }
@@ -1896,7 +1908,7 @@ function Lt(t, n) {
         {
             let n = this.value;
             for (let e = 0; e < t.length - 1; ++e) if (n = (n.mapValue.fields || {})[t.get(e)], 
-            !Mt(n)) return null;
+            !Bt(n)) return null;
             return n = (n.mapValue.fields || {})[t.lastSegment()], n || null;
         }
     }
@@ -1906,21 +1918,21 @@ function Lt(t, n) {
      * @param path - The field path to set.
      * @param value - The value to set.
      */    set(t, n) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Bt(n);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = zt(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 = tt.emptyPath(), e = {}, r = [];
+        let n = nt.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()] = Bt(t) : r.push(s.lastSegment());
+            t ? e[s.lastSegment()] = zt(t) : r.push(s.lastSegment());
         }));
         const s = this.getFieldsMap(n);
         this.applyChanges(s, e, r);
@@ -1932,7 +1944,7 @@ function Lt(t, n) {
      * @param path - The field path to remove.
      */    delete(t) {
         const n = this.field(t.popLast());
-        Mt(n) && n.mapValue.fields && delete n.mapValue.fields[t.lastSegment()];
+        Bt(n) && n.mapValue.fields && delete n.mapValue.fields[t.lastSegment()];
     }
     isEqual(t) {
         return qt(this.value, t.value);
@@ -1947,7 +1959,7 @@ function Lt(t, n) {
         });
         for (let e = 0; e < t.length; ++e) {
             let r = n.mapValue.fields[t.get(e)];
-            Mt(r) && r.mapValue.fields || (r = {
+            Bt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -1959,11 +1971,11 @@ function Lt(t, n) {
      * Modifies `fieldsMap` by adding, replacing or deleting the specified
      * entries.
      */    applyChanges(t, n, e) {
-        Et(n, ((n, e) => t[n] = e));
+        Tt(n, ((n, e) => t[n] = e));
         for (const n of e) delete t[n];
     }
     clone() {
-        return new zt(Bt(this.value));
+        return new Qt(zt(this.value));
     }
 }
 
@@ -1992,7 +2004,7 @@ function Lt(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 Qt {
+ */ class Gt {
     constructor(t, n, e, r, s) {
         this.key = t, this.documentType = n, this.version = e, this.data = r, this.documentState = s;
     }
@@ -2000,23 +2012,23 @@ function Lt(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 Qt(t, 0 /* INVALID */ , vt.min(), zt.empty(), 0 /* SYNCED */);
+        return new Gt(t, 0 /* INVALID */ , bt.min(), Qt.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 Qt(t, 1 /* FOUND_DOCUMENT */ , n, e, 0 /* SYNCED */);
+        return new Gt(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 Qt(t, 2 /* NO_DOCUMENT */ , n, zt.empty(), 0 /* SYNCED */);
+        return new Gt(t, 2 /* NO_DOCUMENT */ , n, Qt.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 Qt(t, 3 /* UNKNOWN_DOCUMENT */ , n, zt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new Gt(t, 3 /* UNKNOWN_DOCUMENT */ , n, Qt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2029,7 +2041,7 @@ function Lt(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 = zt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Qt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }
     /**
@@ -2037,7 +2049,7 @@ function Lt(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 = zt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Qt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasCommittedMutations() {
@@ -2068,10 +2080,10 @@ function Lt(t, n) {
         return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
     }
     isEqual(t) {
-        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);
+        return t instanceof Gt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
     }
-    clone() {
-        return new Qt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
+    mutableCopy() {
+        return new Gt(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}})`;
@@ -2095,7 +2107,7 @@ function Lt(t, n) {
  * limitations under the License.
  */
 // Visible for testing
-class Gt {
+class Wt {
     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.R = null;
@@ -2109,26 +2121,26 @@ class Gt {
  * NOTE: you should always construct `Target` from `Query.toTarget` instead of
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
- */ function Wt(t, n = null, e = [], r = [], s = null, i = null, o = null) {
-    return new Gt(t, n, e, r, s, i, o);
+ */ function Yt(t, n = null, e = [], r = [], s = null, i = null, o = null) {
+    return new Wt(t, n, e, r, s, i, o);
 }
 
-class Yt extends class {} {
+class Ht 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.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);
+        return t.isKeyField() ? "in" /* IN */ === n || "not-in" /* NOT_IN */ === n ? this.V(t, n, e) : new Kt(t, n, e) : "array-contains" /* ARRAY_CONTAINS */ === n ? new tn(t, e) : "in" /* IN */ === n ? new nn(t, e) : "not-in" /* NOT_IN */ === n ? new en(t, e) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === n ? new rn(t, e) : new Ht(t, n, e);
     }
     static V(t, n, e) {
-        return "in" /* IN */ === n ? new Kt(t, e) : new Jt(t, e);
+        return "in" /* IN */ === n ? new Jt(t, e) : new Xt(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.N(Ot(n, this.value)) : null !== n && St(this.value) === St(n) && this.N(Ot(n, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== n && this.N(Ct(n, this.value)) : null !== n && xt(this.value) === xt(n) && this.N(Ct(n, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
     N(t) {
@@ -2152,7 +2164,7 @@ class Yt extends class {} {
             return t >= 0;
 
           default:
-            return g();
+            return v();
         }
     }
     D() {
@@ -2161,79 +2173,79 @@ class Yt extends class {} {
 }
 
 /** Filter that matches on key fields (i.e. '__name__'). */
-class Ht extends Yt {
+class Kt extends Ht {
     constructor(t, n, e) {
-        super(t, n, e), this.key = nt.fromName(e.referenceValue);
+        super(t, n, e), this.key = et.fromName(e.referenceValue);
     }
     matches(t) {
-        const n = nt.comparator(t.key, this.key);
+        const n = et.comparator(t.key, this.key);
         return this.N(n);
     }
 }
 
-/** Filter that matches on key fields within an array. */ class Kt extends Yt {
+/** Filter that matches on key fields within an array. */ class Jt extends Ht {
     constructor(t, n) {
-        super(t, "in" /* IN */ , n), this.keys = Xt("in" /* IN */ , n);
+        super(t, "in" /* IN */ , n), this.keys = Zt("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 Jt extends Yt {
+/** Filter that matches on key fields not present within an array. */ class Xt extends Ht {
     constructor(t, n) {
-        super(t, "not-in" /* NOT_IN */ , n), this.keys = Xt("not-in" /* NOT_IN */ , n);
+        super(t, "not-in" /* NOT_IN */ , n), this.keys = Zt("not-in" /* NOT_IN */ , n);
     }
     matches(t) {
         return !this.keys.some((n => n.isEqual(t.key)));
     }
 }
 
-function Xt(t, n) {
+function Zt(t, n) {
     var e;
-    return ((null === (e = n.arrayValue) || void 0 === e ? void 0 : e.values) || []).map((t => nt.fromName(t.referenceValue)));
+    return ((null === (e = n.arrayValue) || void 0 === e ? void 0 : e.values) || []).map((t => et.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class Zt extends Yt {
+/** A Filter that implements the array-contains operator. */ class tn extends Ht {
     constructor(t, n) {
         super(t, "array-contains" /* ARRAY_CONTAINS */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return kt(n) && xt(n.arrayValue, this.value);
+        return Ut(n) && Ot(n.arrayValue, this.value);
     }
 }
 
-/** A Filter that implements the IN operator. */ class tn extends Yt {
+/** A Filter that implements the IN operator. */ class nn extends Ht {
     constructor(t, n) {
         super(t, "in" /* IN */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return null !== n && xt(this.value.arrayValue, n);
+        return null !== n && Ot(this.value.arrayValue, n);
     }
 }
 
-/** A Filter that implements the not-in operator. */ class nn extends Yt {
+/** A Filter that implements the not-in operator. */ class en extends Ht {
     constructor(t, n) {
         super(t, "not-in" /* NOT_IN */ , n);
     }
     matches(t) {
-        if (xt(this.value.arrayValue, {
+        if (Ot(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         const n = t.data.field(this.field);
-        return null !== n && !xt(this.value.arrayValue, n);
+        return null !== n && !Ot(this.value.arrayValue, n);
     }
 }
 
-/** A Filter that implements the array-contains-any operator. */ class en extends Yt {
+/** A Filter that implements the array-contains-any operator. */ class rn extends Ht {
     constructor(t, n) {
         super(t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return !(!kt(n) || !n.arrayValue.values) && n.arrayValue.values.some((t => xt(this.value.arrayValue, t)));
+        return !(!Ut(n) || !n.arrayValue.values) && n.arrayValue.values.some((t => Ot(this.value.arrayValue, t)));
     }
 }
 
@@ -2250,7 +2262,7 @@ function Xt(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 rn {
+ */ class sn {
     constructor(t, n) {
         this.position = t, this.before = n;
     }
@@ -2258,17 +2270,17 @@ function Xt(t, n) {
 
 /**
  * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
- */ class sn {
+ */ class on {
     constructor(t, n = "asc" /* ASCENDING */) {
         this.field = t, this.dir = n;
     }
 }
 
-function on(t, n) {
+function un(t, n) {
     return t.dir === n.dir && t.field.isEqual(n.field);
 }
 
-function un(t, n) {
+function cn(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;
@@ -2300,7 +2312,7 @@ function un(t, n) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ class cn {
+ */ class an {
     /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2313,15 +2325,15 @@ function un(t, n) {
     }
 }
 
-/** Creates a new Query for a query that matches all documents at `path` */ function an(t) {
-    return !ct(t.limit) && "L" /* Last */ === t.limitType;
+/** Creates a new Query for a query that matches all documents at `path` */ function hn(t) {
+    return !at(t.limit) && "L" /* Last */ === t.limitType;
 }
 
-function hn(t) {
+function ln(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function ln(t) {
+function fn(t) {
     for (const n of t.filters) if (n.D()) return n.field;
     return null;
 }
@@ -2334,7 +2346,7 @@ function ln(t) {
  * Returns whether the query matches a collection group rather than a specific
  * collection.
  */
-function fn(t) {
+function dn(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2342,23 +2354,23 @@ function fn(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 dn(t) {
-    const n = b(t);
+ */ function wn(t) {
+    const n = E(t);
     if (null === n.$) {
         n.$ = [];
-        const t = ln(n), e = hn(n);
+        const t = fn(n), e = ln(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.$.push(new sn(t)), n.$.push(new sn(tt.keyField(), "asc" /* ASCENDING */)); else {
+        t.isKeyField() || n.$.push(new on(t)), n.$.push(new on(nt.keyField(), "asc" /* ASCENDING */)); else {
             let t = !1;
             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.$.push(new sn(tt.keyField(), t));
+                n.$.push(new on(nt.keyField(), t));
             }
         }
     }
@@ -2367,34 +2379,34 @@ function fn(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function wn(t) {
-    const n = b(t);
-    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 {
+ */ function mn(t) {
+    const n = E(t);
+    if (!n.F) if ("F" /* First */ === n.limitType) n.F = Yt(n.path, n.collectionGroup, wn(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 dn(n)) {
+        for (const e of wn(n)) {
             const n = "desc" /* DESCENDING */ === e.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            t.push(new sn(e.field, n));
+            t.push(new on(e.field, n));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                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;
+                const e = n.endAt ? new sn(n.endAt.position, !n.endAt.before) : null, r = n.startAt ? new sn(n.startAt.position, !n.startAt.before) : null;
         // Now return as a LimitType.First query.
-        n.F = Wt(n.path, n.collectionGroup, t, n.filters, n.limit, e, r);
+        n.F = Yt(n.path, n.collectionGroup, t, n.filters, n.limit, e, r);
     }
     return n.F;
 }
 
-function mn(t, n) {
+function pn(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 (!on(t.orderBy[e], n.orderBy[e])) return !1;
+        for (let e = 0; e < t.orderBy.length; e++) if (!un(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) || !qt(e.value, r.value)) return !1;
         var e, r;
-        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;
+        return t.collectionGroup === n.collectionGroup && !!t.path.isEqual(n.path) && !!cn(t.startAt, n.startAt) && cn(t.endAt, n.endAt);
+    }(mn(t), mn(n)) && t.limitType === n.limitType;
 }
 
 /**
@@ -2422,9 +2434,9 @@ function mn(t, n) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function pn(t, n) {
+function yn(t, n) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !at(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !ht(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(n) ? 
     /**
  * Returns an IntegerValue for `value`.
@@ -2446,7 +2458,7 @@ function pn(t, n) {
             };
         }
         return {
-            doubleValue: at(n) ? "-0" : n
+            doubleValue: ht(n) ? "-0" : n
         };
     }(t, n);
 }
@@ -2467,7 +2479,7 @@ function pn(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 yn {
+/** Used to represent a field transform on a mutation. */ class _n {
     constructor() {
         // Make sure that the structural type of `TransformOperation` is unique.
         // See https://github.com/microsoft/TypeScript/issues/5451
@@ -2475,15 +2487,15 @@ function pn(t, n) {
     }
 }
 
-/** Transforms a value into a server-generated timestamp. */ class _n extends yn {}
+/** Transforms a value into a server-generated timestamp. */ class gn extends _n {}
 
-/** Transforms an array value via a union operation. */ class gn extends yn {
+/** Transforms an array value via a union operation. */ class vn extends _n {
     constructor(t) {
         super(), this.elements = t;
     }
 }
 
-/** Transforms an array value via a remove operation. */ class vn extends yn {
+/** Transforms an array value via a remove operation. */ class bn extends _n {
     constructor(t) {
         super(), this.elements = t;
     }
@@ -2494,7 +2506,7 @@ function pn(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 bn extends yn {
+ */ class En extends _n {
     constructor(t, n) {
         super(), this.q = t, this.O = n;
     }
@@ -2516,7 +2528,7 @@ function pn(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 En {
+/** A field path and the TransformOperation to perform upon it. */ class Tn {
     constructor(t, n) {
         this.field = t, this.transform = n;
     }
@@ -2526,18 +2538,18 @@ function pn(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 Tn {
+ */ class In {
     constructor(t, n) {
         this.updateTime = t, this.exists = n;
     }
     /** Creates a new empty Precondition. */    static none() {
-        return new Tn;
+        return new In;
     }
     /** Creates a new Precondition with an exists flag. */    static exists(t) {
-        return new Tn(void 0, t);
+        return new In(void 0, t);
     }
     /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {
-        return new Tn(t);
+        return new In(t);
     }
     /** Returns whether this Precondition is empty. */    get isNone() {
         return void 0 === this.updateTime && void 0 === this.exists;
@@ -2590,12 +2602,12 @@ function pn(t, n) {
  * applyToLocalView() to implement the actual behavior of applying the mutation
  * to some source document (see `setMutationApplyToRemoteDocument()` for an
  * example).
- */ class In {}
+ */ class An {}
 
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class An extends In {
+ */ class Pn extends An {
     constructor(t, n, e, r = []) {
         super(), this.key = t, this.value = n, this.precondition = e, this.fieldTransforms = r, 
         this.type = 0 /* Set */;
@@ -2614,14 +2626,14 @@ function pn(t, n) {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ class Pn extends In {
+ */ class Rn extends An {
     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 Rn extends In {
+/** A mutation that deletes the document at the given key. */ class Vn extends An {
     constructor(t, n) {
         super(), this.key = t, this.precondition = n, this.type = 2 /* Delete */ , this.fieldTransforms = [];
     }
@@ -2633,7 +2645,7 @@ function pn(t, n) {
  *
  * The `verify` operation is only used in Transactions, and this class serves
  * primarily to facilitate serialization into protos.
- */ class Vn extends In {
+ */ class Nn extends An {
     constructor(t, n) {
         super(), this.key = t, this.precondition = n, this.type = 3 /* Verify */ , this.fieldTransforms = [];
     }
@@ -2654,13 +2666,13 @@ function pn(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 Nn = (() => {
+ */ const Dn = (() => {
     const t = {
         asc: "ASCENDING",
         desc: "DESCENDING"
     };
     return t;
-})(), Dn = (() => {
+})(), $n = (() => {
     const t = {
         "<": "LESS_THAN",
         "<=": "LESS_THAN_OR_EQUAL",
@@ -2690,7 +2702,7 @@ function pn(t, n) {
  * TODO(klimt): We can remove the databaseId argument if we keep the full
  * resource name in documents.
  */
-class $n {
+class Fn {
     constructor(t, n) {
         this.databaseId = t, this.S = n;
     }
@@ -2707,7 +2719,7 @@ class $n {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Fn(t, n) {
+function Sn(t, n) {
     if (t.S) {
         return `${new Date(1e3 * n.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + n.nanoseconds).slice(-9)}Z`;
     }
@@ -2722,129 +2734,129 @@ function Fn(t, n) {
  *
  * Visible for testing.
  */
-function Sn(t, n) {
+function xn(t, n) {
     return t.S ? n.toBase64() : n.toUint8Array();
 }
 
 function qn(t, n) {
-    return Fn(t, n.toTimestamp());
+    return Sn(t, n.toTimestamp());
 }
 
-function xn(t) {
-    return v(!!t), vt.fromTimestamp(function(t) {
-        const n = Rt(t);
-        return new gt(n.seconds, n.nanos);
+function On(t) {
+    return b(!!t), bt.fromTimestamp(function(t) {
+        const n = Vt(t);
+        return new vt(n.seconds, n.nanos);
     }(t));
 }
 
-function On(t, n) {
+function Cn(t, n) {
     return function(t) {
-        return new X([ "projects", t.projectId, "databases", t.database ]);
+        return new Z([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(n).canonicalString();
 }
 
-function Cn(t, n) {
-    return On(t.databaseId, n.path);
+function Ln(t, n) {
+    return Cn(t.databaseId, n.path);
 }
 
-function Ln(t, n) {
+function kn(t, n) {
     const e = function(t) {
-        const n = X.fromString(t);
-        return v(Kn(n)), n;
+        const n = Z.fromString(t);
+        return b(Jn(n)), n;
     }(n);
-    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)));
+    if (e.get(1) !== t.databaseId.projectId) throw new U(P, "Tried to deserialize key from different project: " + e.get(1) + " vs " + t.databaseId.projectId);
+    if (e.get(3) !== t.databaseId.database) throw new U(P, "Tried to deserialize key from different database: " + e.get(3) + " vs " + t.databaseId.database);
+    return new et((b((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 kn(t, n) {
-    return On(t.databaseId, n);
+function Un(t, n) {
+    return Cn(t.databaseId, n);
 }
 
-function Un(t) {
-    return new X([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
+function jn(t) {
+    return new Z([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function jn(t, n, e) {
+function Mn(t, n, e) {
     return {
-        name: Cn(t, n),
+        name: Ln(t, n),
         fields: e.value.mapValue.fields
     };
 }
 
-function Mn(t, n) {
+function Bn(t, n) {
     return "found" in n ? function(t, n) {
-        v(!!n.found), n.found.name, n.found.updateTime;
-        const e = Ln(t, n.found.name), r = xn(n.found.updateTime), s = new zt({
+        b(!!n.found), n.found.name, n.found.updateTime;
+        const e = kn(t, n.found.name), r = On(n.found.updateTime), s = new Qt({
             mapValue: {
                 fields: n.found.fields
             }
         });
-        return Qt.newFoundDocument(e, r, s);
+        return Gt.newFoundDocument(e, r, s);
     }(t, n) : "missing" in n ? function(t, n) {
-        v(!!n.missing), v(!!n.readTime);
-        const e = Ln(t, n.missing), r = xn(n.readTime);
-        return Qt.newNoDocument(e, r);
-    }(t, n) : g();
+        b(!!n.missing), b(!!n.readTime);
+        const e = kn(t, n.missing), r = On(n.readTime);
+        return Gt.newNoDocument(e, r);
+    }(t, n) : v();
 }
 
-function Bn(t, n) {
+function zn(t, n) {
     let e;
-    if (n instanceof An) e = {
-        update: jn(t, n.key, n.value)
+    if (n instanceof Pn) e = {
+        update: Mn(t, n.key, n.value)
+    }; else if (n instanceof Vn) e = {
+        delete: Ln(t, n.key)
     }; 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)
+        update: Mn(t, n.key, n.data),
+        updateMask: Kn(n.fieldMask)
     }; else {
-        if (!(n instanceof Vn)) return g();
+        if (!(n instanceof Nn)) return v();
         e = {
-            verify: Cn(t, n.key)
+            verify: Ln(t, n.key)
         };
     }
     return n.fieldTransforms.length > 0 && (e.updateTransforms = n.fieldTransforms.map((t => function(t, n) {
         const e = n.transform;
-        if (e instanceof _n) return {
+        if (e instanceof gn) return {
             fieldPath: n.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
-        if (e instanceof gn) return {
+        if (e instanceof vn) return {
             fieldPath: n.field.canonicalString(),
             appendMissingElements: {
                 values: e.elements
             }
         };
-        if (e instanceof vn) return {
+        if (e instanceof bn) return {
             fieldPath: n.field.canonicalString(),
             removeAllFromArray: {
                 values: e.elements
             }
         };
-        if (e instanceof bn) return {
+        if (e instanceof En) return {
             fieldPath: n.field.canonicalString(),
             increment: e.O
         };
-        throw g();
+        throw v();
     }(0, t)))), n.precondition.isNone || (e.currentDocument = function(t, n) {
         return void 0 !== n.updateTime ? {
             updateTime: qn(t, n.updateTime)
         } : void 0 !== n.exists ? {
             exists: n.exists
-        } : g();
+        } : v();
     }(t, n.precondition)), e;
 }
 
-function zn(t, n) {
+function Qn(t, n) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const e = {
         structuredQuery: {}
     }, r = n.path;
-    null !== n.collectionGroup ? (e.parent = kn(t, r), e.structuredQuery.from = [ {
+    null !== n.collectionGroup ? (e.parent = Un(t, r), e.structuredQuery.from = [ {
         collectionId: n.collectionGroup,
         allDescendants: !0
-    } ]) : (e.parent = kn(t, r.popLast()), e.structuredQuery.from = [ {
+    } ]) : (e.parent = Un(t, r.popLast()), e.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     const s = function(t) {
@@ -2853,36 +2865,36 @@ function zn(t, n) {
         // visible for testing
         function(t) {
             if ("==" /* EQUAL */ === t.op) {
-                if (jt(t.value)) return {
+                if (Mt(t.value)) return {
                     unaryFilter: {
-                        field: Yn(t.field),
+                        field: Hn(t.field),
                         op: "IS_NAN"
                     }
                 };
-                if (Ut(t.value)) return {
+                if (jt(t.value)) return {
                     unaryFilter: {
-                        field: Yn(t.field),
+                        field: Hn(t.field),
                         op: "IS_NULL"
                     }
                 };
             } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                if (jt(t.value)) return {
+                if (Mt(t.value)) return {
                     unaryFilter: {
-                        field: Yn(t.field),
+                        field: Hn(t.field),
                         op: "IS_NOT_NAN"
                     }
                 };
-                if (Ut(t.value)) return {
+                if (jt(t.value)) return {
                     unaryFilter: {
-                        field: Yn(t.field),
+                        field: Hn(t.field),
                         op: "IS_NOT_NULL"
                     }
                 };
             }
             return {
                 fieldFilter: {
-                    field: Yn(t.field),
-                    op: Wn(t.op),
+                    field: Hn(t.field),
+                    op: Yn(t.op),
                     value: t.value
                 }
             };
@@ -2902,52 +2914,52 @@ function zn(t, n) {
         // visible for testing
         function(t) {
             return {
-                field: Yn(t.field),
-                direction: Gn(t.dir)
+                field: Hn(t.field),
+                direction: Wn(t.dir)
             };
         }(t)));
     }(n.orderBy);
     i && (e.structuredQuery.orderBy = i);
     const o = function(t, n) {
-        return t.S || ct(n) ? n : {
+        return t.S || at(n) ? n : {
             value: n
         };
     }(t, n.limit);
-    return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = Qn(n.startAt)), 
-    n.endAt && (e.structuredQuery.endAt = Qn(n.endAt)), e;
+    return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = Gn(n.startAt)), 
+    n.endAt && (e.structuredQuery.endAt = Gn(n.endAt)), e;
 }
 
-function Qn(t) {
+function Gn(t) {
     return {
         before: t.before,
         values: t.position
     };
 }
 
-// visible for testing
-function Gn(t) {
-    return Nn[t];
-}
-
 // visible for testing
 function Wn(t) {
     return Dn[t];
 }
 
+// visible for testing
 function Yn(t) {
+    return $n[t];
+}
+
+function Hn(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Hn(t) {
+function Kn(t) {
     const n = [];
     return t.fields.forEach((t => n.push(t.canonicalString()))), {
         fieldPaths: n
     };
 }
 
-function Kn(t) {
+function Jn(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2967,8 +2979,8 @@ function Kn(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 Jn(t) {
-    return new $n(t, /* useProto3Json= */ !0);
+ */ function Xn(t) {
+    return new Fn(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -2996,7 +3008,7 @@ function Kn(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class Xn {
+class Zn {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3051,7 +3063,7 @@ class Xn {
         // honored as such).
         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)`), 
+                r > 0 && p("ExponentialBackoff", `Backing off for ${r} ms (base delay: ${this.j} ms, delay with jitter: ${n} ms, last attempt: ${e} ms ago)`), 
         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
@@ -3094,24 +3106,24 @@ class Xn {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class Zn extends class {} {
+class te extends class {} {
     constructor(t, n, e, r) {
         super(), this.authCredentials = t, this.appCheckCredentials = n, this.K = e, this.q = r, 
         this.J = !1;
     }
     X() {
-        if (this.J) throw new k(F, "The client has already been terminated.");
+        if (this.J) throw new U(S, "The client has already been terminated.");
     }
     /** 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());
+            throw "FirebaseError" === t.name ? (t.code === $ && (this.authCredentials.invalidateToken(), 
+            this.appCheckCredentials.invalidateToken()), t) : new U(A, 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());
+            throw "FirebaseError" === t.name ? (t.code === $ && (this.authCredentials.invalidateToken(), 
+            this.appCheckCredentials.invalidateToken()), t) : new U(A, t.toString());
         }));
     }
     terminate() {
@@ -3121,38 +3133,38 @@ class Zn extends class {} {
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function te(t, n) {
-    const e = b(t), r = Un(e.q) + "/documents", s = {
-        writes: n.map((t => Bn(e.q, t)))
+async function ne(t, n) {
+    const e = E(t), r = jn(e.q) + "/documents", s = {
+        writes: n.map((t => zn(e.q, t)))
     };
     await e.m("Commit", r, s);
 }
 
-async function ne(t, n) {
-    const e = b(t), r = Un(e.q) + "/documents", s = {
-        documents: n.map((t => Cn(e.q, t)))
+async function ee(t, n) {
+    const e = E(t), r = jn(e.q) + "/documents", s = {
+        documents: n.map((t => Ln(e.q, t)))
     }, i = await e.T("BatchGetDocuments", r, s), o = new Map;
     i.forEach((t => {
-        const n = Mn(e.q, t);
+        const n = Bn(e.q, t);
         o.set(n.key.toString(), n);
     }));
     const u = [];
     return n.forEach((t => {
         const n = o.get(t.toString());
-        v(!!n), u.push(n);
+        b(!!n), u.push(n);
     })), u;
 }
 
-async function ee(t, n) {
-    const e = b(t), r = zn(e.q, wn(n));
+async function re(t, n) {
+    const e = E(t), r = Qn(e.q, mn(n));
     return (await e.T("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, n, e) {
-        const r = Ln(t, n.name), s = xn(n.updateTime), i = new zt({
+        const r = kn(t, n.name), s = On(n.updateTime), i = new Qt({
             mapValue: {
                 fields: n.fields
             }
-        }), o = Qt.newFoundDocument(r, s, i);
+        }), o = Gt.newFoundDocument(r, s, i);
         return e && o.setHasCommittedMutations(), e ? o.setHasCommittedMutations() : o;
     }(e.q, t.document, void 0)));
 }
@@ -3172,7 +3184,7 @@ async function ee(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 re = new Map;
+ */ const se = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3183,17 +3195,17 @@ async function ee(t, n) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function se(t) {
-    if (t._terminated) throw new k(F, "The client has already been terminated.");
-    if (!re.has(t)) {
-        m("ComponentProvider", "Initializing Datastore");
+function ie(t) {
+    if (t._terminated) throw new U(S, "The client has already been terminated.");
+    if (!se.has(t)) {
+        p("ComponentProvider", "Initializing Datastore");
         const i = function(t) {
-            return new wt(t, fetch.bind(null));
+            return new mt(t, fetch.bind(null));
         }((n = t._databaseId, e = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
-        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);
+        new K(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Xn(t._databaseId), u = function(t, n, e, r) {
+            return new te(t, n, e, r);
         }(t._authCredentials, t._appCheckCredentials, i, o);
-        re.set(t, u);
+        se.set(t, u);
     }
     var n, e, r, s;
     /**
@@ -3211,7 +3223,7 @@ function se(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 re.get(t);
+ */    return se.get(t);
 }
 
 /**
@@ -3223,21 +3235,21 @@ function se(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 ie {
+class oe {
     constructor(t) {
         var n;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new k(A, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new U(P, "Can't provide ssl option if host option is not set");
             this.host = "firestore.googleapis.com", this.ssl = true;
         } 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 k(A, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new U(P, "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 k(A, `${t} and ${e} cannot be used together.`);
+            if (!0 === n && !0 === r) throw new U(P, `${t} and ${e} cannot be used together.`);
         }("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
     }
     isEqual(t) {
@@ -3265,18 +3277,18 @@ class ie {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class oe {
+ */ class ue {
     /** @hideconstructor */
     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 ie({}), 
-        this._settingsFrozen = !1, t instanceof K ? this._databaseId = t : (this._app = t, 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new oe({}), 
+        this._settingsFrozen = !1, t instanceof J ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
-            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new k(A, '"projectId" not provided in firebase.initializeApp.');
-            return new K(t.options.projectId);
+            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(P, '"projectId" not provided in firebase.initializeApp.');
+            return new J(t.options.projectId);
         }
         /**
  * Initializes a new instance of Cloud Firestore with the provided settings.
@@ -3294,7 +3306,7 @@ class ie {
      * The {@link @firebase/app#FirebaseApp} associated with this `Firestore` service
      * instance.
      */    get app() {
-        if (!this._app) throw new k(F, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+        if (!this._app) throw new U(S, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
         return this._app;
     }
     get _initialized() {
@@ -3304,21 +3316,21 @@ class ie {
         return void 0 !== this._terminateTask;
     }
     _setSettings(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;
+        if (this._settingsFrozen) throw new U(S, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
+        this._settings = new oe(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+            if (!t) return new B;
             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 G(n, t.sessionIndex || "0", t.iamToken || null);
+                                return b(!("object" != typeof n || null === n || !n.auth || !n.auth.getAuthHeaderValueForFirstParty)), 
+                new W(n, t.sessionIndex || "0", t.iamToken || null);
 
               case "provider":
                 return t.client;
 
               default:
-                throw new k(A, "makeAuthCredentialsProvider failed due to invalid credential type");
+                throw new U(P, "makeAuthCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }
@@ -3346,15 +3358,15 @@ class ie {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const n = re.get(t);
-            n && (m("ComponentProvider", "Removing Datastore"), re.delete(t), n.terminate());
+            const n = se.get(t);
+            n && (p("ComponentProvider", "Removing Datastore"), se.delete(t), n.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function ue(t, n) {
+function ce(t, n) {
     const e = _getProvider(t, "firestore/lite");
-    if (e.isInitialized()) throw new k(F, "Firestore can only be initialized once per app.");
+    if (e.isInitialized()) throw new U(S, "Firestore can only be initialized once per app.");
     return e.initialize({
         options: n
     });
@@ -3368,7 +3380,7 @@ function ue(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 ce(n = t()) {
+ */ function ae(n = t()) {
     return _getProvider(n, "firestore/lite").getImmediate();
 }
 
@@ -3384,24 +3396,24 @@ function ue(t, n) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function ae(t, n, e, r = {}) {
+ */ function he(t, n, e, r = {}) {
     var s;
-    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"), 
+    const i = (t = ut(t, ue))._getSettings();
+    if ("firestore.googleapis.com" !== i.host && i.host !== n && _("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, i), {
         host: `${n}:${e}`,
         ssl: !1
     })), r.mockUserToken) {
         let n, e;
-        if ("string" == typeof r.mockUserToken) n = r.mockUserToken, e = l.MOCK_USER; else {
+        if ("string" == typeof r.mockUserToken) n = r.mockUserToken, e = f.MOCK_USER; else {
             // Let createMockUserToken validate first (catches common mistakes like
             // 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);
+            n = h(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 k(A, "mockUserToken must contain 'sub' or 'user_id' field!");
-            e = new l(i);
+            if (!i) throw new U(P, "mockUserToken must contain 'sub' or 'user_id' field!");
+            e = new f(i);
         }
-        t._authCredentials = new B(new j(n, e));
+        t._authCredentials = new z(new M(n, e));
     }
 }
 
@@ -3424,8 +3436,8 @@ function ue(t, n) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function he(t) {
-    return t = ot(t, oe), n(t.app, "firestore/lite"), t._delete();
+ */ function le(t) {
+    return t = ut(t, ue), n(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3465,7 +3477,7 @@ function ue(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 le {
+class fe {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -3493,17 +3505,17 @@ class le {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new de(this.firestore, this.converter, this._key.path.popLast());
+        return new we(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new le(this.firestore, t, this._key);
+        return new fe(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 fe {
+ */ class de {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -3516,17 +3528,17 @@ class le {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new fe(this.firestore, t, this._query);
+        return new de(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 de extends fe {
+ */ class we extends de {
     /** @hideconstructor */
     constructor(t, n, e) {
-        super(t, n, new cn(e)), this._path = e, 
+        super(t, n, new an(e)), this._path = e, 
         /** The type of this Firestore reference. */
         this.type = "collection";
     }
@@ -3544,23 +3556,23 @@ class le {
      * subcollection. If this isn't a subcollection, the reference is null.
      */    get parent() {
         const t = this._path.popLast();
-        return t.isEmpty() ? null : new le(this.firestore, 
-        /* converter= */ null, new nt(t));
+        return t.isEmpty() ? null : new fe(this.firestore, 
+        /* converter= */ null, new et(t));
     }
     withConverter(t) {
-        return new de(this.firestore, t, this._path);
+        return new we(this.firestore, t, this._path);
     }
 }
 
-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);
+function me(t, n, ...e) {
+    if (t = l(t), rt("collection", "path", n), t instanceof ue) {
+        const r = Z.fromString(n, ...e);
+        return it(r), new we(t, /* converter= */ null, 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 st(r), new de(t.firestore, 
+        if (!(t instanceof fe || t instanceof we)) throw new U(P, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        const r = t._path.child(Z.fromString(n, ...e));
+        return it(r), new we(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -3577,32 +3589,32 @@ function we(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 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, 
+ */ function pe(t, n) {
+    if (t = ut(t, ue), rt("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new U(P, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new de(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 cn(X.emptyPath(), t);
+        return new an(Z.emptyPath(), t);
     }(n));
 }
 
-function pe(t, n, ...e) {
-    if (t = h(t), 
+function ye(t, n, ...e) {
+    if (t = l(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    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));
+    1 === arguments.length && (n = yt.P()), rt("doc", "path", n), t instanceof ue) {
+        const r = Z.fromString(n, ...e);
+        return st(r), new fe(t, 
+        /* converter= */ null, new et(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));
+        if (!(t instanceof fe || t instanceof we)) throw new U(P, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        const r = t._path.child(Z.fromString(n, ...e));
+        return st(r), new fe(t.firestore, t instanceof we ? t.converter : null, new et(r));
     }
 }
 
@@ -3613,8 +3625,8 @@ function pe(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 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);
+ */ function _e(t, n) {
+    return t = l(t), n = l(n), (t instanceof fe || t instanceof we) && (n instanceof fe || n instanceof we) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
 }
 
 /**
@@ -3625,8 +3637,8 @@ function pe(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 _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);
+ */ function ge(t, n) {
+    return t = l(t), n = l(n), t instanceof de && n instanceof de && (t.firestore === n.firestore && pn(t._query, n._query) && t.converter === n.converter);
 }
 
 /**
@@ -3652,7 +3664,7 @@ function pe(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 ge {
+ */ class ve {
     /**
      * 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.
@@ -3660,8 +3672,8 @@ function pe(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 k(A, "Invalid field name at argument $(i + 1). Field names must not be empty.");
-        this._internalPath = new tt(t);
+        for (let n = 0; n < t.length; ++n) if (0 === t[n].length) throw new U(P, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        this._internalPath = new nt(t);
     }
     /**
      * Returns true if this `FieldPath` is equal to the provided one.
@@ -3676,8 +3688,8 @@ function pe(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 ve() {
-    return new ge("__name__");
+ */ function be() {
+    return new ve("__name__");
 }
 
 /**
@@ -3698,7 +3710,7 @@ function pe(t, n, ...e) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class be {
+ */ class Ee {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -3710,9 +3722,9 @@ function pe(t, n, ...e) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new be(At.fromBase64String(t));
+            return new Ee(Pt.fromBase64String(t));
         } catch (t) {
-            throw new k(A, "Failed to construct data from Base64 string: " + t);
+            throw new U(P, "Failed to construct data from Base64 string: " + t);
         }
     }
     /**
@@ -3720,7 +3732,7 @@ function pe(t, n, ...e) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new be(At.fromUint8Array(t));
+        return new Ee(Pt.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3772,7 +3784,7 @@ function pe(t, n, ...e) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class Ee {
+ */ class Te {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -3804,7 +3816,7 @@ function pe(t, n, ...e) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ class Te {
+ */ class Ie {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3812,8 +3824,8 @@ function pe(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 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);
+        if (!isFinite(t) || t < -90 || t > 90) throw new U(P, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(n) || n < -180 || n > 180) throw new U(P, "Longitude must be a number between -180 and 180, but was: " + n);
         this._lat = t, this._long = n;
     }
     /**
@@ -3844,7 +3856,7 @@ function pe(t, n, ...e) {
      * Actually private to JS consumers of our API, so this function is prefixed
      * with an underscore.
      */    _compareTo(t) {
-        return yt(this._lat, t._lat) || yt(this._long, t._long);
+        return _t(this._lat, t._lat) || _t(this._long, t._long);
     }
 }
 
@@ -3863,29 +3875,29 @@ function pe(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 Ie = /^__.*__$/;
+ */ const Ae = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class Ae {
+/** The result of parsing document data (e.g. for a setData call). */ class Pe {
     constructor(t, n, e) {
         this.data = t, this.fieldMask = n, this.fieldTransforms = e;
     }
     toMutation(t, n) {
-        return null !== this.fieldMask ? new Pn(t, this.data, this.fieldMask, n, this.fieldTransforms) : new An(t, this.data, n, this.fieldTransforms);
+        return null !== this.fieldMask ? new Rn(t, this.data, this.fieldMask, n, this.fieldTransforms) : new Pn(t, this.data, n, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class Pe {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class Re {
     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 Pn(t, this.data, this.fieldMask, n, this.fieldTransforms);
+        return new Rn(t, this.data, this.fieldMask, n, this.fieldTransforms);
     }
 }
 
-function Re(t) {
+function Ve(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3899,11 +3911,11 @@ function Re(t) {
         return !1;
 
       default:
-        throw g();
+        throw v();
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class Ve {
+/** A "context" object passed around while parsing user data. */ class Ne {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3935,7 +3947,7 @@ function Re(t) {
         return this.settings.tt;
     }
     /** 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);
+        return new Ne(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
     et(t) {
         var n;
@@ -3962,7 +3974,7 @@ function Re(t) {
         });
     }
     ut(t) {
-        return Ye(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
+        return He(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)));
@@ -3974,52 +3986,52 @@ function Re(t) {
     }
     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 "__"');
+        if (Ve(this.tt) && Ae.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 Ne {
+ */ class De {
     constructor(t, n, e) {
-        this.databaseId = t, this.ignoreUndefinedProperties = n, this.q = e || Jn(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = n, this.q = e || Xn(t);
     }
     /** Creates a new top-level parse context. */    ht(t, n, e, r = !1) {
-        return new Ve({
+        return new Ne({
             tt: t,
             methodName: n,
             at: e,
-            path: tt.emptyPath(),
+            path: nt.emptyPath(),
             rt: !1,
             ct: r
         }, this.databaseId, this.q, this.ignoreUndefinedProperties);
     }
 }
 
-function De(t) {
-    const n = t._freezeSettings(), e = Jn(t._databaseId);
-    return new Ne(t._databaseId, !!n.ignoreUndefinedProperties, e);
+function $e(t) {
+    const n = t._freezeSettings(), e = Xn(t._databaseId);
+    return new De(t._databaseId, !!n.ignoreUndefinedProperties, e);
 }
 
-/** Parse document data from a set() call. */ function $e(t, n, e, r, s, i = {}) {
+/** Parse document data from a set() call. */ function Fe(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);
+    Qe("Data must be an object, but it was:", o, r);
+    const u = Be(r, o);
     let c, a;
-    if (i.merge) c = new Tt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
+    if (i.merge) c = new It(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
         const t = [];
         for (const r of i.mergeFields) {
-            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);
+            const s = Ge(n, r, e);
+            if (!o.contains(s)) throw new U(P, `Field '${s}' is specified in your field mask but missing from your input data.`);
+            Ke(t, s) || t.push(s);
         }
-        c = new Tt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
+        c = new It(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
     } else c = null, a = o.fieldTransforms;
-    return new Ae(new zt(u), c, a);
+    return new Pe(new Qt(u), c, a);
 }
 
-class Fe extends Ee {
+class Se extends Te {
     _toFieldTransform(t) {
         if (2 /* MergeSet */ !== t.tt) throw 1 /* Update */ === t.tt ? t.ut(`${this._methodName}() can only appear at the top level of your update data`) : t.ut(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
         // No transform to add for a delete, but we need to add it to our
@@ -4027,7 +4039,7 @@ class Fe extends Ee {
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof Fe;
+        return t instanceof Se;
     }
 }
 
@@ -4046,8 +4058,8 @@ class Fe extends Ee {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function Se(t, n, e) {
-    return new Ve({
+ */ function xe(t, n, e) {
+    return new Ne({
         tt: 3 /* Argument */ ,
         at: n.settings.at,
         methodName: t._methodName,
@@ -4055,23 +4067,23 @@ class Fe extends Ee {
     }, n.databaseId, n.q, n.ignoreUndefinedProperties);
 }
 
-class qe extends Ee {
+class qe extends Te {
     _toFieldTransform(t) {
-        return new En(t.path, new _n);
+        return new Tn(t.path, new gn);
     }
     isEqual(t) {
         return t instanceof qe;
     }
 }
 
-class xe extends Ee {
+class Oe extends Te {
     constructor(t, n) {
         super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        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);
+        const n = xe(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => Me(t, n))), r = new vn(e);
+        return new Tn(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4079,14 +4091,14 @@ class xe extends Ee {
     }
 }
 
-class Oe extends Ee {
+class Ce extends Te {
     constructor(t, n) {
         super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        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);
+        const n = xe(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => Me(t, n))), r = new bn(e);
+        return new Tn(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4094,13 +4106,13 @@ class Oe extends Ee {
     }
 }
 
-class Ce extends Ee {
+class Le extends Te {
     constructor(t, n) {
         super(t), this.ft = n;
     }
     _toFieldTransform(t) {
-        const n = new bn(t.q, pn(t.q, this.ft));
-        return new En(t.path, n);
+        const n = new En(t.q, yn(t.q, this.ft));
+        return new Tn(t.path, n);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4108,50 +4120,50 @@ class Ce extends Ee {
     }
 }
 
-/** Parse update data from an update() call. */ function Le(t, n, e, r) {
+/** Parse update data from an update() call. */ function ke(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);
+    Qe("Data must be an object, but it was:", s, r);
+    const i = [], o = Qt.empty();
+    Tt(r, ((t, r) => {
+        const u = Ye(n, t, e);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                r = h(r);
+                r = l(r);
         const c = s.it(u);
-        if (r instanceof Fe) 
+        if (r instanceof Se) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = je(r, c);
+            const t = Me(r, c);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
-    const u = new Tt(i);
-    return new Pe(o, u, s.fieldTransforms);
+    const u = new It(i);
+    return new Re(o, u, s.fieldTransforms);
 }
 
-/** 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();
+/** Parse update data from a list of field/value arguments. */ function Ue(t, n, e, r, s, i) {
+    const o = t.ht(1 /* Update */ , n, e), u = [ Ge(n, r, e) ], c = [ s ];
+    if (i.length % 2 != 0) throw new U(P, `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(Ge(n, i[t])), c.push(i[t + 1]);
+    const a = [], h = Qt.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 (!He(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!Ke(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);
+                e = l(e);
         const r = o.it(n);
-        if (e instanceof Fe) 
+        if (e instanceof Se) 
         // Add it to the field mask, but don't add anything to updateData.
         a.push(n); else {
-            const t = je(e, r);
-            null != t && (a.push(n), l.set(n, t));
+            const t = Me(e, r);
+            null != t && (a.push(n), h.set(n, t));
         }
     }
-    const f = new Tt(a);
-    return new Pe(l, f, o.fieldTransforms);
+    const f = new It(a);
+    return new Re(h, f, o.fieldTransforms);
 }
 
 /**
@@ -4160,8 +4172,8 @@ class Ce extends Ee {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function Ue(t, n, e, r = !1) {
-    return je(e, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
+ */ function je(t, n, e, r = !1) {
+    return Me(e, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
 }
 
 /**
@@ -4172,12 +4184,12 @@ class Ce extends Ee {
  * 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 je(t, n) {
-    if (Be(
+ */ function Me(t, n) {
+    if (ze(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = h(t))) return ze("Unsupported field value:", n, t), Me(t, n);
-    if (t instanceof Ee) 
+    t = l(t))) return Qe("Unsupported field value:", n, t), Be(t, n);
+    if (t instanceof Te) 
     // 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
@@ -4189,7 +4201,7 @@ class Ce extends Ee {
  */
     return function(t, n) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Re(n.tt)) throw n.ut(`${t._methodName}() can only be used with update() and set()`);
+        if (!Ve(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);
@@ -4219,7 +4231,7 @@ class Ce extends Ee {
             const e = [];
             let r = 0;
             for (const s of t) {
-                let t = je(s, n.ot(r));
+                let t = Me(s, n.ot(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4235,10 +4247,10 @@ class Ce extends Ee {
         }(t, n);
     }
     return function(t, n) {
-        if (null === (t = h(t))) return {
+        if (null === (t = l(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return pn(n.q, t);
+        if ("number" == typeof t) return yn(n.q, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4246,37 +4258,37 @@ class Ce extends Ee {
             stringValue: t
         };
         if (t instanceof Date) {
-            const e = gt.fromDate(t);
+            const e = vt.fromDate(t);
             return {
-                timestampValue: Fn(n.q, e)
+                timestampValue: Sn(n.q, e)
             };
         }
-        if (t instanceof gt) {
+        if (t instanceof vt) {
             // 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 gt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            const e = new vt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Fn(n.q, e)
+                timestampValue: Sn(n.q, e)
             };
         }
-        if (t instanceof Te) return {
+        if (t instanceof Ie) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof be) return {
-            bytesValue: Sn(n.q, t._byteString)
+        if (t instanceof Ee) return {
+            bytesValue: xn(n.q, t._byteString)
         };
-        if (t instanceof le) {
+        if (t instanceof fe) {
             const e = n.databaseId, r = t.firestore._databaseId;
             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: On(t.firestore._databaseId || n.databaseId, t._key.path)
+                referenceValue: Cn(t.firestore._databaseId || n.databaseId, t._key.path)
             };
         }
-        throw n.ut(`Unsupported field value: ${it(t)}`);
+        throw n.ut(`Unsupported field value: ${ot(t)}`);
     }
     /**
  * Checks whether an object looks like a JSON object that should be converted
@@ -4287,13 +4299,13 @@ class Ce extends Ee {
  */ (t, n);
 }
 
-function Me(t, n) {
+function Be(t, n) {
     const e = {};
     return !function(t) {
         for (const n in t) if (Object.prototype.hasOwnProperty.call(t, n)) return !1;
         return !0;
-    }(t) ? Et(t, ((t, r) => {
-        const s = je(r, n.et(t));
+    }(t) ? Tt(t, ((t, r) => {
+        const s = Me(r, n.et(t));
         null != s && (e[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -4305,35 +4317,35 @@ function Me(t, n) {
     };
 }
 
-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 ze(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof vt || t instanceof Ie || t instanceof Ee || t instanceof fe || t instanceof Te);
 }
 
-function ze(t, n, e) {
-    if (!Be(e) || !function(t) {
+function Qe(t, n, e) {
+    if (!ze(e) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(e)) {
-        const r = it(e);
+        const r = ot(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 Qe(t, n, e) {
+ */ function Ge(t, n, e) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    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, 
+    n = l(n)) instanceof ve) return n._internalPath;
+    if ("string" == typeof n) return Ye(t, n);
+    throw He("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 Ge = new RegExp("[~\\*/\\[\\]]");
+ */ const We = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4343,29 +4355,29 @@ function ze(t, n, e) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function We(t, n, e) {
-    if (n.search(Ge) >= 0) throw Ye(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function Ye(t, n, e) {
+    if (n.search(We) >= 0) throw He(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, e);
     try {
-        return new ge(...n.split("."))._internalPath;
+        return new ve(...n.split("."))._internalPath;
     } catch (r) {
-        throw Ye(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw He(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, e);
     }
 }
 
-function Ye(t, n, e, r, s) {
+function He(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 k(A, u + t + c);
+    c += ")"), new U(P, u + t + c);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function He(t, n) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Ke(t, n) {
     return t.some((t => t.isEqual(n)));
 }
 
@@ -4393,7 +4405,7 @@ function Ye(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 Ke {
+ */ class Je {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4409,7 +4421,7 @@ function Ye(t, n, e, r, s) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new le(this._firestore, this._converter, this._key);
+        return new fe(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -4429,7 +4441,7 @@ function Ye(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 Je(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new Xe(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4449,7 +4461,7 @@ function Ye(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(tr("DocumentSnapshot.get", t));
+            const n = this._document.data.field(nr("DocumentSnapshot.get", t));
             if (null !== n) return this._userDataWriter.convertValue(n);
         }
     }
@@ -4465,7 +4477,7 @@ function Ye(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 Je extends Ke {
+ */ class Xe extends Je {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -4483,7 +4495,7 @@ function Ye(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 Xe {
+ */ class Ze {
     /** @hideconstructor */
     constructor(t, n) {
         this._docs = n, this.query = t;
@@ -4514,14 +4526,14 @@ function Ye(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 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));
+ */ function tr(t, n) {
+    return t = l(t), n = l(n), t instanceof Je && n instanceof Je ? 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 Ze && n instanceof Ze && (ge(t.query, n.query) && gt(t.docs, n.docs, tr));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function tr(t, n) {
-    return "string" == typeof n ? We(t, n) : n instanceof ge ? n._internalPath : n._delegate._internalPath;
+ */ function nr(t, n) {
+    return "string" == typeof n ? Ye(t, n) : n instanceof ve ? n._internalPath : n._delegate._internalPath;
 }
 
 /**
@@ -4548,7 +4560,7 @@ function Ye(t, n, e, r, s) {
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
  */
-class nr {}
+class er {}
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4558,40 +4570,40 @@ class nr {}
  * @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 er(t, ...n) {
+ */ function rr(t, ...n) {
     for (const e of n) t = e._apply(t);
     return t;
 }
 
-class rr extends nr {
+class sr extends er {
     constructor(t, n, e) {
         super(), this.dt = t, this.wt = n, this.yt = e, this.type = "where";
     }
     _apply(t) {
-        const n = De(t.firestore), e = function(t, n, e, r, s, i, o) {
+        const n = $e(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 k(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 U(P, `Invalid Query. You can't perform '${i}' queries on FieldPath.documentId().`);
                 if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
-                    _r(o, i);
+                    gr(o, i);
                     const n = [];
-                    for (const e of o) n.push(yr(r, t, e));
+                    for (const e of o) n.push(_r(r, t, e));
                     u = {
                         arrayValue: {
                             values: n
                         }
                     };
-                } 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, 
+                } else u = _r(r, t, o);
+            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || gr(o, i), 
+            u = je(e, n, o, 
             /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
-            const c = Yt.create(s, i, u);
+            const c = Ht.create(s, i, u);
             return function(t, n) {
                 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 = fn(t);
+                    if (null !== e && !e.isEqual(n.field)) throw new U(P, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${e.toString()}' and '${n.field.toString()}'`);
+                    const r = ln(t);
+                    null !== r && vr(t, n.field, r);
                 }
                 const e = function(t, n) {
                     for (const e of t.filters) if (n.indexOf(e.op) >= 0) return e.op;
@@ -4632,12 +4644,12 @@ class rr extends nr {
                 }(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 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.`);
+                throw e === n.op ? new U(P, `Invalid query. You cannot use more than one '${n.op.toString()}' filter.`) : new U(P, `Invalid query. You cannot use '${n.op.toString()}' filters with '${e.toString()}' filters.`);
             }(t, c), c;
         }(t._query, "where", n, t.firestore._databaseId, this.dt, this.wt, this.yt);
-        return new fe(t.firestore, t.converter, function(t, n) {
+        return new de(t.firestore, t.converter, function(t, n) {
             const e = t.filters.concat([ n ]);
-            return new cn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), e, t.limit, t.limitType, t.startAt, t.endAt);
+            return new an(t.path, t.collectionGroup, t.explicitOrderBy.slice(), e, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }
 }
@@ -4652,25 +4664,25 @@ class rr extends nr {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function sr(t, n, e) {
-    const r = n, s = tr("where", t);
-    return new rr(s, r, e);
+ */ function ir(t, n, e) {
+    const r = n, s = nr("where", t);
+    return new sr(s, r, e);
 }
 
-class ir extends nr {
+class or extends er {
     constructor(t, n) {
         super(), this.dt = t, this._t = n, this.type = "orderBy";
     }
     _apply(t) {
         const n = function(t, 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);
+            if (null !== t.startAt) throw new U(P, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new U(P, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            const r = new on(n, e);
             return function(t, n) {
-                if (null === hn(t)) {
+                if (null === ln(t)) {
                     // This is the first order by. It must match any inequality.
-                    const e = ln(t);
-                    null !== e && gr(t, e, n.field);
+                    const e = fn(t);
+                    null !== e && vr(t, e, n.field);
                 }
             }(t, r), r;
         }
@@ -4685,10 +4697,10 @@ class ir extends nr {
  * of the query or if any of the fields in the order by are an uncommitted
  * server timestamp.
  */ (t._query, this.dt, this._t);
-        return new fe(t.firestore, t.converter, function(t, n) {
+        return new de(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 cn(t.path, t.collectionGroup, e, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new an(t.path, t.collectionGroup, e, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }
 }
@@ -4701,18 +4713,18 @@ class ir extends nr {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function or(t, n = "asc") {
-    const e = n, r = tr("orderBy", t);
-    return new ir(r, e);
+ */ function ur(t, n = "asc") {
+    const e = n, r = nr("orderBy", t);
+    return new or(r, e);
 }
 
-class ur extends nr {
+class cr extends er {
     constructor(t, n, e) {
         super(), this.type = t, this.gt = n, this.vt = e;
     }
     _apply(t) {
-        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);
+        return new de(t.firestore, t.converter, function(t, n, e) {
+            return new an(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), n, e, t.startAt, t.endAt);
         }(t._query, this.gt, this.vt));
     }
 }
@@ -4722,8 +4734,8 @@ class ur extends nr {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function cr(t) {
-    return ut("limit", t), new ur("limit", t, "F" /* First */);
+ */ function ar(t) {
+    return ct("limit", t), new cr("limit", t, "F" /* First */);
 }
 
 /**
@@ -4734,54 +4746,54 @@ class ur extends nr {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function ar(t) {
-    return ut("limitToLast", t), new ur("limitToLast", t, "L" /* Last */);
+ */ function hr(t) {
+    return ct("limitToLast", t), new cr("limitToLast", t, "L" /* Last */);
 }
 
-class hr extends nr {
+class lr extends er {
     constructor(t, n, e) {
         super(), this.type = t, this.bt = n, this.Et = e;
     }
     _apply(t) {
-        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);
+        const n = yr(t, this.type, this.bt, this.Et);
+        return new de(t.firestore, t.converter, function(t, n) {
+            return new an(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, n, t.endAt);
         }(t._query, n));
     }
 }
 
-function lr(...t) {
-    return new hr("startAt", t, /*before=*/ !0);
+function fr(...t) {
+    return new lr("startAt", t, /*before=*/ !0);
 }
 
-function fr(...t) {
-    return new hr("startAfter", t, 
+function dr(...t) {
+    return new lr("startAfter", t, 
     /*before=*/ !1);
 }
 
-class dr extends nr {
+class wr extends er {
     constructor(t, n, e) {
         super(), this.type = t, this.bt = n, this.Et = e;
     }
     _apply(t) {
-        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);
+        const n = yr(t, this.type, this.bt, this.Et);
+        return new de(t.firestore, t.converter, function(t, n) {
+            return new an(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, n);
         }(t._query, n));
     }
 }
 
-function wr(...t) {
-    return new dr("endBefore", t, /*before=*/ !0);
+function mr(...t) {
+    return new wr("endBefore", t, /*before=*/ !0);
 }
 
-function mr(...t) {
-    return new dr("endAt", t, /*before=*/ !1);
+function pr(...t) {
+    return new wr("endAt", t, /*before=*/ !1);
 }
 
-/** 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}().`);
+/** Helper function to create a bound from a document or fields */ function yr(t, n, e, r) {
+    if (e[0] = l(e[0]), e[0] instanceof Je) return function(t, n, e, r, s) {
+        if (!r) throw new U(V, `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
@@ -4790,42 +4802,42 @@ function mr(...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 dn(t)) if (e.field.isKeyField()) i.push(Lt(n, r.key)); else {
+                for (const e of wn(t)) if (e.field.isKeyField()) i.push(kt(n, r.key)); else {
             const t = r.data.field(e.field);
-            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 ($t(t)) throw new U(P, '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 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.`);
+                throw new U(P, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
             }
             i.push(t);
         }
-        return new rn(i, s);
+        return new sn(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 = De(t.firestore);
+        const s = $e(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 k(A, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
+            if (s.length > o.length) throw new U(P, `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 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));
+                    if ("string" != typeof c) throw new U(P, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
+                    if (!dn(t) && -1 !== c.indexOf("/")) throw new U(P, `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(Z.fromString(c));
+                    if (!et.isDocumentKey(e)) throw new U(P, `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 et(e);
+                    u.push(kt(n, s));
                 } else {
-                    const t = Ue(e, r, c);
+                    const t = je(e, r, c);
                     u.push(t);
                 }
             }
-            return new rn(u, i);
+            return new sn(u, i);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -4835,28 +4847,28 @@ function mr(...t) {
     }
 }
 
-function yr(t, n, e) {
-    if ("string" == typeof (e = h(e))) {
-        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));
+function _r(t, n, e) {
+    if ("string" == typeof (e = l(e))) {
+        if ("" === e) throw new U(P, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!dn(n) && -1 !== e.indexOf("/")) throw new U(P, `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(Z.fromString(e));
+        if (!et.isDocumentKey(r)) throw new U(P, `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 kt(t, new et(r));
     }
-    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)}.`);
+    if (e instanceof fe) return kt(t, e._key);
+    throw new U(P, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${ot(e)}.`);
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ 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 gr(t, n) {
+    if (!Array.isArray(t) || 0 === t.length) throw new U(P, `Invalid Query. A non-empty array is required for '${n.toString()}' filters.`);
+    if (t.length > 10) throw new U(P, `Invalid Query. '${n.toString()}' filters support a maximum of 10 elements in the value array.`);
 }
 
-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.`);
+function vr(t, n, e) {
+    if (!e.isEqual(n)) throw new U(P, `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.`);
 }
 
 /**
@@ -4906,7 +4918,7 @@ function gr(t, n, e) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function vr(t, n, e) {
+function br(t, n, e) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -4915,9 +4927,9 @@ function vr(t, n, e) {
     r;
 }
 
-class br extends class {
+class Er extends class {
     convertValue(t, n = "none") {
-        switch (St(t)) {
+        switch (xt(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -4925,7 +4937,7 @@ class br extends class {
             return t.booleanValue;
 
           case 2 /* NumberValue */ :
-            return Vt(t.integerValue || t.doubleValue);
+            return Nt(t.integerValue || t.doubleValue);
 
           case 3 /* TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -4937,7 +4949,7 @@ class br extends class {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(Nt(t.bytesValue));
+            return this.convertBytes(Dt(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -4952,17 +4964,17 @@ class br extends class {
             return this.convertObject(t.mapValue, n);
 
           default:
-            throw g();
+            throw v();
         }
     }
     convertObject(t, n) {
         const e = {};
-        return Et(t.fields, ((t, r) => {
+        return Tt(t.fields, ((t, r) => {
             e[t] = this.convertValue(r, n);
         })), e;
     }
     convertGeoPoint(t) {
-        return new Te(Vt(t.latitude), Vt(t.longitude));
+        return new Ie(Nt(t.latitude), Nt(t.longitude));
     }
     convertArray(t, n) {
         return (t.values || []).map((t => this.convertValue(t, n)));
@@ -4970,27 +4982,27 @@ class br extends class {
     convertServerTimestamp(t, n) {
         switch (n) {
           case "previous":
-            const e = $t(t);
+            const e = Ft(t);
             return null == e ? null : this.convertValue(e, n);
 
           case "estimate":
-            return this.convertTimestamp(Ft(t));
+            return this.convertTimestamp(St(t));
 
           default:
             return null;
         }
     }
     convertTimestamp(t) {
-        const n = Rt(t);
-        return new gt(n.seconds, n.nanos);
+        const n = Vt(t);
+        return new vt(n.seconds, n.nanos);
     }
     convertDocumentKey(t, n) {
-        const e = X.fromString(t);
-        v(Kn(e));
-        const r = new K(e.get(1), e.get(3)), s = new nt(e.popFirst(5));
+        const e = Z.fromString(t);
+        b(Jn(e));
+        const r = new J(e.get(1), e.get(3)), s = new et(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.`), 
+        y(`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.`), 
         s;
     }
 } {
@@ -4998,11 +5010,11 @@ class br extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new be(t);
+        return new Ee(t);
     }
     convertReference(t) {
         const n = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new le(this.firestore, /* converter= */ null, n);
+        return new fe(this.firestore, /* converter= */ null, n);
     }
 }
 
@@ -5018,12 +5030,12 @@ class br extends class {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ 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);
+ */ function Tr(t) {
+    const n = ie((t = ut(t, fe)).firestore), e = new Er(t.firestore);
+    return ee(n, [ t._key ]).then((n => {
+        b(1 === n.length);
         const r = n[0];
-        return new Ke(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new Je(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5038,33 +5050,33 @@ class br extends class {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function Tr(t) {
+ */ function Ir(t) {
     !function(t) {
-        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) && 
+        if (hn(t) && 0 === t.explicitOrderBy.length) throw new U(O, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = ut(t, de))._query);
+    const n = ie(t.firestore), e = new Er(t.firestore);
+    return re(n, t._query).then((n => {
+        const r = n.map((n => new Xe(t.firestore, e, n.key, n, t.converter)));
+        return hn(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 Xe(t, r);
+        r.reverse(), new Ze(t, r);
     }));
 }
 
-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 Ar(t, n, e) {
+    const r = br((t = ut(t, fe)).converter, n, e), s = Fe($e(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
+    return ne(ie(t.firestore), [ s.toMutation(t._key, In.none()) ]);
 }
 
-function Ar(t, n, e, ...r) {
-    const s = De((t = ot(t, le)).firestore);
+function Pr(t, n, e, ...r) {
+    const s = $e((t = ut(t, fe)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    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)) ]);
+    i = "string" == typeof (n = l(n)) || n instanceof ve ? Ue(s, "updateDoc", t._key, n, e, r) : ke(s, "updateDoc", t._key, n);
+    return ne(ie(t.firestore), [ i.toMutation(t._key, In.exists(!0)) ]);
 }
 
 /**
@@ -5078,8 +5090,8 @@ function Ar(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 Pr(t) {
-    return te(se((t = ot(t, le)).firestore), [ new Rn(t._key, Tn.none()) ]);
+ */ function Rr(t) {
+    return ne(ie((t = ut(t, fe)).firestore), [ new Vn(t._key, In.none()) ]);
 }
 
 /**
@@ -5093,11 +5105,12 @@ function Ar(t, n, e, ...r) {
  *
  * @param reference - A reference to the collection to add this document to.
  * @param data - An Object containing the data for the new document.
+ * @throws Error - If the provided input is not a valid Firestore document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function 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));
+ */ function Vr(t, n) {
+    const e = ye(t = ut(t, we)), r = br(t.converter, n), s = Fe($e(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
+    return ne(ie(t.firestore), [ s.toMutation(e._key, In.exists(!1)) ]).then((() => e));
 }
 
 /**
@@ -5119,14 +5132,14 @@ function Ar(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 Vr() {
-    return new Fe("deleteField");
+ */ function Nr() {
+    return new Se("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 Nr() {
+ */ function Dr() {
     return new qe("serverTimestamp");
 }
 
@@ -5141,10 +5154,10 @@ function Ar(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 Dr(...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 xe("arrayUnion", t);
+    return new Oe("arrayUnion", t);
 }
 
 /**
@@ -5157,10 +5170,10 @@ function Ar(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 $r(...t) {
+ */ function Fr(...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 Oe("arrayRemove", t);
+    return new Ce("arrayRemove", t);
 }
 
 /**
@@ -5181,8 +5194,8 @@ function Ar(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 Fr(t) {
-    return new Ce("increment", t);
+ */ function Sr(t) {
+    return new Le("increment", t);
 }
 
 /**
@@ -5208,16 +5221,16 @@ function Ar(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 Sr {
+ */ class xr {
     /** @hideconstructor */
     constructor(t, n) {
         this._firestore = t, this._commitHandler = n, this._mutations = [], this._committed = !1, 
-        this._dataReader = De(t);
+        this._dataReader = $e(t);
     }
     set(t, n, e) {
         this._verifyNotCommitted();
-        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;
+        const r = qr(t, this._firestore), s = br(r.converter, n, e), i = Fe(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
+        return this._mutations.push(i.toMutation(r._key, In.none())), this;
     }
     update(t, n, e, ...r) {
         this._verifyNotCommitted();
@@ -5225,8 +5238,8 @@ function Ar(t, n, e, ...r) {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        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;
+        return i = "string" == typeof (n = l(n)) || n instanceof ve ? Ue(this._dataReader, "WriteBatch.update", s._key, n, e, r) : ke(this._dataReader, "WriteBatch.update", s._key, n), 
+        this._mutations.push(i.toMutation(s._key, In.exists(!0))), this;
     }
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -5236,7 +5249,7 @@ function Ar(t, n, e, ...r) {
      */    delete(t) {
         this._verifyNotCommitted();
         const n = qr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Rn(n._key, Tn.none())), this;
+        return this._mutations = this._mutations.concat(new Vn(n._key, In.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5253,12 +5266,12 @@ function Ar(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 k(F, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new U(S, "A write batch can no longer be used after commit() has been called.");
     }
 }
 
 function qr(t, n) {
-    if ((t = h(t)).firestore !== n) throw new k(A, "Provided document reference is from a different Firestore instance.");
+    if ((t = l(t)).firestore !== n) throw new U(P, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -5274,9 +5287,9 @@ function qr(t, n) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function xr(t) {
-    const n = se(t = ot(t, oe));
-    return new Sr(t, (t => te(n, t)));
+ */ function Or(t) {
+    const n = ie(t = ut(t, ue));
+    return new xr(t, (t => ne(n, t)));
 }
 
 /**
@@ -5298,7 +5311,7 @@ function qr(t, n) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ class Or {
+ */ class Cr {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5317,8 +5330,8 @@ function qr(t, n) {
         this.writtenDocs = new Set;
     }
     async lookup(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);
+        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(P, "Firestore transactions require all reads to be executed before all writes.");
+        const n = await ee(this.datastore, t);
         return n.forEach((t => this.recordVersion(t))), n;
     }
     set(t, n) {
@@ -5333,7 +5346,7 @@ function qr(t, n) {
         this.writtenDocs.add(t.toString());
     }
     delete(t) {
-        this.write(new Rn(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Vn(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }
     async commit() {
         if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
@@ -5345,22 +5358,22 @@ function qr(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 = nt.fromPath(n);
-            this.mutations.push(new Vn(e, this.precondition(e)));
-        })), await te(this.datastore, this.mutations), this.committed = !0;
+            const e = et.fromPath(n);
+            this.mutations.push(new Nn(e, this.precondition(e)));
+        })), await ne(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let n;
         if (t.isFoundDocument()) n = t.version; else {
-            if (!t.isNoDocument()) throw g();
+            if (!t.isNoDocument()) throw v();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
-            n = vt.min();
+            n = bt.min();
         }
         const e = this.readVersions.get(t.key.toString());
         if (e) {
             if (!n.isEqual(e)) 
             // This transaction will fail no matter what.
-            throw new k(S, "Document version changed between two reads.");
+            throw new U(x, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), n);
     }
     /**
@@ -5368,7 +5381,7 @@ function qr(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 ? Tn.updateTime(n) : Tn.none();
+        return !this.writtenDocs.has(t.toString()) && n ? In.updateTime(n) : In.none();
     }
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5377,7 +5390,7 @@ function qr(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(vt.min())) 
+            if (n.isEqual(bt.min())) 
             // The document doesn't exist, so fail the transaction.
             // This has to be validated locally because you can't send a
             // precondition that a document does not exist without changing the
@@ -5387,13 +5400,13 @@ function qr(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 k(A, "Can't update a document that doesn't exist.");
+            throw new U(P, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return Tn.updateTime(n);
+                        return In.updateTime(n);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-        return Tn.exists(!0);
+        return In.exists(!0);
     }
     write(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
@@ -5421,17 +5434,17 @@ function qr(t, n) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class Cr {
+class Lr {
     constructor(t, n, e, r) {
         this.asyncQueue = t, this.datastore = n, this.updateFunction = e, this.deferred = r, 
-        this.Tt = 5, this.It = new Xn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.Tt = 5, this.It = new Zn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
         this.Tt -= 1, this.At();
     }
     At() {
         this.It.W((async () => {
-            const t = new Or(this.datastore), n = this.Pt(t);
+            const t = new Cr(this.datastore), n = this.Pt(t);
             n && n.then((n => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(n);
@@ -5446,7 +5459,7 @@ class Cr {
     Pt(t) {
         try {
             const n = this.updateFunction(t);
-            return !ct(n) && n.catch && n.then ? n : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !at(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.
@@ -5472,31 +5485,31 @@ class Cr {
             function(t) {
                 switch (t) {
                   default:
-                    return g();
+                    return v();
 
-                  case T:
                   case I:
-                  case P:
-                  case $:
-                  case O:
+                  case A:
+                  case R:
+                  case F:
                   case C:
+                  case L:
  // Unauthenticated means something went wrong with our token and we need
                     // to retry with new credentials which will happen automatically.
-                                      case D:
+                                      case $:
                     return !1;
 
-                  case A:
-                  case R:
+                  case P:
                   case V:
                   case N:
-                  case F:
+                  case D:
+                  case S:
  // Aborted might be retried in some scenarios, but that is dependant on
                     // the context and should handled individually by the calling code.
                     // See https://cloud.google.com/apis/design/errors.
-                                      case S:
+                                      case x:
                   case q:
-                  case x:
-                  case L:
+                  case O:
+                  case k:
                     return !0;
                 }
             }(n);
@@ -5521,7 +5534,7 @@ class Cr {
  * 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 Lr() {
+/** The Platform's 'document' implementation or null if not available. */ function kr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5553,10 +5566,10 @@ class Cr {
  * 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 kr {
+ */ class Ur {
     constructor(t, n, e, r, s) {
         this.asyncQueue = t, this.timerId = n, this.targetTimeMs = e, this.op = r, this.removalCallback = s, 
-        this.deferred = new U, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
+        this.deferred = new j, 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.
@@ -5576,7 +5589,7 @@ class Cr {
      *   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 kr(t, n, i, r, s);
+        const i = Date.now() + e, o = new Ur(t, n, i, r, s);
         return o.start(e), o;
     }
     /**
@@ -5598,7 +5611,7 @@ class Cr {
      * 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 k(T, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new U(I, "Operation cancelled" + (t ? ": " + t : ""))));
     }
     handleDelayElapsed() {
         this.asyncQueue.enqueueAndForget((() => null !== this.timerHandle ? (this.clearTimeout(), 
@@ -5625,7 +5638,7 @@ class Cr {
  * 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 Ur {
+ */ class jr {
     constructor() {
         // The last promise in the queue.
         this.Nt = Promise.resolve(), 
@@ -5642,21 +5655,21 @@ class Cr {
         this.St = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.qt = !1, 
-        // Enabled during shutdown on Safari to prevent future access to IndexedDB.
         this.xt = !1, 
+        // Enabled during shutdown on Safari to prevent future access to IndexedDB.
+        this.qt = !1, 
         // List of TimerIds to fast-forward delays for.
         this.Ot = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new Xn(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new Zn(this, "async_queue_retry" /* AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
         this.Ct = () => {
-            const t = Lr();
-            t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
+            const t = kr();
+            t && p("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
         };
-        const t = Lr();
+        const t = kr();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ct);
     }
     get isShuttingDown() {
@@ -5676,8 +5689,8 @@ class Cr {
     }
     enterRestrictedMode(t) {
         if (!this.$t) {
-            this.$t = !0, this.xt = t || !1;
-            const n = Lr();
+            this.$t = !0, this.qt = t || !1;
+            const n = kr();
             n && "function" == typeof n.removeEventListener && n.removeEventListener("visibilitychange", this.Ct);
         }
     }
@@ -5688,8 +5701,8 @@ class Cr {
         // 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 U;
-        return this.kt((() => this.$t && this.xt ? Promise.resolve() : (t().then(n.resolve, n.reject), 
+                const n = new j;
+        return this.kt((() => this.$t && this.qt ? Promise.resolve() : (t().then(n.resolve, n.reject), 
         n.promise))).then((() => n.promise));
     }
     enqueueRetryable(t) {
@@ -5743,7 +5756,7 @@ class Cr {
  * limitations under the License.
  */ (t)) throw t;
  // Failure will be handled by AsyncQueue
-                                m("AsyncQueue", "Operation failed with retryable error: " + t);
+                                p("AsyncQueue", "Operation failed with retryable error: " + t);
             }
             this.Dt.length > 0 && 
             // If there are additional operations, we re-schedule `retryNextOp()`.
@@ -5760,8 +5773,8 @@ class Cr {
         }
     }
     kt(t) {
-        const n = this.Nt.then((() => (this.qt = !0, t().catch((t => {
-            this.St = t, this.qt = !1;
+        const n = this.Nt.then((() => (this.xt = !0, t().catch((t => {
+            this.St = t, this.xt = !1;
             const n = 
             /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -5801,19 +5814,19 @@ class Cr {
             // Re-throw the error so that this.tail becomes a rejected Promise and
             // 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.qt = !1, t))))));
+            throw y("INTERNAL UNHANDLED ERROR: ", n), t;
+        })).then((t => (this.xt = !1, t))))));
         return this.Nt = n, n;
     }
     enqueueAfterDelay(t, n, e) {
         this.Lt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ot.indexOf(t) > -1 && (n = 0);
-        const r = kr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
+        const r = Ur.createAndSchedule(this, t, n, e, (t => this.jt(t)));
         return this.Ft.push(r), r;
     }
     Lt() {
-        this.St && g();
+        this.St && v();
     }
     verifyOperationInProgress() {}
     /**
@@ -5863,10 +5876,10 @@ class Cr {
     }
 }
 
-class jr {
+class Mr {
     /** @hideconstructor */
     constructor(t, n) {
-        this._firestore = t, this._transaction = n, this._dataReader = De(t);
+        this._firestore = t, this._transaction = n, this._dataReader = $e(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -5874,17 +5887,17 @@ class jr {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const n = qr(t, this._firestore), e = new br(this._firestore);
+        const n = qr(t, this._firestore), e = new Er(this._firestore);
         return this._transaction.lookup([ n._key ]).then((t => {
-            if (!t || 1 !== t.length) return g();
+            if (!t || 1 !== t.length) return v();
             const r = t[0];
-            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();
+            if (r.isFoundDocument()) return new Je(this._firestore, e, r.key, r, n.converter);
+            if (r.isNoDocument()) return new Je(this._firestore, e, n._key, null, n.converter);
+            throw v();
         }));
     }
     set(t, n, 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);
+        const r = qr(t, this._firestore), s = br(r.converter, n, e), i = Fe(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, e);
         return this._transaction.set(r._key, i), this;
     }
     update(t, n, e, ...r) {
@@ -5892,7 +5905,7 @@ class jr {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        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), 
+        return i = "string" == typeof (n = l(n)) || n instanceof ve ? Ue(this._dataReader, "Transaction.update", s._key, n, e, r) : ke(this._dataReader, "Transaction.update", s._key, n), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -5922,9 +5935,9 @@ class jr {
  * (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 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;
+ */ function Br(t, n) {
+    const e = ie(t = ut(t, ue)), r = new j;
+    return new Lr(new jr, e, (e => n(new Mr(t, e))), r).run(), r.promise;
 }
 
 /**
@@ -5935,13 +5948,13 @@ class jr {
  * directly to the backend, and `onSnapshot()` APIs are not supported.
  * @packageDocumentation
  */ !function(t) {
-    f = t;
+    d = t;
 }(`${s}_lite`), e(new i("firestore/lite", ((t, {options: n}) => {
-    const e = t.getProvider("app").getImmediate(), r = new oe(e, new z(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
+    const e = t.getProvider("app").getImmediate(), r = new ue(e, new Q(t.getProvider("auth-internal")), new H(t.getProvider("app-check-internal")));
     return n && r._setSettings(n), r;
 }), "PUBLIC")), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-r("firestore-lite", "3.4.1", "rn"), r("firestore-lite", "3.4.1", "esm2017");
+r("firestore-lite", "3.4.2-202205224240", "rn"), r("firestore-lite", "3.4.2-202205224240", "esm2017");
 
-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 };
+export { Ee as Bytes, we as CollectionReference, fe as DocumentReference, Je as DocumentSnapshot, ve as FieldPath, Te as FieldValue, ue as Firestore, U as FirestoreError, Ie as GeoPoint, de as Query, er as QueryConstraint, Xe as QueryDocumentSnapshot, Ze as QuerySnapshot, vt as Timestamp, Mr as Transaction, xr as WriteBatch, Vr as addDoc, Fr as arrayRemove, $r as arrayUnion, me as collection, pe as collectionGroup, he as connectFirestoreEmulator, Rr as deleteDoc, Nr as deleteField, ye as doc, be as documentId, pr as endAt, mr as endBefore, Tr as getDoc, Ir as getDocs, ae as getFirestore, Sr as increment, ce as initializeFirestore, ar as limit, hr as limitToLast, ur as orderBy, rr as query, ge as queryEqual, _e as refEqual, Br as runTransaction, Dr as serverTimestamp, Ar as setDoc, m as setLogLevel, tr as snapshotEqual, dr as startAfter, fr as startAt, le as terminate, Pr as updateDoc, ir as where, Or as writeBatch };
 //# sourceMappingURL=index.rn.esm2017.js.map