@firebase/firestore 3.0.1 → 3.0.2-canary.07b88e6e8

package/dist/lite/firestore/compat/index.console.d.ts

@@ -0,0 +1,42 @@
+/**
+ * @license
+ * Copyright 2019 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.
+ */
+import { FirebaseAuthInternalName } from '@firebase/auth-interop-types';
+import { Provider } from '@firebase/component';
+import { Firestore as FirestoreCompat, PersistenceProvider } from './api/database';
+export { CollectionReference, DocumentReference, DocumentSnapshot, QuerySnapshot } from './api/database';
+export { Blob } from './api/blob';
+export { GeoPoint } from './api/geo_point';
+export { FieldPath } from './api/field_path';
+export { FieldValue } from './api/field_value';
+export { Timestamp } from './api/timestamp';
+export interface FirestoreDatabase {
+    projectId: string;
+    database?: string;
+}
+/**
+ * The persistence provider included with the memory-only SDK. This provider
+ * errors for all attempts to access persistence.
+ */
+export declare class MemoryPersistenceProvider implements PersistenceProvider {
+    enableIndexedDbPersistence(firestore: FirestoreCompat, forceOwnership: boolean): Promise<void>;
+    enableMultiTabIndexedDbPersistence(firestore: Firestore): Promise<void>;
+    clearIndexedDbPersistence(firestore: Firestore): Promise<void>;
+}
+/** Firestore class that exposes the constructor expected by the Console. */
+export declare class Firestore extends FirestoreCompat {
+    constructor(firestoreDatabase: FirestoreDatabase, authProvider: Provider<FirebaseAuthInternalName>);
+}

package/dist/lite/firestore/compat/index.d.ts

@@ -0,0 +1,49 @@
+/**
+ * @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.
+ */
+import { FirebaseNamespace } from '@firebase/app-types';
+import * as types from '@firebase/firestore-types';
+import './register-module';
+/**
+ * Registers the main Firestore build with the components framework.
+ * Persistence can be enabled via `firebase.firestore().enablePersistence()`.
+ */
+export declare function registerFirestore(instance: FirebaseNamespace): void;
+declare module '@firebase/app-compat' {
+    interface FirebaseNamespace {
+        firestore: {
+            (app?: FirebaseApp): types.FirebaseFirestore;
+            Blob: typeof types.Blob;
+            CollectionReference: typeof types.CollectionReference;
+            DocumentReference: typeof types.DocumentReference;
+            DocumentSnapshot: typeof types.DocumentSnapshot;
+            FieldPath: typeof types.FieldPath;
+            FieldValue: typeof types.FieldValue;
+            Firestore: typeof types.FirebaseFirestore;
+            GeoPoint: typeof types.GeoPoint;
+            Query: typeof types.Query;
+            QueryDocumentSnapshot: typeof types.QueryDocumentSnapshot;
+            QuerySnapshot: typeof types.QuerySnapshot;
+            Timestamp: typeof types.Timestamp;
+            Transaction: typeof types.Transaction;
+            WriteBatch: typeof types.WriteBatch;
+            setLogLevel: typeof types.setLogLevel;
+        };
+    }
+    interface FirebaseApp {
+        firestore?(): types.FirebaseFirestore;
+    }
+}

package/dist/lite/firestore/compat/index.node.d.ts

@@ -0,0 +1,22 @@
+/**
+ * @license
+ * Copyright 2017 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.
+ */
+import { FirebaseNamespace } from '@firebase/app-types';
+/**
+ * Registers the main Firestore Node build with the components framework.
+ * Persistence can be enabled via `firebase.firestore().enablePersistence()`.
+ */
+export declare function registerFirestore(instance: FirebaseNamespace): void;

package/dist/lite/firestore/compat/index.rn.d.ts

@@ -0,0 +1,22 @@
+/**
+ * @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.
+ */
+import { FirebaseNamespace } from '@firebase/app-types';
+/**
+ * Registers the main Firestore ReactNative build with the components framework.
+ * Persistence can be enabled via `firebase.firestore().enablePersistence()`.
+ */
+export declare function registerFirestore(instance: FirebaseNamespace): void;

package/dist/lite/firestore/compat/register-module.d.ts

@@ -0,0 +1,42 @@
+/**
+ * @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.
+ */
+import * as types from '@firebase/firestore-types';
+declare module '@firebase/app-compat' {
+    interface FirebaseNamespace {
+        firestore: {
+            (app?: FirebaseApp): types.FirebaseFirestore;
+            Blob: typeof types.Blob;
+            CollectionReference: typeof types.CollectionReference;
+            DocumentReference: typeof types.DocumentReference;
+            DocumentSnapshot: typeof types.DocumentSnapshot;
+            FieldPath: typeof types.FieldPath;
+            FieldValue: typeof types.FieldValue;
+            Firestore: typeof types.FirebaseFirestore;
+            GeoPoint: typeof types.GeoPoint;
+            Query: typeof types.Query;
+            QueryDocumentSnapshot: typeof types.QueryDocumentSnapshot;
+            QuerySnapshot: typeof types.QuerySnapshot;
+            Timestamp: typeof types.Timestamp;
+            Transaction: typeof types.Transaction;
+            WriteBatch: typeof types.WriteBatch;
+            setLogLevel: typeof types.setLogLevel;
+        };
+    }
+    interface FirebaseApp {
+        firestore?(): types.FirebaseFirestore;
+    }
+}

package/dist/lite/firestore/compat/util/input_validation.d.ts

@@ -0,0 +1,18 @@
+/**
+ * @license
+ * Copyright 2021 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.
+ */
+import { SetOptions } from '@firebase/firestore-types';
+export declare function validateSetOptions(methodName: string, options: SetOptions | undefined): SetOptions;

package/dist/lite/firestore/src/api/credentials.d.ts

@@ -80,7 +80,10 @@ export interface CredentialsProvider {
     invalidateToken(): void;
     shutdown(): void;
 }
-/** A CredentialsProvider that always yields an empty token. */
+/**
+ * A CredentialsProvider that always yields an empty token.
+ * @internal
+ */
 export declare class EmptyCredentialsProvider implements CredentialsProvider {
     getToken(): Promise<Token | null>;
     invalidateToken(): void;

package/dist/lite/firestore/src/api.d.ts

@@ -47,3 +47,4 @@ export { FieldPath as _FieldPath } from './model/path';
 export type { ResourcePath as _ResourcePath } from './model/path';
 export type { ByteString as _ByteString } from './util/byte_string';
 export { logWarn as _logWarn } from './util/log';
+export { EmptyCredentialsProvider as _EmptyCredentialsProvider } from './api/credentials';

package/dist/lite/firestore/src/model/mutation.d.ts

@@ -141,7 +141,7 @@ export declare function preconditionIsValidForDocument(precondition: Preconditio
  *
  * Every type of mutation needs to implement its own applyToRemoteDocument() and
  * applyToLocalView() to implement the actual behavior of applying the mutation
- * to some source document (see `applySetMutationToRemoteDocument()` for an
+ * to some source document (see `setMutationApplyToRemoteDocument()` for an
  * example).
  */
 export declare abstract class Mutation {
@@ -162,7 +162,7 @@ export declare abstract class Mutation {
  *     of the document.
  * @param mutationResult - The result of applying the mutation from the backend.
  */
-export declare function applyMutationToRemoteDocument(mutation: Mutation, document: MutableDocument, mutationResult: MutationResult): void;
+export declare function mutationApplyToRemoteDocument(mutation: Mutation, document: MutableDocument, mutationResult: MutationResult): void;
 /**
  * Applies this mutation to the given document for the purposes of computing
  * the new local view of a document. If the input document doesn't match the
@@ -175,7 +175,7 @@ export declare function applyMutationToRemoteDocument(mutation: Mutation, docume
  * @param localWriteTime - A timestamp indicating the local write time of the
  *     batch this mutation is a part of.
  */
-export declare function applyMutationToLocalView(mutation: Mutation, document: MutableDocument, localWriteTime: Timestamp): void;
+export declare function mutationApplyToLocalView(mutation: Mutation, document: MutableDocument, localWriteTime: Timestamp): void;
 /**
  * If this mutation is not idempotent, returns the base value to persist with
  * this mutation. If a base value is returned, the mutation is always applied
@@ -192,7 +192,7 @@ export declare function applyMutationToLocalView(mutation: Mutation, document: M
  * @returns a base value to store along with the mutation, or null for
  * idempotent mutations.
  */
-export declare function extractMutationBaseValue(mutation: Mutation, document: Document): ObjectValue | null;
+export declare function mutationExtractBaseValue(mutation: Mutation, document: Document): ObjectValue | null;
 export declare function mutationEquals(left: Mutation, right: Mutation): boolean;
 /**
  * A mutation that creates or replaces the document at the given key with the

package/dist/lite/firestore/test/integration/api_internal/auth.test.d.ts

@@ -0,0 +1,17 @@
+/**
+ * @license
+ * Copyright 2021 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.
+ */
+export {};

package/dist/lite/firestore/test/util/api_helpers.d.ts

@@ -20,7 +20,7 @@ import { JsonObject } from '../../src/model/object_value';
 /**
  * A mock Firestore. Will not work for integration test.
  */
-export declare const FIRESTORE: any;
+export declare const FIRESTORE: Firestore;
 export declare function firestore(): Firestore;
 export declare function newTestFirestore(projectId?: string): Firestore;
 export declare function collectionReference(path: string): CollectionReference;

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

@@ -1,10 +1,10 @@
-import { _getProvider as t, getApp as n, _removeServiceInstance as e, _registerComponent as r, registerVersion as s, SDK_VERSION as i } from "@firebase/app";
+import { _getProvider, getApp as t, _removeServiceInstance as n, _registerComponent as e, registerVersion as r, SDK_VERSION as s } from "@firebase/app";
 
-import { Component as o } from "@firebase/component";
+import { Component as i } from "@firebase/component";
 
-import { Logger as u, LogLevel as c } from "@firebase/logger";
+import { Logger as o, LogLevel as u } from "@firebase/logger";
 
-import { createMockUserToken as a, getModularInstance as h } from "@firebase/util";
+import { createMockUserToken as c, getModularInstance as a } from "@firebase/util";
 
 /**
  * @license
@@ -26,7 +26,7 @@ import { createMockUserToken as a, getModularInstance as h } from "@firebase/uti
  * Simple wrapper around a nullable UID. Mostly exists to make code more
  * readable.
  */
-class l {
+class h {
     constructor(t) {
         this.uid = t;
     }
@@ -44,11 +44,11 @@ class l {
     }
 }
 
-/** A user with a null UID. */ l.UNAUTHENTICATED = new l(null), 
+/** A user with a null UID. */ h.UNAUTHENTICATED = new h(null), 
 // TODO(mikelehen): Look into getting a proper uid-equivalent for
 // non-FirebaseAuth providers.
-l.GOOGLE_CREDENTIALS = new l("google-credentials-uid"), l.FIRST_PARTY = new l("first-party-uid"), 
-l.MOCK_USER = new l("mock-user");
+h.GOOGLE_CREDENTIALS = new h("google-credentials-uid"), h.FIRST_PARTY = new h("first-party-uid"), 
+h.MOCK_USER = new h("mock-user");
 
 /**
  * @license
@@ -66,7 +66,7 @@ l.MOCK_USER = new l("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let f = "9.0.1";
+let l = "9.0.2-canary.07b88e6e8";
 
 /**
  * @license
@@ -84,7 +84,7 @@ let f = "9.0.1";
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const d = new u("@firebase/firestore");
+const f = new o("@firebase/firestore");
 
 /**
  * Sets the verbosity of Cloud Firestore logs (debug, error, or silent).
@@ -98,36 +98,36 @@ const d = new u("@firebase/firestore");
  *     <li>`error` to log errors only.</li>
  *     <li><code>`silent` to turn off logging.</li>
  *   </ul>
- */ function w(t) {
-    d.setLogLevel(t);
+ */ function d(t) {
+    f.setLogLevel(t);
 }
 
-function m(t, ...n) {
-    if (d.logLevel <= c.DEBUG) {
-        const e = n.map(_);
-        d.debug(`Firestore (${f}): ${t}`, ...e);
+function w(t, ...n) {
+    if (f.logLevel <= u.DEBUG) {
+        const e = n.map(y);
+        f.debug(`Firestore (${l}): ${t}`, ...e);
     }
 }
 
-function p(t, ...n) {
-    if (d.logLevel <= c.ERROR) {
-        const e = n.map(_);
-        d.error(`Firestore (${f}): ${t}`, ...e);
+function m(t, ...n) {
+    if (f.logLevel <= u.ERROR) {
+        const e = n.map(y);
+        f.error(`Firestore (${l}): ${t}`, ...e);
     }
 }
 
 /**
  * @internal
- */ function y(t, ...n) {
-    if (d.logLevel <= c.WARN) {
-        const e = n.map(_);
-        d.warn(`Firestore (${f}): ${t}`, ...e);
+ */ function p(t, ...n) {
+    if (f.logLevel <= u.WARN) {
+        const e = n.map(y);
+        f.warn(`Firestore (${l}): ${t}`, ...e);
     }
 }
 
 /**
  * Converts an additional log parameter to a string representation.
- */ function _(t) {
+ */ function y(t) {
     if ("string" == typeof t) return t;
     try {
         return n = t, JSON.stringify(n);
@@ -178,14 +178,14 @@ function p(t, ...n) {
  * Returns `never` and can be used in expressions:
  * @example
  * let futureVar = fail('not implemented yet');
- */ function g(t = "Unexpected state") {
+ */ function _(t = "Unexpected state") {
     // Log the failure in addition to throw an exception, just in case the
     // exception is swallowed.
-    const n = `FIRESTORE (${f}) INTERNAL ASSERTION FAILED: ` + t;
+    const n = `FIRESTORE (${l}) INTERNAL ASSERTION FAILED: ` + t;
     // NOTE: We don't use FirestoreError here because these are internal failures
     // that cannot be handled by the user. (Also it would create a circular
     // dependency between the error and assert modules which doesn't work.)
-    throw p(n), new Error(n);
+    throw m(n), new Error(n);
 }
 
 /**
@@ -193,14 +193,14 @@ function p(t, ...n) {
  * given message if it did.
  *
  * Messages are stripped in production builds.
- */ function b(t, n) {
-    t || g();
+ */ function g(t, n) {
+    t || _();
 }
 
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function v(t, 
+ */ function b(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 n) {
     return t;
@@ -221,9 +221,9 @@ n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const E = "ok", I = "cancelled", T = "unknown", A = "invalid-argument", P = "deadline-exceeded", R = "not-found", V = "already-exists", N = "permission-denied", D = "unauthenticated", $ = "resource-exhausted", F = "failed-precondition", S = "aborted", q = "out-of-range", x = "unimplemented", O = "internal", C = "unavailable", L = "data-loss";
+ */ const v = "ok", E = "cancelled", I = "unknown", T = "invalid-argument", A = "deadline-exceeded", P = "not-found", R = "already-exists", V = "permission-denied", N = "unauthenticated", D = "resource-exhausted", $ = "failed-precondition", F = "aborted", S = "out-of-range", q = "unimplemented", x = "internal", O = "unavailable", C = "data-loss";
 
-/** An error returned by a Firestore operation. */ class U extends Error {
+/** An error returned by a Firestore operation. */ class L extends Error {
     /** @hideconstructor */
     constructor(
     /**
@@ -259,7 +259,7 @@ n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class j {
+ */ class U {
     constructor() {
         this.promise = new Promise(((t, n) => {
             this.resolve = t, this.reject = n;
@@ -282,7 +282,7 @@ n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class k {
+ */ class j {
     constructor(t, n) {
         this.user = n, this.type = "OAuth", this.authHeaders = {}, 
         // Set the headers using Object Literal notation to avoid minification
@@ -290,14 +290,17 @@ n) {
     }
 }
 
-/** A CredentialsProvider that always yields an empty token. */ class M {
+/**
+ * A CredentialsProvider that always yields an empty token.
+ * @internal
+ */ class k {
     getToken() {
         return Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, n) {
         // Fire with initial user.
-        t.enqueueRetryable((() => n(l.UNAUTHENTICATED)));
+        t.enqueueRetryable((() => n(h.UNAUTHENTICATED)));
     }
     shutdown() {}
 }
@@ -305,7 +308,7 @@ n) {
 /**
  * A CredentialsProvider that always returns a constant token. Used for
  * emulator token mocking.
- */ class B {
+ */ class M {
     constructor(t) {
         this.token = t, 
         /**
@@ -329,15 +332,15 @@ n) {
     }
 }
 
-/** Credential provider for the Lite SDK. */ class Q {
+/** Credential provider for the Lite SDK. */ class B {
     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 k(t.accessToken, new l(this.auth.getUid()))) : null)) : Promise.resolve(null);
+        return this.auth ? this.auth.getToken().then((t => t ? (g("string" == typeof t.accessToken), 
+        new j(t.accessToken, new h(this.auth.getUid()))) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, n) {}
@@ -350,9 +353,9 @@ n) {
  * Technically this may no longer be necessary since the SDK should gracefully
  * recover from unauthenticated errors (see b/33147818 for context), but it's
  * safer to keep the implementation as-is.
- */ class z {
+ */ class Q {
     constructor(t, n, e) {
-        this.t = t, this.i = n, this.o = e, this.type = "FirstParty", this.user = l.FIRST_PARTY;
+        this.t = t, this.i = n, this.o = e, this.type = "FirstParty", this.user = h.FIRST_PARTY;
     }
     get authHeaders() {
         const t = {
@@ -368,16 +371,16 @@ n) {
  * Provides user credentials required for the Firestore JavaScript SDK
  * to authenticate the user, using technique that is only available
  * to applications hosted by Google.
- */ class W {
+ */ class z {
     constructor(t, n, e) {
         this.t = t, this.i = n, this.o = e;
     }
     getToken() {
-        return Promise.resolve(new z(this.t, this.i, this.o));
+        return Promise.resolve(new Q(this.t, this.i, this.o));
     }
     start(t, n) {
         // Fire with initial uid.
-        t.enqueueRetryable((() => n(l.FIRST_PARTY)));
+        t.enqueueRetryable((() => n(h.FIRST_PARTY)));
     }
     shutdown() {}
     invalidateToken() {}
@@ -403,7 +406,7 @@ n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-class G {
+class W {
     /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -432,7 +435,7 @@ class G {
  * Represents the database ID a Firestore client is associated with.
  * @internal
  */
-class H {
+class G {
     constructor(t, n) {
         this.projectId = t, this.database = n || "(default)";
     }
@@ -440,7 +443,7 @@ class H {
         return "(default)" === this.database;
     }
     isEqual(t) {
-        return t instanceof H && t.projectId === this.projectId && t.database === this.database;
+        return t instanceof G && t.projectId === this.projectId && t.database === this.database;
     }
 }
 
@@ -463,20 +466,20 @@ class H {
 /**
  * Path represents an ordered sequence of string segments.
  */
-class Y {
+class H {
     constructor(t, n, e) {
-        void 0 === n ? n = 0 : n > t.length && g(), void 0 === e ? e = t.length - n : e > t.length - n && g(), 
+        void 0 === n ? n = 0 : n > t.length && _(), void 0 === e ? e = t.length - n : e > t.length - n && _(), 
         this.segments = t, this.offset = n, this.len = e;
     }
     get length() {
         return this.len;
     }
     isEqual(t) {
-        return 0 === Y.comparator(this, t);
+        return 0 === H.comparator(this, t);
     }
     child(t) {
         const n = this.segments.slice(this.offset, this.limit());
-        return t instanceof Y ? t.forEach((t => {
+        return t instanceof H ? t.forEach((t => {
             n.push(t);
         })) : n.push(t), this.construct(n);
     }
@@ -533,9 +536,9 @@ class Y {
  * within Firestore.
  *
  * @internal
- */ class K extends Y {
+ */ class Y extends H {
     construct(t, n, e) {
-        return new K(t, n, e);
+        return new Y(t, n, e);
     }
     canonicalString() {
         // NOTE: The client is ignorant of any path segments containing escape
@@ -556,35 +559,35 @@ class Y {
         // for legacy reasons and should not be used frequently).
         const n = [];
         for (const e of t) {
-            if (e.indexOf("//") >= 0) throw new U(A, `Invalid segment (${e}). Paths must not contain // in them.`);
+            if (e.indexOf("//") >= 0) throw new L(T, `Invalid segment (${e}). Paths must not contain // in them.`);
             // Strip leading and traling slashed.
                         n.push(...e.split("/").filter((t => t.length > 0)));
         }
-        return new K(n);
+        return new Y(n);
     }
     static emptyPath() {
-        return new K([]);
+        return new Y([]);
     }
 }
 
-const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
+const K = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
 
 /**
  * A dot-separated path for navigating sub-objects within a document.
  * @internal
- */ class Z extends Y {
+ */ class J extends H {
     construct(t, n, e) {
-        return new Z(t, n, e);
+        return new J(t, n, e);
     }
     /**
      * Returns true if the string could be used as a segment in a field path
      * without escaping.
      */    static isValidIdentifier(t) {
-        return J.test(t);
+        return K.test(t);
     }
     canonicalString() {
         return this.toArray().map((t => (t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"), 
-        Z.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
+        J.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
     }
     toString() {
         return this.canonicalString();
@@ -597,7 +600,7 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
     /**
      * The field designating the key of a document.
      */    static keyField() {
-        return new Z([ "__name__" ]);
+        return new J([ "__name__" ]);
     }
     /**
      * Parses a field string from the given server-formatted string.
@@ -612,24 +615,24 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
         const n = [];
         let e = "", r = 0;
         const s = () => {
-            if (0 === e.length) throw new U(A, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
+            if (0 === e.length) throw new L(T, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
             n.push(e), e = "";
         };
         let i = !1;
         for (;r < t.length; ) {
             const n = t[r];
             if ("\\" === n) {
-                if (r + 1 === t.length) throw new U(A, "Path has trailing escape character: " + t);
+                if (r + 1 === t.length) throw new L(T, "Path has trailing escape character: " + t);
                 const n = t[r + 1];
-                if ("\\" !== n && "." !== n && "`" !== n) throw new U(A, "Path has invalid escape sequence: " + t);
+                if ("\\" !== n && "." !== n && "`" !== n) throw new L(T, "Path has invalid escape sequence: " + t);
                 e += n, r += 2;
             } else "`" === n ? (i = !i, r++) : "." !== n || i ? (e += n, r++) : (s(), r++);
         }
-        if (s(), i) throw new U(A, "Unterminated ` in path: " + t);
-        return new Z(n);
+        if (s(), i) throw new L(T, "Unterminated ` in path: " + t);
+        return new J(n);
     }
     static emptyPath() {
-        return new Z([]);
+        return new J([]);
     }
 }
 
@@ -651,27 +654,27 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  */
 /**
  * @internal
- */ class X {
+ */ class Z {
     constructor(t) {
         this.path = t;
     }
     static fromPath(t) {
-        return new X(K.fromString(t));
+        return new Z(Y.fromString(t));
     }
     static fromName(t) {
-        return new X(K.fromString(t).popFirst(5));
+        return new Z(Y.fromString(t).popFirst(5));
     }
     /** Returns true if the document is in the specified collectionId. */    hasCollectionId(t) {
         return this.path.length >= 2 && this.path.get(this.path.length - 2) === t;
     }
     isEqual(t) {
-        return null !== t && 0 === K.comparator(this.path, t.path);
+        return null !== t && 0 === Y.comparator(this.path, t.path);
     }
     toString() {
         return this.path.toString();
     }
     static comparator(t, n) {
-        return K.comparator(t.path, n.path);
+        return Y.comparator(t.path, n.path);
     }
     static isDocumentKey(t) {
         return t.length % 2 == 0;
@@ -682,7 +685,7 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
      * @param segments - The segments of the path to the document
      * @returns A new instance of DocumentKey
      */    static fromSegments(t) {
-        return new X(new K(t.slice()));
+        return new Z(new Y(t.slice()));
     }
 }
 
@@ -701,8 +704,8 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function tt(t, n, e) {
-    if (!e) throw new U(A, `Function ${t}() cannot be called with an empty ${n}.`);
+ */ function X(t, n, e) {
+    if (!e) throw new L(T, `Function ${t}() cannot be called with an empty ${n}.`);
 }
 
 /**
@@ -713,15 +716,15 @@ const J = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  * Validates that `path` refers to a document (indicated by the fact it contains
  * an even numbers of segments).
  */
-function nt(t) {
-    if (!X.isDocumentKey(t)) throw new U(A, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
+function tt(t) {
+    if (!Z.isDocumentKey(t)) throw new L(T, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
  * Validates that `path` refers to a collection (indicated by the fact it
  * contains an odd numbers of segments).
- */ function et(t) {
-    if (X.isDocumentKey(t)) throw new U(A, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
+ */ function nt(t) {
+    if (Z.isDocumentKey(t)) throw new L(T, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
@@ -729,7 +732,7 @@ function nt(t) {
  * (i.e. excludes Array, Date, etc.).
  */
 /** Returns a string describing the type / value of the provided input. */
-function rt(t) {
+function et(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)}...`), 
@@ -758,27 +761,27 @@ function rt(t) {
             return n ? `a custom ${n} object` : "an object";
         }
     }
-    return "function" == typeof t ? "a function" : g();
+    return "function" == typeof t ? "a function" : _();
 }
 
-function st(t, 
+function rt(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 n) {
     if ("_delegate" in t && (
     // Unwrap Compat types
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     t = t._delegate), !(t instanceof n)) {
-        if (n.name === t.constructor.name) throw new U(A, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
+        if (n.name === t.constructor.name) throw new L(T, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
-            const e = rt(t);
-            throw new U(A, `Expected type '${n.name}', but it was: ${e}`);
+            const e = et(t);
+            throw new L(T, `Expected type '${n.name}', but it was: ${e}`);
         }
     }
     return t;
 }
 
-function it(t, n) {
-    if (n <= 0) throw new U(A, `Function ${t}() requires a positive number, but it was: ${n}.`);
+function st(t, n) {
+    if (n <= 0) throw new L(T, `Function ${t}() requires a positive number, but it was: ${n}.`);
 }
 
 /**
@@ -799,11 +802,11 @@ function it(t, n) {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function ot(t) {
+ */ function it(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function ut(t) {
+/** Returns whether the value represents -0. */ function ot(t) {
     // Detect if the value is -0.0. Based on polyfill from
     // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
     return 0 === t && 1 / t == -1 / 0;
@@ -829,7 +832,7 @@ function it(t, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-const ct = {
+const ut = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery"
@@ -866,7 +869,7 @@ const ct = {
  * are used for reverse lookups from the webchannel stream. Do NOT change the
  * names of these identifiers or change this into a const enum.
  */
-var at, ht;
+var ct, at;
 
 /**
  * Converts an HTTP Status Code to the equivalent error code.
@@ -875,8 +878,8 @@ var at, ht;
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function lt(t) {
-    if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), T;
+function ht(t) {
+    if (void 0 === t) return m("RPC_ERROR", "HTTP error has no status"), I;
     // The canonical error codes for Google APIs [1] specify mapping onto HTTP
     // status codes but the mapping is not bijective. In each case of ambiguity
     // this function chooses a primary error.
@@ -886,66 +889,66 @@ function lt(t) {
         switch (t) {
       case 200:
         // OK
-        return E;
+        return v;
 
       case 400:
         // Bad Request
-        return F;
+        return $;
 
         // Other possibilities based on the forward mapping
         // return Code.INVALID_ARGUMENT;
         // return Code.OUT_OF_RANGE;
               case 401:
         // Unauthorized
-        return D;
+        return N;
 
       case 403:
         // Forbidden
-        return N;
+        return V;
 
       case 404:
         // Not Found
-        return R;
+        return P;
 
       case 409:
         // Conflict
-        return S;
+        return F;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return q;
+        return S;
 
       case 429:
         // Too Many Requests
-        return $;
+        return D;
 
       case 499:
         // Client Closed Request
-        return I;
+        return E;
 
       case 500:
         // Internal Server Error
-        return T;
+        return I;
 
         // Other possibilities:
         // return Code.INTERNAL;
         // return Code.DATA_LOSS;
               case 501:
         // Unimplemented
-        return x;
+        return q;
 
       case 503:
         // Service Unavailable
-        return C;
+        return O;
 
       case 504:
         // Gateway Timeout
-        return P;
+        return A;
 
       default:
-        return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? F : t >= 500 && t < 600 ? O : T;
+        return t >= 200 && t < 300 ? v : t >= 400 && t < 500 ? $ : t >= 500 && t < 600 ? x : I;
     }
 }
 
@@ -968,16 +971,16 @@ function lt(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (ht = at || (at = {}))[ht.OK = 0] = "OK", ht[ht.CANCELLED = 1] = "CANCELLED", 
-ht[ht.UNKNOWN = 2] = "UNKNOWN", ht[ht.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
-ht[ht.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", ht[ht.NOT_FOUND = 5] = "NOT_FOUND", 
-ht[ht.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", ht[ht.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
-ht[ht.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", ht[ht.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
-ht[ht.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", ht[ht.ABORTED = 10] = "ABORTED", 
-ht[ht.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", ht[ht.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
-ht[ht.INTERNAL = 13] = "INTERNAL", ht[ht.UNAVAILABLE = 14] = "UNAVAILABLE", ht[ht.DATA_LOSS = 15] = "DATA_LOSS";
+ */ (at = ct || (ct = {}))[at.OK = 0] = "OK", at[at.CANCELLED = 1] = "CANCELLED", 
+at[at.UNKNOWN = 2] = "UNKNOWN", at[at.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+at[at.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", at[at.NOT_FOUND = 5] = "NOT_FOUND", 
+at[at.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", at[at.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+at[at.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", at[at.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+at[at.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", at[at.ABORTED = 10] = "ABORTED", 
+at[at.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", at[at.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+at[at.INTERNAL = 13] = "INTERNAL", at[at.UNAVAILABLE = 14] = "UNAVAILABLE", at[at.DATA_LOSS = 15] = "DATA_LOSS";
 
-class ft extends 
+class lt extends 
 /**
  * Base class for all Rest-based connections to the backend (WebChannel and
  * HTTP).
@@ -990,11 +993,11 @@ class {
     }
     l(t, n, e, r) {
         const s = this.m(t, n);
-        m("RestConnection", "Sending: ", s, e);
+        w("RestConnection", "Sending: ", s, e);
         const i = {};
-        return this.p(i, r), this.g(t, s, i, e).then((t => (m("RestConnection", "Received: ", t), 
+        return this.p(i, r), this.g(t, s, i, e).then((t => (w("RestConnection", "Received: ", t), 
         t)), (n => {
-            throw y("RestConnection", `${t} failed with error: `, n, "url: ", s, "request:", e), 
+            throw p("RestConnection", `${t} failed with error: `, n, "url: ", s, "request:", e), 
             n;
         }));
     }
@@ -1007,7 +1010,7 @@ class {
      * Modifies the headers for a request, adding any authorization token if
      * present and any additional headers for the request.
      */    p(t, n) {
-        if (t["X-Goog-Api-Client"] = "gl-js/ fire/" + f, 
+        if (t["X-Goog-Api-Client"] = "gl-js/ fire/" + l, 
         // 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
@@ -1016,7 +1019,7 @@ class {
         n) for (const e in n.authHeaders) n.authHeaders.hasOwnProperty(e) && (t[e] = n.authHeaders[e]);
     }
     m(t, n) {
-        const e = ct[t];
+        const e = ut[t];
         return `${this.u}/v1/${n}:${e}`;
     }
 } {
@@ -1040,9 +1043,9 @@ class {
                 body: s
             });
         } catch (t) {
-            throw new U(lt(t.status), "Request failed with error: " + t.statusText);
+            throw new L(ht(t.status), "Request failed with error: " + t.statusText);
         }
-        if (!i.ok) throw new U(lt(i.status), "Request failed with error: " + i.statusText);
+        if (!i.ok) throw new L(ht(i.status), "Request failed with error: " + i.statusText);
         return i.json();
     }
 }
@@ -1085,7 +1088,7 @@ class {
  *
  * If `nBytes < 0` , an error will be thrown.
  */
-function dt(t) {
+function ft(t) {
     // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.
     const n = 
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
@@ -1111,14 +1114,14 @@ function dt(t) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class wt {
+ */ class dt {
     static A() {
         // Alphanumeric characters
         const t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", n = Math.floor(256 / t.length) * t.length;
         // The largest byte value that is a multiple of `char.length`.
                 let e = "";
         for (;e.length < 20; ) {
-            const r = dt(40);
+            const r = ft(40);
             for (let s = 0; s < r.length; ++s) 
             // Only accept values that are [0, maxMultiple), this ensures they can
             // be evenly mapped to indices of `chars` via a modulo operation.
@@ -1128,11 +1131,11 @@ function dt(t) {
     }
 }
 
-function mt(t, n) {
+function wt(t, n) {
     return t < n ? -1 : t > n ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function pt(t, n, e) {
+/** Helper to compare arrays using isEqual(). */ function mt(t, n, e) {
     return t.length === n.length && t.every(((t, r) => e(t, n[r])));
 }
 
@@ -1167,7 +1170,7 @@ function mt(t, n) {
  * For examples and further specifications, refer to the
  * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
  */
-class yt {
+class pt {
     /**
      * Creates a new timestamp.
      *
@@ -1188,18 +1191,18 @@ class yt {
      * The fractions of a second at nanosecond resolution.*
      */
     n) {
-        if (this.seconds = t, this.nanoseconds = n, n < 0) throw new U(A, "Timestamp nanoseconds out of range: " + n);
-        if (n >= 1e9) throw new U(A, "Timestamp nanoseconds out of range: " + n);
-        if (t < -62135596800) throw new U(A, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = n, n < 0) throw new L(T, "Timestamp nanoseconds out of range: " + n);
+        if (n >= 1e9) throw new L(T, "Timestamp nanoseconds out of range: " + n);
+        if (t < -62135596800) throw new L(T, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new U(A, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new L(T, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
      *
      * @returns a new timestamp representing the current date.
      */    static now() {
-        return yt.fromMillis(Date.now());
+        return pt.fromMillis(Date.now());
     }
     /**
      * Creates a new timestamp from the given date.
@@ -1208,7 +1211,7 @@ class yt {
      * @returns A new `Timestamp` representing the same point in time as the given
      *     date.
      */    static fromDate(t) {
-        return yt.fromMillis(t.getTime());
+        return pt.fromMillis(t.getTime());
     }
     /**
      * Creates a new timestamp from the given number of milliseconds.
@@ -1219,7 +1222,7 @@ class yt {
      *     number of milliseconds.
      */    static fromMillis(t) {
         const n = Math.floor(t / 1e3), e = Math.floor(1e6 * (t - 1e3 * n));
-        return new yt(n, e);
+        return new pt(n, e);
     }
     /**
      * Converts a `Timestamp` to a JavaScript `Date` object. This conversion
@@ -1241,7 +1244,7 @@ class yt {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }
     _compareTo(t) {
-        return this.seconds === t.seconds ? mt(this.nanoseconds, t.nanoseconds) : mt(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? wt(this.nanoseconds, t.nanoseconds) : wt(this.seconds, t.seconds);
     }
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1297,15 +1300,15 @@ class yt {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ class _t {
+ */ class yt {
     constructor(t) {
         this.timestamp = t;
     }
     static fromTimestamp(t) {
-        return new _t(t);
+        return new yt(t);
     }
     static min() {
-        return new _t(new yt(0, 0));
+        return new yt(new pt(0, 0));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -1340,13 +1343,13 @@ class yt {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function gt(t) {
+ */ function _t(t) {
     let n = 0;
     for (const e in t) Object.prototype.hasOwnProperty.call(t, e) && n++;
     return n;
 }
 
-function bt(t, n) {
+function gt(t, n) {
     for (const e in t) Object.prototype.hasOwnProperty.call(t, e) && n(e, t[e]);
 }
 
@@ -1376,12 +1379,12 @@ function bt(t, n) {
  *             If foo is not an object, foo is replaced with an object
  *             containing foo
  */
-class vt {
+class bt {
     constructor(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
         // Sort the field mask to support `FieldMask.isEqual()` and assert below.
-        t.sort(Z.comparator);
+        t.sort(J.comparator);
     }
     /**
      * Verifies that `fieldPath` is included by at least one field in this field
@@ -1393,7 +1396,7 @@ class vt {
         return !1;
     }
     isEqual(t) {
-        return pt(this.fields, t.fields, ((t, n) => t.isEqual(n)));
+        return mt(this.fields, t.fields, ((t, n) => t.isEqual(n)));
     }
 }
 
@@ -1439,13 +1442,13 @@ class vt {
  * before being sent as a proto.
  * @internal
  */
-class Et {
+class vt {
     constructor(t) {
         this.binaryString = t;
     }
     static fromBase64String(t) {
         const n = atob(t);
-        return new Et(n);
+        return new vt(n);
     }
     static fromUint8Array(t) {
         const n = 
@@ -1460,7 +1463,7 @@ class Et {
         /**
  * Helper function to convert a binary string to an Uint8Array.
  */ (t);
-        return new Et(n);
+        return new vt(n);
     }
     toBase64() {
         return t = this.binaryString, btoa(t);
@@ -1496,31 +1499,31 @@ class Et {
         return 2 * this.binaryString.length;
     }
     compareTo(t) {
-        return mt(this.binaryString, t.binaryString);
+        return wt(this.binaryString, t.binaryString);
     }
     isEqual(t) {
         return this.binaryString === t.binaryString;
     }
 }
 
-Et.EMPTY_BYTE_STRING = new Et("");
+vt.EMPTY_BYTE_STRING = new vt("");
 
-const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const Et = 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 Tt(t) {
+ */ function It(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 (g(!!t), "string" == typeof t) {
         // The date string can have higher precision (nanos) than the Date class
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
         let n = 0;
-        const e = It.exec(t);
-        if (b(!!e), e[1]) {
+        const e = Et.exec(t);
+        if (g(!!e), e[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = e[1];
             t = (t + "000000000").substr(0, 9), n = Number(t);
@@ -1533,21 +1536,21 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: At(t.seconds),
-        nanos: At(t.nanos)
+        seconds: Tt(t.seconds),
+        nanos: Tt(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function At(t) {
+ */ function Tt(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 Pt(t) {
-    return "string" == typeof t ? Et.fromBase64String(t) : Et.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function At(t) {
+    return "string" == typeof t ? vt.fromBase64String(t) : vt.fromUint8Array(t);
 }
 
 /**
@@ -1583,7 +1586,7 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *   FieldValueOptions to value().
  * - With respect to other ServerTimestampValues, they sort by their
  *   localWriteTime.
- */ function Rt(t) {
+ */ function Pt(t) {
     var n, e;
     return "server_timestamp" === (null === (e = ((null === (n = null == t ? void 0 : t.mapValue) || void 0 === n ? void 0 : n.fields) || {}).__type__) || void 0 === e ? void 0 : e.stringValue);
 }
@@ -1593,16 +1596,16 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *
  * Preserving the previous values allows the user to display the last resoled
  * value until the backend responds with the timestamp.
- */ function Vt(t) {
+ */ function Rt(t) {
     const n = t.mapValue.fields.__previous_value__;
-    return Rt(n) ? Vt(n) : n;
+    return Pt(n) ? Rt(n) : n;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Nt(t) {
-    const n = Tt(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new yt(n.seconds, n.nanos);
+ */ function Vt(t) {
+    const n = It(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new pt(n.seconds, n.nanos);
 }
 
 /**
@@ -1621,13 +1624,13 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Extracts the backend's type order for the provided value. */ function Dt(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 ? Rt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : g();
+/** Extracts the backend's type order for the provided value. */ function Nt(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 ? Pt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : _();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function $t(t, n) {
-    const e = Dt(t);
-    if (e !== Dt(n)) return !1;
+/** Tests `left` and `right` for equality based on the backend semantics. */ function Dt(t, n) {
+    const e = Nt(t);
+    if (e !== Nt(n)) return !1;
     switch (e) {
       case 0 /* NullValue */ :
         return !0;
@@ -1636,14 +1639,14 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         return t.booleanValue === n.booleanValue;
 
       case 4 /* ServerTimestampValue */ :
-        return Nt(t).isEqual(Nt(n));
+        return Vt(t).isEqual(Vt(n));
 
       case 3 /* TimestampValue */ :
         return function(t, n) {
             if ("string" == typeof t.timestampValue && "string" == typeof n.timestampValue && t.timestampValue.length === n.timestampValue.length) 
             // Use string equality for ISO 8601 timestamps
             return t.timestampValue === n.timestampValue;
-            const e = Tt(t.timestampValue), r = Tt(n.timestampValue);
+            const e = It(t.timestampValue), r = It(n.timestampValue);
             return e.seconds === r.seconds && e.nanos === r.nanos;
         }(t, n);
 
@@ -1652,7 +1655,7 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 6 /* BlobValue */ :
         return function(t, n) {
-            return Pt(t.bytesValue).isEqual(Pt(n.bytesValue));
+            return At(t.bytesValue).isEqual(At(n.bytesValue));
         }(t, n);
 
       case 7 /* RefValue */ :
@@ -1660,70 +1663,70 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 8 /* GeoPointValue */ :
         return function(t, n) {
-            return At(t.geoPointValue.latitude) === At(n.geoPointValue.latitude) && At(t.geoPointValue.longitude) === At(n.geoPointValue.longitude);
+            return Tt(t.geoPointValue.latitude) === Tt(n.geoPointValue.latitude) && Tt(t.geoPointValue.longitude) === Tt(n.geoPointValue.longitude);
         }(t, n);
 
       case 2 /* NumberValue */ :
         return function(t, n) {
-            if ("integerValue" in t && "integerValue" in n) return At(t.integerValue) === At(n.integerValue);
+            if ("integerValue" in t && "integerValue" in n) return Tt(t.integerValue) === Tt(n.integerValue);
             if ("doubleValue" in t && "doubleValue" in n) {
-                const e = At(t.doubleValue), r = At(n.doubleValue);
-                return e === r ? ut(e) === ut(r) : isNaN(e) && isNaN(r);
+                const e = Tt(t.doubleValue), r = Tt(n.doubleValue);
+                return e === r ? ot(e) === ot(r) : isNaN(e) && isNaN(r);
             }
             return !1;
         }(t, n);
 
       case 9 /* ArrayValue */ :
-        return pt(t.arrayValue.values || [], n.arrayValue.values || [], $t);
+        return mt(t.arrayValue.values || [], n.arrayValue.values || [], Dt);
 
       case 10 /* ObjectValue */ :
         return function(t, n) {
             const e = t.mapValue.fields || {}, r = n.mapValue.fields || {};
-            if (gt(e) !== gt(r)) return !1;
-            for (const t in e) if (e.hasOwnProperty(t) && (void 0 === r[t] || !$t(e[t], r[t]))) return !1;
+            if (_t(e) !== _t(r)) return !1;
+            for (const t in e) if (e.hasOwnProperty(t) && (void 0 === r[t] || !Dt(e[t], r[t]))) return !1;
             return !0;
         }
         /** Returns true if the ArrayValue contains the specified element. */ (t, n);
 
       default:
-        return g();
+        return _();
     }
 }
 
-function Ft(t, n) {
-    return void 0 !== (t.values || []).find((t => $t(t, n)));
+function $t(t, n) {
+    return void 0 !== (t.values || []).find((t => Dt(t, n)));
 }
 
-function St(t, n) {
-    const e = Dt(t), r = Dt(n);
-    if (e !== r) return mt(e, r);
+function Ft(t, n) {
+    const e = Nt(t), r = Nt(n);
+    if (e !== r) return wt(e, r);
     switch (e) {
       case 0 /* NullValue */ :
         return 0;
 
       case 1 /* BooleanValue */ :
-        return mt(t.booleanValue, n.booleanValue);
+        return wt(t.booleanValue, n.booleanValue);
 
       case 2 /* NumberValue */ :
         return function(t, n) {
-            const e = At(t.integerValue || t.doubleValue), r = At(n.integerValue || n.doubleValue);
+            const e = Tt(t.integerValue || t.doubleValue), r = Tt(n.integerValue || n.doubleValue);
             return e < r ? -1 : e > r ? 1 : e === r ? 0 : 
             // one or both are NaN.
             isNaN(e) ? isNaN(r) ? 0 : -1 : 1;
         }(t, n);
 
       case 3 /* TimestampValue */ :
-        return qt(t.timestampValue, n.timestampValue);
+        return St(t.timestampValue, n.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return qt(Nt(t), Nt(n));
+        return St(Vt(t), Vt(n));
 
       case 5 /* StringValue */ :
-        return mt(t.stringValue, n.stringValue);
+        return wt(t.stringValue, n.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, n) {
-            const e = Pt(t), r = Pt(n);
+            const e = At(t), r = At(n);
             return e.compareTo(r);
         }(t.bytesValue, n.bytesValue);
 
@@ -1731,27 +1734,27 @@ function St(t, n) {
         return function(t, n) {
             const e = t.split("/"), r = n.split("/");
             for (let t = 0; t < e.length && t < r.length; t++) {
-                const n = mt(e[t], r[t]);
+                const n = wt(e[t], r[t]);
                 if (0 !== n) return n;
             }
-            return mt(e.length, r.length);
+            return wt(e.length, r.length);
         }(t.referenceValue, n.referenceValue);
 
       case 8 /* GeoPointValue */ :
         return function(t, n) {
-            const e = mt(At(t.latitude), At(n.latitude));
+            const e = wt(Tt(t.latitude), Tt(n.latitude));
             if (0 !== e) return e;
-            return mt(At(t.longitude), At(n.longitude));
+            return wt(Tt(t.longitude), Tt(n.longitude));
         }(t.geoPointValue, n.geoPointValue);
 
       case 9 /* ArrayValue */ :
         return function(t, n) {
             const e = t.values || [], r = n.values || [];
             for (let t = 0; t < e.length && t < r.length; ++t) {
-                const n = St(e[t], r[t]);
+                const n = Ft(e[t], r[t]);
                 if (n) return n;
             }
-            return mt(e.length, r.length);
+            return wt(e.length, r.length);
         }(t.arrayValue, n.arrayValue);
 
       case 10 /* ObjectValue */ :
@@ -1763,49 +1766,49 @@ function St(t, n) {
             // canonical IDs are independent of insertion order.
             r.sort(), i.sort();
             for (let t = 0; t < r.length && t < i.length; ++t) {
-                const n = mt(r[t], i[t]);
+                const n = wt(r[t], i[t]);
                 if (0 !== n) return n;
-                const o = St(e[r[t]], s[i[t]]);
+                const o = Ft(e[r[t]], s[i[t]]);
                 if (0 !== o) return o;
             }
-            return mt(r.length, i.length);
+            return wt(r.length, i.length);
         }
         /** Returns a reference value for the provided database and key. */ (t.mapValue, n.mapValue);
 
       default:
-        throw g();
+        throw _();
     }
 }
 
-function qt(t, n) {
-    if ("string" == typeof t && "string" == typeof n && t.length === n.length) return mt(t, n);
-    const e = Tt(t), r = Tt(n), s = mt(e.seconds, r.seconds);
-    return 0 !== s ? s : mt(e.nanos, r.nanos);
+function St(t, n) {
+    if ("string" == typeof t && "string" == typeof n && t.length === n.length) return wt(t, n);
+    const e = It(t), r = It(n), s = wt(e.seconds, r.seconds);
+    return 0 !== s ? s : wt(e.nanos, r.nanos);
 }
 
-function xt(t, n) {
+function qt(t, n) {
     return {
         referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${n.path.canonicalString()}`
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Ot(t) {
+/** Returns true if `value` is an ArrayValue. */ function xt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Ct(t) {
+/** Returns true if `value` is a NullValue. */ function Ot(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function Lt(t) {
+/** Returns true if `value` is NaN. */ function Ct(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function Ut(t) {
+/** Returns true if `value` is a MapValue. */ function Lt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function jt(t) {
+/** Creates a deep copy of `source`. */ function Ut(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1818,7 +1821,7 @@ function xt(t, n) {
                 fields: {}
             }
         };
-        return bt(t.mapValue.fields, ((t, e) => n.mapValue.fields[t] = jt(e))), n;
+        return gt(t.mapValue.fields, ((t, e) => n.mapValue.fields[t] = Ut(e))), n;
     }
     if (t.arrayValue) {
         const n = {
@@ -1826,7 +1829,7 @@ function xt(t, n) {
                 values: []
             }
         };
-        for (let e = 0; e < (t.arrayValue.values || []).length; ++e) n.arrayValue.values[e] = jt(t.arrayValue.values[e]);
+        for (let e = 0; e < (t.arrayValue.values || []).length; ++e) n.arrayValue.values[e] = Ut(t.arrayValue.values[e]);
         return n;
     }
     return Object.assign({}, t);
@@ -1851,12 +1854,12 @@ function xt(t, n) {
 /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ class kt {
+ */ class jt {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new kt({
+        return new jt({
             mapValue: {}
         });
     }
@@ -1870,7 +1873,7 @@ function xt(t, n) {
         {
             let n = this.value;
             for (let e = 0; e < t.length - 1; ++e) if (n = (n.mapValue.fields || {})[t.get(e)], 
-            !Ut(n)) return null;
+            !Lt(n)) return null;
             return n = (n.mapValue.fields || {})[t.lastSegment()], n || null;
         }
     }
@@ -1880,21 +1883,21 @@ function xt(t, n) {
      * @param path - The field path to set.
      * @param value - The value to set.
      */    set(t, n) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = jt(n);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Ut(n);
     }
     /**
      * Sets the provided fields to the provided values.
      *
      * @param data - A map of fields to values (or null for deletes).
      */    setAll(t) {
-        let n = Z.emptyPath(), e = {}, r = [];
+        let n = J.emptyPath(), e = {}, r = [];
         t.forEach(((t, s) => {
             if (!n.isImmediateParentOf(s)) {
                 // Insert the accumulated changes at this parent location
                 const t = this.getFieldsMap(n);
                 this.applyChanges(t, e, r), e = {}, r = [], n = s.popLast();
             }
-            t ? e[s.lastSegment()] = jt(t) : r.push(s.lastSegment());
+            t ? e[s.lastSegment()] = Ut(t) : r.push(s.lastSegment());
         }));
         const s = this.getFieldsMap(n);
         this.applyChanges(s, e, r);
@@ -1906,10 +1909,10 @@ function xt(t, n) {
      * @param path - The field path to remove.
      */    delete(t) {
         const n = this.field(t.popLast());
-        Ut(n) && n.mapValue.fields && delete n.mapValue.fields[t.lastSegment()];
+        Lt(n) && n.mapValue.fields && delete n.mapValue.fields[t.lastSegment()];
     }
     isEqual(t) {
-        return $t(this.value, t.value);
+        return Dt(this.value, t.value);
     }
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -1921,7 +1924,7 @@ function xt(t, n) {
         });
         for (let e = 0; e < t.length; ++e) {
             let r = n.mapValue.fields[t.get(e)];
-            Ut(r) && r.mapValue.fields || (r = {
+            Lt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -1933,11 +1936,11 @@ function xt(t, n) {
      * Modifies `fieldsMap` by adding, replacing or deleting the specified
      * entries.
      */    applyChanges(t, n, e) {
-        bt(n, ((n, e) => t[n] = e));
+        gt(n, ((n, e) => t[n] = e));
         for (const n of e) delete t[n];
     }
     clone() {
-        return new kt(jt(this.value));
+        return new jt(Ut(this.value));
     }
 }
 
@@ -1966,7 +1969,7 @@ function xt(t, n) {
  * not transition to one of these states even after all mutations have been
  * applied, `isValidDocument()` returns false and the document should be removed
  * from all views.
- */ class Mt {
+ */ class kt {
     constructor(t, n, e, r, s) {
         this.key = t, this.documentType = n, this.version = e, this.data = r, this.documentState = s;
     }
@@ -1974,23 +1977,23 @@ function xt(t, n) {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new Mt(t, 0 /* INVALID */ , _t.min(), kt.empty(), 0 /* SYNCED */);
+        return new kt(t, 0 /* INVALID */ , yt.min(), jt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist with the given data at the
      * given version.
      */    static newFoundDocument(t, n, e) {
-        return new Mt(t, 1 /* FOUND_DOCUMENT */ , n, e, 0 /* SYNCED */);
+        return new kt(t, 1 /* FOUND_DOCUMENT */ , n, e, 0 /* SYNCED */);
     }
     /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, n) {
-        return new Mt(t, 2 /* NO_DOCUMENT */ , n, kt.empty(), 0 /* SYNCED */);
+        return new kt(t, 2 /* NO_DOCUMENT */ , n, jt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist at the given version but
      * whose data is not known (e.g. a document that was updated without a known
      * base document).
      */    static newUnknownDocument(t, n) {
-        return new Mt(t, 3 /* UNKNOWN_DOCUMENT */ , n, kt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new kt(t, 3 /* UNKNOWN_DOCUMENT */ , n, jt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2003,7 +2006,7 @@ function xt(t, n) {
      * Changes the document type to indicate that it doesn't exist at the given
      * version.
      */    convertToNoDocument(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = kt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = jt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }
     /**
@@ -2011,7 +2014,7 @@ function xt(t, n) {
      * that its data is not known (e.g. a document that was updated without a known
      * base document).
      */    convertToUnknownDocument(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = kt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = jt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasCommittedMutations() {
@@ -2042,10 +2045,10 @@ function xt(t, n) {
         return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
     }
     isEqual(t) {
-        return t instanceof Mt && 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 kt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
     }
     clone() {
-        return new Mt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
+        return new kt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
     }
     toString() {
         return `Document(${this.key}, ${this.version}, ${JSON.stringify(this.data.value)}, {documentType: ${this.documentType}}), {documentState: ${this.documentState}})`;
@@ -2069,7 +2072,7 @@ function xt(t, n) {
  * limitations under the License.
  */
 // Visible for testing
-class Bt {
+class Mt {
     constructor(t, n = null, e = [], r = [], s = null, i = null, o = null) {
         this.path = t, this.collectionGroup = n, this.orderBy = e, this.filters = r, this.limit = s, 
         this.startAt = i, this.endAt = o, this.P = null;
@@ -2083,26 +2086,26 @@ class Bt {
  * NOTE: you should always construct `Target` from `Query.toTarget` instead of
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
- */ function Qt(t, n = null, e = [], r = [], s = null, i = null, o = null) {
-    return new Bt(t, n, e, r, s, i, o);
+ */ function Bt(t, n = null, e = [], r = [], s = null, i = null, o = null) {
+    return new Mt(t, n, e, r, s, i, o);
 }
 
-class zt extends class {} {
+class Qt extends class {} {
     constructor(t, n, e) {
         super(), this.field = t, this.op = n, this.value = e;
     }
     /**
      * Creates a filter based on the provided arguments.
      */    static create(t, n, e) {
-        return t.isKeyField() ? "in" /* IN */ === n || "not-in" /* NOT_IN */ === n ? this.R(t, n, e) : new Wt(t, n, e) : "array-contains" /* ARRAY_CONTAINS */ === n ? new Kt(t, e) : "in" /* IN */ === n ? new Jt(t, e) : "not-in" /* NOT_IN */ === n ? new Zt(t, e) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === n ? new Xt(t, e) : new zt(t, n, e);
+        return t.isKeyField() ? "in" /* IN */ === n || "not-in" /* NOT_IN */ === n ? this.R(t, n, e) : new zt(t, n, e) : "array-contains" /* ARRAY_CONTAINS */ === n ? new Yt(t, e) : "in" /* IN */ === n ? new Kt(t, e) : "not-in" /* NOT_IN */ === n ? new Jt(t, e) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === n ? new Zt(t, e) : new Qt(t, n, e);
     }
     static R(t, n, e) {
-        return "in" /* IN */ === n ? new Gt(t, e) : new Ht(t, e);
+        return "in" /* IN */ === n ? new Wt(t, e) : new Gt(t, e);
     }
     matches(t) {
         const n = t.data.field(this.field);
         // Types do not have to match in NOT_EQUAL filters.
-                return "!=" /* NOT_EQUAL */ === this.op ? null !== n && this.V(St(n, this.value)) : null !== n && Dt(this.value) === Dt(n) && this.V(St(n, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== n && this.V(Ft(n, this.value)) : null !== n && Nt(this.value) === Nt(n) && this.V(Ft(n, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
     V(t) {
@@ -2126,7 +2129,7 @@ class zt extends class {} {
             return t >= 0;
 
           default:
-            return g();
+            return _();
         }
     }
     N() {
@@ -2135,79 +2138,79 @@ class zt extends class {} {
 }
 
 /** Filter that matches on key fields (i.e. '__name__'). */
-class Wt extends zt {
+class zt extends Qt {
     constructor(t, n, e) {
-        super(t, n, e), this.key = X.fromName(e.referenceValue);
+        super(t, n, e), this.key = Z.fromName(e.referenceValue);
     }
     matches(t) {
-        const n = X.comparator(t.key, this.key);
+        const n = Z.comparator(t.key, this.key);
         return this.V(n);
     }
 }
 
-/** Filter that matches on key fields within an array. */ class Gt extends zt {
+/** Filter that matches on key fields within an array. */ class Wt extends Qt {
     constructor(t, n) {
-        super(t, "in" /* IN */ , n), this.keys = Yt("in" /* IN */ , n);
+        super(t, "in" /* IN */ , n), this.keys = Ht("in" /* IN */ , n);
     }
     matches(t) {
         return this.keys.some((n => n.isEqual(t.key)));
     }
 }
 
-/** Filter that matches on key fields not present within an array. */ class Ht extends zt {
+/** Filter that matches on key fields not present within an array. */ class Gt extends Qt {
     constructor(t, n) {
-        super(t, "not-in" /* NOT_IN */ , n), this.keys = Yt("not-in" /* NOT_IN */ , n);
+        super(t, "not-in" /* NOT_IN */ , n), this.keys = Ht("not-in" /* NOT_IN */ , n);
     }
     matches(t) {
         return !this.keys.some((n => n.isEqual(t.key)));
     }
 }
 
-function Yt(t, n) {
+function Ht(t, n) {
     var e;
-    return ((null === (e = n.arrayValue) || void 0 === e ? void 0 : e.values) || []).map((t => X.fromName(t.referenceValue)));
+    return ((null === (e = n.arrayValue) || void 0 === e ? void 0 : e.values) || []).map((t => Z.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class Kt extends zt {
+/** A Filter that implements the array-contains operator. */ class Yt extends Qt {
     constructor(t, n) {
         super(t, "array-contains" /* ARRAY_CONTAINS */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return Ot(n) && Ft(n.arrayValue, this.value);
+        return xt(n) && $t(n.arrayValue, this.value);
     }
 }
 
-/** A Filter that implements the IN operator. */ class Jt extends zt {
+/** A Filter that implements the IN operator. */ class Kt extends Qt {
     constructor(t, n) {
         super(t, "in" /* IN */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return null !== n && Ft(this.value.arrayValue, n);
+        return null !== n && $t(this.value.arrayValue, n);
     }
 }
 
-/** A Filter that implements the not-in operator. */ class Zt extends zt {
+/** A Filter that implements the not-in operator. */ class Jt extends Qt {
     constructor(t, n) {
         super(t, "not-in" /* NOT_IN */ , n);
     }
     matches(t) {
-        if (Ft(this.value.arrayValue, {
+        if ($t(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         const n = t.data.field(this.field);
-        return null !== n && !Ft(this.value.arrayValue, n);
+        return null !== n && !$t(this.value.arrayValue, n);
     }
 }
 
-/** A Filter that implements the array-contains-any operator. */ class Xt extends zt {
+/** A Filter that implements the array-contains-any operator. */ class Zt extends Qt {
     constructor(t, n) {
         super(t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , n);
     }
     matches(t) {
         const n = t.data.field(this.field);
-        return !(!Ot(n) || !n.arrayValue.values) && n.arrayValue.values.some((t => Ft(this.value.arrayValue, t)));
+        return !(!xt(n) || !n.arrayValue.values) && n.arrayValue.values.some((t => $t(this.value.arrayValue, t)));
     }
 }
 
@@ -2224,7 +2227,7 @@ function Yt(t, n) {
  * Bound provides a function to determine whether a document comes before or
  * after a bound. This is influenced by whether the position is just before or
  * just after the provided values.
- */ class tn {
+ */ class Xt {
     constructor(t, n) {
         this.position = t, this.before = n;
     }
@@ -2232,22 +2235,22 @@ function Yt(t, n) {
 
 /**
  * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
- */ class nn {
+ */ class tn {
     constructor(t, n = "asc" /* ASCENDING */) {
         this.field = t, this.dir = n;
     }
 }
 
-function en(t, n) {
+function nn(t, n) {
     return t.dir === n.dir && t.field.isEqual(n.field);
 }
 
-function rn(t, n) {
+function en(t, n) {
     if (null === t) return null === n;
     if (null === n) return !1;
     if (t.before !== n.before || t.position.length !== n.position.length) return !1;
     for (let e = 0; e < t.position.length; e++) {
-        if (!$t(t.position[e], n.position[e])) return !1;
+        if (!Dt(t.position[e], n.position[e])) return !1;
     }
     return !0;
 }
@@ -2274,7 +2277,7 @@ function rn(t, n) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ class sn {
+ */ class rn {
     /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2287,15 +2290,15 @@ function rn(t, n) {
     }
 }
 
-/** Creates a new Query for a query that matches all documents at `path` */ function on(t) {
-    return !ot(t.limit) && "L" /* Last */ === t.limitType;
+/** Creates a new Query for a query that matches all documents at `path` */ function sn(t) {
+    return !it(t.limit) && "L" /* Last */ === t.limitType;
 }
 
-function un(t) {
+function on(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function cn(t) {
+function un(t) {
     for (const n of t.filters) if (n.N()) return n.field;
     return null;
 }
@@ -2308,7 +2311,7 @@ function cn(t) {
  * Returns whether the query matches a collection group rather than a specific
  * collection.
  */
-function an(t) {
+function cn(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2316,23 +2319,23 @@ function an(t) {
  * Returns the implicit order by constraint that is used to execute the Query,
  * which can be different from the order by constraints the user provided (e.g.
  * the SDK and backend always orders by `__name__`).
- */ function hn(t) {
-    const n = v(t);
+ */ function an(t) {
+    const n = b(t);
     if (null === n.D) {
         n.D = [];
-        const t = cn(n), e = un(n);
+        const t = un(n), e = on(n);
         if (null !== t && null === e) 
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
         // Note that the default inequality field and key ordering is ascending.
-        t.isKeyField() || n.D.push(new nn(t)), n.D.push(new nn(Z.keyField(), "asc" /* ASCENDING */)); else {
+        t.isKeyField() || n.D.push(new tn(t)), n.D.push(new tn(J.keyField(), "asc" /* ASCENDING */)); else {
             let t = !1;
             for (const e of n.explicitOrderBy) n.D.push(e), e.field.isKeyField() && (t = !0);
             if (!t) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 const t = n.explicitOrderBy.length > 0 ? n.explicitOrderBy[n.explicitOrderBy.length - 1].dir : "asc" /* ASCENDING */;
-                n.D.push(new nn(Z.keyField(), t));
+                n.D.push(new tn(J.keyField(), t));
             }
         }
     }
@@ -2341,34 +2344,34 @@ function an(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function ln(t) {
-    const n = v(t);
-    if (!n.$) if ("F" /* First */ === n.limitType) n.$ = Qt(n.path, n.collectionGroup, hn(n), n.filters, n.limit, n.startAt, n.endAt); else {
+ */ function hn(t) {
+    const n = b(t);
+    if (!n.$) if ("F" /* First */ === n.limitType) n.$ = Bt(n.path, n.collectionGroup, an(n), n.filters, n.limit, n.startAt, n.endAt); else {
         // Flip the orderBy directions since we want the last results
         const t = [];
-        for (const e of hn(n)) {
+        for (const e of an(n)) {
             const n = "desc" /* DESCENDING */ === e.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            t.push(new nn(e.field, n));
+            t.push(new tn(e.field, n));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                const e = n.endAt ? new tn(n.endAt.position, !n.endAt.before) : null, r = n.startAt ? new tn(n.startAt.position, !n.startAt.before) : null;
+                const e = n.endAt ? new Xt(n.endAt.position, !n.endAt.before) : null, r = n.startAt ? new Xt(n.startAt.position, !n.startAt.before) : null;
         // Now return as a LimitType.First query.
-        n.$ = Qt(n.path, n.collectionGroup, t, n.filters, n.limit, e, r);
+        n.$ = Bt(n.path, n.collectionGroup, t, n.filters, n.limit, e, r);
     }
     return n.$;
 }
 
-function fn(t, n) {
+function ln(t, n) {
     return function(t, n) {
         if (t.limit !== n.limit) return !1;
         if (t.orderBy.length !== n.orderBy.length) return !1;
-        for (let e = 0; e < t.orderBy.length; e++) if (!en(t.orderBy[e], n.orderBy[e])) return !1;
+        for (let e = 0; e < t.orderBy.length; e++) if (!nn(t.orderBy[e], n.orderBy[e])) return !1;
         if (t.filters.length !== n.filters.length) return !1;
         for (let s = 0; s < t.filters.length; s++) if (e = t.filters[s], r = n.filters[s], 
-        e.op !== r.op || !e.field.isEqual(r.field) || !$t(e.value, r.value)) return !1;
+        e.op !== r.op || !e.field.isEqual(r.field) || !Dt(e.value, r.value)) return !1;
         var e, r;
-        return t.collectionGroup === n.collectionGroup && !!t.path.isEqual(n.path) && !!rn(t.startAt, n.startAt) && rn(t.endAt, n.endAt);
-    }(ln(t), ln(n)) && t.limitType === n.limitType;
+        return t.collectionGroup === n.collectionGroup && !!t.path.isEqual(n.path) && !!en(t.startAt, n.startAt) && en(t.endAt, n.endAt);
+    }(hn(t), hn(n)) && t.limitType === n.limitType;
 }
 
 /**
@@ -2396,9 +2399,9 @@ function fn(t, n) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function dn(t, n) {
+function fn(t, n) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !ut(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !ot(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(n) ? 
     /**
  * Returns an IntegerValue for `value`.
@@ -2420,7 +2423,7 @@ function dn(t, n) {
             };
         }
         return {
-            doubleValue: ut(n) ? "-0" : n
+            doubleValue: ot(n) ? "-0" : n
         };
     }(t, n);
 }
@@ -2441,7 +2444,7 @@ function dn(t, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Used to represent a field transform on a mutation. */ class wn {
+/** Used to represent a field transform on a mutation. */ class dn {
     constructor() {
         // Make sure that the structural type of `TransformOperation` is unique.
         // See https://github.com/microsoft/TypeScript/issues/5451
@@ -2449,15 +2452,15 @@ function dn(t, n) {
     }
 }
 
-/** Transforms a value into a server-generated timestamp. */ class mn extends wn {}
+/** Transforms a value into a server-generated timestamp. */ class wn extends dn {}
 
-/** Transforms an array value via a union operation. */ class pn extends wn {
+/** Transforms an array value via a union operation. */ class mn extends dn {
     constructor(t) {
         super(), this.elements = t;
     }
 }
 
-/** Transforms an array value via a remove operation. */ class yn extends wn {
+/** Transforms an array value via a remove operation. */ class pn extends dn {
     constructor(t) {
         super(), this.elements = t;
     }
@@ -2468,7 +2471,7 @@ function dn(t, n) {
  * transforms. Converts all field values to integers or doubles, but unlike the
  * backend does not cap integer values at 2^63. Instead, JavaScript number
  * arithmetic is used and precision loss can occur for values greater than 2^53.
- */ class _n extends wn {
+ */ class yn extends dn {
     constructor(t, n) {
         super(), this.S = t, this.q = n;
     }
@@ -2490,7 +2493,7 @@ function dn(t, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** A field path and the TransformOperation to perform upon it. */ class gn {
+/** A field path and the TransformOperation to perform upon it. */ class _n {
     constructor(t, n) {
         this.field = t, this.transform = n;
     }
@@ -2500,18 +2503,18 @@ function dn(t, n) {
  * Encodes a precondition for a mutation. This follows the model that the
  * backend accepts with the special case of an explicit "empty" precondition
  * (meaning no precondition).
- */ class bn {
+ */ class gn {
     constructor(t, n) {
         this.updateTime = t, this.exists = n;
     }
     /** Creates a new empty Precondition. */    static none() {
-        return new bn;
+        return new gn;
     }
     /** Creates a new Precondition with an exists flag. */    static exists(t) {
-        return new bn(void 0, t);
+        return new gn(void 0, t);
     }
     /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {
-        return new bn(t);
+        return new gn(t);
     }
     /** Returns whether this Precondition is empty. */    get isNone() {
         return void 0 === this.updateTime && void 0 === this.exists;
@@ -2562,14 +2565,14 @@ function dn(t, n) {
  *
  * Every type of mutation needs to implement its own applyToRemoteDocument() and
  * applyToLocalView() to implement the actual behavior of applying the mutation
- * to some source document (see `applySetMutationToRemoteDocument()` for an
+ * to some source document (see `setMutationApplyToRemoteDocument()` for an
  * example).
- */ class vn {}
+ */ class bn {}
 
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class En extends vn {
+ */ class vn extends bn {
     constructor(t, n, e, r = []) {
         super(), this.key = t, this.value = n, this.precondition = e, this.fieldTransforms = r, 
         this.type = 0 /* Set */;
@@ -2588,14 +2591,14 @@ function dn(t, n) {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ class In extends vn {
+ */ class En extends bn {
     constructor(t, n, e, r, s = []) {
         super(), this.key = t, this.data = n, this.fieldMask = e, this.precondition = r, 
         this.fieldTransforms = s, this.type = 1 /* Patch */;
     }
 }
 
-/** A mutation that deletes the document at the given key. */ class Tn extends vn {
+/** A mutation that deletes the document at the given key. */ class In extends bn {
     constructor(t, n) {
         super(), this.key = t, this.precondition = n, this.type = 2 /* Delete */ , this.fieldTransforms = [];
     }
@@ -2607,7 +2610,7 @@ function dn(t, n) {
  *
  * The `verify` operation is only used in Transactions, and this class serves
  * primarily to facilitate serialization into protos.
- */ class An extends vn {
+ */ class Tn extends bn {
     constructor(t, n) {
         super(), this.key = t, this.precondition = n, this.type = 3 /* Verify */ , this.fieldTransforms = [];
     }
@@ -2628,13 +2631,13 @@ function dn(t, n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const Pn = (() => {
+ */ const An = (() => {
     const t = {
         asc: "ASCENDING",
         desc: "DESCENDING"
     };
     return t;
-})(), Rn = (() => {
+})(), Pn = (() => {
     const t = {
         "<": "LESS_THAN",
         "<=": "LESS_THAN_OR_EQUAL",
@@ -2664,7 +2667,7 @@ function dn(t, n) {
  * TODO(klimt): We can remove the databaseId argument if we keep the full
  * resource name in documents.
  */
-class Vn {
+class Rn {
     constructor(t, n) {
         this.databaseId = t, this.F = n;
     }
@@ -2681,7 +2684,7 @@ class Vn {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Nn(t, n) {
+function Vn(t, n) {
     if (t.F) {
         return `${new Date(1e3 * n.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + n.nanoseconds).slice(-9)}Z`;
     }
@@ -2696,129 +2699,129 @@ function Nn(t, n) {
  *
  * Visible for testing.
  */
-function Dn(t, n) {
+function Nn(t, n) {
     return t.F ? n.toBase64() : n.toUint8Array();
 }
 
-function $n(t, n) {
-    return Nn(t, n.toTimestamp());
+function Dn(t, n) {
+    return Vn(t, n.toTimestamp());
 }
 
-function Fn(t) {
-    return b(!!t), _t.fromTimestamp(function(t) {
-        const n = Tt(t);
-        return new yt(n.seconds, n.nanos);
+function $n(t) {
+    return g(!!t), yt.fromTimestamp(function(t) {
+        const n = It(t);
+        return new pt(n.seconds, n.nanos);
     }(t));
 }
 
-function Sn(t, n) {
+function Fn(t, n) {
     return function(t) {
-        return new K([ "projects", t.projectId, "databases", t.database ]);
+        return new Y([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(n).canonicalString();
 }
 
-function qn(t, n) {
-    return Sn(t.databaseId, n.path);
+function Sn(t, n) {
+    return Fn(t.databaseId, n.path);
 }
 
-function xn(t, n) {
+function qn(t, n) {
     const e = function(t) {
-        const n = K.fromString(t);
-        return b(Gn(n)), n;
+        const n = Y.fromString(t);
+        return g(Wn(n)), n;
     }(n);
-    if (e.get(1) !== t.databaseId.projectId) throw new U(A, "Tried to deserialize key from different project: " + e.get(1) + " vs " + t.databaseId.projectId);
-    if (e.get(3) !== t.databaseId.database) throw new U(A, "Tried to deserialize key from different database: " + e.get(3) + " vs " + t.databaseId.database);
-    return new X((b((r = e).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
+    if (e.get(1) !== t.databaseId.projectId) throw new L(T, "Tried to deserialize key from different project: " + e.get(1) + " vs " + t.databaseId.projectId);
+    if (e.get(3) !== t.databaseId.database) throw new L(T, "Tried to deserialize key from different database: " + e.get(3) + " vs " + t.databaseId.database);
+    return new Z((g((r = e).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
     var r;
     /** Creates a Document proto from key and fields (but no create/update time) */}
 
-function On(t, n) {
-    return Sn(t.databaseId, n);
+function xn(t, n) {
+    return Fn(t.databaseId, n);
 }
 
-function Cn(t) {
-    return new K([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
+function On(t) {
+    return new Y([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Ln(t, n, e) {
+function Cn(t, n, e) {
     return {
-        name: qn(t, n),
+        name: Sn(t, n),
         fields: e.value.mapValue.fields
     };
 }
 
-function Un(t, n) {
+function Ln(t, n) {
     return "found" in n ? function(t, n) {
-        b(!!n.found), n.found.name, n.found.updateTime;
-        const e = xn(t, n.found.name), r = Fn(n.found.updateTime), s = new kt({
+        g(!!n.found), n.found.name, n.found.updateTime;
+        const e = qn(t, n.found.name), r = $n(n.found.updateTime), s = new jt({
             mapValue: {
                 fields: n.found.fields
             }
         });
-        return Mt.newFoundDocument(e, r, s);
+        return kt.newFoundDocument(e, r, s);
     }(t, n) : "missing" in n ? function(t, n) {
-        b(!!n.missing), b(!!n.readTime);
-        const e = xn(t, n.missing), r = Fn(n.readTime);
-        return Mt.newNoDocument(e, r);
-    }(t, n) : g();
+        g(!!n.missing), g(!!n.readTime);
+        const e = qn(t, n.missing), r = $n(n.readTime);
+        return kt.newNoDocument(e, r);
+    }(t, n) : _();
 }
 
-function jn(t, n) {
+function Un(t, n) {
     let e;
-    if (n instanceof En) e = {
-        update: Ln(t, n.key, n.value)
-    }; else if (n instanceof Tn) e = {
-        delete: qn(t, n.key)
+    if (n instanceof vn) e = {
+        update: Cn(t, n.key, n.value)
     }; else if (n instanceof In) e = {
-        update: Ln(t, n.key, n.data),
-        updateMask: Wn(n.fieldMask)
+        delete: Sn(t, n.key)
+    }; else if (n instanceof En) e = {
+        update: Cn(t, n.key, n.data),
+        updateMask: zn(n.fieldMask)
     }; else {
-        if (!(n instanceof An)) return g();
+        if (!(n instanceof Tn)) return _();
         e = {
-            verify: qn(t, n.key)
+            verify: Sn(t, n.key)
         };
     }
     return n.fieldTransforms.length > 0 && (e.updateTransforms = n.fieldTransforms.map((t => function(t, n) {
         const e = n.transform;
-        if (e instanceof mn) return {
+        if (e instanceof wn) return {
             fieldPath: n.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
-        if (e instanceof pn) return {
+        if (e instanceof mn) return {
             fieldPath: n.field.canonicalString(),
             appendMissingElements: {
                 values: e.elements
             }
         };
-        if (e instanceof yn) return {
+        if (e instanceof pn) return {
             fieldPath: n.field.canonicalString(),
             removeAllFromArray: {
                 values: e.elements
             }
         };
-        if (e instanceof _n) return {
+        if (e instanceof yn) return {
             fieldPath: n.field.canonicalString(),
             increment: e.q
         };
-        throw g();
+        throw _();
     }(0, t)))), n.precondition.isNone || (e.currentDocument = function(t, n) {
         return void 0 !== n.updateTime ? {
-            updateTime: $n(t, n.updateTime)
+            updateTime: Dn(t, n.updateTime)
         } : void 0 !== n.exists ? {
             exists: n.exists
-        } : g();
+        } : _();
     }(t, n.precondition)), e;
 }
 
-function kn(t, n) {
+function jn(t, n) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const e = {
         structuredQuery: {}
     }, r = n.path;
-    null !== n.collectionGroup ? (e.parent = On(t, r), e.structuredQuery.from = [ {
+    null !== n.collectionGroup ? (e.parent = xn(t, r), e.structuredQuery.from = [ {
         collectionId: n.collectionGroup,
         allDescendants: !0
-    } ]) : (e.parent = On(t, r.popLast()), e.structuredQuery.from = [ {
+    } ]) : (e.parent = xn(t, r.popLast()), e.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     const s = function(t) {
@@ -2827,36 +2830,36 @@ function kn(t, n) {
         // visible for testing
         function(t) {
             if ("==" /* EQUAL */ === t.op) {
-                if (Lt(t.value)) return {
+                if (Ct(t.value)) return {
                     unaryFilter: {
-                        field: zn(t.field),
+                        field: Qn(t.field),
                         op: "IS_NAN"
                     }
                 };
-                if (Ct(t.value)) return {
+                if (Ot(t.value)) return {
                     unaryFilter: {
-                        field: zn(t.field),
+                        field: Qn(t.field),
                         op: "IS_NULL"
                     }
                 };
             } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                if (Lt(t.value)) return {
+                if (Ct(t.value)) return {
                     unaryFilter: {
-                        field: zn(t.field),
+                        field: Qn(t.field),
                         op: "IS_NOT_NAN"
                     }
                 };
-                if (Ct(t.value)) return {
+                if (Ot(t.value)) return {
                     unaryFilter: {
-                        field: zn(t.field),
+                        field: Qn(t.field),
                         op: "IS_NOT_NULL"
                     }
                 };
             }
             return {
                 fieldFilter: {
-                    field: zn(t.field),
-                    op: Qn(t.op),
+                    field: Qn(t.field),
+                    op: Bn(t.op),
                     value: t.value
                 }
             };
@@ -2876,22 +2879,22 @@ function kn(t, n) {
         // visible for testing
         function(t) {
             return {
-                field: zn(t.field),
-                direction: Bn(t.dir)
+                field: Qn(t.field),
+                direction: Mn(t.dir)
             };
         }(t)));
     }(n.orderBy);
     i && (e.structuredQuery.orderBy = i);
     const o = function(t, n) {
-        return t.F || ot(n) ? n : {
+        return t.F || it(n) ? n : {
             value: n
         };
     }(t, n.limit);
-    return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = Mn(n.startAt)), 
-    n.endAt && (e.structuredQuery.endAt = Mn(n.endAt)), e;
+    return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = kn(n.startAt)), 
+    n.endAt && (e.structuredQuery.endAt = kn(n.endAt)), e;
 }
 
-function Mn(t) {
+function kn(t) {
     return {
         before: t.before,
         values: t.position
@@ -2899,29 +2902,29 @@ function Mn(t) {
 }
 
 // visible for testing
-function Bn(t) {
-    return Pn[t];
+function Mn(t) {
+    return An[t];
 }
 
 // visible for testing
-function Qn(t) {
-    return Rn[t];
+function Bn(t) {
+    return Pn[t];
 }
 
-function zn(t) {
+function Qn(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Wn(t) {
+function zn(t) {
     const n = [];
     return t.fields.forEach((t => n.push(t.canonicalString()))), {
         fieldPaths: n
     };
 }
 
-function Gn(t) {
+function Wn(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2941,8 +2944,8 @@ function Gn(t) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function Hn(t) {
-    return new Vn(t, /* useProto3Json= */ !0);
+ */ function Gn(t) {
+    return new Rn(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -2970,7 +2973,7 @@ function Gn(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class Yn {
+class Hn {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3025,7 +3028,7 @@ class Yn {
         // honored as such).
         const n = Math.floor(this.j + this.G()), e = Math.max(0, Date.now() - this.M), r = Math.max(0, n - e);
         // Guard against lastAttemptTime being in the future due to a clock change.
-                r > 0 && m("ExponentialBackoff", `Backing off for ${r} ms (base delay: ${this.j} ms, delay with jitter: ${n} ms, last attempt: ${e} ms ago)`), 
+                r > 0 && w("ExponentialBackoff", `Backing off for ${r} ms (base delay: ${this.j} ms, delay with jitter: ${n} ms, last attempt: ${e} ms ago)`), 
         this.k = this.O.enqueueAfterDelay(this.timerId, r, (() => (this.M = Date.now(), 
         t()))), 
         // Apply backoff factor to determine next delay and ensure it is within
@@ -3068,23 +3071,23 @@ class Yn {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class Kn extends class {} {
+class Yn extends class {} {
     constructor(t, n, e) {
         super(), this.credentials = t, this.Y = n, this.S = e, this.K = !1;
     }
     J() {
-        if (this.K) throw new U(F, "The client has already been terminated.");
+        if (this.K) throw new L($, "The client has already been terminated.");
     }
     /** Gets an auth token and invokes the provided RPC. */    l(t, n, e) {
         return this.J(), this.credentials.getToken().then((r => this.Y.l(t, n, e, r))).catch((t => {
-            throw "FirebaseError" === t.name ? (t.code === D && this.credentials.invalidateToken(), 
-            t) : new U(T, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === N && this.credentials.invalidateToken(), 
+            t) : new L(I, t.toString());
         }));
     }
     /** Gets an auth token and invokes the provided RPC with streamed results. */    v(t, n, e) {
         return this.J(), this.credentials.getToken().then((r => this.Y.v(t, n, e, r))).catch((t => {
-            throw "FirebaseError" === t.name ? (t.code === D && this.credentials.invalidateToken(), 
-            t) : new U(T, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === N && this.credentials.invalidateToken(), 
+            t) : new L(I, t.toString());
         }));
     }
     terminate() {
@@ -3094,38 +3097,38 @@ class Kn extends class {} {
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function Jn(t, n) {
-    const e = v(t), r = Cn(e.S) + "/documents", s = {
-        writes: n.map((t => jn(e.S, t)))
+async function Kn(t, n) {
+    const e = b(t), r = On(e.S) + "/documents", s = {
+        writes: n.map((t => Un(e.S, t)))
     };
     await e.l("Commit", r, s);
 }
 
-async function Zn(t, n) {
-    const e = v(t), r = Cn(e.S) + "/documents", s = {
-        documents: n.map((t => qn(e.S, t)))
+async function Jn(t, n) {
+    const e = b(t), r = On(e.S) + "/documents", s = {
+        documents: n.map((t => Sn(e.S, t)))
     }, i = await e.v("BatchGetDocuments", r, s), o = new Map;
     i.forEach((t => {
-        const n = Un(e.S, t);
+        const n = Ln(e.S, t);
         o.set(n.key.toString(), n);
     }));
     const u = [];
     return n.forEach((t => {
         const n = o.get(t.toString());
-        b(!!n), u.push(n);
+        g(!!n), u.push(n);
     })), u;
 }
 
-async function Xn(t, n) {
-    const e = v(t), r = kn(e.S, ln(n));
+async function Zn(t, n) {
+    const e = b(t), r = jn(e.S, hn(n));
     return (await e.v("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, n, e) {
-        const r = xn(t, n.name), s = Fn(n.updateTime), i = new kt({
+        const r = qn(t, n.name), s = $n(n.updateTime), i = new jt({
             mapValue: {
                 fields: n.fields
             }
-        }), o = Mt.newFoundDocument(r, s, i);
+        }), o = kt.newFoundDocument(r, s, i);
         return e && o.setHasCommittedMutations(), e ? o.setHasCommittedMutations() : o;
     }(e.S, t.document, void 0)));
 }
@@ -3145,7 +3148,7 @@ async function Xn(t, n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const te = new Map;
+ */ const Xn = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3156,17 +3159,17 @@ async function Xn(t, n) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function ne(t) {
-    if (t._terminated) throw new U(F, "The client has already been terminated.");
-    if (!te.has(t)) {
-        m("ComponentProvider", "Initializing Datastore");
+function te(t) {
+    if (t._terminated) throw new L($, "The client has already been terminated.");
+    if (!Xn.has(t)) {
+        w("ComponentProvider", "Initializing Datastore");
         const i = function(t) {
-            return new ft(t, fetch.bind(null));
+            return new lt(t, fetch.bind(null));
         }((n = t._databaseId, e = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
-        new G(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Hn(t._databaseId), u = function(t, n, e) {
-            return new Kn(t, n, e);
+        new W(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Gn(t._databaseId), u = function(t, n, e) {
+            return new Yn(t, n, e);
         }(t._credentials, i, o);
-        te.set(t, u);
+        Xn.set(t, u);
     }
     var n, e, r, s;
     /**
@@ -3184,7 +3187,7 @@ function ne(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 te.get(t);
+ */    return Xn.get(t);
 }
 
 /**
@@ -3196,21 +3199,21 @@ function ne(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 ee {
+class ne {
     constructor(t) {
         var n;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new U(A, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new L(T, "Can't provide ssl option if host option is not set");
             this.host = "firestore.googleapis.com", this.ssl = true;
         } else this.host = t.host, this.ssl = null === (n = t.ssl) || void 0 === n || n;
         if (this.credentials = t.credentials, this.ignoreUndefinedProperties = !!t.ignoreUndefinedProperties, 
         void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
-            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new U(A, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new L(T, "cacheSizeBytes must be at least 1048576");
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
         this.useFetchStreams = !!t.useFetchStreams, function(t, n, e, r) {
-            if (!0 === n && !0 === r) throw new U(A, `${t} and ${e} cannot be used together.`);
+            if (!0 === n && !0 === r) throw new L(T, `${t} and ${e} cannot be used together.`);
         }("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
     }
     isEqual(t) {
@@ -3238,18 +3241,18 @@ class ee {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class re {
+ */ class ee {
     /** @hideconstructor */
     constructor(t, n) {
         this._credentials = n, 
         /**
          * Whether it's a Firestore or Firestore Lite instance.
          */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new ee({}), 
-        this._settingsFrozen = !1, t instanceof H ? this._databaseId = t : (this._app = t, 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new ne({}), 
+        this._settingsFrozen = !1, t instanceof G ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
-            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(A, '"projectId" not provided in firebase.initializeApp.');
-            return new H(t.options.projectId);
+            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new L(T, '"projectId" not provided in firebase.initializeApp.');
+            return new G(t.options.projectId);
         }
         /**
  * Initializes a new instance of Cloud Firestore with the provided settings.
@@ -3267,7 +3270,7 @@ class ee {
      * The {@link @firebase/app#FirebaseApp} associated with this `Firestore` service
      * instance.
      */    get app() {
-        if (!this._app) throw new U(F, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+        if (!this._app) throw new L($, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
         return this._app;
     }
     get _initialized() {
@@ -3277,21 +3280,21 @@ class ee {
         return void 0 !== this._terminateTask;
     }
     _setSettings(t) {
-        if (this._settingsFrozen) throw new U(F, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
-        this._settings = new ee(t), void 0 !== t.credentials && (this._credentials = function(t) {
-            if (!t) return new M;
+        if (this._settingsFrozen) throw new L($, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
+        this._settings = new ne(t), void 0 !== t.credentials && (this._credentials = function(t) {
+            if (!t) return new k;
             switch (t.type) {
               case "gapi":
                 const n = t.client;
                 // Make sure this really is a Gapi client.
-                                return b(!("object" != typeof n || null === n || !n.auth || !n.auth.getAuthHeaderValueForFirstParty)), 
-                new W(n, t.sessionIndex || "0", t.iamToken || null);
+                                return g(!("object" != typeof n || null === n || !n.auth || !n.auth.getAuthHeaderValueForFirstParty)), 
+                new z(n, t.sessionIndex || "0", t.iamToken || null);
 
               case "provider":
                 return t.client;
 
               default:
-                throw new U(A, "makeCredentialsProvider failed due to invalid credential type");
+                throw new L(T, "makeCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }
@@ -3319,17 +3322,17 @@ class ee {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const n = te.get(t);
-            n && (m("ComponentProvider", "Removing Datastore"), te.delete(t), n.terminate());
+            const n = Xn.get(t);
+            n && (w("ComponentProvider", "Removing Datastore"), Xn.delete(t), n.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function se(n, e) {
-    const r = t(n, "firestore/lite");
-    if (r.isInitialized()) throw new U(F, "Firestore can only be initialized once per app.");
-    return r.initialize({
-        options: e
+function re(t, n) {
+    const e = _getProvider(t, "firestore/lite");
+    if (e.isInitialized()) throw new L($, "Firestore can only be initialized once per app.");
+    return e.initialize({
+        options: n
     });
 }
 
@@ -3341,8 +3344,8 @@ function se(n, e) {
  * @param app - The {@link @firebase/app#FirebaseApp} instance that the returned `Firestore`
  * instance is associated with.
  * @returns The `Firestore` instance of the provided app.
- */ function ie(e = n()) {
-    return t(e, "firestore/lite").getImmediate();
+ */ function se(n = t()) {
+    return _getProvider(n, "firestore/lite").getImmediate();
 }
 
 /**
@@ -3357,24 +3360,24 @@ function se(n, e) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function oe(t, n, e, r = {}) {
+ */ function ie(t, n, e, r = {}) {
     var s;
-    const i = (t = st(t, re))._getSettings();
-    if ("firestore.googleapis.com" !== i.host && i.host !== n && y("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
+    const i = (t = rt(t, ee))._getSettings();
+    if ("firestore.googleapis.com" !== i.host && i.host !== n && p("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, i), {
         host: `${n}:${e}`,
         ssl: !1
     })), r.mockUserToken) {
         let n, e;
-        if ("string" == typeof r.mockUserToken) n = r.mockUserToken, e = l.MOCK_USER; else {
+        if ("string" == typeof r.mockUserToken) n = r.mockUserToken, e = h.MOCK_USER; else {
             // Let createMockUserToken validate first (catches common mistakes like
             // invalid field "uid" and missing field "sub" / "user_id".)
-            n = a(r.mockUserToken, null === (s = t._app) || void 0 === s ? void 0 : s.options.projectId);
+            n = c(r.mockUserToken, null === (s = t._app) || void 0 === s ? void 0 : s.options.projectId);
             const i = r.mockUserToken.sub || r.mockUserToken.user_id;
-            if (!i) throw new U(A, "mockUserToken must contain 'sub' or 'user_id' field!");
-            e = new l(i);
+            if (!i) throw new L(T, "mockUserToken must contain 'sub' or 'user_id' field!");
+            e = new h(i);
         }
-        t._credentials = new B(new k(n, e));
+        t._credentials = new M(new j(n, e));
     }
 }
 
@@ -3397,8 +3400,8 @@ function se(n, e) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function ue(t) {
-    return t = st(t, re), e(t.app, "firestore/lite"), t._delete();
+ */ function oe(t) {
+    return t = rt(t, ee), n(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3438,7 +3441,7 @@ function se(n, e) {
  * and can be used to write, read, or listen to the location. The document at
  * the referenced location may or may not exist.
  */
-class ce {
+class ue {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -3466,17 +3469,17 @@ class ce {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new he(this.firestore, this.converter, this._key.path.popLast());
+        return new ae(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new ce(this.firestore, t, this._key);
+        return new ue(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 ae {
+ */ class ce {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -3489,17 +3492,17 @@ class ce {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new ae(this.firestore, t, this._query);
+        return new ce(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 he extends ae {
+ */ class ae extends ce {
     /** @hideconstructor */
     constructor(t, n, e) {
-        super(t, n, new sn(e)), this._path = e, 
+        super(t, n, new rn(e)), this._path = e, 
         /** The type of this Firestore reference. */
         this.type = "collection";
     }
@@ -3517,23 +3520,23 @@ class ce {
      * subcollection. If this isn't a subcollection, the reference is null.
      */    get parent() {
         const t = this._path.popLast();
-        return t.isEmpty() ? null : new ce(this.firestore, 
-        /* converter= */ null, new X(t));
+        return t.isEmpty() ? null : new ue(this.firestore, 
+        /* converter= */ null, new Z(t));
     }
     withConverter(t) {
-        return new he(this.firestore, t, this._path);
+        return new ae(this.firestore, t, this._path);
     }
 }
 
-function le(t, n, ...e) {
-    if (t = h(t), tt("collection", "path", n), t instanceof re) {
-        const r = K.fromString(n, ...e);
-        return et(r), new he(t, /* converter= */ null, r);
+function he(t, n, ...e) {
+    if (t = a(t), X("collection", "path", n), t instanceof ee) {
+        const r = Y.fromString(n, ...e);
+        return nt(r), new ae(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof ce || t instanceof he)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-        const r = K.fromString(t.path, ...e).child(K.fromString(n));
-        return et(r), new he(t.firestore, 
+        if (!(t instanceof ue || t instanceof ae)) throw new L(T, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        const r = t._path.child(Y.fromString(n, ...e));
+        return nt(r), new ae(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -3550,32 +3553,32 @@ function le(t, n, ...e) {
  * collection or subcollection with this ID as the last segment of its path
  * will be included. Cannot contain a slash.
  * @returns The created `Query`.
- */ function fe(t, n) {
-    if (t = st(t, re), tt("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new U(A, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new ae(t, 
+ */ function le(t, n) {
+    if (t = rt(t, ee), X("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new L(T, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new ce(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 sn(K.emptyPath(), t);
+        return new rn(Y.emptyPath(), t);
     }(n));
 }
 
-function de(t, n, ...e) {
-    if (t = h(t), 
+function fe(t, n, ...e) {
+    if (t = a(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (n = wt.A()), tt("doc", "path", n), t instanceof re) {
-        const r = K.fromString(n, ...e);
-        return nt(r), new ce(t, 
-        /* converter= */ null, new X(r));
+    1 === arguments.length && (n = dt.A()), X("doc", "path", n), t instanceof ee) {
+        const r = Y.fromString(n, ...e);
+        return tt(r), new ue(t, 
+        /* converter= */ null, new Z(r));
     }
     {
-        if (!(t instanceof ce || t instanceof he)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-        const r = t._path.child(K.fromString(n, ...e));
-        return nt(r), new ce(t.firestore, t instanceof he ? t.converter : null, new X(r));
+        if (!(t instanceof ue || t instanceof ae)) throw new L(T, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        const r = t._path.child(Y.fromString(n, ...e));
+        return tt(r), new ue(t.firestore, t instanceof ae ? t.converter : null, new Z(r));
     }
 }
 
@@ -3586,8 +3589,8 @@ function de(t, n, ...e) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function we(t, n) {
-    return t = h(t), n = h(n), (t instanceof ce || t instanceof he) && (n instanceof ce || n instanceof he) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
+ */ function de(t, n) {
+    return t = a(t), n = a(n), (t instanceof ue || t instanceof ae) && (n instanceof ue || n instanceof ae) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
 }
 
 /**
@@ -3598,8 +3601,8 @@ function de(t, n, ...e) {
  * @param right - A `Query` to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function me(t, n) {
-    return t = h(t), n = h(n), t instanceof ae && n instanceof ae && (t.firestore === n.firestore && fn(t._query, n._query) && t.converter === n.converter);
+ */ function we(t, n) {
+    return t = a(t), n = a(n), t instanceof ce && n instanceof ce && (t.firestore === n.firestore && ln(t._query, n._query) && t.converter === n.converter);
 }
 
 /**
@@ -3625,7 +3628,7 @@ function de(t, n, ...e) {
  *
  * Create a `FieldPath` by providing field names. If more than one field
  * name is provided, the path will point to a nested field in a document.
- */ class pe {
+ */ class me {
     /**
      * 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.
@@ -3633,8 +3636,8 @@ function de(t, n, ...e) {
      * @param fieldNames - A list of field names.
      */
     constructor(...t) {
-        for (let n = 0; n < t.length; ++n) if (0 === t[n].length) throw new U(A, "Invalid field name at argument $(i + 1). Field names must not be empty.");
-        this._internalPath = new Z(t);
+        for (let n = 0; n < t.length; ++n) if (0 === t[n].length) throw new L(T, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        this._internalPath = new J(t);
     }
     /**
      * Returns true if this `FieldPath` is equal to the provided one.
@@ -3649,8 +3652,8 @@ function de(t, n, ...e) {
 /**
  * Returns a special sentinel `FieldPath` to refer to the ID of a document.
  * It can be used in queries to sort or filter by the document ID.
- */ function ye() {
-    return new pe("__name__");
+ */ function pe() {
+    return new me("__name__");
 }
 
 /**
@@ -3671,7 +3674,7 @@ function de(t, n, ...e) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class _e {
+ */ class ye {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -3683,9 +3686,9 @@ function de(t, n, ...e) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new _e(Et.fromBase64String(t));
+            return new ye(vt.fromBase64String(t));
         } catch (t) {
-            throw new U(A, "Failed to construct data from Base64 string: " + t);
+            throw new L(T, "Failed to construct data from Base64 string: " + t);
         }
     }
     /**
@@ -3693,7 +3696,7 @@ function de(t, n, ...e) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new _e(Et.fromUint8Array(t));
+        return new ye(vt.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3745,7 +3748,7 @@ function de(t, n, ...e) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class ge {
+ */ class _e {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -3777,7 +3780,7 @@ function de(t, n, ...e) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ class be {
+ */ class ge {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3785,8 +3788,8 @@ function de(t, n, ...e) {
      * @param longitude - The longitude as number between -180 and 180.
      */
     constructor(t, n) {
-        if (!isFinite(t) || t < -90 || t > 90) throw new U(A, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(n) || n < -180 || n > 180) throw new U(A, "Longitude must be a number between -180 and 180, but was: " + n);
+        if (!isFinite(t) || t < -90 || t > 90) throw new L(T, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(n) || n < -180 || n > 180) throw new L(T, "Longitude must be a number between -180 and 180, but was: " + n);
         this._lat = t, this._long = n;
     }
     /**
@@ -3817,7 +3820,7 @@ function de(t, n, ...e) {
      * Actually private to JS consumers of our API, so this function is prefixed
      * with an underscore.
      */    _compareTo(t) {
-        return mt(this._lat, t._lat) || mt(this._long, t._long);
+        return wt(this._lat, t._lat) || wt(this._long, t._long);
     }
 }
 
@@ -3836,29 +3839,29 @@ function de(t, n, ...e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const ve = /^__.*__$/;
+ */ const be = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class Ee {
+/** The result of parsing document data (e.g. for a setData call). */ class ve {
     constructor(t, n, e) {
         this.data = t, this.fieldMask = n, this.fieldTransforms = e;
     }
     toMutation(t, n) {
-        return null !== this.fieldMask ? new In(t, this.data, this.fieldMask, n, this.fieldTransforms) : new En(t, this.data, n, this.fieldTransforms);
+        return null !== this.fieldMask ? new En(t, this.data, this.fieldMask, n, this.fieldTransforms) : new vn(t, this.data, n, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class Ie {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class Ee {
     constructor(t, 
     // The fieldMask does not include document transforms.
     n, e) {
         this.data = t, this.fieldMask = n, this.fieldTransforms = e;
     }
     toMutation(t, n) {
-        return new In(t, this.data, this.fieldMask, n, this.fieldTransforms);
+        return new En(t, this.data, this.fieldMask, n, this.fieldTransforms);
     }
 }
 
-function Te(t) {
+function Ie(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3872,11 +3875,11 @@ function Te(t) {
         return !1;
 
       default:
-        throw g();
+        throw _();
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class Ae {
+/** A "context" object passed around while parsing user data. */ class Te {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3908,7 +3911,7 @@ function Te(t) {
         return this.settings.X;
     }
     /** Returns a new context with the specified settings overwritten. */    tt(t) {
-        return new Ae(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.S, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+        return new Te(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.S, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
     nt(t) {
         var n;
@@ -3935,7 +3938,7 @@ function Te(t) {
         });
     }
     ot(t) {
-        return ze(t, this.settings.methodName, this.settings.ut || !1, this.path, this.settings.ct);
+        return Qe(t, this.settings.methodName, this.settings.ut || !1, this.path, this.settings.ct);
     }
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */    contains(t) {
         return void 0 !== this.fieldMask.find((n => t.isPrefixOf(n))) || void 0 !== this.fieldTransforms.find((n => t.isPrefixOf(n.field)));
@@ -3947,52 +3950,52 @@ function Te(t) {
     }
     rt(t) {
         if (0 === t.length) throw this.ot("Document fields must not be empty");
-        if (Te(this.X) && ve.test(t)) throw this.ot('Document fields cannot begin and end with "__"');
+        if (Ie(this.X) && be.test(t)) throw this.ot('Document fields cannot begin and end with "__"');
     }
 }
 
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ class Pe {
+ */ class Ae {
     constructor(t, n, e) {
-        this.databaseId = t, this.ignoreUndefinedProperties = n, this.S = e || Hn(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = n, this.S = e || Gn(t);
     }
     /** Creates a new top-level parse context. */    at(t, n, e, r = !1) {
-        return new Ae({
+        return new Te({
             X: t,
             methodName: n,
             ct: e,
-            path: Z.emptyPath(),
+            path: J.emptyPath(),
             et: !1,
             ut: r
         }, this.databaseId, this.S, this.ignoreUndefinedProperties);
     }
 }
 
-function Re(t) {
-    const n = t._freezeSettings(), e = Hn(t._databaseId);
-    return new Pe(t._databaseId, !!n.ignoreUndefinedProperties, e);
+function Pe(t) {
+    const n = t._freezeSettings(), e = Gn(t._databaseId);
+    return new Ae(t._databaseId, !!n.ignoreUndefinedProperties, e);
 }
 
-/** Parse document data from a set() call. */ function Ve(t, n, e, r, s, i = {}) {
+/** Parse document data from a set() call. */ function Re(t, n, e, r, s, i = {}) {
     const o = t.at(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , n, e, s);
-    ke("Data must be an object, but it was:", o, r);
-    const u = Ue(r, o);
+    je("Data must be an object, but it was:", o, r);
+    const u = Le(r, o);
     let c, a;
-    if (i.merge) c = new vt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
+    if (i.merge) c = new bt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
         const t = [];
         for (const r of i.mergeFields) {
-            const s = Me(n, r, e);
-            if (!o.contains(s)) throw new U(A, `Field '${s}' is specified in your field mask but missing from your input data.`);
-            We(t, s) || t.push(s);
+            const s = ke(n, r, e);
+            if (!o.contains(s)) throw new L(T, `Field '${s}' is specified in your field mask but missing from your input data.`);
+            ze(t, s) || t.push(s);
         }
-        c = new vt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
+        c = new bt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
     } else c = null, a = o.fieldTransforms;
-    return new Ee(new kt(u), c, a);
+    return new ve(new jt(u), c, a);
 }
 
-class Ne extends ge {
+class Ve extends _e {
     _toFieldTransform(t) {
         if (2 /* MergeSet */ !== t.X) throw 1 /* Update */ === t.X ? t.ot(`${this._methodName}() can only appear at the top level of your update data`) : t.ot(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
         // No transform to add for a delete, but we need to add it to our
@@ -4000,7 +4003,7 @@ class Ne extends ge {
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof Ne;
+        return t instanceof Ve;
     }
 }
 
@@ -4019,8 +4022,8 @@ class Ne extends ge {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function De(t, n, e) {
-    return new Ae({
+ */ function Ne(t, n, e) {
+    return new Te({
         X: 3 /* Argument */ ,
         ct: n.settings.ct,
         methodName: t._methodName,
@@ -4028,23 +4031,23 @@ class Ne extends ge {
     }, n.databaseId, n.S, n.ignoreUndefinedProperties);
 }
 
-class $e extends ge {
+class De extends _e {
     _toFieldTransform(t) {
-        return new gn(t.path, new mn);
+        return new _n(t.path, new wn);
     }
     isEqual(t) {
-        return t instanceof $e;
+        return t instanceof De;
     }
 }
 
-class Fe extends ge {
+class $e extends _e {
     constructor(t, n) {
         super(t), this.ht = n;
     }
     _toFieldTransform(t) {
-        const n = De(this, t, 
-        /*array=*/ !0), e = this.ht.map((t => Le(t, n))), r = new pn(e);
-        return new gn(t.path, r);
+        const n = Ne(this, t, 
+        /*array=*/ !0), e = this.ht.map((t => Ce(t, n))), r = new mn(e);
+        return new _n(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4052,14 +4055,14 @@ class Fe extends ge {
     }
 }
 
-class Se extends ge {
+class Fe extends _e {
     constructor(t, n) {
         super(t), this.ht = n;
     }
     _toFieldTransform(t) {
-        const n = De(this, t, 
-        /*array=*/ !0), e = this.ht.map((t => Le(t, n))), r = new yn(e);
-        return new gn(t.path, r);
+        const n = Ne(this, t, 
+        /*array=*/ !0), e = this.ht.map((t => Ce(t, n))), r = new pn(e);
+        return new _n(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4067,13 +4070,13 @@ class Se extends ge {
     }
 }
 
-class qe extends ge {
+class Se extends _e {
     constructor(t, n) {
         super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        const n = new _n(t.S, dn(t.S, this.lt));
-        return new gn(t.path, n);
+        const n = new yn(t.S, fn(t.S, this.lt));
+        return new _n(t.path, n);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4081,50 +4084,50 @@ class qe extends ge {
     }
 }
 
-/** Parse update data from an update() call. */ function xe(t, n, e, r) {
+/** Parse update data from an update() call. */ function qe(t, n, e, r) {
     const s = t.at(1 /* Update */ , n, e);
-    ke("Data must be an object, but it was:", s, r);
-    const i = [], o = kt.empty();
-    bt(r, ((t, r) => {
-        const u = Qe(n, t, e);
+    je("Data must be an object, but it was:", s, r);
+    const i = [], o = jt.empty();
+    gt(r, ((t, r) => {
+        const u = Be(n, t, e);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                r = h(r);
+                r = a(r);
         const c = s.st(u);
-        if (r instanceof Ne) 
+        if (r instanceof Ve) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = Le(r, c);
+            const t = Ce(r, c);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
-    const u = new vt(i);
-    return new Ie(o, u, s.fieldTransforms);
+    const u = new bt(i);
+    return new Ee(o, u, s.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function Oe(t, n, e, r, s, i) {
-    const o = t.at(1 /* Update */ , n, e), u = [ Me(n, r, e) ], c = [ s ];
-    if (i.length % 2 != 0) throw new U(A, `Function ${n}() needs to be called with an even number of arguments that alternate between field names and values.`);
-    for (let t = 0; t < i.length; t += 2) u.push(Me(n, i[t])), c.push(i[t + 1]);
-    const a = [], l = kt.empty();
+/** Parse update data from a list of field/value arguments. */ function xe(t, n, e, r, s, i) {
+    const o = t.at(1 /* Update */ , n, e), u = [ ke(n, r, e) ], c = [ s ];
+    if (i.length % 2 != 0) throw new L(T, `Function ${n}() needs to be called with an even number of arguments that alternate between field names and values.`);
+    for (let t = 0; t < i.length; t += 2) u.push(ke(n, i[t])), c.push(i[t + 1]);
+    const h = [], l = jt.empty();
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
-    for (let t = u.length - 1; t >= 0; --t) if (!We(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!ze(h, u[t])) {
         const n = u[t];
         let e = c[t];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                e = h(e);
+                e = a(e);
         const r = o.st(n);
-        if (e instanceof Ne) 
+        if (e instanceof Ve) 
         // Add it to the field mask, but don't add anything to updateData.
-        a.push(n); else {
-            const t = Le(e, r);
-            null != t && (a.push(n), l.set(n, t));
+        h.push(n); else {
+            const t = Ce(e, r);
+            null != t && (h.push(n), l.set(n, t));
         }
     }
-    const f = new vt(a);
-    return new Ie(l, f, o.fieldTransforms);
+    const f = new bt(h);
+    return new Ee(l, f, o.fieldTransforms);
 }
 
 /**
@@ -4133,8 +4136,8 @@ class qe extends ge {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function Ce(t, n, e, r = !1) {
-    return Le(e, t.at(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
+ */ function Oe(t, n, e, r = !1) {
+    return Ce(e, t.at(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
 }
 
 /**
@@ -4145,12 +4148,12 @@ class qe extends ge {
  * 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 Le(t, n) {
-    if (je(
+ */ function Ce(t, n) {
+    if (Ue(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = h(t))) return ke("Unsupported field value:", n, t), Ue(t, n);
-    if (t instanceof ge) 
+    t = a(t))) return je("Unsupported field value:", n, t), Le(t, n);
+    if (t instanceof _e) 
     // FieldValues usually parse into transforms (except FieldValue.delete())
     // in which case we do not want to include this field in our parsed data
     // (as doing so will overwrite the field directly prior to the transform
@@ -4162,7 +4165,7 @@ class qe extends ge {
  */
     return function(t, n) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Te(n.X)) throw n.ot(`${t._methodName}() can only be used with update() and set()`);
+        if (!Ie(n.X)) throw n.ot(`${t._methodName}() can only be used with update() and set()`);
         if (!n.path) throw n.ot(`${t._methodName}() is not currently supported inside arrays`);
         const e = t._toFieldTransform(n);
         e && n.fieldTransforms.push(e);
@@ -4192,7 +4195,7 @@ class qe extends ge {
             const e = [];
             let r = 0;
             for (const s of t) {
-                let t = Le(s, n.it(r));
+                let t = Ce(s, n.it(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4208,10 +4211,10 @@ class qe extends ge {
         }(t, n);
     }
     return function(t, n) {
-        if (null === (t = h(t))) return {
+        if (null === (t = a(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return dn(n.S, t);
+        if ("number" == typeof t) return fn(n.S, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4219,37 +4222,37 @@ class qe extends ge {
             stringValue: t
         };
         if (t instanceof Date) {
-            const e = yt.fromDate(t);
+            const e = pt.fromDate(t);
             return {
-                timestampValue: Nn(n.S, e)
+                timestampValue: Vn(n.S, e)
             };
         }
-        if (t instanceof yt) {
+        if (t instanceof pt) {
             // Firestore backend truncates precision down to microseconds. To ensure
             // offline mode works the same with regards to truncation, perform the
             // truncation immediately without waiting for the backend to do that.
-            const e = new yt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            const e = new pt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Nn(n.S, e)
+                timestampValue: Vn(n.S, e)
             };
         }
-        if (t instanceof be) return {
+        if (t instanceof ge) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof _e) return {
-            bytesValue: Dn(n.S, t._byteString)
+        if (t instanceof ye) return {
+            bytesValue: Nn(n.S, t._byteString)
         };
-        if (t instanceof ce) {
+        if (t instanceof ue) {
             const e = n.databaseId, r = t.firestore._databaseId;
             if (!r.isEqual(e)) throw n.ot(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${e.projectId}/${e.database}`);
             return {
-                referenceValue: Sn(t.firestore._databaseId || n.databaseId, t._key.path)
+                referenceValue: Fn(t.firestore._databaseId || n.databaseId, t._key.path)
             };
         }
-        throw n.ot(`Unsupported field value: ${rt(t)}`);
+        throw n.ot(`Unsupported field value: ${et(t)}`);
     }
     /**
  * Checks whether an object looks like a JSON object that should be converted
@@ -4260,13 +4263,13 @@ class qe extends ge {
  */ (t, n);
 }
 
-function Ue(t, n) {
+function Le(t, n) {
     const e = {};
     return !function(t) {
         for (const n in t) if (Object.prototype.hasOwnProperty.call(t, n)) return !1;
         return !0;
-    }(t) ? bt(t, ((t, r) => {
-        const s = Le(r, n.nt(t));
+    }(t) ? gt(t, ((t, r) => {
+        const s = Ce(r, n.nt(t));
         null != s && (e[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -4278,35 +4281,35 @@ function Ue(t, n) {
     };
 }
 
-function je(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof yt || t instanceof be || t instanceof _e || t instanceof ce || t instanceof ge);
+function Ue(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof pt || t instanceof ge || t instanceof ye || t instanceof ue || t instanceof _e);
 }
 
-function ke(t, n, e) {
-    if (!je(e) || !function(t) {
+function je(t, n, e) {
+    if (!Ue(e) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(e)) {
-        const r = rt(e);
+        const r = et(e);
         throw "an object" === r ? n.ot(t + " a custom object") : n.ot(t + " " + r);
     }
 }
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function Me(t, n, e) {
+ */ function ke(t, n, e) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    n = h(n)) instanceof pe) return n._internalPath;
-    if ("string" == typeof n) return Qe(t, n);
-    throw ze("Field path arguments must be of type string or FieldPath.", t, 
+    n = a(n)) instanceof me) return n._internalPath;
+    if ("string" == typeof n) return Be(t, n);
+    throw Qe("Field path arguments must be of type string or FieldPath.", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, e);
 }
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ const Be = new RegExp("[~\\*/\\[\\]]");
+ */ const Me = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4316,29 +4319,29 @@ function ke(t, n, e) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function Qe(t, n, e) {
-    if (n.search(Be) >= 0) throw ze(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function Be(t, n, e) {
+    if (n.search(Me) >= 0) throw Qe(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, e);
     try {
-        return new pe(...n.split("."))._internalPath;
+        return new me(...n.split("."))._internalPath;
     } catch (r) {
-        throw ze(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw Qe(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, e);
     }
 }
 
-function ze(t, n, e, r, s) {
+function Qe(t, n, e, r, s) {
     const i = r && !r.isEmpty(), o = void 0 !== s;
     let u = `Function ${n}() called with invalid data`;
     e && (u += " (via `toFirestore()`)"), u += ". ";
     let c = "";
     return (i || o) && (c += " (found", i && (c += ` in field ${r}`), o && (c += ` in document ${s}`), 
-    c += ")"), new U(A, u + t + c);
+    c += ")"), new L(T, u + t + c);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function We(t, n) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function ze(t, n) {
     return t.some((t => t.isEqual(n)));
 }
 
@@ -4366,7 +4369,7 @@ function ze(t, n, e, r, s) {
  * For a `DocumentSnapshot` that points to a non-existing document, any data
  * access will return 'undefined'. You can use the `exists()` method to
  * explicitly verify a document's existence.
- */ class Ge {
+ */ class We {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4382,7 +4385,7 @@ function ze(t, n, e, r, s) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new ce(this._firestore, this._converter, this._key);
+        return new ue(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -4402,7 +4405,7 @@ function ze(t, n, e, r, s) {
             if (this._converter) {
                 // We only want to use the converter and create a new DocumentSnapshot
                 // if a converter has been provided.
-                const t = new He(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new Ge(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4422,7 +4425,7 @@ function ze(t, n, e, r, s) {
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     get(t) {
         if (this._document) {
-            const n = this._document.data.field(Je("DocumentSnapshot.get", t));
+            const n = this._document.data.field(Ke("DocumentSnapshot.get", t));
             if (null !== n) return this._userDataWriter.convertValue(n);
         }
     }
@@ -4438,7 +4441,7 @@ function ze(t, n, e, r, s) {
  * `DocumentSnapshot`. Since query results contain only existing documents, the
  * `exists` property will always be true and `data()` will never return
  * 'undefined'.
- */ class He extends Ge {
+ */ class Ge extends We {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -4456,7 +4459,7 @@ function ze(t, n, e, r, s) {
  * array via the `docs` property or enumerated using the `forEach` method. The
  * number of documents can be determined via the `empty` and `size`
  * properties.
- */ class Ye {
+ */ class He {
     /** @hideconstructor */
     constructor(t, n) {
         this._docs = n, this.query = t;
@@ -4487,14 +4490,14 @@ function ze(t, n, e, r, s) {
  * @param left - A snapshot to compare.
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
- */ function Ke(t, n) {
-    return t = h(t), n = h(n), t instanceof Ge && n instanceof Ge ? t._firestore === n._firestore && t._key.isEqual(n._key) && (null === t._document ? null === n._document : t._document.isEqual(n._document)) && t._converter === n._converter : t instanceof Ye && n instanceof Ye && (me(t.query, n.query) && pt(t.docs, n.docs, Ke));
+ */ function Ye(t, n) {
+    return t = a(t), n = a(n), t instanceof We && n instanceof We ? t._firestore === n._firestore && t._key.isEqual(n._key) && (null === t._document ? null === n._document : t._document.isEqual(n._document)) && t._converter === n._converter : t instanceof He && n instanceof He && (we(t.query, n.query) && mt(t.docs, n.docs, Ye));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function Je(t, n) {
-    return "string" == typeof n ? Qe(t, n) : n instanceof pe ? n._internalPath : n._delegate._internalPath;
+ */ function Ke(t, n) {
+    return "string" == typeof n ? Be(t, n) : n instanceof me ? n._internalPath : n._delegate._internalPath;
 }
 
 /**
@@ -4521,7 +4524,7 @@ function ze(t, n, e, r, s) {
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
  */
-class Ze {}
+class Je {}
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4531,40 +4534,40 @@ class Ze {}
  * @param queryConstraints - The list of {@link QueryConstraint}s to apply.
  * @throws if any of the provided query constraints cannot be combined with the
  * existing or new constraints.
- */ function Xe(t, ...n) {
+ */ function Ze(t, ...n) {
     for (const e of n) t = e._apply(t);
     return t;
 }
 
-class tr extends Ze {
+class Xe extends Je {
     constructor(t, n, e) {
         super(), this.ft = t, this.dt = n, this.wt = e, this.type = "where";
     }
     _apply(t) {
-        const n = Re(t.firestore), e = function(t, n, e, r, s, i, o) {
+        const n = Pe(t.firestore), e = function(t, n, e, r, s, i, o) {
             let u;
             if (s.isKeyField()) {
-                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new U(A, `Invalid Query. You can't perform '${i}' queries on FieldPath.documentId().`);
+                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new L(T, `Invalid Query. You can't perform '${i}' queries on FieldPath.documentId().`);
                 if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
-                    mr(o, i);
+                    wr(o, i);
                     const n = [];
-                    for (const e of o) n.push(wr(r, t, e));
+                    for (const e of o) n.push(dr(r, t, e));
                     u = {
                         arrayValue: {
                             values: n
                         }
                     };
-                } else u = wr(r, t, o);
-            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || mr(o, i), 
-            u = Ce(e, n, o, 
+                } else u = dr(r, t, o);
+            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || wr(o, i), 
+            u = Oe(e, n, o, 
             /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
-            const c = zt.create(s, i, u);
+            const c = Qt.create(s, i, u);
             return function(t, n) {
                 if (n.N()) {
-                    const e = cn(t);
-                    if (null !== e && !e.isEqual(n.field)) throw new U(A, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${e.toString()}' and '${n.field.toString()}'`);
-                    const r = un(t);
-                    null !== r && pr(t, n.field, r);
+                    const e = un(t);
+                    if (null !== e && !e.isEqual(n.field)) throw new L(T, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${e.toString()}' and '${n.field.toString()}'`);
+                    const r = on(t);
+                    null !== r && mr(t, n.field, r);
                 }
                 const e = function(t, n) {
                     for (const e of t.filters) if (n.indexOf(e.op) >= 0) return e.op;
@@ -4605,12 +4608,12 @@ class tr extends Ze {
                 }(n.op));
                 if (null !== e) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
-                throw e === n.op ? new U(A, `Invalid query. You cannot use more than one '${n.op.toString()}' filter.`) : new U(A, `Invalid query. You cannot use '${n.op.toString()}' filters with '${e.toString()}' filters.`);
+                throw e === n.op ? new L(T, `Invalid query. You cannot use more than one '${n.op.toString()}' filter.`) : new L(T, `Invalid query. You cannot use '${n.op.toString()}' filters with '${e.toString()}' filters.`);
             }(t, c), c;
         }(t._query, "where", n, t.firestore._databaseId, this.ft, this.dt, this.wt);
-        return new ae(t.firestore, t.converter, function(t, n) {
+        return new ce(t.firestore, t.converter, function(t, n) {
             const e = t.filters.concat([ n ]);
-            return new sn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), e, t.limit, t.limitType, t.startAt, t.endAt);
+            return new rn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), e, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }
 }
@@ -4625,25 +4628,25 @@ class tr extends Ze {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function nr(t, n, e) {
-    const r = n, s = Je("where", t);
-    return new tr(s, r, e);
+ */ function tr(t, n, e) {
+    const r = n, s = Ke("where", t);
+    return new Xe(s, r, e);
 }
 
-class er extends Ze {
+class nr extends Je {
     constructor(t, n) {
         super(), this.ft = t, this.yt = n, this.type = "orderBy";
     }
     _apply(t) {
         const n = function(t, n, e) {
-            if (null !== t.startAt) throw new U(A, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
-            if (null !== t.endAt) throw new U(A, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            const r = new nn(n, e);
+            if (null !== t.startAt) throw new L(T, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new L(T, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            const r = new tn(n, e);
             return function(t, n) {
-                if (null === un(t)) {
+                if (null === on(t)) {
                     // This is the first order by. It must match any inequality.
-                    const e = cn(t);
-                    null !== e && pr(t, e, n.field);
+                    const e = un(t);
+                    null !== e && mr(t, e, n.field);
                 }
             }(t, r), r;
         }
@@ -4658,10 +4661,10 @@ class er extends Ze {
  * of the query or if any of the fields in the order by are an uncommitted
  * server timestamp.
  */ (t._query, this.ft, this.yt);
-        return new ae(t.firestore, t.converter, function(t, n) {
+        return new ce(t.firestore, t.converter, function(t, n) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             const e = t.explicitOrderBy.concat([ n ]);
-            return new sn(t.path, t.collectionGroup, e, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new rn(t.path, t.collectionGroup, e, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }
 }
@@ -4674,18 +4677,18 @@ class er extends Ze {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function rr(t, n = "asc") {
-    const e = n, r = Je("orderBy", t);
-    return new er(r, e);
+ */ function er(t, n = "asc") {
+    const e = n, r = Ke("orderBy", t);
+    return new nr(r, e);
 }
 
-class sr extends Ze {
+class rr extends Je {
     constructor(t, n, e) {
         super(), this.type = t, this._t = n, this.gt = e;
     }
     _apply(t) {
-        return new ae(t.firestore, t.converter, function(t, n, e) {
-            return new sn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), n, e, t.startAt, t.endAt);
+        return new ce(t.firestore, t.converter, function(t, n, e) {
+            return new rn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), n, e, t.startAt, t.endAt);
         }(t._query, this._t, this.gt));
     }
 }
@@ -4695,8 +4698,8 @@ class sr extends Ze {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function ir(t) {
-    return it("limit", t), new sr("limit", t, "F" /* First */);
+ */ function sr(t) {
+    return st("limit", t), new rr("limit", t, "F" /* First */);
 }
 
 /**
@@ -4707,54 +4710,54 @@ class sr extends Ze {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function or(t) {
-    return it("limitToLast", t), new sr("limitToLast", t, "L" /* Last */);
+ */ function ir(t) {
+    return st("limitToLast", t), new rr("limitToLast", t, "L" /* Last */);
 }
 
-class ur extends Ze {
+class or extends Je {
     constructor(t, n, e) {
         super(), this.type = t, this.bt = n, this.vt = e;
     }
     _apply(t) {
-        const n = dr(t, this.type, this.bt, this.vt);
-        return new ae(t.firestore, t.converter, function(t, n) {
-            return new sn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, n, t.endAt);
+        const n = fr(t, this.type, this.bt, this.vt);
+        return new ce(t.firestore, t.converter, function(t, n) {
+            return new rn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, n, t.endAt);
         }(t._query, n));
     }
 }
 
-function cr(...t) {
-    return new ur("startAt", t, /*before=*/ !0);
+function ur(...t) {
+    return new or("startAt", t, /*before=*/ !0);
 }
 
-function ar(...t) {
-    return new ur("startAfter", t, 
+function cr(...t) {
+    return new or("startAfter", t, 
     /*before=*/ !1);
 }
 
-class hr extends Ze {
+class ar extends Je {
     constructor(t, n, e) {
         super(), this.type = t, this.bt = n, this.vt = e;
     }
     _apply(t) {
-        const n = dr(t, this.type, this.bt, this.vt);
-        return new ae(t.firestore, t.converter, function(t, n) {
-            return new sn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, n);
+        const n = fr(t, this.type, this.bt, this.vt);
+        return new ce(t.firestore, t.converter, function(t, n) {
+            return new rn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, n);
         }(t._query, n));
     }
 }
 
-function lr(...t) {
-    return new hr("endBefore", t, /*before=*/ !0);
+function hr(...t) {
+    return new ar("endBefore", t, /*before=*/ !0);
 }
 
-function fr(...t) {
-    return new hr("endAt", t, /*before=*/ !1);
+function lr(...t) {
+    return new ar("endAt", t, /*before=*/ !1);
 }
 
-/** Helper function to create a bound from a document or fields */ function dr(t, n, e, r) {
-    if (e[0] = h(e[0]), e[0] instanceof Ge) return function(t, n, e, r, s) {
-        if (!r) throw new U(R, `Can't use a DocumentSnapshot that doesn't exist for ${e}().`);
+/** Helper function to create a bound from a document or fields */ function fr(t, n, e, r) {
+    if (e[0] = a(e[0]), e[0] instanceof We) return function(t, n, e, r, s) {
+        if (!r) throw new L(P, `Can't use a DocumentSnapshot that doesn't exist for ${e}().`);
         const i = [];
         // Because people expect to continue/end a query at the exact document
         // provided, we need to use the implicit sort order rather than the explicit
@@ -4763,42 +4766,42 @@ function fr(...t) {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-                for (const e of hn(t)) if (e.field.isKeyField()) i.push(xt(n, r.key)); else {
+                for (const e of an(t)) if (e.field.isKeyField()) i.push(qt(n, r.key)); else {
             const t = r.data.field(e.field);
-            if (Rt(t)) throw new U(A, 'Invalid query. You are trying to start or end a query using a document for which the field "' + e.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+            if (Pt(t)) throw new L(T, 'Invalid query. You are trying to start or end a query using a document for which the field "' + e.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
             if (null === t) {
                 const t = e.field.canonicalString();
-                throw new U(A, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
+                throw new L(T, `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 tn(i, s);
+        return new Xt(i, s);
     }
     /**
  * Converts a list of field values to a `Bound` for the given query.
  */ (t._query, t.firestore._databaseId, n, e[0]._document, r);
     {
-        const s = Re(t.firestore);
+        const s = Pe(t.firestore);
         return function(t, n, e, r, s, i) {
             // Use explicit order by's because it has to match the query the user made
             const o = t.explicitOrderBy;
-            if (s.length > o.length) throw new U(A, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
+            if (s.length > o.length) throw new L(T, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
             const u = [];
             for (let i = 0; i < s.length; i++) {
                 const c = s[i];
                 if (o[i].field.isKeyField()) {
-                    if ("string" != typeof c) throw new U(A, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
-                    if (!an(t) && -1 !== c.indexOf("/")) throw new U(A, `Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
-                    const e = t.path.child(K.fromString(c));
-                    if (!X.isDocumentKey(e)) throw new U(A, `Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to ${r}() must result in a valid document path, but '${e}' is not because it contains an odd number of segments.`);
-                    const s = new X(e);
-                    u.push(xt(n, s));
+                    if ("string" != typeof c) throw new L(T, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
+                    if (!cn(t) && -1 !== c.indexOf("/")) throw new L(T, `Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
+                    const e = t.path.child(Y.fromString(c));
+                    if (!Z.isDocumentKey(e)) throw new L(T, `Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to ${r}() must result in a valid document path, but '${e}' is not because it contains an odd number of segments.`);
+                    const s = new Z(e);
+                    u.push(qt(n, s));
                 } else {
-                    const t = Ce(e, r, c);
+                    const t = Oe(e, r, c);
                     u.push(t);
                 }
             }
-            return new tn(u, i);
+            return new Xt(u, i);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -4808,28 +4811,28 @@ function fr(...t) {
     }
 }
 
-function wr(t, n, e) {
-    if ("string" == typeof (e = h(e))) {
-        if ("" === e) throw new U(A, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!an(n) && -1 !== e.indexOf("/")) throw new U(A, `Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '${e}' contains a '/' character.`);
-        const r = n.path.child(K.fromString(e));
-        if (!X.isDocumentKey(r)) throw new U(A, `Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
-        return xt(t, new X(r));
+function dr(t, n, e) {
+    if ("string" == typeof (e = a(e))) {
+        if ("" === e) throw new L(T, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!cn(n) && -1 !== e.indexOf("/")) throw new L(T, `Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '${e}' contains a '/' character.`);
+        const r = n.path.child(Y.fromString(e));
+        if (!Z.isDocumentKey(r)) throw new L(T, `Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
+        return qt(t, new Z(r));
     }
-    if (e instanceof ce) return xt(t, e._key);
-    throw new U(A, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${rt(e)}.`);
+    if (e instanceof ue) return qt(t, e._key);
+    throw new L(T, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${et(e)}.`);
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function mr(t, n) {
-    if (!Array.isArray(t) || 0 === t.length) throw new U(A, `Invalid Query. A non-empty array is required for '${n.toString()}' filters.`);
-    if (t.length > 10) throw new U(A, `Invalid Query. '${n.toString()}' filters support a maximum of 10 elements in the value array.`);
+ */ function wr(t, n) {
+    if (!Array.isArray(t) || 0 === t.length) throw new L(T, `Invalid Query. A non-empty array is required for '${n.toString()}' filters.`);
+    if (t.length > 10) throw new L(T, `Invalid Query. '${n.toString()}' filters support a maximum of 10 elements in the value array.`);
 }
 
-function pr(t, n, e) {
-    if (!e.isEqual(n)) throw new U(A, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${n.toString()}' and so you must also use '${n.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${e.toString()}' instead.`);
+function mr(t, n, e) {
+    if (!e.isEqual(n)) throw new L(T, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${n.toString()}' and so you must also use '${n.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${e.toString()}' instead.`);
 }
 
 /**
@@ -4879,7 +4882,7 @@ function pr(t, n, e) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function yr(t, n, e) {
+function pr(t, n, e) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -4888,9 +4891,9 @@ function yr(t, n, e) {
     r;
 }
 
-class _r extends class {
+class yr extends class {
     convertValue(t, n = "none") {
-        switch (Dt(t)) {
+        switch (Nt(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -4898,7 +4901,7 @@ class _r extends class {
             return t.booleanValue;
 
           case 2 /* NumberValue */ :
-            return At(t.integerValue || t.doubleValue);
+            return Tt(t.integerValue || t.doubleValue);
 
           case 3 /* TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -4910,7 +4913,7 @@ class _r extends class {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(Pt(t.bytesValue));
+            return this.convertBytes(At(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -4925,17 +4928,17 @@ class _r extends class {
             return this.convertObject(t.mapValue, n);
 
           default:
-            throw g();
+            throw _();
         }
     }
     convertObject(t, n) {
         const e = {};
-        return bt(t.fields, ((t, r) => {
+        return gt(t.fields, ((t, r) => {
             e[t] = this.convertValue(r, n);
         })), e;
     }
     convertGeoPoint(t) {
-        return new be(At(t.latitude), At(t.longitude));
+        return new ge(Tt(t.latitude), Tt(t.longitude));
     }
     convertArray(t, n) {
         return (t.values || []).map((t => this.convertValue(t, n)));
@@ -4943,27 +4946,27 @@ class _r extends class {
     convertServerTimestamp(t, n) {
         switch (n) {
           case "previous":
-            const e = Vt(t);
+            const e = Rt(t);
             return null == e ? null : this.convertValue(e, n);
 
           case "estimate":
-            return this.convertTimestamp(Nt(t));
+            return this.convertTimestamp(Vt(t));
 
           default:
             return null;
         }
     }
     convertTimestamp(t) {
-        const n = Tt(t);
-        return new yt(n.seconds, n.nanos);
+        const n = It(t);
+        return new pt(n.seconds, n.nanos);
     }
     convertDocumentKey(t, n) {
-        const e = K.fromString(t);
-        b(Gn(e));
-        const r = new H(e.get(1), e.get(3)), s = new X(e.popFirst(5));
+        const e = Y.fromString(t);
+        g(Wn(e));
+        const r = new G(e.get(1), e.get(3)), s = new Z(e.popFirst(5));
         return r.isEqual(n) || 
         // TODO(b/64130202): Somehow support foreign references.
-        p(`Document ${s} contains a document reference within a different database (${r.projectId}/${r.database}) which is not supported. It will be treated as a reference in the current database (${n.projectId}/${n.database}) instead.`), 
+        m(`Document ${s} contains a document reference within a different database (${r.projectId}/${r.database}) which is not supported. It will be treated as a reference in the current database (${n.projectId}/${n.database}) instead.`), 
         s;
     }
 } {
@@ -4971,11 +4974,11 @@ class _r extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new _e(t);
+        return new ye(t);
     }
     convertReference(t) {
         const n = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new ce(this.firestore, /* converter= */ null, n);
+        return new ue(this.firestore, /* converter= */ null, n);
     }
 }
 
@@ -4991,12 +4994,12 @@ class _r extends class {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function gr(t) {
-    const n = ne((t = st(t, ce)).firestore), e = new _r(t.firestore);
-    return Zn(n, [ t._key ]).then((n => {
-        b(1 === n.length);
+ */ function _r(t) {
+    const n = te((t = rt(t, ue)).firestore), e = new yr(t.firestore);
+    return Jn(n, [ t._key ]).then((n => {
+        g(1 === n.length);
         const r = n[0];
-        return new Ge(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new We(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5011,33 +5014,33 @@ class _r extends class {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function br(t) {
+ */ function gr(t) {
     !function(t) {
-        if (on(t) && 0 === t.explicitOrderBy.length) throw new U(x, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = st(t, ae))._query);
-    const n = ne(t.firestore), e = new _r(t.firestore);
-    return Xn(n, t._query).then((n => {
-        const r = n.map((n => new He(t.firestore, e, n.key, n, t.converter)));
-        return on(t._query) && 
+        if (sn(t) && 0 === t.explicitOrderBy.length) throw new L(q, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = rt(t, ce))._query);
+    const n = te(t.firestore), e = new yr(t.firestore);
+    return Zn(n, t._query).then((n => {
+        const r = n.map((n => new Ge(t.firestore, e, n.key, n, t.converter)));
+        return sn(t._query) && 
         // Limit to last queries reverse the orderBy constraint that was
         // specified by the user. As such, we need to reverse the order of the
         // results to return the documents in the expected order.
-        r.reverse(), new Ye(t, r);
+        r.reverse(), new He(t, r);
     }));
 }
 
-function vr(t, n, e) {
-    const r = yr((t = st(t, ce)).converter, n, e), s = Ve(Re(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
-    return Jn(ne(t.firestore), [ s.toMutation(t._key, bn.none()) ]);
+function br(t, n, e) {
+    const r = pr((t = rt(t, ue)).converter, n, e), s = Re(Pe(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
+    return Kn(te(t.firestore), [ s.toMutation(t._key, gn.none()) ]);
 }
 
-function Er(t, n, e, ...r) {
-    const s = Re((t = st(t, ce)).firestore);
+function vr(t, n, e, ...r) {
+    const s = Pe((t = rt(t, ue)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    i = "string" == typeof (n = h(n)) || n instanceof pe ? Oe(s, "updateDoc", t._key, n, e, r) : xe(s, "updateDoc", t._key, n);
-    return Jn(ne(t.firestore), [ i.toMutation(t._key, bn.exists(!0)) ]);
+    i = "string" == typeof (n = a(n)) || n instanceof me ? xe(s, "updateDoc", t._key, n, e, r) : qe(s, "updateDoc", t._key, n);
+    return Kn(te(t.firestore), [ i.toMutation(t._key, gn.exists(!0)) ]);
 }
 
 /**
@@ -5051,8 +5054,8 @@ function Er(t, n, e, ...r) {
  * @param reference - A reference to the document to delete.
  * @returns A `Promise` resolved once the document has been successfully
  * deleted from the backend.
- */ function Ir(t) {
-    return Jn(ne((t = st(t, ce)).firestore), [ new Tn(t._key, bn.none()) ]);
+ */ function Er(t) {
+    return Kn(te((t = rt(t, ue)).firestore), [ new In(t._key, gn.none()) ]);
 }
 
 /**
@@ -5068,9 +5071,9 @@ function Er(t, n, e, ...r) {
  * @param data - An Object containing the data for the new document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function Tr(t, n) {
-    const e = de(t = st(t, he)), r = yr(t.converter, n), s = Ve(Re(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
-    return Jn(ne(t.firestore), [ s.toMutation(e._key, bn.exists(!1)) ]).then((() => e));
+ */ function Ir(t, n) {
+    const e = fe(t = rt(t, ae)), r = pr(t.converter, n), s = Re(Pe(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
+    return Kn(te(t.firestore), [ s.toMutation(e._key, gn.exists(!1)) ]).then((() => e));
 }
 
 /**
@@ -5092,15 +5095,15 @@ function Er(t, n, e, ...r) {
 /**
  * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or
  * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.
- */ function Ar() {
-    return new Ne("deleteField");
+ */ function Tr() {
+    return new Ve("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 Pr() {
-    return new $e("serverTimestamp");
+ */ function Ar() {
+    return new De("serverTimestamp");
 }
 
 /**
@@ -5114,10 +5117,10 @@ function Er(t, n, e, ...r) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function Rr(...t) {
+ */ function Pr(...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 Fe("arrayUnion", t);
+    return new $e("arrayUnion", t);
 }
 
 /**
@@ -5130,10 +5133,10 @@ function Er(t, n, e, ...r) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Vr(...t) {
+ */ function Rr(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-    return new Se("arrayRemove", t);
+    return new Fe("arrayRemove", t);
 }
 
 /**
@@ -5154,8 +5157,8 @@ function Er(t, n, e, ...r) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Nr(t) {
-    return new qe("increment", t);
+ */ function Vr(t) {
+    return new Se("increment", t);
 }
 
 /**
@@ -5181,25 +5184,25 @@ function Er(t, n, e, ...r) {
  * provides methods for adding writes to the write batch. None of the writes
  * will be committed (or visible locally) until {@link WriteBatch.commit} is
  * called.
- */ class Dr {
+ */ class Nr {
     /** @hideconstructor */
     constructor(t, n) {
         this._firestore = t, this._commitHandler = n, this._mutations = [], this._committed = !1, 
-        this._dataReader = Re(t);
+        this._dataReader = Pe(t);
     }
     set(t, n, e) {
         this._verifyNotCommitted();
-        const r = $r(t, this._firestore), s = yr(r.converter, n, e), i = Ve(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
-        return this._mutations.push(i.toMutation(r._key, bn.none())), this;
+        const r = Dr(t, this._firestore), s = pr(r.converter, n, e), i = Re(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
+        return this._mutations.push(i.toMutation(r._key, gn.none())), this;
     }
     update(t, n, e, ...r) {
         this._verifyNotCommitted();
-        const s = $r(t, this._firestore);
+        const s = Dr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (n = h(n)) || n instanceof pe ? Oe(this._dataReader, "WriteBatch.update", s._key, n, e, r) : xe(this._dataReader, "WriteBatch.update", s._key, n), 
-        this._mutations.push(i.toMutation(s._key, bn.exists(!0))), this;
+        return i = "string" == typeof (n = a(n)) || n instanceof me ? xe(this._dataReader, "WriteBatch.update", s._key, n, e, r) : qe(this._dataReader, "WriteBatch.update", s._key, n), 
+        this._mutations.push(i.toMutation(s._key, gn.exists(!0))), this;
     }
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -5208,8 +5211,8 @@ function Er(t, n, e, ...r) {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const n = $r(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Tn(n._key, bn.none())), this;
+        const n = Dr(t, this._firestore);
+        return this._mutations = this._mutations.concat(new In(n._key, gn.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5226,12 +5229,12 @@ function Er(t, n, e, ...r) {
         return this._verifyNotCommitted(), this._committed = !0, this._mutations.length > 0 ? this._commitHandler(this._mutations) : Promise.resolve();
     }
     _verifyNotCommitted() {
-        if (this._committed) throw new U(F, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new L($, "A write batch can no longer be used after commit() has been called.");
     }
 }
 
-function $r(t, n) {
-    if ((t = h(t)).firestore !== n) throw new U(A, "Provided document reference is from a different Firestore instance.");
+function Dr(t, n) {
+    if ((t = a(t)).firestore !== n) throw new L(T, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -5247,9 +5250,9 @@ function $r(t, n) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Fr(t) {
-    const n = ne(t = st(t, re));
-    return new Dr(t, (t => Jn(n, t)));
+ */ function $r(t) {
+    const n = te(t = rt(t, ee));
+    return new Nr(t, (t => Kn(n, t)));
 }
 
 /**
@@ -5271,7 +5274,7 @@ function $r(t, n) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ class Sr {
+ */ class Fr {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5290,8 +5293,8 @@ function $r(t, n) {
         this.writtenDocs = new Set;
     }
     async lookup(t) {
-        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(A, "Firestore transactions require all reads to be executed before all writes.");
-        const n = await Zn(this.datastore, t);
+        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new L(T, "Firestore transactions require all reads to be executed before all writes.");
+        const n = await Jn(this.datastore, t);
         return n.forEach((t => this.recordVersion(t))), n;
     }
     set(t, n) {
@@ -5306,7 +5309,7 @@ function $r(t, n) {
         this.writtenDocs.add(t.toString());
     }
     delete(t) {
-        this.write(new Tn(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new In(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }
     async commit() {
         if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
@@ -5318,22 +5321,22 @@ function $r(t, n) {
         // For each document that was read but not written to, we want to perform
         // a `verify` operation.
         t.forEach(((t, n) => {
-            const e = X.fromPath(n);
-            this.mutations.push(new An(e, this.precondition(e)));
-        })), await Jn(this.datastore, this.mutations), this.committed = !0;
+            const e = Z.fromPath(n);
+            this.mutations.push(new Tn(e, this.precondition(e)));
+        })), await Kn(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let n;
         if (t.isFoundDocument()) n = t.version; else {
-            if (!t.isNoDocument()) throw g();
+            if (!t.isNoDocument()) throw _();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
-            n = _t.min();
+            n = yt.min();
         }
         const e = this.readVersions.get(t.key.toString());
         if (e) {
             if (!n.isEqual(e)) 
             // This transaction will fail no matter what.
-            throw new U(S, "Document version changed between two reads.");
+            throw new L(F, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), n);
     }
     /**
@@ -5341,7 +5344,7 @@ function $r(t, n) {
      * as a precondition, or no precondition if it was not read.
      */    precondition(t) {
         const n = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && n ? bn.updateTime(n) : bn.none();
+        return !this.writtenDocs.has(t.toString()) && n ? gn.updateTime(n) : gn.none();
     }
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5350,7 +5353,7 @@ function $r(t, n) {
         // The first time a document is written, we want to take into account the
         // read time and existence
                 if (!this.writtenDocs.has(t.toString()) && n) {
-            if (n.isEqual(_t.min())) 
+            if (n.isEqual(yt.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
@@ -5360,13 +5363,13 @@ function $r(t, n) {
             // express that to the backend, we have to validate locally.
             // Note: this can change once we can send separate verify writes in the
             // transaction.
-            throw new U(A, "Can't update a document that doesn't exist.");
+            throw new L(T, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return bn.updateTime(n);
+                        return gn.updateTime(n);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-        return bn.exists(!0);
+        return gn.exists(!0);
     }
     write(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
@@ -5394,17 +5397,17 @@ function $r(t, n) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class qr {
+class Sr {
     constructor(t, n, e, r) {
         this.asyncQueue = t, this.datastore = n, this.updateFunction = e, this.deferred = r, 
-        this.Et = 5, this.It = new Yn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.Et = 5, this.It = new Hn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
         this.Et -= 1, this.Tt();
     }
     Tt() {
         this.It.W((async () => {
-            const t = new Sr(this.datastore), n = this.At(t);
+            const t = new Fr(this.datastore), n = this.At(t);
             n && n.then((n => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(n);
@@ -5419,7 +5422,7 @@ class qr {
     At(t) {
         try {
             const n = this.updateFunction(t);
-            return !ot(n) && n.catch && n.then ? n : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !it(n) && n.catch && n.then ? n : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
             null);
         } catch (t) {
             // Do not retry errors thrown by user provided updateFunction.
@@ -5444,36 +5447,36 @@ class qr {
  */
             function(t) {
                 switch (t) {
-                  case E:
-                    return g();
+                  case v:
+                    return _();
 
+                  case E:
                   case I:
-                  case T:
-                  case P:
-                  case $:
+                  case A:
+                  case D:
+                  case x:
                   case O:
-                  case C:
  // Unauthenticated means something went wrong with our token and we need
                     // to retry with new credentials which will happen automatically.
-                                      case D:
+                                      case N:
                     return !1;
 
-                  case A:
+                  case T:
+                  case P:
                   case R:
                   case V:
-                  case N:
-                  case F:
+                  case $:
  // Aborted might be retried in some scenarios, but that is dependant on
                     // the context and should handled individually by the calling code.
                     // See https://cloud.google.com/apis/design/errors.
-                                      case S:
+                                      case F:
+                  case S:
                   case q:
-                  case x:
-                  case L:
+                  case C:
                     return !0;
 
                   default:
-                    return g();
+                    return _();
                 }
             }(n);
         }
@@ -5497,7 +5500,7 @@ class qr {
  * 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 xr() {
+/** The Platform's 'document' implementation or null if not available. */ function qr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5529,10 +5532,10 @@ class qr {
  * Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type
  * in newer versions of TypeScript defines `finally`, which is not available in
  * IE.
- */ class Or {
+ */ class xr {
     constructor(t, n, e, r, s) {
         this.asyncQueue = t, this.timerId = n, this.targetTimeMs = e, this.op = r, this.removalCallback = s, 
-        this.deferred = new j, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
+        this.deferred = new U, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
         // It's normal for the deferred promise to be canceled (due to cancellation)
         // and so we attach a dummy catch callback to avoid
         // 'UnhandledPromiseRejectionWarning' log spam.
@@ -5552,7 +5555,7 @@ class qr {
      *   PORTING NOTE: This exists to prevent making removeDelayedOperation() and
      *   the DelayedOperation class public.
      */    static createAndSchedule(t, n, e, r, s) {
-        const i = Date.now() + e, o = new Or(t, n, i, r, s);
+        const i = Date.now() + e, o = new xr(t, n, i, r, s);
         return o.start(e), o;
     }
     /**
@@ -5574,7 +5577,7 @@ class qr {
      * As long as the operation has not yet been run, calling cancel() provides a
      * guarantee that the operation will not be run.
      */    cancel(t) {
-        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new U(I, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new L(E, "Operation cancelled" + (t ? ": " + t : ""))));
     }
     handleDelayElapsed() {
         this.asyncQueue.enqueueAndForget((() => null !== this.timerHandle ? (this.clearTimeout(), 
@@ -5601,7 +5604,7 @@ class qr {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class Cr {
+ */ class Or {
     constructor() {
         // The last promise in the queue.
         this.Vt = Promise.resolve(), 
@@ -5624,15 +5627,15 @@ class qr {
         // List of TimerIds to fast-forward delays for.
         this.xt = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new Yn(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new Hn(this, "async_queue_retry" /* AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
         this.Ot = () => {
-            const t = xr();
-            t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
+            const t = qr();
+            t && w("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
         };
-        const t = xr();
+        const t = qr();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ot);
     }
     get isShuttingDown() {
@@ -5653,7 +5656,7 @@ class qr {
     enterRestrictedMode(t) {
         if (!this.Dt) {
             this.Dt = !0, this.qt = t || !1;
-            const n = xr();
+            const n = qr();
             n && "function" == typeof n.removeEventListener && n.removeEventListener("visibilitychange", this.Ot);
         }
     }
@@ -5664,7 +5667,7 @@ class qr {
         // Create a deferred Promise that we can return to the callee. This
         // allows us to return a "hanging Promise" only to the callee and still
         // advance the queue even when the operation is not run.
-                const n = new j;
+                const n = new U;
         return this.Lt((() => this.Dt && this.qt ? Promise.resolve() : (t().then(n.resolve, n.reject), 
         n.promise))).then((() => n.promise));
     }
@@ -5719,7 +5722,7 @@ class qr {
  * limitations under the License.
  */ (t)) throw t;
  // Failure will be handled by AsyncQueue
-                                m("AsyncQueue", "Operation failed with retryable error: " + t);
+                                w("AsyncQueue", "Operation failed with retryable error: " + t);
             }
             this.Nt.length > 0 && 
             // If there are additional operations, we re-schedule `retryNextOp()`.
@@ -5741,7 +5744,7 @@ class qr {
             // Re-throw the error so that this.tail becomes a rejected Promise and
             // all further attempts to chain (via .then) will just short-circuit
             // and return the rejected Promise.
-            throw p("INTERNAL UNHANDLED ERROR: ", 
+            throw m("INTERNAL UNHANDLED ERROR: ", 
             /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
  * This returns expected output of message + stack when available.
@@ -5784,11 +5787,11 @@ class qr {
         this.Ct(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.xt.indexOf(t) > -1 && (n = 0);
-        const r = Or.createAndSchedule(this, t, n, e, (t => this.jt(t)));
+        const r = xr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
         return this.$t.push(r), r;
     }
     Ct() {
-        this.Ft && g();
+        this.Ft && _();
     }
     verifyOperationInProgress() {}
     /**
@@ -5838,10 +5841,10 @@ class qr {
     }
 }
 
-class Lr {
+class Cr {
     /** @hideconstructor */
     constructor(t, n) {
-        this._firestore = t, this._transaction = n, this._dataReader = Re(t);
+        this._firestore = t, this._transaction = n, this._dataReader = Pe(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -5849,25 +5852,25 @@ class Lr {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const n = $r(t, this._firestore), e = new _r(this._firestore);
+        const n = Dr(t, this._firestore), e = new yr(this._firestore);
         return this._transaction.lookup([ n._key ]).then((t => {
-            if (!t || 1 !== t.length) return g();
+            if (!t || 1 !== t.length) return _();
             const r = t[0];
-            if (r.isFoundDocument()) return new Ge(this._firestore, e, r.key, r, n.converter);
-            if (r.isNoDocument()) return new Ge(this._firestore, e, n._key, null, n.converter);
-            throw g();
+            if (r.isFoundDocument()) return new We(this._firestore, e, r.key, r, n.converter);
+            if (r.isNoDocument()) return new We(this._firestore, e, n._key, null, n.converter);
+            throw _();
         }));
     }
     set(t, n, e) {
-        const r = $r(t, this._firestore), s = yr(r.converter, n, e), i = Ve(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, e);
+        const r = Dr(t, this._firestore), s = pr(r.converter, n, e), i = Re(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, e);
         return this._transaction.set(r._key, i), this;
     }
     update(t, n, e, ...r) {
-        const s = $r(t, this._firestore);
+        const s = Dr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (n = h(n)) || n instanceof pe ? Oe(this._dataReader, "Transaction.update", s._key, n, e, r) : xe(this._dataReader, "Transaction.update", s._key, n), 
+        return i = "string" == typeof (n = a(n)) || n instanceof me ? xe(this._dataReader, "Transaction.update", s._key, n, e, r) : qe(this._dataReader, "Transaction.update", s._key, n), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -5876,7 +5879,7 @@ class Lr {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const n = $r(t, this._firestore);
+        const n = Dr(t, this._firestore);
         return this._transaction.delete(n._key), this;
     }
 }
@@ -5897,9 +5900,9 @@ class Lr {
  * (the `updateFunction` returned a failed promise), the promise returned by the
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
- */ function Ur(t, n) {
-    const e = ne(t = st(t, re)), r = new j;
-    return new qr(new Cr, e, (e => n(new Lr(t, e))), r).run(), r.promise;
+ */ function Lr(t, n) {
+    const e = te(t = rt(t, ee)), r = new U;
+    return new Sr(new Or, e, (e => n(new Cr(t, e))), r).run(), r.promise;
 }
 
 /**
@@ -5910,11 +5913,11 @@ class Lr {
  * directly to the backend, and `onSnapshot()` APIs are not supported.
  * @packageDocumentation
  */ !function(t) {
-    f = t;
-}(`${i}_lite`), r(new o("firestore/lite", ((t, {options: n}) => {
-    const e = t.getProvider("app").getImmediate(), r = new re(e, new Q(t.getProvider("auth-internal")));
+    l = t;
+}(`${s}_lite`), e(new i("firestore/lite", ((t, {options: n}) => {
+    const e = t.getProvider("app").getImmediate(), r = new ee(e, new B(t.getProvider("auth-internal")));
     return n && r._setSettings(n), r;
-}), "PUBLIC" /* PUBLIC */)), s("firestore-lite", "3.0.1", "node");
+}), "PUBLIC" /* PUBLIC */)), r("firestore-lite", "3.0.2-canary.07b88e6e8", "node");
 
-export { _e as Bytes, he as CollectionReference, ce as DocumentReference, Ge as DocumentSnapshot, pe as FieldPath, ge as FieldValue, re as Firestore, U as FirestoreError, be as GeoPoint, ae as Query, Ze as QueryConstraint, He as QueryDocumentSnapshot, Ye as QuerySnapshot, yt as Timestamp, Lr as Transaction, Dr as WriteBatch, Tr as addDoc, Vr as arrayRemove, Rr as arrayUnion, le as collection, fe as collectionGroup, oe as connectFirestoreEmulator, Ir as deleteDoc, Ar as deleteField, de as doc, ye as documentId, fr as endAt, lr as endBefore, gr as getDoc, br as getDocs, ie as getFirestore, Nr as increment, se as initializeFirestore, ir as limit, or as limitToLast, rr as orderBy, Xe as query, me as queryEqual, we as refEqual, Ur as runTransaction, Pr as serverTimestamp, vr as setDoc, w as setLogLevel, Ke as snapshotEqual, ar as startAfter, cr as startAt, ue as terminate, Er as updateDoc, nr as where, Fr as writeBatch };
+export { ye as Bytes, ae as CollectionReference, ue as DocumentReference, We as DocumentSnapshot, me as FieldPath, _e as FieldValue, ee as Firestore, L as FirestoreError, ge as GeoPoint, ce as Query, Je as QueryConstraint, Ge as QueryDocumentSnapshot, He as QuerySnapshot, pt as Timestamp, Cr as Transaction, Nr as WriteBatch, Ir as addDoc, Rr as arrayRemove, Pr as arrayUnion, he as collection, le as collectionGroup, ie as connectFirestoreEmulator, Er as deleteDoc, Tr as deleteField, fe as doc, pe as documentId, lr as endAt, hr as endBefore, _r as getDoc, gr as getDocs, se as getFirestore, Vr as increment, re as initializeFirestore, sr as limit, ir as limitToLast, er as orderBy, Ze as query, we as queryEqual, de as refEqual, Lr as runTransaction, Ar as serverTimestamp, br as setDoc, d as setLogLevel, Ye as snapshotEqual, cr as startAfter, ur as startAt, oe as terminate, vr as updateDoc, tr as where, $r as writeBatch };
 //# sourceMappingURL=index.browser.esm2017.js.map