@firebase/firestore 3.4.0 → 3.4.1-canary.0b385f18c

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

@@ -1,7 +1,7 @@
 import { _registerComponent, registerVersion, _getProvider, getApp, _removeServiceInstance, SDK_VERSION } from '@firebase/app';
 import { Component } from '@firebase/component';
 import { Logger, LogLevel } from '@firebase/logger';
-import { createMockUserToken, getModularInstance } from '@firebase/util';
+import { FirebaseError, createMockUserToken, getModularInstance } from '@firebase/util';
 
 /**
  * @license
@@ -23,7 +23,7 @@ import { createMockUserToken, getModularInstance } from '@firebase/util';
  * Simple wrapper around a nullable UID. Mostly exists to make code more
  * readable.
  */
-class h {
+class l {
     constructor(t) {
         this.uid = t;
     }
@@ -41,11 +41,11 @@ class h {
     }
 }
 
-/** A user with a null UID. */ h.UNAUTHENTICATED = new h(null), 
+/** A user with a null UID. */ l.UNAUTHENTICATED = new l(null), 
 // TODO(mikelehen): Look into getting a proper uid-equivalent for
 // non-FirebaseAuth providers.
-h.GOOGLE_CREDENTIALS = new h("google-credentials-uid"), h.FIRST_PARTY = new h("first-party-uid"), 
-h.MOCK_USER = new h("mock-user");
+l.GOOGLE_CREDENTIALS = new l("google-credentials-uid"), l.FIRST_PARTY = new l("first-party-uid"), 
+l.MOCK_USER = new l("mock-user");
 
 /**
  * @license
@@ -63,7 +63,7 @@ h.MOCK_USER = new h("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let l = "9.6.0";
+let f = "9.6.1-canary.0b385f18c";
 
 /**
  * @license
@@ -81,7 +81,7 @@ let l = "9.6.0";
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const f = new Logger("@firebase/firestore");
+const d = new Logger("@firebase/firestore");
 
 /**
  * Sets the verbosity of Cloud Firestore logs (debug, error, or silent).
@@ -95,36 +95,36 @@ const f = new Logger("@firebase/firestore");
  *     <li>`error` to log errors only.</li>
  *     <li><code>`silent` to turn off logging.</li>
  *   </ul>
- */ function d(t) {
-    f.setLogLevel(t);
+ */ function w(t) {
+    d.setLogLevel(t);
 }
 
-function w(t, ...n) {
-    if (f.logLevel <= LogLevel.DEBUG) {
-        const e = n.map(y);
-        f.debug(`Firestore (${l}): ${t}`, ...e);
+function m(t, ...n) {
+    if (d.logLevel <= LogLevel.DEBUG) {
+        const e = n.map(_);
+        d.debug(`Firestore (${f}): ${t}`, ...e);
     }
 }
 
-function m(t, ...n) {
-    if (f.logLevel <= LogLevel.ERROR) {
-        const e = n.map(y);
-        f.error(`Firestore (${l}): ${t}`, ...e);
+function p(t, ...n) {
+    if (d.logLevel <= LogLevel.ERROR) {
+        const e = n.map(_);
+        d.error(`Firestore (${f}): ${t}`, ...e);
     }
 }
 
 /**
  * @internal
- */ function p(t, ...n) {
-    if (f.logLevel <= LogLevel.WARN) {
-        const e = n.map(y);
-        f.warn(`Firestore (${l}): ${t}`, ...e);
+ */ function y(t, ...n) {
+    if (d.logLevel <= LogLevel.WARN) {
+        const e = n.map(_);
+        d.warn(`Firestore (${f}): ${t}`, ...e);
     }
 }
 
 /**
  * Converts an additional log parameter to a string representation.
- */ function y(t) {
+ */ function _(t) {
     if ("string" == typeof t) return t;
     try {
         return n = t, JSON.stringify(n);
@@ -175,14 +175,14 @@ function m(t, ...n) {
  * Returns `never` and can be used in expressions:
  * @example
  * let futureVar = fail('not implemented yet');
- */ function _(t = "Unexpected state") {
+ */ function g(t = "Unexpected state") {
     // Log the failure in addition to throw an exception, just in case the
     // exception is swallowed.
-    const n = `FIRESTORE (${l}) INTERNAL ASSERTION FAILED: ` + t;
+    const n = `FIRESTORE (${f}) 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 m(n), new Error(n);
+    throw p(n), new Error(n);
 }
 
 /**
@@ -190,14 +190,14 @@ function m(t, ...n) {
  * given message if it did.
  *
  * Messages are stripped in production builds.
- */ function g(t, n) {
-    t || _();
+ */ function b(t, n) {
+    t || g();
 }
 
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function b(t, 
+ */ function v(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 n) {
     return t;
@@ -218,9 +218,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 v = "ok", E = "cancelled", T = "unknown", I = "invalid-argument", A = "deadline-exceeded", P = "not-found", R = "already-exists", V = "permission-denied", D = "unauthenticated", N = "resource-exhausted", $ = "failed-precondition", F = "aborted", S = "out-of-range", q = "unimplemented", x = "internal", O = "unavailable", C = "data-loss";
+ */ const E = "ok", T = "cancelled", I = "unknown", A = "invalid-argument", P = "deadline-exceeded", R = "not-found", V = "already-exists", D = "permission-denied", N = "unauthenticated", $ = "resource-exhausted", F = "failed-precondition", S = "aborted", x = "out-of-range", q = "unimplemented", O = "internal", C = "unavailable", L = "data-loss";
 
-/** An error returned by a Firestore operation. */ class L extends Error {
+/** An error returned by a Firestore operation. */ class U extends FirebaseError {
     /** @hideconstructor */
     constructor(
     /**
@@ -231,9 +231,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.
@@ -256,7 +254,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 k {
     constructor() {
         this.promise = new Promise(((t, n) => {
             this.resolve = t, this.reject = n;
@@ -279,7 +277,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 k {
+ */ class j {
     constructor(t, n) {
         this.user = n, this.type = "OAuth", this.headers = new Map, this.headers.set("Authorization", `Bearer ${t}`);
     }
@@ -288,14 +286,14 @@ n) {
 /**
  * A CredentialsProvider that always yields an empty token.
  * @internal
- */ class j {
+ */ class M {
     getToken() {
         return Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, n) {
         // Fire with initial user.
-        t.enqueueRetryable((() => n(h.UNAUTHENTICATED)));
+        t.enqueueRetryable((() => n(l.UNAUTHENTICATED)));
     }
     shutdown() {}
 }
@@ -303,7 +301,7 @@ n) {
 /**
  * A CredentialsProvider that always returns a constant token. Used for
  * emulator token mocking.
- */ class M {
+ */ class B {
     constructor(t) {
         this.token = t, 
         /**
@@ -327,15 +325,15 @@ n) {
     }
 }
 
-/** Credential provider for the Lite SDK. */ class B {
+/** Credential provider for the Lite SDK. */ class z {
     constructor(t) {
         this.auth = null, t.onInit((t => {
             this.auth = t;
         }));
     }
     getToken() {
-        return this.auth ? this.auth.getToken().then((t => t ? (g("string" == typeof t.accessToken), 
-        new k(t.accessToken, new h(this.auth.getUid()))) : null)) : Promise.resolve(null);
+        return this.auth ? this.auth.getToken().then((t => t ? (b("string" == typeof t.accessToken), 
+        new j(t.accessToken, new l(this.auth.getUid()))) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, n) {}
@@ -348,9 +346,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 z {
+ */ class G {
     constructor(t, n, e) {
-        this.type = "FirstParty", this.user = h.FIRST_PARTY, this.headers = new Map, this.headers.set("X-Goog-AuthUser", n);
+        this.type = "FirstParty", this.user = l.FIRST_PARTY, this.headers = new Map, this.headers.set("X-Goog-AuthUser", n);
         const r = t.auth.getAuthHeaderValueForFirstParty([]);
         r && this.headers.set("Authorization", r), e && this.headers.set("X-Goog-Iam-Authorization-Token", e);
     }
@@ -360,36 +358,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 Q {
     constructor(t, n, e) {
         this.t = t, this.i = n, this.o = e;
     }
     getToken() {
-        return Promise.resolve(new z(this.t, this.i, this.o));
+        return Promise.resolve(new G(this.t, this.i, this.o));
     }
     start(t, n) {
         // Fire with initial uid.
-        t.enqueueRetryable((() => n(h.FIRST_PARTY)));
+        t.enqueueRetryable((() => n(l.FIRST_PARTY)));
     }
     shutdown() {}
     invalidateToken() {}
 }
 
-class Q {
+class W {
     constructor(t) {
         this.value = t, this.type = "AppCheck", this.headers = new Map, t && t.length > 0 && this.headers.set("x-firebase-appcheck", this.value);
     }
 }
 
-/** AppCheck token provider for the Lite SDK. */ class W {
+/** AppCheck token provider for the Lite SDK. */ class Y {
     constructor(t) {
         this.u = t, this.appCheck = null, t.onInit((t => {
             this.appCheck = t;
         }));
     }
     getToken() {
-        return this.appCheck ? this.appCheck.getToken().then((t => t ? (g("string" == typeof t.token), 
-        new Q(t.token)) : null)) : Promise.resolve(null);
+        return this.appCheck ? this.appCheck.getToken().then((t => t ? (b("string" == typeof t.token), 
+        new W(t.token)) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, n) {}
@@ -416,7 +414,7 @@ class Q {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-class Y {
+class H {
     /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -445,7 +443,7 @@ class Y {
  * Represents the database ID a Firestore client is associated with.
  * @internal
  */
-class H {
+class K {
     constructor(t, n) {
         this.projectId = t, this.database = n || "(default)";
     }
@@ -453,7 +451,7 @@ class H {
         return "(default)" === this.database;
     }
     isEqual(t) {
-        return t instanceof H && t.projectId === this.projectId && t.database === this.database;
+        return t instanceof K && t.projectId === this.projectId && t.database === this.database;
     }
 }
 
@@ -476,20 +474,20 @@ class H {
 /**
  * Path represents an ordered sequence of string segments.
  */
-class K {
+class J {
     constructor(t, n, e) {
-        void 0 === n ? n = 0 : n > t.length && _(), void 0 === e ? e = t.length - n : e > t.length - n && _(), 
+        void 0 === n ? n = 0 : n > t.length && g(), void 0 === e ? e = t.length - n : e > t.length - n && g(), 
         this.segments = t, this.offset = n, this.len = e;
     }
     get length() {
         return this.len;
     }
     isEqual(t) {
-        return 0 === K.comparator(this, t);
+        return 0 === J.comparator(this, t);
     }
     child(t) {
         const n = this.segments.slice(this.offset, this.limit());
-        return t instanceof K ? t.forEach((t => {
+        return t instanceof J ? t.forEach((t => {
             n.push(t);
         })) : n.push(t), this.construct(n);
     }
@@ -546,9 +544,9 @@ class K {
  * within Firestore.
  *
  * @internal
- */ class J extends K {
+ */ class X extends J {
     construct(t, n, e) {
-        return new J(t, n, e);
+        return new X(t, n, e);
     }
     canonicalString() {
         // NOTE: The client is ignorant of any path segments containing escape
@@ -569,35 +567,35 @@ class K {
         // for legacy reasons and should not be used frequently).
         const n = [];
         for (const e of t) {
-            if (e.indexOf("//") >= 0) throw new L(I, `Invalid segment (${e}). Paths must not contain // in them.`);
+            if (e.indexOf("//") >= 0) throw new U(A, `Invalid segment (${e}). Paths must not contain // in them.`);
             // Strip leading and traling slashed.
                         n.push(...e.split("/").filter((t => t.length > 0)));
         }
-        return new J(n);
+        return new X(n);
     }
     static emptyPath() {
-        return new J([]);
+        return new X([]);
     }
 }
 
-const X = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
+const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
 
 /**
  * A dot-separated path for navigating sub-objects within a document.
  * @internal
- */ class Z extends K {
+ */ class tt extends J {
     construct(t, n, e) {
-        return new Z(t, n, e);
+        return new tt(t, n, e);
     }
     /**
      * Returns true if the string could be used as a segment in a field path
      * without escaping.
      */    static isValidIdentifier(t) {
-        return X.test(t);
+        return Z.test(t);
     }
     canonicalString() {
         return this.toArray().map((t => (t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"), 
-        Z.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
+        tt.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
     }
     toString() {
         return this.canonicalString();
@@ -610,7 +608,7 @@ const X = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
     /**
      * The field designating the key of a document.
      */    static keyField() {
-        return new Z([ "__name__" ]);
+        return new tt([ "__name__" ]);
     }
     /**
      * Parses a field string from the given server-formatted string.
@@ -625,24 +623,24 @@ const X = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
         const n = [];
         let e = "", r = 0;
         const s = () => {
-            if (0 === e.length) throw new L(I, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
+            if (0 === e.length) throw new U(A, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
             n.push(e), e = "";
         };
         let i = !1;
         for (;r < t.length; ) {
             const n = t[r];
             if ("\\" === n) {
-                if (r + 1 === t.length) throw new L(I, "Path has trailing escape character: " + t);
+                if (r + 1 === t.length) throw new U(A, "Path has trailing escape character: " + t);
                 const n = t[r + 1];
-                if ("\\" !== n && "." !== n && "`" !== n) throw new L(I, "Path has invalid escape sequence: " + t);
+                if ("\\" !== n && "." !== n && "`" !== n) throw new U(A, "Path has invalid escape sequence: " + t);
                 e += n, r += 2;
             } else "`" === n ? (i = !i, r++) : "." !== n || i ? (e += n, r++) : (s(), r++);
         }
-        if (s(), i) throw new L(I, "Unterminated ` in path: " + t);
-        return new Z(n);
+        if (s(), i) throw new U(A, "Unterminated ` in path: " + t);
+        return new tt(n);
     }
     static emptyPath() {
-        return new Z([]);
+        return new tt([]);
     }
 }
 
@@ -664,27 +662,27 @@ const X = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  */
 /**
  * @internal
- */ class tt {
+ */ class nt {
     constructor(t) {
         this.path = t;
     }
     static fromPath(t) {
-        return new tt(J.fromString(t));
+        return new nt(X.fromString(t));
     }
     static fromName(t) {
-        return new tt(J.fromString(t).popFirst(5));
+        return new nt(X.fromString(t).popFirst(5));
     }
     /** Returns true if the document is in the specified collectionId. */    hasCollectionId(t) {
         return this.path.length >= 2 && this.path.get(this.path.length - 2) === t;
     }
     isEqual(t) {
-        return null !== t && 0 === J.comparator(this.path, t.path);
+        return null !== t && 0 === X.comparator(this.path, t.path);
     }
     toString() {
         return this.path.toString();
     }
     static comparator(t, n) {
-        return J.comparator(t.path, n.path);
+        return X.comparator(t.path, n.path);
     }
     static isDocumentKey(t) {
         return t.length % 2 == 0;
@@ -695,7 +693,7 @@ const X = /^[_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 tt(new J(t.slice()));
+        return new nt(new X(t.slice()));
     }
 }
 
@@ -714,8 +712,8 @@ const X = /^[_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 nt(t, n, e) {
-    if (!e) throw new L(I, `Function ${t}() cannot be called with an empty ${n}.`);
+ */ function et(t, n, e) {
+    if (!e) throw new U(A, `Function ${t}() cannot be called with an empty ${n}.`);
 }
 
 /**
@@ -726,15 +724,15 @@ const X = /^[_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 et(t) {
-    if (!tt.isDocumentKey(t)) throw new L(I, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
+function rt(t) {
+    if (!nt.isDocumentKey(t)) throw new U(A, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
  * Validates that `path` refers to a collection (indicated by the fact it
  * contains an odd numbers of segments).
- */ function rt(t) {
-    if (tt.isDocumentKey(t)) throw new L(I, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
+ */ function st(t) {
+    if (nt.isDocumentKey(t)) throw new U(A, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
@@ -742,7 +740,7 @@ function et(t) {
  * (i.e. excludes Array, Date, etc.).
  */
 /** Returns a string describing the type / value of the provided input. */
-function st(t) {
+function it(t) {
     if (void 0 === t) return "undefined";
     if (null === t) return "null";
     if ("string" == typeof t) return t.length > 20 && (t = `${t.substring(0, 20)}...`), 
@@ -768,27 +766,27 @@ function st(t) {
             return n ? `a custom ${n} object` : "an object";
         }
     }
-    return "function" == typeof t ? "a function" : _();
+    return "function" == typeof t ? "a function" : g();
 }
 
-function it(t, 
+function ot(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 n) {
     if ("_delegate" in t && (
     // Unwrap Compat types
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     t = t._delegate), !(t instanceof n)) {
-        if (n.name === t.constructor.name) throw new L(I, "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(A, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
-            const e = st(t);
-            throw new L(I, `Expected type '${n.name}', but it was: ${e}`);
+            const e = it(t);
+            throw new U(A, `Expected type '${n.name}', but it was: ${e}`);
         }
     }
     return t;
 }
 
-function ot(t, n) {
-    if (n <= 0) throw new L(I, `Function ${t}() requires a positive number, but it was: ${n}.`);
+function ut(t, n) {
+    if (n <= 0) throw new U(A, `Function ${t}() requires a positive number, but it was: ${n}.`);
 }
 
 /**
@@ -809,11 +807,11 @@ function ot(t, n) {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function ut(t) {
+ */ function ct(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function ct(t) {
+/** Returns whether the value represents -0. */ function at(t) {
     // Detect if the value is -0.0. Based on polyfill from
     // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
     return 0 === t && 1 / t == -1 / 0;
@@ -839,7 +837,7 @@ function ot(t, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const at = {
+const ht = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery"
@@ -876,7 +874,7 @@ const at = {
  * 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 ht, lt;
+var lt, ft;
 
 /**
  * Converts an HTTP Status Code to the equivalent error code.
@@ -885,8 +883,8 @@ var ht, lt;
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function ft(t) {
-    if (void 0 === t) return m("RPC_ERROR", "HTTP error has no status"), T;
+function dt(t) {
+    if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), I;
     // The canonical error codes for Google APIs [1] specify mapping onto HTTP
     // status codes but the mapping is not bijective. In each case of ambiguity
     // this function chooses a primary error.
@@ -896,48 +894,48 @@ function ft(t) {
         switch (t) {
       case 200:
         // OK
-        return v;
+        return E;
 
       case 400:
         // Bad Request
-        return $;
+        return F;
 
         // Other possibilities based on the forward mapping
         // return Code.INVALID_ARGUMENT;
         // return Code.OUT_OF_RANGE;
               case 401:
         // Unauthorized
-        return D;
+        return N;
 
       case 403:
         // Forbidden
-        return V;
+        return D;
 
       case 404:
         // Not Found
-        return P;
+        return R;
 
       case 409:
         // Conflict
-        return F;
+        return S;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return S;
+        return x;
 
       case 429:
         // Too Many Requests
-        return N;
+        return $;
 
       case 499:
         // Client Closed Request
-        return E;
+        return T;
 
       case 500:
         // Internal Server Error
-        return T;
+        return I;
 
         // Other possibilities:
         // return Code.INTERNAL;
@@ -948,14 +946,14 @@ function ft(t) {
 
       case 503:
         // Service Unavailable
-        return O;
+        return C;
 
       case 504:
         // Gateway Timeout
-        return A;
+        return P;
 
       default:
-        return t >= 200 && t < 300 ? v : t >= 400 && t < 500 ? $ : t >= 500 && t < 600 ? x : T;
+        return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? F : t >= 500 && t < 600 ? O : I;
     }
 }
 
@@ -978,16 +976,16 @@ function ft(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (lt = ht || (ht = {}))[lt.OK = 0] = "OK", lt[lt.CANCELLED = 1] = "CANCELLED", 
-lt[lt.UNKNOWN = 2] = "UNKNOWN", lt[lt.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
-lt[lt.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", lt[lt.NOT_FOUND = 5] = "NOT_FOUND", 
-lt[lt.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", lt[lt.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
-lt[lt.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", lt[lt.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
-lt[lt.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", lt[lt.ABORTED = 10] = "ABORTED", 
-lt[lt.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", lt[lt.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
-lt[lt.INTERNAL = 13] = "INTERNAL", lt[lt.UNAVAILABLE = 14] = "UNAVAILABLE", lt[lt.DATA_LOSS = 15] = "DATA_LOSS";
+ */ (ft = lt || (lt = {}))[ft.OK = 0] = "OK", ft[ft.CANCELLED = 1] = "CANCELLED", 
+ft[ft.UNKNOWN = 2] = "UNKNOWN", ft[ft.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+ft[ft.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", ft[ft.NOT_FOUND = 5] = "NOT_FOUND", 
+ft[ft.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", ft[ft.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+ft[ft.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", ft[ft.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+ft[ft.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", ft[ft.ABORTED = 10] = "ABORTED", 
+ft[ft.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", ft[ft.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+ft[ft.INTERNAL = 13] = "INTERNAL", ft[ft.UNAVAILABLE = 14] = "UNAVAILABLE", ft[ft.DATA_LOSS = 15] = "DATA_LOSS";
 
-class dt extends 
+class wt extends 
 /**
  * Base class for all Rest-based connections to the backend (WebChannel and
  * HTTP).
@@ -1000,11 +998,11 @@ class {
     }
     m(t, n, e, r, s) {
         const i = this.p(t, n);
-        w("RestConnection", "Sending: ", i, e);
+        m("RestConnection", "Sending: ", i, e);
         const o = {};
-        return this.g(o, r, s), this.v(t, i, o, e).then((t => (w("RestConnection", "Received: ", t), 
+        return this.g(o, r, s), this.v(t, i, o, e).then((t => (m("RestConnection", "Received: ", t), 
         t)), (n => {
-            throw p("RestConnection", `${t} failed with error: `, n, "url: ", i, "request:", e), 
+            throw y("RestConnection", `${t} failed with error: `, n, "url: ", i, "request:", e), 
             n;
         }));
     }
@@ -1017,7 +1015,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/" + l, 
+        t["X-Goog-Api-Client"] = "gl-js/ fire/" + f, 
         // Content-Type: text/plain will avoid preflight requests which might
         // mess with CORS and redirects by proxies. If we add custom headers
         // we will need to change this code to potentially use the $httpOverwrite
@@ -1026,7 +1024,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 = at[t];
+        const e = ht[t];
         return `${this.h}/v1/${n}:${e}`;
     }
 } {
@@ -1050,9 +1048,9 @@ class {
                 body: s
             });
         } catch (t) {
-            throw new L(ft(t.status), "Request failed with error: " + t.statusText);
+            throw new U(dt(t.status), "Request failed with error: " + t.statusText);
         }
-        if (!i.ok) throw new L(ft(i.status), "Request failed with error: " + i.statusText);
+        if (!i.ok) throw new U(dt(i.status), "Request failed with error: " + i.statusText);
         return i.json();
     }
 }
@@ -1095,7 +1093,7 @@ class {
  *
  * If `nBytes < 0` , an error will be thrown.
  */
-function wt(t) {
+function mt(t) {
     // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.
     const n = 
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
@@ -1121,14 +1119,14 @@ function wt(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 mt {
+ */ class pt {
     static P() {
         // Alphanumeric characters
         const t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", n = Math.floor(256 / t.length) * t.length;
         // The largest byte value that is a multiple of `char.length`.
                 let e = "";
         for (;e.length < 20; ) {
-            const r = wt(40);
+            const r = mt(40);
             for (let s = 0; s < r.length; ++s) 
             // Only accept values that are [0, maxMultiple), this ensures they can
             // be evenly mapped to indices of `chars` via a modulo operation.
@@ -1138,11 +1136,11 @@ function wt(t) {
     }
 }
 
-function pt(t, n) {
+function yt(t, n) {
     return t < n ? -1 : t > n ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function yt(t, n, e) {
+/** Helper to compare arrays using isEqual(). */ function _t(t, n, e) {
     return t.length === n.length && t.every(((t, r) => e(t, n[r])));
 }
 
@@ -1177,7 +1175,7 @@ function pt(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 _t {
+class gt {
     /**
      * Creates a new timestamp.
      *
@@ -1198,18 +1196,18 @@ class _t {
      * The fractions of a second at nanosecond resolution.*
      */
     n) {
-        if (this.seconds = t, this.nanoseconds = n, n < 0) throw new L(I, "Timestamp nanoseconds out of range: " + n);
-        if (n >= 1e9) throw new L(I, "Timestamp nanoseconds out of range: " + n);
-        if (t < -62135596800) throw new L(I, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = n, n < 0) throw new U(A, "Timestamp nanoseconds out of range: " + n);
+        if (n >= 1e9) throw new U(A, "Timestamp nanoseconds out of range: " + n);
+        if (t < -62135596800) throw new U(A, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new L(I, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new U(A, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
      *
      * @returns a new timestamp representing the current date.
      */    static now() {
-        return _t.fromMillis(Date.now());
+        return gt.fromMillis(Date.now());
     }
     /**
      * Creates a new timestamp from the given date.
@@ -1218,7 +1216,7 @@ class _t {
      * @returns A new `Timestamp` representing the same point in time as the given
      *     date.
      */    static fromDate(t) {
-        return _t.fromMillis(t.getTime());
+        return gt.fromMillis(t.getTime());
     }
     /**
      * Creates a new timestamp from the given number of milliseconds.
@@ -1229,7 +1227,7 @@ class _t {
      *     number of milliseconds.
      */    static fromMillis(t) {
         const n = Math.floor(t / 1e3), e = Math.floor(1e6 * (t - 1e3 * n));
-        return new _t(n, e);
+        return new gt(n, e);
     }
     /**
      * Converts a `Timestamp` to a JavaScript `Date` object. This conversion
@@ -1251,7 +1249,7 @@ class _t {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }
     _compareTo(t) {
-        return this.seconds === t.seconds ? pt(this.nanoseconds, t.nanoseconds) : pt(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? yt(this.nanoseconds, t.nanoseconds) : yt(this.seconds, t.seconds);
     }
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1307,15 +1305,15 @@ class _t {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ class gt {
+ */ class bt {
     constructor(t) {
         this.timestamp = t;
     }
     static fromTimestamp(t) {
-        return new gt(t);
+        return new bt(t);
     }
     static min() {
-        return new gt(new _t(0, 0));
+        return new bt(new gt(0, 0));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -1350,13 +1348,13 @@ class _t {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function bt(t) {
+ */ function vt(t) {
     let n = 0;
     for (const e in t) Object.prototype.hasOwnProperty.call(t, e) && n++;
     return n;
 }
 
-function vt(t, n) {
+function Et(t, n) {
     for (const e in t) Object.prototype.hasOwnProperty.call(t, e) && n(e, t[e]);
 }
 
@@ -1386,12 +1384,12 @@ function vt(t, n) {
  *             If foo is not an object, foo is replaced with an object
  *             containing foo
  */
-class Et {
+class Tt {
     constructor(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
         // Sort the field mask to support `FieldMask.isEqual()` and assert below.
-        t.sort(Z.comparator);
+        t.sort(tt.comparator);
     }
     /**
      * Verifies that `fieldPath` is included by at least one field in this field
@@ -1403,7 +1401,7 @@ class Et {
         return !1;
     }
     isEqual(t) {
-        return yt(this.fields, t.fields, ((t, n) => t.isEqual(n)));
+        return _t(this.fields, t.fields, ((t, n) => t.isEqual(n)));
     }
 }
 
@@ -1449,13 +1447,13 @@ class Et {
  * before being sent as a proto.
  * @internal
  */
-class Tt {
+class It {
     constructor(t) {
         this.binaryString = t;
     }
     static fromBase64String(t) {
         const n = atob(t);
-        return new Tt(n);
+        return new It(n);
     }
     static fromUint8Array(t) {
         const n = 
@@ -1470,7 +1468,19 @@ class Tt {
         /**
  * Helper function to convert a binary string to an Uint8Array.
  */ (t);
-        return new Tt(n);
+        return new It(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 t = this.binaryString, btoa(t);
@@ -1506,31 +1516,31 @@ class Tt {
         return 2 * this.binaryString.length;
     }
     compareTo(t) {
-        return pt(this.binaryString, t.binaryString);
+        return yt(this.binaryString, t.binaryString);
     }
     isEqual(t) {
         return this.binaryString === t.binaryString;
     }
 }
 
-Tt.EMPTY_BYTE_STRING = new Tt("");
+It.EMPTY_BYTE_STRING = new It("");
 
-const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
 /**
  * Converts the possible Proto values for a timestamp value into a "seconds and
  * nanos" representation.
- */ function At(t) {
+ */ function Pt(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 (g(!!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 = It.exec(t);
-        if (g(!!e), e[1]) {
+        const e = At.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);
@@ -1543,21 +1553,21 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: Pt(t.seconds),
-        nanos: Pt(t.nanos)
+        seconds: Rt(t.seconds),
+        nanos: Rt(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function Pt(t) {
+ */ function Rt(t) {
     // TODO(bjornick): Handle int64 greater than 53 bits.
     return "number" == typeof t ? t : "string" == typeof t ? Number(t) : 0;
 }
 
-/** Converts the possible Proto types for Blobs into a ByteString. */ function Rt(t) {
-    return "string" == typeof t ? Tt.fromBase64String(t) : Tt.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Vt(t) {
+    return "string" == typeof t ? It.fromBase64String(t) : It.fromUint8Array(t);
 }
 
 /**
@@ -1593,7 +1603,7 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *   FieldValueOptions to value().
  * - With respect to other ServerTimestampValues, they sort by their
  *   localWriteTime.
- */ function Vt(t) {
+ */ function Dt(t) {
     var n, e;
     return "server_timestamp" === (null === (e = ((null === (n = null == t ? void 0 : t.mapValue) || void 0 === n ? void 0 : n.fields) || {}).__type__) || void 0 === e ? void 0 : e.stringValue);
 }
@@ -1603,16 +1613,16 @@ const It = 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 Dt(t) {
+ */ function Nt(t) {
     const n = t.mapValue.fields.__previous_value__;
-    return Vt(n) ? Dt(n) : n;
+    return Dt(n) ? Nt(n) : n;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Nt(t) {
-    const n = At(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new _t(n.seconds, n.nanos);
+ */ function $t(t) {
+    const n = Pt(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new gt(n.seconds, n.nanos);
 }
 
 /**
@@ -1631,13 +1641,14 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Extracts the backend's type order for the provided value. */ function $t(t) {
-    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Vt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : _();
+/** Extracts the backend's type order for the provided value. */ function Ft(t) {
+    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Dt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : g();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Ft(t, n) {
-    const e = $t(t);
-    if (e !== $t(n)) return !1;
+/** Tests `left` and `right` for equality based on the backend semantics. */ function St(t, n) {
+    if (t === n) return !0;
+    const e = Ft(t);
+    if (e !== Ft(n)) return !1;
     switch (e) {
       case 0 /* NullValue */ :
         return !0;
@@ -1646,14 +1657,14 @@ const It = 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 Nt(t).isEqual(Nt(n));
+        return $t(t).isEqual($t(n));
 
       case 3 /* TimestampValue */ :
         return function(t, n) {
             if ("string" == typeof t.timestampValue && "string" == typeof n.timestampValue && t.timestampValue.length === n.timestampValue.length) 
             // Use string equality for ISO 8601 timestamps
             return t.timestampValue === n.timestampValue;
-            const e = At(t.timestampValue), r = At(n.timestampValue);
+            const e = Pt(t.timestampValue), r = Pt(n.timestampValue);
             return e.seconds === r.seconds && e.nanos === r.nanos;
         }(t, n);
 
@@ -1662,7 +1673,7 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 6 /* BlobValue */ :
         return function(t, n) {
-            return Rt(t.bytesValue).isEqual(Rt(n.bytesValue));
+            return Vt(t.bytesValue).isEqual(Vt(n.bytesValue));
         }(t, n);
 
       case 7 /* RefValue */ :
@@ -1670,70 +1681,71 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 8 /* GeoPointValue */ :
         return function(t, n) {
-            return Pt(t.geoPointValue.latitude) === Pt(n.geoPointValue.latitude) && Pt(t.geoPointValue.longitude) === Pt(n.geoPointValue.longitude);
+            return Rt(t.geoPointValue.latitude) === Rt(n.geoPointValue.latitude) && Rt(t.geoPointValue.longitude) === Rt(n.geoPointValue.longitude);
         }(t, n);
 
       case 2 /* NumberValue */ :
         return function(t, n) {
-            if ("integerValue" in t && "integerValue" in n) return Pt(t.integerValue) === Pt(n.integerValue);
+            if ("integerValue" in t && "integerValue" in n) return Rt(t.integerValue) === Rt(n.integerValue);
             if ("doubleValue" in t && "doubleValue" in n) {
-                const e = Pt(t.doubleValue), r = Pt(n.doubleValue);
-                return e === r ? ct(e) === ct(r) : isNaN(e) && isNaN(r);
+                const e = Rt(t.doubleValue), r = Rt(n.doubleValue);
+                return e === r ? at(e) === at(r) : isNaN(e) && isNaN(r);
             }
             return !1;
         }(t, n);
 
       case 9 /* ArrayValue */ :
-        return yt(t.arrayValue.values || [], n.arrayValue.values || [], Ft);
+        return _t(t.arrayValue.values || [], n.arrayValue.values || [], St);
 
       case 10 /* ObjectValue */ :
         return function(t, n) {
             const e = t.mapValue.fields || {}, r = n.mapValue.fields || {};
-            if (bt(e) !== bt(r)) return !1;
-            for (const t in e) if (e.hasOwnProperty(t) && (void 0 === r[t] || !Ft(e[t], r[t]))) return !1;
+            if (vt(e) !== vt(r)) return !1;
+            for (const t in e) if (e.hasOwnProperty(t) && (void 0 === r[t] || !St(e[t], r[t]))) return !1;
             return !0;
         }
         /** Returns true if the ArrayValue contains the specified element. */ (t, n);
 
       default:
-        return _();
+        return g();
     }
 }
 
-function St(t, n) {
-    return void 0 !== (t.values || []).find((t => Ft(t, n)));
+function xt(t, n) {
+    return void 0 !== (t.values || []).find((t => St(t, n)));
 }
 
 function qt(t, n) {
-    const e = $t(t), r = $t(n);
-    if (e !== r) return pt(e, r);
+    if (t === n) return 0;
+    const e = Ft(t), r = Ft(n);
+    if (e !== r) return yt(e, r);
     switch (e) {
       case 0 /* NullValue */ :
         return 0;
 
       case 1 /* BooleanValue */ :
-        return pt(t.booleanValue, n.booleanValue);
+        return yt(t.booleanValue, n.booleanValue);
 
       case 2 /* NumberValue */ :
         return function(t, n) {
-            const e = Pt(t.integerValue || t.doubleValue), r = Pt(n.integerValue || n.doubleValue);
+            const e = Rt(t.integerValue || t.doubleValue), r = Rt(n.integerValue || n.doubleValue);
             return e < r ? -1 : e > r ? 1 : e === r ? 0 : 
             // one or both are NaN.
             isNaN(e) ? isNaN(r) ? 0 : -1 : 1;
         }(t, n);
 
       case 3 /* TimestampValue */ :
-        return xt(t.timestampValue, n.timestampValue);
+        return Ot(t.timestampValue, n.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return xt(Nt(t), Nt(n));
+        return Ot($t(t), $t(n));
 
       case 5 /* StringValue */ :
-        return pt(t.stringValue, n.stringValue);
+        return yt(t.stringValue, n.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, n) {
-            const e = Rt(t), r = Rt(n);
+            const e = Vt(t), r = Vt(n);
             return e.compareTo(r);
         }(t.bytesValue, n.bytesValue);
 
@@ -1741,17 +1753,17 @@ function qt(t, n) {
         return function(t, n) {
             const e = t.split("/"), r = n.split("/");
             for (let t = 0; t < e.length && t < r.length; t++) {
-                const n = pt(e[t], r[t]);
+                const n = yt(e[t], r[t]);
                 if (0 !== n) return n;
             }
-            return pt(e.length, r.length);
+            return yt(e.length, r.length);
         }(t.referenceValue, n.referenceValue);
 
       case 8 /* GeoPointValue */ :
         return function(t, n) {
-            const e = pt(Pt(t.latitude), Pt(n.latitude));
+            const e = yt(Rt(t.latitude), Rt(n.latitude));
             if (0 !== e) return e;
-            return pt(Pt(t.longitude), Pt(n.longitude));
+            return yt(Rt(t.longitude), Rt(n.longitude));
         }(t.geoPointValue, n.geoPointValue);
 
       case 9 /* ArrayValue */ :
@@ -1761,7 +1773,7 @@ function qt(t, n) {
                 const n = qt(e[t], r[t]);
                 if (n) return n;
             }
-            return pt(e.length, r.length);
+            return yt(e.length, r.length);
         }(t.arrayValue, n.arrayValue);
 
       case 10 /* ObjectValue */ :
@@ -1773,49 +1785,49 @@ function qt(t, n) {
             // canonical IDs are independent of insertion order.
             r.sort(), i.sort();
             for (let t = 0; t < r.length && t < i.length; ++t) {
-                const n = pt(r[t], i[t]);
+                const n = yt(r[t], i[t]);
                 if (0 !== n) return n;
                 const o = qt(e[r[t]], s[i[t]]);
                 if (0 !== o) return o;
             }
-            return pt(r.length, i.length);
+            return yt(r.length, i.length);
         }
         /** Returns a reference value for the provided database and key. */ (t.mapValue, n.mapValue);
 
       default:
-        throw _();
+        throw g();
     }
 }
 
-function xt(t, n) {
-    if ("string" == typeof t && "string" == typeof n && t.length === n.length) return pt(t, n);
-    const e = At(t), r = At(n), s = pt(e.seconds, r.seconds);
-    return 0 !== s ? s : pt(e.nanos, r.nanos);
+function Ot(t, n) {
+    if ("string" == typeof t && "string" == typeof n && t.length === n.length) return yt(t, n);
+    const e = Pt(t), r = Pt(n), s = yt(e.seconds, r.seconds);
+    return 0 !== s ? s : yt(e.nanos, r.nanos);
 }
 
-function Ot(t, n) {
+function Ct(t, n) {
     return {
         referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${n.path.canonicalString()}`
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Ct(t) {
+/** Returns true if `value` is an ArrayValue. */ function Lt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Lt(t) {
+/** Returns true if `value` is a NullValue. */ function Ut(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function Ut(t) {
+/** Returns true if `value` is NaN. */ function kt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function kt(t) {
+/** Returns true if `value` is a MapValue. */ function jt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function jt(t) {
+/** Creates a deep copy of `source`. */ function Mt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1828,7 +1840,7 @@ function Ot(t, n) {
                 fields: {}
             }
         };
-        return vt(t.mapValue.fields, ((t, e) => n.mapValue.fields[t] = jt(e))), n;
+        return Et(t.mapValue.fields, ((t, e) => n.mapValue.fields[t] = Mt(e))), n;
     }
     if (t.arrayValue) {
         const n = {
@@ -1836,7 +1848,7 @@ function Ot(t, n) {
                 values: []
             }
         };
-        for (let e = 0; e < (t.arrayValue.values || []).length; ++e) n.arrayValue.values[e] = jt(t.arrayValue.values[e]);
+        for (let e = 0; e < (t.arrayValue.values || []).length; ++e) n.arrayValue.values[e] = Mt(t.arrayValue.values[e]);
         return n;
     }
     return Object.assign({}, t);
@@ -1861,12 +1873,12 @@ function Ot(t, n) {
 /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ class Mt {
+ */ class Bt {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new Mt({
+        return new Bt({
             mapValue: {}
         });
     }
@@ -1880,7 +1892,7 @@ function Ot(t, n) {
         {
             let n = this.value;
             for (let e = 0; e < t.length - 1; ++e) if (n = (n.mapValue.fields || {})[t.get(e)], 
-            !kt(n)) return null;
+            !jt(n)) return null;
             return n = (n.mapValue.fields || {})[t.lastSegment()], n || null;
         }
     }
@@ -1890,21 +1902,21 @@ function Ot(t, n) {
      * @param path - The field path to set.
      * @param value - The value to set.
      */    set(t, n) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = jt(n);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Mt(n);
     }
     /**
      * Sets the provided fields to the provided values.
      *
      * @param data - A map of fields to values (or null for deletes).
      */    setAll(t) {
-        let n = Z.emptyPath(), e = {}, r = [];
+        let n = tt.emptyPath(), e = {}, r = [];
         t.forEach(((t, s) => {
             if (!n.isImmediateParentOf(s)) {
                 // Insert the accumulated changes at this parent location
                 const t = this.getFieldsMap(n);
                 this.applyChanges(t, e, r), e = {}, r = [], n = s.popLast();
             }
-            t ? e[s.lastSegment()] = jt(t) : r.push(s.lastSegment());
+            t ? e[s.lastSegment()] = Mt(t) : r.push(s.lastSegment());
         }));
         const s = this.getFieldsMap(n);
         this.applyChanges(s, e, r);
@@ -1916,10 +1928,10 @@ function Ot(t, n) {
      * @param path - The field path to remove.
      */    delete(t) {
         const n = this.field(t.popLast());
-        kt(n) && n.mapValue.fields && delete n.mapValue.fields[t.lastSegment()];
+        jt(n) && n.mapValue.fields && delete n.mapValue.fields[t.lastSegment()];
     }
     isEqual(t) {
-        return Ft(this.value, t.value);
+        return St(this.value, t.value);
     }
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -1931,7 +1943,7 @@ function Ot(t, n) {
         });
         for (let e = 0; e < t.length; ++e) {
             let r = n.mapValue.fields[t.get(e)];
-            kt(r) && r.mapValue.fields || (r = {
+            jt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -1943,11 +1955,11 @@ function Ot(t, n) {
      * Modifies `fieldsMap` by adding, replacing or deleting the specified
      * entries.
      */    applyChanges(t, n, e) {
-        vt(n, ((n, e) => t[n] = e));
+        Et(n, ((n, e) => t[n] = e));
         for (const n of e) delete t[n];
     }
     clone() {
-        return new Mt(jt(this.value));
+        return new Bt(Mt(this.value));
     }
 }
 
@@ -1976,7 +1988,7 @@ function Ot(t, n) {
  * not transition to one of these states even after all mutations have been
  * applied, `isValidDocument()` returns false and the document should be removed
  * from all views.
- */ class Bt {
+ */ class zt {
     constructor(t, n, e, r, s) {
         this.key = t, this.documentType = n, this.version = e, this.data = r, this.documentState = s;
     }
@@ -1984,23 +1996,23 @@ function Ot(t, n) {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new Bt(t, 0 /* INVALID */ , gt.min(), Mt.empty(), 0 /* SYNCED */);
+        return new zt(t, 0 /* INVALID */ , bt.min(), Bt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist with the given data at the
      * given version.
      */    static newFoundDocument(t, n, e) {
-        return new Bt(t, 1 /* FOUND_DOCUMENT */ , n, e, 0 /* SYNCED */);
+        return new zt(t, 1 /* FOUND_DOCUMENT */ , n, e, 0 /* SYNCED */);
     }
     /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, n) {
-        return new Bt(t, 2 /* NO_DOCUMENT */ , n, Mt.empty(), 0 /* SYNCED */);
+        return new zt(t, 2 /* NO_DOCUMENT */ , n, Bt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist at the given version but
      * whose data is not known (e.g. a document that was updated without a known
      * base document).
      */    static newUnknownDocument(t, n) {
-        return new Bt(t, 3 /* UNKNOWN_DOCUMENT */ , n, Mt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new zt(t, 3 /* UNKNOWN_DOCUMENT */ , n, Bt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2013,7 +2025,7 @@ function Ot(t, n) {
      * Changes the document type to indicate that it doesn't exist at the given
      * version.
      */    convertToNoDocument(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Mt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Bt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }
     /**
@@ -2021,7 +2033,7 @@ function Ot(t, n) {
      * that its data is not known (e.g. a document that was updated without a known
      * base document).
      */    convertToUnknownDocument(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Mt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Bt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasCommittedMutations() {
@@ -2052,10 +2064,10 @@ function Ot(t, n) {
         return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
     }
     isEqual(t) {
-        return t instanceof Bt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
+        return t instanceof zt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
     }
-    clone() {
-        return new Bt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
+    mutableCopy() {
+        return new zt(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}})`;
@@ -2079,7 +2091,7 @@ function Ot(t, n) {
  * limitations under the License.
  */
 // Visible for testing
-class zt {
+class Gt {
     constructor(t, n = null, e = [], r = [], s = null, i = null, o = null) {
         this.path = t, this.collectionGroup = n, this.orderBy = e, this.filters = r, this.limit = s, 
         this.startAt = i, this.endAt = o, this.R = null;
@@ -2093,26 +2105,26 @@ class zt {
  * NOTE: you should always construct `Target` from `Query.toTarget` instead of
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
- */ function Gt(t, n = null, e = [], r = [], s = null, i = null, o = null) {
-    return new zt(t, n, e, r, s, i, o);
+ */ function Qt(t, n = null, e = [], r = [], s = null, i = null, o = null) {
+    return new Gt(t, n, e, r, s, i, o);
 }
 
-class Qt extends class {} {
+class Wt 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 Wt(t, n, e) : "array-contains" /* ARRAY_CONTAINS */ === n ? new Jt(t, e) : "in" /* IN */ === n ? new Xt(t, e) : "not-in" /* NOT_IN */ === n ? new Zt(t, e) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === n ? new tn(t, e) : new Qt(t, n, e);
+        return t.isKeyField() ? "in" /* IN */ === n || "not-in" /* NOT_IN */ === n ? this.V(t, n, e) : new Yt(t, n, e) : "array-contains" /* ARRAY_CONTAINS */ === n ? new Xt(t, e) : "in" /* IN */ === n ? new Zt(t, e) : "not-in" /* NOT_IN */ === n ? new tn(t, e) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === n ? new nn(t, e) : new Wt(t, n, e);
     }
     static V(t, n, e) {
-        return "in" /* IN */ === n ? new Yt(t, e) : new Ht(t, e);
+        return "in" /* IN */ === n ? new Ht(t, e) : new Kt(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.D(qt(n, this.value)) : null !== n && $t(this.value) === $t(n) && this.D(qt(n, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== n && this.D(qt(n, this.value)) : null !== n && Ft(this.value) === Ft(n) && this.D(qt(n, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
     D(t) {
@@ -2136,7 +2148,7 @@ class Qt extends class {} {
             return t >= 0;
 
           default:
-            return _();
+            return g();
         }
     }
     N() {
@@ -2145,79 +2157,79 @@ class Qt extends class {} {
 }
 
 /** Filter that matches on key fields (i.e. '__name__'). */
-class Wt extends Qt {
+class Yt extends Wt {
     constructor(t, n, e) {
-        super(t, n, e), this.key = tt.fromName(e.referenceValue);
+        super(t, n, e), this.key = nt.fromName(e.referenceValue);
     }
     matches(t) {
-        const n = tt.comparator(t.key, this.key);
+        const n = nt.comparator(t.key, this.key);
         return this.D(n);
     }
 }
 
-/** Filter that matches on key fields within an array. */ class Yt extends Qt {
+/** Filter that matches on key fields within an array. */ class Ht extends Wt {
     constructor(t, n) {
-        super(t, "in" /* IN */ , n), this.keys = Kt("in" /* IN */ , n);
+        super(t, "in" /* IN */ , n), this.keys = Jt("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 Ht extends Qt {
+/** Filter that matches on key fields not present within an array. */ class Kt extends Wt {
     constructor(t, n) {
-        super(t, "not-in" /* NOT_IN */ , n), this.keys = Kt("not-in" /* NOT_IN */ , n);
+        super(t, "not-in" /* NOT_IN */ , n), this.keys = Jt("not-in" /* NOT_IN */ , n);
     }
     matches(t) {
         return !this.keys.some((n => n.isEqual(t.key)));
     }
 }
 
-function Kt(t, n) {
+function Jt(t, n) {
     var e;
-    return ((null === (e = n.arrayValue) || void 0 === e ? void 0 : e.values) || []).map((t => tt.fromName(t.referenceValue)));
+    return ((null === (e = n.arrayValue) || void 0 === e ? void 0 : e.values) || []).map((t => nt.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class Jt extends Qt {
+/** A Filter that implements the array-contains operator. */ class Xt extends Wt {
     constructor(t, n) {
         super(t, "array-contains" /* ARRAY_CONTAINS */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return Ct(n) && St(n.arrayValue, this.value);
+        return Lt(n) && xt(n.arrayValue, this.value);
     }
 }
 
-/** A Filter that implements the IN operator. */ class Xt extends Qt {
+/** A Filter that implements the IN operator. */ class Zt extends Wt {
     constructor(t, n) {
         super(t, "in" /* IN */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return null !== n && St(this.value.arrayValue, n);
+        return null !== n && xt(this.value.arrayValue, n);
     }
 }
 
-/** A Filter that implements the not-in operator. */ class Zt extends Qt {
+/** A Filter that implements the not-in operator. */ class tn extends Wt {
     constructor(t, n) {
         super(t, "not-in" /* NOT_IN */ , n);
     }
     matches(t) {
-        if (St(this.value.arrayValue, {
+        if (xt(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         const n = t.data.field(this.field);
-        return null !== n && !St(this.value.arrayValue, n);
+        return null !== n && !xt(this.value.arrayValue, n);
     }
 }
 
-/** A Filter that implements the array-contains-any operator. */ class tn extends Qt {
+/** A Filter that implements the array-contains-any operator. */ class nn extends Wt {
     constructor(t, n) {
         super(t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return !(!Ct(n) || !n.arrayValue.values) && n.arrayValue.values.some((t => St(this.value.arrayValue, t)));
+        return !(!Lt(n) || !n.arrayValue.values) && n.arrayValue.values.some((t => xt(this.value.arrayValue, t)));
     }
 }
 
@@ -2234,7 +2246,7 @@ function Kt(t, n) {
  * Bound provides a function to determine whether a document comes before or
  * after a bound. This is influenced by whether the position is just before or
  * just after the provided values.
- */ class nn {
+ */ class en {
     constructor(t, n) {
         this.position = t, this.before = n;
     }
@@ -2242,22 +2254,22 @@ function Kt(t, n) {
 
 /**
  * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
- */ class en {
+ */ class rn {
     constructor(t, n = "asc" /* ASCENDING */) {
         this.field = t, this.dir = n;
     }
 }
 
-function rn(t, n) {
+function sn(t, n) {
     return t.dir === n.dir && t.field.isEqual(n.field);
 }
 
-function sn(t, n) {
+function on(t, n) {
     if (null === t) return null === n;
     if (null === n) return !1;
     if (t.before !== n.before || t.position.length !== n.position.length) return !1;
     for (let e = 0; e < t.position.length; e++) {
-        if (!Ft(t.position[e], n.position[e])) return !1;
+        if (!St(t.position[e], n.position[e])) return !1;
     }
     return !0;
 }
@@ -2284,7 +2296,7 @@ function sn(t, n) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ class on {
+ */ class un {
     /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2297,15 +2309,15 @@ function sn(t, n) {
     }
 }
 
-/** Creates a new Query for a query that matches all documents at `path` */ function un(t) {
-    return !ut(t.limit) && "L" /* Last */ === t.limitType;
+/** Creates a new Query for a query that matches all documents at `path` */ function cn(t) {
+    return !ct(t.limit) && "L" /* Last */ === t.limitType;
 }
 
-function cn(t) {
+function an(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function an(t) {
+function hn(t) {
     for (const n of t.filters) if (n.N()) return n.field;
     return null;
 }
@@ -2318,7 +2330,7 @@ function an(t) {
  * Returns whether the query matches a collection group rather than a specific
  * collection.
  */
-function hn(t) {
+function ln(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2326,23 +2338,23 @@ function hn(t) {
  * Returns the implicit order by constraint that is used to execute the Query,
  * which can be different from the order by constraints the user provided (e.g.
  * the SDK and backend always orders by `__name__`).
- */ function ln(t) {
-    const n = b(t);
+ */ function fn(t) {
+    const n = v(t);
     if (null === n.$) {
         n.$ = [];
-        const t = an(n), e = cn(n);
+        const t = hn(n), e = an(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 en(t)), n.$.push(new en(Z.keyField(), "asc" /* ASCENDING */)); else {
+        t.isKeyField() || n.$.push(new rn(t)), n.$.push(new rn(tt.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 en(Z.keyField(), t));
+                n.$.push(new rn(tt.keyField(), t));
             }
         }
     }
@@ -2351,34 +2363,34 @@ function hn(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function fn(t) {
-    const n = b(t);
-    if (!n.F) if ("F" /* First */ === n.limitType) n.F = Gt(n.path, n.collectionGroup, ln(n), n.filters, n.limit, n.startAt, n.endAt); else {
+ */ function dn(t) {
+    const n = v(t);
+    if (!n.F) if ("F" /* First */ === n.limitType) n.F = Qt(n.path, n.collectionGroup, fn(n), n.filters, n.limit, n.startAt, n.endAt); else {
         // Flip the orderBy directions since we want the last results
         const t = [];
-        for (const e of ln(n)) {
+        for (const e of fn(n)) {
             const n = "desc" /* DESCENDING */ === e.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            t.push(new en(e.field, n));
+            t.push(new rn(e.field, n));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                const e = n.endAt ? new nn(n.endAt.position, !n.endAt.before) : null, r = n.startAt ? new nn(n.startAt.position, !n.startAt.before) : null;
+                const e = n.endAt ? new en(n.endAt.position, !n.endAt.before) : null, r = n.startAt ? new en(n.startAt.position, !n.startAt.before) : null;
         // Now return as a LimitType.First query.
-        n.F = Gt(n.path, n.collectionGroup, t, n.filters, n.limit, e, r);
+        n.F = Qt(n.path, n.collectionGroup, t, n.filters, n.limit, e, r);
     }
     return n.F;
 }
 
-function dn(t, n) {
+function wn(t, n) {
     return function(t, n) {
         if (t.limit !== n.limit) return !1;
         if (t.orderBy.length !== n.orderBy.length) return !1;
-        for (let e = 0; e < t.orderBy.length; e++) if (!rn(t.orderBy[e], n.orderBy[e])) return !1;
+        for (let e = 0; e < t.orderBy.length; e++) if (!sn(t.orderBy[e], n.orderBy[e])) return !1;
         if (t.filters.length !== n.filters.length) return !1;
         for (let s = 0; s < t.filters.length; s++) if (e = t.filters[s], r = n.filters[s], 
-        e.op !== r.op || !e.field.isEqual(r.field) || !Ft(e.value, r.value)) return !1;
+        e.op !== r.op || !e.field.isEqual(r.field) || !St(e.value, r.value)) return !1;
         var e, r;
-        return t.collectionGroup === n.collectionGroup && !!t.path.isEqual(n.path) && !!sn(t.startAt, n.startAt) && sn(t.endAt, n.endAt);
-    }(fn(t), fn(n)) && t.limitType === n.limitType;
+        return t.collectionGroup === n.collectionGroup && !!t.path.isEqual(n.path) && !!on(t.startAt, n.startAt) && on(t.endAt, n.endAt);
+    }(dn(t), dn(n)) && t.limitType === n.limitType;
 }
 
 /**
@@ -2406,9 +2418,9 @@ function dn(t, n) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function wn(t, n) {
+function mn(t, n) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !ct(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !at(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(n) ? 
     /**
  * Returns an IntegerValue for `value`.
@@ -2430,7 +2442,7 @@ function wn(t, n) {
             };
         }
         return {
-            doubleValue: ct(n) ? "-0" : n
+            doubleValue: at(n) ? "-0" : n
         };
     }(t, n);
 }
@@ -2451,7 +2463,7 @@ function wn(t, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Used to represent a field transform on a mutation. */ class mn {
+/** Used to represent a field transform on a mutation. */ class pn {
     constructor() {
         // Make sure that the structural type of `TransformOperation` is unique.
         // See https://github.com/microsoft/TypeScript/issues/5451
@@ -2459,15 +2471,15 @@ function wn(t, n) {
     }
 }
 
-/** Transforms a value into a server-generated timestamp. */ class pn extends mn {}
+/** Transforms a value into a server-generated timestamp. */ class yn extends pn {}
 
-/** Transforms an array value via a union operation. */ class yn extends mn {
+/** Transforms an array value via a union operation. */ class _n extends pn {
     constructor(t) {
         super(), this.elements = t;
     }
 }
 
-/** Transforms an array value via a remove operation. */ class _n extends mn {
+/** Transforms an array value via a remove operation. */ class gn extends pn {
     constructor(t) {
         super(), this.elements = t;
     }
@@ -2478,7 +2490,7 @@ function wn(t, n) {
  * transforms. Converts all field values to integers or doubles, but unlike the
  * backend does not cap integer values at 2^63. Instead, JavaScript number
  * arithmetic is used and precision loss can occur for values greater than 2^53.
- */ class gn extends mn {
+ */ class bn extends pn {
     constructor(t, n) {
         super(), this.q = t, this.O = n;
     }
@@ -2500,7 +2512,7 @@ function wn(t, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** A field path and the TransformOperation to perform upon it. */ class bn {
+/** A field path and the TransformOperation to perform upon it. */ class vn {
     constructor(t, n) {
         this.field = t, this.transform = n;
     }
@@ -2510,18 +2522,18 @@ function wn(t, n) {
  * Encodes a precondition for a mutation. This follows the model that the
  * backend accepts with the special case of an explicit "empty" precondition
  * (meaning no precondition).
- */ class vn {
+ */ class En {
     constructor(t, n) {
         this.updateTime = t, this.exists = n;
     }
     /** Creates a new empty Precondition. */    static none() {
-        return new vn;
+        return new En;
     }
     /** Creates a new Precondition with an exists flag. */    static exists(t) {
-        return new vn(void 0, t);
+        return new En(void 0, t);
     }
     /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {
-        return new vn(t);
+        return new En(t);
     }
     /** Returns whether this Precondition is empty. */    get isNone() {
         return void 0 === this.updateTime && void 0 === this.exists;
@@ -2574,12 +2586,12 @@ function wn(t, n) {
  * applyToLocalView() to implement the actual behavior of applying the mutation
  * to some source document (see `setMutationApplyToRemoteDocument()` for an
  * example).
- */ class En {}
+ */ class Tn {}
 
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class Tn extends En {
+ */ class In extends Tn {
     constructor(t, n, e, r = []) {
         super(), this.key = t, this.value = n, this.precondition = e, this.fieldTransforms = r, 
         this.type = 0 /* Set */;
@@ -2598,14 +2610,14 @@ function wn(t, n) {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ class In extends En {
+ */ class An extends Tn {
     constructor(t, n, e, r, s = []) {
         super(), this.key = t, this.data = n, this.fieldMask = e, this.precondition = r, 
         this.fieldTransforms = s, this.type = 1 /* Patch */;
     }
 }
 
-/** A mutation that deletes the document at the given key. */ class An extends En {
+/** A mutation that deletes the document at the given key. */ class Pn extends Tn {
     constructor(t, n) {
         super(), this.key = t, this.precondition = n, this.type = 2 /* Delete */ , this.fieldTransforms = [];
     }
@@ -2617,7 +2629,7 @@ function wn(t, n) {
  *
  * The `verify` operation is only used in Transactions, and this class serves
  * primarily to facilitate serialization into protos.
- */ class Pn extends En {
+ */ class Rn extends Tn {
     constructor(t, n) {
         super(), this.key = t, this.precondition = n, this.type = 3 /* Verify */ , this.fieldTransforms = [];
     }
@@ -2638,13 +2650,13 @@ function wn(t, n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const Rn = (() => {
+ */ const Vn = (() => {
     const t = {
         asc: "ASCENDING",
         desc: "DESCENDING"
     };
     return t;
-})(), Vn = (() => {
+})(), Dn = (() => {
     const t = {
         "<": "LESS_THAN",
         "<=": "LESS_THAN_OR_EQUAL",
@@ -2674,7 +2686,7 @@ function wn(t, n) {
  * TODO(klimt): We can remove the databaseId argument if we keep the full
  * resource name in documents.
  */
-class Dn {
+class Nn {
     constructor(t, n) {
         this.databaseId = t, this.S = n;
     }
@@ -2691,7 +2703,7 @@ class Dn {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Nn(t, n) {
+function $n(t, n) {
     if (t.S) {
         return `${new Date(1e3 * n.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + n.nanoseconds).slice(-9)}Z`;
     }
@@ -2706,129 +2718,129 @@ function Nn(t, n) {
  *
  * Visible for testing.
  */
-function $n(t, n) {
+function Fn(t, n) {
     return t.S ? n.toBase64() : n.toUint8Array();
 }
 
-function Fn(t, n) {
-    return Nn(t, n.toTimestamp());
+function Sn(t, n) {
+    return $n(t, n.toTimestamp());
 }
 
-function Sn(t) {
-    return g(!!t), gt.fromTimestamp(function(t) {
-        const n = At(t);
-        return new _t(n.seconds, n.nanos);
+function xn(t) {
+    return b(!!t), bt.fromTimestamp(function(t) {
+        const n = Pt(t);
+        return new gt(n.seconds, n.nanos);
     }(t));
 }
 
 function qn(t, n) {
     return function(t) {
-        return new J([ "projects", t.projectId, "databases", t.database ]);
+        return new X([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(n).canonicalString();
 }
 
-function xn(t, n) {
+function On(t, n) {
     return qn(t.databaseId, n.path);
 }
 
-function On(t, n) {
+function Cn(t, n) {
     const e = function(t) {
-        const n = J.fromString(t);
-        return g(Yn(n)), n;
+        const n = X.fromString(t);
+        return b(Hn(n)), n;
     }(n);
-    if (e.get(1) !== t.databaseId.projectId) throw new L(I, "Tried to deserialize key from different project: " + e.get(1) + " vs " + t.databaseId.projectId);
-    if (e.get(3) !== t.databaseId.database) throw new L(I, "Tried to deserialize key from different database: " + e.get(3) + " vs " + t.databaseId.database);
-    return new tt((g((r = e).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
+    if (e.get(1) !== t.databaseId.projectId) throw new U(A, "Tried to deserialize key from different project: " + e.get(1) + " vs " + t.databaseId.projectId);
+    if (e.get(3) !== t.databaseId.database) throw new U(A, "Tried to deserialize key from different database: " + e.get(3) + " vs " + t.databaseId.database);
+    return new nt((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 Cn(t, n) {
+function Ln(t, n) {
     return qn(t.databaseId, n);
 }
 
-function Ln(t) {
-    return new J([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
+function Un(t) {
+    return new X([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Un(t, n, e) {
+function kn(t, n, e) {
     return {
-        name: xn(t, n),
+        name: On(t, n),
         fields: e.value.mapValue.fields
     };
 }
 
-function kn(t, n) {
+function jn(t, n) {
     return "found" in n ? function(t, n) {
-        g(!!n.found), n.found.name, n.found.updateTime;
-        const e = On(t, n.found.name), r = Sn(n.found.updateTime), s = new Mt({
+        b(!!n.found), n.found.name, n.found.updateTime;
+        const e = Cn(t, n.found.name), r = xn(n.found.updateTime), s = new Bt({
             mapValue: {
                 fields: n.found.fields
             }
         });
-        return Bt.newFoundDocument(e, r, s);
+        return zt.newFoundDocument(e, r, s);
     }(t, n) : "missing" in n ? function(t, n) {
-        g(!!n.missing), g(!!n.readTime);
-        const e = On(t, n.missing), r = Sn(n.readTime);
-        return Bt.newNoDocument(e, r);
-    }(t, n) : _();
+        b(!!n.missing), b(!!n.readTime);
+        const e = Cn(t, n.missing), r = xn(n.readTime);
+        return zt.newNoDocument(e, r);
+    }(t, n) : g();
 }
 
-function jn(t, n) {
+function Mn(t, n) {
     let e;
-    if (n instanceof Tn) e = {
-        update: Un(t, n.key, n.value)
+    if (n instanceof In) e = {
+        update: kn(t, n.key, n.value)
+    }; else if (n instanceof Pn) e = {
+        delete: On(t, n.key)
     }; else if (n instanceof An) e = {
-        delete: xn(t, n.key)
-    }; else if (n instanceof In) e = {
-        update: Un(t, n.key, n.data),
-        updateMask: Wn(n.fieldMask)
+        update: kn(t, n.key, n.data),
+        updateMask: Yn(n.fieldMask)
     }; else {
-        if (!(n instanceof Pn)) return _();
+        if (!(n instanceof Rn)) return g();
         e = {
-            verify: xn(t, n.key)
+            verify: On(t, n.key)
         };
     }
     return n.fieldTransforms.length > 0 && (e.updateTransforms = n.fieldTransforms.map((t => function(t, n) {
         const e = n.transform;
-        if (e instanceof pn) return {
+        if (e instanceof yn) return {
             fieldPath: n.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
-        if (e instanceof yn) return {
+        if (e instanceof _n) return {
             fieldPath: n.field.canonicalString(),
             appendMissingElements: {
                 values: e.elements
             }
         };
-        if (e instanceof _n) return {
+        if (e instanceof gn) return {
             fieldPath: n.field.canonicalString(),
             removeAllFromArray: {
                 values: e.elements
             }
         };
-        if (e instanceof gn) return {
+        if (e instanceof bn) return {
             fieldPath: n.field.canonicalString(),
             increment: e.O
         };
-        throw _();
+        throw g();
     }(0, t)))), n.precondition.isNone || (e.currentDocument = function(t, n) {
         return void 0 !== n.updateTime ? {
-            updateTime: Fn(t, n.updateTime)
+            updateTime: Sn(t, n.updateTime)
         } : void 0 !== n.exists ? {
             exists: n.exists
-        } : _();
+        } : g();
     }(t, n.precondition)), e;
 }
 
-function Mn(t, n) {
+function Bn(t, n) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const e = {
         structuredQuery: {}
     }, r = n.path;
-    null !== n.collectionGroup ? (e.parent = Cn(t, r), e.structuredQuery.from = [ {
+    null !== n.collectionGroup ? (e.parent = Ln(t, r), e.structuredQuery.from = [ {
         collectionId: n.collectionGroup,
         allDescendants: !0
-    } ]) : (e.parent = Cn(t, r.popLast()), e.structuredQuery.from = [ {
+    } ]) : (e.parent = Ln(t, r.popLast()), e.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     const s = function(t) {
@@ -2837,36 +2849,36 @@ function Mn(t, n) {
         // visible for testing
         function(t) {
             if ("==" /* EQUAL */ === t.op) {
-                if (Ut(t.value)) return {
+                if (kt(t.value)) return {
                     unaryFilter: {
-                        field: Qn(t.field),
+                        field: Wn(t.field),
                         op: "IS_NAN"
                     }
                 };
-                if (Lt(t.value)) return {
+                if (Ut(t.value)) return {
                     unaryFilter: {
-                        field: Qn(t.field),
+                        field: Wn(t.field),
                         op: "IS_NULL"
                     }
                 };
             } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                if (Ut(t.value)) return {
+                if (kt(t.value)) return {
                     unaryFilter: {
-                        field: Qn(t.field),
+                        field: Wn(t.field),
                         op: "IS_NOT_NAN"
                     }
                 };
-                if (Lt(t.value)) return {
+                if (Ut(t.value)) return {
                     unaryFilter: {
-                        field: Qn(t.field),
+                        field: Wn(t.field),
                         op: "IS_NOT_NULL"
                     }
                 };
             }
             return {
                 fieldFilter: {
-                    field: Qn(t.field),
-                    op: Gn(t.op),
+                    field: Wn(t.field),
+                    op: Qn(t.op),
                     value: t.value
                 }
             };
@@ -2886,52 +2898,52 @@ function Mn(t, n) {
         // visible for testing
         function(t) {
             return {
-                field: Qn(t.field),
-                direction: zn(t.dir)
+                field: Wn(t.field),
+                direction: Gn(t.dir)
             };
         }(t)));
     }(n.orderBy);
     i && (e.structuredQuery.orderBy = i);
     const o = function(t, n) {
-        return t.S || ut(n) ? n : {
+        return t.S || ct(n) ? n : {
             value: n
         };
     }(t, n.limit);
-    return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = Bn(n.startAt)), 
-    n.endAt && (e.structuredQuery.endAt = Bn(n.endAt)), e;
+    return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = zn(n.startAt)), 
+    n.endAt && (e.structuredQuery.endAt = zn(n.endAt)), e;
 }
 
-function Bn(t) {
+function zn(t) {
     return {
         before: t.before,
         values: t.position
     };
 }
 
-// visible for testing
-function zn(t) {
-    return Rn[t];
-}
-
 // visible for testing
 function Gn(t) {
     return Vn[t];
 }
 
+// visible for testing
 function Qn(t) {
+    return Dn[t];
+}
+
+function Wn(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Wn(t) {
+function Yn(t) {
     const n = [];
     return t.fields.forEach((t => n.push(t.canonicalString()))), {
         fieldPaths: n
     };
 }
 
-function Yn(t) {
+function Hn(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2951,8 +2963,8 @@ function Yn(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 Hn(t) {
-    return new Dn(t, /* useProto3Json= */ !0);
+ */ function Kn(t) {
+    return new Nn(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -2980,7 +2992,7 @@ function Yn(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class Kn {
+class Jn {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3035,7 +3047,7 @@ class Kn {
         // 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 && w("ExponentialBackoff", `Backing off for ${r} ms (base delay: ${this.j} ms, delay with jitter: ${n} ms, last attempt: ${e} ms ago)`), 
+                r > 0 && m("ExponentialBackoff", `Backing off for ${r} ms (base delay: ${this.j} ms, delay with jitter: ${n} ms, last attempt: ${e} ms ago)`), 
         this.M = this.C.enqueueAfterDelay(this.timerId, r, (() => (this.B = Date.now(), 
         t()))), 
         // Apply backoff factor to determine next delay and ensure it is within
@@ -3078,24 +3090,24 @@ class Kn {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class Jn extends class {} {
+class Xn 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 L($, "The client has already been terminated.");
+        if (this.J) throw new U(F, "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 L(T, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === N && (this.authCredentials.invalidateToken(), 
+            this.appCheckCredentials.invalidateToken()), t) : new U(I, 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 L(T, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === N && (this.authCredentials.invalidateToken(), 
+            this.appCheckCredentials.invalidateToken()), t) : new U(I, t.toString());
         }));
     }
     terminate() {
@@ -3105,38 +3117,38 @@ class Jn extends class {} {
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function Xn(t, n) {
-    const e = b(t), r = Ln(e.q) + "/documents", s = {
-        writes: n.map((t => jn(e.q, t)))
+async function Zn(t, n) {
+    const e = v(t), r = Un(e.q) + "/documents", s = {
+        writes: n.map((t => Mn(e.q, t)))
     };
     await e.m("Commit", r, s);
 }
 
-async function Zn(t, n) {
-    const e = b(t), r = Ln(e.q) + "/documents", s = {
-        documents: n.map((t => xn(e.q, t)))
+async function te(t, n) {
+    const e = v(t), r = Un(e.q) + "/documents", s = {
+        documents: n.map((t => On(e.q, t)))
     }, i = await e.T("BatchGetDocuments", r, s), o = new Map;
     i.forEach((t => {
-        const n = kn(e.q, t);
+        const n = jn(e.q, t);
         o.set(n.key.toString(), n);
     }));
     const u = [];
     return n.forEach((t => {
         const n = o.get(t.toString());
-        g(!!n), u.push(n);
+        b(!!n), u.push(n);
     })), u;
 }
 
-async function te(t, n) {
-    const e = b(t), r = Mn(e.q, fn(n));
+async function ne(t, n) {
+    const e = v(t), r = Bn(e.q, dn(n));
     return (await e.T("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, n, e) {
-        const r = On(t, n.name), s = Sn(n.updateTime), i = new Mt({
+        const r = Cn(t, n.name), s = xn(n.updateTime), i = new Bt({
             mapValue: {
                 fields: n.fields
             }
-        }), o = Bt.newFoundDocument(r, s, i);
+        }), o = zt.newFoundDocument(r, s, i);
         return e && o.setHasCommittedMutations(), e ? o.setHasCommittedMutations() : o;
     }(e.q, t.document, void 0)));
 }
@@ -3156,7 +3168,7 @@ async function te(t, n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const ne = new Map;
+ */ const ee = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3167,17 +3179,17 @@ async function te(t, n) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function ee(t) {
-    if (t._terminated) throw new L($, "The client has already been terminated.");
-    if (!ne.has(t)) {
-        w("ComponentProvider", "Initializing Datastore");
+function re(t) {
+    if (t._terminated) throw new U(F, "The client has already been terminated.");
+    if (!ee.has(t)) {
+        m("ComponentProvider", "Initializing Datastore");
         const i = function(t) {
-            return new dt(t, fetch.bind(null));
+            return new wt(t, fetch.bind(null));
         }((n = t._databaseId, e = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
-        new Y(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Hn(t._databaseId), u = function(t, n, e, r) {
-            return new Jn(t, n, e, r);
+        new H(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Kn(t._databaseId), u = function(t, n, e, r) {
+            return new Xn(t, n, e, r);
         }(t._authCredentials, t._appCheckCredentials, i, o);
-        ne.set(t, u);
+        ee.set(t, u);
     }
     var n, e, r, s;
     /**
@@ -3195,7 +3207,7 @@ function ee(t) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */    return ne.get(t);
+ */    return ee.get(t);
 }
 
 /**
@@ -3207,21 +3219,21 @@ function ee(t) {
  * user-supplied `FirestoreSettings` object. This is a separate type so that
  * defaults can be supplied and the value can be checked for equality.
  */
-class re {
+class se {
     constructor(t) {
         var n;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new L(I, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new U(A, "Can't provide ssl option if host option is not set");
             this.host = "firestore.googleapis.com", this.ssl = true;
         } else this.host = t.host, this.ssl = null === (n = t.ssl) || void 0 === n || n;
         if (this.credentials = t.credentials, this.ignoreUndefinedProperties = !!t.ignoreUndefinedProperties, 
         void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
-            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new L(I, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new U(A, "cacheSizeBytes must be at least 1048576");
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
         this.useFetchStreams = !!t.useFetchStreams, function(t, n, e, r) {
-            if (!0 === n && !0 === r) throw new L(I, `${t} and ${e} cannot be used together.`);
+            if (!0 === n && !0 === r) throw new U(A, `${t} and ${e} cannot be used together.`);
         }("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
     }
     isEqual(t) {
@@ -3249,18 +3261,18 @@ class re {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class se {
+ */ class ie {
     /** @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 re({}), 
-        this._settingsFrozen = !1, t instanceof H ? this._databaseId = t : (this._app = t, 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new se({}), 
+        this._settingsFrozen = !1, t instanceof K ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
-            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new L(I, '"projectId" not provided in firebase.initializeApp.');
-            return new H(t.options.projectId);
+            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(A, '"projectId" not provided in firebase.initializeApp.');
+            return new K(t.options.projectId);
         }
         /**
  * Initializes a new instance of Cloud Firestore with the provided settings.
@@ -3278,7 +3290,7 @@ class re {
      * The {@link @firebase/app#FirebaseApp} associated with this `Firestore` service
      * instance.
      */    get app() {
-        if (!this._app) throw new L($, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+        if (!this._app) throw new U(F, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
         return this._app;
     }
     get _initialized() {
@@ -3288,21 +3300,21 @@ class re {
         return void 0 !== this._terminateTask;
     }
     _setSettings(t) {
-        if (this._settingsFrozen) throw new L($, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
-        this._settings = new re(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
-            if (!t) return new j;
+        if (this._settingsFrozen) throw new U(F, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
+        this._settings = new se(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+            if (!t) return new M;
             switch (t.type) {
               case "gapi":
                 const n = t.client;
                 // Make sure this really is a Gapi client.
-                                return g(!("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 Q(n, t.sessionIndex || "0", t.iamToken || null);
 
               case "provider":
                 return t.client;
 
               default:
-                throw new L(I, "makeAuthCredentialsProvider failed due to invalid credential type");
+                throw new U(A, "makeAuthCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }
@@ -3330,15 +3342,15 @@ class re {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const n = ne.get(t);
-            n && (w("ComponentProvider", "Removing Datastore"), ne.delete(t), n.terminate());
+            const n = ee.get(t);
+            n && (m("ComponentProvider", "Removing Datastore"), ee.delete(t), n.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function ie(t, n) {
+function oe(t, n) {
     const e = _getProvider(t, "firestore/lite");
-    if (e.isInitialized()) throw new L($, "Firestore can only be initialized once per app.");
+    if (e.isInitialized()) throw new U(F, "Firestore can only be initialized once per app.");
     return e.initialize({
         options: n
     });
@@ -3352,7 +3364,7 @@ function ie(t, n) {
  * @param app - The {@link @firebase/app#FirebaseApp} instance that the returned `Firestore`
  * instance is associated with.
  * @returns The `Firestore` instance of the provided app.
- */ function oe(n = getApp()) {
+ */ function ue(n = getApp()) {
     return _getProvider(n, "firestore/lite").getImmediate();
 }
 
@@ -3368,24 +3380,24 @@ function ie(t, n) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function ue(t, n, e, r = {}) {
+ */ function ce(t, n, e, r = {}) {
     var s;
-    const i = (t = it(t, se))._getSettings();
-    if ("firestore.googleapis.com" !== i.host && i.host !== n && p("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
+    const i = (t = ot(t, ie))._getSettings();
+    if ("firestore.googleapis.com" !== i.host && i.host !== n && y("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, i), {
         host: `${n}:${e}`,
         ssl: !1
     })), r.mockUserToken) {
         let n, e;
-        if ("string" == typeof r.mockUserToken) n = r.mockUserToken, e = h.MOCK_USER; else {
+        if ("string" == typeof r.mockUserToken) n = r.mockUserToken, e = l.MOCK_USER; else {
             // Let createMockUserToken validate first (catches common mistakes like
             // invalid field "uid" and missing field "sub" / "user_id".)
             n = createMockUserToken(r.mockUserToken, null === (s = t._app) || void 0 === s ? void 0 : s.options.projectId);
             const i = r.mockUserToken.sub || r.mockUserToken.user_id;
-            if (!i) throw new L(I, "mockUserToken must contain 'sub' or 'user_id' field!");
-            e = new h(i);
+            if (!i) throw new U(A, "mockUserToken must contain 'sub' or 'user_id' field!");
+            e = new l(i);
         }
-        t._authCredentials = new M(new k(n, e));
+        t._authCredentials = new B(new j(n, e));
     }
 }
 
@@ -3408,8 +3420,8 @@ function ie(t, n) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function ce(t) {
-    return t = it(t, se), _removeServiceInstance(t.app, "firestore/lite"), t._delete();
+ */ function ae(t) {
+    return t = ot(t, ie), _removeServiceInstance(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3449,7 +3461,7 @@ function ie(t, n) {
  * and can be used to write, read, or listen to the location. The document at
  * the referenced location may or may not exist.
  */
-class ae {
+class he {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -3477,17 +3489,17 @@ class ae {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new le(this.firestore, this.converter, this._key.path.popLast());
+        return new fe(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new ae(this.firestore, t, this._key);
+        return new he(this.firestore, t, this._key);
     }
 }
 
 /**
  * A `Query` refers to a query which you can read or listen to. You can also
  * construct refined `Query` objects by adding filters and ordering.
- */ class he {
+ */ class le {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -3500,17 +3512,17 @@ class ae {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new he(this.firestore, t, this._query);
+        return new le(this.firestore, t, this._query);
     }
 }
 
 /**
  * A `CollectionReference` object can be used for adding documents, getting
  * document references, and querying for documents (using {@link query}).
- */ class le extends he {
+ */ class fe extends le {
     /** @hideconstructor */
     constructor(t, n, e) {
-        super(t, n, new on(e)), this._path = e, 
+        super(t, n, new un(e)), this._path = e, 
         /** The type of this Firestore reference. */
         this.type = "collection";
     }
@@ -3528,23 +3540,23 @@ class ae {
      * subcollection. If this isn't a subcollection, the reference is null.
      */    get parent() {
         const t = this._path.popLast();
-        return t.isEmpty() ? null : new ae(this.firestore, 
-        /* converter= */ null, new tt(t));
+        return t.isEmpty() ? null : new he(this.firestore, 
+        /* converter= */ null, new nt(t));
     }
     withConverter(t) {
-        return new le(this.firestore, t, this._path);
+        return new fe(this.firestore, t, this._path);
     }
 }
 
-function fe(t, n, ...e) {
-    if (t = getModularInstance(t), nt("collection", "path", n), t instanceof se) {
-        const r = J.fromString(n, ...e);
-        return rt(r), new le(t, /* converter= */ null, r);
+function de(t, n, ...e) {
+    if (t = getModularInstance(t), et("collection", "path", n), t instanceof ie) {
+        const r = X.fromString(n, ...e);
+        return st(r), new fe(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof ae || t instanceof le)) throw new L(I, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-        const r = t._path.child(J.fromString(n, ...e));
-        return rt(r), new le(t.firestore, 
+        if (!(t instanceof he || t instanceof fe)) throw new U(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 fe(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -3561,32 +3573,32 @@ function fe(t, n, ...e) {
  * collection or subcollection with this ID as the last segment of its path
  * will be included. Cannot contain a slash.
  * @returns The created `Query`.
- */ function de(t, n) {
-    if (t = it(t, se), nt("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new L(I, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new he(t, 
+ */ function we(t, n) {
+    if (t = ot(t, ie), et("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new U(A, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new le(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
  * within the provided collection group.
  */
     function(t) {
-        return new on(J.emptyPath(), t);
+        return new un(X.emptyPath(), t);
     }(n));
 }
 
-function we(t, n, ...e) {
+function me(t, n, ...e) {
     if (t = getModularInstance(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (n = mt.P()), nt("doc", "path", n), t instanceof se) {
-        const r = J.fromString(n, ...e);
-        return et(r), new ae(t, 
-        /* converter= */ null, new tt(r));
+    1 === arguments.length && (n = pt.P()), et("doc", "path", n), t instanceof ie) {
+        const r = X.fromString(n, ...e);
+        return rt(r), new he(t, 
+        /* converter= */ null, new nt(r));
     }
     {
-        if (!(t instanceof ae || t instanceof le)) throw new L(I, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-        const r = t._path.child(J.fromString(n, ...e));
-        return et(r), new ae(t.firestore, t instanceof le ? t.converter : null, new tt(r));
+        if (!(t instanceof he || t instanceof fe)) throw new U(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 he(t.firestore, t instanceof fe ? t.converter : null, new nt(r));
     }
 }
 
@@ -3597,8 +3609,8 @@ function we(t, n, ...e) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function me(t, n) {
-    return t = getModularInstance(t), n = getModularInstance(n), (t instanceof ae || t instanceof le) && (n instanceof ae || n instanceof le) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
+ */ function pe(t, n) {
+    return t = getModularInstance(t), n = getModularInstance(n), (t instanceof he || t instanceof fe) && (n instanceof he || n instanceof fe) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
 }
 
 /**
@@ -3609,8 +3621,8 @@ function we(t, n, ...e) {
  * @param right - A `Query` to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function pe(t, n) {
-    return t = getModularInstance(t), n = getModularInstance(n), t instanceof he && n instanceof he && (t.firestore === n.firestore && dn(t._query, n._query) && t.converter === n.converter);
+ */ function ye(t, n) {
+    return t = getModularInstance(t), n = getModularInstance(n), t instanceof le && n instanceof le && (t.firestore === n.firestore && wn(t._query, n._query) && t.converter === n.converter);
 }
 
 /**
@@ -3636,7 +3648,7 @@ function we(t, n, ...e) {
  *
  * Create a `FieldPath` by providing field names. If more than one field
  * name is provided, the path will point to a nested field in a document.
- */ class ye {
+ */ class _e {
     /**
      * 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.
@@ -3644,8 +3656,8 @@ function we(t, n, ...e) {
      * @param fieldNames - A list of field names.
      */
     constructor(...t) {
-        for (let n = 0; n < t.length; ++n) if (0 === t[n].length) throw new L(I, "Invalid field name at argument $(i + 1). Field names must not be empty.");
-        this._internalPath = new Z(t);
+        for (let n = 0; n < t.length; ++n) if (0 === t[n].length) throw new U(A, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        this._internalPath = new tt(t);
     }
     /**
      * Returns true if this `FieldPath` is equal to the provided one.
@@ -3660,8 +3672,8 @@ function we(t, n, ...e) {
 /**
  * Returns a special sentinel `FieldPath` to refer to the ID of a document.
  * It can be used in queries to sort or filter by the document ID.
- */ function _e() {
-    return new ye("__name__");
+ */ function ge() {
+    return new _e("__name__");
 }
 
 /**
@@ -3682,7 +3694,7 @@ function we(t, n, ...e) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class ge {
+ */ class be {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -3694,9 +3706,9 @@ function we(t, n, ...e) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new ge(Tt.fromBase64String(t));
+            return new be(It.fromBase64String(t));
         } catch (t) {
-            throw new L(I, "Failed to construct data from Base64 string: " + t);
+            throw new U(A, "Failed to construct data from Base64 string: " + t);
         }
     }
     /**
@@ -3704,7 +3716,7 @@ function we(t, n, ...e) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new ge(Tt.fromUint8Array(t));
+        return new be(It.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3756,7 +3768,7 @@ function we(t, n, ...e) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class be {
+ */ class ve {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -3788,7 +3800,7 @@ function we(t, n, ...e) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ class ve {
+ */ class Ee {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3796,8 +3808,8 @@ function we(t, n, ...e) {
      * @param longitude - The longitude as number between -180 and 180.
      */
     constructor(t, n) {
-        if (!isFinite(t) || t < -90 || t > 90) throw new L(I, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(n) || n < -180 || n > 180) throw new L(I, "Longitude must be a number between -180 and 180, but was: " + n);
+        if (!isFinite(t) || t < -90 || t > 90) throw new U(A, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(n) || n < -180 || n > 180) throw new U(A, "Longitude must be a number between -180 and 180, but was: " + n);
         this._lat = t, this._long = n;
     }
     /**
@@ -3828,7 +3840,7 @@ function we(t, n, ...e) {
      * Actually private to JS consumers of our API, so this function is prefixed
      * with an underscore.
      */    _compareTo(t) {
-        return pt(this._lat, t._lat) || pt(this._long, t._long);
+        return yt(this._lat, t._lat) || yt(this._long, t._long);
     }
 }
 
@@ -3847,29 +3859,29 @@ function we(t, n, ...e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const Ee = /^__.*__$/;
+ */ const Te = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class Te {
+/** The result of parsing document data (e.g. for a setData call). */ class Ie {
     constructor(t, n, e) {
         this.data = t, this.fieldMask = n, this.fieldTransforms = e;
     }
     toMutation(t, n) {
-        return null !== this.fieldMask ? new In(t, this.data, this.fieldMask, n, this.fieldTransforms) : new Tn(t, this.data, n, this.fieldTransforms);
+        return null !== this.fieldMask ? new An(t, this.data, this.fieldMask, n, this.fieldTransforms) : new In(t, this.data, n, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class Ie {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class Ae {
     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 In(t, this.data, this.fieldMask, n, this.fieldTransforms);
+        return new An(t, this.data, this.fieldMask, n, this.fieldTransforms);
     }
 }
 
-function Ae(t) {
+function Pe(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3883,11 +3895,11 @@ function Ae(t) {
         return !1;
 
       default:
-        throw _();
+        throw g();
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class Pe {
+/** A "context" object passed around while parsing user data. */ class Re {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3919,7 +3931,7 @@ function Ae(t) {
         return this.settings.tt;
     }
     /** Returns a new context with the specified settings overwritten. */    nt(t) {
-        return new Pe(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+        return new Re(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
     et(t) {
         var n;
@@ -3946,7 +3958,7 @@ function Ae(t) {
         });
     }
     ut(t) {
-        return Qe(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
+        return We(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)));
@@ -3958,52 +3970,52 @@ function Ae(t) {
     }
     st(t) {
         if (0 === t.length) throw this.ut("Document fields must not be empty");
-        if (Ae(this.tt) && Ee.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
+        if (Pe(this.tt) && Te.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
     }
 }
 
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ class Re {
+ */ class Ve {
     constructor(t, n, e) {
-        this.databaseId = t, this.ignoreUndefinedProperties = n, this.q = e || Hn(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = n, this.q = e || Kn(t);
     }
     /** Creates a new top-level parse context. */    ht(t, n, e, r = !1) {
-        return new Pe({
+        return new Re({
             tt: t,
             methodName: n,
             at: e,
-            path: Z.emptyPath(),
+            path: tt.emptyPath(),
             rt: !1,
             ct: r
         }, this.databaseId, this.q, this.ignoreUndefinedProperties);
     }
 }
 
-function Ve(t) {
-    const n = t._freezeSettings(), e = Hn(t._databaseId);
-    return new Re(t._databaseId, !!n.ignoreUndefinedProperties, e);
+function De(t) {
+    const n = t._freezeSettings(), e = Kn(t._databaseId);
+    return new Ve(t._databaseId, !!n.ignoreUndefinedProperties, e);
 }
 
-/** Parse document data from a set() call. */ function De(t, n, e, r, s, i = {}) {
+/** Parse document data from a set() call. */ function Ne(t, n, e, r, s, i = {}) {
     const o = t.ht(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , n, e, s);
-    Me("Data must be an object, but it was:", o, r);
-    const u = ke(r, o);
+    Be("Data must be an object, but it was:", o, r);
+    const u = je(r, o);
     let c, a;
-    if (i.merge) c = new Et(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
+    if (i.merge) c = new Tt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
         const t = [];
         for (const r of i.mergeFields) {
-            const s = Be(n, r, e);
-            if (!o.contains(s)) throw new L(I, `Field '${s}' is specified in your field mask but missing from your input data.`);
-            We(t, s) || t.push(s);
+            const s = ze(n, r, e);
+            if (!o.contains(s)) throw new U(A, `Field '${s}' is specified in your field mask but missing from your input data.`);
+            Ye(t, s) || t.push(s);
         }
-        c = new Et(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
+        c = new Tt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
     } else c = null, a = o.fieldTransforms;
-    return new Te(new Mt(u), c, a);
+    return new Ie(new Bt(u), c, a);
 }
 
-class Ne extends be {
+class $e extends ve {
     _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
@@ -4011,7 +4023,7 @@ class Ne extends be {
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof Ne;
+        return t instanceof $e;
     }
 }
 
@@ -4030,8 +4042,8 @@ class Ne extends be {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function $e(t, n, e) {
-    return new Pe({
+ */ function Fe(t, n, e) {
+    return new Re({
         tt: 3 /* Argument */ ,
         at: n.settings.at,
         methodName: t._methodName,
@@ -4039,23 +4051,23 @@ class Ne extends be {
     }, n.databaseId, n.q, n.ignoreUndefinedProperties);
 }
 
-class Fe extends be {
+class Se extends ve {
     _toFieldTransform(t) {
-        return new bn(t.path, new pn);
+        return new vn(t.path, new yn);
     }
     isEqual(t) {
-        return t instanceof Fe;
+        return t instanceof Se;
     }
 }
 
-class Se extends be {
+class xe extends ve {
     constructor(t, n) {
         super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        const n = $e(this, t, 
-        /*array=*/ !0), e = this.lt.map((t => Ue(t, n))), r = new yn(e);
-        return new bn(t.path, r);
+        const n = Fe(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => ke(t, n))), r = new _n(e);
+        return new vn(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4063,14 +4075,14 @@ class Se extends be {
     }
 }
 
-class qe extends be {
+class qe extends ve {
     constructor(t, n) {
         super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        const n = $e(this, t, 
-        /*array=*/ !0), e = this.lt.map((t => Ue(t, n))), r = new _n(e);
-        return new bn(t.path, r);
+        const n = Fe(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => ke(t, n))), r = new gn(e);
+        return new vn(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4078,13 +4090,13 @@ class qe extends be {
     }
 }
 
-class xe extends be {
+class Oe extends ve {
     constructor(t, n) {
         super(t), this.ft = n;
     }
     _toFieldTransform(t) {
-        const n = new gn(t.q, wn(t.q, this.ft));
-        return new bn(t.path, n);
+        const n = new bn(t.q, mn(t.q, this.ft));
+        return new vn(t.path, n);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4092,50 +4104,50 @@ class xe extends be {
     }
 }
 
-/** Parse update data from an update() call. */ function Oe(t, n, e, r) {
+/** Parse update data from an update() call. */ function Ce(t, n, e, r) {
     const s = t.ht(1 /* Update */ , n, e);
-    Me("Data must be an object, but it was:", s, r);
-    const i = [], o = Mt.empty();
-    vt(r, ((t, r) => {
-        const u = Ge(n, t, e);
+    Be("Data must be an object, but it was:", s, r);
+    const i = [], o = Bt.empty();
+    Et(r, ((t, r) => {
+        const u = Qe(n, t, e);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = getModularInstance(r);
         const c = s.it(u);
-        if (r instanceof Ne) 
+        if (r instanceof $e) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = Ue(r, c);
+            const t = ke(r, c);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
-    const u = new Et(i);
-    return new Ie(o, u, s.fieldTransforms);
+    const u = new Tt(i);
+    return new Ae(o, u, s.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function Ce(t, n, e, r, s, i) {
-    const o = t.ht(1 /* Update */ , n, e), u = [ Be(n, r, e) ], c = [ s ];
-    if (i.length % 2 != 0) throw new L(I, `Function ${n}() needs to be called with an even number of arguments that alternate between field names and values.`);
-    for (let t = 0; t < i.length; t += 2) u.push(Be(n, i[t])), c.push(i[t + 1]);
-    const h = [], l = Mt.empty();
+/** Parse update data from a list of field/value arguments. */ function Le(t, n, e, r, s, i) {
+    const o = t.ht(1 /* Update */ , n, e), u = [ ze(n, r, e) ], c = [ s ];
+    if (i.length % 2 != 0) throw new U(A, `Function ${n}() needs to be called with an even number of arguments that alternate between field names and values.`);
+    for (let t = 0; t < i.length; t += 2) u.push(ze(n, i[t])), c.push(i[t + 1]);
+    const a = [], l = Bt.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 (!We(h, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!Ye(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 = getModularInstance(e);
         const r = o.it(n);
-        if (e instanceof Ne) 
+        if (e instanceof $e) 
         // Add it to the field mask, but don't add anything to updateData.
-        h.push(n); else {
-            const t = Ue(e, r);
-            null != t && (h.push(n), l.set(n, t));
+        a.push(n); else {
+            const t = ke(e, r);
+            null != t && (a.push(n), l.set(n, t));
         }
     }
-    const f = new Et(h);
-    return new Ie(l, f, o.fieldTransforms);
+    const f = new Tt(a);
+    return new Ae(l, f, o.fieldTransforms);
 }
 
 /**
@@ -4144,8 +4156,8 @@ class xe extends be {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function Le(t, n, e, r = !1) {
-    return Ue(e, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
+ */ function Ue(t, n, e, r = !1) {
+    return ke(e, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
 }
 
 /**
@@ -4156,12 +4168,12 @@ class xe extends be {
  * the source of the data being parsed, etc.
  * @returns The parsed value, or null if the value was a FieldValue sentinel
  * that should not be included in the resulting parsed data.
- */ function Ue(t, n) {
-    if (je(
+ */ function ke(t, n) {
+    if (Me(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = getModularInstance(t))) return Me("Unsupported field value:", n, t), ke(t, n);
-    if (t instanceof be) 
+    t = getModularInstance(t))) return Be("Unsupported field value:", n, t), je(t, n);
+    if (t instanceof ve) 
     // 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
@@ -4173,7 +4185,7 @@ class xe extends be {
  */
     return function(t, n) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Ae(n.tt)) throw n.ut(`${t._methodName}() can only be used with update() and set()`);
+        if (!Pe(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);
@@ -4203,7 +4215,7 @@ class xe extends be {
             const e = [];
             let r = 0;
             for (const s of t) {
-                let t = Ue(s, n.ot(r));
+                let t = ke(s, n.ot(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4222,7 +4234,7 @@ class xe extends be {
         if (null === (t = getModularInstance(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return wn(n.q, t);
+        if ("number" == typeof t) return mn(n.q, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4230,37 +4242,37 @@ class xe extends be {
             stringValue: t
         };
         if (t instanceof Date) {
-            const e = _t.fromDate(t);
+            const e = gt.fromDate(t);
             return {
-                timestampValue: Nn(n.q, e)
+                timestampValue: $n(n.q, e)
             };
         }
-        if (t instanceof _t) {
+        if (t instanceof gt) {
             // Firestore backend truncates precision down to microseconds. To ensure
             // offline mode works the same with regards to truncation, perform the
             // truncation immediately without waiting for the backend to do that.
-            const e = new _t(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            const e = new gt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Nn(n.q, e)
+                timestampValue: $n(n.q, e)
             };
         }
-        if (t instanceof ve) return {
+        if (t instanceof Ee) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof ge) return {
-            bytesValue: $n(n.q, t._byteString)
+        if (t instanceof be) return {
+            bytesValue: Fn(n.q, t._byteString)
         };
-        if (t instanceof ae) {
+        if (t instanceof he) {
             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: qn(t.firestore._databaseId || n.databaseId, t._key.path)
             };
         }
-        throw n.ut(`Unsupported field value: ${st(t)}`);
+        throw n.ut(`Unsupported field value: ${it(t)}`);
     }
     /**
  * Checks whether an object looks like a JSON object that should be converted
@@ -4271,13 +4283,13 @@ class xe extends be {
  */ (t, n);
 }
 
-function ke(t, n) {
+function je(t, n) {
     const e = {};
     return !function(t) {
         for (const n in t) if (Object.prototype.hasOwnProperty.call(t, n)) return !1;
         return !0;
-    }(t) ? vt(t, ((t, r) => {
-        const s = Ue(r, n.et(t));
+    }(t) ? Et(t, ((t, r) => {
+        const s = ke(r, n.et(t));
         null != s && (e[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -4289,35 +4301,35 @@ function ke(t, n) {
     };
 }
 
-function je(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof _t || t instanceof ve || t instanceof ge || t instanceof ae || t instanceof be);
+function Me(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof gt || t instanceof Ee || t instanceof be || t instanceof he || t instanceof ve);
 }
 
-function Me(t, n, e) {
-    if (!je(e) || !function(t) {
+function Be(t, n, e) {
+    if (!Me(e) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(e)) {
-        const r = st(e);
+        const r = it(e);
         throw "an object" === r ? n.ut(t + " a custom object") : n.ut(t + " " + r);
     }
 }
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function Be(t, n, e) {
+ */ function ze(t, n, e) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    n = getModularInstance(n)) instanceof ye) return n._internalPath;
-    if ("string" == typeof n) return Ge(t, n);
-    throw Qe("Field path arguments must be of type string or FieldPath.", t, 
+    n = getModularInstance(n)) instanceof _e) return n._internalPath;
+    if ("string" == typeof n) return Qe(t, n);
+    throw We("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 ze = new RegExp("[~\\*/\\[\\]]");
+ */ const Ge = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4327,29 +4339,29 @@ function Me(t, n, e) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function Ge(t, n, e) {
-    if (n.search(ze) >= 0) throw Qe(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function Qe(t, n, e) {
+    if (n.search(Ge) >= 0) throw We(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, e);
     try {
-        return new ye(...n.split("."))._internalPath;
+        return new _e(...n.split("."))._internalPath;
     } catch (r) {
-        throw Qe(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw We(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, e);
     }
 }
 
-function Qe(t, n, e, r, s) {
+function We(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 L(I, u + t + c);
+    c += ")"), new U(A, u + t + c);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function We(t, n) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Ye(t, n) {
     return t.some((t => t.isEqual(n)));
 }
 
@@ -4377,7 +4389,7 @@ function Qe(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 Ye {
+ */ class He {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4393,7 +4405,7 @@ function Qe(t, n, e, r, s) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new ae(this._firestore, this._converter, this._key);
+        return new he(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -4413,7 +4425,7 @@ function Qe(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 He(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new Ke(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4433,7 +4445,7 @@ function Qe(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(Xe("DocumentSnapshot.get", t));
+            const n = this._document.data.field(Ze("DocumentSnapshot.get", t));
             if (null !== n) return this._userDataWriter.convertValue(n);
         }
     }
@@ -4449,7 +4461,7 @@ function Qe(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 He extends Ye {
+ */ class Ke extends He {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -4467,7 +4479,7 @@ function Qe(t, n, e, r, s) {
  * array via the `docs` property or enumerated using the `forEach` method. The
  * number of documents can be determined via the `empty` and `size`
  * properties.
- */ class Ke {
+ */ class Je {
     /** @hideconstructor */
     constructor(t, n) {
         this._docs = n, this.query = t;
@@ -4498,14 +4510,14 @@ function Qe(t, n, e, r, s) {
  * @param left - A snapshot to compare.
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
- */ function Je(t, n) {
-    return t = getModularInstance(t), n = getModularInstance(n), t instanceof Ye && n instanceof Ye ? t._firestore === n._firestore && t._key.isEqual(n._key) && (null === t._document ? null === n._document : t._document.isEqual(n._document)) && t._converter === n._converter : t instanceof Ke && n instanceof Ke && (pe(t.query, n.query) && yt(t.docs, n.docs, Je));
+ */ function Xe(t, n) {
+    return t = getModularInstance(t), n = getModularInstance(n), t instanceof He && n instanceof He ? t._firestore === n._firestore && t._key.isEqual(n._key) && (null === t._document ? null === n._document : t._document.isEqual(n._document)) && t._converter === n._converter : t instanceof Je && n instanceof Je && (ye(t.query, n.query) && _t(t.docs, n.docs, Xe));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function Xe(t, n) {
-    return "string" == typeof n ? Ge(t, n) : n instanceof ye ? n._internalPath : n._delegate._internalPath;
+ */ function Ze(t, n) {
+    return "string" == typeof n ? Qe(t, n) : n instanceof _e ? n._internalPath : n._delegate._internalPath;
 }
 
 /**
@@ -4532,7 +4544,7 @@ function Qe(t, n, e, r, s) {
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
  */
-class Ze {}
+class tr {}
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4542,40 +4554,40 @@ class Ze {}
  * @param queryConstraints - The list of {@link QueryConstraint}s to apply.
  * @throws if any of the provided query constraints cannot be combined with the
  * existing or new constraints.
- */ function tr(t, ...n) {
+ */ function nr(t, ...n) {
     for (const e of n) t = e._apply(t);
     return t;
 }
 
-class nr extends Ze {
+class er extends tr {
     constructor(t, n, e) {
         super(), this.dt = t, this.wt = n, this.yt = e, this.type = "where";
     }
     _apply(t) {
-        const n = Ve(t.firestore), e = function(t, n, e, r, s, i, o) {
+        const n = De(t.firestore), e = function(t, n, e, r, s, i, o) {
             let u;
             if (s.isKeyField()) {
-                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new L(I, `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(A, `Invalid Query. You can't perform '${i}' queries on FieldPath.documentId().`);
                 if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
-                    pr(o, i);
+                    yr(o, i);
                     const n = [];
-                    for (const e of o) n.push(mr(r, t, e));
+                    for (const e of o) n.push(pr(r, t, e));
                     u = {
                         arrayValue: {
                             values: n
                         }
                     };
-                } else u = mr(r, t, o);
-            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || pr(o, i), 
-            u = Le(e, n, o, 
+                } else u = pr(r, t, o);
+            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || yr(o, i), 
+            u = Ue(e, n, o, 
             /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
-            const c = Qt.create(s, i, u);
+            const c = Wt.create(s, i, u);
             return function(t, n) {
                 if (n.N()) {
-                    const e = an(t);
-                    if (null !== e && !e.isEqual(n.field)) throw new L(I, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${e.toString()}' and '${n.field.toString()}'`);
-                    const r = cn(t);
-                    null !== r && yr(t, n.field, r);
+                    const e = hn(t);
+                    if (null !== e && !e.isEqual(n.field)) throw new U(A, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${e.toString()}' and '${n.field.toString()}'`);
+                    const r = an(t);
+                    null !== r && _r(t, n.field, r);
                 }
                 const e = function(t, n) {
                     for (const e of t.filters) if (n.indexOf(e.op) >= 0) return e.op;
@@ -4616,12 +4628,12 @@ class nr extends Ze {
                 }(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 L(I, `Invalid query. You cannot use more than one '${n.op.toString()}' filter.`) : new L(I, `Invalid query. You cannot use '${n.op.toString()}' filters with '${e.toString()}' filters.`);
+                throw e === n.op ? new U(A, `Invalid query. You cannot use more than one '${n.op.toString()}' filter.`) : new U(A, `Invalid query. You cannot use '${n.op.toString()}' filters with '${e.toString()}' filters.`);
             }(t, c), c;
         }(t._query, "where", n, t.firestore._databaseId, this.dt, this.wt, this.yt);
-        return new he(t.firestore, t.converter, function(t, n) {
+        return new le(t.firestore, t.converter, function(t, n) {
             const e = t.filters.concat([ n ]);
-            return new on(t.path, t.collectionGroup, t.explicitOrderBy.slice(), e, t.limit, t.limitType, t.startAt, t.endAt);
+            return new un(t.path, t.collectionGroup, t.explicitOrderBy.slice(), e, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }
 }
@@ -4636,25 +4648,25 @@ class nr extends Ze {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function er(t, n, e) {
-    const r = n, s = Xe("where", t);
-    return new nr(s, r, e);
+ */ function rr(t, n, e) {
+    const r = n, s = Ze("where", t);
+    return new er(s, r, e);
 }
 
-class rr extends Ze {
+class sr extends tr {
     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 L(I, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
-            if (null !== t.endAt) throw new L(I, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            const r = new en(n, e);
+            if (null !== t.startAt) throw new U(A, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new U(A, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            const r = new rn(n, e);
             return function(t, n) {
-                if (null === cn(t)) {
+                if (null === an(t)) {
                     // This is the first order by. It must match any inequality.
-                    const e = an(t);
-                    null !== e && yr(t, e, n.field);
+                    const e = hn(t);
+                    null !== e && _r(t, e, n.field);
                 }
             }(t, r), r;
         }
@@ -4669,10 +4681,10 @@ class rr extends Ze {
  * 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 he(t.firestore, t.converter, function(t, n) {
+        return new le(t.firestore, t.converter, function(t, n) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             const e = t.explicitOrderBy.concat([ n ]);
-            return new on(t.path, t.collectionGroup, e, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new un(t.path, t.collectionGroup, e, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }
 }
@@ -4685,18 +4697,18 @@ class rr extends Ze {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function sr(t, n = "asc") {
-    const e = n, r = Xe("orderBy", t);
-    return new rr(r, e);
+ */ function ir(t, n = "asc") {
+    const e = n, r = Ze("orderBy", t);
+    return new sr(r, e);
 }
 
-class ir extends Ze {
+class or extends tr {
     constructor(t, n, e) {
         super(), this.type = t, this.gt = n, this.bt = e;
     }
     _apply(t) {
-        return new he(t.firestore, t.converter, function(t, n, e) {
-            return new on(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), n, e, t.startAt, t.endAt);
+        return new le(t.firestore, t.converter, function(t, n, e) {
+            return new un(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), n, e, t.startAt, t.endAt);
         }(t._query, this.gt, this.bt));
     }
 }
@@ -4706,8 +4718,8 @@ class ir extends Ze {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function or(t) {
-    return ot("limit", t), new ir("limit", t, "F" /* First */);
+ */ function ur(t) {
+    return ut("limit", t), new or("limit", t, "F" /* First */);
 }
 
 /**
@@ -4718,54 +4730,54 @@ class ir extends Ze {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function ur(t) {
-    return ot("limitToLast", t), new ir("limitToLast", t, "L" /* Last */);
+ */ function cr(t) {
+    return ut("limitToLast", t), new or("limitToLast", t, "L" /* Last */);
 }
 
-class cr extends Ze {
+class ar extends tr {
     constructor(t, n, e) {
         super(), this.type = t, this.vt = n, this.Et = e;
     }
     _apply(t) {
-        const n = wr(t, this.type, this.vt, this.Et);
-        return new he(t.firestore, t.converter, function(t, n) {
-            return new on(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, n, t.endAt);
+        const n = mr(t, this.type, this.vt, this.Et);
+        return new le(t.firestore, t.converter, function(t, n) {
+            return new un(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, n, t.endAt);
         }(t._query, n));
     }
 }
 
-function ar(...t) {
-    return new cr("startAt", t, /*before=*/ !0);
+function hr(...t) {
+    return new ar("startAt", t, /*before=*/ !0);
 }
 
-function hr(...t) {
-    return new cr("startAfter", t, 
+function lr(...t) {
+    return new ar("startAfter", t, 
     /*before=*/ !1);
 }
 
-class lr extends Ze {
+class fr extends tr {
     constructor(t, n, e) {
         super(), this.type = t, this.vt = n, this.Et = e;
     }
     _apply(t) {
-        const n = wr(t, this.type, this.vt, this.Et);
-        return new he(t.firestore, t.converter, function(t, n) {
-            return new on(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, n);
+        const n = mr(t, this.type, this.vt, this.Et);
+        return new le(t.firestore, t.converter, function(t, n) {
+            return new un(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, n);
         }(t._query, n));
     }
 }
 
-function fr(...t) {
-    return new lr("endBefore", t, /*before=*/ !0);
+function dr(...t) {
+    return new fr("endBefore", t, /*before=*/ !0);
 }
 
-function dr(...t) {
-    return new lr("endAt", t, /*before=*/ !1);
+function wr(...t) {
+    return new fr("endAt", t, /*before=*/ !1);
 }
 
-/** Helper function to create a bound from a document or fields */ function wr(t, n, e, r) {
-    if (e[0] = getModularInstance(e[0]), e[0] instanceof Ye) return function(t, n, e, r, s) {
-        if (!r) throw new L(P, `Can't use a DocumentSnapshot that doesn't exist for ${e}().`);
+/** Helper function to create a bound from a document or fields */ function mr(t, n, e, r) {
+    if (e[0] = getModularInstance(e[0]), e[0] instanceof He) return function(t, n, e, r, s) {
+        if (!r) throw new U(R, `Can't use a DocumentSnapshot that doesn't exist for ${e}().`);
         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
@@ -4774,42 +4786,42 @@ function dr(...t) {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-                for (const e of ln(t)) if (e.field.isKeyField()) i.push(Ot(n, r.key)); else {
+                for (const e of fn(t)) if (e.field.isKeyField()) i.push(Ct(n, r.key)); else {
             const t = r.data.field(e.field);
-            if (Vt(t)) throw new L(I, 'Invalid query. You are trying to start or end a query using a document for which the field "' + e.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+            if (Dt(t)) throw new U(A, 'Invalid query. You are trying to start or end a query using a document for which the field "' + e.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
             if (null === t) {
                 const t = e.field.canonicalString();
-                throw new L(I, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
+                throw new U(A, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
             }
             i.push(t);
         }
-        return new nn(i, s);
+        return new en(i, s);
     }
     /**
  * Converts a list of field values to a `Bound` for the given query.
  */ (t._query, t.firestore._databaseId, n, e[0]._document, r);
     {
-        const s = Ve(t.firestore);
+        const s = De(t.firestore);
         return function(t, n, e, r, s, i) {
             // Use explicit order by's because it has to match the query the user made
             const o = t.explicitOrderBy;
-            if (s.length > o.length) throw new L(I, `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(A, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
             const u = [];
             for (let i = 0; i < s.length; i++) {
                 const c = s[i];
                 if (o[i].field.isKeyField()) {
-                    if ("string" != typeof c) throw new L(I, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
-                    if (!hn(t) && -1 !== c.indexOf("/")) throw new L(I, `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(J.fromString(c));
-                    if (!tt.isDocumentKey(e)) throw new L(I, `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 tt(e);
-                    u.push(Ot(n, s));
+                    if ("string" != typeof c) throw new U(A, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
+                    if (!ln(t) && -1 !== c.indexOf("/")) throw new U(A, `Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
+                    const e = t.path.child(X.fromString(c));
+                    if (!nt.isDocumentKey(e)) throw new U(A, `Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to ${r}() must result in a valid document path, but '${e}' is not because it contains an odd number of segments.`);
+                    const s = new nt(e);
+                    u.push(Ct(n, s));
                 } else {
-                    const t = Le(e, r, c);
+                    const t = Ue(e, r, c);
                     u.push(t);
                 }
             }
-            return new nn(u, i);
+            return new en(u, i);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -4819,28 +4831,28 @@ function dr(...t) {
     }
 }
 
-function mr(t, n, e) {
+function pr(t, n, e) {
     if ("string" == typeof (e = getModularInstance(e))) {
-        if ("" === e) throw new L(I, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!hn(n) && -1 !== e.indexOf("/")) throw new L(I, `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(J.fromString(e));
-        if (!tt.isDocumentKey(r)) throw new L(I, `Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
-        return Ot(t, new tt(r));
+        if ("" === e) throw new U(A, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!ln(n) && -1 !== e.indexOf("/")) throw new U(A, `Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '${e}' contains a '/' character.`);
+        const r = n.path.child(X.fromString(e));
+        if (!nt.isDocumentKey(r)) throw new U(A, `Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
+        return Ct(t, new nt(r));
     }
-    if (e instanceof ae) return Ot(t, e._key);
-    throw new L(I, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${st(e)}.`);
+    if (e instanceof he) return Ct(t, e._key);
+    throw new U(A, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${it(e)}.`);
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function pr(t, n) {
-    if (!Array.isArray(t) || 0 === t.length) throw new L(I, `Invalid Query. A non-empty array is required for '${n.toString()}' filters.`);
-    if (t.length > 10) throw new L(I, `Invalid Query. '${n.toString()}' filters support a maximum of 10 elements in the value array.`);
+ */ function yr(t, n) {
+    if (!Array.isArray(t) || 0 === t.length) throw new U(A, `Invalid Query. A non-empty array is required for '${n.toString()}' filters.`);
+    if (t.length > 10) throw new U(A, `Invalid Query. '${n.toString()}' filters support a maximum of 10 elements in the value array.`);
 }
 
-function yr(t, n, e) {
-    if (!e.isEqual(n)) throw new L(I, `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 _r(t, n, e) {
+    if (!e.isEqual(n)) throw new U(A, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${n.toString()}' and so you must also use '${n.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${e.toString()}' instead.`);
 }
 
 /**
@@ -4890,7 +4902,7 @@ function yr(t, n, e) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function _r(t, n, e) {
+function gr(t, n, e) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -4899,9 +4911,9 @@ function _r(t, n, e) {
     r;
 }
 
-class gr extends class {
+class br extends class {
     convertValue(t, n = "none") {
-        switch ($t(t)) {
+        switch (Ft(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -4909,7 +4921,7 @@ class gr extends class {
             return t.booleanValue;
 
           case 2 /* NumberValue */ :
-            return Pt(t.integerValue || t.doubleValue);
+            return Rt(t.integerValue || t.doubleValue);
 
           case 3 /* TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -4921,7 +4933,7 @@ class gr extends class {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(Rt(t.bytesValue));
+            return this.convertBytes(Vt(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -4936,17 +4948,17 @@ class gr extends class {
             return this.convertObject(t.mapValue, n);
 
           default:
-            throw _();
+            throw g();
         }
     }
     convertObject(t, n) {
         const e = {};
-        return vt(t.fields, ((t, r) => {
+        return Et(t.fields, ((t, r) => {
             e[t] = this.convertValue(r, n);
         })), e;
     }
     convertGeoPoint(t) {
-        return new ve(Pt(t.latitude), Pt(t.longitude));
+        return new Ee(Rt(t.latitude), Rt(t.longitude));
     }
     convertArray(t, n) {
         return (t.values || []).map((t => this.convertValue(t, n)));
@@ -4954,27 +4966,27 @@ class gr extends class {
     convertServerTimestamp(t, n) {
         switch (n) {
           case "previous":
-            const e = Dt(t);
+            const e = Nt(t);
             return null == e ? null : this.convertValue(e, n);
 
           case "estimate":
-            return this.convertTimestamp(Nt(t));
+            return this.convertTimestamp($t(t));
 
           default:
             return null;
         }
     }
     convertTimestamp(t) {
-        const n = At(t);
-        return new _t(n.seconds, n.nanos);
+        const n = Pt(t);
+        return new gt(n.seconds, n.nanos);
     }
     convertDocumentKey(t, n) {
-        const e = J.fromString(t);
-        g(Yn(e));
-        const r = new H(e.get(1), e.get(3)), s = new tt(e.popFirst(5));
+        const e = X.fromString(t);
+        b(Hn(e));
+        const r = new K(e.get(1), e.get(3)), s = new nt(e.popFirst(5));
         return r.isEqual(n) || 
         // TODO(b/64130202): Somehow support foreign references.
-        m(`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.`), 
+        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.`), 
         s;
     }
 } {
@@ -4982,11 +4994,11 @@ class gr extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new ge(t);
+        return new be(t);
     }
     convertReference(t) {
         const n = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new ae(this.firestore, /* converter= */ null, n);
+        return new he(this.firestore, /* converter= */ null, n);
     }
 }
 
@@ -5002,12 +5014,12 @@ class gr extends class {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function br(t) {
-    const n = ee((t = it(t, ae)).firestore), e = new gr(t.firestore);
-    return Zn(n, [ t._key ]).then((n => {
-        g(1 === n.length);
+ */ function vr(t) {
+    const n = re((t = ot(t, he)).firestore), e = new br(t.firestore);
+    return te(n, [ t._key ]).then((n => {
+        b(1 === n.length);
         const r = n[0];
-        return new Ye(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new He(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5022,33 +5034,33 @@ class gr extends class {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function vr(t) {
+ */ function Er(t) {
     !function(t) {
-        if (un(t) && 0 === t.explicitOrderBy.length) throw new L(q, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = it(t, he))._query);
-    const n = ee(t.firestore), e = new gr(t.firestore);
-    return te(n, t._query).then((n => {
-        const r = n.map((n => new He(t.firestore, e, n.key, n, t.converter)));
-        return un(t._query) && 
+        if (cn(t) && 0 === t.explicitOrderBy.length) throw new U(q, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = ot(t, le))._query);
+    const n = re(t.firestore), e = new br(t.firestore);
+    return ne(n, t._query).then((n => {
+        const r = n.map((n => new Ke(t.firestore, e, n.key, n, t.converter)));
+        return cn(t._query) && 
         // Limit to last queries reverse the orderBy constraint that was
         // specified by the user. As such, we need to reverse the order of the
         // results to return the documents in the expected order.
-        r.reverse(), new Ke(t, r);
+        r.reverse(), new Je(t, r);
     }));
 }
 
-function Er(t, n, e) {
-    const r = _r((t = it(t, ae)).converter, n, e), s = De(Ve(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
-    return Xn(ee(t.firestore), [ s.toMutation(t._key, vn.none()) ]);
+function Tr(t, n, e) {
+    const r = gr((t = ot(t, he)).converter, n, e), s = Ne(De(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
+    return Zn(re(t.firestore), [ s.toMutation(t._key, En.none()) ]);
 }
 
-function Tr(t, n, e, ...r) {
-    const s = Ve((t = it(t, ae)).firestore);
+function Ir(t, n, e, ...r) {
+    const s = De((t = ot(t, he)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    i = "string" == typeof (n = getModularInstance(n)) || n instanceof ye ? Ce(s, "updateDoc", t._key, n, e, r) : Oe(s, "updateDoc", t._key, n);
-    return Xn(ee(t.firestore), [ i.toMutation(t._key, vn.exists(!0)) ]);
+    i = "string" == typeof (n = getModularInstance(n)) || n instanceof _e ? Le(s, "updateDoc", t._key, n, e, r) : Ce(s, "updateDoc", t._key, n);
+    return Zn(re(t.firestore), [ i.toMutation(t._key, En.exists(!0)) ]);
 }
 
 /**
@@ -5062,8 +5074,8 @@ function Tr(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 Ir(t) {
-    return Xn(ee((t = it(t, ae)).firestore), [ new An(t._key, vn.none()) ]);
+ */ function Ar(t) {
+    return Zn(re((t = ot(t, he)).firestore), [ new Pn(t._key, En.none()) ]);
 }
 
 /**
@@ -5077,11 +5089,12 @@ function Tr(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 Ar(t, n) {
-    const e = we(t = it(t, le)), r = _r(t.converter, n), s = De(Ve(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
-    return Xn(ee(t.firestore), [ s.toMutation(e._key, vn.exists(!1)) ]).then((() => e));
+ */ function Pr(t, n) {
+    const e = me(t = ot(t, fe)), r = gr(t.converter, n), s = Ne(De(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
+    return Zn(re(t.firestore), [ s.toMutation(e._key, En.exists(!1)) ]).then((() => e));
 }
 
 /**
@@ -5103,15 +5116,15 @@ function Tr(t, n, e, ...r) {
 /**
  * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or
  * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.
- */ function Pr() {
-    return new Ne("deleteField");
+ */ function Rr() {
+    return new $e("deleteField");
 }
 
 /**
  * Returns a sentinel used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link @firebase/firestore/lite#(updateDoc:1)} to
  * include a server-generated timestamp in the written data.
- */ function Rr() {
-    return new Fe("serverTimestamp");
+ */ function Vr() {
+    return new Se("serverTimestamp");
 }
 
 /**
@@ -5125,10 +5138,10 @@ function Tr(t, n, e, ...r) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function Vr(...t) {
+ */ function Dr(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-    return new Se("arrayUnion", t);
+    return new xe("arrayUnion", t);
 }
 
 /**
@@ -5141,7 +5154,7 @@ function Tr(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 Dr(...t) {
+ */ function Nr(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
     return new qe("arrayRemove", t);
@@ -5165,8 +5178,8 @@ function Tr(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 Nr(t) {
-    return new xe("increment", t);
+ */ function $r(t) {
+    return new Oe("increment", t);
 }
 
 /**
@@ -5192,25 +5205,25 @@ function Tr(t, n, e, ...r) {
  * provides methods for adding writes to the write batch. None of the writes
  * will be committed (or visible locally) until {@link WriteBatch.commit} is
  * called.
- */ class $r {
+ */ class Fr {
     /** @hideconstructor */
     constructor(t, n) {
         this._firestore = t, this._commitHandler = n, this._mutations = [], this._committed = !1, 
-        this._dataReader = Ve(t);
+        this._dataReader = De(t);
     }
     set(t, n, e) {
         this._verifyNotCommitted();
-        const r = Fr(t, this._firestore), s = _r(r.converter, n, e), i = De(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
-        return this._mutations.push(i.toMutation(r._key, vn.none())), this;
+        const r = Sr(t, this._firestore), s = gr(r.converter, n, e), i = Ne(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
+        return this._mutations.push(i.toMutation(r._key, En.none())), this;
     }
     update(t, n, e, ...r) {
         this._verifyNotCommitted();
-        const s = Fr(t, this._firestore);
+        const s = Sr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (n = getModularInstance(n)) || n instanceof ye ? Ce(this._dataReader, "WriteBatch.update", s._key, n, e, r) : Oe(this._dataReader, "WriteBatch.update", s._key, n), 
-        this._mutations.push(i.toMutation(s._key, vn.exists(!0))), this;
+        return i = "string" == typeof (n = getModularInstance(n)) || n instanceof _e ? Le(this._dataReader, "WriteBatch.update", s._key, n, e, r) : Ce(this._dataReader, "WriteBatch.update", s._key, n), 
+        this._mutations.push(i.toMutation(s._key, En.exists(!0))), this;
     }
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -5219,8 +5232,8 @@ function Tr(t, n, e, ...r) {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const n = Fr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new An(n._key, vn.none())), this;
+        const n = Sr(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Pn(n._key, En.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5237,12 +5250,12 @@ function Tr(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 L($, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new U(F, "A write batch can no longer be used after commit() has been called.");
     }
 }
 
-function Fr(t, n) {
-    if ((t = getModularInstance(t)).firestore !== n) throw new L(I, "Provided document reference is from a different Firestore instance.");
+function Sr(t, n) {
+    if ((t = getModularInstance(t)).firestore !== n) throw new U(A, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -5258,9 +5271,9 @@ function Fr(t, n) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Sr(t) {
-    const n = ee(t = it(t, se));
-    return new $r(t, (t => Xn(n, t)));
+ */ function xr(t) {
+    const n = re(t = ot(t, ie));
+    return new Fr(t, (t => Zn(n, t)));
 }
 
 /**
@@ -5301,8 +5314,8 @@ function Fr(t, n) {
         this.writtenDocs = new Set;
     }
     async lookup(t) {
-        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new L(I, "Firestore transactions require all reads to be executed before all writes.");
-        const n = await Zn(this.datastore, t);
+        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(A, "Firestore transactions require all reads to be executed before all writes.");
+        const n = await te(this.datastore, t);
         return n.forEach((t => this.recordVersion(t))), n;
     }
     set(t, n) {
@@ -5317,7 +5330,7 @@ function Fr(t, n) {
         this.writtenDocs.add(t.toString());
     }
     delete(t) {
-        this.write(new An(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Pn(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }
     async commit() {
         if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
@@ -5329,22 +5342,22 @@ function Fr(t, n) {
         // For each document that was read but not written to, we want to perform
         // a `verify` operation.
         t.forEach(((t, n) => {
-            const e = tt.fromPath(n);
-            this.mutations.push(new Pn(e, this.precondition(e)));
-        })), await Xn(this.datastore, this.mutations), this.committed = !0;
+            const e = nt.fromPath(n);
+            this.mutations.push(new Rn(e, this.precondition(e)));
+        })), await Zn(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let n;
         if (t.isFoundDocument()) n = t.version; else {
-            if (!t.isNoDocument()) throw _();
+            if (!t.isNoDocument()) throw g();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
-            n = gt.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 L(F, "Document version changed between two reads.");
+            throw new U(S, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), n);
     }
     /**
@@ -5352,7 +5365,7 @@ function Fr(t, n) {
      * as a precondition, or no precondition if it was not read.
      */    precondition(t) {
         const n = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && n ? vn.updateTime(n) : vn.none();
+        return !this.writtenDocs.has(t.toString()) && n ? En.updateTime(n) : En.none();
     }
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5361,7 +5374,7 @@ function Fr(t, n) {
         // The first time a document is written, we want to take into account the
         // read time and existence
                 if (!this.writtenDocs.has(t.toString()) && n) {
-            if (n.isEqual(gt.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
@@ -5371,13 +5384,13 @@ function Fr(t, n) {
             // express that to the backend, we have to validate locally.
             // Note: this can change once we can send separate verify writes in the
             // transaction.
-            throw new L(I, "Can't update a document that doesn't exist.");
+            throw new U(A, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return vn.updateTime(n);
+                        return En.updateTime(n);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-        return vn.exists(!0);
+        return En.exists(!0);
     }
     write(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
@@ -5405,10 +5418,10 @@ function Fr(t, n) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class xr {
+class Or {
     constructor(t, n, e, r) {
         this.asyncQueue = t, this.datastore = n, this.updateFunction = e, this.deferred = r, 
-        this.Tt = 5, this.It = new Kn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.Tt = 5, this.It = new Jn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
         this.Tt -= 1, this.At();
@@ -5430,7 +5443,7 @@ class xr {
     Pt(t) {
         try {
             const n = this.updateFunction(t);
-            return !ut(n) && n.catch && n.then ? n : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !ct(n) && n.catch && n.then ? n : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
             null);
         } catch (t) {
             // Do not retry errors thrown by user provided updateFunction.
@@ -5456,31 +5469,31 @@ class xr {
             function(t) {
                 switch (t) {
                   default:
-                    return _();
+                    return g();
 
-                  case E:
                   case T:
-                  case A:
-                  case N:
-                  case x:
+                  case I:
+                  case P:
+                  case $:
                   case O:
+                  case C:
  // Unauthenticated means something went wrong with our token and we need
                     // to retry with new credentials which will happen automatically.
-                                      case D:
+                                      case N:
                     return !1;
 
-                  case I:
-                  case P:
+                  case A:
                   case R:
                   case V:
-                  case $:
+                  case D:
+                  case F:
  // Aborted might be retried in some scenarios, but that is dependant on
                     // the context and should handled individually by the calling code.
                     // See https://cloud.google.com/apis/design/errors.
-                                      case F:
-                  case S:
+                                      case S:
+                  case x:
                   case q:
-                  case C:
+                  case L:
                     return !0;
                 }
             }(n);
@@ -5505,7 +5518,7 @@ class xr {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** The Platform's 'document' implementation or null if not available. */ function Or() {
+/** The Platform's 'document' implementation or null if not available. */ function Cr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5537,10 +5550,10 @@ class xr {
  * Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type
  * in newer versions of TypeScript defines `finally`, which is not available in
  * IE.
- */ class Cr {
+ */ class Lr {
     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 k, 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.
@@ -5560,7 +5573,7 @@ class xr {
      *   PORTING NOTE: This exists to prevent making removeDelayedOperation() and
      *   the DelayedOperation class public.
      */    static createAndSchedule(t, n, e, r, s) {
-        const i = Date.now() + e, o = new Cr(t, n, i, r, s);
+        const i = Date.now() + e, o = new Lr(t, n, i, r, s);
         return o.start(e), o;
     }
     /**
@@ -5582,7 +5595,7 @@ class xr {
      * As long as the operation has not yet been run, calling cancel() provides a
      * guarantee that the operation will not be run.
      */    cancel(t) {
-        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new L(E, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new U(T, "Operation cancelled" + (t ? ": " + t : ""))));
     }
     handleDelayElapsed() {
         this.asyncQueue.enqueueAndForget((() => null !== this.timerHandle ? (this.clearTimeout(), 
@@ -5609,7 +5622,7 @@ class xr {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class Lr {
+ */ class Ur {
     constructor() {
         // The last promise in the queue.
         this.Dt = Promise.resolve(), 
@@ -5626,21 +5639,21 @@ class xr {
         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 Kn(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new Jn(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 = Or();
-            t && w("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
+            const t = Cr();
+            t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
         };
-        const t = Or();
+        const t = Cr();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ct);
     }
     get isShuttingDown() {
@@ -5660,8 +5673,8 @@ class xr {
     }
     enterRestrictedMode(t) {
         if (!this.$t) {
-            this.$t = !0, this.xt = t || !1;
-            const n = Or();
+            this.$t = !0, this.qt = t || !1;
+            const n = Cr();
             n && "function" == typeof n.removeEventListener && n.removeEventListener("visibilitychange", this.Ct);
         }
     }
@@ -5672,8 +5685,8 @@ class xr {
         // 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.Ut((() => this.$t && this.xt ? Promise.resolve() : (t().then(n.resolve, n.reject), 
+                const n = new k;
+        return this.Ut((() => this.$t && this.qt ? Promise.resolve() : (t().then(n.resolve, n.reject), 
         n.promise))).then((() => n.promise));
     }
     enqueueRetryable(t) {
@@ -5727,7 +5740,7 @@ class xr {
  * limitations under the License.
  */ (t)) throw t;
  // Failure will be handled by AsyncQueue
-                                w("AsyncQueue", "Operation failed with retryable error: " + t);
+                                m("AsyncQueue", "Operation failed with retryable error: " + t);
             }
             this.Nt.length > 0 && 
             // If there are additional operations, we re-schedule `retryNextOp()`.
@@ -5744,8 +5757,8 @@ class xr {
         }
     }
     Ut(t) {
-        const n = this.Dt.then((() => (this.qt = !0, t().catch((t => {
-            this.St = t, this.qt = !1;
+        const n = this.Dt.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.
@@ -5785,19 +5798,19 @@ class xr {
             // 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 m("INTERNAL UNHANDLED ERROR: ", n), t;
-        })).then((t => (this.qt = !1, t))))));
+            throw p("INTERNAL UNHANDLED ERROR: ", n), t;
+        })).then((t => (this.xt = !1, t))))));
         return this.Dt = 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 = Cr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
+        const r = Lr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
         return this.Ft.push(r), r;
     }
     Lt() {
-        this.St && _();
+        this.St && g();
     }
     verifyOperationInProgress() {}
     /**
@@ -5847,10 +5860,10 @@ class xr {
     }
 }
 
-class Ur {
+class kr {
     /** @hideconstructor */
     constructor(t, n) {
-        this._firestore = t, this._transaction = n, this._dataReader = Ve(t);
+        this._firestore = t, this._transaction = n, this._dataReader = De(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -5858,25 +5871,25 @@ class Ur {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const n = Fr(t, this._firestore), e = new gr(this._firestore);
+        const n = Sr(t, this._firestore), e = new br(this._firestore);
         return this._transaction.lookup([ n._key ]).then((t => {
-            if (!t || 1 !== t.length) return _();
+            if (!t || 1 !== t.length) return g();
             const r = t[0];
-            if (r.isFoundDocument()) return new Ye(this._firestore, e, r.key, r, n.converter);
-            if (r.isNoDocument()) return new Ye(this._firestore, e, n._key, null, n.converter);
-            throw _();
+            if (r.isFoundDocument()) return new He(this._firestore, e, r.key, r, n.converter);
+            if (r.isNoDocument()) return new He(this._firestore, e, n._key, null, n.converter);
+            throw g();
         }));
     }
     set(t, n, e) {
-        const r = Fr(t, this._firestore), s = _r(r.converter, n, e), i = De(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, e);
+        const r = Sr(t, this._firestore), s = gr(r.converter, n, e), i = Ne(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, e);
         return this._transaction.set(r._key, i), this;
     }
     update(t, n, e, ...r) {
-        const s = Fr(t, this._firestore);
+        const s = Sr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (n = getModularInstance(n)) || n instanceof ye ? Ce(this._dataReader, "Transaction.update", s._key, n, e, r) : Oe(this._dataReader, "Transaction.update", s._key, n), 
+        return i = "string" == typeof (n = getModularInstance(n)) || n instanceof _e ? Le(this._dataReader, "Transaction.update", s._key, n, e, r) : Ce(this._dataReader, "Transaction.update", s._key, n), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -5885,7 +5898,7 @@ class Ur {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const n = Fr(t, this._firestore);
+        const n = Sr(t, this._firestore);
         return this._transaction.delete(n._key), this;
     }
 }
@@ -5906,9 +5919,9 @@ class Ur {
  * (the `updateFunction` returned a failed promise), the promise returned by the
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
- */ function kr(t, n) {
-    const e = ee(t = it(t, se)), r = new U;
-    return new xr(new Lr, e, (e => n(new Ur(t, e))), r).run(), r.promise;
+ */ function jr(t, n) {
+    const e = re(t = ot(t, ie)), r = new k;
+    return new Or(new Ur, e, (e => n(new kr(t, e))), r).run(), r.promise;
 }
 
 /**
@@ -5919,13 +5932,13 @@ class Ur {
  * directly to the backend, and `onSnapshot()` APIs are not supported.
  * @packageDocumentation
  */ !function(t) {
-    l = t;
+    f = t;
 }(`${SDK_VERSION}_lite`), _registerComponent(new Component("firestore/lite", ((t, {options: n}) => {
-    const e = t.getProvider("app").getImmediate(), r = new se(e, new B(t.getProvider("auth-internal")), new W(t.getProvider("app-check-internal")));
+    const e = t.getProvider("app").getImmediate(), r = new ie(e, new z(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
     return n && r._setSettings(n), r;
-}), "PUBLIC" /* PUBLIC */)), 
+}), "PUBLIC")), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-registerVersion("firestore-lite", "3.4.0", ""), registerVersion("firestore-lite", "3.4.0", "esm2017");
+registerVersion("firestore-lite", "3.4.1-canary.0b385f18c", ""), registerVersion("firestore-lite", "3.4.1-canary.0b385f18c", "esm2017");
 
-export { ge as Bytes, le as CollectionReference, ae as DocumentReference, Ye as DocumentSnapshot, ye as FieldPath, be as FieldValue, se as Firestore, L as FirestoreError, ve as GeoPoint, he as Query, Ze as QueryConstraint, He as QueryDocumentSnapshot, Ke as QuerySnapshot, _t as Timestamp, Ur as Transaction, $r as WriteBatch, Ar as addDoc, Dr as arrayRemove, Vr as arrayUnion, fe as collection, de as collectionGroup, ue as connectFirestoreEmulator, Ir as deleteDoc, Pr as deleteField, we as doc, _e as documentId, dr as endAt, fr as endBefore, br as getDoc, vr as getDocs, oe as getFirestore, Nr as increment, ie as initializeFirestore, or as limit, ur as limitToLast, sr as orderBy, tr as query, pe as queryEqual, me as refEqual, kr as runTransaction, Rr as serverTimestamp, Er as setDoc, d as setLogLevel, Je as snapshotEqual, hr as startAfter, ar as startAt, ce as terminate, Tr as updateDoc, er as where, Sr as writeBatch };
+export { be as Bytes, fe as CollectionReference, he as DocumentReference, He as DocumentSnapshot, _e as FieldPath, ve as FieldValue, ie as Firestore, U as FirestoreError, Ee as GeoPoint, le as Query, tr as QueryConstraint, Ke as QueryDocumentSnapshot, Je as QuerySnapshot, gt as Timestamp, kr as Transaction, Fr as WriteBatch, Pr as addDoc, Nr as arrayRemove, Dr as arrayUnion, de as collection, we as collectionGroup, ce as connectFirestoreEmulator, Ar as deleteDoc, Rr as deleteField, me as doc, ge as documentId, wr as endAt, dr as endBefore, vr as getDoc, Er as getDocs, ue as getFirestore, $r as increment, oe as initializeFirestore, ur as limit, cr as limitToLast, ir as orderBy, nr as query, ye as queryEqual, pe as refEqual, jr as runTransaction, Vr as serverTimestamp, Tr as setDoc, w as setLogLevel, Xe as snapshotEqual, lr as startAfter, hr as startAt, ae as terminate, Ir as updateDoc, rr as where, xr as writeBatch };
 //# sourceMappingURL=index.browser.esm2017.js.map