@firebase/firestore 3.4.9 → 3.4.10-canary.ebc17e27f

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

@@ -63,7 +63,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.8.0";
+let f = "9.8.3-canary.ebc17e27f";
 
 /**
  * @license
@@ -190,14 +190,14 @@ function p(t, ...e) {
  * given message if it did.
  *
  * Messages are stripped in production builds.
- */ function b(t, e) {
+ */ function v(t, e) {
     t || g();
 }
 
 /**
  * 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
 e) {
     return t;
@@ -218,9 +218,9 @@ e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const E = "ok", T = "cancelled", A = "unknown", I = "invalid-argument", R = "deadline-exceeded", P = "not-found", V = "already-exists", D = "permission-denied", N = "unauthenticated", $ = "resource-exhausted", S = "failed-precondition", x = "aborted", F = "out-of-range", q = "unimplemented", O = "internal", C = "unavailable", L = "data-loss";
+ */ const E = "ok", T = "cancelled", I = "unknown", A = "invalid-argument", R = "deadline-exceeded", P = "not-found", V = "already-exists", N = "permission-denied", D = "unauthenticated", $ = "resource-exhausted", x = "failed-precondition", F = "aborted", S = "out-of-range", q = "unimplemented", O = "internal", k = "unavailable", C = "data-loss";
 
-/** An error returned by a Firestore operation. */ class U extends FirebaseError {
+/** An error returned by a Firestore operation. */ class L extends FirebaseError {
     /** @hideconstructor */
     constructor(
     /**
@@ -254,7 +254,7 @@ e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class k {
+ */ class M {
     constructor() {
         this.promise = new Promise(((t, e) => {
             this.resolve = t, this.reject = e;
@@ -277,7 +277,7 @@ e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class j {
+ */ class U {
     constructor(t, e) {
         this.user = e, this.type = "OAuth", this.headers = new Map, this.headers.set("Authorization", `Bearer ${t}`);
     }
@@ -286,7 +286,7 @@ e) {
 /**
  * A CredentialsProvider that always yields an empty token.
  * @internal
- */ class M {
+ */ class j {
     getToken() {
         return Promise.resolve(null);
     }
@@ -332,8 +332,8 @@ e) {
         }));
     }
     getToken() {
-        return this.auth ? this.auth.getToken().then((t => t ? (b("string" == typeof t.accessToken), 
-        new j(t.accessToken, new l(this.auth.getUid()))) : null)) : Promise.resolve(null);
+        return this.auth ? this.auth.getToken().then((t => t ? (v("string" == typeof t.accessToken), 
+        new U(t.accessToken, new l(this.auth.getUid()))) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, e) {}
@@ -358,7 +358,7 @@ e) {
  * Provides user credentials required for the Firestore JavaScript SDK
  * to authenticate the user, using technique that is only available
  * to applications hosted by Google.
- */ class Q {
+ */ class W {
     constructor(t, e, n) {
         this.t = t, this.i = e, this.o = n;
     }
@@ -373,21 +373,21 @@ e) {
     invalidateToken() {}
 }
 
-class W {
+class K {
     constructor(t) {
         this.value = t, this.type = "AppCheck", this.headers = new Map, t && t.length > 0 && this.headers.set("x-firebase-appcheck", this.value);
     }
 }
 
-/** AppCheck token provider for the Lite SDK. */ class Y {
+/** AppCheck token provider for the Lite SDK. */ class Q {
     constructor(t) {
         this.u = t, this.appCheck = null, t.onInit((t => {
             this.appCheck = t;
         }));
     }
     getToken() {
-        return this.appCheck ? this.appCheck.getToken().then((t => t ? (b("string" == typeof t.token), 
-        new W(t.token)) : null)) : Promise.resolve(null);
+        return this.appCheck ? this.appCheck.getToken().then((t => t ? (v("string" == typeof t.token), 
+        new K(t.token)) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
     start(t, e) {}
@@ -414,7 +414,7 @@ class W {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-class H {
+class Y {
     /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -443,18 +443,18 @@ class H {
  * Represents the database ID a Firestore client is associated with.
  * @internal
  */
-class K {
+class H {
     constructor(t, e) {
         this.projectId = t, this.database = e || "(default)";
     }
     static empty() {
-        return new K("", "");
+        return new H("", "");
     }
     get isDefaultDatabase() {
         return "(default)" === this.database;
     }
     isEqual(t) {
-        return t instanceof K && t.projectId === this.projectId && t.database === this.database;
+        return t instanceof H && t.projectId === this.projectId && t.database === this.database;
     }
 }
 
@@ -570,7 +570,7 @@ class J {
         // for legacy reasons and should not be used frequently).
         const e = [];
         for (const n of t) {
-            if (n.indexOf("//") >= 0) throw new U(I, `Invalid segment (${n}). Paths must not contain // in them.`);
+            if (n.indexOf("//") >= 0) throw new L(A, `Invalid segment (${n}). Paths must not contain // in them.`);
             // Strip leading and traling slashed.
                         e.push(...n.split("/").filter((t => t.length > 0)));
         }
@@ -626,20 +626,20 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
         const e = [];
         let n = "", r = 0;
         const s = () => {
-            if (0 === n.length) throw new U(I, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
+            if (0 === n.length) throw new L(A, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
             e.push(n), n = "";
         };
         let i = !1;
         for (;r < t.length; ) {
             const e = t[r];
             if ("\\" === e) {
-                if (r + 1 === t.length) throw new U(I, "Path has trailing escape character: " + t);
+                if (r + 1 === t.length) throw new L(A, "Path has trailing escape character: " + t);
                 const e = t[r + 1];
-                if ("\\" !== e && "." !== e && "`" !== e) throw new U(I, "Path has invalid escape sequence: " + t);
+                if ("\\" !== e && "." !== e && "`" !== e) throw new L(A, "Path has invalid escape sequence: " + t);
                 n += e, r += 2;
             } else "`" === e ? (i = !i, r++) : "." !== e || i ? (n += e, r++) : (s(), r++);
         }
-        if (s(), i) throw new U(I, "Unterminated ` in path: " + t);
+        if (s(), i) throw new L(A, "Unterminated ` in path: " + t);
         return new tt(e);
     }
     static emptyPath() {
@@ -728,7 +728,7 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */ function nt(t, e, n) {
-    if (!n) throw new U(I, `Function ${t}() cannot be called with an empty ${e}.`);
+    if (!n) throw new L(A, `Function ${t}() cannot be called with an empty ${e}.`);
 }
 
 /**
@@ -740,14 +740,14 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  * an even numbers of segments).
  */
 function rt(t) {
-    if (!et.isDocumentKey(t)) throw new U(I, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
+    if (!et.isDocumentKey(t)) throw new L(A, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
  * Validates that `path` refers to a collection (indicated by the fact it
  * contains an odd numbers of segments).
  */ function st(t) {
-    if (et.isDocumentKey(t)) throw new U(I, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
+    if (et.isDocumentKey(t)) throw new L(A, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
 }
 
 /**
@@ -791,17 +791,17 @@ e) {
     // Unwrap Compat types
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     t = t._delegate), !(t instanceof e)) {
-        if (e.name === t.constructor.name) throw new U(I, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
+        if (e.name === t.constructor.name) throw new L(A, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         {
             const n = it(t);
-            throw new U(I, `Expected type '${e.name}', but it was: ${n}`);
+            throw new L(A, `Expected type '${e.name}', but it was: ${n}`);
         }
     }
     return t;
 }
 
 function ut(t, e) {
-    if (e <= 0) throw new U(I, `Function ${t}() requires a positive number, but it was: ${e}.`);
+    if (e <= 0) throw new L(A, `Function ${t}() requires a positive number, but it was: ${e}.`);
 }
 
 /**
@@ -899,7 +899,7 @@ var lt, ft;
  *     Code.UNKNOWN.
  */
 function dt(t) {
-    if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), A;
+    if (void 0 === t) return p("RPC_ERROR", "HTTP error has no status"), I;
     // The canonical error codes for Google APIs [1] specify mapping onto HTTP
     // status codes but the mapping is not bijective. In each case of ambiguity
     // this function chooses a primary error.
@@ -913,18 +913,18 @@ function dt(t) {
 
       case 400:
         // Bad Request
-        return S;
+        return x;
 
         // Other possibilities based on the forward mapping
         // return Code.INVALID_ARGUMENT;
         // return Code.OUT_OF_RANGE;
               case 401:
         // Unauthorized
-        return N;
+        return D;
 
       case 403:
         // Forbidden
-        return D;
+        return N;
 
       case 404:
         // Not Found
@@ -932,13 +932,13 @@ function dt(t) {
 
       case 409:
         // Conflict
-        return x;
+        return F;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return F;
+        return S;
 
       case 429:
         // Too Many Requests
@@ -950,7 +950,7 @@ function dt(t) {
 
       case 500:
         // Internal Server Error
-        return A;
+        return I;
 
         // Other possibilities:
         // return Code.INTERNAL;
@@ -961,14 +961,14 @@ function dt(t) {
 
       case 503:
         // Service Unavailable
-        return C;
+        return k;
 
       case 504:
         // Gateway Timeout
         return R;
 
       default:
-        return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? S : t >= 500 && t < 600 ? O : A;
+        return t >= 200 && t < 300 ? E : t >= 400 && t < 500 ? x : t >= 500 && t < 600 ? O : I;
     }
 }
 
@@ -1048,24 +1048,24 @@ class {
      * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.
      */
     constructor(t, e) {
-        super(t), this.A = e;
+        super(t), this.I = e;
     }
-    I(t, e) {
+    A(t, e) {
         throw new Error("Not supported by FetchConnection");
     }
     async v(t, e, n, r) {
         const s = JSON.stringify(r);
         let i;
         try {
-            i = await this.A(e, {
+            i = await this.I(e, {
                 method: "POST",
                 headers: n,
                 body: s
             });
         } catch (t) {
-            throw new U(dt(t.status), "Request failed with error: " + t.statusText);
+            throw new L(dt(t.status), "Request failed with error: " + t.statusText);
         }
-        if (!i.ok) throw new U(dt(i.status), "Request failed with error: " + i.statusText);
+        if (!i.ok) throw new L(dt(i.status), "Request failed with error: " + i.statusText);
         return i.json();
     }
 }
@@ -1211,11 +1211,11 @@ class gt {
      * The fractions of a second at nanosecond resolution.*
      */
     e) {
-        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new U(I, "Timestamp nanoseconds out of range: " + e);
-        if (e >= 1e9) throw new U(I, "Timestamp nanoseconds out of range: " + e);
-        if (t < -62135596800) throw new U(I, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new L(A, "Timestamp nanoseconds out of range: " + e);
+        if (e >= 1e9) throw new L(A, "Timestamp nanoseconds out of range: " + e);
+        if (t < -62135596800) throw new L(A, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new U(I, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new L(A, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
@@ -1320,18 +1320,18 @@ class gt {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ class bt {
+ */ class vt {
     constructor(t) {
         this.timestamp = t;
     }
     static fromTimestamp(t) {
-        return new bt(t);
+        return new vt(t);
     }
     static min() {
-        return new bt(new gt(0, 0));
+        return new vt(new gt(0, 0));
     }
     static max() {
-        return new bt(new gt(253402300799, 999999999));
+        return new vt(new gt(253402300799, 999999999));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -1366,7 +1366,7 @@ class gt {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function vt(t) {
+ */ function bt(t) {
     let e = 0;
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
@@ -1376,6 +1376,462 @@ function Et(t, e) {
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
+/**
+ * @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.
+ */
+// An immutable sorted map implementation, based on a Left-leaning Red-Black
+// tree.
+class Tt {
+    constructor(t, e) {
+        this.comparator = t, this.root = e || At.EMPTY;
+    }
+    // Returns a copy of the map, with the specified key/value added or replaced.
+    insert(t, e) {
+        return new Tt(this.comparator, this.root.insert(t, e, this.comparator).copy(null, null, At.BLACK, null, null));
+    }
+    // Returns a copy of the map, with the specified key removed.
+    remove(t) {
+        return new Tt(this.comparator, this.root.remove(t, this.comparator).copy(null, null, At.BLACK, null, null));
+    }
+    // Returns the value of the node with the given key, or null.
+    get(t) {
+        let e = this.root;
+        for (;!e.isEmpty(); ) {
+            const n = this.comparator(t, e.key);
+            if (0 === n) return e.value;
+            n < 0 ? e = e.left : n > 0 && (e = e.right);
+        }
+        return null;
+    }
+    // Returns the index of the element in this sorted map, or -1 if it doesn't
+    // exist.
+    indexOf(t) {
+        // Number of nodes that were pruned when descending right
+        let e = 0, n = this.root;
+        for (;!n.isEmpty(); ) {
+            const r = this.comparator(t, n.key);
+            if (0 === r) return e + n.left.size;
+            r < 0 ? n = n.left : (
+            // Count all nodes left of the node plus the node itself
+            e += n.left.size + 1, n = n.right);
+        }
+        // Node not found
+                return -1;
+    }
+    isEmpty() {
+        return this.root.isEmpty();
+    }
+    // Returns the total number of nodes in the map.
+    get size() {
+        return this.root.size;
+    }
+    // Returns the minimum key in the map.
+    minKey() {
+        return this.root.minKey();
+    }
+    // Returns the maximum key in the map.
+    maxKey() {
+        return this.root.maxKey();
+    }
+    // Traverses the map in key order and calls the specified action function
+    // for each key/value pair. If action returns true, traversal is aborted.
+    // Returns the first truthy value returned by action, or the last falsey
+    // value returned by action.
+    inorderTraversal(t) {
+        return this.root.inorderTraversal(t);
+    }
+    forEach(t) {
+        this.inorderTraversal(((e, n) => (t(e, n), !1)));
+    }
+    toString() {
+        const t = [];
+        return this.inorderTraversal(((e, n) => (t.push(`${e}:${n}`), !1))), `{${t.join(", ")}}`;
+    }
+    // Traverses the map in reverse key order and calls the specified action
+    // function for each key/value pair. If action returns true, traversal is
+    // aborted.
+    // Returns the first truthy value returned by action, or the last falsey
+    // value returned by action.
+    reverseTraversal(t) {
+        return this.root.reverseTraversal(t);
+    }
+    // Returns an iterator over the SortedMap.
+    getIterator() {
+        return new It(this.root, null, this.comparator, !1);
+    }
+    getIteratorFrom(t) {
+        return new It(this.root, t, this.comparator, !1);
+    }
+    getReverseIterator() {
+        return new It(this.root, null, this.comparator, !0);
+    }
+    getReverseIteratorFrom(t) {
+        return new It(this.root, t, this.comparator, !0);
+    }
+}
+
+ // end SortedMap
+// An iterator over an LLRBNode.
+class It {
+    constructor(t, e, n, r) {
+        this.isReverse = r, this.nodeStack = [];
+        let s = 1;
+        for (;!t.isEmpty(); ) if (s = e ? n(t.key, e) : 1, 
+        // flip the comparison if we're going in reverse
+        e && r && (s *= -1), s < 0) 
+        // This node is less than our start key. ignore it
+        t = this.isReverse ? t.left : t.right; else {
+            if (0 === s) {
+                // This node is exactly equal to our start key. Push it on the stack,
+                // but stop iterating;
+                this.nodeStack.push(t);
+                break;
+            }
+            // This node is greater than our start key, add it to the stack and move
+            // to the next one
+            this.nodeStack.push(t), t = this.isReverse ? t.right : t.left;
+        }
+    }
+    getNext() {
+        let t = this.nodeStack.pop();
+        const e = {
+            key: t.key,
+            value: t.value
+        };
+        if (this.isReverse) for (t = t.left; !t.isEmpty(); ) this.nodeStack.push(t), t = t.right; else for (t = t.right; !t.isEmpty(); ) this.nodeStack.push(t), 
+        t = t.left;
+        return e;
+    }
+    hasNext() {
+        return this.nodeStack.length > 0;
+    }
+    peek() {
+        if (0 === this.nodeStack.length) return null;
+        const t = this.nodeStack[this.nodeStack.length - 1];
+        return {
+            key: t.key,
+            value: t.value
+        };
+    }
+}
+
+ // end SortedMapIterator
+// Represents a node in a Left-leaning Red-Black tree.
+class At {
+    constructor(t, e, n, r, s) {
+        this.key = t, this.value = e, this.color = null != n ? n : At.RED, this.left = null != r ? r : At.EMPTY, 
+        this.right = null != s ? s : At.EMPTY, this.size = this.left.size + 1 + this.right.size;
+    }
+    // Returns a copy of the current node, optionally replacing pieces of it.
+    copy(t, e, n, r, s) {
+        return new At(null != t ? t : this.key, null != e ? e : this.value, null != n ? n : this.color, null != r ? r : this.left, null != s ? s : this.right);
+    }
+    isEmpty() {
+        return !1;
+    }
+    // Traverses the tree in key order and calls the specified action function
+    // for each node. If action returns true, traversal is aborted.
+    // Returns the first truthy value returned by action, or the last falsey
+    // value returned by action.
+    inorderTraversal(t) {
+        return this.left.inorderTraversal(t) || t(this.key, this.value) || this.right.inorderTraversal(t);
+    }
+    // Traverses the tree in reverse key order and calls the specified action
+    // function for each node. If action returns true, traversal is aborted.
+    // Returns the first truthy value returned by action, or the last falsey
+    // value returned by action.
+    reverseTraversal(t) {
+        return this.right.reverseTraversal(t) || t(this.key, this.value) || this.left.reverseTraversal(t);
+    }
+    // Returns the minimum node in the tree.
+    min() {
+        return this.left.isEmpty() ? this : this.left.min();
+    }
+    // Returns the maximum key in the tree.
+    minKey() {
+        return this.min().key;
+    }
+    // Returns the maximum key in the tree.
+    maxKey() {
+        return this.right.isEmpty() ? this.key : this.right.maxKey();
+    }
+    // Returns new tree, with the key/value added.
+    insert(t, e, n) {
+        let r = this;
+        const s = n(t, r.key);
+        return r = s < 0 ? r.copy(null, null, null, r.left.insert(t, e, n), null) : 0 === s ? r.copy(null, e, null, null, null) : r.copy(null, null, null, null, r.right.insert(t, e, n)), 
+        r.fixUp();
+    }
+    removeMin() {
+        if (this.left.isEmpty()) return At.EMPTY;
+        let t = this;
+        return t.left.isRed() || t.left.left.isRed() || (t = t.moveRedLeft()), t = t.copy(null, null, null, t.left.removeMin(), null), 
+        t.fixUp();
+    }
+    // Returns new tree, with the specified item removed.
+    remove(t, e) {
+        let n, r = this;
+        if (e(t, r.key) < 0) r.left.isEmpty() || r.left.isRed() || r.left.left.isRed() || (r = r.moveRedLeft()), 
+        r = r.copy(null, null, null, r.left.remove(t, e), null); else {
+            if (r.left.isRed() && (r = r.rotateRight()), r.right.isEmpty() || r.right.isRed() || r.right.left.isRed() || (r = r.moveRedRight()), 
+            0 === e(t, r.key)) {
+                if (r.right.isEmpty()) return At.EMPTY;
+                n = r.right.min(), r = r.copy(n.key, n.value, null, null, r.right.removeMin());
+            }
+            r = r.copy(null, null, null, null, r.right.remove(t, e));
+        }
+        return r.fixUp();
+    }
+    isRed() {
+        return this.color;
+    }
+    // Returns new tree after performing any needed rotations.
+    fixUp() {
+        let t = this;
+        return t.right.isRed() && !t.left.isRed() && (t = t.rotateLeft()), t.left.isRed() && t.left.left.isRed() && (t = t.rotateRight()), 
+        t.left.isRed() && t.right.isRed() && (t = t.colorFlip()), t;
+    }
+    moveRedLeft() {
+        let t = this.colorFlip();
+        return t.right.left.isRed() && (t = t.copy(null, null, null, null, t.right.rotateRight()), 
+        t = t.rotateLeft(), t = t.colorFlip()), t;
+    }
+    moveRedRight() {
+        let t = this.colorFlip();
+        return t.left.left.isRed() && (t = t.rotateRight(), t = t.colorFlip()), t;
+    }
+    rotateLeft() {
+        const t = this.copy(null, null, At.RED, null, this.right.left);
+        return this.right.copy(null, null, this.color, t, null);
+    }
+    rotateRight() {
+        const t = this.copy(null, null, At.RED, this.left.right, null);
+        return this.left.copy(null, null, this.color, null, t);
+    }
+    colorFlip() {
+        const t = this.left.copy(null, null, !this.left.color, null, null), e = this.right.copy(null, null, !this.right.color, null, null);
+        return this.copy(null, null, !this.color, t, e);
+    }
+    // For testing.
+    checkMaxDepth() {
+        const t = this.check();
+        return Math.pow(2, t) <= this.size + 1;
+    }
+    // In a balanced RB tree, the black-depth (number of black nodes) from root to
+    // leaves is equal on both sides.  This function verifies that or asserts.
+    check() {
+        if (this.isRed() && this.left.isRed()) throw g();
+        if (this.right.isRed()) throw g();
+        const t = this.left.check();
+        if (t !== this.right.check()) throw g();
+        return t + (this.isRed() ? 0 : 1);
+    }
+}
+
+ // end LLRBNode
+// Empty node is shared between all LLRB trees.
+// eslint-disable-next-line @typescript-eslint/no-explicit-any
+At.EMPTY = null, At.RED = !0, At.BLACK = !1;
+
+// end LLRBEmptyNode
+At.EMPTY = new 
+// Represents an empty node (a leaf node in the Red-Black Tree).
+class {
+    constructor() {
+        this.size = 0;
+    }
+    get key() {
+        throw g();
+    }
+    get value() {
+        throw g();
+    }
+    get color() {
+        throw g();
+    }
+    get left() {
+        throw g();
+    }
+    get right() {
+        throw g();
+    }
+    // Returns a copy of the current node.
+    copy(t, e, n, r, s) {
+        return this;
+    }
+    // Returns a copy of the tree, with the specified key/value added.
+    insert(t, e, n) {
+        return new At(t, e);
+    }
+    // Returns a copy of the tree, with the specified key removed.
+    remove(t, e) {
+        return this;
+    }
+    isEmpty() {
+        return !0;
+    }
+    inorderTraversal(t) {
+        return !1;
+    }
+    reverseTraversal(t) {
+        return !1;
+    }
+    minKey() {
+        return null;
+    }
+    maxKey() {
+        return null;
+    }
+    isRed() {
+        return !1;
+    }
+    // For testing.
+    checkMaxDepth() {
+        return !0;
+    }
+    check() {
+        return 0;
+    }
+};
+
+/**
+ * @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.
+ */
+/**
+ * SortedSet is an immutable (copy-on-write) collection that holds elements
+ * in order specified by the provided comparator.
+ *
+ * NOTE: if provided comparator returns 0 for two elements, we consider them to
+ * be equal!
+ */
+class Rt {
+    constructor(t) {
+        this.comparator = t, this.data = new Tt(this.comparator);
+    }
+    has(t) {
+        return null !== this.data.get(t);
+    }
+    first() {
+        return this.data.minKey();
+    }
+    last() {
+        return this.data.maxKey();
+    }
+    get size() {
+        return this.data.size;
+    }
+    indexOf(t) {
+        return this.data.indexOf(t);
+    }
+    /** Iterates elements in order defined by "comparator" */    forEach(t) {
+        this.data.inorderTraversal(((e, n) => (t(e), !1)));
+    }
+    /** Iterates over `elem`s such that: range[0] &lt;= elem &lt; range[1]. */    forEachInRange(t, e) {
+        const n = this.data.getIteratorFrom(t[0]);
+        for (;n.hasNext(); ) {
+            const r = n.getNext();
+            if (this.comparator(r.key, t[1]) >= 0) return;
+            e(r.key);
+        }
+    }
+    /**
+     * Iterates over `elem`s such that: start &lt;= elem until false is returned.
+     */    forEachWhile(t, e) {
+        let n;
+        for (n = void 0 !== e ? this.data.getIteratorFrom(e) : this.data.getIterator(); n.hasNext(); ) {
+            if (!t(n.getNext().key)) return;
+        }
+    }
+    /** Finds the least element greater than or equal to `elem`. */    firstAfterOrEqual(t) {
+        const e = this.data.getIteratorFrom(t);
+        return e.hasNext() ? e.getNext().key : null;
+    }
+    getIterator() {
+        return new Pt(this.data.getIterator());
+    }
+    getIteratorFrom(t) {
+        return new Pt(this.data.getIteratorFrom(t));
+    }
+    /** Inserts or updates an element */    add(t) {
+        return this.copy(this.data.remove(t).insert(t, !0));
+    }
+    /** Deletes an element */    delete(t) {
+        return this.has(t) ? this.copy(this.data.remove(t)) : this;
+    }
+    isEmpty() {
+        return this.data.isEmpty();
+    }
+    unionWith(t) {
+        let e = this;
+        // Make sure `result` always refers to the larger one of the two sets.
+                return e.size < t.size && (e = t, t = this), t.forEach((t => {
+            e = e.add(t);
+        })), e;
+    }
+    isEqual(t) {
+        if (!(t instanceof Rt)) return !1;
+        if (this.size !== t.size) return !1;
+        const e = this.data.getIterator(), n = t.data.getIterator();
+        for (;e.hasNext(); ) {
+            const t = e.getNext().key, r = n.getNext().key;
+            if (0 !== this.comparator(t, r)) return !1;
+        }
+        return !0;
+    }
+    toArray() {
+        const t = [];
+        return this.forEach((e => {
+            t.push(e);
+        })), t;
+    }
+    toString() {
+        const t = [];
+        return this.forEach((e => t.push(e))), "SortedSet(" + t.toString() + ")";
+    }
+    copy(t) {
+        const e = new Rt(this.comparator);
+        return e.data = t, e;
+    }
+}
+
+class Pt {
+    constructor(t) {
+        this.iter = t;
+    }
+    getNext() {
+        return this.iter.getNext().key;
+    }
+    hasNext() {
+        return this.iter.hasNext();
+    }
+}
+
 /**
  * @license
  * Copyright 2020 Google LLC
@@ -1401,14 +1857,25 @@ function Et(t, e) {
  *   foo.bar - Overwrites only the field bar of the object foo.
  *             If foo is not an object, foo is replaced with an object
  *             containing foo
- */
-class Tt {
+ */ class Vt {
     constructor(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
         // Sort the field mask to support `FieldMask.isEqual()` and assert below.
         t.sort(tt.comparator);
     }
+    static empty() {
+        return new Vt([]);
+    }
+    /**
+     * Returns a new FieldMask object that is the result of adding all the given
+     * fields paths to this field mask.
+     */    unionWith(t) {
+        let e = new Rt(tt.comparator);
+        for (const t of this.fields) e = e.add(t);
+        for (const n of t) e = e.add(n);
+        return new Vt(e.toArray());
+    }
     /**
      * Verifies that `fieldPath` is included by at least one field in this field
      * mask.
@@ -1465,13 +1932,13 @@ class Tt {
  * before being sent as a proto.
  * @internal
  */
-class At {
+class Nt {
     constructor(t) {
         this.binaryString = t;
     }
     static fromBase64String(t) {
         const e = atob(t);
-        return new At(e);
+        return new Nt(e);
     }
     static fromUint8Array(t) {
         // TODO(indexing); Remove the copy of the byte string here as this method
@@ -1488,7 +1955,7 @@ class At {
         /**
  * Helper function to convert a binary string to an Uint8Array.
  */ (t);
-        return new At(e);
+        return new Nt(e);
     }
     [Symbol.iterator]() {
         let t = 0;
@@ -1543,24 +2010,24 @@ class At {
     }
 }
 
-At.EMPTY_BYTE_STRING = new At("");
+Nt.EMPTY_BYTE_STRING = new Nt("");
 
-const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+const Dt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
 /**
  * Converts the possible Proto values for a timestamp value into a "seconds and
  * nanos" representation.
- */ function Rt(t) {
+ */ function $t(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 (v(!!t), "string" == typeof t) {
         // The date string can have higher precision (nanos) than the Date class
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
         let e = 0;
-        const n = It.exec(t);
-        if (b(!!n), n[1]) {
+        const n = Dt.exec(t);
+        if (v(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = n[1];
             t = (t + "000000000").substr(0, 9), e = Number(t);
@@ -1573,21 +2040,21 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: Pt(t.seconds),
-        nanos: Pt(t.nanos)
+        seconds: xt(t.seconds),
+        nanos: xt(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function Pt(t) {
+ */ function xt(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 Vt(t) {
-    return "string" == typeof t ? At.fromBase64String(t) : At.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Ft(t) {
+    return "string" == typeof t ? Nt.fromBase64String(t) : Nt.fromUint8Array(t);
 }
 
 /**
@@ -1623,7 +2090,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 Dt(t) {
+ */ function St(t) {
     var e, n;
     return "server_timestamp" === (null === (n = ((null === (e = null == t ? void 0 : t.mapValue) || void 0 === e ? void 0 : e.fields) || {}).__type__) || void 0 === n ? void 0 : n.stringValue);
 }
@@ -1633,15 +2100,15 @@ 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 Nt(t) {
+ */ function qt(t) {
     const e = t.mapValue.fields.__previous_value__;
-    return Dt(e) ? Nt(e) : e;
+    return St(e) ? qt(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function $t(t) {
-    const e = Rt(t.mapValue.fields.__local_write_time__.timestampValue);
+ */ function Ot(t) {
+    const e = $t(t.mapValue.fields.__local_write_time__.timestampValue);
     return new gt(e.seconds, e.nanos);
 }
 
@@ -1660,7 +2127,7 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const St = {
+ */ const kt = {
     fields: {
         __type__: {
             stringValue: "__max__"
@@ -1669,8 +2136,8 @@ const It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 };
 
 /** Extracts the backend's type order for the provided value. */
-function xt(t) {
-    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Dt(t) ? 4 /* ServerTimestampValue */ : 
+function Ct(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 ? St(t) ? 4 /* ServerTimestampValue */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
         return "__max__" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;
@@ -1697,10 +2164,10 @@ function xt(t) {
  */ (t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : g();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Ft(t, e) {
+/** Tests `left` and `right` for equality based on the backend semantics. */ function Lt(t, e) {
     if (t === e) return !0;
-    const n = xt(t);
-    if (n !== xt(e)) return !1;
+    const n = Ct(t);
+    if (n !== Ct(e)) return !1;
     switch (n) {
       case 0 /* NullValue */ :
       case 9007199254740991 /* MaxValue */ :
@@ -1710,14 +2177,14 @@ function xt(t) {
         return t.booleanValue === e.booleanValue;
 
       case 4 /* ServerTimestampValue */ :
-        return $t(t).isEqual($t(e));
+        return Ot(t).isEqual(Ot(e));
 
       case 3 /* TimestampValue */ :
         return function(t, e) {
             if ("string" == typeof t.timestampValue && "string" == typeof e.timestampValue && t.timestampValue.length === e.timestampValue.length) 
             // Use string equality for ISO 8601 timestamps
             return t.timestampValue === e.timestampValue;
-            const n = Rt(t.timestampValue), r = Rt(e.timestampValue);
+            const n = $t(t.timestampValue), r = $t(e.timestampValue);
             return n.seconds === r.seconds && n.nanos === r.nanos;
         }(t, e);
 
@@ -1726,7 +2193,7 @@ function xt(t) {
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            return Vt(t.bytesValue).isEqual(Vt(e.bytesValue));
+            return Ft(t.bytesValue).isEqual(Ft(e.bytesValue));
         }(t, e);
 
       case 7 /* RefValue */ :
@@ -1734,27 +2201,27 @@ function xt(t) {
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            return Pt(t.geoPointValue.latitude) === Pt(e.geoPointValue.latitude) && Pt(t.geoPointValue.longitude) === Pt(e.geoPointValue.longitude);
+            return xt(t.geoPointValue.latitude) === xt(e.geoPointValue.latitude) && xt(t.geoPointValue.longitude) === xt(e.geoPointValue.longitude);
         }(t, e);
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            if ("integerValue" in t && "integerValue" in e) return Pt(t.integerValue) === Pt(e.integerValue);
+            if ("integerValue" in t && "integerValue" in e) return xt(t.integerValue) === xt(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
-                const n = Pt(t.doubleValue), r = Pt(e.doubleValue);
+                const n = xt(t.doubleValue), r = xt(e.doubleValue);
                 return n === r ? at(n) === at(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* ArrayValue */ :
-        return _t(t.arrayValue.values || [], e.arrayValue.values || [], Ft);
+        return _t(t.arrayValue.values || [], e.arrayValue.values || [], Lt);
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
             const n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (vt(n) !== vt(r)) return !1;
-            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Ft(n[t], r[t]))) return !1;
+            if (bt(n) !== bt(r)) return !1;
+            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Lt(n[t], r[t]))) return !1;
             return !0;
         }
         /** Returns true if the ArrayValue contains the specified element. */ (t, e);
@@ -1764,13 +2231,13 @@ function xt(t) {
     }
 }
 
-function qt(t, e) {
-    return void 0 !== (t.values || []).find((t => Ft(t, e)));
+function Mt(t, e) {
+    return void 0 !== (t.values || []).find((t => Lt(t, e)));
 }
 
-function Ot(t, e) {
+function Ut(t, e) {
     if (t === e) return 0;
-    const n = xt(t), r = xt(e);
+    const n = Ct(t), r = Ct(e);
     if (n !== r) return yt(n, r);
     switch (n) {
       case 0 /* NullValue */ :
@@ -1782,24 +2249,24 @@ function Ot(t, e) {
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            const n = Pt(t.integerValue || t.doubleValue), r = Pt(e.integerValue || e.doubleValue);
+            const n = xt(t.integerValue || t.doubleValue), r = xt(e.integerValue || e.doubleValue);
             return n < r ? -1 : n > r ? 1 : n === r ? 0 : 
             // one or both are NaN.
             isNaN(n) ? isNaN(r) ? 0 : -1 : 1;
         }(t, e);
 
       case 3 /* TimestampValue */ :
-        return Ct(t.timestampValue, e.timestampValue);
+        return jt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return Ct($t(t), $t(e));
+        return jt(Ot(t), Ot(e));
 
       case 5 /* StringValue */ :
         return yt(t.stringValue, e.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            const n = Vt(t), r = Vt(e);
+            const n = Ft(t), r = Ft(e);
             return n.compareTo(r);
         }(t.bytesValue, e.bytesValue);
 
@@ -1815,16 +2282,16 @@ function Ot(t, e) {
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            const n = yt(Pt(t.latitude), Pt(e.latitude));
+            const n = yt(xt(t.latitude), xt(e.latitude));
             if (0 !== n) return n;
-            return yt(Pt(t.longitude), Pt(e.longitude));
+            return yt(xt(t.longitude), xt(e.longitude));
         }(t.geoPointValue, e.geoPointValue);
 
       case 9 /* ArrayValue */ :
         return function(t, e) {
             const n = t.values || [], r = e.values || [];
             for (let t = 0; t < n.length && t < r.length; ++t) {
-                const e = Ot(n[t], r[t]);
+                const e = Ut(n[t], r[t]);
                 if (e) return e;
             }
             return yt(n.length, r.length);
@@ -1832,9 +2299,9 @@ function Ot(t, e) {
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
-            if (t === St && e === St) return 0;
-            if (t === St) return 1;
-            if (e === St) return -1;
+            if (t === kt && e === kt) return 0;
+            if (t === kt) return 1;
+            if (e === kt) return -1;
             const n = t.fields || {}, r = Object.keys(n), s = e.fields || {}, i = Object.keys(s);
             // Even though MapValues are likely sorted correctly based on their insertion
             // order (e.g. when received from the backend), local modifications can bring
@@ -1844,7 +2311,7 @@ function Ot(t, e) {
             for (let t = 0; t < r.length && t < i.length; ++t) {
                 const e = yt(r[t], i[t]);
                 if (0 !== e) return e;
-                const o = Ot(n[r[t]], s[i[t]]);
+                const o = Ut(n[r[t]], s[i[t]]);
                 if (0 !== o) return o;
             }
             return yt(r.length, i.length);
@@ -1856,35 +2323,35 @@ function Ot(t, e) {
     }
 }
 
-function Ct(t, e) {
+function jt(t, e) {
     if ("string" == typeof t && "string" == typeof e && t.length === e.length) return yt(t, e);
-    const n = Rt(t), r = Rt(e), s = yt(n.seconds, r.seconds);
+    const n = $t(t), r = $t(e), s = yt(n.seconds, r.seconds);
     return 0 !== s ? s : yt(n.nanos, r.nanos);
 }
 
-function Lt(t, e) {
+function Bt(t, e) {
     return {
         referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${e.path.canonicalString()}`
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Ut(t) {
+/** Returns true if `value` is an ArrayValue. */ function zt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function kt(t) {
+/** Returns true if `value` is a NullValue. */ function Gt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function jt(t) {
+/** Returns true if `value` is NaN. */ function Wt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function Mt(t) {
+/** Returns true if `value` is a MapValue. */ function Kt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Bt(t) {
+/** Creates a deep copy of `source`. */ function Qt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1897,7 +2364,7 @@ function Lt(t, e) {
                 fields: {}
             }
         };
-        return Et(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Bt(n))), e;
+        return Et(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Qt(n))), e;
     }
     if (t.arrayValue) {
         const e = {
@@ -1905,18 +2372,18 @@ function Lt(t, e) {
                 values: []
             }
         };
-        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Bt(t.arrayValue.values[n]);
+        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Qt(t.arrayValue.values[n]);
         return e;
     }
     return Object.assign({}, t);
 }
 
-class zt {
+class Yt {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new zt({
+        return new Yt({
             mapValue: {}
         });
     }
@@ -1930,7 +2397,7 @@ class zt {
         {
             let e = this.value;
             for (let n = 0; n < t.length - 1; ++n) if (e = (e.mapValue.fields || {})[t.get(n)], 
-            !Mt(e)) return null;
+            !Kt(e)) return null;
             return e = (e.mapValue.fields || {})[t.lastSegment()], e || null;
         }
     }
@@ -1940,7 +2407,7 @@ class zt {
      * @param path - The field path to set.
      * @param value - The value to set.
      */    set(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Bt(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Qt(e);
     }
     /**
      * Sets the provided fields to the provided values.
@@ -1954,7 +2421,7 @@ class zt {
                 const t = this.getFieldsMap(e);
                 this.applyChanges(t, n, r), n = {}, r = [], e = s.popLast();
             }
-            t ? n[s.lastSegment()] = Bt(t) : r.push(s.lastSegment());
+            t ? n[s.lastSegment()] = Qt(t) : r.push(s.lastSegment());
         }));
         const s = this.getFieldsMap(e);
         this.applyChanges(s, n, r);
@@ -1966,10 +2433,10 @@ class zt {
      * @param path - The field path to remove.
      */    delete(t) {
         const e = this.field(t.popLast());
-        Mt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        Kt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }
     isEqual(t) {
-        return Ft(this.value, t.value);
+        return Lt(this.value, t.value);
     }
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -1981,7 +2448,7 @@ class zt {
         });
         for (let n = 0; n < t.length; ++n) {
             let r = e.mapValue.fields[t.get(n)];
-            Mt(r) && r.mapValue.fields || (r = {
+            Kt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -1997,7 +2464,7 @@ class zt {
         for (const e of n) delete t[e];
     }
     clone() {
-        return new zt(Bt(this.value));
+        return new Yt(Qt(this.value));
     }
 }
 
@@ -2026,7 +2493,7 @@ class zt {
  * 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 Gt {
+ */ class Ht {
     constructor(t, e, n, r, s, i) {
         this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.data = s, 
         this.documentState = i;
@@ -2035,23 +2502,23 @@ class zt {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new Gt(t, 0 /* INVALID */ , bt.min(), bt.min(), zt.empty(), 0 /* SYNCED */);
+        return new Ht(t, 0 /* INVALID */ , vt.min(), vt.min(), Yt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist with the given data at the
      * given version.
      */    static newFoundDocument(t, e, n) {
-        return new Gt(t, 1 /* FOUND_DOCUMENT */ , e, bt.min(), n, 0 /* SYNCED */);
+        return new Ht(t, 1 /* FOUND_DOCUMENT */ , e, vt.min(), n, 0 /* SYNCED */);
     }
     /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, e) {
-        return new Gt(t, 2 /* NO_DOCUMENT */ , e, bt.min(), zt.empty(), 0 /* SYNCED */);
+        return new Ht(t, 2 /* NO_DOCUMENT */ , e, vt.min(), Yt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist at the given version but
      * whose data is not known (e.g. a document that was updated without a known
      * base document).
      */    static newUnknownDocument(t, e) {
-        return new Gt(t, 3 /* UNKNOWN_DOCUMENT */ , e, bt.min(), zt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new Ht(t, 3 /* UNKNOWN_DOCUMENT */ , e, vt.min(), Yt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2064,7 +2531,7 @@ class zt {
      * Changes the document type to indicate that it doesn't exist at the given
      * version.
      */    convertToNoDocument(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = zt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Yt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }
     /**
@@ -2072,14 +2539,15 @@ class zt {
      * that its data is not known (e.g. a document that was updated without a known
      * base document).
      */    convertToUnknownDocument(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = zt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Yt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasCommittedMutations() {
         return this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasLocalMutations() {
-        return this.documentState = 1 /* HAS_LOCAL_MUTATIONS */ , this;
+        return this.documentState = 1 /* HAS_LOCAL_MUTATIONS */ , this.version = vt.min(), 
+        this;
     }
     setReadTime(t) {
         return this.readTime = t, this;
@@ -2106,10 +2574,10 @@ class zt {
         return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
     }
     isEqual(t) {
-        return t instanceof Gt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
+        return t instanceof Ht && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
     }
     mutableCopy() {
-        return new Gt(this.key, this.documentType, this.version, this.readTime, this.data.clone(), this.documentState);
+        return new Ht(this.key, this.documentType, this.version, this.readTime, this.data.clone(), this.documentState);
     }
     toString() {
         return `Document(${this.key}, ${this.version}, ${JSON.stringify(this.data.value)}, {documentType: ${this.documentType}}), {documentState: ${this.documentState}})`;
@@ -2133,7 +2601,7 @@ class zt {
  * limitations under the License.
  */
 // Visible for testing
-class Qt {
+class Jt {
     constructor(t, e = null, n = [], r = [], s = null, i = null, o = null) {
         this.path = t, this.collectionGroup = e, this.orderBy = n, this.filters = r, this.limit = s, 
         this.startAt = i, this.endAt = o, this.P = null;
@@ -2147,29 +2615,29 @@ class Qt {
  * NOTE: you should always construct `Target` from `Query.toTarget` instead of
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
- */ function Wt(t, e = null, n = [], r = [], s = null, i = null, o = null) {
-    return new Qt(t, e, n, r, s, i, o);
+ */ function Xt(t, e = null, n = [], r = [], s = null, i = null, o = null) {
+    return new Jt(t, e, n, r, s, i, o);
 }
 
-class Yt extends class {} {
+class Zt extends class {} {
     constructor(t, e, n) {
         super(), this.field = t, this.op = e, this.value = n;
     }
     /**
      * Creates a filter based on the provided arguments.
      */    static create(t, e, n) {
-        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, n) : new Ht(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Zt(t, n) : "in" /* IN */ === e ? new te(t, n) : "not-in" /* NOT_IN */ === e ? new ee(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ne(t, n) : new Yt(t, e, n);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, n) : new te(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new se(t, n) : "in" /* IN */ === e ? new ie(t, n) : "not-in" /* NOT_IN */ === e ? new oe(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ue(t, n) : new Zt(t, e, n);
     }
     static V(t, e, n) {
-        return "in" /* IN */ === e ? new Kt(t, n) : new Jt(t, n);
+        return "in" /* IN */ === e ? new ee(t, n) : new ne(t, n);
     }
     matches(t) {
         const e = t.data.field(this.field);
         // Types do not have to match in NOT_EQUAL filters.
-                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.D(Ot(e, this.value)) : null !== e && xt(this.value) === xt(e) && this.D(Ot(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.N(Ut(e, this.value)) : null !== e && Ct(this.value) === Ct(e) && this.N(Ut(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
-    D(t) {
+    N(t) {
         switch (this.op) {
           case "<" /* LESS_THAN */ :
             return t < 0;
@@ -2193,85 +2661,85 @@ class Yt extends class {} {
             return g();
         }
     }
-    N() {
+    D() {
         return [ "<" /* LESS_THAN */ , "<=" /* LESS_THAN_OR_EQUAL */ , ">" /* GREATER_THAN */ , ">=" /* GREATER_THAN_OR_EQUAL */ , "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ].indexOf(this.op) >= 0;
     }
 }
 
 /** Filter that matches on key fields (i.e. '__name__'). */
-class Ht extends Yt {
+class te extends Zt {
     constructor(t, e, n) {
         super(t, e, n), this.key = et.fromName(n.referenceValue);
     }
     matches(t) {
         const e = et.comparator(t.key, this.key);
-        return this.D(e);
+        return this.N(e);
     }
 }
 
-/** Filter that matches on key fields within an array. */ class Kt extends Yt {
+/** Filter that matches on key fields within an array. */ class ee extends Zt {
     constructor(t, e) {
-        super(t, "in" /* IN */ , e), this.keys = Xt("in" /* IN */ , e);
+        super(t, "in" /* IN */ , e), this.keys = re("in" /* IN */ , e);
     }
     matches(t) {
         return this.keys.some((e => e.isEqual(t.key)));
     }
 }
 
-/** Filter that matches on key fields not present within an array. */ class Jt extends Yt {
+/** Filter that matches on key fields not present within an array. */ class ne extends Zt {
     constructor(t, e) {
-        super(t, "not-in" /* NOT_IN */ , e), this.keys = Xt("not-in" /* NOT_IN */ , e);
+        super(t, "not-in" /* NOT_IN */ , e), this.keys = re("not-in" /* NOT_IN */ , e);
     }
     matches(t) {
         return !this.keys.some((e => e.isEqual(t.key)));
     }
 }
 
-function Xt(t, e) {
+function re(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => et.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class Zt extends Yt {
+/** A Filter that implements the array-contains operator. */ class se extends Zt {
     constructor(t, e) {
         super(t, "array-contains" /* ARRAY_CONTAINS */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return Ut(e) && qt(e.arrayValue, this.value);
+        return zt(e) && Mt(e.arrayValue, this.value);
     }
 }
 
-/** A Filter that implements the IN operator. */ class te extends Yt {
+/** A Filter that implements the IN operator. */ class ie extends Zt {
     constructor(t, e) {
         super(t, "in" /* IN */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return null !== e && qt(this.value.arrayValue, e);
+        return null !== e && Mt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the not-in operator. */ class ee extends Yt {
+/** A Filter that implements the not-in operator. */ class oe extends Zt {
     constructor(t, e) {
         super(t, "not-in" /* NOT_IN */ , e);
     }
     matches(t) {
-        if (qt(this.value.arrayValue, {
+        if (Mt(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         const e = t.data.field(this.field);
-        return null !== e && !qt(this.value.arrayValue, e);
+        return null !== e && !Mt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the array-contains-any operator. */ class ne extends Yt {
+/** A Filter that implements the array-contains-any operator. */ class ue extends Zt {
     constructor(t, e) {
         super(t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return !(!Ut(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => qt(this.value.arrayValue, t)));
+        return !(!zt(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => Mt(this.value.arrayValue, t)));
     }
 }
 
@@ -2288,7 +2756,7 @@ function Xt(t, e) {
  * Bound provides a function to determine whether a document comes before or
  * after a bound. This is influenced by whether the position is just before or
  * just after the provided values.
- */ class re {
+ */ class ce {
     constructor(t, e) {
         this.position = t, this.inclusive = e;
     }
@@ -2296,22 +2764,22 @@ function Xt(t, e) {
 
 /**
  * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
- */ class se {
+ */ class ae {
     constructor(t, e = "asc" /* ASCENDING */) {
         this.field = t, this.dir = e;
     }
 }
 
-function ie(t, e) {
+function he(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
-function oe(t, e) {
+function le(t, e) {
     if (null === t) return null === e;
     if (null === e) return !1;
     if (t.inclusive !== e.inclusive || t.position.length !== e.position.length) return !1;
     for (let n = 0; n < t.position.length; n++) {
-        if (!Ft(t.position[n], e.position[n])) return !1;
+        if (!Lt(t.position[n], e.position[n])) return !1;
     }
     return !0;
 }
@@ -2338,7 +2806,7 @@ function oe(t, e) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ class ue {
+ */ class fe {
     /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2347,16 +2815,16 @@ function oe(t, e) {
         this.path = t, this.collectionGroup = e, this.explicitOrderBy = n, this.filters = r, 
         this.limit = s, this.limitType = i, this.startAt = o, this.endAt = u, this.$ = null, 
         // The corresponding `Target` of this `Query` instance.
-        this.S = null, this.startAt, this.endAt;
+        this.F = null, this.startAt, this.endAt;
     }
 }
 
-/** Creates a new Query for a query that matches all documents at `path` */ function ce(t) {
+/** Creates a new Query for a query that matches all documents at `path` */ function de(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function ae(t) {
-    for (const e of t.filters) if (e.N()) return e.field;
+function we(t) {
+    for (const e of t.filters) if (e.D()) return e.field;
     return null;
 }
 
@@ -2368,7 +2836,7 @@ function ae(t) {
  * Returns whether the query matches a collection group rather than a specific
  * collection.
  */
-function he(t) {
+function me(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2376,23 +2844,23 @@ function he(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 le(t) {
-    const e = v(t);
+ */ function pe(t) {
+    const e = b(t);
     if (null === e.$) {
         e.$ = [];
-        const t = ae(e), n = ce(e);
+        const t = we(e), n = de(e);
         if (null !== t && null === n) 
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
         // Note that the default inequality field and key ordering is ascending.
-        t.isKeyField() || e.$.push(new se(t)), e.$.push(new se(tt.keyField(), "asc" /* ASCENDING */)); else {
+        t.isKeyField() || e.$.push(new ae(t)), e.$.push(new ae(tt.keyField(), "asc" /* ASCENDING */)); else {
             let t = !1;
             for (const n of e.explicitOrderBy) e.$.push(n), n.field.isKeyField() && (t = !0);
             if (!t) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 const t = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* ASCENDING */;
-                e.$.push(new se(tt.keyField(), t));
+                e.$.push(new ae(tt.keyField(), t));
             }
         }
     }
@@ -2401,34 +2869,34 @@ function he(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function fe(t) {
-    const e = v(t);
-    if (!e.S) if ("F" /* First */ === e.limitType) e.S = Wt(e.path, e.collectionGroup, le(e), e.filters, e.limit, e.startAt, e.endAt); else {
+ */ function ye(t) {
+    const e = b(t);
+    if (!e.F) if ("F" /* First */ === e.limitType) e.F = Xt(e.path, e.collectionGroup, pe(e), e.filters, e.limit, e.startAt, e.endAt); else {
         // Flip the orderBy directions since we want the last results
         const t = [];
-        for (const n of le(e)) {
+        for (const n of pe(e)) {
             const e = "desc" /* DESCENDING */ === n.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            t.push(new se(n.field, e));
+            t.push(new ae(n.field, e));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                const n = e.endAt ? new re(e.endAt.position, e.endAt.inclusive) : null, r = e.startAt ? new re(e.startAt.position, e.startAt.inclusive) : null;
+                const n = e.endAt ? new ce(e.endAt.position, e.endAt.inclusive) : null, r = e.startAt ? new ce(e.startAt.position, e.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
-        e.S = Wt(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
+        e.F = Xt(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
     }
-    return e.S;
+    return e.F;
 }
 
-function de(t, e) {
+function _e(t, e) {
     return function(t, e) {
         if (t.limit !== e.limit) return !1;
         if (t.orderBy.length !== e.orderBy.length) return !1;
-        for (let n = 0; n < t.orderBy.length; n++) if (!ie(t.orderBy[n], e.orderBy[n])) return !1;
+        for (let n = 0; n < t.orderBy.length; n++) if (!he(t.orderBy[n], e.orderBy[n])) return !1;
         if (t.filters.length !== e.filters.length) return !1;
         for (let s = 0; s < t.filters.length; s++) if (n = t.filters[s], r = e.filters[s], 
-        n.op !== r.op || !n.field.isEqual(r.field) || !Ft(n.value, r.value)) return !1;
+        n.op !== r.op || !n.field.isEqual(r.field) || !Lt(n.value, r.value)) return !1;
         var n, r;
-        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!oe(t.startAt, e.startAt) && oe(t.endAt, e.endAt);
-    }(fe(t), fe(e)) && t.limitType === e.limitType;
+        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!le(t.startAt, e.startAt) && le(t.endAt, e.endAt);
+    }(ye(t), ye(e)) && t.limitType === e.limitType;
 }
 
 /**
@@ -2456,7 +2924,7 @@ function de(t, e) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function we(t, e) {
+function ge(t, e) {
     return function(t) {
         return "number" == typeof t && Number.isInteger(t) && !at(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
@@ -2468,7 +2936,7 @@ function we(t, e) {
             integerValue: "" + t
         };
     }(e) : function(t, e) {
-        if (t.F) {
+        if (t.S) {
             if (isNaN(e)) return {
                 doubleValue: "NaN"
             };
@@ -2501,7 +2969,7 @@ function we(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Used to represent a field transform on a mutation. */ class me {
+/** Used to represent a field transform on a mutation. */ class ve {
     constructor() {
         // Make sure that the structural type of `TransformOperation` is unique.
         // See https://github.com/microsoft/TypeScript/issues/5451
@@ -2509,15 +2977,15 @@ function we(t, e) {
     }
 }
 
-/** Transforms a value into a server-generated timestamp. */ class pe extends me {}
+/** Transforms a value into a server-generated timestamp. */ class be extends ve {}
 
-/** Transforms an array value via a union operation. */ class ye extends me {
+/** Transforms an array value via a union operation. */ class Ee extends ve {
     constructor(t) {
         super(), this.elements = t;
     }
 }
 
-/** Transforms an array value via a remove operation. */ class _e extends me {
+/** Transforms an array value via a remove operation. */ class Te extends ve {
     constructor(t) {
         super(), this.elements = t;
     }
@@ -2528,7 +2996,7 @@ function we(t, e) {
  * transforms. Converts all field values to integers or doubles, but unlike the
  * backend does not cap integer values at 2^63. Instead, JavaScript number
  * arithmetic is used and precision loss can occur for values greater than 2^53.
- */ class ge extends me {
+ */ class Ie extends ve {
     constructor(t, e) {
         super(), this.q = t, this.O = e;
     }
@@ -2550,7 +3018,7 @@ function we(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** A field path and the TransformOperation to perform upon it. */ class be {
+/** A field path and the TransformOperation to perform upon it. */ class Ae {
     constructor(t, e) {
         this.field = t, this.transform = e;
     }
@@ -2560,18 +3028,18 @@ function we(t, e) {
  * Encodes a precondition for a mutation. This follows the model that the
  * backend accepts with the special case of an explicit "empty" precondition
  * (meaning no precondition).
- */ class ve {
+ */ class Re {
     constructor(t, e) {
         this.updateTime = t, this.exists = e;
     }
     /** Creates a new empty Precondition. */    static none() {
-        return new ve;
+        return new Re;
     }
     /** Creates a new Precondition with an exists flag. */    static exists(t) {
-        return new ve(void 0, t);
+        return new Re(void 0, t);
     }
     /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {
-        return new ve(t);
+        return new Re(t);
     }
     /** Returns whether this Precondition is empty. */    get isNone() {
         return void 0 === this.updateTime && void 0 === this.exists;
@@ -2624,16 +3092,19 @@ function we(t, e) {
  * applyToLocalView() to implement the actual behavior of applying the mutation
  * to some source document (see `setMutationApplyToRemoteDocument()` for an
  * example).
- */ class Ee {}
+ */ class Pe {}
 
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class Te extends Ee {
+ */ class Ve extends Pe {
     constructor(t, e, n, r = []) {
         super(), this.key = t, this.value = e, this.precondition = n, this.fieldTransforms = r, 
         this.type = 0 /* Set */;
     }
+    getFieldMask() {
+        return null;
+    }
 }
 
 /**
@@ -2648,17 +3119,23 @@ function we(t, e) {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ class Ae extends Ee {
+ */ class Ne extends Pe {
     constructor(t, e, n, r, s = []) {
         super(), this.key = t, this.data = e, this.fieldMask = n, this.precondition = r, 
         this.fieldTransforms = s, this.type = 1 /* Patch */;
     }
+    getFieldMask() {
+        return this.fieldMask;
+    }
 }
 
-/** A mutation that deletes the document at the given key. */ class Ie extends Ee {
+/** A mutation that deletes the document at the given key. */ class De extends Pe {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 2 /* Delete */ , this.fieldTransforms = [];
     }
+    getFieldMask() {
+        return null;
+    }
 }
 
 /**
@@ -2667,10 +3144,13 @@ function we(t, e) {
  *
  * The `verify` operation is only used in Transactions, and this class serves
  * primarily to facilitate serialization into protos.
- */ class Re extends Ee {
+ */ class $e extends Pe {
     constructor(t, e) {
         super(), this.key = t, this.precondition = e, this.type = 3 /* Verify */ , this.fieldTransforms = [];
     }
+    getFieldMask() {
+        return null;
+    }
 }
 
 /**
@@ -2688,13 +3168,13 @@ function we(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const Pe = (() => {
+ */ const xe = (() => {
     const t = {
         asc: "ASCENDING",
         desc: "DESCENDING"
     };
     return t;
-})(), Ve = (() => {
+})(), Fe = (() => {
     const t = {
         "<": "LESS_THAN",
         "<=": "LESS_THAN_OR_EQUAL",
@@ -2724,9 +3204,9 @@ function we(t, e) {
  * TODO(klimt): We can remove the databaseId argument if we keep the full
  * resource name in documents.
  */
-class De {
+class Se {
     constructor(t, e) {
-        this.databaseId = t, this.F = e;
+        this.databaseId = t, this.S = e;
     }
 }
 
@@ -2741,8 +3221,8 @@ class De {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Ne(t, e) {
-    if (t.F) {
+function qe(t, e) {
+    if (t.S) {
         return `${new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + e.nanoseconds).slice(-9)}Z`;
     }
     return {
@@ -2756,129 +3236,129 @@ function Ne(t, e) {
  *
  * Visible for testing.
  */
-function $e(t, e) {
-    return t.F ? e.toBase64() : e.toUint8Array();
+function Oe(t, e) {
+    return t.S ? e.toBase64() : e.toUint8Array();
 }
 
-function Se(t, e) {
-    return Ne(t, e.toTimestamp());
+function ke(t, e) {
+    return qe(t, e.toTimestamp());
 }
 
-function xe(t) {
-    return b(!!t), bt.fromTimestamp(function(t) {
-        const e = Rt(t);
+function Ce(t) {
+    return v(!!t), vt.fromTimestamp(function(t) {
+        const e = $t(t);
         return new gt(e.seconds, e.nanos);
     }(t));
 }
 
-function Fe(t, e) {
+function Le(t, e) {
     return function(t) {
         return new X([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
-function qe(t, e) {
-    return Fe(t.databaseId, e.path);
+function Me(t, e) {
+    return Le(t.databaseId, e.path);
 }
 
-function Oe(t, e) {
+function Ue(t, e) {
     const n = function(t) {
         const e = X.fromString(t);
-        return b(We(e)), e;
+        return v(Xe(e)), e;
     }(e);
-    if (n.get(1) !== t.databaseId.projectId) throw new U(I, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
-    if (n.get(3) !== t.databaseId.database) throw new U(I, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
-    return new et((b((r = n).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
+    if (n.get(1) !== t.databaseId.projectId) throw new L(A, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
+    if (n.get(3) !== t.databaseId.database) throw new L(A, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
+    return new et((v((r = n).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
     var r;
     /** Creates a Document proto from key and fields (but no create/update time) */}
 
-function Ce(t, e) {
-    return Fe(t.databaseId, e);
+function je(t, e) {
+    return Le(t.databaseId, e);
 }
 
-function Le(t) {
+function Be(t) {
     return new X([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Ue(t, e, n) {
+function ze(t, e, n) {
     return {
-        name: qe(t, e),
+        name: Me(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function ke(t, e) {
+function Ge(t, e) {
     return "found" in e ? function(t, e) {
-        b(!!e.found), e.found.name, e.found.updateTime;
-        const n = Oe(t, e.found.name), r = xe(e.found.updateTime), s = new zt({
+        v(!!e.found), e.found.name, e.found.updateTime;
+        const n = Ue(t, e.found.name), r = Ce(e.found.updateTime), s = new Yt({
             mapValue: {
                 fields: e.found.fields
             }
         });
-        return Gt.newFoundDocument(n, r, s);
+        return Ht.newFoundDocument(n, r, s);
     }(t, e) : "missing" in e ? function(t, e) {
-        b(!!e.missing), b(!!e.readTime);
-        const n = Oe(t, e.missing), r = xe(e.readTime);
-        return Gt.newNoDocument(n, r);
+        v(!!e.missing), v(!!e.readTime);
+        const n = Ue(t, e.missing), r = Ce(e.readTime);
+        return Ht.newNoDocument(n, r);
     }(t, e) : g();
 }
 
-function je(t, e) {
+function We(t, e) {
     let n;
-    if (e instanceof Te) n = {
-        update: Ue(t, e.key, e.value)
-    }; else if (e instanceof Ie) n = {
-        delete: qe(t, e.key)
-    }; else if (e instanceof Ae) n = {
-        update: Ue(t, e.key, e.data),
-        updateMask: Qe(e.fieldMask)
+    if (e instanceof Ve) n = {
+        update: ze(t, e.key, e.value)
+    }; else if (e instanceof De) n = {
+        delete: Me(t, e.key)
+    }; else if (e instanceof Ne) n = {
+        update: ze(t, e.key, e.data),
+        updateMask: Je(e.fieldMask)
     }; else {
-        if (!(e instanceof Re)) return g();
+        if (!(e instanceof $e)) return g();
         n = {
-            verify: qe(t, e.key)
+            verify: Me(t, e.key)
         };
     }
     return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((t => function(t, e) {
         const n = e.transform;
-        if (n instanceof pe) return {
+        if (n instanceof be) return {
             fieldPath: e.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
-        if (n instanceof ye) return {
+        if (n instanceof Ee) return {
             fieldPath: e.field.canonicalString(),
             appendMissingElements: {
                 values: n.elements
             }
         };
-        if (n instanceof _e) return {
+        if (n instanceof Te) return {
             fieldPath: e.field.canonicalString(),
             removeAllFromArray: {
                 values: n.elements
             }
         };
-        if (n instanceof ge) return {
+        if (n instanceof Ie) return {
             fieldPath: e.field.canonicalString(),
             increment: n.O
         };
         throw g();
     }(0, t)))), e.precondition.isNone || (n.currentDocument = function(t, e) {
         return void 0 !== e.updateTime ? {
-            updateTime: Se(t, e.updateTime)
+            updateTime: ke(t, e.updateTime)
         } : void 0 !== e.exists ? {
             exists: e.exists
         } : g();
     }(t, e.precondition)), n;
 }
 
-function Me(t, e) {
+function Ke(t, e) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const n = {
         structuredQuery: {}
     }, r = e.path;
-    null !== e.collectionGroup ? (n.parent = Ce(t, r), n.structuredQuery.from = [ {
+    null !== e.collectionGroup ? (n.parent = je(t, r), n.structuredQuery.from = [ {
         collectionId: e.collectionGroup,
         allDescendants: !0
-    } ]) : (n.parent = Ce(t, r.popLast()), n.structuredQuery.from = [ {
+    } ]) : (n.parent = je(t, r.popLast()), n.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     const s = function(t) {
@@ -2887,36 +3367,36 @@ function Me(t, e) {
         // visible for testing
         function(t) {
             if ("==" /* EQUAL */ === t.op) {
-                if (jt(t.value)) return {
+                if (Wt(t.value)) return {
                     unaryFilter: {
-                        field: Ge(t.field),
+                        field: He(t.field),
                         op: "IS_NAN"
                     }
                 };
-                if (kt(t.value)) return {
+                if (Gt(t.value)) return {
                     unaryFilter: {
-                        field: Ge(t.field),
+                        field: He(t.field),
                         op: "IS_NULL"
                     }
                 };
             } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                if (jt(t.value)) return {
+                if (Wt(t.value)) return {
                     unaryFilter: {
-                        field: Ge(t.field),
+                        field: He(t.field),
                         op: "IS_NOT_NAN"
                     }
                 };
-                if (kt(t.value)) return {
+                if (Gt(t.value)) return {
                     unaryFilter: {
-                        field: Ge(t.field),
+                        field: He(t.field),
                         op: "IS_NOT_NULL"
                     }
                 };
             }
             return {
                 fieldFilter: {
-                    field: Ge(t.field),
-                    op: ze(t.op),
+                    field: He(t.field),
+                    op: Ye(t.op),
                     value: t.value
                 }
             };
@@ -2936,14 +3416,14 @@ function Me(t, e) {
         // visible for testing
         function(t) {
             return {
-                field: Ge(t.field),
-                direction: Be(t.dir)
+                field: He(t.field),
+                direction: Qe(t.dir)
             };
         }(t)));
     }(e.orderBy);
     i && (n.structuredQuery.orderBy = i);
     const o = function(t, e) {
-        return t.F || ct(e) ? e : {
+        return t.S || ct(e) ? e : {
             value: e
         };
     }(t, e.limit);
@@ -2961,29 +3441,29 @@ function Me(t, e) {
     (e.endAt)), n;
 }
 
-function Be(t) {
-    return Pe[t];
+function Qe(t) {
+    return xe[t];
 }
 
 // visible for testing
-function ze(t) {
-    return Ve[t];
+function Ye(t) {
+    return Fe[t];
 }
 
-function Ge(t) {
+function He(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Qe(t) {
+function Je(t) {
     const e = [];
     return t.fields.forEach((t => e.push(t.canonicalString()))), {
         fieldPaths: e
     };
 }
 
-function We(t) {
+function Xe(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -3003,8 +3483,8 @@ function We(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 Ye(t) {
-    return new De(t, /* useProto3Json= */ !0);
+ */ function Ze(t) {
+    return new Se(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -3032,7 +3512,7 @@ function We(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class He {
+class tn {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3057,7 +3537,7 @@ class He {
      * Note that jitter will still be applied, so the actual delay could be as
      * much as 1.5*maxDelayMs.
      */ , s = 6e4) {
-        this.C = t, this.timerId = e, this.L = n, this.U = r, this.k = s, this.j = 0, this.M = null, 
+        this.k = t, this.timerId = e, this.C = n, this.L = r, this.M = s, this.U = 0, this.j = null, 
         /** The last backoff attempt, as epoch milliseconds. */
         this.B = Date.now(), this.reset();
     }
@@ -3068,13 +3548,13 @@ class He {
      * (i.e. due to an error), initialDelayMs (plus jitter) will be used, and
      * subsequent ones will increase according to the backoffFactor.
      */    reset() {
-        this.j = 0;
+        this.U = 0;
     }
     /**
      * Resets the backoff delay to the maximum delay (e.g. for use after a
      * RESOURCE_EXHAUSTED error).
      */    G() {
-        this.j = this.k;
+        this.U = this.M;
     }
     /**
      * Returns a promise that resolves after currentDelayMs, and increases the
@@ -3085,23 +3565,23 @@ class He {
         this.cancel();
         // First schedule using the current base (which may be 0 and should be
         // honored as such).
-        const e = Math.floor(this.j + this.Y()), n = Math.max(0, Date.now() - this.B), r = Math.max(0, e - n);
+        const e = Math.floor(this.U + this.K()), n = Math.max(0, Date.now() - this.B), r = Math.max(0, e - n);
         // 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: ${e} ms, last attempt: ${n} ms ago)`), 
-        this.M = this.C.enqueueAfterDelay(this.timerId, r, (() => (this.B = Date.now(), 
+                r > 0 && m("ExponentialBackoff", `Backing off for ${r} ms (base delay: ${this.U} ms, delay with jitter: ${e} ms, last attempt: ${n} ms ago)`), 
+        this.j = this.k.enqueueAfterDelay(this.timerId, r, (() => (this.B = Date.now(), 
         t()))), 
         // Apply backoff factor to determine next delay and ensure it is within
         // bounds.
-        this.j *= this.U, this.j < this.L && (this.j = this.L), this.j > this.k && (this.j = this.k);
+        this.U *= this.L, this.U < this.C && (this.U = this.C), this.U > this.M && (this.U = this.M);
     }
-    H() {
-        null !== this.M && (this.M.skipDelay(), this.M = null);
+    Y() {
+        null !== this.j && (this.j.skipDelay(), this.j = null);
     }
     cancel() {
-        null !== this.M && (this.M.cancel(), this.M = null);
+        null !== this.j && (this.j.cancel(), this.j = null);
     }
-    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */    Y() {
-        return (Math.random() - .5) * this.j;
+    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */    K() {
+        return (Math.random() - .5) * this.U;
     }
 }
 
@@ -3130,24 +3610,24 @@ class He {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class Ke extends class {} {
+class en extends class {} {
     constructor(t, e, n, r) {
-        super(), this.authCredentials = t, this.appCheckCredentials = e, this.K = n, this.q = r, 
+        super(), this.authCredentials = t, this.appCheckCredentials = e, this.H = n, this.q = r, 
         this.J = !1;
     }
     X() {
-        if (this.J) throw new U(S, "The client has already been terminated.");
+        if (this.J) throw new L(x, "The client has already been terminated.");
     }
     /** Invokes the provided RPC with auth and AppCheck tokens. */    m(t, e, n) {
-        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.K.m(t, e, n, r, s))).catch((t => {
-            throw "FirebaseError" === t.name ? (t.code === N && (this.authCredentials.invalidateToken(), 
-            this.appCheckCredentials.invalidateToken()), t) : new U(A, t.toString());
+        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.H.m(t, e, n, r, s))).catch((t => {
+            throw "FirebaseError" === t.name ? (t.code === D && (this.authCredentials.invalidateToken(), 
+            this.appCheckCredentials.invalidateToken()), t) : new L(I, t.toString());
         }));
     }
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */    T(t, e, n) {
-        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.K.T(t, e, n, r, s))).catch((t => {
-            throw "FirebaseError" === t.name ? (t.code === N && (this.authCredentials.invalidateToken(), 
-            this.appCheckCredentials.invalidateToken()), t) : new U(A, t.toString());
+        return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.H.T(t, e, n, r, s))).catch((t => {
+            throw "FirebaseError" === t.name ? (t.code === D && (this.authCredentials.invalidateToken(), 
+            this.appCheckCredentials.invalidateToken()), t) : new L(I, t.toString());
         }));
     }
     terminate() {
@@ -3157,38 +3637,38 @@ class Ke extends class {} {
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function Je(t, e) {
-    const n = v(t), r = Le(n.q) + "/documents", s = {
-        writes: e.map((t => je(n.q, t)))
+async function nn(t, e) {
+    const n = b(t), r = Be(n.q) + "/documents", s = {
+        writes: e.map((t => We(n.q, t)))
     };
     await n.m("Commit", r, s);
 }
 
-async function Xe(t, e) {
-    const n = v(t), r = Le(n.q) + "/documents", s = {
-        documents: e.map((t => qe(n.q, t)))
+async function rn(t, e) {
+    const n = b(t), r = Be(n.q) + "/documents", s = {
+        documents: e.map((t => Me(n.q, t)))
     }, i = await n.T("BatchGetDocuments", r, s), o = new Map;
     i.forEach((t => {
-        const e = ke(n.q, t);
+        const e = Ge(n.q, t);
         o.set(e.key.toString(), e);
     }));
     const u = [];
     return e.forEach((t => {
         const e = o.get(t.toString());
-        b(!!e), u.push(e);
+        v(!!e), u.push(e);
     })), u;
 }
 
-async function Ze(t, e) {
-    const n = v(t), r = Me(n.q, fe(e));
+async function sn(t, e) {
+    const n = b(t), r = Ke(n.q, ye(e));
     return (await n.T("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, e, n) {
-        const r = Oe(t, e.name), s = xe(e.updateTime), i = new zt({
+        const r = Ue(t, e.name), s = Ce(e.updateTime), i = new Yt({
             mapValue: {
                 fields: e.fields
             }
-        }), o = Gt.newFoundDocument(r, s, i);
+        }), o = Ht.newFoundDocument(r, s, i);
         return n && o.setHasCommittedMutations(), n ? o.setHasCommittedMutations() : o;
     }(n.q, t.document, void 0)));
 }
@@ -3208,7 +3688,7 @@ async function Ze(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const tn = new Map;
+ */ const on = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3219,17 +3699,17 @@ async function Ze(t, e) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function en(t) {
-    if (t._terminated) throw new U(S, "The client has already been terminated.");
-    if (!tn.has(t)) {
+function un(t) {
+    if (t._terminated) throw new L(x, "The client has already been terminated.");
+    if (!on.has(t)) {
         m("ComponentProvider", "Initializing Datastore");
         const i = function(t) {
             return new wt(t, fetch.bind(null));
         }((e = t._databaseId, n = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
-        new H(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Ye(t._databaseId), u = function(t, e, n, r) {
-            return new Ke(t, e, n, r);
+        new Y(e, n, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Ze(t._databaseId), u = function(t, e, n, r) {
+            return new en(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, i, o);
-        tn.set(t, u);
+        on.set(t, u);
     }
     var e, n, r, s;
     /**
@@ -3247,7 +3727,7 @@ function en(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 tn.get(t);
+ */    return on.get(t);
 }
 
 /**
@@ -3259,21 +3739,21 @@ function en(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 nn {
+class cn {
     constructor(t) {
         var e;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new U(I, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new L(A, "Can't provide ssl option if host option is not set");
             this.host = "firestore.googleapis.com", this.ssl = true;
         } else this.host = t.host, this.ssl = null === (e = t.ssl) || void 0 === e || e;
         if (this.credentials = t.credentials, this.ignoreUndefinedProperties = !!t.ignoreUndefinedProperties, 
         void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
-            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new U(I, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new L(A, "cacheSizeBytes must be at least 1048576");
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
         this.useFetchStreams = !!t.useFetchStreams, function(t, e, n, r) {
-            if (!0 === e && !0 === r) throw new U(I, `${t} and ${n} cannot be used together.`);
+            if (!0 === e && !0 === r) throw new L(A, `${t} and ${n} cannot be used together.`);
         }("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
     }
     isEqual(t) {
@@ -3301,18 +3781,18 @@ class nn {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class rn {
+ */ class an {
     /** @hideconstructor */
     constructor(t, e, n) {
         this._authCredentials = e, this._appCheckCredentials = n, 
         /**
          * Whether it's a Firestore or Firestore Lite instance.
          */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new nn({}), 
-        this._settingsFrozen = !1, t instanceof K ? this._databaseId = t : (this._app = t, 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new cn({}), 
+        this._settingsFrozen = !1, t instanceof H ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
-            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(I, '"projectId" not provided in firebase.initializeApp.');
-            return new K(t.options.projectId);
+            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new L(A, '"projectId" not provided in firebase.initializeApp.');
+            return new H(t.options.projectId);
         }
         /**
  * Initializes a new instance of Cloud Firestore with the provided settings.
@@ -3330,7 +3810,7 @@ class nn {
      * The {@link @firebase/app#FirebaseApp} associated with this `Firestore` service
      * instance.
      */    get app() {
-        if (!this._app) throw new U(S, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+        if (!this._app) throw new L(x, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
         return this._app;
     }
     get _initialized() {
@@ -3340,21 +3820,21 @@ class nn {
         return void 0 !== this._terminateTask;
     }
     _setSettings(t) {
-        if (this._settingsFrozen) throw new U(S, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
-        this._settings = new nn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
-            if (!t) return new M;
+        if (this._settingsFrozen) throw new L(x, "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 cn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+            if (!t) return new j;
             switch (t.type) {
               case "gapi":
                 const e = t.client;
                 // Make sure this really is a Gapi client.
-                                return b(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
-                new Q(e, t.sessionIndex || "0", t.iamToken || null);
+                                return v(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
+                new W(e, t.sessionIndex || "0", t.iamToken || null);
 
               case "provider":
                 return t.client;
 
               default:
-                throw new U(I, "makeAuthCredentialsProvider failed due to invalid credential type");
+                throw new L(A, "makeAuthCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }
@@ -3382,15 +3862,15 @@ class nn {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const e = tn.get(t);
-            e && (m("ComponentProvider", "Removing Datastore"), tn.delete(t), e.terminate());
+            const e = on.get(t);
+            e && (m("ComponentProvider", "Removing Datastore"), on.delete(t), e.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function sn(t, e) {
+function hn(t, e) {
     const n = _getProvider(t, "firestore/lite");
-    if (n.isInitialized()) throw new U(S, "Firestore can only be initialized once per app.");
+    if (n.isInitialized()) throw new L(x, "Firestore can only be initialized once per app.");
     return n.initialize({
         options: e
     });
@@ -3404,7 +3884,7 @@ function sn(t, 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 on(e = getApp()) {
+ */ function ln(e = getApp()) {
     return _getProvider(e, "firestore/lite").getImmediate();
 }
 
@@ -3420,9 +3900,9 @@ function sn(t, e) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function un(t, e, n, r = {}) {
+ */ function fn(t, e, n, r = {}) {
     var s;
-    const i = (t = ot(t, rn))._getSettings();
+    const i = (t = ot(t, an))._getSettings();
     if ("firestore.googleapis.com" !== i.host && i.host !== e && y("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, i), {
         host: `${e}:${n}`,
@@ -3434,10 +3914,10 @@ function sn(t, e) {
             // invalid field "uid" and missing field "sub" / "user_id".)
             e = createMockUserToken(r.mockUserToken, null === (s = t._app) || void 0 === s ? void 0 : s.options.projectId);
             const i = r.mockUserToken.sub || r.mockUserToken.user_id;
-            if (!i) throw new U(I, "mockUserToken must contain 'sub' or 'user_id' field!");
+            if (!i) throw new L(A, "mockUserToken must contain 'sub' or 'user_id' field!");
             n = new l(i);
         }
-        t._authCredentials = new B(new j(e, n));
+        t._authCredentials = new B(new U(e, n));
     }
 }
 
@@ -3460,8 +3940,8 @@ function sn(t, e) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function cn(t) {
-    return t = ot(t, rn), _removeServiceInstance(t.app, "firestore/lite"), t._delete();
+ */ function dn(t) {
+    return t = ot(t, an), _removeServiceInstance(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3501,7 +3981,7 @@ function sn(t, 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 an {
+class wn {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -3529,17 +4009,17 @@ class an {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new ln(this.firestore, this.converter, this._key.path.popLast());
+        return new pn(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new an(this.firestore, t, this._key);
+        return new wn(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 hn {
+ */ class mn {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -3552,17 +4032,17 @@ class an {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new hn(this.firestore, t, this._query);
+        return new mn(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 ln extends hn {
+ */ class pn extends mn {
     /** @hideconstructor */
     constructor(t, e, n) {
-        super(t, e, new ue(n)), this._path = n, 
+        super(t, e, new fe(n)), this._path = n, 
         /** The type of this Firestore reference. */
         this.type = "collection";
     }
@@ -3580,23 +4060,23 @@ class an {
      * subcollection. If this isn't a subcollection, the reference is null.
      */    get parent() {
         const t = this._path.popLast();
-        return t.isEmpty() ? null : new an(this.firestore, 
+        return t.isEmpty() ? null : new wn(this.firestore, 
         /* converter= */ null, new et(t));
     }
     withConverter(t) {
-        return new ln(this.firestore, t, this._path);
+        return new pn(this.firestore, t, this._path);
     }
 }
 
-function fn(t, e, ...n) {
-    if (t = getModularInstance(t), nt("collection", "path", e), t instanceof rn) {
+function yn(t, e, ...n) {
+    if (t = getModularInstance(t), nt("collection", "path", e), t instanceof an) {
         const r = X.fromString(e, ...n);
-        return st(r), new ln(t, /* converter= */ null, r);
+        return st(r), new pn(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof an || t instanceof ln)) throw new U(I, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof wn || t instanceof pn)) throw new L(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(X.fromString(e, ...n));
-        return st(r), new ln(t.firestore, 
+        return st(r), new pn(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -3613,32 +4093,32 @@ function fn(t, e, ...n) {
  * collection or subcollection with this ID as the last segment of its path
  * will be included. Cannot contain a slash.
  * @returns The created `Query`.
- */ function dn(t, e) {
-    if (t = ot(t, rn), nt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new U(I, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new hn(t, 
+ */ function _n(t, e) {
+    if (t = ot(t, an), nt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new L(A, `Invalid collection ID '${e}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new mn(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 ue(X.emptyPath(), t);
+        return new fe(X.emptyPath(), t);
     }(e));
 }
 
-function wn(t, e, ...n) {
+function gn(t, e, ...n) {
     if (t = getModularInstance(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = pt.R()), nt("doc", "path", e), t instanceof rn) {
+    1 === arguments.length && (e = pt.R()), nt("doc", "path", e), t instanceof an) {
         const r = X.fromString(e, ...n);
-        return rt(r), new an(t, 
+        return rt(r), new wn(t, 
         /* converter= */ null, new et(r));
     }
     {
-        if (!(t instanceof an || t instanceof ln)) throw new U(I, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof wn || t instanceof pn)) throw new L(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(X.fromString(e, ...n));
-        return rt(r), new an(t.firestore, t instanceof ln ? t.converter : null, new et(r));
+        return rt(r), new wn(t.firestore, t instanceof pn ? t.converter : null, new et(r));
     }
 }
 
@@ -3649,8 +4129,8 @@ function wn(t, e, ...n) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function mn(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof an || t instanceof ln) && (e instanceof an || e instanceof ln) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+ */ function vn(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), (t instanceof wn || t instanceof pn) && (e instanceof wn || e instanceof pn) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -3661,8 +4141,8 @@ function wn(t, e, ...n) {
  * @param right - A `Query` to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function pn(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), t instanceof hn && e instanceof hn && (t.firestore === e.firestore && de(t._query, e._query) && t.converter === e.converter);
+ */ function bn(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), t instanceof mn && e instanceof mn && (t.firestore === e.firestore && _e(t._query, e._query) && t.converter === e.converter);
 }
 
 /**
@@ -3688,7 +4168,7 @@ function wn(t, e, ...n) {
  *
  * 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 yn {
+ */ class En {
     /**
      * 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.
@@ -3696,7 +4176,7 @@ function wn(t, e, ...n) {
      * @param fieldNames - A list of field names.
      */
     constructor(...t) {
-        for (let e = 0; e < t.length; ++e) if (0 === t[e].length) throw new U(I, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        for (let e = 0; e < t.length; ++e) if (0 === t[e].length) throw new L(A, "Invalid field name at argument $(i + 1). Field names must not be empty.");
         this._internalPath = new tt(t);
     }
     /**
@@ -3712,8 +4192,8 @@ function wn(t, e, ...n) {
 /**
  * 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 _n() {
-    return new yn("__name__");
+ */ function Tn() {
+    return new En("__name__");
 }
 
 /**
@@ -3734,7 +4214,7 @@ function wn(t, e, ...n) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class gn {
+ */ class In {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -3746,9 +4226,9 @@ function wn(t, e, ...n) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new gn(At.fromBase64String(t));
+            return new In(Nt.fromBase64String(t));
         } catch (t) {
-            throw new U(I, "Failed to construct data from Base64 string: " + t);
+            throw new L(A, "Failed to construct data from Base64 string: " + t);
         }
     }
     /**
@@ -3756,7 +4236,7 @@ function wn(t, e, ...n) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new gn(At.fromUint8Array(t));
+        return new In(Nt.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3808,7 +4288,7 @@ function wn(t, e, ...n) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class bn {
+ */ class An {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -3840,7 +4320,7 @@ function wn(t, e, ...n) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ class vn {
+ */ class Rn {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3848,8 +4328,8 @@ function wn(t, e, ...n) {
      * @param longitude - The longitude as number between -180 and 180.
      */
     constructor(t, e) {
-        if (!isFinite(t) || t < -90 || t > 90) throw new U(I, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(e) || e < -180 || e > 180) throw new U(I, "Longitude must be a number between -180 and 180, but was: " + e);
+        if (!isFinite(t) || t < -90 || t > 90) throw new L(A, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(e) || e < -180 || e > 180) throw new L(A, "Longitude must be a number between -180 and 180, but was: " + e);
         this._lat = t, this._long = e;
     }
     /**
@@ -3899,29 +4379,29 @@ function wn(t, e, ...n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const En = /^__.*__$/;
+ */ const Pn = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class Tn {
+/** The result of parsing document data (e.g. for a setData call). */ class Vn {
     constructor(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return null !== this.fieldMask ? new Ae(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Te(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new Ne(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Ve(t, this.data, e, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class An {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class Nn {
     constructor(t, 
     // The fieldMask does not include document transforms.
     e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     toMutation(t, e) {
-        return new Ae(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new Ne(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }
 }
 
-function In(t) {
+function Dn(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3939,7 +4419,7 @@ function In(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class Rn {
+/** A "context" object passed around while parsing user data. */ class $n {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3971,7 +4451,7 @@ function In(t) {
         return this.settings.tt;
     }
     /** Returns a new context with the specified settings overwritten. */    et(t) {
-        return new Rn(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+        return new $n(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
     nt(t) {
         var e;
@@ -3998,7 +4478,7 @@ function In(t) {
         });
     }
     ut(t) {
-        return Qn(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
+        return Jn(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
     }
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */    contains(t) {
         return void 0 !== this.fieldMask.find((e => t.isPrefixOf(e))) || void 0 !== this.fieldTransforms.find((e => t.isPrefixOf(e.field)));
@@ -4010,19 +4490,19 @@ function In(t) {
     }
     st(t) {
         if (0 === t.length) throw this.ut("Document fields must not be empty");
-        if (In(this.tt) && En.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
+        if (Dn(this.tt) && Pn.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
     }
 }
 
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ class Pn {
+ */ class xn {
     constructor(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.q = n || Ye(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.q = n || Ze(t);
     }
     /** Creates a new top-level parse context. */    ht(t, e, n, r = !1) {
-        return new Rn({
+        return new $n({
             tt: t,
             methodName: e,
             at: n,
@@ -4033,29 +4513,29 @@ function In(t) {
     }
 }
 
-function Vn(t) {
-    const e = t._freezeSettings(), n = Ye(t._databaseId);
-    return new Pn(t._databaseId, !!e.ignoreUndefinedProperties, n);
+function Fn(t) {
+    const e = t._freezeSettings(), n = Ze(t._databaseId);
+    return new xn(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function Dn(t, e, n, r, s, i = {}) {
+/** Parse document data from a set() call. */ function Sn(t, e, n, r, s, i = {}) {
     const o = t.ht(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, s);
-    Mn("Data must be an object, but it was:", o, r);
-    const u = kn(r, o);
+    Kn("Data must be an object, but it was:", o, r);
+    const u = Gn(r, o);
     let c, a;
-    if (i.merge) c = new Tt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
+    if (i.merge) c = new Vt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
         const t = [];
         for (const r of i.mergeFields) {
-            const s = Bn(e, r, n);
-            if (!o.contains(s)) throw new U(I, `Field '${s}' is specified in your field mask but missing from your input data.`);
-            Wn(t, s) || t.push(s);
+            const s = Qn(e, r, n);
+            if (!o.contains(s)) throw new L(A, `Field '${s}' is specified in your field mask but missing from your input data.`);
+            Xn(t, s) || t.push(s);
         }
-        c = new Tt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
+        c = new Vt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
     } else c = null, a = o.fieldTransforms;
-    return new Tn(new zt(u), c, a);
+    return new Vn(new Yt(u), c, a);
 }
 
-class Nn extends bn {
+class qn extends An {
     _toFieldTransform(t) {
         if (2 /* MergeSet */ !== t.tt) throw 1 /* Update */ === t.tt ? t.ut(`${this._methodName}() can only appear at the top level of your update data`) : t.ut(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
         // No transform to add for a delete, but we need to add it to our
@@ -4063,7 +4543,7 @@ class Nn extends bn {
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof Nn;
+        return t instanceof qn;
     }
 }
 
@@ -4082,8 +4562,8 @@ class Nn extends bn {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function $n(t, e, n) {
-    return new Rn({
+ */ function On(t, e, n) {
+    return new $n({
         tt: 3 /* Argument */ ,
         at: e.settings.at,
         methodName: t._methodName,
@@ -4091,23 +4571,23 @@ class Nn extends bn {
     }, e.databaseId, e.q, e.ignoreUndefinedProperties);
 }
 
-class Sn extends bn {
+class kn extends An {
     _toFieldTransform(t) {
-        return new be(t.path, new pe);
+        return new Ae(t.path, new be);
     }
     isEqual(t) {
-        return t instanceof Sn;
+        return t instanceof kn;
     }
 }
 
-class xn extends bn {
+class Cn extends An {
     constructor(t, e) {
         super(t), this.lt = e;
     }
     _toFieldTransform(t) {
-        const e = $n(this, t, 
-        /*array=*/ !0), n = this.lt.map((t => Un(t, e))), r = new ye(n);
-        return new be(t.path, r);
+        const e = On(this, t, 
+        /*array=*/ !0), n = this.lt.map((t => zn(t, e))), r = new Ee(n);
+        return new Ae(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4115,14 +4595,14 @@ class xn extends bn {
     }
 }
 
-class Fn extends bn {
+class Ln extends An {
     constructor(t, e) {
         super(t), this.lt = e;
     }
     _toFieldTransform(t) {
-        const e = $n(this, t, 
-        /*array=*/ !0), n = this.lt.map((t => Un(t, e))), r = new _e(n);
-        return new be(t.path, r);
+        const e = On(this, t, 
+        /*array=*/ !0), n = this.lt.map((t => zn(t, e))), r = new Te(n);
+        return new Ae(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4130,13 +4610,13 @@ class Fn extends bn {
     }
 }
 
-class qn extends bn {
+class Mn extends An {
     constructor(t, e) {
         super(t), this.ft = e;
     }
     _toFieldTransform(t) {
-        const e = new ge(t.q, we(t.q, this.ft));
-        return new be(t.path, e);
+        const e = new Ie(t.q, ge(t.q, this.ft));
+        return new Ae(t.path, e);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4144,50 +4624,50 @@ class qn extends bn {
     }
 }
 
-/** Parse update data from an update() call. */ function On(t, e, n, r) {
+/** Parse update data from an update() call. */ function Un(t, e, n, r) {
     const s = t.ht(1 /* Update */ , e, n);
-    Mn("Data must be an object, but it was:", s, r);
-    const i = [], o = zt.empty();
+    Kn("Data must be an object, but it was:", s, r);
+    const i = [], o = Yt.empty();
     Et(r, ((t, r) => {
-        const u = Gn(e, t, n);
+        const u = Hn(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = getModularInstance(r);
         const c = s.it(u);
-        if (r instanceof Nn) 
+        if (r instanceof qn) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = Un(r, c);
+            const t = zn(r, c);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
-    const u = new Tt(i);
-    return new An(o, u, s.fieldTransforms);
+    const u = new Vt(i);
+    return new Nn(o, u, s.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function Cn(t, e, n, r, s, i) {
-    const o = t.ht(1 /* Update */ , e, n), u = [ Bn(e, r, n) ], c = [ s ];
-    if (i.length % 2 != 0) throw new U(I, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
-    for (let t = 0; t < i.length; t += 2) u.push(Bn(e, i[t])), c.push(i[t + 1]);
-    const a = [], l = zt.empty();
+/** Parse update data from a list of field/value arguments. */ function jn(t, e, n, r, s, i) {
+    const o = t.ht(1 /* Update */ , e, n), u = [ Qn(e, r, n) ], c = [ s ];
+    if (i.length % 2 != 0) throw new L(A, `Function ${e}() needs to be called with an even number of arguments that alternate between field names and values.`);
+    for (let t = 0; t < i.length; t += 2) u.push(Qn(e, i[t])), c.push(i[t + 1]);
+    const a = [], l = Yt.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 (!Wn(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!Xn(a, u[t])) {
         const e = u[t];
         let n = c[t];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 n = getModularInstance(n);
         const r = o.it(e);
-        if (n instanceof Nn) 
+        if (n instanceof qn) 
         // Add it to the field mask, but don't add anything to updateData.
         a.push(e); else {
-            const t = Un(n, r);
+            const t = zn(n, r);
             null != t && (a.push(e), l.set(e, t));
         }
     }
-    const f = new Tt(a);
-    return new An(l, f, o.fieldTransforms);
+    const f = new Vt(a);
+    return new Nn(l, f, o.fieldTransforms);
 }
 
 /**
@@ -4196,8 +4676,8 @@ class qn extends bn {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function Ln(t, e, n, r = !1) {
-    return Un(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+ */ function Bn(t, e, n, r = !1) {
+    return zn(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -4208,12 +4688,12 @@ class qn extends bn {
  * 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 Un(t, e) {
-    if (jn(
+ */ function zn(t, e) {
+    if (Wn(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = getModularInstance(t))) return Mn("Unsupported field value:", e, t), kn(t, e);
-    if (t instanceof bn) 
+    t = getModularInstance(t))) return Kn("Unsupported field value:", e, t), Gn(t, e);
+    if (t instanceof An) 
     // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
     // (as doing so will overwrite the field directly prior to the transform
@@ -4225,7 +4705,7 @@ class qn extends bn {
  */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!In(e.tt)) throw e.ut(`${t._methodName}() can only be used with update() and set()`);
+        if (!Dn(e.tt)) throw e.ut(`${t._methodName}() can only be used with update() and set()`);
         if (!e.path) throw e.ut(`${t._methodName}() is not currently supported inside arrays`);
         const n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
@@ -4255,7 +4735,7 @@ class qn extends bn {
             const n = [];
             let r = 0;
             for (const s of t) {
-                let t = Un(s, e.ot(r));
+                let t = zn(s, e.ot(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4274,7 +4754,7 @@ class qn extends bn {
         if (null === (t = getModularInstance(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return we(e.q, t);
+        if ("number" == typeof t) return ge(e.q, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4284,7 +4764,7 @@ class qn extends bn {
         if (t instanceof Date) {
             const n = gt.fromDate(t);
             return {
-                timestampValue: Ne(e.q, n)
+                timestampValue: qe(e.q, n)
             };
         }
         if (t instanceof gt) {
@@ -4293,23 +4773,23 @@ class qn extends bn {
             // truncation immediately without waiting for the backend to do that.
             const n = new gt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Ne(e.q, n)
+                timestampValue: qe(e.q, n)
             };
         }
-        if (t instanceof vn) return {
+        if (t instanceof Rn) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof gn) return {
-            bytesValue: $e(e.q, t._byteString)
+        if (t instanceof In) return {
+            bytesValue: Oe(e.q, t._byteString)
         };
-        if (t instanceof an) {
+        if (t instanceof wn) {
             const n = e.databaseId, r = t.firestore._databaseId;
             if (!r.isEqual(n)) throw e.ut(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${n.projectId}/${n.database}`);
             return {
-                referenceValue: Fe(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: Le(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
         throw e.ut(`Unsupported field value: ${it(t)}`);
@@ -4323,13 +4803,13 @@ class qn extends bn {
  */ (t, e);
 }
 
-function kn(t, e) {
+function Gn(t, e) {
     const n = {};
     return !function(t) {
         for (const e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
         return !0;
     }(t) ? Et(t, ((t, r) => {
-        const s = Un(r, e.nt(t));
+        const s = zn(r, e.nt(t));
         null != s && (n[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -4341,12 +4821,12 @@ function kn(t, e) {
     };
 }
 
-function jn(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof gt || t instanceof vn || t instanceof gn || t instanceof an || t instanceof bn);
+function Wn(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof gt || t instanceof Rn || t instanceof In || t instanceof wn || t instanceof An);
 }
 
-function Mn(t, e, n) {
-    if (!jn(n) || !function(t) {
+function Kn(t, e, n) {
+    if (!Wn(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         const r = it(n);
@@ -4356,20 +4836,20 @@ function Mn(t, e, n) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function Bn(t, e, n) {
+ */ function Qn(t, e, n) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    e = getModularInstance(e)) instanceof yn) return e._internalPath;
-    if ("string" == typeof e) return Gn(t, e);
-    throw Qn("Field path arguments must be of type string or ", t, 
+    e = getModularInstance(e)) instanceof En) return e._internalPath;
+    if ("string" == typeof e) return Hn(t, e);
+    throw Jn("Field path arguments must be of type string or ", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
 }
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ const zn = new RegExp("[~\\*/\\[\\]]");
+ */ const Yn = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4379,29 +4859,29 @@ function Mn(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function Gn(t, e, n) {
-    if (e.search(zn) >= 0) throw Qn(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function Hn(t, e, n) {
+    if (e.search(Yn) >= 0) throw Jn(`Invalid field path (${e}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return new yn(...e.split("."))._internalPath;
+        return new En(...e.split("."))._internalPath;
     } catch (r) {
-        throw Qn(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw Jn(`Invalid field path (${e}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function Qn(t, e, n, r, s) {
+function Jn(t, e, n, r, s) {
     const i = r && !r.isEmpty(), o = void 0 !== s;
     let u = `Function ${e}() called with invalid data`;
     n && (u += " (via `toFirestore()`)"), u += ". ";
     let c = "";
     return (i || o) && (c += " (found", i && (c += ` in field ${r}`), o && (c += ` in document ${s}`), 
-    c += ")"), new U(I, u + t + c);
+    c += ")"), new L(A, u + t + c);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Wn(t, e) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Xn(t, e) {
     return t.some((t => t.isEqual(e)));
 }
 
@@ -4429,7 +4909,7 @@ function Qn(t, e, n, r, s) {
  * For a `DocumentSnapshot` that points to a non-existing document, any data
  * access will return 'undefined'. You can use the `exists()` method to
  * explicitly verify a document's existence.
- */ class Yn {
+ */ class Zn {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4445,7 +4925,7 @@ function Qn(t, e, n, r, s) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new an(this._firestore, this._converter, this._key);
+        return new wn(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -4465,7 +4945,7 @@ function Qn(t, e, n, r, s) {
             if (this._converter) {
                 // We only want to use the converter and create a new DocumentSnapshot
                 // if a converter has been provided.
-                const t = new Hn(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new tr(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4485,7 +4965,7 @@ function Qn(t, e, n, r, s) {
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     get(t) {
         if (this._document) {
-            const e = this._document.data.field(Xn("DocumentSnapshot.get", t));
+            const e = this._document.data.field(rr("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }
@@ -4501,7 +4981,7 @@ function Qn(t, e, n, r, s) {
  * `DocumentSnapshot`. Since query results contain only existing documents, the
  * `exists` property will always be true and `data()` will never return
  * 'undefined'.
- */ class Hn extends Yn {
+ */ class tr extends Zn {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -4519,7 +4999,7 @@ function Qn(t, e, n, r, s) {
  * array via the `docs` property or enumerated using the `forEach` method. The
  * number of documents can be determined via the `empty` and `size`
  * properties.
- */ class Kn {
+ */ class er {
     /** @hideconstructor */
     constructor(t, e) {
         this._docs = e, this.query = t;
@@ -4550,14 +5030,14 @@ function Qn(t, e, n, r, s) {
  * @param left - A snapshot to compare.
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
- */ function Jn(t, e) {
-    return t = getModularInstance(t), e = getModularInstance(e), t instanceof Yn && e instanceof Yn ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof Kn && e instanceof Kn && (pn(t.query, e.query) && _t(t.docs, e.docs, Jn));
+ */ function nr(t, e) {
+    return t = getModularInstance(t), e = getModularInstance(e), t instanceof Zn && e instanceof Zn ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof er && e instanceof er && (bn(t.query, e.query) && _t(t.docs, e.docs, nr));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function Xn(t, e) {
-    return "string" == typeof e ? Gn(t, e) : e instanceof yn ? e._internalPath : e._delegate._internalPath;
+ */ function rr(t, e) {
+    return "string" == typeof e ? Hn(t, e) : e instanceof En ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4584,7 +5064,7 @@ function Qn(t, e, n, r, s) {
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
  */
-class Zn {}
+class sr {}
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4594,40 +5074,40 @@ class Zn {}
  * @param queryConstraints - The list of {@link QueryConstraint}s to apply.
  * @throws if any of the provided query constraints cannot be combined with the
  * existing or new constraints.
- */ function tr(t, ...e) {
+ */ function ir(t, ...e) {
     for (const n of e) t = n._apply(t);
     return t;
 }
 
-class er extends Zn {
+class or extends sr {
     constructor(t, e, n) {
         super(), this.dt = t, this.wt = e, this.yt = n, this.type = "where";
     }
     _apply(t) {
-        const e = Vn(t.firestore), n = function(t, e, n, r, s, i, o) {
+        const e = Fn(t.firestore), n = function(t, e, n, r, s, i, o) {
             let u;
             if (s.isKeyField()) {
-                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new U(I, `Invalid Query. You can't perform '${i}' queries on documentId().`);
+                if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new L(A, `Invalid Query. You can't perform '${i}' queries on documentId().`);
                 if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
-                    pr(o, i);
+                    br(o, i);
                     const e = [];
-                    for (const n of o) e.push(mr(r, t, n));
+                    for (const n of o) e.push(vr(r, t, n));
                     u = {
                         arrayValue: {
                             values: e
                         }
                     };
-                } else u = mr(r, t, o);
-            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || pr(o, i), 
-            u = Ln(n, e, o, 
+                } else u = vr(r, t, o);
+            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || br(o, i), 
+            u = Bn(n, e, o, 
             /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
-            const c = Yt.create(s, i, u);
+            const c = Zt.create(s, i, u);
             return function(t, e) {
-                if (e.N()) {
-                    const n = ae(t);
-                    if (null !== n && !n.isEqual(e.field)) throw new U(I, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${n.toString()}' and '${e.field.toString()}'`);
-                    const r = ce(t);
-                    null !== r && yr(t, e.field, r);
+                if (e.D()) {
+                    const n = we(t);
+                    if (null !== n && !n.isEqual(e.field)) throw new L(A, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${n.toString()}' and '${e.field.toString()}'`);
+                    const r = de(t);
+                    null !== r && Er(t, e.field, r);
                 }
                 const n = function(t, e) {
                     for (const n of t.filters) if (e.indexOf(n.op) >= 0) return n.op;
@@ -4668,12 +5148,12 @@ class er extends Zn {
                 }(e.op));
                 if (null !== n) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
-                throw n === e.op ? new U(I, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new U(I, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
+                throw n === e.op ? new L(A, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new L(A, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
             }(t, c), c;
         }(t._query, "where", e, t.firestore._databaseId, this.dt, this.wt, this.yt);
-        return new hn(t.firestore, t.converter, function(t, e) {
+        return new mn(t.firestore, t.converter, function(t, e) {
             const n = t.filters.concat([ e ]);
-            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+            return new fe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }
 }
@@ -4688,25 +5168,25 @@ class er extends Zn {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function nr(t, e, n) {
-    const r = e, s = Xn("where", t);
-    return new er(s, r, n);
+ */ function ur(t, e, n) {
+    const r = e, s = rr("where", t);
+    return new or(s, r, n);
 }
 
-class rr extends Zn {
+class cr extends sr {
     constructor(t, e) {
         super(), this.dt = t, this._t = e, this.type = "orderBy";
     }
     _apply(t) {
         const e = function(t, e, n) {
-            if (null !== t.startAt) throw new U(I, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
-            if (null !== t.endAt) throw new U(I, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            const r = new se(e, n);
+            if (null !== t.startAt) throw new L(A, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new L(A, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            const r = new ae(e, n);
             return function(t, e) {
-                if (null === ce(t)) {
+                if (null === de(t)) {
                     // This is the first order by. It must match any inequality.
-                    const n = ae(t);
-                    null !== n && yr(t, n, e.field);
+                    const n = we(t);
+                    null !== n && Er(t, n, e.field);
                 }
             }(t, r), r;
         }
@@ -4721,10 +5201,10 @@ class rr extends Zn {
  * of the query or if any of the fields in the order by are an uncommitted
  * server timestamp.
  */ (t._query, this.dt, this._t);
-        return new hn(t.firestore, t.converter, function(t, e) {
+        return new mn(t.firestore, t.converter, function(t, e) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             const n = t.explicitOrderBy.concat([ e ]);
-            return new ue(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new fe(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }
 }
@@ -4737,19 +5217,19 @@ class rr extends Zn {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function sr(t, e = "asc") {
-    const n = e, r = Xn("orderBy", t);
-    return new rr(r, n);
+ */ function ar(t, e = "asc") {
+    const n = e, r = rr("orderBy", t);
+    return new cr(r, n);
 }
 
-class ir extends Zn {
+class hr extends sr {
     constructor(t, e, n) {
-        super(), this.type = t, this.gt = e, this.bt = n;
+        super(), this.type = t, this.gt = e, this.vt = n;
     }
     _apply(t) {
-        return new hn(t.firestore, t.converter, function(t, e, n) {
-            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
-        }(t._query, this.gt, this.bt));
+        return new mn(t.firestore, t.converter, function(t, e, n) {
+            return new fe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        }(t._query, this.gt, this.vt));
     }
 }
 
@@ -4758,8 +5238,8 @@ class ir extends Zn {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function or(t) {
-    return ut("limit", t), new ir("limit", t, "F" /* First */);
+ */ function lr(t) {
+    return ut("limit", t), new hr("limit", t, "F" /* First */);
 }
 
 /**
@@ -4770,56 +5250,56 @@ class ir extends Zn {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function ur(t) {
-    return ut("limitToLast", t), new ir("limitToLast", t, "L" /* Last */);
+ */ function fr(t) {
+    return ut("limitToLast", t), new hr("limitToLast", t, "L" /* Last */);
 }
 
-class cr extends Zn {
+class dr extends sr {
     constructor(t, e, n) {
-        super(), this.type = t, this.vt = e, this.Et = n;
+        super(), this.type = t, this.bt = e, this.Et = n;
     }
     _apply(t) {
-        const e = wr(t, this.type, this.vt, this.Et);
-        return new hn(t.firestore, t.converter, function(t, e) {
-            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+        const e = gr(t, this.type, this.bt, this.Et);
+        return new mn(t.firestore, t.converter, function(t, e) {
+            return new fe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
 }
 
-function ar(...t) {
-    return new cr("startAt", t, 
+function wr(...t) {
+    return new dr("startAt", t, 
     /*inclusive=*/ !0);
 }
 
-function hr(...t) {
-    return new cr("startAfter", t, 
+function mr(...t) {
+    return new dr("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
-class lr extends Zn {
+class pr extends sr {
     constructor(t, e, n) {
-        super(), this.type = t, this.vt = e, this.Et = n;
+        super(), this.type = t, this.bt = e, this.Et = n;
     }
     _apply(t) {
-        const e = wr(t, this.type, this.vt, this.Et);
-        return new hn(t.firestore, t.converter, function(t, e) {
-            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+        const e = gr(t, this.type, this.bt, this.Et);
+        return new mn(t.firestore, t.converter, function(t, e) {
+            return new fe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
 }
 
-function fr(...t) {
-    return new lr("endBefore", t, 
+function yr(...t) {
+    return new pr("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function dr(...t) {
-    return new lr("endAt", t, /*inclusive=*/ !0);
+function _r(...t) {
+    return new pr("endAt", t, /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function wr(t, e, n, r) {
-    if (n[0] = getModularInstance(n[0]), n[0] instanceof Yn) return function(t, e, n, r, s) {
-        if (!r) throw new U(P, `Can't use a DocumentSnapshot that doesn't exist for ${n}().`);
+/** Helper function to create a bound from a document or fields */ function gr(t, e, n, r) {
+    if (n[0] = getModularInstance(n[0]), n[0] instanceof Zn) return function(t, e, n, r, s) {
+        if (!r) throw new L(P, `Can't use a DocumentSnapshot that doesn't exist for ${n}().`);
         const i = [];
         // Because people expect to continue/end a query at the exact document
         // provided, we need to use the implicit sort order rather than the explicit
@@ -4828,42 +5308,42 @@ function dr(...t) {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-                for (const n of le(t)) if (n.field.isKeyField()) i.push(Lt(e, r.key)); else {
+                for (const n of pe(t)) if (n.field.isKeyField()) i.push(Bt(e, r.key)); else {
             const t = r.data.field(n.field);
-            if (Dt(t)) throw new U(I, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+            if (St(t)) throw new L(A, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
             if (null === t) {
                 const t = n.field.canonicalString();
-                throw new U(I, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
+                throw new L(A, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
             }
             i.push(t);
         }
-        return new re(i, s);
+        return new ce(i, s);
     }
     /**
  * Converts a list of field values to a `Bound` for the given query.
  */ (t._query, t.firestore._databaseId, e, n[0]._document, r);
     {
-        const s = Vn(t.firestore);
+        const s = Fn(t.firestore);
         return function(t, e, n, r, s, i) {
             // Use explicit order by's because it has to match the query the user made
             const o = t.explicitOrderBy;
-            if (s.length > o.length) throw new U(I, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
+            if (s.length > o.length) throw new L(A, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
             const u = [];
             for (let i = 0; i < s.length; i++) {
                 const c = s[i];
                 if (o[i].field.isKeyField()) {
-                    if ("string" != typeof c) throw new U(I, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
-                    if (!he(t) && -1 !== c.indexOf("/")) throw new U(I, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
+                    if ("string" != typeof c) throw new L(A, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
+                    if (!me(t) && -1 !== c.indexOf("/")) throw new L(A, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
                     const n = t.path.child(X.fromString(c));
-                    if (!et.isDocumentKey(n)) throw new U(I, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
+                    if (!et.isDocumentKey(n)) throw new L(A, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
                     const s = new et(n);
-                    u.push(Lt(e, s));
+                    u.push(Bt(e, s));
                 } else {
-                    const t = Ln(n, r, c);
+                    const t = Bn(n, r, c);
                     u.push(t);
                 }
             }
-            return new re(u, i);
+            return new ce(u, i);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -4873,28 +5353,28 @@ function dr(...t) {
     }
 }
 
-function mr(t, e, n) {
+function vr(t, e, n) {
     if ("string" == typeof (n = getModularInstance(n))) {
-        if ("" === n) throw new U(I, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!he(e) && -1 !== n.indexOf("/")) throw new U(I, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
+        if ("" === n) throw new L(A, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!me(e) && -1 !== n.indexOf("/")) throw new L(A, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
         const r = e.path.child(X.fromString(n));
-        if (!et.isDocumentKey(r)) throw new U(I, `Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
-        return Lt(t, new et(r));
+        if (!et.isDocumentKey(r)) throw new L(A, `Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
+        return Bt(t, new et(r));
     }
-    if (n instanceof an) return Lt(t, n._key);
-    throw new U(I, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${it(n)}.`);
+    if (n instanceof wn) return Bt(t, n._key);
+    throw new L(A, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${it(n)}.`);
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function pr(t, e) {
-    if (!Array.isArray(t) || 0 === t.length) throw new U(I, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);
-    if (t.length > 10) throw new U(I, `Invalid Query. '${e.toString()}' filters support a maximum of 10 elements in the value array.`);
+ */ function br(t, e) {
+    if (!Array.isArray(t) || 0 === t.length) throw new L(A, `Invalid Query. A non-empty array is required for '${e.toString()}' filters.`);
+    if (t.length > 10) throw new L(A, `Invalid Query. '${e.toString()}' filters support a maximum of 10 elements in the value array.`);
 }
 
-function yr(t, e, n) {
-    if (!n.isEqual(e)) throw new U(I, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${e.toString()}' and so you must also use '${e.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${n.toString()}' instead.`);
+function Er(t, e, n) {
+    if (!n.isEqual(e)) throw new L(A, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${e.toString()}' and so you must also use '${e.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${n.toString()}' instead.`);
 }
 
 /**
@@ -4944,7 +5424,7 @@ function yr(t, e, n) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function _r(t, e, n) {
+function Tr(t, e, n) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -4953,9 +5433,9 @@ function _r(t, e, n) {
     r;
 }
 
-class gr extends class {
+class Ir extends class {
     convertValue(t, e = "none") {
-        switch (xt(t)) {
+        switch (Ct(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -4963,7 +5443,7 @@ class gr extends class {
             return t.booleanValue;
 
           case 2 /* NumberValue */ :
-            return Pt(t.integerValue || t.doubleValue);
+            return xt(t.integerValue || t.doubleValue);
 
           case 3 /* TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -4975,7 +5455,7 @@ class gr extends class {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(Vt(t.bytesValue));
+            return this.convertBytes(Ft(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -5000,7 +5480,7 @@ class gr extends class {
         })), n;
     }
     convertGeoPoint(t) {
-        return new vn(Pt(t.latitude), Pt(t.longitude));
+        return new Rn(xt(t.latitude), xt(t.longitude));
     }
     convertArray(t, e) {
         return (t.values || []).map((t => this.convertValue(t, e)));
@@ -5008,24 +5488,24 @@ class gr extends class {
     convertServerTimestamp(t, e) {
         switch (e) {
           case "previous":
-            const n = Nt(t);
+            const n = qt(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp($t(t));
+            return this.convertTimestamp(Ot(t));
 
           default:
             return null;
         }
     }
     convertTimestamp(t) {
-        const e = Rt(t);
+        const e = $t(t);
         return new gt(e.seconds, e.nanos);
     }
     convertDocumentKey(t, e) {
         const n = X.fromString(t);
-        b(We(n));
-        const r = new K(n.get(1), n.get(3)), s = new et(n.popFirst(5));
+        v(Xe(n));
+        const r = new H(n.get(1), n.get(3)), s = new et(n.popFirst(5));
         return r.isEqual(e) || 
         // 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 (${e.projectId}/${e.database}) instead.`), 
@@ -5036,11 +5516,11 @@ class gr extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new gn(t);
+        return new In(t);
     }
     convertReference(t) {
         const e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new an(this.firestore, /* converter= */ null, e);
+        return new wn(this.firestore, /* converter= */ null, e);
     }
 }
 
@@ -5056,12 +5536,12 @@ class gr extends class {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function br(t) {
-    const e = en((t = ot(t, an)).firestore), n = new gr(t.firestore);
-    return Xe(e, [ t._key ]).then((e => {
-        b(1 === e.length);
+ */ function Ar(t) {
+    const e = un((t = ot(t, wn)).firestore), n = new Ir(t.firestore);
+    return rn(e, [ t._key ]).then((e => {
+        v(1 === e.length);
         const r = e[0];
-        return new Yn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new Zn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5076,33 +5556,33 @@ class gr extends class {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function vr(t) {
+ */ function Rr(t) {
     !function(t) {
-        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new U(q, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = ot(t, hn))._query);
-    const e = en(t.firestore), n = new gr(t.firestore);
-    return Ze(e, t._query).then((e => {
-        const r = e.map((e => new Hn(t.firestore, n, e.key, e, t.converter)));
+        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new L(q, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = ot(t, mn))._query);
+    const e = un(t.firestore), n = new Ir(t.firestore);
+    return sn(e, t._query).then((e => {
+        const r = e.map((e => new tr(t.firestore, n, e.key, e, t.converter)));
         return "L" /* Last */ === t._query.limitType && 
         // Limit to last queries reverse the orderBy constraint that was
         // specified by the user. As such, we need to reverse the order of the
         // results to return the documents in the expected order.
-        r.reverse(), new Kn(t, r);
+        r.reverse(), new er(t, r);
     }));
 }
 
-function Er(t, e, n) {
-    const r = _r((t = ot(t, an)).converter, e, n), s = Dn(Vn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return Je(en(t.firestore), [ s.toMutation(t._key, ve.none()) ]);
+function Pr(t, e, n) {
+    const r = Tr((t = ot(t, wn)).converter, e, n), s = Sn(Fn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return nn(un(t.firestore), [ s.toMutation(t._key, Re.none()) ]);
 }
 
-function Tr(t, e, n, ...r) {
-    const s = Vn((t = ot(t, an)).firestore);
+function Vr(t, e, n, ...r) {
+    const s = Fn((t = ot(t, wn)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    i = "string" == typeof (e = getModularInstance(e)) || e instanceof yn ? Cn(s, "updateDoc", t._key, e, n, r) : On(s, "updateDoc", t._key, e);
-    return Je(en(t.firestore), [ i.toMutation(t._key, ve.exists(!0)) ]);
+    i = "string" == typeof (e = getModularInstance(e)) || e instanceof En ? jn(s, "updateDoc", t._key, e, n, r) : Un(s, "updateDoc", t._key, e);
+    return nn(un(t.firestore), [ i.toMutation(t._key, Re.exists(!0)) ]);
 }
 
 /**
@@ -5116,8 +5596,8 @@ function Tr(t, e, n, ...r) {
  * @param reference - A reference to the document to delete.
  * @returns A `Promise` resolved once the document has been successfully
  * deleted from the backend.
- */ function Ar(t) {
-    return Je(en((t = ot(t, an)).firestore), [ new Ie(t._key, ve.none()) ]);
+ */ function Nr(t) {
+    return nn(un((t = ot(t, wn)).firestore), [ new De(t._key, Re.none()) ]);
 }
 
 /**
@@ -5134,9 +5614,9 @@ function Tr(t, e, n, ...r) {
  * @throws Error - If the provided input is not a valid Firestore document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function Ir(t, e) {
-    const n = wn(t = ot(t, ln)), r = _r(t.converter, e), s = Dn(Vn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return Je(en(t.firestore), [ s.toMutation(n._key, ve.exists(!1)) ]).then((() => n));
+ */ function Dr(t, e) {
+    const n = gn(t = ot(t, pn)), r = Tr(t.converter, e), s = Sn(Fn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return nn(un(t.firestore), [ s.toMutation(n._key, Re.exists(!1)) ]).then((() => n));
 }
 
 /**
@@ -5158,15 +5638,15 @@ function Tr(t, e, n, ...r) {
 /**
  * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or
  * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.
- */ function Rr() {
-    return new Nn("deleteField");
+ */ function $r() {
+    return new qn("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 Sn("serverTimestamp");
+ */ function xr() {
+    return new kn("serverTimestamp");
 }
 
 /**
@@ -5180,10 +5660,10 @@ function Tr(t, e, n, ...r) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function Vr(...t) {
+ */ function Fr(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-    return new xn("arrayUnion", t);
+    return new Cn("arrayUnion", t);
 }
 
 /**
@@ -5196,10 +5676,10 @@ function Tr(t, e, n, ...r) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Dr(...t) {
+ */ function Sr(...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 Fn("arrayRemove", t);
+    return new Ln("arrayRemove", t);
 }
 
 /**
@@ -5220,8 +5700,8 @@ function Tr(t, e, n, ...r) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Nr(t) {
-    return new qn("increment", t);
+ */ function qr(t) {
+    return new Mn("increment", t);
 }
 
 /**
@@ -5247,25 +5727,25 @@ function Tr(t, e, n, ...r) {
  * provides methods for adding writes to the write batch. None of the writes
  * will be committed (or visible locally) until {@link WriteBatch.commit} is
  * called.
- */ class $r {
+ */ class Or {
     /** @hideconstructor */
     constructor(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = Vn(t);
+        this._dataReader = Fn(t);
     }
     set(t, e, n) {
         this._verifyNotCommitted();
-        const r = Sr(t, this._firestore), s = _r(r.converter, e, n), i = Dn(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, n);
-        return this._mutations.push(i.toMutation(r._key, ve.none())), this;
+        const r = kr(t, this._firestore), s = Tr(r.converter, e, n), i = Sn(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, n);
+        return this._mutations.push(i.toMutation(r._key, Re.none())), this;
     }
     update(t, e, n, ...r) {
         this._verifyNotCommitted();
-        const s = Sr(t, this._firestore);
+        const s = kr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof yn ? Cn(this._dataReader, "WriteBatch.update", s._key, e, n, r) : On(this._dataReader, "WriteBatch.update", s._key, e), 
-        this._mutations.push(i.toMutation(s._key, ve.exists(!0))), this;
+        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof En ? jn(this._dataReader, "WriteBatch.update", s._key, e, n, r) : Un(this._dataReader, "WriteBatch.update", s._key, e), 
+        this._mutations.push(i.toMutation(s._key, Re.exists(!0))), this;
     }
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -5274,8 +5754,8 @@ function Tr(t, e, n, ...r) {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const e = Sr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Ie(e._key, ve.none())), this;
+        const e = kr(t, this._firestore);
+        return this._mutations = this._mutations.concat(new De(e._key, Re.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5292,12 +5772,12 @@ function Tr(t, e, n, ...r) {
         return this._verifyNotCommitted(), this._committed = !0, this._mutations.length > 0 ? this._commitHandler(this._mutations) : Promise.resolve();
     }
     _verifyNotCommitted() {
-        if (this._committed) throw new U(S, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new L(x, "A write batch can no longer be used after commit() has been called.");
     }
 }
 
-function Sr(t, e) {
-    if ((t = getModularInstance(t)).firestore !== e) throw new U(I, "Provided document reference is from a different Firestore instance.");
+function kr(t, e) {
+    if ((t = getModularInstance(t)).firestore !== e) throw new L(A, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -5313,9 +5793,9 @@ function Sr(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function xr(t) {
-    const e = en(t = ot(t, rn));
-    return new $r(t, (t => Je(e, t)));
+ */ function Cr(t) {
+    const e = un(t = ot(t, an));
+    return new Or(t, (t => nn(e, t)));
 }
 
 /**
@@ -5337,7 +5817,7 @@ function Sr(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ class Fr {
+ */ class Lr {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5356,8 +5836,8 @@ function Sr(t, e) {
         this.writtenDocs = new Set;
     }
     async lookup(t) {
-        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(I, "Firestore transactions require all reads to be executed before all writes.");
-        const e = await Xe(this.datastore, t);
+        if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new L(A, "Firestore transactions require all reads to be executed before all writes.");
+        const e = await rn(this.datastore, t);
         return e.forEach((t => this.recordVersion(t))), e;
     }
     set(t, e) {
@@ -5372,7 +5852,7 @@ function Sr(t, e) {
         this.writtenDocs.add(t.toString());
     }
     delete(t) {
-        this.write(new Ie(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new De(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }
     async commit() {
         if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
@@ -5385,21 +5865,21 @@ function Sr(t, e) {
         // a `verify` operation.
         t.forEach(((t, e) => {
             const n = et.fromPath(e);
-            this.mutations.push(new Re(n, this.precondition(n)));
-        })), await Je(this.datastore, this.mutations), this.committed = !0;
+            this.mutations.push(new $e(n, this.precondition(n)));
+        })), await nn(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let e;
         if (t.isFoundDocument()) e = t.version; else {
             if (!t.isNoDocument()) throw g();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
-            e = bt.min();
+            e = vt.min();
         }
         const n = this.readVersions.get(t.key.toString());
         if (n) {
             if (!e.isEqual(n)) 
             // This transaction will fail no matter what.
-            throw new U(x, "Document version changed between two reads.");
+            throw new L(F, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }
     /**
@@ -5407,7 +5887,7 @@ function Sr(t, e) {
      * as a precondition, or no precondition if it was not read.
      */    precondition(t) {
         const e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? ve.updateTime(e) : ve.none();
+        return !this.writtenDocs.has(t.toString()) && e ? Re.updateTime(e) : Re.none();
     }
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5416,7 +5896,7 @@ function Sr(t, e) {
         // The first time a document is written, we want to take into account the
         // read time and existence
                 if (!this.writtenDocs.has(t.toString()) && e) {
-            if (e.isEqual(bt.min())) 
+            if (e.isEqual(vt.min())) 
             // The document doesn't exist, so fail the transaction.
             // This has to be validated locally because you can't send a
             // precondition that a document does not exist without changing the
@@ -5426,13 +5906,13 @@ function Sr(t, e) {
             // express that to the backend, we have to validate locally.
             // Note: this can change once we can send separate verify writes in the
             // transaction.
-            throw new U(I, "Can't update a document that doesn't exist.");
+            throw new L(A, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return ve.updateTime(e);
+                        return Re.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-        return ve.exists(!0);
+        return Re.exists(!0);
     }
     write(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
@@ -5455,7 +5935,7 @@ function Sr(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const qr = {
+ */ const Mr = {
     maxAttempts: 5
 };
 
@@ -5479,17 +5959,17 @@ function Sr(t, e) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class Or {
+class Ur {
     constructor(t, e, n, r, s) {
         this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
-        this.deferred = s, this.Tt = n.maxAttempts, this.At = new He(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.deferred = s, this.Tt = n.maxAttempts, this.It = new tn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
-        this.Tt -= 1, this.It();
+        this.Tt -= 1, this.At();
     }
-    It() {
-        this.At.W((async () => {
-            const t = new Fr(this.datastore), e = this.Rt(t);
+    At() {
+        this.It.W((async () => {
+            const t = new Lr(this.datastore), e = this.Rt(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
@@ -5512,7 +5992,7 @@ class Or {
         }
     }
     Pt(t) {
-        this.Tt > 0 && this.Vt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((() => (this.It(), 
+        this.Tt > 0 && this.Vt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((() => (this.At(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
     Vt(t) {
@@ -5533,28 +6013,28 @@ class Or {
                     return g();
 
                   case T:
-                  case A:
+                  case I:
                   case R:
                   case $:
                   case O:
-                  case C:
+                  case k:
  // Unauthenticated means something went wrong with our token and we need
                     // to retry with new credentials which will happen automatically.
-                                      case N:
+                                      case D:
                     return !1;
 
-                  case I:
+                  case A:
                   case P:
                   case V:
-                  case D:
-                  case S:
+                  case N:
+                  case x:
  // 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 x:
-                  case F:
+                                      case F:
+                  case S:
                   case q:
-                  case L:
+                  case C:
                     return !0;
                 }
             }(e);
@@ -5579,7 +6059,7 @@ class Or {
  * 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 Cr() {
+/** The Platform's 'document' implementation or null if not available. */ function jr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5611,10 +6091,10 @@ class Or {
  * 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 Lr {
+ */ class Br {
     constructor(t, e, n, r, s) {
         this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = r, this.removalCallback = s, 
-        this.deferred = new k, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
+        this.deferred = new M, 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.
@@ -5634,7 +6114,7 @@ class Or {
      *   PORTING NOTE: This exists to prevent making removeDelayedOperation() and
      *   the DelayedOperation class public.
      */    static createAndSchedule(t, e, n, r, s) {
-        const i = Date.now() + n, o = new Lr(t, e, i, r, s);
+        const i = Date.now() + n, o = new Br(t, e, i, r, s);
         return o.start(n), o;
     }
     /**
@@ -5656,7 +6136,7 @@ class Or {
      * 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(T, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new L(T, "Operation cancelled" + (t ? ": " + t : ""))));
     }
     handleDelayElapsed() {
         this.asyncQueue.enqueueAndForget((() => null !== this.timerHandle ? (this.clearTimeout(), 
@@ -5683,39 +6163,39 @@ class Or {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class Ur {
+ */ class zr {
     constructor() {
         // The last promise in the queue.
-        this.Dt = Promise.resolve(), 
+        this.Nt = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.Nt = [], 
+        this.Dt = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
         this.$t = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.St = [], 
+        this.xt = [], 
         // visible for testing
-        this.xt = null, 
+        this.Ft = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.Ft = !1, 
+        this.St = !1, 
         // Enabled during shutdown on Safari to prevent future access to IndexedDB.
         this.qt = !1, 
         // List of TimerIds to fast-forward delays for.
         this.Ot = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.At = new He(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new tn(this, "async_queue_retry" /* AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
-        this.Ct = () => {
-            const t = Cr();
-            t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.At.H();
+        this.kt = () => {
+            const t = jr();
+            t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.Y();
         };
-        const t = Cr();
-        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ct);
+        const t = jr();
+        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.kt);
     }
     get isShuttingDown() {
         return this.$t;
@@ -5728,38 +6208,38 @@ class Or {
         this.enqueue(t);
     }
     enqueueAndForgetEvenWhileRestricted(t) {
-        this.Lt(), 
+        this.Ct(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.Ut(t);
+        this.Lt(t);
     }
     enterRestrictedMode(t) {
         if (!this.$t) {
             this.$t = !0, this.qt = t || !1;
-            const e = Cr();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ct);
+            const e = jr();
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.kt);
         }
     }
     enqueue(t) {
-        if (this.Lt(), this.$t) 
+        if (this.Ct(), this.$t) 
         // Return a Promise which never resolves.
         return new Promise((() => {}));
         // Create a deferred Promise that we can return to the callee. This
         // allows us to return a "hanging Promise" only to the callee and still
         // advance the queue even when the operation is not run.
-                const e = new k;
-        return this.Ut((() => this.$t && this.qt ? Promise.resolve() : (t().then(e.resolve, e.reject), 
+                const e = new M;
+        return this.Lt((() => this.$t && this.qt ? Promise.resolve() : (t().then(e.resolve, e.reject), 
         e.promise))).then((() => e.promise));
     }
     enqueueRetryable(t) {
-        this.enqueueAndForget((() => (this.Nt.push(t), this.kt())));
+        this.enqueueAndForget((() => (this.Dt.push(t), this.Mt())));
     }
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
-     */    async kt() {
-        if (0 !== this.Nt.length) {
+     */    async Mt() {
+        if (0 !== this.Dt.length) {
             try {
-                await this.Nt[0](), this.Nt.shift(), this.At.reset();
+                await this.Dt[0](), this.Dt.shift(), this.It.reset();
             } catch (t) {
                 if (!
                 /**
@@ -5803,7 +6283,7 @@ class Or {
  // Failure will be handled by AsyncQueue
                                 m("AsyncQueue", "Operation failed with retryable error: " + t);
             }
-            this.Nt.length > 0 && 
+            this.Dt.length > 0 && 
             // If there are additional operations, we re-schedule `retryNextOp()`.
             // This is necessary to run retryable operations that failed during
             // their initial attempt since we don't know whether they are already
@@ -5814,12 +6294,12 @@ class Or {
             // Since `backoffAndRun()` cancels an existing backoff and schedules a
             // new backoff on every call, there is only ever a single additional
             // operation in the queue.
-            this.At.W((() => this.kt()));
+            this.It.W((() => this.Mt()));
         }
     }
-    Ut(t) {
-        const e = this.Dt.then((() => (this.Ft = !0, t().catch((t => {
-            this.xt = t, this.Ft = !1;
+    Lt(t) {
+        const e = this.Nt.then((() => (this.St = !0, t().catch((t => {
+            this.Ft = t, this.St = !1;
             const e = 
             /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -5860,38 +6340,38 @@ class Or {
             // all further attempts to chain (via .then) will just short-circuit
             // and return the rejected Promise.
             throw p("INTERNAL UNHANDLED ERROR: ", e), t;
-        })).then((t => (this.Ft = !1, t))))));
-        return this.Dt = e, e;
+        })).then((t => (this.St = !1, t))))));
+        return this.Nt = e, e;
     }
     enqueueAfterDelay(t, e, n) {
-        this.Lt(), 
+        this.Ct(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ot.indexOf(t) > -1 && (e = 0);
-        const r = Lr.createAndSchedule(this, t, e, n, (t => this.jt(t)));
-        return this.St.push(r), r;
+        const r = Br.createAndSchedule(this, t, e, n, (t => this.Ut(t)));
+        return this.xt.push(r), r;
     }
-    Lt() {
-        this.xt && g();
+    Ct() {
+        this.Ft && g();
     }
     verifyOperationInProgress() {}
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
-     */    async Mt() {
+     */    async jt() {
         // Operations in the queue prior to draining may have enqueued additional
         // operations. Keep draining the queue until the tail is no longer advanced,
         // which indicates that no more new operations were enqueued and that all
         // operations were executed.
         let t;
         do {
-            t = this.Dt, await t;
-        } while (t !== this.Dt);
+            t = this.Nt, await t;
+        } while (t !== this.Nt);
     }
     /**
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
      */    Bt(t) {
-        for (const e of this.St) if (e.timerId === t) return !0;
+        for (const e of this.xt) if (e.timerId === t) return !0;
         return !1;
     }
     /**
@@ -5902,11 +6382,11 @@ class Or {
      * @returns a Promise that resolves once all operations have been run.
      */    zt(t) {
         // Note that draining may generate more delayed ops, so we do that first.
-        return this.Mt().then((() => {
+        return this.jt().then((() => {
             // Run ops in the same order they'd run if they ran naturally.
-            this.St.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
-            for (const e of this.St) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
-            return this.Mt();
+            this.xt.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
+            for (const e of this.xt) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
+            return this.jt();
         }));
     }
     /**
@@ -5914,17 +6394,17 @@ class Or {
      */    Gt(t) {
         this.Ot.push(t);
     }
-    /** Called once a DelayedOperation is run or canceled. */    jt(t) {
+    /** Called once a DelayedOperation is run or canceled. */    Ut(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        const e = this.St.indexOf(t);
-        this.St.splice(e, 1);
+        const e = this.xt.indexOf(t);
+        this.xt.splice(e, 1);
     }
 }
 
-class kr {
+class Gr {
     /** @hideconstructor */
     constructor(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = Vn(t);
+        this._firestore = t, this._transaction = e, this._dataReader = Fn(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -5932,25 +6412,25 @@ class kr {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const e = Sr(t, this._firestore), n = new gr(this._firestore);
+        const e = kr(t, this._firestore), n = new Ir(this._firestore);
         return this._transaction.lookup([ e._key ]).then((t => {
             if (!t || 1 !== t.length) return g();
             const r = t[0];
-            if (r.isFoundDocument()) return new Yn(this._firestore, n, r.key, r, e.converter);
-            if (r.isNoDocument()) return new Yn(this._firestore, n, e._key, null, e.converter);
+            if (r.isFoundDocument()) return new Zn(this._firestore, n, r.key, r, e.converter);
+            if (r.isNoDocument()) return new Zn(this._firestore, n, e._key, null, e.converter);
             throw g();
         }));
     }
     set(t, e, n) {
-        const r = Sr(t, this._firestore), s = _r(r.converter, e, n), i = Dn(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, n);
+        const r = kr(t, this._firestore), s = Tr(r.converter, e, n), i = Sn(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, n);
         return this._transaction.set(r._key, i), this;
     }
     update(t, e, n, ...r) {
-        const s = Sr(t, this._firestore);
+        const s = kr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof yn ? Cn(this._dataReader, "Transaction.update", s._key, e, n, r) : On(this._dataReader, "Transaction.update", s._key, e), 
+        return i = "string" == typeof (e = getModularInstance(e)) || e instanceof En ? jn(this._dataReader, "Transaction.update", s._key, e, n, r) : Un(this._dataReader, "Transaction.update", s._key, e), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -5959,7 +6439,7 @@ class kr {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const e = Sr(t, this._firestore);
+        const e = kr(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }
 }
@@ -5976,17 +6456,19 @@ class kr {
  * transaction against.
  * @param updateFunction - The function to execute within the transaction
  * context.
+ * @param options - An options object to configure maximum number of attempts to
+ * commit.
  * @returns If the transaction completed successfully or was explicitly aborted
  * (the `updateFunction` returned a failed promise), the promise returned by the
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
- */ function jr(t, e, n) {
-    const r = en(t = ot(t, rn)), s = Object.assign(Object.assign({}, qr), n);
+ */ function Wr(t, e, n) {
+    const r = un(t = ot(t, an)), s = Object.assign(Object.assign({}, Mr), n);
     !function(t) {
-        if (t.maxAttempts < 1) throw new U(I, "Max attempts must be at least 1");
+        if (t.maxAttempts < 1) throw new L(A, "Max attempts must be at least 1");
     }(s);
-    const i = new k;
-    return new Or(new Ur, r, s, (n => e(new kr(t, n))), i).run(), i.promise;
+    const i = new M;
+    return new Ur(new zr, r, s, (n => e(new Gr(t, n))), i).run(), i.promise;
 }
 
 /**
@@ -5999,11 +6481,11 @@ class kr {
  */ !function(t) {
     f = t;
 }(`${SDK_VERSION}_lite`), _registerComponent(new Component("firestore/lite", ((t, {options: e}) => {
-    const n = t.getProvider("app").getImmediate(), r = new rn(n, new z(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
+    const n = t.getProvider("app").getImmediate(), r = new an(n, new z(t.getProvider("auth-internal")), new Q(t.getProvider("app-check-internal")));
     return e && r._setSettings(e), r;
 }), "PUBLIC")), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-registerVersion("firestore-lite", "3.4.9", ""), registerVersion("firestore-lite", "3.4.9", "esm2017");
+registerVersion("firestore-lite", "3.4.10-canary.ebc17e27f", ""), registerVersion("firestore-lite", "3.4.10-canary.ebc17e27f", "esm2017");
 
-export { gn as Bytes, ln as CollectionReference, an as DocumentReference, Yn as DocumentSnapshot, yn as FieldPath, bn as FieldValue, rn as Firestore, U as FirestoreError, vn as GeoPoint, hn as Query, Zn as QueryConstraint, Hn as QueryDocumentSnapshot, Kn as QuerySnapshot, gt as Timestamp, kr as Transaction, $r as WriteBatch, Ir as addDoc, Dr as arrayRemove, Vr as arrayUnion, fn as collection, dn as collectionGroup, un as connectFirestoreEmulator, Ar as deleteDoc, Rr as deleteField, wn as doc, _n as documentId, dr as endAt, fr as endBefore, br as getDoc, vr as getDocs, on as getFirestore, Nr as increment, sn as initializeFirestore, or as limit, ur as limitToLast, sr as orderBy, tr as query, pn as queryEqual, mn as refEqual, jr as runTransaction, Pr as serverTimestamp, Er as setDoc, w as setLogLevel, Jn as snapshotEqual, hr as startAfter, ar as startAt, cn as terminate, Tr as updateDoc, nr as where, xr as writeBatch };
+export { In as Bytes, pn as CollectionReference, wn as DocumentReference, Zn as DocumentSnapshot, En as FieldPath, An as FieldValue, an as Firestore, L as FirestoreError, Rn as GeoPoint, mn as Query, sr as QueryConstraint, tr as QueryDocumentSnapshot, er as QuerySnapshot, gt as Timestamp, Gr as Transaction, Or as WriteBatch, Dr as addDoc, Sr as arrayRemove, Fr as arrayUnion, yn as collection, _n as collectionGroup, fn as connectFirestoreEmulator, Nr as deleteDoc, $r as deleteField, gn as doc, Tn as documentId, _r as endAt, yr as endBefore, Ar as getDoc, Rr as getDocs, ln as getFirestore, qr as increment, hn as initializeFirestore, lr as limit, fr as limitToLast, ar as orderBy, ir as query, bn as queryEqual, vn as refEqual, Wr as runTransaction, xr as serverTimestamp, Pr as setDoc, w as setLogLevel, nr as snapshotEqual, mr as startAfter, wr as startAt, dn as terminate, Vr as updateDoc, ur as where, Cr as writeBatch };
 //# sourceMappingURL=index.browser.esm2017.js.map