@firebase/firestore 3.5.0-canary.e35db6f95 → 3.5.0-canary.ee871fc0b

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

@@ -4,7 +4,7 @@ import { Component as i } from "@firebase/component";
 
 import { Logger as o, LogLevel as u } from "@firebase/logger";
 
-import { FirebaseError as c, base64 as a, createMockUserToken as h, getModularInstance as l } from "@firebase/util";
+import { FirebaseError as c, base64 as a, createMockUserToken as h, getModularInstance as l, deepEqual as f } from "@firebase/util";
 
 /**
  * @license
@@ -26,7 +26,7 @@ import { FirebaseError as c, base64 as a, createMockUserToken as h, getModularIn
  * Simple wrapper around a nullable UID. Mostly exists to make code more
  * readable.
  */
-class f {
+class d {
     constructor(t) {
         this.uid = t;
     }
@@ -44,11 +44,11 @@ class f {
     }
 }
 
-/** A user with a null UID. */ f.UNAUTHENTICATED = new f(null), 
+/** A user with a null UID. */ d.UNAUTHENTICATED = new d(null), 
 // TODO(mikelehen): Look into getting a proper uid-equivalent for
 // non-FirebaseAuth providers.
-f.GOOGLE_CREDENTIALS = new f("google-credentials-uid"), f.FIRST_PARTY = new f("first-party-uid"), 
-f.MOCK_USER = new f("mock-user");
+d.GOOGLE_CREDENTIALS = new d("google-credentials-uid"), d.FIRST_PARTY = new d("first-party-uid"), 
+d.MOCK_USER = new d("mock-user");
 
 /**
  * @license
@@ -66,7 +66,7 @@ f.MOCK_USER = new f("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let d = "9.10.0-canary.e35db6f95";
+let w = "9.10.0-canary.ee871fc0b";
 
 /**
  * @license
@@ -84,7 +84,7 @@ let d = "9.10.0-canary.e35db6f95";
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const w = new o("@firebase/firestore");
+const m = new o("@firebase/firestore");
 
 /**
  * Sets the verbosity of Cloud Firestore logs (debug, error, or silent).
@@ -98,36 +98,36 @@ const w = new o("@firebase/firestore");
  *     <li>`error` to log errors only.</li>
  *     <li><code>`silent` to turn off logging.</li>
  *   </ul>
- */ function m(t) {
-    w.setLogLevel(t);
+ */ function p(t) {
+    m.setLogLevel(t);
 }
 
-function p(t, ...e) {
-    if (w.logLevel <= u.DEBUG) {
-        const n = e.map(g);
-        w.debug(`Firestore (${d}): ${t}`, ...n);
+function y(t, ...e) {
+    if (m.logLevel <= u.DEBUG) {
+        const n = e.map(v);
+        m.debug(`Firestore (${w}): ${t}`, ...n);
     }
 }
 
-function y(t, ...e) {
-    if (w.logLevel <= u.ERROR) {
-        const n = e.map(g);
-        w.error(`Firestore (${d}): ${t}`, ...n);
+function g(t, ...e) {
+    if (m.logLevel <= u.ERROR) {
+        const n = e.map(v);
+        m.error(`Firestore (${w}): ${t}`, ...n);
     }
 }
 
 /**
  * @internal
  */ function _(t, ...e) {
-    if (w.logLevel <= u.WARN) {
-        const n = e.map(g);
-        w.warn(`Firestore (${d}): ${t}`, ...n);
+    if (m.logLevel <= u.WARN) {
+        const n = e.map(v);
+        m.warn(`Firestore (${w}): ${t}`, ...n);
     }
 }
 
 /**
  * Converts an additional log parameter to a string representation.
- */ function g(t) {
+ */ function v(t) {
     if ("string" == typeof t) return t;
     try {
         return e = t, JSON.stringify(e);
@@ -178,14 +178,14 @@ function y(t, ...e) {
  * Returns `never` and can be used in expressions:
  * @example
  * let futureVar = fail('not implemented yet');
- */ function v(t = "Unexpected state") {
+ */ function b(t = "Unexpected state") {
     // Log the failure in addition to throw an exception, just in case the
     // exception is swallowed.
-    const e = `FIRESTORE (${d}) INTERNAL ASSERTION FAILED: ` + t;
+    const e = `FIRESTORE (${w}) 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 y(e), new Error(e);
+    throw g(e), new Error(e);
 }
 
 /**
@@ -193,14 +193,14 @@ function y(t, ...e) {
  * given message if it did.
  *
  * Messages are stripped in production builds.
- */ function b(t, e) {
-    t || v();
+ */ function E(t, e) {
+    t || b();
 }
 
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function E(t, 
+ */ function I(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     return t;
@@ -221,9 +221,9 @@ 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 I = "ok", T = "cancelled", A = "unknown", R = "invalid-argument", P = "deadline-exceeded", V = "not-found", N = "already-exists", $ = "permission-denied", D = "unauthenticated", x = "resource-exhausted", S = "failed-precondition", F = "aborted", q = "out-of-range", O = "unimplemented", k = "internal", C = "unavailable", L = "data-loss";
+ */ const T = "ok", A = "cancelled", R = "unknown", P = "invalid-argument", V = "deadline-exceeded", N = "not-found", $ = "already-exists", D = "permission-denied", x = "unauthenticated", S = "resource-exhausted", F = "failed-precondition", q = "aborted", O = "out-of-range", k = "unimplemented", C = "internal", L = "unavailable", M = "data-loss";
 
-/** An error returned by a Firestore operation. */ class M extends c {
+/** An error returned by a Firestore operation. */ class U extends c {
     /** @hideconstructor */
     constructor(
     /**
@@ -257,7 +257,7 @@ e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class U {
+ */ class j {
     constructor() {
         this.promise = new Promise(((t, e) => {
             this.resolve = t, this.reject = e;
@@ -280,7 +280,7 @@ e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class j {
+ */ class B {
     constructor(t, e) {
         this.user = e, this.type = "OAuth", this.headers = new Map, this.headers.set("Authorization", `Bearer ${t}`);
     }
@@ -289,14 +289,14 @@ e) {
 /**
  * A CredentialsProvider that always yields an empty token.
  * @internal
- */ class B {
+ */ class Q {
     getToken() {
         return Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, e) {
         // Fire with initial user.
-        t.enqueueRetryable((() => e(f.UNAUTHENTICATED)));
+        t.enqueueRetryable((() => e(d.UNAUTHENTICATED)));
     }
     shutdown() {}
 }
@@ -328,15 +328,15 @@ e) {
     }
 }
 
-/** Credential provider for the Lite SDK. */ class Q {
+/** Credential provider for the Lite SDK. */ class W {
     constructor(t) {
         this.auth = null, t.onInit((t => {
             this.auth = t;
         }));
     }
     getToken() {
-        return this.auth ? this.auth.getToken().then((t => t ? (b("string" == typeof t.accessToken), 
-        new j(t.accessToken, new f(this.auth.getUid()))) : null)) : Promise.resolve(null);
+        return this.auth ? this.auth.getToken().then((t => t ? (E("string" == typeof t.accessToken), 
+        new B(t.accessToken, new d(this.auth.getUid()))) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, e) {}
@@ -349,15 +349,15 @@ e) {
  * 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 W {
+ */ class G {
     constructor(t, e, n, r) {
-        this.t = t, this.i = e, this.o = n, this.u = r, this.type = "FirstParty", this.user = f.FIRST_PARTY, 
+        this.t = t, this.i = e, this.o = n, this.u = r, this.type = "FirstParty", this.user = d.FIRST_PARTY, 
         this.h = new Map;
     }
     /** Gets an authorization token, using a provided factory function, or falling back to First Party GAPI. */    l() {
         return this.u ? this.u() : (
         // Make sure this really is a Gapi client.
-        b(!("object" != typeof this.t || null === this.t || !this.t.auth || !this.t.auth.getAuthHeaderValueForFirstParty)), 
+        E(!("object" != typeof this.t || null === this.t || !this.t.auth || !this.t.auth.getAuthHeaderValueForFirstParty)), 
         this.t.auth.getAuthHeaderValueForFirstParty([]));
     }
     get headers() {
@@ -373,36 +373,36 @@ e) {
  * 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 K {
     constructor(t, e, n, r) {
         this.t = t, this.i = e, this.o = n, this.u = r;
     }
     getToken() {
-        return Promise.resolve(new W(this.t, this.i, this.o, this.u));
+        return Promise.resolve(new G(this.t, this.i, this.o, this.u));
     }
     start(t, e) {
         // Fire with initial uid.
-        t.enqueueRetryable((() => e(f.FIRST_PARTY)));
+        t.enqueueRetryable((() => e(d.FIRST_PARTY)));
     }
     shutdown() {}
     invalidateToken() {}
 }
 
-class K {
+class Y {
     constructor(t) {
         this.value = t, this.type = "AppCheck", this.headers = new Map, t && t.length > 0 && this.headers.set("x-firebase-appcheck", this.value);
     }
 }
 
-/** AppCheck token provider for the Lite SDK. */ class Y {
+/** AppCheck token provider for the Lite SDK. */ class H {
     constructor(t) {
         this.m = t, this.appCheck = null, t.onInit((t => {
             this.appCheck = t;
         }));
     }
     getToken() {
-        return this.appCheck ? this.appCheck.getToken().then((t => t ? (b("string" == typeof t.token), 
-        new K(t.token)) : null)) : Promise.resolve(null);
+        return this.appCheck ? this.appCheck.getToken().then((t => t ? (E("string" == typeof t.token), 
+        new Y(t.token)) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, e) {}
@@ -429,7 +429,7 @@ class K {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-class H {
+class J {
     /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -458,38 +458,38 @@ class H {
  * Represents the database ID a Firestore client is associated with.
  * @internal
  */
-class J {
+class X {
     constructor(t, e) {
         this.projectId = t, this.database = e || "(default)";
     }
     static empty() {
-        return new J("", "");
+        return new X("", "");
     }
     get isDefaultDatabase() {
         return "(default)" === this.database;
     }
     isEqual(t) {
-        return t instanceof J && t.projectId === this.projectId && t.database === this.database;
+        return t instanceof X && t.projectId === this.projectId && t.database === this.database;
     }
 }
 
 /**
  * Path represents an ordered sequence of string segments.
  */
-class X {
+class Z {
     constructor(t, e, n) {
-        void 0 === e ? e = 0 : e > t.length && v(), void 0 === n ? n = t.length - e : n > t.length - e && v(), 
+        void 0 === e ? e = 0 : e > t.length && b(), void 0 === n ? n = t.length - e : n > t.length - e && b(), 
         this.segments = t, this.offset = e, this.len = n;
     }
     get length() {
         return this.len;
     }
     isEqual(t) {
-        return 0 === X.comparator(this, t);
+        return 0 === Z.comparator(this, t);
     }
     child(t) {
         const e = this.segments.slice(this.offset, this.limit());
-        return t instanceof X ? t.forEach((t => {
+        return t instanceof Z ? t.forEach((t => {
             e.push(t);
         })) : e.push(t), this.construct(e);
     }
@@ -546,9 +546,9 @@ class X {
  * within Firestore.
  *
  * @internal
- */ class Z extends X {
+ */ class tt extends Z {
     construct(t, e, n) {
-        return new Z(t, e, n);
+        return new tt(t, e, n);
     }
     canonicalString() {
         // NOTE: The client is ignorant of any path segments containing escape
@@ -569,35 +569,35 @@ class X {
         // for legacy reasons and should not be used frequently).
         const e = [];
         for (const n of t) {
-            if (n.indexOf("//") >= 0) throw new M(R, `Invalid segment (${n}). Paths must not contain // in them.`);
+            if (n.indexOf("//") >= 0) throw new U(P, `Invalid segment (${n}). Paths must not contain // in them.`);
             // Strip leading and traling slashed.
                         e.push(...n.split("/").filter((t => t.length > 0)));
         }
-        return new Z(e);
+        return new tt(e);
     }
     static emptyPath() {
-        return new Z([]);
+        return new tt([]);
     }
 }
 
-const tt = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
+const et = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
 
 /**
  * A dot-separated path for navigating sub-objects within a document.
  * @internal
- */ class et extends X {
+ */ class nt extends Z {
     construct(t, e, n) {
-        return new et(t, e, n);
+        return new nt(t, e, n);
     }
     /**
      * Returns true if the string could be used as a segment in a field path
      * without escaping.
      */    static isValidIdentifier(t) {
-        return tt.test(t);
+        return et.test(t);
     }
     canonicalString() {
         return this.toArray().map((t => (t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"), 
-        et.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
+        nt.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
     }
     toString() {
         return this.canonicalString();
@@ -610,7 +610,7 @@ const tt = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
     /**
      * The field designating the key of a document.
      */    static keyField() {
-        return new et([ "__name__" ]);
+        return new nt([ "__name__" ]);
     }
     /**
      * Parses a field string from the given server-formatted string.
@@ -625,24 +625,24 @@ const tt = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
         const e = [];
         let n = "", r = 0;
         const s = () => {
-            if (0 === n.length) throw new M(R, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
+            if (0 === n.length) throw new U(P, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
             e.push(n), n = "";
         };
         let i = !1;
         for (;r < t.length; ) {
             const e = t[r];
             if ("\\" === e) {
-                if (r + 1 === t.length) throw new M(R, "Path has trailing escape character: " + t);
+                if (r + 1 === t.length) throw new U(P, "Path has trailing escape character: " + t);
                 const e = t[r + 1];
-                if ("\\" !== e && "." !== e && "`" !== e) throw new M(R, "Path has invalid escape sequence: " + t);
+                if ("\\" !== e && "." !== e && "`" !== e) throw new U(P, "Path has invalid escape sequence: " + t);
                 n += e, r += 2;
             } else "`" === e ? (i = !i, r++) : "." !== e || i ? (n += e, r++) : (s(), r++);
         }
-        if (s(), i) throw new M(R, "Unterminated ` in path: " + t);
-        return new et(e);
+        if (s(), i) throw new U(P, "Unterminated ` in path: " + t);
+        return new nt(e);
     }
     static emptyPath() {
-        return new et([]);
+        return new nt([]);
     }
 }
 
@@ -664,18 +664,18 @@ const tt = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  */
 /**
  * @internal
- */ class nt {
+ */ class rt {
     constructor(t) {
         this.path = t;
     }
     static fromPath(t) {
-        return new nt(Z.fromString(t));
+        return new rt(tt.fromString(t));
     }
     static fromName(t) {
-        return new nt(Z.fromString(t).popFirst(5));
+        return new rt(tt.fromString(t).popFirst(5));
     }
     static empty() {
-        return new nt(Z.emptyPath());
+        return new rt(tt.emptyPath());
     }
     get collectionGroup() {
         return this.path.popLast().lastSegment();
@@ -690,13 +690,13 @@ const tt = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
         return this.path.popLast();
     }
     isEqual(t) {
-        return null !== t && 0 === Z.comparator(this.path, t.path);
+        return null !== t && 0 === tt.comparator(this.path, t.path);
     }
     toString() {
         return this.path.toString();
     }
     static comparator(t, e) {
-        return Z.comparator(t.path, e.path);
+        return tt.comparator(t.path, e.path);
     }
     static isDocumentKey(t) {
         return t.length % 2 == 0;
@@ -707,7 +707,7 @@ const tt = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
      * @param segments - The segments of the path to the document
      * @returns A new instance of DocumentKey
      */    static fromSegments(t) {
-        return new nt(new Z(t.slice()));
+        return new rt(new tt(t.slice()));
     }
 }
 
@@ -726,8 +726,8 @@ const tt = /^[_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 rt(t, e, n) {
-    if (!n) throw new M(R, `Function ${t}() cannot be called with an empty ${e}.`);
+ */ function st(t, e, n) {
+    if (!n) throw new U(P, `Function ${t}() cannot be called with an empty ${e}.`);
 }
 
 /**
@@ -738,15 +738,15 @@ const tt = /^[_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 st(t) {
-    if (!nt.isDocumentKey(t)) throw new M(R, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
+function it(t) {
+    if (!rt.isDocumentKey(t)) throw new U(P, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
  * Validates that `path` refers to a collection (indicated by the fact it
  * contains an odd numbers of segments).
- */ function it(t) {
-    if (nt.isDocumentKey(t)) throw new M(R, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
+ */ function ot(t) {
+    if (rt.isDocumentKey(t)) throw new U(P, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
@@ -754,7 +754,7 @@ function st(t) {
  * (i.e. excludes Array, Date, etc.).
  */
 /** Returns a string describing the type / value of the provided input. */
-function ot(t) {
+function ut(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)}...`), 
@@ -780,27 +780,27 @@ function ot(t) {
             return e ? `a custom ${e} object` : "an object";
         }
     }
-    return "function" == typeof t ? "a function" : v();
+    return "function" == typeof t ? "a function" : b();
 }
 
-function ut(t, 
+function ct(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     if ("_delegate" in t && (
     // Unwrap Compat types
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     t = t._delegate), !(t instanceof e)) {
-        if (e.name === t.constructor.name) throw new M(R, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
+        if (e.name === t.constructor.name) throw new U(P, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
-            const n = ot(t);
-            throw new M(R, `Expected type '${e.name}', but it was: ${n}`);
+            const n = ut(t);
+            throw new U(P, `Expected type '${e.name}', but it was: ${n}`);
         }
     }
     return t;
 }
 
-function ct(t, e) {
-    if (e <= 0) throw new M(R, `Function ${t}() requires a positive number, but it was: ${e}.`);
+function at(t, e) {
+    if (e <= 0) throw new U(P, `Function ${t}() requires a positive number, but it was: ${e}.`);
 }
 
 /**
@@ -821,11 +821,11 @@ function ct(t, e) {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function at(t) {
+ */ function ht(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function ht(t) {
+/** Returns whether the value represents -0. */ function lt(t) {
     // Detect if the value is -0.0. Based on polyfill from
     // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
     return 0 === t && 1 / t == -1 / 0;
@@ -851,7 +851,7 @@ function ct(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const lt = {
+const ft = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery",
@@ -889,7 +889,7 @@ const lt = {
  * 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 ft, dt;
+var dt, wt;
 
 /**
  * Converts an HTTP Status Code to the equivalent error code.
@@ -898,8 +898,8 @@ var ft, dt;
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function wt(t) {
-    if (void 0 === t) return y("RPC_ERROR", "HTTP error has no status"), A;
+function mt(t) {
+    if (void 0 === t) return g("RPC_ERROR", "HTTP error has no status"), R;
     // 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.
@@ -909,66 +909,66 @@ function wt(t) {
         switch (t) {
       case 200:
         // OK
-        return I;
+        return T;
 
       case 400:
         // Bad Request
-        return S;
+        return F;
 
         // Other possibilities based on the forward mapping
         // return Code.INVALID_ARGUMENT;
         // return Code.OUT_OF_RANGE;
               case 401:
         // Unauthorized
-        return D;
+        return x;
 
       case 403:
         // Forbidden
-        return $;
+        return D;
 
       case 404:
         // Not Found
-        return V;
+        return N;
 
       case 409:
         // Conflict
-        return F;
+        return q;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return q;
+        return O;
 
       case 429:
         // Too Many Requests
-        return x;
+        return S;
 
       case 499:
         // Client Closed Request
-        return T;
+        return A;
 
       case 500:
         // Internal Server Error
-        return A;
+        return R;
 
         // Other possibilities:
         // return Code.INTERNAL;
         // return Code.DATA_LOSS;
               case 501:
         // Unimplemented
-        return O;
+        return k;
 
       case 503:
         // Service Unavailable
-        return C;
+        return L;
 
       case 504:
         // Gateway Timeout
-        return P;
+        return V;
 
       default:
-        return t >= 200 && t < 300 ? I : t >= 400 && t < 500 ? S : t >= 500 && t < 600 ? k : A;
+        return t >= 200 && t < 300 ? T : t >= 400 && t < 500 ? F : t >= 500 && t < 600 ? C : R;
     }
 }
 
@@ -991,16 +991,16 @@ function wt(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (dt = ft || (ft = {}))[dt.OK = 0] = "OK", dt[dt.CANCELLED = 1] = "CANCELLED", 
-dt[dt.UNKNOWN = 2] = "UNKNOWN", dt[dt.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
-dt[dt.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", dt[dt.NOT_FOUND = 5] = "NOT_FOUND", 
-dt[dt.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", dt[dt.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
-dt[dt.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", dt[dt.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
-dt[dt.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", dt[dt.ABORTED = 10] = "ABORTED", 
-dt[dt.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", dt[dt.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
-dt[dt.INTERNAL = 13] = "INTERNAL", dt[dt.UNAVAILABLE = 14] = "UNAVAILABLE", dt[dt.DATA_LOSS = 15] = "DATA_LOSS";
+ */ (wt = dt || (dt = {}))[wt.OK = 0] = "OK", wt[wt.CANCELLED = 1] = "CANCELLED", 
+wt[wt.UNKNOWN = 2] = "UNKNOWN", wt[wt.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+wt[wt.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", wt[wt.NOT_FOUND = 5] = "NOT_FOUND", 
+wt[wt.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", wt[wt.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+wt[wt.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", wt[wt.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+wt[wt.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", wt[wt.ABORTED = 10] = "ABORTED", 
+wt[wt.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", wt[wt.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+wt[wt.INTERNAL = 13] = "INTERNAL", wt[wt.UNAVAILABLE = 14] = "UNAVAILABLE", wt[wt.DATA_LOSS = 15] = "DATA_LOSS";
 
-class mt extends 
+class pt extends 
 /**
  * Base class for all Rest-based connections to the backend (WebChannel and
  * HTTP).
@@ -1018,9 +1018,9 @@ class {
     }
     I(t, e, n, r, s) {
         const i = this.T(t, e);
-        p("RestConnection", "Sending: ", i, n);
+        y("RestConnection", "Sending: ", i, n);
         const o = {};
-        return this.A(o, r, s), this.R(t, i, o, n).then((t => (p("RestConnection", "Received: ", t), 
+        return this.A(o, r, s), this.R(t, i, o, n).then((t => (y("RestConnection", "Received: ", t), 
         t)), (e => {
             throw _("RestConnection", `${t} failed with error: `, e, "url: ", i, "request:", n), 
             e;
@@ -1035,7 +1035,7 @@ class {
      * Modifies the headers for a request, adding any authorization token if
      * present and any additional headers for the request.
      */    A(t, e, n) {
-        t["X-Goog-Api-Client"] = "gl-js/ fire/" + d, 
+        t["X-Goog-Api-Client"] = "gl-js/ fire/" + w, 
         // 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
@@ -1044,7 +1044,7 @@ class {
         e && e.headers.forEach(((e, n) => t[n] = e)), n && n.headers.forEach(((e, n) => t[n] = e));
     }
     T(t, e) {
-        const n = lt[t];
+        const n = ft[t];
         return `${this.p}/v1/${e}:${n}`;
     }
 } {
@@ -1068,9 +1068,9 @@ class {
                 body: s
             });
         } catch (t) {
-            throw new M(wt(t.status), "Request failed with error: " + t.statusText);
+            throw new U(mt(t.status), "Request failed with error: " + t.statusText);
         }
-        if (!i.ok) throw new M(wt(i.status), "Request failed with error: " + i.statusText);
+        if (!i.ok) throw new U(mt(i.status), "Request failed with error: " + i.statusText);
         return i.json();
     }
 }
@@ -1113,7 +1113,7 @@ class {
  *
  * If `nBytes < 0` , an error will be thrown.
  */
-function pt(t) {
+function yt(t) {
     // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.
     const e = 
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
@@ -1139,14 +1139,14 @@ function pt(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 yt {
+ */ class gt {
     static $() {
         // Alphanumeric characters
         const t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", e = Math.floor(256 / t.length) * t.length;
         // The largest byte value that is a multiple of `char.length`.
                 let n = "";
         for (;n.length < 20; ) {
-            const r = pt(40);
+            const r = yt(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.
@@ -1160,7 +1160,7 @@ function _t(t, e) {
     return t < e ? -1 : t > e ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function gt(t, e, n) {
+/** Helper to compare arrays using isEqual(). */ function vt(t, e, n) {
     return t.length === e.length && t.every(((t, r) => n(t, e[r])));
 }
 
@@ -1195,7 +1195,7 @@ function _t(t, e) {
  * For examples and further specifications, refer to the
  * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
  */
-class vt {
+class bt {
     /**
      * Creates a new timestamp.
      *
@@ -1216,18 +1216,18 @@ class vt {
      * The fractions of a second at nanosecond resolution.*
      */
     e) {
-        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new M(R, "Timestamp nanoseconds out of range: " + e);
-        if (e >= 1e9) throw new M(R, "Timestamp nanoseconds out of range: " + e);
-        if (t < -62135596800) throw new M(R, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new U(P, "Timestamp nanoseconds out of range: " + e);
+        if (e >= 1e9) throw new U(P, "Timestamp nanoseconds out of range: " + e);
+        if (t < -62135596800) throw new U(P, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new M(R, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new U(P, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
      *
      * @returns a new timestamp representing the current date.
      */    static now() {
-        return vt.fromMillis(Date.now());
+        return bt.fromMillis(Date.now());
     }
     /**
      * Creates a new timestamp from the given date.
@@ -1236,7 +1236,7 @@ class vt {
      * @returns A new `Timestamp` representing the same point in time as the given
      *     date.
      */    static fromDate(t) {
-        return vt.fromMillis(t.getTime());
+        return bt.fromMillis(t.getTime());
     }
     /**
      * Creates a new timestamp from the given number of milliseconds.
@@ -1247,7 +1247,7 @@ class vt {
      *     number of milliseconds.
      */    static fromMillis(t) {
         const e = Math.floor(t / 1e3), n = Math.floor(1e6 * (t - 1e3 * e));
-        return new vt(e, n);
+        return new bt(e, n);
     }
     /**
      * Converts a `Timestamp` to a JavaScript `Date` object. This conversion
@@ -1325,18 +1325,18 @@ class vt {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ class bt {
+ */ class Et {
     constructor(t) {
         this.timestamp = t;
     }
     static fromTimestamp(t) {
-        return new bt(t);
+        return new Et(t);
     }
     static min() {
-        return new bt(new vt(0, 0));
+        return new Et(new bt(0, 0));
     }
     static max() {
-        return new bt(new vt(253402300799, 999999999));
+        return new Et(new bt(253402300799, 999999999));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -1371,13 +1371,13 @@ class vt {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function Et(t) {
+ */ function It(t) {
     let e = 0;
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
 }
 
-function It(t, e) {
+function Tt(t, e) {
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
@@ -1399,17 +1399,17 @@ function It(t, e) {
  */
 // An immutable sorted map implementation, based on a Left-leaning Red-Black
 // tree.
-class Tt {
+class At {
     constructor(t, e) {
-        this.comparator = t, this.root = e || Rt.EMPTY;
+        this.comparator = t, this.root = e || Pt.EMPTY;
     }
     // Returns a copy of the map, with the specified key/value added or replaced.
     insert(t, e) {
-        return new Tt(this.comparator, this.root.insert(t, e, this.comparator).copy(null, null, Rt.BLACK, null, null));
+        return new At(this.comparator, this.root.insert(t, e, this.comparator).copy(null, null, Pt.BLACK, null, null));
     }
     // Returns a copy of the map, with the specified key removed.
     remove(t) {
-        return new Tt(this.comparator, this.root.remove(t, this.comparator).copy(null, null, Rt.BLACK, null, null));
+        return new At(this.comparator, this.root.remove(t, this.comparator).copy(null, null, Pt.BLACK, null, null));
     }
     // Returns the value of the node with the given key, or null.
     get(t) {
@@ -1475,22 +1475,22 @@ class Tt {
     }
     // Returns an iterator over the SortedMap.
     getIterator() {
-        return new At(this.root, null, this.comparator, !1);
+        return new Rt(this.root, null, this.comparator, !1);
     }
     getIteratorFrom(t) {
-        return new At(this.root, t, this.comparator, !1);
+        return new Rt(this.root, t, this.comparator, !1);
     }
     getReverseIterator() {
-        return new At(this.root, null, this.comparator, !0);
+        return new Rt(this.root, null, this.comparator, !0);
     }
     getReverseIteratorFrom(t) {
-        return new At(this.root, t, this.comparator, !0);
+        return new Rt(this.root, t, this.comparator, !0);
     }
 }
 
  // end SortedMap
 // An iterator over an LLRBNode.
-class At {
+class Rt {
     constructor(t, e, n, r) {
         this.isReverse = r, this.nodeStack = [];
         let s = 1;
@@ -1535,14 +1535,14 @@ class At {
 
  // end SortedMapIterator
 // Represents a node in a Left-leaning Red-Black tree.
-class Rt {
+class Pt {
     constructor(t, e, n, r, s) {
-        this.key = t, this.value = e, this.color = null != n ? n : Rt.RED, this.left = null != r ? r : Rt.EMPTY, 
-        this.right = null != s ? s : Rt.EMPTY, this.size = this.left.size + 1 + this.right.size;
+        this.key = t, this.value = e, this.color = null != n ? n : Pt.RED, this.left = null != r ? r : Pt.EMPTY, 
+        this.right = null != s ? s : Pt.EMPTY, this.size = this.left.size + 1 + this.right.size;
     }
     // Returns a copy of the current node, optionally replacing pieces of it.
     copy(t, e, n, r, s) {
-        return new Rt(null != t ? t : this.key, null != e ? e : this.value, null != n ? n : this.color, null != r ? r : this.left, null != s ? s : this.right);
+        return new Pt(null != t ? t : this.key, null != e ? e : this.value, null != n ? n : this.color, null != r ? r : this.left, null != s ? s : this.right);
     }
     isEmpty() {
         return !1;
@@ -1581,7 +1581,7 @@ class Rt {
         r.fixUp();
     }
     removeMin() {
-        if (this.left.isEmpty()) return Rt.EMPTY;
+        if (this.left.isEmpty()) return Pt.EMPTY;
         let t = this;
         return t.left.isRed() || t.left.left.isRed() || (t = t.moveRedLeft()), t = t.copy(null, null, null, t.left.removeMin(), null), 
         t.fixUp();
@@ -1593,7 +1593,7 @@ class Rt {
         r = r.copy(null, null, null, r.left.remove(t, e), null); else {
             if (r.left.isRed() && (r = r.rotateRight()), r.right.isEmpty() || r.right.isRed() || r.right.left.isRed() || (r = r.moveRedRight()), 
             0 === e(t, r.key)) {
-                if (r.right.isEmpty()) return Rt.EMPTY;
+                if (r.right.isEmpty()) return Pt.EMPTY;
                 n = r.right.min(), r = r.copy(n.key, n.value, null, null, r.right.removeMin());
             }
             r = r.copy(null, null, null, null, r.right.remove(t, e));
@@ -1619,11 +1619,11 @@ class Rt {
         return t.left.left.isRed() && (t = t.rotateRight(), t = t.colorFlip()), t;
     }
     rotateLeft() {
-        const t = this.copy(null, null, Rt.RED, null, this.right.left);
+        const t = this.copy(null, null, Pt.RED, null, this.right.left);
         return this.right.copy(null, null, this.color, t, null);
     }
     rotateRight() {
-        const t = this.copy(null, null, Rt.RED, this.left.right, null);
+        const t = this.copy(null, null, Pt.RED, this.left.right, null);
         return this.left.copy(null, null, this.color, null, t);
     }
     colorFlip() {
@@ -1638,10 +1638,10 @@ class Rt {
     // In a balanced RB tree, the black-depth (number of black nodes) from root to
     // leaves is equal on both sides.  This function verifies that or asserts.
     check() {
-        if (this.isRed() && this.left.isRed()) throw v();
-        if (this.right.isRed()) throw v();
+        if (this.isRed() && this.left.isRed()) throw b();
+        if (this.right.isRed()) throw b();
         const t = this.left.check();
-        if (t !== this.right.check()) throw v();
+        if (t !== this.right.check()) throw b();
         return t + (this.isRed() ? 0 : 1);
     }
 }
@@ -1649,29 +1649,29 @@ class Rt {
  // end LLRBNode
 // Empty node is shared between all LLRB trees.
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
-Rt.EMPTY = null, Rt.RED = !0, Rt.BLACK = !1;
+Pt.EMPTY = null, Pt.RED = !0, Pt.BLACK = !1;
 
 // end LLRBEmptyNode
-Rt.EMPTY = new 
+Pt.EMPTY = new 
 // Represents an empty node (a leaf node in the Red-Black Tree).
 class {
     constructor() {
         this.size = 0;
     }
     get key() {
-        throw v();
+        throw b();
     }
     get value() {
-        throw v();
+        throw b();
     }
     get color() {
-        throw v();
+        throw b();
     }
     get left() {
-        throw v();
+        throw b();
     }
     get right() {
-        throw v();
+        throw b();
     }
     // Returns a copy of the current node.
     copy(t, e, n, r, s) {
@@ -1679,7 +1679,7 @@ class {
     }
     // Returns a copy of the tree, with the specified key/value added.
     insert(t, e, n) {
-        return new Rt(t, e);
+        return new Pt(t, e);
     }
     // Returns a copy of the tree, with the specified key removed.
     remove(t, e) {
@@ -1735,9 +1735,9 @@ class {
  * NOTE: if provided comparator returns 0 for two elements, we consider them to
  * be equal!
  */
-class Pt {
+class Vt {
     constructor(t) {
-        this.comparator = t, this.data = new Tt(this.comparator);
+        this.comparator = t, this.data = new At(this.comparator);
     }
     has(t) {
         return null !== this.data.get(t);
@@ -1778,10 +1778,10 @@ class Pt {
         return e.hasNext() ? e.getNext().key : null;
     }
     getIterator() {
-        return new Vt(this.data.getIterator());
+        return new Nt(this.data.getIterator());
     }
     getIteratorFrom(t) {
-        return new Vt(this.data.getIteratorFrom(t));
+        return new Nt(this.data.getIteratorFrom(t));
     }
     /** Inserts or updates an element */    add(t) {
         return this.copy(this.data.remove(t).insert(t, !0));
@@ -1800,7 +1800,7 @@ class Pt {
         })), e;
     }
     isEqual(t) {
-        if (!(t instanceof Pt)) return !1;
+        if (!(t instanceof Vt)) return !1;
         if (this.size !== t.size) return !1;
         const e = this.data.getIterator(), n = t.data.getIterator();
         for (;e.hasNext(); ) {
@@ -1820,12 +1820,12 @@ class Pt {
         return this.forEach((e => t.push(e))), "SortedSet(" + t.toString() + ")";
     }
     copy(t) {
-        const e = new Pt(this.comparator);
+        const e = new Vt(this.comparator);
         return e.data = t, e;
     }
 }
 
-class Vt {
+class Nt {
     constructor(t) {
         this.iter = t;
     }
@@ -1862,24 +1862,24 @@ class Vt {
  *   foo.bar - Overwrites only the field bar of the object foo.
  *             If foo is not an object, foo is replaced with an object
  *             containing foo
- */ class Nt {
+ */ class $t {
     constructor(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
         // Sort the field mask to support `FieldMask.isEqual()` and assert below.
-        t.sort(et.comparator);
+        t.sort(nt.comparator);
     }
     static empty() {
-        return new Nt([]);
+        return new $t([]);
     }
     /**
      * Returns a new FieldMask object that is the result of adding all the given
      * fields paths to this field mask.
      */    unionWith(t) {
-        let e = new Pt(et.comparator);
+        let e = new Vt(nt.comparator);
         for (const t of this.fields) e = e.add(t);
         for (const n of t) e = e.add(n);
-        return new Nt(e.toArray());
+        return new $t(e.toArray());
     }
     /**
      * Verifies that `fieldPath` is included by at least one field in this field
@@ -1891,7 +1891,7 @@ class Vt {
         return !1;
     }
     isEqual(t) {
-        return gt(this.fields, t.fields, ((t, e) => t.isEqual(e)));
+        return vt(this.fields, t.fields, ((t, e) => t.isEqual(e)));
     }
 }
 
@@ -1914,7 +1914,7 @@ class Vt {
 // WebSafe uses a different URL-encoding safe alphabet that doesn't match
 // the encoding used on the backend.
 /** Converts a Base64 encoded string to a binary string. */
-function $t(t) {
+function Dt(t) {
     return String.fromCharCode.apply(null, 
     // We use `decodeStringToByteArray()` instead of `decodeString()` since
     // `decodeString()` returns Unicode strings, which doesn't match the values
@@ -1948,13 +1948,13 @@ function $t(t) {
  * before being sent as a proto.
  * @internal
  */
-class Dt {
+class xt {
     constructor(t) {
         this.binaryString = t;
     }
     static fromBase64String(t) {
-        const e = $t(t);
-        return new Dt(e);
+        const e = Dt(t);
+        return new xt(e);
     }
     static fromUint8Array(t) {
         // TODO(indexing); Remove the copy of the byte string here as this method
@@ -1971,7 +1971,7 @@ class Dt {
         /**
  * Helper function to convert a binary string to an Uint8Array.
  */ (t);
-        return new Dt(e);
+        return new xt(e);
     }
     [Symbol.iterator]() {
         let t = 0;
@@ -2028,24 +2028,24 @@ class Dt {
     }
 }
 
-Dt.EMPTY_BYTE_STRING = new Dt("");
+xt.EMPTY_BYTE_STRING = new xt("");
 
-const xt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const St = 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 St(t) {
+ */ function Ft(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 (b(!!t), "string" == typeof t) {
+    if (E(!!t), "string" == typeof t) {
         // The date string can have higher precision (nanos) than the Date class
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
         let e = 0;
-        const n = xt.exec(t);
-        if (b(!!n), n[1]) {
+        const n = St.exec(t);
+        if (E(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = n[1];
             t = (t + "000000000").substr(0, 9), e = Number(t);
@@ -2058,21 +2058,21 @@ const xt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: Ft(t.seconds),
-        nanos: Ft(t.nanos)
+        seconds: qt(t.seconds),
+        nanos: qt(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function Ft(t) {
+ */ function qt(t) {
     // TODO(bjornick): Handle int64 greater than 53 bits.
     return "number" == typeof t ? t : "string" == typeof t ? Number(t) : 0;
 }
 
-/** Converts the possible Proto types for Blobs into a ByteString. */ function qt(t) {
-    return "string" == typeof t ? Dt.fromBase64String(t) : Dt.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Ot(t) {
+    return "string" == typeof t ? xt.fromBase64String(t) : xt.fromUint8Array(t);
 }
 
 /**
@@ -2108,7 +2108,7 @@ const xt = 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 Ot(t) {
+ */ function kt(t) {
     var e, n;
     return "server_timestamp" === (null === (n = ((null === (e = null == t ? void 0 : t.mapValue) || void 0 === e ? void 0 : e.fields) || {}).__type__) || void 0 === n ? void 0 : n.stringValue);
 }
@@ -2118,16 +2118,16 @@ const xt = 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 kt(t) {
+ */ function Ct(t) {
     const e = t.mapValue.fields.__previous_value__;
-    return Ot(e) ? kt(e) : e;
+    return kt(e) ? Ct(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Ct(t) {
-    const e = St(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new vt(e.seconds, e.nanos);
+ */ function Lt(t) {
+    const e = Ft(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new bt(e.seconds, e.nanos);
 }
 
 /**
@@ -2145,7 +2145,7 @@ const xt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const Lt = {
+ */ const Mt = {
     fields: {
         __type__: {
             stringValue: "__max__"
@@ -2154,8 +2154,8 @@ const xt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 };
 
 /** Extracts the backend's type order for the provided value. */
-function Mt(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 ? Ot(t) ? 4 /* ServerTimestampValue */ : 
+function Ut(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 ? kt(t) ? 4 /* ServerTimestampValue */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
         return "__max__" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;
@@ -2179,13 +2179,13 @@ function Mt(t) {
     /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ (t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : v();
+ */ (t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : b();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Ut(t, e) {
+/** Tests `left` and `right` for equality based on the backend semantics. */ function jt(t, e) {
     if (t === e) return !0;
-    const n = Mt(t);
-    if (n !== Mt(e)) return !1;
+    const n = Ut(t);
+    if (n !== Ut(e)) return !1;
     switch (n) {
       case 0 /* NullValue */ :
       case 9007199254740991 /* MaxValue */ :
@@ -2195,14 +2195,14 @@ function Mt(t) {
         return t.booleanValue === e.booleanValue;
 
       case 4 /* ServerTimestampValue */ :
-        return Ct(t).isEqual(Ct(e));
+        return Lt(t).isEqual(Lt(e));
 
       case 3 /* TimestampValue */ :
         return function(t, e) {
             if ("string" == typeof t.timestampValue && "string" == typeof e.timestampValue && t.timestampValue.length === e.timestampValue.length) 
             // Use string equality for ISO 8601 timestamps
             return t.timestampValue === e.timestampValue;
-            const n = St(t.timestampValue), r = St(e.timestampValue);
+            const n = Ft(t.timestampValue), r = Ft(e.timestampValue);
             return n.seconds === r.seconds && n.nanos === r.nanos;
         }(t, e);
 
@@ -2211,7 +2211,7 @@ function Mt(t) {
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            return qt(t.bytesValue).isEqual(qt(e.bytesValue));
+            return Ot(t.bytesValue).isEqual(Ot(e.bytesValue));
         }(t, e);
 
       case 7 /* RefValue */ :
@@ -2219,43 +2219,43 @@ function Mt(t) {
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            return Ft(t.geoPointValue.latitude) === Ft(e.geoPointValue.latitude) && Ft(t.geoPointValue.longitude) === Ft(e.geoPointValue.longitude);
+            return qt(t.geoPointValue.latitude) === qt(e.geoPointValue.latitude) && qt(t.geoPointValue.longitude) === qt(e.geoPointValue.longitude);
         }(t, e);
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            if ("integerValue" in t && "integerValue" in e) return Ft(t.integerValue) === Ft(e.integerValue);
+            if ("integerValue" in t && "integerValue" in e) return qt(t.integerValue) === qt(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
-                const n = Ft(t.doubleValue), r = Ft(e.doubleValue);
-                return n === r ? ht(n) === ht(r) : isNaN(n) && isNaN(r);
+                const n = qt(t.doubleValue), r = qt(e.doubleValue);
+                return n === r ? lt(n) === lt(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* ArrayValue */ :
-        return gt(t.arrayValue.values || [], e.arrayValue.values || [], Ut);
+        return vt(t.arrayValue.values || [], e.arrayValue.values || [], jt);
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
             const n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (Et(n) !== Et(r)) return !1;
-            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Ut(n[t], r[t]))) return !1;
+            if (It(n) !== It(r)) return !1;
+            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !jt(n[t], r[t]))) return !1;
             return !0;
         }
         /** Returns true if the ArrayValue contains the specified element. */ (t, e);
 
       default:
-        return v();
+        return b();
     }
 }
 
-function jt(t, e) {
-    return void 0 !== (t.values || []).find((t => Ut(t, e)));
+function Bt(t, e) {
+    return void 0 !== (t.values || []).find((t => jt(t, e)));
 }
 
-function Bt(t, e) {
+function Qt(t, e) {
     if (t === e) return 0;
-    const n = Mt(t), r = Mt(e);
+    const n = Ut(t), r = Ut(e);
     if (n !== r) return _t(n, r);
     switch (n) {
       case 0 /* NullValue */ :
@@ -2267,7 +2267,7 @@ function Bt(t, e) {
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            const n = Ft(t.integerValue || t.doubleValue), r = Ft(e.integerValue || e.doubleValue);
+            const n = qt(t.integerValue || t.doubleValue), r = qt(e.integerValue || e.doubleValue);
             return n < r ? -1 : n > r ? 1 : n === r ? 0 : 
             // one or both are NaN.
             isNaN(n) ? isNaN(r) ? 0 : -1 : 1;
@@ -2277,14 +2277,14 @@ function Bt(t, e) {
         return zt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return zt(Ct(t), Ct(e));
+        return zt(Lt(t), Lt(e));
 
       case 5 /* StringValue */ :
         return _t(t.stringValue, e.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            const n = qt(t), r = qt(e);
+            const n = Ot(t), r = Ot(e);
             return n.compareTo(r);
         }(t.bytesValue, e.bytesValue);
 
@@ -2300,16 +2300,16 @@ function Bt(t, e) {
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            const n = _t(Ft(t.latitude), Ft(e.latitude));
+            const n = _t(qt(t.latitude), qt(e.latitude));
             if (0 !== n) return n;
-            return _t(Ft(t.longitude), Ft(e.longitude));
+            return _t(qt(t.longitude), qt(e.longitude));
         }(t.geoPointValue, e.geoPointValue);
 
       case 9 /* ArrayValue */ :
         return function(t, e) {
             const n = t.values || [], r = e.values || [];
             for (let t = 0; t < n.length && t < r.length; ++t) {
-                const e = Bt(n[t], r[t]);
+                const e = Qt(n[t], r[t]);
                 if (e) return e;
             }
             return _t(n.length, r.length);
@@ -2317,9 +2317,9 @@ function Bt(t, e) {
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
-            if (t === Lt && e === Lt) return 0;
-            if (t === Lt) return 1;
-            if (e === Lt) return -1;
+            if (t === Mt && e === Mt) return 0;
+            if (t === Mt) return 1;
+            if (e === Mt) return -1;
             const n = t.fields || {}, r = Object.keys(n), s = e.fields || {}, i = Object.keys(s);
             // Even though MapValues are likely sorted correctly based on their insertion
             // order (e.g. when received from the backend), local modifications can bring
@@ -2329,7 +2329,7 @@ function Bt(t, e) {
             for (let t = 0; t < r.length && t < i.length; ++t) {
                 const e = _t(r[t], i[t]);
                 if (0 !== e) return e;
-                const o = Bt(n[r[t]], s[i[t]]);
+                const o = Qt(n[r[t]], s[i[t]]);
                 if (0 !== o) return o;
             }
             return _t(r.length, i.length);
@@ -2337,39 +2337,39 @@ function Bt(t, e) {
         /** Returns a reference value for the provided database and key. */ (t.mapValue, e.mapValue);
 
       default:
-        throw v();
+        throw b();
     }
 }
 
 function zt(t, e) {
     if ("string" == typeof t && "string" == typeof e && t.length === e.length) return _t(t, e);
-    const n = St(t), r = St(e), s = _t(n.seconds, r.seconds);
+    const n = Ft(t), r = Ft(e), s = _t(n.seconds, r.seconds);
     return 0 !== s ? s : _t(n.nanos, r.nanos);
 }
 
-function Qt(t, e) {
+function Wt(t, e) {
     return {
         referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${e.path.canonicalString()}`
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Wt(t) {
+/** Returns true if `value` is an ArrayValue. */ function Gt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Gt(t) {
+/** Returns true if `value` is a NullValue. */ function Kt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function Kt(t) {
+/** Returns true if `value` is NaN. */ function Yt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function Yt(t) {
+/** Returns true if `value` is a MapValue. */ function Ht(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Ht(t) {
+/** Creates a deep copy of `source`. */ function Jt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -2382,7 +2382,7 @@ function Qt(t, e) {
                 fields: {}
             }
         };
-        return It(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Ht(n))), e;
+        return Tt(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Jt(n))), e;
     }
     if (t.arrayValue) {
         const e = {
@@ -2390,18 +2390,18 @@ function Qt(t, e) {
                 values: []
             }
         };
-        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Ht(t.arrayValue.values[n]);
+        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Jt(t.arrayValue.values[n]);
         return e;
     }
     return Object.assign({}, t);
 }
 
-class Jt {
+class Xt {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new Jt({
+        return new Xt({
             mapValue: {}
         });
     }
@@ -2415,7 +2415,7 @@ class Jt {
         {
             let e = this.value;
             for (let n = 0; n < t.length - 1; ++n) if (e = (e.mapValue.fields || {})[t.get(n)], 
-            !Yt(e)) return null;
+            !Ht(e)) return null;
             return e = (e.mapValue.fields || {})[t.lastSegment()], e || null;
         }
     }
@@ -2425,21 +2425,21 @@ class Jt {
      * @param path - The field path to set.
      * @param value - The value to set.
      */    set(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Ht(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Jt(e);
     }
     /**
      * Sets the provided fields to the provided values.
      *
      * @param data - A map of fields to values (or null for deletes).
      */    setAll(t) {
-        let e = et.emptyPath(), n = {}, r = [];
+        let e = nt.emptyPath(), n = {}, r = [];
         t.forEach(((t, s) => {
             if (!e.isImmediateParentOf(s)) {
                 // Insert the accumulated changes at this parent location
                 const t = this.getFieldsMap(e);
                 this.applyChanges(t, n, r), n = {}, r = [], e = s.popLast();
             }
-            t ? n[s.lastSegment()] = Ht(t) : r.push(s.lastSegment());
+            t ? n[s.lastSegment()] = Jt(t) : r.push(s.lastSegment());
         }));
         const s = this.getFieldsMap(e);
         this.applyChanges(s, n, r);
@@ -2451,10 +2451,10 @@ class Jt {
      * @param path - The field path to remove.
      */    delete(t) {
         const e = this.field(t.popLast());
-        Yt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        Ht(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }
     isEqual(t) {
-        return Ut(this.value, t.value);
+        return jt(this.value, t.value);
     }
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -2466,7 +2466,7 @@ class Jt {
         });
         for (let n = 0; n < t.length; ++n) {
             let r = e.mapValue.fields[t.get(n)];
-            Yt(r) && r.mapValue.fields || (r = {
+            Ht(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -2478,11 +2478,11 @@ class Jt {
      * Modifies `fieldsMap` by adding, replacing or deleting the specified
      * entries.
      */    applyChanges(t, e, n) {
-        It(e, ((e, n) => t[e] = n));
+        Tt(e, ((e, n) => t[e] = n));
         for (const e of n) delete t[e];
     }
     clone() {
-        return new Jt(Ht(this.value));
+        return new Xt(Jt(this.value));
     }
 }
 
@@ -2511,7 +2511,7 @@ class Jt {
  * 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 Xt {
+ */ class Zt {
     constructor(t, e, n, r, s, i) {
         this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.data = s, 
         this.documentState = i;
@@ -2520,23 +2520,23 @@ class Jt {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new Xt(t, 0 /* INVALID */ , bt.min(), bt.min(), Jt.empty(), 0 /* SYNCED */);
+        return new Zt(t, 0 /* INVALID */ , Et.min(), Et.min(), Xt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist with the given data at the
      * given version.
      */    static newFoundDocument(t, e, n) {
-        return new Xt(t, 1 /* FOUND_DOCUMENT */ , e, bt.min(), n, 0 /* SYNCED */);
+        return new Zt(t, 1 /* FOUND_DOCUMENT */ , e, Et.min(), n, 0 /* SYNCED */);
     }
     /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, e) {
-        return new Xt(t, 2 /* NO_DOCUMENT */ , e, bt.min(), Jt.empty(), 0 /* SYNCED */);
+        return new Zt(t, 2 /* NO_DOCUMENT */ , e, Et.min(), Xt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist at the given version but
      * whose data is not known (e.g. a document that was updated without a known
      * base document).
      */    static newUnknownDocument(t, e) {
-        return new Xt(t, 3 /* UNKNOWN_DOCUMENT */ , e, bt.min(), Jt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new Zt(t, 3 /* UNKNOWN_DOCUMENT */ , e, Et.min(), Xt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2549,7 +2549,7 @@ class Jt {
      * 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 = Jt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Xt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }
     /**
@@ -2557,14 +2557,14 @@ class Jt {
      * 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 = Jt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Xt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasCommittedMutations() {
         return this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasLocalMutations() {
-        return this.documentState = 1 /* HAS_LOCAL_MUTATIONS */ , this.version = bt.min(), 
+        return this.documentState = 1 /* HAS_LOCAL_MUTATIONS */ , this.version = Et.min(), 
         this;
     }
     setReadTime(t) {
@@ -2592,10 +2592,10 @@ class Jt {
         return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
     }
     isEqual(t) {
-        return t instanceof Xt && 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);
     }
     mutableCopy() {
-        return new Xt(this.key, this.documentType, this.version, this.readTime, this.data.clone(), this.documentState);
+        return new Zt(this.key, this.documentType, this.version, this.readTime, this.data.clone(), this.documentState);
     }
     toString() {
         return `Document(${this.key}, ${this.version}, ${JSON.stringify(this.data.value)}, {documentType: ${this.documentType}}), {documentState: ${this.documentState}})`;
@@ -2619,7 +2619,7 @@ class Jt {
  * limitations under the License.
  */
 // Visible for testing
-class Zt {
+class te {
     constructor(t, e = null, n = [], r = [], s = null, i = null, o = null) {
         this.path = t, this.collectionGroup = e, this.orderBy = n, this.filters = r, this.limit = s, 
         this.startAt = i, this.endAt = o, this.D = null;
@@ -2633,26 +2633,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 te(t, e = null, n = [], r = [], s = null, i = null, o = null) {
-    return new Zt(t, e, n, r, s, i, o);
+ */ function ee(t, e = null, n = [], r = [], s = null, i = null, o = null) {
+    return new te(t, e, n, r, s, i, o);
 }
 
-class ee extends class {} {
+class ne extends class {} {
     constructor(t, e, n) {
         super(), this.field = t, this.op = e, this.value = n;
     }
     /**
      * Creates a filter based on the provided arguments.
      */    static create(t, e, n) {
-        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.S(t, e, n) : new ne(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new oe(t, n) : "in" /* IN */ === e ? new ue(t, n) : "not-in" /* NOT_IN */ === e ? new ce(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ae(t, n) : new ee(t, e, n);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.S(t, e, n) : new re(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new ue(t, n) : "in" /* IN */ === e ? new ce(t, n) : "not-in" /* NOT_IN */ === e ? new ae(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new he(t, n) : new ne(t, e, n);
     }
     static S(t, e, n) {
-        return "in" /* IN */ === e ? new re(t, n) : new se(t, n);
+        return "in" /* IN */ === e ? new se(t, n) : new ie(t, n);
     }
     matches(t) {
         const e = t.data.field(this.field);
         // Types do not have to match in NOT_EQUAL filters.
-                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.F(Bt(e, this.value)) : null !== e && Mt(this.value) === Mt(e) && this.F(Bt(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.F(Qt(e, this.value)) : null !== e && Ut(this.value) === Ut(e) && this.F(Qt(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
     F(t) {
@@ -2676,7 +2676,7 @@ class ee extends class {} {
             return t >= 0;
 
           default:
-            return v();
+            return b();
         }
     }
     q() {
@@ -2685,79 +2685,79 @@ class ee extends class {} {
 }
 
 /** Filter that matches on key fields (i.e. '__name__'). */
-class ne extends ee {
+class re extends ne {
     constructor(t, e, n) {
-        super(t, e, n), this.key = nt.fromName(n.referenceValue);
+        super(t, e, n), this.key = rt.fromName(n.referenceValue);
     }
     matches(t) {
-        const e = nt.comparator(t.key, this.key);
+        const e = rt.comparator(t.key, this.key);
         return this.F(e);
     }
 }
 
-/** Filter that matches on key fields within an array. */ class re extends ee {
+/** Filter that matches on key fields within an array. */ class se extends ne {
     constructor(t, e) {
-        super(t, "in" /* IN */ , e), this.keys = ie("in" /* IN */ , e);
+        super(t, "in" /* IN */ , e), this.keys = oe("in" /* IN */ , e);
     }
     matches(t) {
         return this.keys.some((e => e.isEqual(t.key)));
     }
 }
 
-/** Filter that matches on key fields not present within an array. */ class se extends ee {
+/** Filter that matches on key fields not present within an array. */ class ie extends ne {
     constructor(t, e) {
-        super(t, "not-in" /* NOT_IN */ , e), this.keys = ie("not-in" /* NOT_IN */ , e);
+        super(t, "not-in" /* NOT_IN */ , e), this.keys = oe("not-in" /* NOT_IN */ , e);
     }
     matches(t) {
         return !this.keys.some((e => e.isEqual(t.key)));
     }
 }
 
-function ie(t, e) {
+function oe(t, e) {
     var n;
-    return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => nt.fromName(t.referenceValue)));
+    return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => rt.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class oe extends ee {
+/** A Filter that implements the array-contains operator. */ class ue extends ne {
     constructor(t, e) {
         super(t, "array-contains" /* ARRAY_CONTAINS */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return Wt(e) && jt(e.arrayValue, this.value);
+        return Gt(e) && Bt(e.arrayValue, this.value);
     }
 }
 
-/** A Filter that implements the IN operator. */ class ue extends ee {
+/** A Filter that implements the IN operator. */ class ce extends ne {
     constructor(t, e) {
         super(t, "in" /* IN */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return null !== e && jt(this.value.arrayValue, e);
+        return null !== e && Bt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the not-in operator. */ class ce extends ee {
+/** A Filter that implements the not-in operator. */ class ae extends ne {
     constructor(t, e) {
         super(t, "not-in" /* NOT_IN */ , e);
     }
     matches(t) {
-        if (jt(this.value.arrayValue, {
+        if (Bt(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         const e = t.data.field(this.field);
-        return null !== e && !jt(this.value.arrayValue, e);
+        return null !== e && !Bt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the array-contains-any operator. */ class ae extends ee {
+/** A Filter that implements the array-contains-any operator. */ class he extends ne {
     constructor(t, e) {
         super(t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return !(!Wt(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => jt(this.value.arrayValue, t)));
+        return !(!Gt(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => Bt(this.value.arrayValue, t)));
     }
 }
 
@@ -2774,7 +2774,7 @@ function ie(t, e) {
  * Bound provides a function to determine whether a document comes before or
  * after a bound. This is influenced by whether the position is just before or
  * just after the provided values.
- */ class he {
+ */ class le {
     constructor(t, e) {
         this.position = t, this.inclusive = e;
     }
@@ -2782,22 +2782,22 @@ function ie(t, e) {
 
 /**
  * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
- */ class le {
+ */ class fe {
     constructor(t, e = "asc" /* ASCENDING */) {
         this.field = t, this.dir = e;
     }
 }
 
-function fe(t, e) {
+function de(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
-function de(t, e) {
+function we(t, e) {
     if (null === t) return null === e;
     if (null === e) return !1;
     if (t.inclusive !== e.inclusive || t.position.length !== e.position.length) return !1;
     for (let n = 0; n < t.position.length; n++) {
-        if (!Ut(t.position[n], e.position[n])) return !1;
+        if (!jt(t.position[n], e.position[n])) return !1;
     }
     return !0;
 }
@@ -2824,7 +2824,7 @@ function de(t, e) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ class we {
+ */ class me {
     /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2837,11 +2837,11 @@ function de(t, e) {
     }
 }
 
-/** Creates a new Query for a query that matches all documents at `path` */ function me(t) {
+/** Creates a new Query for a query that matches all documents at `path` */ function pe(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function pe(t) {
+function ye(t) {
     for (const e of t.filters) if (e.q()) return e.field;
     return null;
 }
@@ -2854,7 +2854,7 @@ function pe(t) {
  * Returns whether the query matches a collection group rather than a specific
  * collection.
  */
-function ye(t) {
+function ge(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2863,22 +2863,22 @@ function ye(t) {
  * which can be different from the order by constraints the user provided (e.g.
  * the SDK and backend always orders by `__name__`).
  */ function _e(t) {
-    const e = E(t);
+    const e = I(t);
     if (null === e.O) {
         e.O = [];
-        const t = pe(e), n = me(e);
+        const t = ye(e), n = pe(e);
         if (null !== t && null === n) 
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
         // Note that the default inequality field and key ordering is ascending.
-        t.isKeyField() || e.O.push(new le(t)), e.O.push(new le(et.keyField(), "asc" /* ASCENDING */)); else {
+        t.isKeyField() || e.O.push(new fe(t)), e.O.push(new fe(nt.keyField(), "asc" /* ASCENDING */)); else {
             let t = !1;
             for (const n of e.explicitOrderBy) e.O.push(n), n.field.isKeyField() && (t = !0);
             if (!t) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 const t = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* ASCENDING */;
-                e.O.push(new le(et.keyField(), t));
+                e.O.push(new fe(nt.keyField(), t));
             }
         }
     }
@@ -2887,34 +2887,34 @@ function ye(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function ge(t) {
-    const e = E(t);
-    if (!e.k) if ("F" /* First */ === e.limitType) e.k = te(e.path, e.collectionGroup, _e(e), e.filters, e.limit, e.startAt, e.endAt); else {
+ */ function ve(t) {
+    const e = I(t);
+    if (!e.k) if ("F" /* First */ === e.limitType) e.k = ee(e.path, e.collectionGroup, _e(e), e.filters, e.limit, e.startAt, e.endAt); else {
         // Flip the orderBy directions since we want the last results
         const t = [];
         for (const n of _e(e)) {
             const e = "desc" /* DESCENDING */ === n.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            t.push(new le(n.field, e));
+            t.push(new fe(n.field, e));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                const n = e.endAt ? new he(e.endAt.position, e.endAt.inclusive) : null, r = e.startAt ? new he(e.startAt.position, e.startAt.inclusive) : null;
+                const n = e.endAt ? new le(e.endAt.position, e.endAt.inclusive) : null, r = e.startAt ? new le(e.startAt.position, e.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
-        e.k = te(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
+        e.k = ee(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
     }
     return e.k;
 }
 
-function ve(t, e) {
+function be(t, e) {
     return function(t, e) {
         if (t.limit !== e.limit) return !1;
         if (t.orderBy.length !== e.orderBy.length) return !1;
-        for (let n = 0; n < t.orderBy.length; n++) if (!fe(t.orderBy[n], e.orderBy[n])) return !1;
+        for (let n = 0; n < t.orderBy.length; n++) if (!de(t.orderBy[n], e.orderBy[n])) return !1;
         if (t.filters.length !== e.filters.length) return !1;
         for (let s = 0; s < t.filters.length; s++) if (n = t.filters[s], r = e.filters[s], 
-        n.op !== r.op || !n.field.isEqual(r.field) || !Ut(n.value, r.value)) return !1;
+        n.op !== r.op || !n.field.isEqual(r.field) || !jt(n.value, r.value)) return !1;
         var n, r;
-        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!de(t.startAt, e.startAt) && de(t.endAt, e.endAt);
-    }(ge(t), ge(e)) && t.limitType === e.limitType;
+        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!we(t.startAt, e.startAt) && we(t.endAt, e.endAt);
+    }(ve(t), ve(e)) && t.limitType === e.limitType;
 }
 
 /**
@@ -2942,9 +2942,9 @@ function ve(t, e) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function be(t, e) {
+function Ee(t, e) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !ht(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !lt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
     /**
  * Returns an IntegerValue for `value`.
@@ -2966,7 +2966,7 @@ function be(t, e) {
             };
         }
         return {
-            doubleValue: ht(e) ? "-0" : e
+            doubleValue: lt(e) ? "-0" : e
         };
     }(t, e);
 }
@@ -2987,7 +2987,7 @@ function be(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Used to represent a field transform on a mutation. */ class Ee {
+/** Used to represent a field transform on a mutation. */ class Ie {
     constructor() {
         // Make sure that the structural type of `TransformOperation` is unique.
         // See https://github.com/microsoft/TypeScript/issues/5451
@@ -2995,15 +2995,15 @@ function be(t, e) {
     }
 }
 
-/** Transforms a value into a server-generated timestamp. */ class Ie extends Ee {}
+/** Transforms a value into a server-generated timestamp. */ class Te extends Ie {}
 
-/** Transforms an array value via a union operation. */ class Te extends Ee {
+/** Transforms an array value via a union operation. */ class Ae extends Ie {
     constructor(t) {
         super(), this.elements = t;
     }
 }
 
-/** Transforms an array value via a remove operation. */ class Ae extends Ee {
+/** Transforms an array value via a remove operation. */ class Re extends Ie {
     constructor(t) {
         super(), this.elements = t;
     }
@@ -3014,7 +3014,7 @@ function be(t, e) {
  * transforms. Converts all field values to integers or doubles, but unlike the
  * backend does not cap integer values at 2^63. Instead, JavaScript number
  * arithmetic is used and precision loss can occur for values greater than 2^53.
- */ class Re extends Ee {
+ */ class Pe extends Ie {
     constructor(t, e) {
         super(), this.L = t, this.M = e;
     }
@@ -3036,7 +3036,7 @@ function be(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** A field path and the TransformOperation to perform upon it. */ class Pe {
+/** A field path and the TransformOperation to perform upon it. */ class Ve {
     constructor(t, e) {
         this.field = t, this.transform = e;
     }
@@ -3046,18 +3046,18 @@ function be(t, e) {
  * Encodes a precondition for a mutation. This follows the model that the
  * backend accepts with the special case of an explicit "empty" precondition
  * (meaning no precondition).
- */ class Ve {
+ */ class Ne {
     constructor(t, e) {
         this.updateTime = t, this.exists = e;
     }
     /** Creates a new empty Precondition. */    static none() {
-        return new Ve;
+        return new Ne;
     }
     /** Creates a new Precondition with an exists flag. */    static exists(t) {
-        return new Ve(void 0, t);
+        return new Ne(void 0, t);
     }
     /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {
-        return new Ve(t);
+        return new Ne(t);
     }
     /** Returns whether this Precondition is empty. */    get isNone() {
         return void 0 === this.updateTime && void 0 === this.exists;
@@ -3110,12 +3110,12 @@ function be(t, e) {
  * applyToLocalView() to implement the actual behavior of applying the mutation
  * to some source document (see `setMutationApplyToRemoteDocument()` for an
  * example).
- */ class Ne {}
+ */ class $e {}
 
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class $e extends Ne {
+ */ class De extends $e {
     constructor(t, e, n, r = []) {
         super(), this.key = t, this.value = e, this.precondition = n, this.fieldTransforms = r, 
         this.type = 0 /* Set */;
@@ -3137,7 +3137,7 @@ function be(t, e) {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ class De extends Ne {
+ */ class xe extends $e {
     constructor(t, e, n, r, s = []) {
         super(), this.key = t, this.data = e, this.fieldMask = n, this.precondition = r, 
         this.fieldTransforms = s, this.type = 1 /* Patch */;
@@ -3147,7 +3147,7 @@ function be(t, e) {
     }
 }
 
-/** A mutation that deletes the document at the given key. */ class xe extends Ne {
+/** A mutation that deletes the document at the given key. */ class Se extends $e {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 2 /* Delete */ , this.fieldTransforms = [];
     }
@@ -3162,7 +3162,7 @@ function be(t, e) {
  *
  * The `verify` operation is only used in Transactions, and this class serves
  * primarily to facilitate serialization into protos.
- */ class Se extends Ne {
+ */ class Fe extends $e {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 3 /* Verify */ , this.fieldTransforms = [];
     }
@@ -3186,13 +3186,13 @@ function be(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const Fe = (() => {
+ */ const qe = (() => {
     const t = {
         asc: "ASCENDING",
         desc: "DESCENDING"
     };
     return t;
-})(), qe = (() => {
+})(), Oe = (() => {
     const t = {
         "<": "LESS_THAN",
         "<=": "LESS_THAN_OR_EQUAL",
@@ -3222,7 +3222,7 @@ function be(t, e) {
  * TODO(klimt): We can remove the databaseId argument if we keep the full
  * resource name in documents.
  */
-class Oe {
+class ke {
     constructor(t, e) {
         this.databaseId = t, this.C = e;
     }
@@ -3239,7 +3239,7 @@ class Oe {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function ke(t, e) {
+function Ce(t, e) {
     if (t.C) {
         return `${new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + e.nanoseconds).slice(-9)}Z`;
     }
@@ -3254,121 +3254,121 @@ function ke(t, e) {
  *
  * Visible for testing.
  */
-function Ce(t, e) {
+function Le(t, e) {
     return t.C ? e.toBase64() : e.toUint8Array();
 }
 
-function Le(t, e) {
-    return ke(t, e.toTimestamp());
+function Me(t, e) {
+    return Ce(t, e.toTimestamp());
 }
 
-function Me(t) {
-    return b(!!t), bt.fromTimestamp(function(t) {
-        const e = St(t);
-        return new vt(e.seconds, e.nanos);
+function Ue(t) {
+    return E(!!t), Et.fromTimestamp(function(t) {
+        const e = Ft(t);
+        return new bt(e.seconds, e.nanos);
     }(t));
 }
 
-function Ue(t, e) {
+function je(t, e) {
     return function(t) {
-        return new Z([ "projects", t.projectId, "databases", t.database ]);
+        return new tt([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
-function je(t, e) {
-    return Ue(t.databaseId, e.path);
+function Be(t, e) {
+    return je(t.databaseId, e.path);
 }
 
-function Be(t, e) {
+function Qe(t, e) {
     const n = function(t) {
-        const e = Z.fromString(t);
-        return b(tn(e)), e;
+        const e = tt.fromString(t);
+        return E(en(e)), e;
     }(e);
-    if (n.get(1) !== t.databaseId.projectId) throw new M(R, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
-    if (n.get(3) !== t.databaseId.database) throw new M(R, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
-    return new nt((b((r = n).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
+    if (n.get(1) !== t.databaseId.projectId) throw new U(P, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
+    if (n.get(3) !== t.databaseId.database) throw new U(P, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
+    return new rt((E((r = n).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
     var r;
     /** Creates a Document proto from key and fields (but no create/update time) */}
 
 function ze(t, e) {
-    return Ue(t.databaseId, e);
+    return je(t.databaseId, e);
 }
 
-function Qe(t) {
-    return new Z([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
+function We(t) {
+    return new tt([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function We(t, e, n) {
+function Ge(t, e, n) {
     return {
-        name: je(t, e),
+        name: Be(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function Ge(t, e) {
+function Ke(t, e) {
     return "found" in e ? function(t, e) {
-        b(!!e.found), e.found.name, e.found.updateTime;
-        const n = Be(t, e.found.name), r = Me(e.found.updateTime), s = new Jt({
+        E(!!e.found), e.found.name, e.found.updateTime;
+        const n = Qe(t, e.found.name), r = Ue(e.found.updateTime), s = new Xt({
             mapValue: {
                 fields: e.found.fields
             }
         });
-        return Xt.newFoundDocument(n, r, s);
+        return Zt.newFoundDocument(n, r, s);
     }(t, e) : "missing" in e ? function(t, e) {
-        b(!!e.missing), b(!!e.readTime);
-        const n = Be(t, e.missing), r = Me(e.readTime);
-        return Xt.newNoDocument(n, r);
-    }(t, e) : v();
+        E(!!e.missing), E(!!e.readTime);
+        const n = Qe(t, e.missing), r = Ue(e.readTime);
+        return Zt.newNoDocument(n, r);
+    }(t, e) : b();
 }
 
-function Ke(t, e) {
+function Ye(t, e) {
     let n;
-    if (e instanceof $e) n = {
-        update: We(t, e.key, e.value)
+    if (e instanceof De) n = {
+        update: Ge(t, e.key, e.value)
+    }; else if (e instanceof Se) n = {
+        delete: Be(t, e.key)
     }; else if (e instanceof xe) n = {
-        delete: je(t, e.key)
-    }; else if (e instanceof De) n = {
-        update: We(t, e.key, e.data),
-        updateMask: Ze(e.fieldMask)
+        update: Ge(t, e.key, e.data),
+        updateMask: tn(e.fieldMask)
     }; else {
-        if (!(e instanceof Se)) return v();
+        if (!(e instanceof Fe)) return b();
         n = {
-            verify: je(t, e.key)
+            verify: Be(t, e.key)
         };
     }
     return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((t => function(t, e) {
         const n = e.transform;
-        if (n instanceof Ie) return {
+        if (n instanceof Te) return {
             fieldPath: e.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
-        if (n instanceof Te) return {
+        if (n instanceof Ae) return {
             fieldPath: e.field.canonicalString(),
             appendMissingElements: {
                 values: n.elements
             }
         };
-        if (n instanceof Ae) return {
+        if (n instanceof Re) return {
             fieldPath: e.field.canonicalString(),
             removeAllFromArray: {
                 values: n.elements
             }
         };
-        if (n instanceof Re) return {
+        if (n instanceof Pe) return {
             fieldPath: e.field.canonicalString(),
             increment: n.M
         };
-        throw v();
+        throw b();
     }(0, t)))), e.precondition.isNone || (n.currentDocument = function(t, e) {
         return void 0 !== e.updateTime ? {
-            updateTime: Le(t, e.updateTime)
+            updateTime: Me(t, e.updateTime)
         } : void 0 !== e.exists ? {
             exists: e.exists
-        } : v();
+        } : b();
     }(t, e.precondition)), n;
 }
 
-function Ye(t, e) {
+function He(t, e) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const n = {
         structuredQuery: {}
@@ -3385,36 +3385,36 @@ function Ye(t, e) {
         // visible for testing
         function(t) {
             if ("==" /* EQUAL */ === t.op) {
-                if (Kt(t.value)) return {
+                if (Yt(t.value)) return {
                     unaryFilter: {
-                        field: Xe(t.field),
+                        field: Ze(t.field),
                         op: "IS_NAN"
                     }
                 };
-                if (Gt(t.value)) return {
+                if (Kt(t.value)) return {
                     unaryFilter: {
-                        field: Xe(t.field),
+                        field: Ze(t.field),
                         op: "IS_NULL"
                     }
                 };
             } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                if (Kt(t.value)) return {
+                if (Yt(t.value)) return {
                     unaryFilter: {
-                        field: Xe(t.field),
+                        field: Ze(t.field),
                         op: "IS_NOT_NAN"
                     }
                 };
-                if (Gt(t.value)) return {
+                if (Kt(t.value)) return {
                     unaryFilter: {
-                        field: Xe(t.field),
+                        field: Ze(t.field),
                         op: "IS_NOT_NULL"
                     }
                 };
             }
             return {
                 fieldFilter: {
-                    field: Xe(t.field),
-                    op: Je(t.op),
+                    field: Ze(t.field),
+                    op: Xe(t.op),
                     value: t.value
                 }
             };
@@ -3434,14 +3434,14 @@ function Ye(t, e) {
         // visible for testing
         function(t) {
             return {
-                field: Xe(t.field),
-                direction: He(t.dir)
+                field: Ze(t.field),
+                direction: Je(t.dir)
             };
         }(t)));
     }(e.orderBy);
     i && (n.structuredQuery.orderBy = i);
     const o = function(t, e) {
-        return t.C || at(e) ? e : {
+        return t.C || ht(e) ? e : {
             value: e
         };
     }(t, e.limit);
@@ -3459,29 +3459,29 @@ function Ye(t, e) {
     (e.endAt)), n;
 }
 
-function He(t) {
-    return Fe[t];
-}
-
-// visible for testing
 function Je(t) {
     return qe[t];
 }
 
+// visible for testing
 function Xe(t) {
+    return Oe[t];
+}
+
+function Ze(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Ze(t) {
+function tn(t) {
     const e = [];
     return t.fields.forEach((t => e.push(t.canonicalString()))), {
         fieldPaths: e
     };
 }
 
-function tn(t) {
+function en(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -3501,8 +3501,8 @@ function tn(t) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function en(t) {
-    return new Oe(t, /* useProto3Json= */ !0);
+ */ function nn(t) {
+    return new ke(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -3530,7 +3530,7 @@ function tn(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class nn {
+class rn {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3585,7 +3585,7 @@ class nn {
         // honored as such).
         const e = Math.floor(this.G + this.X()), n = Math.max(0, Date.now() - this.Y), r = Math.max(0, e - n);
         // Guard against lastAttemptTime being in the future due to a clock change.
-                r > 0 && p("ExponentialBackoff", `Backing off for ${r} ms (base delay: ${this.G} ms, delay with jitter: ${e} ms, last attempt: ${n} ms ago)`), 
+                r > 0 && y("ExponentialBackoff", `Backing off for ${r} ms (base delay: ${this.G} ms, delay with jitter: ${e} ms, last attempt: ${n} ms ago)`), 
         this.K = this.U.enqueueAfterDelay(this.timerId, r, (() => (this.Y = Date.now(), 
         t()))), 
         // Apply backoff factor to determine next delay and ensure it is within
@@ -3628,24 +3628,24 @@ class nn {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class rn extends class {} {
+class sn extends class {} {
     constructor(t, e, n, r) {
         super(), this.authCredentials = t, this.appCheckCredentials = e, this.tt = n, this.L = r, 
         this.et = !1;
     }
     nt() {
-        if (this.et) throw new M(S, "The client has already been terminated.");
+        if (this.et) throw new U(F, "The client has already been terminated.");
     }
     /** Invokes the provided RPC with auth and AppCheck tokens. */    I(t, e, n) {
         return this.nt(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.tt.I(t, e, n, r, s))).catch((t => {
-            throw "FirebaseError" === t.name ? (t.code === D && (this.authCredentials.invalidateToken(), 
-            this.appCheckCredentials.invalidateToken()), t) : new M(A, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === x && (this.authCredentials.invalidateToken(), 
+            this.appCheckCredentials.invalidateToken()), t) : new U(R, t.toString());
         }));
     }
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */    P(t, e, n, r) {
         return this.nt(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([s, i]) => this.tt.P(t, e, n, s, i, r))).catch((t => {
-            throw "FirebaseError" === t.name ? (t.code === D && (this.authCredentials.invalidateToken(), 
-            this.appCheckCredentials.invalidateToken()), t) : new M(A, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === x && (this.authCredentials.invalidateToken(), 
+            this.appCheckCredentials.invalidateToken()), t) : new U(R, t.toString());
         }));
     }
     terminate() {
@@ -3655,42 +3655,60 @@ class rn extends class {} {
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function sn(t, e) {
-    const n = E(t), r = Qe(n.L) + "/documents", s = {
-        writes: e.map((t => Ke(n.L, t)))
+async function on(t, e) {
+    const n = I(t), r = We(n.L) + "/documents", s = {
+        writes: e.map((t => Ye(n.L, t)))
     };
     await n.I("Commit", r, s);
 }
 
-async function on(t, e) {
-    const n = E(t), r = Qe(n.L) + "/documents", s = {
-        documents: e.map((t => je(n.L, t)))
+async function un(t, e) {
+    const n = I(t), r = We(n.L) + "/documents", s = {
+        documents: e.map((t => Be(n.L, t)))
     }, i = await n.P("BatchGetDocuments", r, s, e.length), o = new Map;
     i.forEach((t => {
-        const e = Ge(n.L, t);
+        const e = Ke(n.L, t);
         o.set(e.key.toString(), e);
     }));
     const u = [];
     return e.forEach((t => {
         const e = o.get(t.toString());
-        b(!!e), u.push(e);
+        E(!!e), u.push(e);
     })), u;
 }
 
-async function un(t, e) {
-    const n = E(t), r = Ye(n.L, ge(e));
+async function cn(t, e) {
+    const n = I(t), r = He(n.L, ve(e));
     return (await n.P("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, e, n) {
-        const r = Be(t, e.name), s = Me(e.updateTime), i = new Jt({
+        const r = Qe(t, e.name), s = Ue(e.updateTime), i = new Xt({
             mapValue: {
                 fields: e.fields
             }
-        }), o = Xt.newFoundDocument(r, s, i);
+        }), o = Zt.newFoundDocument(r, s, i);
         return n && o.setHasCommittedMutations(), n ? o.setHasCommittedMutations() : o;
     }(n.L, t.document, void 0)));
 }
 
+async function an(t, e) {
+    const n = I(t), r = function(t, e) {
+        const n = He(t, e);
+        return {
+            structuredAggregationQuery: {
+                aggregations: [ {
+                    count: {},
+                    alias: "count_alias"
+                } ],
+                structuredQuery: n.structuredQuery
+            },
+            parent: n.parent
+        };
+    }(n.L, ve(e)), s = r.parent;
+    n.tt.v || delete r.parent;
+    return (await n.P("RunAggregationQuery", s, r, /*expectedResponseCount=*/ 1)).filter((t => !!t.result)).map((t => t.result.aggregateFields));
+}
+
 /**
  * @license
  * Copyright 2020 Google LLC
@@ -3706,7 +3724,7 @@ async function un(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const cn = new Map;
+ */ const hn = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3717,17 +3735,17 @@ async function un(t, e) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function an(t) {
-    if (t._terminated) throw new M(S, "The client has already been terminated.");
-    if (!cn.has(t)) {
-        p("ComponentProvider", "Initializing Datastore");
+function ln(t) {
+    if (t._terminated) throw new U(F, "The client has already been terminated.");
+    if (!hn.has(t)) {
+        y("ComponentProvider", "Initializing Datastore");
         const i = function(t) {
-            return new mt(t, fetch.bind(null));
+            return new pt(t, fetch.bind(null));
         }((e = t._databaseId, n = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
-        new H(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = en(t._databaseId), u = function(t, e, n, r) {
-            return new rn(t, e, n, r);
+        new J(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = nn(t._databaseId), u = function(t, e, n, r) {
+            return new sn(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, i, o);
-        cn.set(t, u);
+        hn.set(t, u);
     }
     var e, n, r, s;
     /**
@@ -3745,7 +3763,7 @@ function an(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 cn.get(t);
+ */    return hn.get(t);
 }
 
 /**
@@ -3757,21 +3775,21 @@ function an(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 hn {
+class fn {
     constructor(t) {
         var e;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new M(R, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new U(P, "Can't provide ssl option if host option is not set");
             this.host = "firestore.googleapis.com", this.ssl = true;
         } else this.host = t.host, this.ssl = null === (e = t.ssl) || void 0 === e || e;
         if (this.credentials = t.credentials, this.ignoreUndefinedProperties = !!t.ignoreUndefinedProperties, 
         void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
-            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new M(R, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new U(P, "cacheSizeBytes must be at least 1048576");
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
         this.useFetchStreams = !!t.useFetchStreams, function(t, e, n, r) {
-            if (!0 === e && !0 === r) throw new M(R, `${t} and ${n} cannot be used together.`);
+            if (!0 === e && !0 === r) throw new U(P, `${t} and ${n} cannot be used together.`);
         }("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
     }
     isEqual(t) {
@@ -3798,8 +3816,8 @@ class hn {
 /**
  * The Cloud Firestore service interface.
  *
- * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class ln {
+ * Do not call this constructor directly. Instead, use {@link (getFirestore:1)}.
+ */ class dn {
     /** @hideconstructor */
     constructor(t, e, n, r) {
         this._authCredentials = t, this._appCheckCredentials = e, this._databaseId = n, 
@@ -3807,14 +3825,14 @@ class hn {
         /**
          * Whether it's a Firestore or Firestore Lite instance.
          */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new hn({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new fn({}), 
         this._settingsFrozen = !1;
     }
     /**
      * The {@link @firebase/app#FirebaseApp} associated with this `Firestore` service
      * instance.
      */    get app() {
-        if (!this._app) throw new M(S, "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() {
@@ -3824,19 +3842,19 @@ class hn {
         return void 0 !== this._terminateTask;
     }
     _setSettings(t) {
-        if (this._settingsFrozen) throw new M(S, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
-        this._settings = new hn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
-            if (!t) return new B;
+        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 fn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+            if (!t) return new Q;
             switch (t.type) {
               case "gapi":
                 const e = t.client;
-                return new G(e, t.sessionIndex || "0", t.iamToken || null, t.authTokenFactory || null);
+                return new K(e, t.sessionIndex || "0", t.iamToken || null, t.authTokenFactory || null);
 
               case "provider":
                 return t.client;
 
               default:
-                throw new M(R, "makeAuthCredentialsProvider failed due to invalid credential type");
+                throw new U(P, "makeAuthCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }
@@ -3864,23 +3882,23 @@ class hn {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const e = cn.get(t);
-            e && (p("ComponentProvider", "Removing Datastore"), cn.delete(t), e.terminate());
+            const e = hn.get(t);
+            e && (y("ComponentProvider", "Removing Datastore"), hn.delete(t), e.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function fn(t, e, n) {
+function wn(t, e, n) {
     n || (n = "(default)");
     const r = _getProvider(t, "firestore/lite");
-    if (r.isInitialized(n)) throw new M(S, "Firestore can only be initialized once per app.");
+    if (r.isInitialized(n)) throw new U(F, "Firestore can only be initialized once per app.");
     return r.initialize({
         options: e,
         instanceIdentifier: n
     });
 }
 
-function dn(e, n) {
+function mn(e, n) {
     const r = "object" == typeof e ? e : t(), s = "string" == typeof e ? e : n || "(default)";
     return _getProvider(r, "firestore/lite").getImmediate({
         identifier: s
@@ -3899,24 +3917,24 @@ function dn(e, n) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function wn(t, e, n, r = {}) {
+ */ function pn(t, e, n, r = {}) {
     var s;
-    const i = (t = ut(t, ln))._getSettings();
+    const i = (t = ct(t, dn))._getSettings();
     if ("firestore.googleapis.com" !== i.host && i.host !== e && _("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, i), {
         host: `${e}:${n}`,
         ssl: !1
     })), r.mockUserToken) {
         let e, n;
-        if ("string" == typeof r.mockUserToken) e = r.mockUserToken, n = f.MOCK_USER; else {
+        if ("string" == typeof r.mockUserToken) e = r.mockUserToken, n = d.MOCK_USER; else {
             // Let createMockUserToken validate first (catches common mistakes like
             // invalid field "uid" and missing field "sub" / "user_id".)
             e = h(r.mockUserToken, null === (s = t._app) || void 0 === s ? void 0 : s.options.projectId);
             const i = r.mockUserToken.sub || r.mockUserToken.user_id;
-            if (!i) throw new M(R, "mockUserToken must contain 'sub' or 'user_id' field!");
-            n = new f(i);
+            if (!i) throw new U(P, "mockUserToken must contain 'sub' or 'user_id' field!");
+            n = new d(i);
         }
-        t._authCredentials = new z(new j(e, n));
+        t._authCredentials = new z(new B(e, n));
     }
 }
 
@@ -3929,7 +3947,7 @@ function dn(e, n) {
  * response from the server will not be resolved.
  *
  * To restart after termination, create a new instance of `Firestore` with
- * {@link getFirestore}.
+ * {@link (getFirestore:1)}.
  *
  * Note: Under normal circumstances, calling `terminate()` is not required. This
  * function is useful only when you want to force this instance to release all of
@@ -3939,8 +3957,8 @@ function dn(e, n) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function mn(t) {
-    return t = ut(t, ln), e(t.app, "firestore/lite"), t._delete();
+ */ function yn(t) {
+    return t = ct(t, dn), e(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3959,6 +3977,91 @@ function dn(e, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
+/**
+ * @license
+ * Copyright 2022 Google LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * Represents an aggregation that can be performed by Firestore.
+ */
+// eslint-disable-next-line @typescript-eslint/no-unused-vars
+class gn {
+    constructor() {
+        /** A type string to uniquely identify instances of this class. */
+        this.type = "AggregateField";
+    }
+}
+
+/**
+ * The results of executing an aggregation query.
+ */ class _n {
+    /** @hideconstructor */
+    constructor(t, e) {
+        this._data = e, 
+        /** A type string to uniquely identify instances of this class. */
+        this.type = "AggregateQuerySnapshot", this.query = t;
+    }
+    /**
+     * Returns the results of the aggregations performed over the underlying
+     * query.
+     *
+     * The keys of the returned object will be the same as those of the
+     * `AggregateSpec` object specified to the aggregation method, and the values
+     * will be the corresponding aggregation result.
+     *
+     * @returns The results of the aggregations performed over the underlying
+     * query.
+     */    data() {
+        return this._data;
+    }
+}
+
+/**
+ * @license
+ * Copyright 2022 Google LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * CountQueryRunner encapsulates the logic needed to run the count aggregation
+ * queries.
+ */ class vn {
+    constructor(t, e, n) {
+        this.query = t, this.datastore = e, this.userDataWriter = n;
+    }
+    run() {
+        return an(this.datastore, this.query._query).then((t => {
+            E(void 0 !== t[0]);
+            const e = Object.entries(t[0]).filter((([t, e]) => "count_alias" === t)).map((([t, e]) => this.userDataWriter.convertValue(e)))[0];
+            return E("number" == typeof e), Promise.resolve(new _n(this.query, {
+                count: e
+            }));
+        }));
+    }
+}
+
 /**
  * @license
  * Copyright 2020 Google LLC
@@ -3979,8 +4082,7 @@ function dn(e, n) {
  * A `DocumentReference` refers to a document location in a Firestore database
  * and can be used to write, read, or listen to the location. The document at
  * the referenced location may or may not exist.
- */
-class pn {
+ */ class bn {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -4008,17 +4110,17 @@ class pn {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new _n(this.firestore, this.converter, this._key.path.popLast());
+        return new In(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new pn(this.firestore, t, this._key);
+        return new bn(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 yn {
+ */ class En {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -4031,17 +4133,17 @@ class pn {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new yn(this.firestore, t, this._query);
+        return new En(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 _n extends yn {
+ */ class In extends En {
     /** @hideconstructor */
     constructor(t, e, n) {
-        super(t, e, new we(n)), this._path = n, 
+        super(t, e, new me(n)), this._path = n, 
         /** The type of this Firestore reference. */
         this.type = "collection";
     }
@@ -4059,23 +4161,23 @@ class pn {
      * subcollection. If this isn't a subcollection, the reference is null.
      */    get parent() {
         const t = this._path.popLast();
-        return t.isEmpty() ? null : new pn(this.firestore, 
-        /* converter= */ null, new nt(t));
+        return t.isEmpty() ? null : new bn(this.firestore, 
+        /* converter= */ null, new rt(t));
     }
     withConverter(t) {
-        return new _n(this.firestore, t, this._path);
+        return new In(this.firestore, t, this._path);
     }
 }
 
-function gn(t, e, ...n) {
-    if (t = l(t), rt("collection", "path", e), t instanceof ln) {
-        const r = Z.fromString(e, ...n);
-        return it(r), new _n(t, /* converter= */ null, r);
+function Tn(t, e, ...n) {
+    if (t = l(t), st("collection", "path", e), t instanceof dn) {
+        const r = tt.fromString(e, ...n);
+        return ot(r), new In(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof pn || t instanceof _n)) throw new M(R, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-        const r = t._path.child(Z.fromString(e, ...n));
-        return it(r), new _n(t.firestore, 
+        if (!(t instanceof bn || t instanceof In)) throw new U(P, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        const r = t._path.child(tt.fromString(e, ...n));
+        return ot(r), new In(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -4092,32 +4194,32 @@ function gn(t, e, ...n) {
  * collection or subcollection with this ID as the last segment of its path
  * will be included. Cannot contain a slash.
  * @returns The created `Query`.
- */ function vn(t, e) {
-    if (t = ut(t, ln), rt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new M(R, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new yn(t, 
+ */ function An(t, e) {
+    if (t = ct(t, dn), st("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new U(P, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new En(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 we(Z.emptyPath(), t);
+        return new me(tt.emptyPath(), t);
     }(e));
 }
 
-function bn(t, e, ...n) {
+function Rn(t, e, ...n) {
     if (t = l(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = yt.$()), rt("doc", "path", e), t instanceof ln) {
-        const r = Z.fromString(e, ...n);
-        return st(r), new pn(t, 
-        /* converter= */ null, new nt(r));
+    1 === arguments.length && (e = gt.$()), st("doc", "path", e), t instanceof dn) {
+        const r = tt.fromString(e, ...n);
+        return it(r), new bn(t, 
+        /* converter= */ null, new rt(r));
     }
     {
-        if (!(t instanceof pn || t instanceof _n)) throw new M(R, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-        const r = t._path.child(Z.fromString(e, ...n));
-        return st(r), new pn(t.firestore, t instanceof _n ? t.converter : null, new nt(r));
+        if (!(t instanceof bn || t instanceof In)) throw new U(P, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        const r = t._path.child(tt.fromString(e, ...n));
+        return it(r), new bn(t.firestore, t instanceof In ? t.converter : null, new rt(r));
     }
 }
 
@@ -4128,8 +4230,8 @@ function bn(t, e, ...n) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function En(t, e) {
-    return t = l(t), e = l(e), (t instanceof pn || t instanceof _n) && (e instanceof pn || e instanceof _n) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+ */ function Pn(t, e) {
+    return t = l(t), e = l(e), (t instanceof bn || t instanceof In) && (e instanceof bn || e instanceof In) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -4140,59 +4242,8 @@ function bn(t, e, ...n) {
  * @param right - A `Query` to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function In(t, e) {
-    return t = l(t), e = l(e), t instanceof yn && e instanceof yn && (t.firestore === e.firestore && ve(t._query, e._query) && t.converter === e.converter);
-}
-
-/**
- * @license
- * Copyright 2020 Google LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *   http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-/**
- * A `FieldPath` refers to a field in a document. The path may consist of a
- * single field name (referring to a top-level field in the document), or a
- * list of field names (referring to a nested field in the document).
- *
- * 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 Tn {
-    /**
-     * 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.
-     *
-     * @param fieldNames - A list of field names.
-     */
-    constructor(...t) {
-        for (let e = 0; e < t.length; ++e) if (0 === t[e].length) throw new M(R, "Invalid field name at argument $(i + 1). Field names must not be empty.");
-        this._internalPath = new et(t);
-    }
-    /**
-     * Returns true if this `FieldPath` is equal to the provided one.
-     *
-     * @param other - The `FieldPath` to compare against.
-     * @returns true if this `FieldPath` is equal to the provided one.
-     */    isEqual(t) {
-        return this._internalPath.isEqual(t._internalPath);
-    }
-}
-
-/**
- * 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 An() {
-    return new Tn("__name__");
+ */ function Vn(t, e) {
+    return t = l(t), e = l(e), t instanceof En && e instanceof En && (t.firestore === e.firestore && be(t._query, e._query) && t.converter === e.converter);
 }
 
 /**
@@ -4213,7 +4264,7 @@ function bn(t, e, ...n) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class Rn {
+ */ class Nn {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -4225,9 +4276,9 @@ function bn(t, e, ...n) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new Rn(Dt.fromBase64String(t));
+            return new Nn(xt.fromBase64String(t));
         } catch (t) {
-            throw new M(R, "Failed to construct data from Base64 string: " + t);
+            throw new U(P, "Failed to construct data from Base64 string: " + t);
         }
     }
     /**
@@ -4235,7 +4286,7 @@ function bn(t, e, ...n) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new Rn(Dt.fromUint8Array(t));
+        return new Nn(xt.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -4268,6 +4319,57 @@ function bn(t, e, ...n) {
     }
 }
 
+/**
+ * @license
+ * Copyright 2020 Google LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * A `FieldPath` refers to a field in a document. The path may consist of a
+ * single field name (referring to a top-level field in the document), or a
+ * list of field names (referring to a nested field in the document).
+ *
+ * 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 $n {
+    /**
+     * 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.
+     *
+     * @param fieldNames - A list of field names.
+     */
+    constructor(...t) {
+        for (let e = 0; e < t.length; ++e) if (0 === t[e].length) throw new U(P, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        this._internalPath = new nt(t);
+    }
+    /**
+     * Returns true if this `FieldPath` is equal to the provided one.
+     *
+     * @param other - The `FieldPath` to compare against.
+     * @returns true if this `FieldPath` is equal to the provided one.
+     */    isEqual(t) {
+        return this._internalPath.isEqual(t._internalPath);
+    }
+}
+
+/**
+ * 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 Dn() {
+    return new $n("__name__");
+}
+
 /**
  * @license
  * Copyright 2020 Google LLC
@@ -4287,7 +4389,7 @@ function bn(t, e, ...n) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class Pn {
+ */ class xn {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -4319,7 +4421,7 @@ function bn(t, e, ...n) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ class Vn {
+ */ class Sn {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -4327,8 +4429,8 @@ function bn(t, e, ...n) {
      * @param longitude - The longitude as number between -180 and 180.
      */
     constructor(t, e) {
-        if (!isFinite(t) || t < -90 || t > 90) throw new M(R, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(e) || e < -180 || e > 180) throw new M(R, "Longitude must be a number between -180 and 180, but was: " + e);
+        if (!isFinite(t) || t < -90 || t > 90) throw new U(P, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(e) || e < -180 || e > 180) throw new U(P, "Longitude must be a number between -180 and 180, but was: " + e);
         this._lat = t, this._long = e;
     }
     /**
@@ -4378,29 +4480,29 @@ function bn(t, e, ...n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const Nn = /^__.*__$/;
+ */ const Fn = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class $n {
+/** The result of parsing document data (e.g. for a setData call). */ class qn {
     constructor(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return null !== this.fieldMask ? new De(t, this.data, this.fieldMask, e, this.fieldTransforms) : new $e(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new xe(t, this.data, this.fieldMask, e, this.fieldTransforms) : new De(t, this.data, e, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class Dn {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class On {
     constructor(t, 
     // The fieldMask does not include document transforms.
     e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return new De(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new xe(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }
 }
 
-function xn(t) {
+function kn(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -4414,11 +4516,11 @@ function xn(t) {
         return !1;
 
       default:
-        throw v();
+        throw b();
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class Sn {
+/** A "context" object passed around while parsing user data. */ class Cn {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -4450,7 +4552,7 @@ function xn(t) {
         return this.settings.st;
     }
     /** Returns a new context with the specified settings overwritten. */    it(t) {
-        return new Sn(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.L, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+        return new Cn(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.L, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
     ot(t) {
         var e;
@@ -4477,7 +4579,7 @@ function xn(t) {
         });
     }
     lt(t) {
-        return Zn(t, this.settings.methodName, this.settings.ft || !1, this.path, this.settings.dt);
+        return sr(t, this.settings.methodName, this.settings.ft || !1, this.path, this.settings.dt);
     }
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */    contains(t) {
         return void 0 !== this.fieldMask.find((e => t.isPrefixOf(e))) || void 0 !== this.fieldTransforms.find((e => t.isPrefixOf(e.field)));
@@ -4489,52 +4591,52 @@ function xn(t) {
     }
     ct(t) {
         if (0 === t.length) throw this.lt("Document fields must not be empty");
-        if (xn(this.st) && Nn.test(t)) throw this.lt('Document fields cannot begin and end with "__"');
+        if (kn(this.st) && Fn.test(t)) throw this.lt('Document fields cannot begin and end with "__"');
     }
 }
 
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ class Fn {
+ */ class Ln {
     constructor(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.L = n || en(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.L = n || nn(t);
     }
     /** Creates a new top-level parse context. */    wt(t, e, n, r = !1) {
-        return new Sn({
+        return new Cn({
             st: t,
             methodName: e,
             dt: n,
-            path: et.emptyPath(),
+            path: nt.emptyPath(),
             ut: !1,
             ft: r
         }, this.databaseId, this.L, this.ignoreUndefinedProperties);
     }
 }
 
-function qn(t) {
-    const e = t._freezeSettings(), n = en(t._databaseId);
-    return new Fn(t._databaseId, !!e.ignoreUndefinedProperties, n);
+function Mn(t) {
+    const e = t._freezeSettings(), n = nn(t._databaseId);
+    return new Ln(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function On(t, e, n, r, s, i = {}) {
+/** Parse document data from a set() call. */ function Un(t, e, n, r, s, i = {}) {
     const o = t.wt(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, s);
-    Yn("Data must be an object, but it was:", o, r);
-    const u = Gn(r, o);
+    tr("Data must be an object, but it was:", o, r);
+    const u = Xn(r, o);
     let c, a;
-    if (i.merge) c = new Nt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
+    if (i.merge) c = new $t(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
         const t = [];
         for (const r of i.mergeFields) {
-            const s = Hn(e, r, n);
-            if (!o.contains(s)) throw new M(R, `Field '${s}' is specified in your field mask but missing from your input data.`);
-            tr(t, s) || t.push(s);
+            const s = er(e, r, n);
+            if (!o.contains(s)) throw new U(P, `Field '${s}' is specified in your field mask but missing from your input data.`);
+            ir(t, s) || t.push(s);
         }
-        c = new Nt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
+        c = new $t(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
     } else c = null, a = o.fieldTransforms;
-    return new $n(new Jt(u), c, a);
+    return new qn(new Xt(u), c, a);
 }
 
-class kn extends Pn {
+class jn extends xn {
     _toFieldTransform(t) {
         if (2 /* MergeSet */ !== t.st) throw 1 /* Update */ === t.st ? t.lt(`${this._methodName}() can only appear at the top level of your update data`) : t.lt(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
         // No transform to add for a delete, but we need to add it to our
@@ -4542,7 +4644,7 @@ class kn extends Pn {
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof kn;
+        return t instanceof jn;
     }
 }
 
@@ -4561,8 +4663,8 @@ class kn extends Pn {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function Cn(t, e, n) {
-    return new Sn({
+ */ function Bn(t, e, n) {
+    return new Cn({
         st: 3 /* Argument */ ,
         dt: e.settings.dt,
         methodName: t._methodName,
@@ -4570,23 +4672,23 @@ class kn extends Pn {
     }, e.databaseId, e.L, e.ignoreUndefinedProperties);
 }
 
-class Ln extends Pn {
+class Qn extends xn {
     _toFieldTransform(t) {
-        return new Pe(t.path, new Ie);
+        return new Ve(t.path, new Te);
     }
     isEqual(t) {
-        return t instanceof Ln;
+        return t instanceof Qn;
     }
 }
 
-class Mn extends Pn {
+class zn extends xn {
     constructor(t, e) {
         super(t), this.yt = e;
     }
     _toFieldTransform(t) {
-        const e = Cn(this, t, 
-        /*array=*/ !0), n = this.yt.map((t => Wn(t, e))), r = new Te(n);
-        return new Pe(t.path, r);
+        const e = Bn(this, t, 
+        /*array=*/ !0), n = this.yt.map((t => Jn(t, e))), r = new Ae(n);
+        return new Ve(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4594,14 +4696,14 @@ class Mn extends Pn {
     }
 }
 
-class Un extends Pn {
+class Wn extends xn {
     constructor(t, e) {
         super(t), this.yt = e;
     }
     _toFieldTransform(t) {
-        const e = Cn(this, t, 
-        /*array=*/ !0), n = this.yt.map((t => Wn(t, e))), r = new Ae(n);
-        return new Pe(t.path, r);
+        const e = Bn(this, t, 
+        /*array=*/ !0), n = this.yt.map((t => Jn(t, e))), r = new Re(n);
+        return new Ve(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4609,13 +4711,13 @@ class Un extends Pn {
     }
 }
 
-class jn extends Pn {
+class Gn extends xn {
     constructor(t, e) {
-        super(t), this._t = e;
+        super(t), this.gt = e;
     }
     _toFieldTransform(t) {
-        const e = new Re(t.L, be(t.L, this._t));
-        return new Pe(t.path, e);
+        const e = new Pe(t.L, Ee(t.L, this.gt));
+        return new Ve(t.path, e);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4623,50 +4725,50 @@ class jn extends Pn {
     }
 }
 
-/** Parse update data from an update() call. */ function Bn(t, e, n, r) {
+/** Parse update data from an update() call. */ function Kn(t, e, n, r) {
     const s = t.wt(1 /* Update */ , e, n);
-    Yn("Data must be an object, but it was:", s, r);
-    const i = [], o = Jt.empty();
-    It(r, ((t, r) => {
-        const u = Xn(e, t, n);
+    tr("Data must be an object, but it was:", s, r);
+    const i = [], o = Xt.empty();
+    Tt(r, ((t, r) => {
+        const u = rr(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = l(r);
         const c = s.at(u);
-        if (r instanceof kn) 
+        if (r instanceof jn) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = Wn(r, c);
+            const t = Jn(r, c);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
-    const u = new Nt(i);
-    return new Dn(o, u, s.fieldTransforms);
+    const u = new $t(i);
+    return new On(o, u, s.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function zn(t, e, n, r, s, i) {
-    const o = t.wt(1 /* Update */ , e, n), u = [ Hn(e, r, n) ], c = [ s ];
-    if (i.length % 2 != 0) throw new M(R, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
-    for (let t = 0; t < i.length; t += 2) u.push(Hn(e, i[t])), c.push(i[t + 1]);
-    const a = [], h = Jt.empty();
+/** Parse update data from a list of field/value arguments. */ function Yn(t, e, n, r, s, i) {
+    const o = t.wt(1 /* Update */ , e, n), u = [ er(e, r, n) ], c = [ s ];
+    if (i.length % 2 != 0) throw new U(P, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
+    for (let t = 0; t < i.length; t += 2) u.push(er(e, i[t])), c.push(i[t + 1]);
+    const a = [], h = Xt.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 (!tr(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!ir(a, u[t])) {
         const e = u[t];
         let n = c[t];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 n = l(n);
         const r = o.at(e);
-        if (n instanceof kn) 
+        if (n instanceof jn) 
         // Add it to the field mask, but don't add anything to updateData.
         a.push(e); else {
-            const t = Wn(n, r);
+            const t = Jn(n, r);
             null != t && (a.push(e), h.set(e, t));
         }
     }
-    const f = new Nt(a);
-    return new Dn(h, f, o.fieldTransforms);
+    const f = new $t(a);
+    return new On(h, f, o.fieldTransforms);
 }
 
 /**
@@ -4675,8 +4777,8 @@ class jn extends Pn {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function Qn(t, e, n, r = !1) {
-    return Wn(n, t.wt(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+ */ function Hn(t, e, n, r = !1) {
+    return Jn(n, t.wt(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -4687,12 +4789,12 @@ class jn extends Pn {
  * 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 Wn(t, e) {
-    if (Kn(
+ */ function Jn(t, e) {
+    if (Zn(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = l(t))) return Yn("Unsupported field value:", e, t), Gn(t, e);
-    if (t instanceof Pn) 
+    t = l(t))) return tr("Unsupported field value:", e, t), Xn(t, e);
+    if (t instanceof xn) 
     // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
     // (as doing so will overwrite the field directly prior to the transform
@@ -4704,7 +4806,7 @@ class jn extends Pn {
  */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!xn(e.st)) throw e.lt(`${t._methodName}() can only be used with update() and set()`);
+        if (!kn(e.st)) throw e.lt(`${t._methodName}() can only be used with update() and set()`);
         if (!e.path) throw e.lt(`${t._methodName}() is not currently supported inside arrays`);
         const n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
@@ -4734,7 +4836,7 @@ class jn extends Pn {
             const n = [];
             let r = 0;
             for (const s of t) {
-                let t = Wn(s, e.ht(r));
+                let t = Jn(s, e.ht(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4753,7 +4855,7 @@ class jn extends Pn {
         if (null === (t = l(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return be(e.L, t);
+        if ("number" == typeof t) return Ee(e.L, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4761,37 +4863,37 @@ class jn extends Pn {
             stringValue: t
         };
         if (t instanceof Date) {
-            const n = vt.fromDate(t);
+            const n = bt.fromDate(t);
             return {
-                timestampValue: ke(e.L, n)
+                timestampValue: Ce(e.L, n)
             };
         }
-        if (t instanceof vt) {
+        if (t instanceof bt) {
             // Firestore backend truncates precision down to microseconds. To ensure
             // offline mode works the same with regards to truncation, perform the
             // truncation immediately without waiting for the backend to do that.
-            const n = new vt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            const n = new bt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: ke(e.L, n)
+                timestampValue: Ce(e.L, n)
             };
         }
-        if (t instanceof Vn) return {
+        if (t instanceof Sn) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof Rn) return {
-            bytesValue: Ce(e.L, t._byteString)
+        if (t instanceof Nn) return {
+            bytesValue: Le(e.L, t._byteString)
         };
-        if (t instanceof pn) {
+        if (t instanceof bn) {
             const n = e.databaseId, r = t.firestore._databaseId;
             if (!r.isEqual(n)) throw e.lt(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${n.projectId}/${n.database}`);
             return {
-                referenceValue: Ue(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: je(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.lt(`Unsupported field value: ${ot(t)}`);
+        throw e.lt(`Unsupported field value: ${ut(t)}`);
     }
     /**
  * Checks whether an object looks like a JSON object that should be converted
@@ -4802,13 +4904,13 @@ class jn extends Pn {
  */ (t, e);
 }
 
-function Gn(t, e) {
+function Xn(t, e) {
     const n = {};
     return !function(t) {
         for (const e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
         return !0;
-    }(t) ? It(t, ((t, r) => {
-        const s = Wn(r, e.ot(t));
+    }(t) ? Tt(t, ((t, r) => {
+        const s = Jn(r, e.ot(t));
         null != s && (n[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -4820,35 +4922,35 @@ function Gn(t, e) {
     };
 }
 
-function Kn(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof vt || t instanceof Vn || t instanceof Rn || t instanceof pn || t instanceof Pn);
+function Zn(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof bt || t instanceof Sn || t instanceof Nn || t instanceof bn || t instanceof xn);
 }
 
-function Yn(t, e, n) {
-    if (!Kn(n) || !function(t) {
+function tr(t, e, n) {
+    if (!Zn(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
-        const r = ot(n);
+        const r = ut(n);
         throw "an object" === r ? e.lt(t + " a custom object") : e.lt(t + " " + r);
     }
 }
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function Hn(t, e, n) {
+ */ function er(t, e, n) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    e = l(e)) instanceof Tn) return e._internalPath;
-    if ("string" == typeof e) return Xn(t, e);
-    throw Zn("Field path arguments must be of type string or ", t, 
+    e = l(e)) instanceof $n) return e._internalPath;
+    if ("string" == typeof e) return rr(t, e);
+    throw sr("Field path arguments must be of type string or ", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
 }
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ const Jn = new RegExp("[~\\*/\\[\\]]");
+ */ const nr = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4858,29 +4960,29 @@ function Yn(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function Xn(t, e, n) {
-    if (e.search(Jn) >= 0) throw Zn(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function rr(t, e, n) {
+    if (e.search(nr) >= 0) throw sr(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return new Tn(...e.split("."))._internalPath;
+        return new $n(...e.split("."))._internalPath;
     } catch (r) {
-        throw Zn(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw sr(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function Zn(t, e, n, r, s) {
+function sr(t, e, n, r, s) {
     const i = r && !r.isEmpty(), o = void 0 !== s;
     let u = `Function ${e}() called with invalid data`;
     n && (u += " (via `toFirestore()`)"), u += ". ";
     let c = "";
     return (i || o) && (c += " (found", i && (c += ` in field ${r}`), o && (c += ` in document ${s}`), 
-    c += ")"), new M(R, u + t + c);
+    c += ")"), new U(P, u + t + c);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function tr(t, e) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function ir(t, e) {
     return t.some((t => t.isEqual(e)));
 }
 
@@ -4908,7 +5010,7 @@ function Zn(t, e, n, r, s) {
  * For a `DocumentSnapshot` that points to a non-existing document, any data
  * access will return 'undefined'. You can use the `exists()` method to
  * explicitly verify a document's existence.
- */ class er {
+ */ class or {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4924,7 +5026,7 @@ function Zn(t, e, n, r, s) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new pn(this._firestore, this._converter, this._key);
+        return new bn(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -4944,7 +5046,7 @@ function Zn(t, e, n, r, s) {
             if (this._converter) {
                 // We only want to use the converter and create a new DocumentSnapshot
                 // if a converter has been provided.
-                const t = new nr(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new ur(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4964,7 +5066,7 @@ function Zn(t, e, n, r, s) {
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     get(t) {
         if (this._document) {
-            const e = this._document.data.field(ir("DocumentSnapshot.get", t));
+            const e = this._document.data.field(hr("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }
@@ -4980,7 +5082,7 @@ function Zn(t, e, n, r, s) {
  * `DocumentSnapshot`. Since query results contain only existing documents, the
  * `exists` property will always be true and `data()` will never return
  * 'undefined'.
- */ class nr extends er {
+ */ class ur extends or {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -4998,7 +5100,7 @@ function Zn(t, e, n, r, s) {
  * array via the `docs` property or enumerated using the `forEach` method. The
  * number of documents can be determined via the `empty` and `size`
  * properties.
- */ class rr {
+ */ class cr {
     /** @hideconstructor */
     constructor(t, e) {
         this._docs = e, this.query = t;
@@ -5029,14 +5131,14 @@ function Zn(t, e, n, r, s) {
  * @param left - A snapshot to compare.
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
- */ function sr(t, e) {
-    return t = l(t), e = l(e), t instanceof er && e instanceof er ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof rr && e instanceof rr && (In(t.query, e.query) && gt(t.docs, e.docs, sr));
+ */ function ar(t, e) {
+    return t = l(t), e = l(e), t instanceof or && e instanceof or ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof cr && e instanceof cr && (Vn(t.query, e.query) && vt(t.docs, e.docs, ar));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function ir(t, e) {
-    return "string" == typeof e ? Xn(t, e) : e instanceof Tn ? e._internalPath : e._delegate._internalPath;
+ */ function hr(t, e) {
+    return "string" == typeof e ? rr(t, e) : e instanceof $n ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -5063,7 +5165,7 @@ function Zn(t, e, n, r, s) {
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
  */
-class or {}
+class lr {}
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -5073,40 +5175,40 @@ class or {}
  * @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 ur(t, ...e) {
+ */ function fr(t, ...e) {
     for (const n of e) t = n._apply(t);
     return t;
 }
 
-class cr extends or {
+class dr extends lr {
     constructor(t, e, n) {
-        super(), this.gt = t, this.vt = e, this.bt = n, this.type = "where";
+        super(), this._t = t, this.vt = e, this.bt = n, this.type = "where";
     }
     _apply(t) {
-        const e = qn(t.firestore), n = function(t, e, n, r, s, i, o) {
+        const e = Mn(t.firestore), n = function(t, e, n, r, s, i, o) {
             let u;
             if (s.isKeyField()) {
-                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new M(R, `Invalid Query. You can't perform '${i}' queries on documentId().`);
+                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new U(P, `Invalid Query. You can't perform '${i}' queries on documentId().`);
                 if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
-                    Ir(o, i);
+                    Vr(o, i);
                     const e = [];
-                    for (const n of o) e.push(Er(r, t, n));
+                    for (const n of o) e.push(Pr(r, t, n));
                     u = {
                         arrayValue: {
                             values: e
                         }
                     };
-                } else u = Er(r, t, o);
-            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || Ir(o, i), 
-            u = Qn(n, e, o, 
+                } else u = Pr(r, t, o);
+            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || Vr(o, i), 
+            u = Hn(n, e, o, 
             /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
-            const c = ee.create(s, i, u);
+            const c = ne.create(s, i, u);
             return function(t, e) {
                 if (e.q()) {
-                    const n = pe(t);
-                    if (null !== n && !n.isEqual(e.field)) throw new M(R, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${n.toString()}' and '${e.field.toString()}'`);
-                    const r = me(t);
-                    null !== r && Tr(t, e.field, r);
+                    const n = ye(t);
+                    if (null !== n && !n.isEqual(e.field)) throw new U(P, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${n.toString()}' and '${e.field.toString()}'`);
+                    const r = pe(t);
+                    null !== r && Nr(t, e.field, r);
                 }
                 const n = function(t, e) {
                     for (const n of t.filters) if (e.indexOf(n.op) >= 0) return n.op;
@@ -5147,12 +5249,12 @@ class cr extends or {
                 }(e.op));
                 if (null !== n) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
-                throw n === e.op ? new M(R, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new M(R, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
+                throw n === e.op ? new U(P, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new U(P, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
             }(t, c), c;
-        }(t._query, "where", e, t.firestore._databaseId, this.gt, this.vt, this.bt);
-        return new yn(t.firestore, t.converter, function(t, e) {
+        }(t._query, "where", e, t.firestore._databaseId, this._t, this.vt, this.bt);
+        return new En(t.firestore, t.converter, function(t, e) {
             const n = t.filters.concat([ e ]);
-            return new we(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+            return new me(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }
 }
@@ -5167,25 +5269,25 @@ class cr extends or {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function ar(t, e, n) {
-    const r = e, s = ir("where", t);
-    return new cr(s, r, n);
+ */ function wr(t, e, n) {
+    const r = e, s = hr("where", t);
+    return new dr(s, r, n);
 }
 
-class hr extends or {
+class mr extends lr {
     constructor(t, e) {
-        super(), this.gt = t, this.Et = e, this.type = "orderBy";
+        super(), this._t = t, this.Et = e, this.type = "orderBy";
     }
     _apply(t) {
         const e = function(t, e, n) {
-            if (null !== t.startAt) throw new M(R, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
-            if (null !== t.endAt) throw new M(R, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            const r = new le(e, n);
+            if (null !== t.startAt) throw new U(P, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new U(P, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            const r = new fe(e, n);
             return function(t, e) {
-                if (null === me(t)) {
+                if (null === pe(t)) {
                     // This is the first order by. It must match any inequality.
-                    const n = pe(t);
-                    null !== n && Tr(t, n, e.field);
+                    const n = ye(t);
+                    null !== n && Nr(t, n, e.field);
                 }
             }(t, r), r;
         }
@@ -5199,11 +5301,11 @@ class hr extends or {
  * Will throw if the document does not contain all fields of the order by
  * of the query or if any of the fields in the order by are an uncommitted
  * server timestamp.
- */ (t._query, this.gt, this.Et);
-        return new yn(t.firestore, t.converter, function(t, e) {
+ */ (t._query, this._t, this.Et);
+        return new En(t.firestore, t.converter, function(t, e) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             const n = t.explicitOrderBy.concat([ e ]);
-            return new we(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new me(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }
 }
@@ -5216,18 +5318,18 @@ class hr extends or {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function lr(t, e = "asc") {
-    const n = e, r = ir("orderBy", t);
-    return new hr(r, n);
+ */ function pr(t, e = "asc") {
+    const n = e, r = hr("orderBy", t);
+    return new mr(r, n);
 }
 
-class fr extends or {
+class yr extends lr {
     constructor(t, e, n) {
         super(), this.type = t, this.It = e, this.Tt = n;
     }
     _apply(t) {
-        return new yn(t.firestore, t.converter, function(t, e, n) {
-            return new we(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        return new En(t.firestore, t.converter, function(t, e, n) {
+            return new me(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
         }(t._query, this.It, this.Tt));
     }
 }
@@ -5237,8 +5339,8 @@ class fr extends or {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function dr(t) {
-    return ct("limit", t), new fr("limit", t, "F" /* First */);
+ */ function gr(t) {
+    return at("limit", t), new yr("limit", t, "F" /* First */);
 }
 
 /**
@@ -5249,56 +5351,56 @@ class fr extends or {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function wr(t) {
-    return ct("limitToLast", t), new fr("limitToLast", t, "L" /* Last */);
+ */ function _r(t) {
+    return at("limitToLast", t), new yr("limitToLast", t, "L" /* Last */);
 }
 
-class mr extends or {
+class vr extends lr {
     constructor(t, e, n) {
         super(), this.type = t, this.At = e, this.Rt = n;
     }
     _apply(t) {
-        const e = br(t, this.type, this.At, this.Rt);
-        return new yn(t.firestore, t.converter, function(t, e) {
-            return new we(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+        const e = Rr(t, this.type, this.At, this.Rt);
+        return new En(t.firestore, t.converter, function(t, e) {
+            return new me(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
 }
 
-function pr(...t) {
-    return new mr("startAt", t, 
+function br(...t) {
+    return new vr("startAt", t, 
     /*inclusive=*/ !0);
 }
 
-function yr(...t) {
-    return new mr("startAfter", t, 
+function Er(...t) {
+    return new vr("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
-class _r extends or {
+class Ir extends lr {
     constructor(t, e, n) {
         super(), this.type = t, this.At = e, this.Rt = n;
     }
     _apply(t) {
-        const e = br(t, this.type, this.At, this.Rt);
-        return new yn(t.firestore, t.converter, function(t, e) {
-            return new we(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+        const e = Rr(t, this.type, this.At, this.Rt);
+        return new En(t.firestore, t.converter, function(t, e) {
+            return new me(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
 }
 
-function gr(...t) {
-    return new _r("endBefore", t, 
+function Tr(...t) {
+    return new Ir("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function vr(...t) {
-    return new _r("endAt", t, /*inclusive=*/ !0);
+function Ar(...t) {
+    return new Ir("endAt", t, /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function br(t, e, n, r) {
-    if (n[0] = l(n[0]), n[0] instanceof er) return function(t, e, n, r, s) {
-        if (!r) throw new M(V, `Can't use a DocumentSnapshot that doesn't exist for ${n}().`);
+/** Helper function to create a bound from a document or fields */ function Rr(t, e, n, r) {
+    if (n[0] = l(n[0]), n[0] instanceof or) return function(t, e, n, r, s) {
+        if (!r) throw new U(N, `Can't use a DocumentSnapshot that doesn't exist for ${n}().`);
         const i = [];
         // Because people expect to continue/end a query at the exact document
         // provided, we need to use the implicit sort order rather than the explicit
@@ -5307,42 +5409,42 @@ function vr(...t) {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-                for (const n of _e(t)) if (n.field.isKeyField()) i.push(Qt(e, r.key)); else {
+                for (const n of _e(t)) if (n.field.isKeyField()) i.push(Wt(e, r.key)); else {
             const t = r.data.field(n.field);
-            if (Ot(t)) throw new M(R, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+            if (kt(t)) throw new U(P, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
             if (null === t) {
                 const t = n.field.canonicalString();
-                throw new M(R, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
+                throw new U(P, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
             }
             i.push(t);
         }
-        return new he(i, s);
+        return new le(i, s);
     }
     /**
  * Converts a list of field values to a `Bound` for the given query.
  */ (t._query, t.firestore._databaseId, e, n[0]._document, r);
     {
-        const s = qn(t.firestore);
+        const s = Mn(t.firestore);
         return function(t, e, n, r, s, i) {
             // Use explicit order by's because it has to match the query the user made
             const o = t.explicitOrderBy;
-            if (s.length > o.length) throw new M(R, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
+            if (s.length > o.length) throw new U(P, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
             const u = [];
             for (let i = 0; i < s.length; i++) {
                 const c = s[i];
                 if (o[i].field.isKeyField()) {
-                    if ("string" != typeof c) throw new M(R, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
-                    if (!ye(t) && -1 !== c.indexOf("/")) throw new M(R, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
-                    const n = t.path.child(Z.fromString(c));
-                    if (!nt.isDocumentKey(n)) throw new M(R, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
-                    const s = new nt(n);
-                    u.push(Qt(e, s));
+                    if ("string" != typeof c) throw new U(P, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
+                    if (!ge(t) && -1 !== c.indexOf("/")) throw new U(P, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
+                    const n = t.path.child(tt.fromString(c));
+                    if (!rt.isDocumentKey(n)) throw new U(P, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
+                    const s = new rt(n);
+                    u.push(Wt(e, s));
                 } else {
-                    const t = Qn(n, r, c);
+                    const t = Hn(n, r, c);
                     u.push(t);
                 }
             }
-            return new he(u, i);
+            return new le(u, i);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -5352,28 +5454,28 @@ function vr(...t) {
     }
 }
 
-function Er(t, e, n) {
+function Pr(t, e, n) {
     if ("string" == typeof (n = l(n))) {
-        if ("" === n) throw new M(R, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!ye(e) && -1 !== n.indexOf("/")) throw new M(R, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
-        const r = e.path.child(Z.fromString(n));
-        if (!nt.isDocumentKey(r)) throw new M(R, `Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
-        return Qt(t, new nt(r));
+        if ("" === n) throw new U(P, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!ge(e) && -1 !== n.indexOf("/")) throw new U(P, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
+        const r = e.path.child(tt.fromString(n));
+        if (!rt.isDocumentKey(r)) throw new U(P, `Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
+        return Wt(t, new rt(r));
     }
-    if (n instanceof pn) return Qt(t, n._key);
-    throw new M(R, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${ot(n)}.`);
+    if (n instanceof bn) return Wt(t, n._key);
+    throw new U(P, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${ut(n)}.`);
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function Ir(t, e) {
-    if (!Array.isArray(t) || 0 === t.length) throw new M(R, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);
-    if (t.length > 10) throw new M(R, `Invalid Query. '${e.toString()}' filters support a maximum of 10 elements in the value array.`);
+ */ function Vr(t, e) {
+    if (!Array.isArray(t) || 0 === t.length) throw new U(P, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);
+    if (t.length > 10) throw new U(P, `Invalid Query. '${e.toString()}' filters support a maximum of 10 elements in the value array.`);
 }
 
-function Tr(t, e, n) {
-    if (!n.isEqual(e)) throw new M(R, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${e.toString()}' and so you must also use '${e.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${n.toString()}' instead.`);
+function Nr(t, e, n) {
+    if (!n.isEqual(e)) throw new U(P, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${e.toString()}' and so you must also use '${e.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${n.toString()}' instead.`);
 }
 
 /**
@@ -5423,7 +5525,7 @@ function Tr(t, e, n) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function Ar(t, e, n) {
+function $r(t, e, n) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -5432,9 +5534,9 @@ function Ar(t, e, n) {
     r;
 }
 
-class Rr extends class {
+class Dr extends class {
     convertValue(t, e = "none") {
-        switch (Mt(t)) {
+        switch (Ut(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -5442,7 +5544,7 @@ class Rr extends class {
             return t.booleanValue;
 
           case 2 /* NumberValue */ :
-            return Ft(t.integerValue || t.doubleValue);
+            return qt(t.integerValue || t.doubleValue);
 
           case 3 /* TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -5454,7 +5556,7 @@ class Rr extends class {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(qt(t.bytesValue));
+            return this.convertBytes(Ot(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -5469,17 +5571,17 @@ class Rr extends class {
             return this.convertObject(t.mapValue, e);
 
           default:
-            throw v();
+            throw b();
         }
     }
     convertObject(t, e) {
         const n = {};
-        return It(t.fields, ((t, r) => {
+        return Tt(t.fields, ((t, r) => {
             n[t] = this.convertValue(r, e);
         })), n;
     }
     convertGeoPoint(t) {
-        return new Vn(Ft(t.latitude), Ft(t.longitude));
+        return new Sn(qt(t.latitude), qt(t.longitude));
     }
     convertArray(t, e) {
         return (t.values || []).map((t => this.convertValue(t, e)));
@@ -5487,27 +5589,27 @@ class Rr extends class {
     convertServerTimestamp(t, e) {
         switch (e) {
           case "previous":
-            const n = kt(t);
+            const n = Ct(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Ct(t));
+            return this.convertTimestamp(Lt(t));
 
           default:
             return null;
         }
     }
     convertTimestamp(t) {
-        const e = St(t);
-        return new vt(e.seconds, e.nanos);
+        const e = Ft(t);
+        return new bt(e.seconds, e.nanos);
     }
     convertDocumentKey(t, e) {
-        const n = Z.fromString(t);
-        b(tn(n));
-        const r = new J(n.get(1), n.get(3)), s = new nt(n.popFirst(5));
+        const n = tt.fromString(t);
+        E(en(n));
+        const r = new X(n.get(1), n.get(3)), s = new rt(n.popFirst(5));
         return r.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
-        y(`Document ${s} contains a document reference within a different database (${r.projectId}/${r.database}) which is not supported. It will be treated as a reference in the current database (${e.projectId}/${e.database}) instead.`), 
+        g(`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 (${e.projectId}/${e.database}) instead.`), 
         s;
     }
 } {
@@ -5515,11 +5617,11 @@ class Rr extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new Rn(t);
+        return new Nn(t);
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new pn(this.firestore, /* converter= */ null, e);
+        return new bn(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -5535,12 +5637,12 @@ class Rr extends class {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function Pr(t) {
-    const e = an((t = ut(t, pn)).firestore), n = new Rr(t.firestore);
-    return on(e, [ t._key ]).then((e => {
-        b(1 === e.length);
+ */ function xr(t) {
+    const e = ln((t = ct(t, bn)).firestore), n = new Dr(t.firestore);
+    return un(e, [ t._key ]).then((e => {
+        E(1 === e.length);
         const r = e[0];
-        return new er(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new or(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5555,33 +5657,33 @@ class Rr 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 Sr(t) {
     !function(t) {
-        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new M(O, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = ut(t, yn))._query);
-    const e = an(t.firestore), n = new Rr(t.firestore);
-    return un(e, t._query).then((e => {
-        const r = e.map((e => new nr(t.firestore, n, e.key, e, t.converter)));
+        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new U(k, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = ct(t, En))._query);
+    const e = ln(t.firestore), n = new Dr(t.firestore);
+    return cn(e, t._query).then((e => {
+        const r = e.map((e => new ur(t.firestore, n, e.key, e, t.converter)));
         return "L" /* Last */ === t._query.limitType && 
         // Limit to last queries reverse the orderBy constraint that was
         // specified by the user. As such, we need to reverse the order of the
         // results to return the documents in the expected order.
-        r.reverse(), new rr(t, r);
+        r.reverse(), new cr(t, r);
     }));
 }
 
-function Nr(t, e, n) {
-    const r = Ar((t = ut(t, pn)).converter, e, n), s = On(qn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return sn(an(t.firestore), [ s.toMutation(t._key, Ve.none()) ]);
+function Fr(t, e, n) {
+    const r = $r((t = ct(t, bn)).converter, e, n), s = Un(Mn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return on(ln(t.firestore), [ s.toMutation(t._key, Ne.none()) ]);
 }
 
-function $r(t, e, n, ...r) {
-    const s = qn((t = ut(t, pn)).firestore);
+function qr(t, e, n, ...r) {
+    const s = Mn((t = ct(t, bn)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    i = "string" == typeof (e = l(e)) || e instanceof Tn ? zn(s, "updateDoc", t._key, e, n, r) : Bn(s, "updateDoc", t._key, e);
-    return sn(an(t.firestore), [ i.toMutation(t._key, Ve.exists(!0)) ]);
+    i = "string" == typeof (e = l(e)) || e instanceof $n ? Yn(s, "updateDoc", t._key, e, n, r) : Kn(s, "updateDoc", t._key, e);
+    return on(ln(t.firestore), [ i.toMutation(t._key, Ne.exists(!0)) ]);
 }
 
 /**
@@ -5595,8 +5697,8 @@ function $r(t, e, n, ...r) {
  * @param reference - A reference to the document to delete.
  * @returns A `Promise` resolved once the document has been successfully
  * deleted from the backend.
- */ function Dr(t) {
-    return sn(an((t = ut(t, pn)).firestore), [ new xe(t._key, Ve.none()) ]);
+ */ function Or(t) {
+    return on(ln((t = ct(t, bn)).firestore), [ new Se(t._key, Ne.none()) ]);
 }
 
 /**
@@ -5613,9 +5715,58 @@ function $r(t, e, n, ...r) {
  * @throws Error - If the provided input is not a valid Firestore document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function xr(t, e) {
-    const n = bn(t = ut(t, _n)), r = Ar(t.converter, e), s = On(qn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return sn(an(t.firestore), [ s.toMutation(n._key, Ve.exists(!1)) ]).then((() => n));
+ */ function kr(t, e) {
+    const n = Rn(t = ct(t, In)), r = $r(t.converter, e), s = Un(Mn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return on(ln(t.firestore), [ s.toMutation(n._key, Ne.exists(!1)) ]).then((() => n));
+}
+
+/**
+ * @license
+ * Copyright 2022 Google LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * Calculates the number of documents in the result set of the given query,
+ * without actually downloading the documents.
+ *
+ * Using this function to count the documents is efficient because only the
+ * final count, not the documents' data, is downloaded. This function can even
+ * count the documents if the result set would be prohibitively large to
+ * download entirely (e.g. thousands of documents).
+ *
+ * @param query - The query whose result set size to calculate.
+ * @returns A Promise that will be resolved with the count; the count can be
+ * retrieved from `snapshot.data().count`, where `snapshot` is the
+ * `AggregateQuerySnapshot` to which the returned Promise resolves.
+ */ function Cr(t) {
+    const e = ct(t.firestore, dn), n = ln(e), r = new Dr(e);
+    return new vn(t, n, r).run();
+}
+
+/**
+ * Compares two `AggregateQuerySnapshot` instances for equality.
+ *
+ * Two `AggregateQuerySnapshot` instances are considered "equal" if they have
+ * underlying queries that compare equal, and the same data.
+ *
+ * @param left - The first `AggregateQuerySnapshot` to compare.
+ * @param right - The second `AggregateQuerySnapshot` to compare.
+ *
+ * @returns `true` if the objects are "equal", as defined above, or `false`
+ * otherwise.
+ */ function Lr(t, e) {
+    return Vn(t.query, e.query) && f(t.data(), e.data());
 }
 
 /**
@@ -5637,15 +5788,15 @@ function $r(t, e, n, ...r) {
 /**
  * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or
  * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.
- */ function Sr() {
-    return new kn("deleteField");
+ */ function Mr() {
+    return new jn("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 Fr() {
-    return new Ln("serverTimestamp");
+ */ function Ur() {
+    return new Qn("serverTimestamp");
 }
 
 /**
@@ -5659,10 +5810,10 @@ function $r(t, e, n, ...r) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function qr(...t) {
+ */ function jr(...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 Mn("arrayUnion", t);
+    return new zn("arrayUnion", t);
 }
 
 /**
@@ -5675,10 +5826,10 @@ function $r(t, e, n, ...r) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Or(...t) {
+ */ function Br(...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 Un("arrayRemove", t);
+    return new Wn("arrayRemove", t);
 }
 
 /**
@@ -5699,8 +5850,8 @@ function $r(t, e, n, ...r) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function kr(t) {
-    return new jn("increment", t);
+ */ function Qr(t) {
+    return new Gn("increment", t);
 }
 
 /**
@@ -5726,25 +5877,25 @@ function $r(t, e, n, ...r) {
  * provides methods for adding writes to the write batch. None of the writes
  * will be committed (or visible locally) until {@link WriteBatch.commit} is
  * called.
- */ class Cr {
+ */ class zr {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = qn(t);
+        this._dataReader = Mn(t);
     }
     set(t, e, n) {
         this._verifyNotCommitted();
-        const r = Lr(t, this._firestore), s = Ar(r.converter, e, n), i = On(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, n);
-        return this._mutations.push(i.toMutation(r._key, Ve.none())), this;
+        const r = Wr(t, this._firestore), s = $r(r.converter, e, n), i = Un(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, n);
+        return this._mutations.push(i.toMutation(r._key, Ne.none())), this;
     }
     update(t, e, n, ...r) {
         this._verifyNotCommitted();
-        const s = Lr(t, this._firestore);
+        const s = Wr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (e = l(e)) || e instanceof Tn ? zn(this._dataReader, "WriteBatch.update", s._key, e, n, r) : Bn(this._dataReader, "WriteBatch.update", s._key, e), 
-        this._mutations.push(i.toMutation(s._key, Ve.exists(!0))), this;
+        return i = "string" == typeof (e = l(e)) || e instanceof $n ? Yn(this._dataReader, "WriteBatch.update", s._key, e, n, r) : Kn(this._dataReader, "WriteBatch.update", s._key, e), 
+        this._mutations.push(i.toMutation(s._key, Ne.exists(!0))), this;
     }
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -5753,8 +5904,8 @@ function $r(t, e, n, ...r) {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const e = Lr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new xe(e._key, Ve.none())), this;
+        const e = Wr(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Se(e._key, Ne.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5771,12 +5922,12 @@ function $r(t, e, n, ...r) {
         return this._verifyNotCommitted(), this._committed = !0, this._mutations.length > 0 ? this._commitHandler(this._mutations) : Promise.resolve();
     }
     _verifyNotCommitted() {
-        if (this._committed) throw new M(S, "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 Lr(t, e) {
-    if ((t = l(t)).firestore !== e) throw new M(R, "Provided document reference is from a different Firestore instance.");
+function Wr(t, e) {
+    if ((t = l(t)).firestore !== e) throw new U(P, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -5792,9 +5943,9 @@ function Lr(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Mr(t) {
-    const e = an(t = ut(t, ln));
-    return new Cr(t, (t => sn(e, t)));
+ */ function Gr(t) {
+    const e = ln(t = ct(t, dn));
+    return new zr(t, (t => on(e, t)));
 }
 
 /**
@@ -5816,7 +5967,7 @@ function Lr(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ class Ur {
+ */ class Kr {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5835,8 +5986,8 @@ function Lr(t, e) {
         this.writtenDocs = new Set;
     }
     async lookup(t) {
-        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new M(R, "Firestore transactions require all reads to be executed before all writes.");
-        const e = await on(this.datastore, t);
+        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(P, "Firestore transactions require all reads to be executed before all writes.");
+        const e = await un(this.datastore, t);
         return e.forEach((t => this.recordVersion(t))), e;
     }
     set(t, e) {
@@ -5851,7 +6002,7 @@ function Lr(t, e) {
         this.writtenDocs.add(t.toString());
     }
     delete(t) {
-        this.write(new xe(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Se(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }
     async commit() {
         if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
@@ -5863,22 +6014,22 @@ function Lr(t, e) {
         // For each document that was read but not written to, we want to perform
         // a `verify` operation.
         t.forEach(((t, e) => {
-            const n = nt.fromPath(e);
-            this.mutations.push(new Se(n, this.precondition(n)));
-        })), await sn(this.datastore, this.mutations), this.committed = !0;
+            const n = rt.fromPath(e);
+            this.mutations.push(new Fe(n, this.precondition(n)));
+        })), await on(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let e;
         if (t.isFoundDocument()) e = t.version; else {
-            if (!t.isNoDocument()) throw v();
+            if (!t.isNoDocument()) throw b();
             // Represent a deleted doc using SnapshotVersion.min().
-            e = bt.min();
+            e = Et.min();
         }
         const n = this.readVersions.get(t.key.toString());
         if (n) {
             if (!e.isEqual(n)) 
             // This transaction will fail no matter what.
-            throw new M(F, "Document version changed between two reads.");
+            throw new U(q, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }
     /**
@@ -5886,7 +6037,7 @@ function Lr(t, e) {
      * as a precondition, or no precondition if it was not read.
      */    precondition(t) {
         const e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(bt.min()) ? Ve.exists(!1) : Ve.updateTime(e) : Ve.none();
+        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(Et.min()) ? Ne.exists(!1) : Ne.updateTime(e) : Ne.none();
     }
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5895,7 +6046,7 @@ function Lr(t, e) {
         // The first time a document is written, we want to take into account the
         // read time and existence
                 if (!this.writtenDocs.has(t.toString()) && e) {
-            if (e.isEqual(bt.min())) 
+            if (e.isEqual(Et.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
@@ -5905,13 +6056,13 @@ function Lr(t, e) {
             // express that to the backend, we have to validate locally.
             // Note: this can change once we can send separate verify writes in the
             // transaction.
-            throw new M(R, "Can't update a document that doesn't exist.");
+            throw new U(P, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return Ve.updateTime(e);
+                        return Ne.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-        return Ve.exists(!0);
+        return Ne.exists(!0);
     }
     write(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
@@ -5934,7 +6085,7 @@ function Lr(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const jr = {
+ */ const Yr = {
     maxAttempts: 5
 };
 
@@ -5958,17 +6109,17 @@ function Lr(t, e) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class Br {
+class Hr {
     constructor(t, e, n, r, s) {
         this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
-        this.deferred = s, this.Pt = n.maxAttempts, this.Vt = new nn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.deferred = s, this.Pt = n.maxAttempts, this.Vt = new rn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
         this.Pt -= 1, this.Nt();
     }
     Nt() {
         this.Vt.J((async () => {
-            const t = new Ur(this.datastore), e = this.$t(t);
+            const t = new Kr(this.datastore), e = this.$t(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
@@ -5983,7 +6134,7 @@ class Br {
     $t(t) {
         try {
             const e = this.updateFunction(t);
-            return !at(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !ht(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
             null);
         } catch (t) {
             // Do not retry errors thrown by user provided updateFunction.
@@ -6009,31 +6160,31 @@ class Br {
             function(t) {
                 switch (t) {
                   default:
-                    return v();
+                    return b();
 
-                  case T:
                   case A:
-                  case P:
-                  case x:
-                  case k:
+                  case R:
+                  case V:
+                  case S:
                   case C:
+                  case L:
  // Unauthenticated means something went wrong with our token and we need
                     // to retry with new credentials which will happen automatically.
-                                      case D:
+                                      case x:
                     return !1;
 
-                  case R:
-                  case V:
+                  case P:
                   case N:
                   case $:
-                  case S:
+                  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 q:
+                                      case q:
                   case O:
-                  case L:
+                  case k:
+                  case M:
                     return !0;
                 }
             }(e);
@@ -6058,7 +6209,7 @@ class Br {
  * 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 zr() {
+/** The Platform's 'document' implementation or null if not available. */ function Jr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -6090,10 +6241,10 @@ class Br {
  * 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 Qr {
+ */ class Xr {
     constructor(t, e, n, r, s) {
         this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = r, this.removalCallback = s, 
-        this.deferred = new U, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
+        this.deferred = new j, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
         // It's normal for the deferred promise to be canceled (due to cancellation)
         // and so we attach a dummy catch callback to avoid
         // 'UnhandledPromiseRejectionWarning' log spam.
@@ -6113,7 +6264,7 @@ class Br {
      *   PORTING NOTE: This exists to prevent making removeDelayedOperation() and
      *   the DelayedOperation class public.
      */    static createAndSchedule(t, e, n, r, s) {
-        const i = Date.now() + n, o = new Qr(t, e, i, r, s);
+        const i = Date.now() + n, o = new Xr(t, e, i, r, s);
         return o.start(n), o;
     }
     /**
@@ -6135,7 +6286,7 @@ class Br {
      * 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 M(T, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new U(A, "Operation cancelled" + (t ? ": " + t : ""))));
     }
     handleDelayElapsed() {
         this.asyncQueue.enqueueAndForget((() => null !== this.timerHandle ? (this.clearTimeout(), 
@@ -6162,7 +6313,7 @@ class Br {
  * 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 Wr {
+ */ class Zr {
     constructor() {
         // The last promise in the queue.
         this.St = Promise.resolve(), 
@@ -6185,15 +6336,15 @@ class Br {
         // List of TimerIds to fast-forward delays for.
         this.Mt = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.Vt = new nn(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.Vt = new rn(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.Ut = () => {
-            const t = zr();
-            t && p("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.Vt.Z();
+            const t = Jr();
+            t && y("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.Vt.Z();
         };
-        const t = zr();
+        const t = Jr();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ut);
     }
     get isShuttingDown() {
@@ -6214,7 +6365,7 @@ class Br {
     enterRestrictedMode(t) {
         if (!this.qt) {
             this.qt = !0, this.Lt = t || !1;
-            const e = zr();
+            const e = Jr();
             e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ut);
         }
     }
@@ -6225,17 +6376,17 @@ class Br {
         // 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 e = new U;
+                const e = new j;
         return this.Bt((() => this.qt && this.Lt ? Promise.resolve() : (t().then(e.resolve, e.reject), 
         e.promise))).then((() => e.promise));
     }
     enqueueRetryable(t) {
-        this.enqueueAndForget((() => (this.Ft.push(t), this.zt())));
+        this.enqueueAndForget((() => (this.Ft.push(t), this.Qt())));
     }
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
-     */    async zt() {
+     */    async Qt() {
         if (0 !== this.Ft.length) {
             try {
                 await this.Ft[0](), this.Ft.shift(), this.Vt.reset();
@@ -6280,7 +6431,7 @@ class Br {
  * limitations under the License.
  */ (t)) throw t;
  // Failure will be handled by AsyncQueue
-                                p("AsyncQueue", "Operation failed with retryable error: " + t);
+                                y("AsyncQueue", "Operation failed with retryable error: " + t);
             }
             this.Ft.length > 0 && 
             // If there are additional operations, we re-schedule `retryNextOp()`.
@@ -6293,7 +6444,7 @@ class Br {
             // Since `backoffAndRun()` cancels an existing backoff and schedules a
             // new backoff on every call, there is only ever a single additional
             // operation in the queue.
-            this.Vt.J((() => this.zt()));
+            this.Vt.J((() => this.Qt()));
         }
     }
     Bt(t) {
@@ -6338,7 +6489,7 @@ class Br {
             // 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 y("INTERNAL UNHANDLED ERROR: ", e), t;
+            throw g("INTERNAL UNHANDLED ERROR: ", e), t;
         })).then((t => (this.Ct = !1, t))))));
         return this.St = e, e;
     }
@@ -6346,11 +6497,11 @@ class Br {
         this.jt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Mt.indexOf(t) > -1 && (e = 0);
-        const r = Qr.createAndSchedule(this, t, e, n, (t => this.Qt(t)));
+        const r = Xr.createAndSchedule(this, t, e, n, (t => this.zt(t)));
         return this.Ot.push(r), r;
     }
     jt() {
-        this.kt && v();
+        this.kt && b();
     }
     verifyOperationInProgress() {}
     /**
@@ -6393,17 +6544,17 @@ class Br {
      */    Yt(t) {
         this.Mt.push(t);
     }
-    /** Called once a DelayedOperation is run or canceled. */    Qt(t) {
+    /** Called once a DelayedOperation is run or canceled. */    zt(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
         const e = this.Ot.indexOf(t);
         this.Ot.splice(e, 1);
     }
 }
 
-class Gr {
+class ts {
     /** @hideconstructor */
     constructor(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = qn(t);
+        this._firestore = t, this._transaction = e, this._dataReader = Mn(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -6411,25 +6562,25 @@ class Gr {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const e = Lr(t, this._firestore), n = new Rr(this._firestore);
+        const e = Wr(t, this._firestore), n = new Dr(this._firestore);
         return this._transaction.lookup([ e._key ]).then((t => {
-            if (!t || 1 !== t.length) return v();
+            if (!t || 1 !== t.length) return b();
             const r = t[0];
-            if (r.isFoundDocument()) return new er(this._firestore, n, r.key, r, e.converter);
-            if (r.isNoDocument()) return new er(this._firestore, n, e._key, null, e.converter);
-            throw v();
+            if (r.isFoundDocument()) return new or(this._firestore, n, r.key, r, e.converter);
+            if (r.isNoDocument()) return new or(this._firestore, n, e._key, null, e.converter);
+            throw b();
         }));
     }
     set(t, e, n) {
-        const r = Lr(t, this._firestore), s = Ar(r.converter, e, n), i = On(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, n);
+        const r = Wr(t, this._firestore), s = $r(r.converter, e, n), i = Un(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, n);
         return this._transaction.set(r._key, i), this;
     }
     update(t, e, n, ...r) {
-        const s = Lr(t, this._firestore);
+        const s = Wr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (e = l(e)) || e instanceof Tn ? zn(this._dataReader, "Transaction.update", s._key, e, n, r) : Bn(this._dataReader, "Transaction.update", s._key, e), 
+        return i = "string" == typeof (e = l(e)) || e instanceof $n ? Yn(this._dataReader, "Transaction.update", s._key, e, n, r) : Kn(this._dataReader, "Transaction.update", s._key, e), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -6438,7 +6589,7 @@ class Gr {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const e = Lr(t, this._firestore);
+        const e = Wr(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }
 }
@@ -6461,13 +6612,13 @@ class Gr {
  * (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, e, n) {
-    const r = an(t = ut(t, ln)), s = Object.assign(Object.assign({}, jr), n);
+ */ function es(t, e, n) {
+    const r = ln(t = ct(t, dn)), s = Object.assign(Object.assign({}, Yr), n);
     !function(t) {
-        if (t.maxAttempts < 1) throw new M(R, "Max attempts must be at least 1");
+        if (t.maxAttempts < 1) throw new U(P, "Max attempts must be at least 1");
     }(s);
-    const i = new U;
-    return new Br(new Wr, r, s, (n => e(new Gr(t, n))), i).run(), i.promise;
+    const i = new j;
+    return new Hr(new Zr, r, s, (n => e(new ts(t, n))), i).run(), i.promise;
 }
 
 /**
@@ -6478,11 +6629,11 @@ class Gr {
  * directly to the backend, and `onSnapshot()` APIs are not supported.
  * @packageDocumentation
  */ !function(t) {
-    d = t;
+    w = t;
 }(`${s}_lite`), n(new i("firestore/lite", ((t, {instanceIdentifier: e, options: n}) => {
-    const r = t.getProvider("app").getImmediate(), s = new ln(new Q(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")), function(t, e) {
-        if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new M(R, '"projectId" not provided in firebase.initializeApp.');
-        return new J(t.options.projectId, e);
+    const r = t.getProvider("app").getImmediate(), s = new dn(new W(t.getProvider("auth-internal")), new H(t.getProvider("app-check-internal")), function(t, e) {
+        if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(P, '"projectId" not provided in firebase.initializeApp.');
+        return new X(t.options.projectId, e);
     }
     /**
  * @license
@@ -6503,7 +6654,7 @@ class Gr {
     return n && s._setSettings(n), s;
 }), "PUBLIC").setMultipleInstances(!0)), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-r("firestore-lite", "3.5.0-canary.e35db6f95", "rn"), r("firestore-lite", "3.5.0-canary.e35db6f95", "esm2017");
+r("firestore-lite", "3.5.0-canary.ee871fc0b", "rn"), r("firestore-lite", "3.5.0-canary.ee871fc0b", "esm2017");
 
-export { Rn as Bytes, _n as CollectionReference, pn as DocumentReference, er as DocumentSnapshot, Tn as FieldPath, Pn as FieldValue, ln as Firestore, M as FirestoreError, Vn as GeoPoint, yn as Query, or as QueryConstraint, nr as QueryDocumentSnapshot, rr as QuerySnapshot, vt as Timestamp, Gr as Transaction, Cr as WriteBatch, xr as addDoc, Or as arrayRemove, qr as arrayUnion, gn as collection, vn as collectionGroup, wn as connectFirestoreEmulator, Dr as deleteDoc, Sr as deleteField, bn as doc, An as documentId, vr as endAt, gr as endBefore, Pr as getDoc, Vr as getDocs, dn as getFirestore, kr as increment, fn as initializeFirestore, dr as limit, wr as limitToLast, lr as orderBy, ur as query, In as queryEqual, En as refEqual, Kr as runTransaction, Fr as serverTimestamp, Nr as setDoc, m as setLogLevel, sr as snapshotEqual, yr as startAfter, pr as startAt, mn as terminate, $r as updateDoc, ar as where, Mr as writeBatch };
+export { gn as AggregateField, _n as AggregateQuerySnapshot, Nn as Bytes, In as CollectionReference, bn as DocumentReference, or as DocumentSnapshot, $n as FieldPath, xn as FieldValue, dn as Firestore, U as FirestoreError, Sn as GeoPoint, En as Query, lr as QueryConstraint, ur as QueryDocumentSnapshot, cr as QuerySnapshot, bt as Timestamp, ts as Transaction, zr as WriteBatch, kr as addDoc, Lr as aggregateQuerySnapshotEqual, Br as arrayRemove, jr as arrayUnion, Tn as collection, An as collectionGroup, pn as connectFirestoreEmulator, Or as deleteDoc, Mr as deleteField, Rn as doc, Dn as documentId, Ar as endAt, Tr as endBefore, Cr as getCount, xr as getDoc, Sr as getDocs, mn as getFirestore, Qr as increment, wn as initializeFirestore, gr as limit, _r as limitToLast, pr as orderBy, fr as query, Vn as queryEqual, Pn as refEqual, es as runTransaction, Ur as serverTimestamp, Fr as setDoc, p as setLogLevel, ar as snapshotEqual, Er as startAfter, br as startAt, yn as terminate, qr as updateDoc, wr as where, Gr as writeBatch };
 //# sourceMappingURL=index.rn.esm2017.js.map