@firebase/firestore 3.4.9 → 3.4.10-canary.ebc17e27f

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

@@ -27,7 +27,7 @@ import { FirebaseError as h, getModularInstance as p, createMockUserToken as d }
 /**
  * Simple wrapper around a nullable UID. Mostly exists to make code more
  * readable.
- */ var m = /** @class */ function() {
+ */ var y = /** @class */ function() {
     function t(t) {
         this.uid = t;
     }
@@ -45,11 +45,11 @@ import { FirebaseError as h, getModularInstance as p, createMockUserToken as d }
     }, t;
 }();
 
-/** A user with a null UID. */ m.UNAUTHENTICATED = new m(null), 
+/** A user with a null UID. */ y.UNAUTHENTICATED = new y(null), 
 // TODO(mikelehen): Look into getting a proper uid-equivalent for
 // non-FirebaseAuth providers.
-m.GOOGLE_CREDENTIALS = new m("google-credentials-uid"), m.FIRST_PARTY = new m("first-party-uid"), 
-m.MOCK_USER = new m("mock-user");
+y.GOOGLE_CREDENTIALS = new y("google-credentials-uid"), y.FIRST_PARTY = new y("first-party-uid"), 
+y.MOCK_USER = new y("mock-user");
 
 /**
  * @license
@@ -67,7 +67,7 @@ m.MOCK_USER = new m("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var y = "9.8.0", v = new l("@firebase/firestore");
+var m = "9.8.3-canary.ebc17e27f", v = new l("@firebase/firestore");
 
 /**
  * @license
@@ -106,7 +106,7 @@ function w(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
     if (v.logLevel <= f.DEBUG) {
         var i = e.map(T);
-        v.debug.apply(v, r([ "Firestore (" + y + "): " + t ], i));
+        v.debug.apply(v, r([ "Firestore (" + m + "): " + t ], i));
     }
 }
 
@@ -114,7 +114,7 @@ function b(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
     if (v.logLevel <= f.ERROR) {
         var i = e.map(T);
-        v.error.apply(v, r([ "Firestore (" + y + "): " + t ], i));
+        v.error.apply(v, r([ "Firestore (" + m + "): " + t ], i));
     }
 }
 
@@ -124,7 +124,7 @@ function b(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
     if (v.logLevel <= f.WARN) {
         var i = e.map(T);
-        v.warn.apply(v, r([ "Firestore (" + y + "): " + t ], i));
+        v.warn.apply(v, r([ "Firestore (" + m + "): " + t ], i));
     }
 }
 
@@ -180,11 +180,11 @@ function b(t) {
  * Returns `never` and can be used in expressions:
  * @example
  * let futureVar = fail('not implemented yet');
- */ function S(t) {
+ */ function E(t) {
     void 0 === t && (t = "Unexpected state");
     // Log the failure in addition to throw an exception, just in case the
     // exception is swallowed.
-        var e = "FIRESTORE (" + y + ") INTERNAL ASSERTION FAILED: " + t;
+        var e = "FIRESTORE (" + m + ") INTERNAL ASSERTION FAILED: " + t;
     // NOTE: We don't use FirestoreError here because these are internal failures
     // that cannot be handled by the user. (Also it would create a circular
     // dependency between the error and assert modules which doesn't work.)
@@ -197,14 +197,14 @@ function b(t) {
  */;
 }
 
-function E(t, e) {
-    t || S();
+function S(t, e) {
+    t || E();
 }
 
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function A(t, 
+ */ function k(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     return t;
@@ -225,7 +225,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.
- */ var I = "cancelled", k = "unknown", V = "invalid-argument", D = "deadline-exceeded", P = "not-found", N = "permission-denied", q = "unauthenticated", F = "resource-exhausted", O = "failed-precondition", C = "aborted", j = "out-of-range", L = "unimplemented", R = "internal", x = "unavailable", M = /** @class */ function(e) {
+ */ var I = "cancelled", A = "unknown", V = "invalid-argument", D = "deadline-exceeded", P = "not-found", N = "permission-denied", F = "unauthenticated", O = "resource-exhausted", q = "failed-precondition", R = "aborted", x = "out-of-range", C = "unimplemented", L = "internal", j = "unavailable", M = /** @class */ function(e) {
     /** @hideconstructor */
     function n(
     /**
@@ -253,17 +253,17 @@ e) {
     }));
 }, B = function(t, e) {
     this.user = e, this.type = "OAuth", this.headers = new Map, this.headers.set("Authorization", "Bearer " + t);
-}, G = /** @class */ function() {
+}, z = /** @class */ function() {
     function t() {}
     return t.prototype.getToken = function() {
         return Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {
         // Fire with initial user.
         t.enqueueRetryable((function() {
-            return e(m.UNAUTHENTICATED);
+            return e(y.UNAUTHENTICATED);
         }));
     }, t.prototype.shutdown = function() {}, t;
-}(), z = /** @class */ function() {
+}(), G = /** @class */ function() {
     function t(t) {
         this.token = t, 
         /**
@@ -285,7 +285,7 @@ e) {
     }, t.prototype.shutdown = function() {
         this.changeListener = null;
     }, t;
-}(), Q = /** @class */ function() {
+}(), K = /** @class */ function() {
     function t(t) {
         var e = this;
         this.auth = null, t.onInit((function(t) {
@@ -295,28 +295,28 @@ e) {
     return t.prototype.getToken = function() {
         var t = this;
         return this.auth ? this.auth.getToken().then((function(e) {
-            return e ? (E("string" == typeof e.accessToken), new B(e.accessToken, new m(t.auth.getUid()))) : null;
+            return e ? (S("string" == typeof e.accessToken), new B(e.accessToken, new y(t.auth.getUid()))) : null;
         })) : Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
     t.prototype.shutdown = function() {}, t;
-}(), K = function(t, e, n) {
-    this.type = "FirstParty", this.user = m.FIRST_PARTY, this.headers = new Map, this.headers.set("X-Goog-AuthUser", e);
+}(), Q = function(t, e, n) {
+    this.type = "FirstParty", this.user = y.FIRST_PARTY, this.headers = new Map, this.headers.set("X-Goog-AuthUser", e);
     var r = t.auth.getAuthHeaderValueForFirstParty([]);
     r && this.headers.set("Authorization", r), n && this.headers.set("X-Goog-Iam-Authorization-Token", n);
-}, H = /** @class */ function() {
+}, W = /** @class */ function() {
     function t(t, e, n) {
         this.t = t, this.i = e, this.o = n;
     }
     return t.prototype.getToken = function() {
-        return Promise.resolve(new K(this.t, this.i, this.o));
+        return Promise.resolve(new Q(this.t, this.i, this.o));
     }, t.prototype.start = function(t, e) {
         // Fire with initial uid.
         t.enqueueRetryable((function() {
-            return e(m.FIRST_PARTY);
+            return e(y.FIRST_PARTY);
         }));
     }, t.prototype.shutdown = function() {}, t.prototype.invalidateToken = function() {}, 
     t;
-}(), W = function(t) {
+}(), H = function(t) {
     this.value = t, this.type = "AppCheck", this.headers = new Map, t && t.length > 0 && this.headers.set("x-firebase-appcheck", this.value);
 }, Y = /** @class */ function() {
     function t(t) {
@@ -327,7 +327,7 @@ e) {
     }
     return t.prototype.getToken = function() {
         return this.appCheck ? this.appCheck.getToken().then((function(t) {
-            return t ? (E("string" == typeof t.token), new W(t.token)) : null;
+            return t ? (S("string" == typeof t.token), new H(t.token)) : null;
         })) : Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
     t.prototype.shutdown = function() {}, t;
@@ -369,7 +369,7 @@ function(t, e, n, r, i, o, a, s) {
     }, t;
 }(), J = /** @class */ function() {
     function t(t, e, n) {
-        void 0 === e ? e = 0 : e > t.length && S(), void 0 === n ? n = t.length - e : n > t.length - e && S(), 
+        void 0 === e ? e = 0 : e > t.length && E(), void 0 === n ? n = t.length - e : n > t.length - e && E(), 
         this.segments = t, this.offset = e, this.len = n;
     }
     return Object.defineProperty(t.prototype, "length", {
@@ -620,7 +620,7 @@ function rt(t, e, n) {
         }(t);
         return e ? "a custom " + e + " object" : "an object";
     }
-    return "function" == typeof t ? "a function" : S();
+    return "function" == typeof t ? "a function" : E();
 }
 
 function st(t, 
@@ -733,7 +733,7 @@ function ut(t, e) {
  *     Code.UNKNOWN.
  */
 function dt(t) {
-    if (void 0 === t) return b("RPC_ERROR", "HTTP error has no status"), k;
+    if (void 0 === t) return b("RPC_ERROR", "HTTP error has no status"), A;
     // The canonical error codes for Google APIs [1] specify mapping onto HTTP
     // status codes but the mapping is not bijective. In each case of ambiguity
     // this function chooses a primary error.
@@ -746,14 +746,14 @@ function dt(t) {
 
       case 400:
         // Bad Request
-        return O;
+        return q;
 
         // Other possibilities based on the forward mapping
         // return Code.INVALID_ARGUMENT;
         // return Code.OUT_OF_RANGE;
               case 401:
         // Unauthorized
-        return q;
+        return F;
 
       case 403:
         // Forbidden
@@ -765,17 +765,17 @@ function dt(t) {
 
       case 409:
         // Conflict
-        return C;
+        return R;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return j;
+        return x;
 
       case 429:
         // Too Many Requests
-        return F;
+        return O;
 
       case 499:
         // Client Closed Request
@@ -783,25 +783,25 @@ function dt(t) {
 
       case 500:
         // Internal Server Error
-        return k;
+        return A;
 
         // Other possibilities:
         // return Code.INTERNAL;
         // return Code.DATA_LOSS;
               case 501:
         // Unimplemented
-        return L;
+        return C;
 
       case 503:
         // Service Unavailable
-        return x;
+        return j;
 
       case 504:
         // Gateway Timeout
         return D;
 
       default:
-        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? O : t >= 500 && t < 600 ? R : k;
+        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? q : t >= 500 && t < 600 ? L : A;
     }
 }
 
@@ -833,20 +833,20 @@ ht[ht.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", ht[ht.ABORTED = 10] = "A
 ht[ht.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", ht[ht.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
 ht[ht.INTERNAL = 13] = "INTERNAL", ht[ht.UNAVAILABLE = 14] = "UNAVAILABLE", ht[ht.DATA_LOSS = 15] = "DATA_LOSS";
 
-var mt = /** @class */ function(r) {
+var yt = /** @class */ function(r) {
     /**
      * @param databaseInfo - The connection info.
      * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.
      */
     function i(t, e) {
         var n = this;
-        return (n = r.call(this, t) || this).A = e, n;
+        return (n = r.call(this, t) || this).I = e, n;
     }
     /**
      * Base class for all Rest-based connections to the backend (WebChannel and
      * HTTP).
      */
-    return t(i, r), i.prototype.I = function(t, e) {
+    return t(i, r), i.prototype.A = function(t, e) {
         throw new Error("Not supported by FetchConnection");
     }, i.prototype.v = function(t, r, i, o) {
         return e(this, void 0, void 0, (function() {
@@ -857,7 +857,7 @@ var mt = /** @class */ function(r) {
                     t = JSON.stringify(o), n.label = 1;
 
                   case 1:
-                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.A(r, {
+                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.I(r, {
                         method: "POST",
                         headers: i,
                         body: t
@@ -902,7 +902,7 @@ var mt = /** @class */ function(r) {
      * present and any additional headers for the request.
      */
     t.prototype.g = function(t, e, n) {
-        t["X-Goog-Api-Client"] = "gl-js/ fire/" + y, 
+        t["X-Goog-Api-Client"] = "gl-js/ fire/" + m, 
         // Content-Type: text/plain will avoid preflight requests which might
         // mess with CORS and redirects by proxies. If we add custom headers
         // we will need to change this code to potentially use the $httpOverwrite
@@ -956,7 +956,7 @@ var mt = /** @class */ function(r) {
  * Generates `nBytes` of random bytes.
  *
  * If `nBytes < 0` , an error will be thrown.
- */ function yt(t) {
+ */ function mt(t) {
     // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.
     var e = 
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
@@ -989,7 +989,7 @@ var mt = /** @class */ function(r) {
         // Alphanumeric characters
         var t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", e = Math.floor(256 / t.length) * t.length, n = ""
         // The largest byte value that is a multiple of `char.length`.
-        ; n.length < 20; ) for (var r = yt(40), i = 0; i < r.length; ++i) 
+        ; n.length < 20; ) for (var r = mt(40), i = 0; i < r.length; ++i) 
         // Only accept values that are [0, maxMultiple), this ensures they can
         // be evenly mapped to indices of `chars` via a modulo operation.
         n.length < 20 && r[i] < e && (n += t.charAt(r[i] % t.length));
@@ -1218,13 +1218,13 @@ function Tt(t) {
     return e;
 }
 
-function St(t, e) {
+function Et(t, e) {
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
 /**
  * @license
- * Copyright 2020 Google LLC
+ * 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.
@@ -1238,29 +1238,451 @@ function St(t, e) {
  * 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.
+var St = /** @class */ function() {
+    function t(t, e) {
+        this.comparator = t, this.root = e || It.EMPTY;
+    }
+    // Returns a copy of the map, with the specified key/value added or replaced.
+        return t.prototype.insert = function(e, n) {
+        return new t(this.comparator, this.root.insert(e, n, this.comparator).copy(null, null, It.BLACK, null, null));
+    }, 
+    // Returns a copy of the map, with the specified key removed.
+    t.prototype.remove = function(e) {
+        return new t(this.comparator, this.root.remove(e, this.comparator).copy(null, null, It.BLACK, null, null));
+    }, 
+    // Returns the value of the node with the given key, or null.
+    t.prototype.get = function(t) {
+        for (var e = this.root; !e.isEmpty(); ) {
+            var 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.
+    t.prototype.indexOf = function(t) {
+        for (
+        // Number of nodes that were pruned when descending right
+        var e = 0, n = this.root; !n.isEmpty(); ) {
+            var 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;
+    }, t.prototype.isEmpty = function() {
+        return this.root.isEmpty();
+    }, Object.defineProperty(t.prototype, "size", {
+        // Returns the total number of nodes in the map.
+        get: function() {
+            return this.root.size;
+        },
+        enumerable: !1,
+        configurable: !0
+    }), 
+    // Returns the minimum key in the map.
+    t.prototype.minKey = function() {
+        return this.root.minKey();
+    }, 
+    // Returns the maximum key in the map.
+    t.prototype.maxKey = function() {
+        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.
+    t.prototype.inorderTraversal = function(t) {
+        return this.root.inorderTraversal(t);
+    }, t.prototype.forEach = function(t) {
+        this.inorderTraversal((function(e, n) {
+            return t(e, n), !1;
+        }));
+    }, t.prototype.toString = function() {
+        var t = [];
+        return this.inorderTraversal((function(e, n) {
+            return 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.
+    t.prototype.reverseTraversal = function(t) {
+        return this.root.reverseTraversal(t);
+    }, 
+    // Returns an iterator over the SortedMap.
+    t.prototype.getIterator = function() {
+        return new kt(this.root, null, this.comparator, !1);
+    }, t.prototype.getIteratorFrom = function(t) {
+        return new kt(this.root, t, this.comparator, !1);
+    }, t.prototype.getReverseIterator = function() {
+        return new kt(this.root, null, this.comparator, !0);
+    }, t.prototype.getReverseIteratorFrom = function(t) {
+        return new kt(this.root, t, this.comparator, !0);
+    }, t;
+}(), kt = /** @class */ function() {
+    function t(t, e, n, r) {
+        this.isReverse = r, this.nodeStack = [];
+        for (var i = 1; !t.isEmpty(); ) if (i = e ? n(t.key, e) : 1, 
+        // flip the comparison if we're going in reverse
+        e && r && (i *= -1), i < 0) 
+        // This node is less than our start key. ignore it
+        t = this.isReverse ? t.left : t.right; else {
+            if (0 === i) {
+                // 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;
+        }
+    }
+    return t.prototype.getNext = function() {
+        var t = this.nodeStack.pop(), 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;
+    }, t.prototype.hasNext = function() {
+        return this.nodeStack.length > 0;
+    }, t.prototype.peek = function() {
+        if (0 === this.nodeStack.length) return null;
+        var t = this.nodeStack[this.nodeStack.length - 1];
+        return {
+            key: t.key,
+            value: t.value
+        };
+    }, t;
+}(), It = /** @class */ function() {
+    function t(e, n, r, i, o) {
+        this.key = e, this.value = n, this.color = null != r ? r : t.RED, this.left = null != i ? i : t.EMPTY, 
+        this.right = null != o ? o : t.EMPTY, this.size = this.left.size + 1 + this.right.size;
+    }
+    // Returns a copy of the current node, optionally replacing pieces of it.
+        return t.prototype.copy = function(e, n, r, i, o) {
+        return new t(null != e ? e : this.key, null != n ? n : this.value, null != r ? r : this.color, null != i ? i : this.left, null != o ? o : this.right);
+    }, t.prototype.isEmpty = function() {
+        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.
+    t.prototype.inorderTraversal = function(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.
+    t.prototype.reverseTraversal = function(t) {
+        return this.right.reverseTraversal(t) || t(this.key, this.value) || this.left.reverseTraversal(t);
+    }, 
+    // Returns the minimum node in the tree.
+    t.prototype.min = function() {
+        return this.left.isEmpty() ? this : this.left.min();
+    }, 
+    // Returns the maximum key in the tree.
+    t.prototype.minKey = function() {
+        return this.min().key;
+    }, 
+    // Returns the maximum key in the tree.
+    t.prototype.maxKey = function() {
+        return this.right.isEmpty() ? this.key : this.right.maxKey();
+    }, 
+    // Returns new tree, with the key/value added.
+    t.prototype.insert = function(t, e, n) {
+        var r = this, i = n(t, r.key);
+        return (r = i < 0 ? r.copy(null, null, null, r.left.insert(t, e, n), null) : 0 === i ? r.copy(null, e, null, null, null) : r.copy(null, null, null, null, r.right.insert(t, e, n))).fixUp();
+    }, t.prototype.removeMin = function() {
+        if (this.left.isEmpty()) return t.EMPTY;
+        var e = this;
+        return e.left.isRed() || e.left.left.isRed() || (e = e.moveRedLeft()), (e = e.copy(null, null, null, e.left.removeMin(), null)).fixUp();
+    }, 
+    // Returns new tree, with the specified item removed.
+    t.prototype.remove = function(e, n) {
+        var r, i = this;
+        if (n(e, i.key) < 0) i.left.isEmpty() || i.left.isRed() || i.left.left.isRed() || (i = i.moveRedLeft()), 
+        i = i.copy(null, null, null, i.left.remove(e, n), null); else {
+            if (i.left.isRed() && (i = i.rotateRight()), i.right.isEmpty() || i.right.isRed() || i.right.left.isRed() || (i = i.moveRedRight()), 
+            0 === n(e, i.key)) {
+                if (i.right.isEmpty()) return t.EMPTY;
+                r = i.right.min(), i = i.copy(r.key, r.value, null, null, i.right.removeMin());
+            }
+            i = i.copy(null, null, null, null, i.right.remove(e, n));
+        }
+        return i.fixUp();
+    }, t.prototype.isRed = function() {
+        return this.color;
+    }, 
+    // Returns new tree after performing any needed rotations.
+    t.prototype.fixUp = function() {
+        var 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;
+    }, t.prototype.moveRedLeft = function() {
+        var t = this.colorFlip();
+        return t.right.left.isRed() && (t = (t = (t = t.copy(null, null, null, null, t.right.rotateRight())).rotateLeft()).colorFlip()), 
+        t;
+    }, t.prototype.moveRedRight = function() {
+        var t = this.colorFlip();
+        return t.left.left.isRed() && (t = (t = t.rotateRight()).colorFlip()), t;
+    }, t.prototype.rotateLeft = function() {
+        var e = this.copy(null, null, t.RED, null, this.right.left);
+        return this.right.copy(null, null, this.color, e, null);
+    }, t.prototype.rotateRight = function() {
+        var e = this.copy(null, null, t.RED, this.left.right, null);
+        return this.left.copy(null, null, this.color, null, e);
+    }, t.prototype.colorFlip = function() {
+        var 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.
+    t.prototype.checkMaxDepth = function() {
+        var 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.
+    t.prototype.check = function() {
+        if (this.isRed() && this.left.isRed()) throw E();
+        if (this.right.isRed()) throw E();
+        var t = this.left.check();
+        if (t !== this.right.check()) throw E();
+        return t + (this.isRed() ? 0 : 1);
+    }, t;
+}();
+
+// end SortedMap
+// An iterator over an LLRBNode.
+// end LLRBNode
+// Empty node is shared between all LLRB trees.
+// eslint-disable-next-line @typescript-eslint/no-explicit-any
+It.EMPTY = null, It.RED = !0, It.BLACK = !1, 
+// end LLRBEmptyNode
+It.EMPTY = new (/** @class */ function() {
+    function t() {
+        this.size = 0;
+    }
+    return Object.defineProperty(t.prototype, "key", {
+        get: function() {
+            throw E();
+        },
+        enumerable: !1,
+        configurable: !0
+    }), Object.defineProperty(t.prototype, "value", {
+        get: function() {
+            throw E();
+        },
+        enumerable: !1,
+        configurable: !0
+    }), Object.defineProperty(t.prototype, "color", {
+        get: function() {
+            throw E();
+        },
+        enumerable: !1,
+        configurable: !0
+    }), Object.defineProperty(t.prototype, "left", {
+        get: function() {
+            throw E();
+        },
+        enumerable: !1,
+        configurable: !0
+    }), Object.defineProperty(t.prototype, "right", {
+        get: function() {
+            throw E();
+        },
+        enumerable: !1,
+        configurable: !0
+    }), 
+    // Returns a copy of the current node.
+    t.prototype.copy = function(t, e, n, r, i) {
+        return this;
+    }, 
+    // Returns a copy of the tree, with the specified key/value added.
+    t.prototype.insert = function(t, e, n) {
+        return new It(t, e);
+    }, 
+    // Returns a copy of the tree, with the specified key removed.
+    t.prototype.remove = function(t, e) {
+        return this;
+    }, t.prototype.isEmpty = function() {
+        return !0;
+    }, t.prototype.inorderTraversal = function(t) {
+        return !1;
+    }, t.prototype.reverseTraversal = function(t) {
+        return !1;
+    }, t.prototype.minKey = function() {
+        return null;
+    }, t.prototype.maxKey = function() {
+        return null;
+    }, t.prototype.isRed = function() {
+        return !1;
+    }, 
+    // For testing.
+    t.prototype.checkMaxDepth = function() {
+        return !0;
+    }, t.prototype.check = function() {
+        return 0;
+    }, t;
+}());
+
 /**
- * Provides a set of fields that can be used to partially patch a document.
- * FieldMask is used in conjunction with ObjectValue.
- * Examples:
- *   foo - Overwrites foo entirely with the provided value. If foo is not
- *         present in the companion ObjectValue, the field is deleted.
- *   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
- */ var Et = /** @class */ function() {
+ * @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!
+ */
+var At = /** @class */ function() {
+    function t(t) {
+        this.comparator = t, this.data = new St(this.comparator);
+    }
+    return t.prototype.has = function(t) {
+        return null !== this.data.get(t);
+    }, t.prototype.first = function() {
+        return this.data.minKey();
+    }, t.prototype.last = function() {
+        return this.data.maxKey();
+    }, Object.defineProperty(t.prototype, "size", {
+        get: function() {
+            return this.data.size;
+        },
+        enumerable: !1,
+        configurable: !0
+    }), t.prototype.indexOf = function(t) {
+        return this.data.indexOf(t);
+    }, 
+    /** Iterates elements in order defined by "comparator" */ t.prototype.forEach = function(t) {
+        this.data.inorderTraversal((function(e, n) {
+            return t(e), !1;
+        }));
+    }, 
+    /** Iterates over `elem`s such that: range[0] &lt;= elem &lt; range[1]. */ t.prototype.forEachInRange = function(t, e) {
+        for (var n = this.data.getIteratorFrom(t[0]); n.hasNext(); ) {
+            var 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.
+     */
+    t.prototype.forEachWhile = function(t, e) {
+        var 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`. */ t.prototype.firstAfterOrEqual = function(t) {
+        var e = this.data.getIteratorFrom(t);
+        return e.hasNext() ? e.getNext().key : null;
+    }, t.prototype.getIterator = function() {
+        return new Vt(this.data.getIterator());
+    }, t.prototype.getIteratorFrom = function(t) {
+        return new Vt(this.data.getIteratorFrom(t));
+    }, 
+    /** Inserts or updates an element */ t.prototype.add = function(t) {
+        return this.copy(this.data.remove(t).insert(t, !0));
+    }, 
+    /** Deletes an element */ t.prototype.delete = function(t) {
+        return this.has(t) ? this.copy(this.data.remove(t)) : this;
+    }, t.prototype.isEmpty = function() {
+        return this.data.isEmpty();
+    }, t.prototype.unionWith = function(t) {
+        var 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((function(t) {
+            e = e.add(t);
+        })), e;
+    }, t.prototype.isEqual = function(e) {
+        if (!(e instanceof t)) return !1;
+        if (this.size !== e.size) return !1;
+        for (var n = this.data.getIterator(), r = e.data.getIterator(); n.hasNext(); ) {
+            var i = n.getNext().key, o = r.getNext().key;
+            if (0 !== this.comparator(i, o)) return !1;
+        }
+        return !0;
+    }, t.prototype.toArray = function() {
+        var t = [];
+        return this.forEach((function(e) {
+            t.push(e);
+        })), t;
+    }, t.prototype.toString = function() {
+        var t = [];
+        return this.forEach((function(e) {
+            return t.push(e);
+        })), "SortedSet(" + t.toString() + ")";
+    }, t.prototype.copy = function(e) {
+        var n = new t(this.comparator);
+        return n.data = e, n;
+    }, t;
+}(), Vt = /** @class */ function() {
+    function t(t) {
+        this.iter = t;
+    }
+    return t.prototype.getNext = function() {
+        return this.iter.getNext().key;
+    }, t.prototype.hasNext = function() {
+        return this.iter.hasNext();
+    }, t;
+}(), Dt = /** @class */ function() {
     function t(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
         // Sort the field mask to support `FieldMask.isEqual()` and assert below.
-        t.sort(et.comparator)
-        /**
+        t.sort(et.comparator);
+    }
+    return t.empty = function() {
+        return new t([]);
+    }, 
+    /**
+     * Returns a new FieldMask object that is the result of adding all the given
+     * fields paths to this field mask.
+     */
+    t.prototype.unionWith = function(e) {
+        for (var n = new At(et.comparator), r = 0, i = this.fields; r < i.length; r++) {
+            var o = i[r];
+            n = n.add(o);
+        }
+        for (var a = 0, s = e; a < s.length; a++) {
+            var u = s[a];
+            n = n.add(u);
+        }
+        return new t(n.toArray());
+    }, 
+    /**
      * Verifies that `fieldPath` is included by at least one field in this field
      * mask.
      *
      * This is an O(n) operation, where `n` is the size of the field mask.
-     */;
-    }
-    return t.prototype.covers = function(t) {
+     */
+    t.prototype.covers = function(t) {
         for (var e = 0, n = this.fields; e < n.length; e++) {
             if (n[e].isPrefixOf(t)) return !0;
         }
@@ -1270,7 +1692,7 @@ function St(t, e) {
             return t.isEqual(e);
         }));
     }, t;
-}(), At = /** @class */ function() {
+}(), Pt = /** @class */ function() {
     function t(t) {
         this.binaryString = t;
     }
@@ -1318,64 +1740,23 @@ function St(t, e) {
     }, t;
 }();
 
-/**
- * @license
- * Copyright 2020 Google LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *   http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-/** Converts a Base64 encoded string to a binary string. */
-/**
- * @license
- * Copyright 2020 Google LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *   http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-/**
- * Immutable class that represents a "proto" byte string.
- *
- * Proto byte strings can either be Base64-encoded strings or Uint8Arrays when
- * sent on the wire. This class abstracts away this differentiation by holding
- * the proto byte string in a common class that must be converted into a string
- * before being sent as a proto.
- * @internal
- */ At.EMPTY_BYTE_STRING = new At("");
+Pt.EMPTY_BYTE_STRING = new Pt("");
 
-var It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+var Nt = 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 kt(t) {
+ */ function Ft(t) {
     // The json interface (for the browser) will return an iso timestamp string,
     // while the proto js library (for node) will return a
     // google.protobuf.Timestamp instance.
-    if (E(!!t), "string" == typeof t) {
+    if (S(!!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.
-        var e = 0, n = It.exec(t);
-        if (E(!!n), n[1]) {
+        var e = 0, n = Nt.exec(t);
+        if (S(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             var r = n[1];
             r = (r + "000000000").substr(0, 9), e = Number(r);
@@ -1388,21 +1769,21 @@ var It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: Vt(t.seconds),
-        nanos: Vt(t.nanos)
+        seconds: Ot(t.seconds),
+        nanos: Ot(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function Vt(t) {
+ */ function Ot(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 Dt(t) {
-    return "string" == typeof t ? At.fromBase64String(t) : At.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function qt(t) {
+    return "string" == typeof t ? Pt.fromBase64String(t) : Pt.fromUint8Array(t);
 }
 
 /**
@@ -1438,7 +1819,7 @@ var 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 Pt(t) {
+ */ function Rt(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);
 }
@@ -1448,15 +1829,15 @@ var 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 xt(t) {
     var e = t.mapValue.fields.__previous_value__;
-    return Pt(e) ? Nt(e) : e;
+    return Rt(e) ? xt(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function qt(t) {
-    var e = kt(t.mapValue.fields.__local_write_time__.timestampValue);
+ */ function Ct(t) {
+    var e = Ft(t.mapValue.fields.__local_write_time__.timestampValue);
     return new bt(e.seconds, e.nanos);
 }
 
@@ -1475,7 +1856,7 @@ var 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.
- */ var Ft = {
+ */ var Lt = {
     fields: {
         __type__: {
             stringValue: "__max__"
@@ -1483,18 +1864,18 @@ var 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 Ot(t) {
-    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Pt(t) ? 4 /* ServerTimestampValue */ : 
+/** Extracts the backend's type order for the provided value. */ function jt(t) {
+    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Rt(t) ? 4 /* ServerTimestampValue */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
         return "__max__" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;
-    }(t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : S();
+    }(t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : E();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Ct(t, e) {
+/** Tests `left` and `right` for equality based on the backend semantics. */ function Mt(t, e) {
     if (t === e) return !0;
-    var n = Ot(t);
-    if (n !== Ot(e)) return !1;
+    var n = jt(t);
+    if (n !== jt(e)) return !1;
     switch (n) {
       case 0 /* NullValue */ :
       case 9007199254740991 /* MaxValue */ :
@@ -1504,14 +1885,14 @@ var It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         return t.booleanValue === e.booleanValue;
 
       case 4 /* ServerTimestampValue */ :
-        return qt(t).isEqual(qt(e));
+        return Ct(t).isEqual(Ct(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;
-            var n = kt(t.timestampValue), r = kt(e.timestampValue);
+            var n = Ft(t.timestampValue), r = Ft(e.timestampValue);
             return n.seconds === r.seconds && n.nanos === r.nanos;
         }(t, e);
 
@@ -1520,7 +1901,7 @@ var It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            return Dt(t.bytesValue).isEqual(Dt(e.bytesValue));
+            return qt(t.bytesValue).isEqual(qt(e.bytesValue));
         }(t, e);
 
       case 7 /* RefValue */ :
@@ -1528,44 +1909,44 @@ var It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            return Vt(t.geoPointValue.latitude) === Vt(e.geoPointValue.latitude) && Vt(t.geoPointValue.longitude) === Vt(e.geoPointValue.longitude);
+            return Ot(t.geoPointValue.latitude) === Ot(e.geoPointValue.latitude) && Ot(t.geoPointValue.longitude) === Ot(e.geoPointValue.longitude);
         }(t, e);
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            if ("integerValue" in t && "integerValue" in e) return Vt(t.integerValue) === Vt(e.integerValue);
+            if ("integerValue" in t && "integerValue" in e) return Ot(t.integerValue) === Ot(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
-                var n = Vt(t.doubleValue), r = Vt(e.doubleValue);
+                var n = Ot(t.doubleValue), r = Ot(e.doubleValue);
                 return n === r ? lt(n) === lt(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* ArrayValue */ :
-        return wt(t.arrayValue.values || [], e.arrayValue.values || [], Ct);
+        return wt(t.arrayValue.values || [], e.arrayValue.values || [], Mt);
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
             var n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
             if (Tt(n) !== Tt(r)) return !1;
-            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !Ct(n[i], r[i]))) return !1;
+            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !Mt(n[i], r[i]))) return !1;
             return !0;
         }(t, e);
 
       default:
-        return S();
+        return E();
     }
 }
 
-function jt(t, e) {
+function Ut(t, e) {
     return void 0 !== (t.values || []).find((function(t) {
-        return Ct(t, e);
+        return Mt(t, e);
     }));
 }
 
-function Lt(t, e) {
+function Bt(t, e) {
     if (t === e) return 0;
-    var n = Ot(t), r = Ot(e);
+    var n = jt(t), r = jt(e);
     if (n !== r) return gt(n, r);
     switch (n) {
       case 0 /* NullValue */ :
@@ -1577,24 +1958,24 @@ function Lt(t, e) {
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            var n = Vt(t.integerValue || t.doubleValue), r = Vt(e.integerValue || e.doubleValue);
+            var n = Ot(t.integerValue || t.doubleValue), r = Ot(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 Rt(t.timestampValue, e.timestampValue);
+        return zt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return Rt(qt(t), qt(e));
+        return zt(Ct(t), Ct(e));
 
       case 5 /* StringValue */ :
         return gt(t.stringValue, e.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            var n = Dt(t), r = Dt(e);
+            var n = qt(t), r = qt(e);
             return n.compareTo(r);
         }(t.bytesValue, e.bytesValue);
 
@@ -1609,14 +1990,14 @@ function Lt(t, e) {
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            var n = gt(Vt(t.latitude), Vt(e.latitude));
-            return 0 !== n ? n : gt(Vt(t.longitude), Vt(e.longitude));
+            var n = gt(Ot(t.latitude), Ot(e.latitude));
+            return 0 !== n ? n : gt(Ot(t.longitude), Ot(e.longitude));
         }(t.geoPointValue, e.geoPointValue);
 
       case 9 /* ArrayValue */ :
         return function(t, e) {
             for (var n = t.values || [], r = e.values || [], i = 0; i < n.length && i < r.length; ++i) {
-                var o = Lt(n[i], r[i]);
+                var o = Bt(n[i], r[i]);
                 if (o) return o;
             }
             return gt(n.length, r.length);
@@ -1624,9 +2005,9 @@ function Lt(t, e) {
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
-            if (t === Ft && e === Ft) return 0;
-            if (t === Ft) return 1;
-            if (e === Ft) return -1;
+            if (t === Lt && e === Lt) return 0;
+            if (t === Lt) return 1;
+            if (e === Lt) return -1;
             var n = t.fields || {}, r = Object.keys(n), i = e.fields || {}, o = Object.keys(i);
             // Even though MapValues are likely sorted correctly based on their insertion
             // order (e.g. when received from the backend), local modifications can bring
@@ -1636,46 +2017,46 @@ function Lt(t, e) {
             for (var a = 0; a < r.length && a < o.length; ++a) {
                 var s = gt(r[a], o[a]);
                 if (0 !== s) return s;
-                var u = Lt(n[r[a]], i[o[a]]);
+                var u = Bt(n[r[a]], i[o[a]]);
                 if (0 !== u) return u;
             }
             return gt(r.length, o.length);
         }(t.mapValue, e.mapValue);
 
       default:
-        throw S();
+        throw E();
     }
 }
 
-function Rt(t, e) {
+function zt(t, e) {
     if ("string" == typeof t && "string" == typeof e && t.length === e.length) return gt(t, e);
-    var n = kt(t), r = kt(e), i = gt(n.seconds, r.seconds);
+    var n = Ft(t), r = Ft(e), i = gt(n.seconds, r.seconds);
     return 0 !== i ? i : gt(n.nanos, r.nanos);
 }
 
-function xt(t, e) {
+function Gt(t, e) {
     return {
         referenceValue: "projects/" + t.projectId + "/databases/" + t.database + "/documents/" + e.path.canonicalString()
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Mt(t) {
+/** Returns true if `value` is an ArrayValue. */ function Kt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Ut(t) {
+/** Returns true if `value` is a NullValue. */ function Qt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function Bt(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 Gt(t) {
+/** Returns true if `value` is a MapValue. */ function Ht(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function zt(t) {
+/** Creates a deep copy of `source`. */ function Yt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1688,8 +2069,8 @@ function xt(t, e) {
                 fields: {}
             }
         };
-        return St(t.mapValue.fields, (function(t, n) {
-            return e.mapValue.fields[t] = zt(n);
+        return Et(t.mapValue.fields, (function(t, n) {
+            return e.mapValue.fields[t] = Yt(n);
         })), e;
     }
     if (t.arrayValue) {
@@ -1697,13 +2078,13 @@ function xt(t, e) {
             arrayValue: {
                 values: []
             }
-        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = zt(t.arrayValue.values[r]);
+        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = Yt(t.arrayValue.values[r]);
         return n;
     }
     return Object.assign({}, t);
 }
 
-var Qt = /** @class */ function() {
+var $t = /** @class */ function() {
     function t(t) {
         this.value = t;
     }
@@ -1720,7 +2101,7 @@ var Qt = /** @class */ function() {
      */
     t.prototype.field = function(t) {
         if (t.isEmpty()) return this.value;
-        for (var e = this.value, n = 0; n < t.length - 1; ++n) if (!Gt(e = (e.mapValue.fields || {})[t.get(n)])) return null;
+        for (var e = this.value, n = 0; n < t.length - 1; ++n) if (!Ht(e = (e.mapValue.fields || {})[t.get(n)])) return null;
         return (e = (e.mapValue.fields || {})[t.lastSegment()]) || null;
     }, 
     /**
@@ -1730,7 +2111,7 @@ var Qt = /** @class */ function() {
      * @param value - The value to set.
      */
     t.prototype.set = function(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = zt(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Yt(e);
     }, 
     /**
      * Sets the provided fields to the provided values.
@@ -1745,7 +2126,7 @@ var Qt = /** @class */ function() {
                 var a = e.getFieldsMap(n);
                 e.applyChanges(a, r, i), r = {}, i = [], n = o.popLast();
             }
-            t ? r[o.lastSegment()] = zt(t) : i.push(o.lastSegment());
+            t ? r[o.lastSegment()] = Yt(t) : i.push(o.lastSegment());
         }));
         var o = this.getFieldsMap(n);
         this.applyChanges(o, r, i);
@@ -1758,9 +2139,9 @@ var Qt = /** @class */ function() {
      */
     t.prototype.delete = function(t) {
         var e = this.field(t.popLast());
-        Gt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        Ht(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }, t.prototype.isEqual = function(t) {
-        return Ct(this.value, t.value);
+        return Mt(this.value, t.value);
     }, 
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -1773,7 +2154,7 @@ var Qt = /** @class */ function() {
         });
         for (var n = 0; n < t.length; ++n) {
             var r = e.mapValue.fields[t.get(n)];
-            Gt(r) && r.mapValue.fields || (r = {
+            Ht(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -1786,7 +2167,7 @@ var Qt = /** @class */ function() {
      * entries.
      */
     t.prototype.applyChanges = function(t, e, n) {
-        St(e, (function(e, n) {
+        Et(e, (function(e, n) {
             return t[e] = n;
         }));
         for (var r = 0, i = n; r < i.length; r++) {
@@ -1794,9 +2175,9 @@ var Qt = /** @class */ function() {
             delete t[o];
         }
     }, t.prototype.clone = function() {
-        return new t(zt(this.value));
+        return new t(Yt(this.value));
     }, t;
-}(), Kt = /** @class */ function() {
+}(), Xt = /** @class */ function() {
     function t(t, e, n, r, i, o) {
         this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.data = i, 
         this.documentState = o
@@ -1806,7 +2187,7 @@ var Qt = /** @class */ function() {
      */;
     }
     return t.newInvalidDocument = function(e) {
-        return new t(e, 0 /* INVALID */ , _t.min(), _t.min(), Qt.empty(), 0 /* SYNCED */);
+        return new t(e, 0 /* INVALID */ , _t.min(), _t.min(), $t.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist with the given data at the
@@ -1816,7 +2197,7 @@ var Qt = /** @class */ function() {
         return new t(e, 1 /* FOUND_DOCUMENT */ , n, _t.min(), r, 0 /* SYNCED */);
     }, 
     /** Creates a new document that is known to not exist at the given version. */ t.newNoDocument = function(e, n) {
-        return new t(e, 2 /* NO_DOCUMENT */ , n, _t.min(), Qt.empty(), 0 /* SYNCED */);
+        return new t(e, 2 /* NO_DOCUMENT */ , n, _t.min(), $t.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist at the given version but
@@ -1824,7 +2205,7 @@ var Qt = /** @class */ function() {
      * base document).
      */
     t.newUnknownDocument = function(e, n) {
-        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, _t.min(), Qt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, _t.min(), $t.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }, 
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -1839,7 +2220,7 @@ var Qt = /** @class */ function() {
      * version.
      */
     t.prototype.convertToNoDocument = function(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Qt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = $t.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }, 
     /**
@@ -1848,12 +2229,13 @@ var Qt = /** @class */ function() {
      * base document).
      */
     t.prototype.convertToUnknownDocument = function(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Qt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = $t.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }, t.prototype.setHasCommittedMutations = function() {
         return this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }, t.prototype.setHasLocalMutations = function() {
-        return this.documentState = 1 /* HAS_LOCAL_MUTATIONS */ , this;
+        return this.documentState = 1 /* HAS_LOCAL_MUTATIONS */ , this.version = _t.min(), 
+        this;
     }, t.prototype.setReadTime = function(t) {
         return this.readTime = t, this;
     }, Object.defineProperty(t.prototype, "hasLocalMutations", {
@@ -1889,7 +2271,7 @@ var Qt = /** @class */ function() {
     }, t.prototype.toString = function() {
         return "Document(" + this.key + ", " + this.version + ", " + JSON.stringify(this.data.value) + ", {documentType: " + this.documentType + "}), {documentState: " + this.documentState + "})";
     }, t;
-}(), Ht = function(t, e, n, r, i, o, a) {
+}(), Jt = function(t, e, n, r, i, o, a) {
     void 0 === e && (e = null), void 0 === n && (n = []), void 0 === r && (r = []), 
     void 0 === i && (i = null), void 0 === o && (o = null), void 0 === a && (a = null), 
     this.path = t, this.collectionGroup = e, this.orderBy = n, this.filters = r, this.limit = i, 
@@ -1930,13 +2312,13 @@ var Qt = /** @class */ function() {
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
  */
-function Wt(t, e, n, r, i, o, a) {
+function Zt(t, e, n, r, i, o, a) {
     return void 0 === e && (e = null), void 0 === n && (n = []), void 0 === r && (r = []), 
     void 0 === i && (i = null), void 0 === o && (o = null), void 0 === a && (a = null), 
-    new Ht(t, e, n, r, i, o, a);
+    new Jt(t, e, n, r, i, o, a);
 }
 
-var Yt = /** @class */ function(e) {
+var te = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this) || this).field = t, i.op = n, i.value = r, i;
@@ -1944,15 +2326,15 @@ var Yt = /** @class */ function(e) {
     /**
      * Creates a filter based on the provided arguments.
      */    return t(n, e), n.create = function(t, e, r) {
-        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, r) : new $t(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new te(t, r) : "in" /* IN */ === e ? new ee(t, r) : "not-in" /* NOT_IN */ === e ? new ne(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new re(t, r) : new n(t, e, r);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, r) : new ee(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new oe(t, r) : "in" /* IN */ === e ? new ae(t, r) : "not-in" /* NOT_IN */ === e ? new se(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ue(t, r) : new n(t, e, r);
     }, n.V = function(t, e, n) {
-        return "in" /* IN */ === e ? new Xt(t, n) : new Jt(t, n);
+        return "in" /* IN */ === e ? new ne(t, n) : new re(t, n);
     }, n.prototype.matches = function(t) {
         var 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(Lt(e, this.value)) : null !== e && Ot(this.value) === Ot(e) && this.D(Lt(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.N(Bt(e, this.value)) : null !== e && jt(this.value) === jt(e) && this.N(Bt(e, this.value));
         // Only compare types with matching backend order (such as double and int).
-        }, n.prototype.D = function(t) {
+        }, n.prototype.N = function(t) {
         switch (this.op) {
           case "<" /* LESS_THAN */ :
             return t < 0;
@@ -1973,12 +2355,12 @@ var Yt = /** @class */ function(e) {
             return t >= 0;
 
           default:
-            return S();
+            return E();
         }
-    }, n.prototype.N = function() {
+    }, n.prototype.D = function() {
         return [ "<" /* LESS_THAN */ , "<=" /* LESS_THAN_OR_EQUAL */ , ">" /* GREATER_THAN */ , ">=" /* GREATER_THAN_OR_EQUAL */ , "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ].indexOf(this.op) >= 0;
     }, n;
-}((function() {})), $t = /** @class */ function(e) {
+}((function() {})), ee = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this, t, n, r) || this).key = nt.fromName(r.referenceValue), 
@@ -1986,12 +2368,12 @@ var Yt = /** @class */ function(e) {
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = nt.comparator(t.key, this.key);
-        return this.D(e);
+        return this.N(e);
     }, n;
-}(Yt), Xt = /** @class */ function(e) {
+}(te), ne = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "in" /* IN */ , n) || this).keys = Zt("in" /* IN */ , n), 
+        return (r = e.call(this, t, "in" /* IN */ , n) || this).keys = ie("in" /* IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1999,10 +2381,10 @@ var Yt = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Yt), Jt = /** @class */ function(e) {
+}(te), re = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "not-in" /* NOT_IN */ , n) || this).keys = Zt("not-in" /* NOT_IN */ , n), 
+        return (r = e.call(this, t, "not-in" /* NOT_IN */ , n) || this).keys = ie("not-in" /* NOT_IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -2010,67 +2392,67 @@ var Yt = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Yt);
+}(te);
 
-/** Filter that matches on key fields (i.e. '__name__'). */ function Zt(t, e) {
+/** Filter that matches on key fields (i.e. '__name__'). */ function ie(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((function(t) {
         return nt.fromName(t.referenceValue);
     }));
 }
 
-/** A Filter that implements the array-contains operator. */ var te = /** @class */ function(e) {
+/** A Filter that implements the array-contains operator. */ var oe = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "array-contains" /* ARRAY_CONTAINS */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = t.data.field(this.field);
-        return Mt(e) && jt(e.arrayValue, this.value);
+        return Kt(e) && Ut(e.arrayValue, this.value);
     }, n;
-}(Yt), ee = /** @class */ function(e) {
+}(te), ae = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "in" /* IN */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = t.data.field(this.field);
-        return null !== e && jt(this.value.arrayValue, e);
+        return null !== e && Ut(this.value.arrayValue, e);
     }, n;
-}(Yt), ne = /** @class */ function(e) {
+}(te), se = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "not-in" /* NOT_IN */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
-        if (jt(this.value.arrayValue, {
+        if (Ut(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         var e = t.data.field(this.field);
-        return null !== e && !jt(this.value.arrayValue, e);
+        return null !== e && !Ut(this.value.arrayValue, e);
     }, n;
-}(Yt), re = /** @class */ function(e) {
+}(te), ue = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = this, n = t.data.field(this.field);
-        return !(!Mt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
-            return jt(e.value.arrayValue, t);
+        return !(!Kt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
+            return Ut(e.value.arrayValue, t);
         }));
     }, n;
-}(Yt), ie = function(t, e) {
+}(te), ce = function(t, e) {
     this.position = t, this.inclusive = e;
-}, oe = function(t, e /* ASCENDING */) {
+}, le = function(t, e /* ASCENDING */) {
     void 0 === e && (e = "asc"), this.field = t, this.dir = e;
 };
 
-/** A Filter that implements the IN operator. */ function ae(t, e) {
+/** A Filter that implements the IN operator. */ function fe(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
-function se(t, e) {
+function he(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 (var n = 0; n < t.position.length; n++) if (!Ct(t.position[n], e.position[n])) return !1;
+    for (var n = 0; n < t.position.length; n++) if (!Mt(t.position[n], e.position[n])) return !1;
     return !0;
 }
 
@@ -2096,7 +2478,7 @@ function se(t, e) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ var ue = 
+ */ var pe = 
 /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2108,17 +2490,17 @@ function(t, e, n, r, i, o /* First */ , a, s) {
     this.filters = r, this.limit = i, this.limitType = o, this.startAt = a, this.endAt = s, 
     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 le(t) {
+function ye(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
         var r = n[e];
-        if (r.N()) return r.field;
+        if (r.D()) return r.field;
     }
     return null;
 }
@@ -2130,7 +2512,7 @@ function le(t) {
 /**
  * Returns whether the query matches a collection group rather than a specific
  * collection.
- */ function fe(t) {
+ */ function me(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2138,16 +2520,16 @@ function le(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 he(t) {
-    var e = A(t);
+ */ function ve(t) {
+    var e = k(t);
     if (null === e.$) {
         e.$ = [];
-        var n = le(e), r = ce(e);
+        var n = ye(e), r = de(e);
         if (null !== n && null === r) 
         // 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.
-        n.isKeyField() || e.$.push(new oe(n)), e.$.push(new oe(et.keyField(), "asc" /* ASCENDING */)); else {
+        n.isKeyField() || e.$.push(new le(n)), e.$.push(new le(et.keyField(), "asc" /* ASCENDING */)); else {
             for (var i = !1, o = 0, a = e.explicitOrderBy; o < a.length; o++) {
                 var s = a[o];
                 e.$.push(s), s.field.isKeyField() && (i = !0);
@@ -2156,7 +2538,7 @@ function le(t) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 var u = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* ASCENDING */;
-                e.$.push(new oe(et.keyField(), u));
+                e.$.push(new le(et.keyField(), u));
             }
         }
     }
@@ -2165,21 +2547,21 @@ function le(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function pe(t) {
-    var e = A(t);
-    if (!e.S) if ("F" /* First */ === e.limitType) e.S = Wt(e.path, e.collectionGroup, he(e), e.filters, e.limit, e.startAt, e.endAt); else {
+ */ function ge(t) {
+    var e = k(t);
+    if (!e.F) if ("F" /* First */ === e.limitType) e.F = Zt(e.path, e.collectionGroup, ve(e), e.filters, e.limit, e.startAt, e.endAt); else {
         for (
         // Flip the orderBy directions since we want the last results
-        var n = [], r = 0, i = he(e); r < i.length; r++) {
+        var n = [], r = 0, i = ve(e); r < i.length; r++) {
             var o = i[r], a = "desc" /* DESCENDING */ === o.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            n.push(new oe(o.field, a));
+            n.push(new le(o.field, a));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                var s = e.endAt ? new ie(e.endAt.position, e.endAt.inclusive) : null, u = e.startAt ? new ie(e.startAt.position, e.startAt.inclusive) : null;
+                var s = e.endAt ? new ce(e.endAt.position, e.endAt.inclusive) : null, u = 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, n, e.filters, e.limit, s, u);
+                e.F = Zt(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
     }
-    return e.S;
+    return e.F;
 }
 
 /**
@@ -2207,7 +2589,7 @@ function le(t) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function de(t, e) {
+function we(t, e) {
     return function(t) {
         return "number" == typeof t && Number.isInteger(t) && !lt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
@@ -2219,7 +2601,7 @@ function de(t, e) {
             integerValue: "" + t
         };
     }(e) : function(t, e) {
-        if (t.F) {
+        if (t.S) {
             if (isNaN(e)) return {
                 doubleValue: "NaN"
             };
@@ -2252,36 +2634,36 @@ function de(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. */ var me = function() {
+/** Used to represent a field transform on a mutation. */ var be = function() {
     // Make sure that the structural type of `TransformOperation` is unique.
     // See https://github.com/microsoft/TypeScript/issues/5451
     this._ = void 0;
-}, ye = /** @class */ function(e) {
+}, _e = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(me), ve = /** @class */ function(e) {
+}(be), Te = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(me), ge = /** @class */ function(e) {
+}(be), Ee = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(me), we = /** @class */ function(e) {
+}(be), Se = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).q = t, r.O = n, r;
     }
     return t(n, e), n;
-}(me), be = function(t, e) {
+}(be), ke = function(t, e) {
     this.field = t, this.transform = e;
-}, _e = /** @class */ function() {
+}, Ie = /** @class */ function() {
     function t(t, e) {
         this.updateTime = t, this.exists = e
         /** Creates a new empty Precondition. */;
@@ -2303,40 +2685,48 @@ function de(t, e) {
     }), t.prototype.isEqual = function(t) {
         return this.exists === t.exists && (this.updateTime ? !!t.updateTime && this.updateTime.isEqual(t.updateTime) : !t.updateTime);
     }, t;
-}(), Te = function() {}, Se = /** @class */ function(e) {
+}(), Ae = function() {}, Ve = /** @class */ function(e) {
     function n(t, n, r, i) {
         void 0 === i && (i = []);
         var o = this;
         return (o = e.call(this) || this).key = t, o.value = n, o.precondition = r, o.fieldTransforms = i, 
         o.type = 0 /* Set */ , o;
     }
-    return t(n, e), n;
-}(Te), Ee = /** @class */ function(e) {
+    return t(n, e), n.prototype.getFieldMask = function() {
+        return null;
+    }, n;
+}(Ae), De = /** @class */ function(e) {
     function n(t, n, r, i, o) {
         void 0 === o && (o = []);
         var a = this;
         return (a = e.call(this) || this).key = t, a.data = n, a.fieldMask = r, a.precondition = i, 
         a.fieldTransforms = o, a.type = 1 /* Patch */ , a;
     }
-    return t(n, e), n;
-}(Te), Ae = /** @class */ function(e) {
+    return t(n, e), n.prototype.getFieldMask = function() {
+        return this.fieldMask;
+    }, n;
+}(Ae), Pe = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).key = t, r.precondition = n, r.type = 2 /* Delete */ , 
         r.fieldTransforms = [], r;
     }
-    return t(n, e), n;
-}(Te), Ie = /** @class */ function(e) {
+    return t(n, e), n.prototype.getFieldMask = function() {
+        return null;
+    }, n;
+}(Ae), Ne = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).key = t, r.precondition = n, r.type = 3 /* Verify */ , 
         r.fieldTransforms = [], r;
     }
-    return t(n, e), n;
-}(Te), ke = {
+    return t(n, e), n.prototype.getFieldMask = function() {
+        return null;
+    }, n;
+}(Ae), Fe = {
     asc: "ASCENDING",
     desc: "DESCENDING"
-}, Ve = {
+}, Oe = {
     "<": "LESS_THAN",
     "<=": "LESS_THAN_OR_EQUAL",
     ">": "GREATER_THAN",
@@ -2347,8 +2737,8 @@ function de(t, e) {
     in: "IN",
     "not-in": "NOT_IN",
     "array-contains-any": "ARRAY_CONTAINS_ANY"
-}, De = function(t, e) {
-    this.databaseId = t, this.F = e;
+}, qe = function(t, e) {
+    this.databaseId = t, this.S = e;
 };
 
 /** Transforms a value into a server-generated timestamp. */
@@ -2363,8 +2753,8 @@ function de(t, e) {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Pe(t, e) {
-    return t.F ? new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "") + "." + ("000000000" + e.nanoseconds).slice(-9) + "Z" : {
+function Re(t, e) {
+    return t.S ? new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "") + "." + ("000000000" + e.nanoseconds).slice(-9) + "Z" : {
         seconds: "" + e.seconds,
         nanos: e.nanoseconds
     };
@@ -2374,72 +2764,72 @@ function Pe(t, e) {
  * Returns a value for bytes that's appropriate to put in a proto.
  *
  * Visible for testing.
- */ function Ne(t, e) {
-    return t.F ? e.toBase64() : e.toUint8Array();
+ */ function xe(t, e) {
+    return t.S ? e.toBase64() : e.toUint8Array();
 }
 
-function qe(t, e) {
-    return Pe(t, e.toTimestamp());
+function Ce(t, e) {
+    return Re(t, e.toTimestamp());
 }
 
-function Fe(t) {
-    return E(!!t), _t.fromTimestamp(function(t) {
-        var e = kt(t);
+function Le(t) {
+    return S(!!t), _t.fromTimestamp(function(t) {
+        var e = Ft(t);
         return new bt(e.seconds, e.nanos);
     }(t));
 }
 
-function Oe(t, e) {
+function je(t, e) {
     return function(t) {
         return new Z([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
-function Ce(t, e) {
-    return Oe(t.databaseId, e.path);
+function Me(t, e) {
+    return je(t.databaseId, e.path);
 }
 
-function je(t, e) {
+function Ue(t, e) {
     var n, r = function(t) {
         var e = Z.fromString(t);
-        return E(ze(e)), e;
+        return S(Ye(e)), e;
     }(e);
     if (r.get(1) !== t.databaseId.projectId) throw new M(V, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
     if (r.get(3) !== t.databaseId.database) throw new M(V, "Tried to deserialize key from different database: " + r.get(3) + " vs " + t.databaseId.database);
-    return new nt((E((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
+    return new nt((S((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
 }
 
-function Le(t, e) {
-    return Oe(t.databaseId, e);
+function Be(t, e) {
+    return je(t.databaseId, e);
 }
 
-function Re(t) {
+function ze(t) {
     return new Z([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function xe(t, e, n) {
+function Ge(t, e, n) {
     return {
-        name: Ce(t, e),
+        name: Me(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function Me(t) {
-    return ke[t];
+function Ke(t) {
+    return Fe[t];
 }
 
 // visible for testing
-function Ue(t) {
-    return Ve[t];
+function Qe(t) {
+    return Oe[t];
 }
 
-function Be(t) {
+function We(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Ge(t) {
+function He(t) {
     var e = [];
     return t.fields.forEach((function(t) {
         return e.push(t.canonicalString());
@@ -2448,7 +2838,7 @@ function Ge(t) {
     };
 }
 
-function ze(t) {
+function Ye(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2468,8 +2858,8 @@ function ze(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 Qe(t) {
-    return new De(t, /* useProto3Json= */ !0);
+ */ function $e(t) {
+    return new qe(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -2496,7 +2886,7 @@ function ze(t) {
  * backoff curve, and a +/- 50% "jitter" that is calculated and added to the
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
- */ var Ke = /** @class */ function() {
+ */ var Xe = /** @class */ function() {
     function t(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -2522,7 +2912,7 @@ function ze(t) {
      * much as 1.5*maxDelayMs.
      */ , i) {
         void 0 === n && (n = 1e3), void 0 === r && (r = 1.5), void 0 === i && (i = 6e4), 
-        this.C = t, this.timerId = e, this.L = n, this.U = r, this.k = i, this.j = 0, this.M = null, 
+        this.k = t, this.timerId = e, this.C = n, this.L = r, this.M = i, this.U = 0, this.j = null, 
         /** The last backoff attempt, as epoch milliseconds. */
         this.B = Date.now(), this.reset();
     }
@@ -2533,14 +2923,14 @@ function ze(t) {
      * (i.e. due to an error), initialDelayMs (plus jitter) will be used, and
      * subsequent ones will increase according to the backoffFactor.
      */    return t.prototype.reset = function() {
-        this.j = 0;
+        this.U = 0;
     }, 
     /**
      * Resets the backoff delay to the maximum delay (e.g. for use after a
      * RESOURCE_EXHAUSTED error).
      */
     t.prototype.G = function() {
-        this.j = this.k;
+        this.U = this.M;
     }, 
     /**
      * Returns a promise that resolves after currentDelayMs, and increases the
@@ -2553,50 +2943,50 @@ function ze(t) {
                 this.cancel();
         // First schedule using the current base (which may be 0 and should be
         // honored as such).
-        var n = Math.floor(this.j + this.Y()), r = Math.max(0, Date.now() - this.B), i = Math.max(0, n - r);
+        var n = Math.floor(this.U + this.K()), r = Math.max(0, Date.now() - this.B), i = Math.max(0, n - r);
         // Guard against lastAttemptTime being in the future due to a clock change.
-                i > 0 && w("ExponentialBackoff", "Backing off for " + i + " ms (base delay: " + this.j + " ms, delay with jitter: " + n + " ms, last attempt: " + r + " ms ago)"), 
-        this.M = this.C.enqueueAfterDelay(this.timerId, i, (function() {
+                i > 0 && w("ExponentialBackoff", "Backing off for " + i + " ms (base delay: " + this.U + " ms, delay with jitter: " + n + " ms, last attempt: " + r + " ms ago)"), 
+        this.j = this.k.enqueueAfterDelay(this.timerId, i, (function() {
             return e.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);
-    }, t.prototype.H = function() {
-        null !== this.M && (this.M.skipDelay(), this.M = null);
+        this.U *= this.L, this.U < this.C && (this.U = this.C), this.U > this.M && (this.U = this.M);
+    }, t.prototype.Y = function() {
+        null !== this.j && (this.j.skipDelay(), this.j = null);
     }, t.prototype.cancel = function() {
-        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] */ t.prototype.Y = function() {
-        return (Math.random() - .5) * this.j;
+    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.K = function() {
+        return (Math.random() - .5) * this.U;
     }, t;
-}(), He = /** @class */ function(e) {
+}(), Je = /** @class */ function(e) {
     function n(t, n, r, i) {
         var o = this;
         return (o = e.call(this) || this).authCredentials = t, o.appCheckCredentials = n, 
-        o.K = r, o.q = i, o.J = !1, o;
+        o.H = r, o.q = i, o.J = !1, o;
     }
     return t(n, e), n.prototype.X = function() {
-        if (this.J) throw new M(O, "The client has already been terminated.");
+        if (this.J) throw new M(q, "The client has already been terminated.");
     }, 
     /** Invokes the provided RPC with auth and AppCheck tokens. */ n.prototype.m = function(t, e, n) {
         var r = this;
         return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(i) {
             var o = i[0], a = i[1];
-            return r.K.m(t, e, n, o, a);
+            return r.H.m(t, e, n, o, a);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === q && (r.authCredentials.invalidateToken(), 
-            r.appCheckCredentials.invalidateToken()), t) : new M(k, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === F && (r.authCredentials.invalidateToken(), 
+            r.appCheckCredentials.invalidateToken()), t) : new M(A, t.toString());
         }));
     }, 
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */ n.prototype.T = function(t, e, n) {
         var r = this;
         return this.X(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(i) {
             var o = i[0], a = i[1];
-            return r.K.T(t, e, n, o, a);
+            return r.H.T(t, e, n, o, a);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === q && (r.authCredentials.invalidateToken(), 
-            r.appCheckCredentials.invalidateToken()), t) : new M(k, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === F && (r.authCredentials.invalidateToken(), 
+            r.appCheckCredentials.invalidateToken()), t) : new M(A, t.toString());
         }));
     }, n.prototype.terminate = function() {
         this.J = !0;
@@ -2630,60 +3020,60 @@ function ze(t) {
  */
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-function We(t, r) {
+function Ze(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = A(t), i = Re(e.q) + "/documents", o = {
+                return e = k(t), i = ze(e.q) + "/documents", o = {
                     writes: r.map((function(t) {
                         return function(t, e) {
                             var n;
-                            if (e instanceof Se) n = {
-                                update: xe(t, e.key, e.value)
-                            }; else if (e instanceof Ae) n = {
-                                delete: Ce(t, e.key)
-                            }; else if (e instanceof Ee) n = {
-                                update: xe(t, e.key, e.data),
-                                updateMask: Ge(e.fieldMask)
+                            if (e instanceof Ve) n = {
+                                update: Ge(t, e.key, e.value)
+                            }; else if (e instanceof Pe) n = {
+                                delete: Me(t, e.key)
+                            }; else if (e instanceof De) n = {
+                                update: Ge(t, e.key, e.data),
+                                updateMask: He(e.fieldMask)
                             }; else {
-                                if (!(e instanceof Ie)) return S();
+                                if (!(e instanceof Ne)) return E();
                                 n = {
-                                    verify: Ce(t, e.key)
+                                    verify: Me(t, e.key)
                                 };
                             }
                             return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((function(t) {
                                 return function(t, e) {
                                     var n = e.transform;
-                                    if (n instanceof ye) return {
+                                    if (n instanceof _e) return {
                                         fieldPath: e.field.canonicalString(),
                                         setToServerValue: "REQUEST_TIME"
                                     };
-                                    if (n instanceof ve) return {
+                                    if (n instanceof Te) return {
                                         fieldPath: e.field.canonicalString(),
                                         appendMissingElements: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof ge) return {
+                                    if (n instanceof Ee) return {
                                         fieldPath: e.field.canonicalString(),
                                         removeAllFromArray: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof we) return {
+                                    if (n instanceof Se) return {
                                         fieldPath: e.field.canonicalString(),
                                         increment: n.O
                                     };
-                                    throw S();
+                                    throw E();
                                 }(0, t);
                             }))), e.precondition.isNone || (n.currentDocument = function(t, e) {
                                 return void 0 !== e.updateTime ? {
-                                    updateTime: qe(t, e.updateTime)
+                                    updateTime: Ce(t, e.updateTime)
                                 } : void 0 !== e.exists ? {
                                     exists: e.exists
-                                } : S();
+                                } : E();
                             }(t, e.precondition)), n;
                         }(e.q, t);
                     }))
@@ -2696,15 +3086,15 @@ function We(t, r) {
     }));
 }
 
-function Ye(t, r) {
+function tn(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o, a, s, u;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = A(t), i = Re(e.q) + "/documents", o = {
+                return e = k(t), i = ze(e.q) + "/documents", o = {
                     documents: r.map((function(t) {
-                        return Ce(e.q, t);
+                        return Me(e.q, t);
                     }))
                 }, [ 4 /*yield*/ , e.T("BatchGetDocuments", i, o) ];
 
@@ -2712,44 +3102,44 @@ function Ye(t, r) {
                 return a = n.sent(), s = new Map, a.forEach((function(t) {
                     var n = function(t, e) {
                         return "found" in e ? function(t, e) {
-                            E(!!e.found), e.found.name, e.found.updateTime;
-                            var n = je(t, e.found.name), r = Fe(e.found.updateTime), i = new Qt({
+                            S(!!e.found), e.found.name, e.found.updateTime;
+                            var n = Ue(t, e.found.name), r = Le(e.found.updateTime), i = new $t({
                                 mapValue: {
                                     fields: e.found.fields
                                 }
                             });
-                            return Kt.newFoundDocument(n, r, i);
+                            return Xt.newFoundDocument(n, r, i);
                         }(t, e) : "missing" in e ? function(t, e) {
-                            E(!!e.missing), E(!!e.readTime);
-                            var n = je(t, e.missing), r = Fe(e.readTime);
-                            return Kt.newNoDocument(n, r);
-                        }(t, e) : S();
+                            S(!!e.missing), S(!!e.readTime);
+                            var n = Ue(t, e.missing), r = Le(e.readTime);
+                            return Xt.newNoDocument(n, r);
+                        }(t, e) : E();
                     }(e.q, t);
                     s.set(n.key.toString(), n);
                 })), u = [], [ 2 /*return*/ , (r.forEach((function(t) {
                     var e = s.get(t.toString());
-                    E(!!e), u.push(e);
+                    S(!!e), u.push(e);
                 })), u) ];
             }
         }));
     }));
 }
 
-function $e(t, r) {
+function en(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = A(t), i = function(t, e) {
+                return e = k(t), i = function(t, e) {
                     // Dissect the path into parent, collectionId, and optional key filter.
                     var n = {
                         structuredQuery: {}
                     }, r = e.path;
-                    null !== e.collectionGroup ? (n.parent = Le(t, r), n.structuredQuery.from = [ {
+                    null !== e.collectionGroup ? (n.parent = Be(t, r), n.structuredQuery.from = [ {
                         collectionId: e.collectionGroup,
                         allDescendants: !0
-                    } ]) : (n.parent = Le(t, r.popLast()), n.structuredQuery.from = [ {
+                    } ]) : (n.parent = Be(t, r.popLast()), n.structuredQuery.from = [ {
                         collectionId: r.lastSegment()
                     } ]);
                     var i = function(t) {
@@ -2758,36 +3148,36 @@ function $e(t, r) {
                                 // visible for testing
                                 return function(t) {
                                     if ("==" /* EQUAL */ === t.op) {
-                                        if (Bt(t.value)) return {
+                                        if (Wt(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: We(t.field),
                                                 op: "IS_NAN"
                                             }
                                         };
-                                        if (Ut(t.value)) return {
+                                        if (Qt(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: We(t.field),
                                                 op: "IS_NULL"
                                             }
                                         };
                                     } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                                        if (Bt(t.value)) return {
+                                        if (Wt(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: We(t.field),
                                                 op: "IS_NOT_NAN"
                                             }
                                         };
-                                        if (Ut(t.value)) return {
+                                        if (Qt(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: We(t.field),
                                                 op: "IS_NOT_NULL"
                                             }
                                         };
                                     }
                                     return {
                                         fieldFilter: {
-                                            field: Be(t.field),
-                                            op: Ue(t.op),
+                                            field: We(t.field),
+                                            op: Qe(t.op),
                                             value: t.value
                                         }
                                     };
@@ -2807,15 +3197,15 @@ function $e(t, r) {
                             // visible for testing
                             return function(t) {
                                 return {
-                                    field: Be(t.field),
-                                    direction: Me(t.dir)
+                                    field: We(t.field),
+                                    direction: Ke(t.dir)
                                 };
                             }(t);
                         }));
                     }(e.orderBy);
                     o && (n.structuredQuery.orderBy = o);
                     var a, s = function(t, e) {
-                        return t.F || ct(e) ? e : {
+                        return t.S || ct(e) ? e : {
                             value: e
                         };
                     }(t, e.limit);
@@ -2828,7 +3218,7 @@ function $e(t, r) {
                             values: t.position
                         };
                     }(e.endAt)), n;
-                }(e.q, pe(r)), [ 4 /*yield*/ , e.T("RunQuery", i.parent, {
+                }(e.q, ge(r)), [ 4 /*yield*/ , e.T("RunQuery", i.parent, {
                     structuredQuery: i.structuredQuery
                 }) ];
 
@@ -2837,11 +3227,11 @@ function $e(t, r) {
                     return !!t.document;
                 })).map((function(t) {
                     return function(t, e, n) {
-                        var r = je(t, e.name), i = Fe(e.updateTime), o = new Qt({
+                        var r = Ue(t, e.name), i = Le(e.updateTime), o = new $t({
                             mapValue: {
                                 fields: e.fields
                             }
-                        }), a = Kt.newFoundDocument(r, i, o);
+                        }), a = Xt.newFoundDocument(r, i, o);
                         return a;
                     }(e.q, t.document);
                 })) ];
@@ -2865,7 +3255,7 @@ function $e(t, r) {
  * 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.
- */ var Xe = new Map;
+ */ var nn = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -2875,17 +3265,17 @@ function $e(t, r) {
  * Returns an initialized and started Datastore for the given Firestore
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
- */ function Je(t) {
-    if (t._terminated) throw new M(O, "The client has already been terminated.");
-    if (!Xe.has(t)) {
+ */ function rn(t) {
+    if (t._terminated) throw new M(q, "The client has already been terminated.");
+    if (!nn.has(t)) {
         w("ComponentProvider", "Initializing Datastore");
         var e = function(t) {
-            return new mt(t, fetch.bind(null));
+            return new yt(t, fetch.bind(null));
         }((i = t._databaseId, o = t.app.options.appId || "", a = t._persistenceKey, s = t._freezeSettings(), 
-        new $(i, o, a, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), n = Qe(t._databaseId), r = function(t, e, n, r) {
-            return new He(t, e, n, r);
+        new $(i, o, a, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), n = $e(t._databaseId), r = function(t, e, n, r) {
+            return new Je(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, e, n);
-        Xe.set(t, r);
+        nn.set(t, r);
     }
     var i, o, a, s;
     /**
@@ -2903,7 +3293,7 @@ function $e(t, r) {
  * 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 Xe.get(t);
+ */    return nn.get(t);
 }
 
 /**
@@ -2914,7 +3304,7 @@ function $e(t, r) {
  * A concrete type describing all the values that can be applied via a
  * user-supplied `FirestoreSettings` object. This is a separate type so that
  * defaults can be supplied and the value can be checked for equality.
- */ var Ze = /** @class */ function() {
+ */ var on = /** @class */ function() {
     function t(t) {
         var e;
         if (void 0 === t.host) {
@@ -2934,14 +3324,14 @@ function $e(t, r) {
     return t.prototype.isEqual = function(t) {
         return this.host === t.host && this.ssl === t.ssl && this.credentials === t.credentials && this.cacheSizeBytes === t.cacheSizeBytes && this.experimentalForceLongPolling === t.experimentalForceLongPolling && this.experimentalAutoDetectLongPolling === t.experimentalAutoDetectLongPolling && this.ignoreUndefinedProperties === t.ignoreUndefinedProperties && this.useFetchStreams === t.useFetchStreams;
     }, t;
-}(), tn = /** @class */ function() {
+}(), an = /** @class */ function() {
     /** @hideconstructor */
     function t(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 Ze({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new on({}), 
         this._settingsFrozen = !1, t instanceof X ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
             if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new M(V, '"projectId" not provided in firebase.initializeApp.');
@@ -2954,7 +3344,7 @@ function $e(t, r) {
          * instance.
          */
         get: function() {
-            if (!this._app) throw new M(O, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+            if (!this._app) throw new M(q, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
             return this._app;
         },
         enumerable: !1,
@@ -2972,15 +3362,15 @@ function $e(t, r) {
         enumerable: !1,
         configurable: !0
     }), t.prototype._setSettings = function(t) {
-        if (this._settingsFrozen) throw new M(O, "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 Ze(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
-            if (!t) return new G;
+        if (this._settingsFrozen) throw new M(q, "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 on(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+            if (!t) return new z;
             switch (t.type) {
               case "gapi":
                 var e = t.client;
                 // Make sure this really is a Gapi client.
-                                return E(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
-                new H(e, t.sessionIndex || "0", t.iamToken || null);
+                                return S(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
+                new W(e, t.sessionIndex || "0", t.iamToken || null);
 
               case "provider":
                 return t.client;
@@ -3011,8 +3401,8 @@ function $e(t, r) {
      * Only ever called once.
      */
     t.prototype._terminate = function() {
-        return t = this, (e = Xe.get(t)) && (w("ComponentProvider", "Removing Datastore"), 
-        Xe.delete(t), e.terminate()), Promise.resolve();
+        return t = this, (e = nn.get(t)) && (w("ComponentProvider", "Removing Datastore"), 
+        nn.delete(t), e.terminate()), Promise.resolve();
         var t, e;
     }, t;
 }();
@@ -3037,9 +3427,9 @@ function $e(t, r) {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ function en(t, e) {
+ */ function sn(t, e) {
     var n = _getProvider(t, "firestore/lite");
-    if (n.isInitialized()) throw new M(O, "Firestore can only be initialized once per app.");
+    if (n.isInitialized()) throw new M(q, "Firestore can only be initialized once per app.");
     return n.initialize({
         options: e
     });
@@ -3053,7 +3443,7 @@ function $e(t, r) {
  * @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 nn(t) {
+ */ function un(t) {
     return void 0 === t && (t = s()), _getProvider(t, "firestore/lite").getImmediate();
 }
 
@@ -3069,25 +3459,25 @@ function $e(t, r) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function rn(t, e, n, r) {
+ */ function cn(t, e, n, r) {
     var i;
     void 0 === r && (r = {});
-    var o = (t = st(t, tn))._getSettings();
+    var o = (t = st(t, an))._getSettings();
     if ("firestore.googleapis.com" !== o.host && o.host !== e && _("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, o), {
         host: e + ":" + n,
         ssl: !1
     })), r.mockUserToken) {
         var a, s;
-        if ("string" == typeof r.mockUserToken) a = r.mockUserToken, s = m.MOCK_USER; else {
+        if ("string" == typeof r.mockUserToken) a = r.mockUserToken, s = y.MOCK_USER; else {
             // Let createMockUserToken validate first (catches common mistakes like
             // invalid field "uid" and missing field "sub" / "user_id".)
             a = d(r.mockUserToken, null === (i = t._app) || void 0 === i ? void 0 : i.options.projectId);
             var u = r.mockUserToken.sub || r.mockUserToken.user_id;
             if (!u) throw new M(V, "mockUserToken must contain 'sub' or 'user_id' field!");
-            s = new m(u);
+            s = new y(u);
         }
-        t._authCredentials = new z(new B(a, s));
+        t._authCredentials = new G(new B(a, s));
     }
 }
 
@@ -3110,8 +3500,8 @@ function $e(t, r) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function on(t) {
-    return t = st(t, tn), u(t.app, "firestore/lite"), t._delete()
+ */ function ln(t) {
+    return t = st(t, an), u(t.app, "firestore/lite"), t._delete()
     /**
  * @license
  * Copyright 2020 Google LLC
@@ -3151,7 +3541,7 @@ function $e(t, r) {
  */;
 }
 
-var an = /** @class */ function() {
+var fn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, 
     /**
@@ -3192,14 +3582,14 @@ var an = /** @class */ function() {
          * The collection this `DocumentReference` belongs to.
          */
         get: function() {
-            return new un(this.firestore, this.converter, this._key.path.popLast());
+            return new pn(this.firestore, this.converter, this._key.path.popLast());
         },
         enumerable: !1,
         configurable: !0
     }), t.prototype.withConverter = function(e) {
         return new t(this.firestore, e, this._key);
     }, t;
-}(), sn = /** @class */ function() {
+}(), hn = /** @class */ function() {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     function t(t, 
@@ -3214,11 +3604,11 @@ var an = /** @class */ function() {
     return t.prototype.withConverter = function(e) {
         return new t(this.firestore, e, this._query);
     }, t;
-}(), un = /** @class */ function(e) {
+}(), pn = /** @class */ function(e) {
     /** @hideconstructor */
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this, t, n, new ue(r)) || this)._path = r, 
+        return (i = e.call(this, t, n, new pe(r)) || this)._path = r, 
         /** The type of this Firestore reference. */
         i.type = "collection", i;
     }
@@ -3245,7 +3635,7 @@ var an = /** @class */ function() {
          */
         get: function() {
             var t = this._path.popLast();
-            return t.isEmpty() ? null : new an(this.firestore, 
+            return t.isEmpty() ? null : new fn(this.firestore, 
             /* converter= */ null, new nt(t));
         },
         enumerable: !1,
@@ -3253,20 +3643,20 @@ var an = /** @class */ function() {
     }), n.prototype.withConverter = function(t) {
         return new n(this.firestore, t, this._path);
     }, n;
-}(sn);
+}(hn);
 
 /**
  * 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.
- */ function cn(t, e) {
+ */ function dn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
-    if (t = p(t), rt("collection", "path", e), t instanceof tn) {
+    if (t = p(t), rt("collection", "path", e), t instanceof an) {
         var o = Z.fromString.apply(Z, r([ e ], n));
-        return ot(o), new un(t, /* converter= */ null, o);
+        return ot(o), new pn(t, /* converter= */ null, o);
     }
-    if (!(t instanceof an || t instanceof un)) throw new M(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    if (!(t instanceof fn || t instanceof pn)) throw new M(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
     var a = t._path.child(Z.fromString.apply(Z, r([ e ], n)));
-    return ot(a), new un(t.firestore, 
+    return ot(a), new pn(t.firestore, 
     /* converter= */ null, a);
 }
 
@@ -3282,32 +3672,32 @@ var an = /** @class */ function() {
  * 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 ln(t, e) {
-    if (t = st(t, tn), rt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new M(V, "Invalid collection ID '" + e + "' passed to function collectionGroup(). Collection IDs must not contain '/'.");
-    return new sn(t, 
+ */ function yn(t, e) {
+    if (t = st(t, an), rt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new M(V, "Invalid collection ID '" + e + "' passed to function collectionGroup(). Collection IDs must not contain '/'.");
+    return new hn(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(Z.emptyPath(), t);
+        return new pe(Z.emptyPath(), t);
     }(e));
 }
 
-function fn(t, e) {
+function mn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
     if (t = p(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = vt.R()), rt("doc", "path", e), t instanceof tn) {
+    1 === arguments.length && (e = vt.R()), rt("doc", "path", e), t instanceof an) {
         var o = Z.fromString.apply(Z, r([ e ], n));
-        return it(o), new an(t, 
+        return it(o), new fn(t, 
         /* converter= */ null, new nt(o));
     }
-    if (!(t instanceof an || t instanceof un)) throw new M(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    if (!(t instanceof fn || t instanceof pn)) throw new M(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
     var a = t._path.child(Z.fromString.apply(Z, r([ e ], n)));
-    return it(a), new an(t.firestore, t instanceof un ? t.converter : null, new nt(a));
+    return it(a), new fn(t.firestore, t instanceof pn ? t.converter : null, new nt(a));
 }
 
 /**
@@ -3317,8 +3707,8 @@ function fn(t, e) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function hn(t, e) {
-    return t = p(t), e = p(e), (t instanceof an || t instanceof un) && (e instanceof an || e instanceof un) && t.firestore === e.firestore && t.path === e.path && t.converter === e.converter
+ */ function vn(t, e) {
+    return t = p(t), e = p(e), (t instanceof fn || t instanceof pn) && (e instanceof fn || e instanceof pn) && t.firestore === e.firestore && t.path === e.path && t.converter === e.converter
     /**
  * Returns true if the provided queries point to the same collection and apply
  * the same constraints.
@@ -3330,18 +3720,18 @@ function fn(t, e) {
  */;
 }
 
-function pn(t, e) {
-    return t = p(t), e = p(e), t instanceof sn && e instanceof sn && t.firestore === e.firestore && function(t, e) {
+function gn(t, e) {
+    return t = p(t), e = p(e), t instanceof hn && e instanceof hn && t.firestore === e.firestore && function(t, e) {
         return function(t, e) {
             if (t.limit !== e.limit) return !1;
             if (t.orderBy.length !== e.orderBy.length) return !1;
-            for (var n = 0; n < t.orderBy.length; n++) if (!ae(t.orderBy[n], e.orderBy[n])) return !1;
+            for (var n = 0; n < t.orderBy.length; n++) if (!fe(t.orderBy[n], e.orderBy[n])) return !1;
             if (t.filters.length !== e.filters.length) return !1;
             for (var r = 0; r < t.filters.length; r++) if (i = t.filters[r], o = e.filters[r], 
-            i.op !== o.op || !i.field.isEqual(o.field) || !Ct(i.value, o.value)) return !1;
+            i.op !== o.op || !i.field.isEqual(o.field) || !Mt(i.value, o.value)) return !1;
             var i, o;
-            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!se(t.startAt, e.startAt) && se(t.endAt, e.endAt);
-        }(pe(t), pe(e)) && t.limitType === e.limitType;
+            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!he(t.startAt, e.startAt) && he(t.endAt, e.endAt);
+        }(ge(t), ge(e)) && t.limitType === e.limitType;
     }(t._query, e._query) && t.converter === e.converter
     /**
  * @license
@@ -3369,7 +3759,7 @@ function pn(t, e) {
  */;
 }
 
-var dn = /** @class */ function() {
+var wn = /** @class */ function() {
     /**
      * 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.
@@ -3394,8 +3784,8 @@ var dn = /** @class */ function() {
 /**
  * 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 mn() {
-    return new dn("__name__");
+ */ function bn() {
+    return new wn("__name__");
 }
 
 /**
@@ -3416,7 +3806,7 @@ var dn = /** @class */ function() {
  */
 /**
  * An immutable object representing an array of bytes.
- */ var yn = /** @class */ function() {
+ */ var _n = /** @class */ function() {
     /** @hideconstructor */
     function t(t) {
         this._byteString = t;
@@ -3428,7 +3818,7 @@ var dn = /** @class */ function() {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    return t.fromBase64String = function(e) {
         try {
-            return new t(At.fromBase64String(e));
+            return new t(Pt.fromBase64String(e));
         } catch (e) {
             throw new M(V, "Failed to construct data from Base64 string: " + e);
         }
@@ -3439,7 +3829,7 @@ var dn = /** @class */ function() {
      * @param array - The Uint8Array used to create the `Bytes` object.
      */
     t.fromUint8Array = function(e) {
-        return new t(At.fromUint8Array(e));
+        return new t(Pt.fromUint8Array(e));
     }, 
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3474,14 +3864,14 @@ var dn = /** @class */ function() {
     t.prototype.isEqual = function(t) {
         return this._byteString.isEqual(t._byteString);
     }, t;
-}(), vn = 
+}(), Tn = 
 /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
      */
 function(t) {
     this._methodName = t;
-}, gn = /** @class */ function() {
+}, En = /** @class */ function() {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3534,21 +3924,21 @@ function(t) {
     t.prototype._compareTo = function(t) {
         return gt(this._lat, t._lat) || gt(this._long, t._long);
     }, t;
-}(), wn = /^__.*__$/, bn = /** @class */ function() {
+}(), Sn = /^__.*__$/, kn = /** @class */ function() {
     function t(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     return t.prototype.toMutation = function(t, e) {
-        return null !== this.fieldMask ? new Ee(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Se(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new De(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Ve(t, this.data, e, this.fieldTransforms);
     }, t;
-}(), _n = /** @class */ function() {
+}(), In = /** @class */ function() {
     function t(t, 
     // The fieldMask does not include document transforms.
     e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     return t.prototype.toMutation = function(t, e) {
-        return new Ee(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new De(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }, t;
 }();
 
@@ -3571,7 +3961,7 @@ function(t) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ function Tn(t) {
+ */ function An(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3585,11 +3975,11 @@ function(t) {
         return !1;
 
       default:
-        throw S();
+        throw E();
     }
 }
 
-/** A "context" object passed around while parsing user data. */ var Sn = /** @class */ function() {
+/** A "context" object passed around while parsing user data. */ var Vn = /** @class */ function() {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3649,7 +4039,7 @@ function(t) {
             rt: !0
         });
     }, t.prototype.ut = function(t) {
-        return Gn(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
+        return Hn(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
     }, 
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */ t.prototype.contains = function(t) {
         return void 0 !== this.fieldMask.find((function(e) {
@@ -3663,15 +4053,15 @@ function(t) {
         if (this.path) for (var t = 0; t < this.path.length; t++) this.st(this.path.get(t));
     }, t.prototype.st = function(t) {
         if (0 === t.length) throw this.ut("Document fields must not be empty");
-        if (Tn(this.tt) && wn.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
+        if (An(this.tt) && Sn.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
     }, t;
-}(), En = /** @class */ function() {
+}(), Dn = /** @class */ function() {
     function t(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.q = n || Qe(t)
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.q = n || $e(t)
         /** Creates a new top-level parse context. */;
     }
     return t.prototype.ht = function(t, e, n, r) {
-        return void 0 === r && (r = !1), new Sn({
+        return void 0 === r && (r = !1), new Vn({
             tt: t,
             methodName: e,
             at: n,
@@ -3685,30 +4075,30 @@ function(t) {
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ function An(t) {
-    var e = t._freezeSettings(), n = Qe(t._databaseId);
-    return new En(t._databaseId, !!e.ignoreUndefinedProperties, n);
+ */ function Pn(t) {
+    var e = t._freezeSettings(), n = $e(t._databaseId);
+    return new Dn(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function In(t, e, n, r, i, o) {
+/** Parse document data from a set() call. */ function Nn(t, e, n, r, i, o) {
     void 0 === o && (o = {});
     var a = t.ht(o.merge || o.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
-    xn("Data must be an object, but it was:", a, r);
-    var s, u, c = Ln(r, a);
-    if (o.merge) s = new Et(a.fieldMask), u = a.fieldTransforms; else if (o.mergeFields) {
+    Gn("Data must be an object, but it was:", a, r);
+    var s, u, c = Bn(r, a);
+    if (o.merge) s = new Dt(a.fieldMask), u = a.fieldTransforms; else if (o.mergeFields) {
         for (var l = [], f = 0, h = o.mergeFields; f < h.length; f++) {
-            var p = Mn(e, h[f], n);
+            var p = Kn(e, h[f], n);
             if (!a.contains(p)) throw new M(V, "Field '" + p + "' is specified in your field mask but missing from your input data.");
-            zn(l, p) || l.push(p);
+            Yn(l, p) || l.push(p);
         }
-        s = new Et(l), u = a.fieldTransforms.filter((function(t) {
+        s = new Dt(l), u = a.fieldTransforms.filter((function(t) {
             return s.covers(t.field);
         }));
     } else s = null, u = a.fieldTransforms;
-    return new bn(new Qt(c), s, u);
+    return new kn(new $t(c), s, u);
 }
 
-var kn = /** @class */ function(e) {
+var Fn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -3720,7 +4110,7 @@ var kn = /** @class */ function(e) {
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(vn);
+}(Tn);
 
 /**
  * Creates a child context for parsing SerializableFieldValues.
@@ -3737,8 +4127,8 @@ var kn = /** @class */ function(e) {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function Vn(t, e, n) {
-    return new Sn({
+ */ function On(t, e, n) {
+    return new Vn({
         tt: 3 /* Argument */ ,
         at: e.settings.at,
         methodName: t._methodName,
@@ -3746,101 +4136,101 @@ var kn = /** @class */ function(e) {
     }, e.databaseId, e.q, e.ignoreUndefinedProperties);
 }
 
-var Dn = /** @class */ function(e) {
+var qn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        return new be(t.path, new ye);
+        return new ke(t.path, new _e);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(vn), Pn = /** @class */ function(e) {
+}(Tn), Rn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).lt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = Vn(this, t, 
+        var e = On(this, t, 
         /*array=*/ !0), n = this.lt.map((function(t) {
-            return jn(t, e);
-        })), r = new ve(n);
-        return new be(t.path, r);
+            return Un(t, e);
+        })), r = new Te(n);
+        return new ke(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(vn), Nn = /** @class */ function(e) {
+}(Tn), xn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).lt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = Vn(this, t, 
+        var e = On(this, t, 
         /*array=*/ !0), n = this.lt.map((function(t) {
-            return jn(t, e);
-        })), r = new ge(n);
-        return new be(t.path, r);
+            return Un(t, e);
+        })), r = new Ee(n);
+        return new ke(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(vn), qn = /** @class */ function(e) {
+}(Tn), Cn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).ft = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = new we(t.q, de(t.q, this.ft));
-        return new be(t.path, e);
+        var e = new Se(t.q, we(t.q, this.ft));
+        return new ke(t.path, e);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(vn);
+}(Tn);
 
-/** Parse update data from an update() call. */ function Fn(t, e, n, r) {
+/** Parse update data from an update() call. */ function Ln(t, e, n, r) {
     var i = t.ht(1 /* Update */ , e, n);
-    xn("Data must be an object, but it was:", i, r);
-    var o = [], a = Qt.empty();
-    St(r, (function(t, r) {
-        var s = Bn(e, t, n);
+    Gn("Data must be an object, but it was:", i, r);
+    var o = [], a = $t.empty();
+    Et(r, (function(t, r) {
+        var s = Wn(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = p(r);
         var u = i.it(s);
-        if (r instanceof kn) 
+        if (r instanceof Fn) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(s); else {
-            var c = jn(r, u);
+            var c = Un(r, u);
             null != c && (o.push(s), a.set(s, c));
         }
     }));
-    var s = new Et(o);
-    return new _n(a, s, i.fieldTransforms);
+    var s = new Dt(o);
+    return new In(a, s, i.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function On(t, e, n, r, i, o) {
-    var a = t.ht(1 /* Update */ , e, n), s = [ Mn(e, r, n) ], u = [ i ];
+/** Parse update data from a list of field/value arguments. */ function jn(t, e, n, r, i, o) {
+    var a = t.ht(1 /* Update */ , e, n), s = [ Kn(e, r, n) ], u = [ i ];
     if (o.length % 2 != 0) throw new M(V, "Function " + e + "() needs to be called with an even number of arguments that alternate between field names and values.");
-    for (var c = 0; c < o.length; c += 2) s.push(Mn(e, o[c])), u.push(o[c + 1]);
+    for (var c = 0; c < o.length; c += 2) s.push(Kn(e, o[c])), u.push(o[c + 1]);
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
-    for (var l = [], f = Qt.empty(), h = s.length - 1; h >= 0; --h) if (!zn(l, s[h])) {
-        var d = s[h], m = u[h];
+    for (var l = [], f = $t.empty(), h = s.length - 1; h >= 0; --h) if (!Yn(l, s[h])) {
+        var d = s[h], y = u[h];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-        m = p(m);
-        var y = a.it(d);
-        if (m instanceof kn) 
+        y = p(y);
+        var m = a.it(d);
+        if (y instanceof Fn) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(d); else {
-            var v = jn(m, y);
+            var v = Un(y, m);
             null != v && (l.push(d), f.set(d, v));
         }
     }
-    var g = new Et(l);
-    return new _n(f, g, a.fieldTransforms);
+    var g = new Dt(l);
+    return new In(f, g, a.fieldTransforms);
 }
 
 /**
@@ -3849,8 +4239,8 @@ var Dn = /** @class */ function(e) {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function Cn(t, e, n, r) {
-    return void 0 === r && (r = !1), jn(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+ */ function Mn(t, e, n, r) {
+    return void 0 === r && (r = !1), Un(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -3861,12 +4251,12 @@ var Dn = /** @class */ function(e) {
  * 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 jn(t, e) {
-    if (Rn(
+ */ function Un(t, e) {
+    if (zn(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = p(t))) return xn("Unsupported field value:", e, t), Ln(t, e);
-    if (t instanceof vn) 
+    t = p(t))) return Gn("Unsupported field value:", e, t), Bn(t, e);
+    if (t instanceof Tn) 
     // 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
@@ -3878,7 +4268,7 @@ var Dn = /** @class */ function(e) {
      */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Tn(e.tt)) throw e.ut(t._methodName + "() can only be used with update() and set()");
+        if (!An(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");
         var n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
@@ -3901,7 +4291,7 @@ var Dn = /** @class */ function(e) {
         if (e.settings.rt && 4 /* ArrayArgument */ !== e.tt) throw e.ut("Nested arrays are not supported");
         return function(t, e) {
             for (var n = [], r = 0, i = 0, o = t; i < o.length; i++) {
-                var a = jn(o[i], e.ot(r));
+                var a = Un(o[i], e.ot(r));
                 null == a && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -3920,7 +4310,7 @@ var Dn = /** @class */ function(e) {
         if (null === (t = p(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return de(e.q, t);
+        if ("number" == typeof t) return we(e.q, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -3930,7 +4320,7 @@ var Dn = /** @class */ function(e) {
         if (t instanceof Date) {
             var n = bt.fromDate(t);
             return {
-                timestampValue: Pe(e.q, n)
+                timestampValue: Re(e.q, n)
             };
         }
         if (t instanceof bt) {
@@ -3939,30 +4329,30 @@ var Dn = /** @class */ function(e) {
             // truncation immediately without waiting for the backend to do that.
             var r = new bt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Pe(e.q, r)
+                timestampValue: Re(e.q, r)
             };
         }
-        if (t instanceof gn) return {
+        if (t instanceof En) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof yn) return {
-            bytesValue: Ne(e.q, t._byteString)
+        if (t instanceof _n) return {
+            bytesValue: xe(e.q, t._byteString)
         };
-        if (t instanceof an) {
+        if (t instanceof fn) {
             var i = e.databaseId, o = t.firestore._databaseId;
             if (!o.isEqual(i)) throw e.ut("Document reference is for database " + o.projectId + "/" + o.database + " but should be for database " + i.projectId + "/" + i.database);
             return {
-                referenceValue: Oe(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: je(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
         throw e.ut("Unsupported field value: " + at(t));
     }(t, e);
 }
 
-function Ln(t, e) {
+function Bn(t, e) {
     var n = {};
     return function(t) {
         for (var e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
@@ -3970,8 +4360,8 @@ function Ln(t, e) {
     }(t) ? 
     // If we encounter an empty object, we explicitly add it to the update
     // mask to ensure that the server creates a map entry.
-    e.path && e.path.length > 0 && e.fieldMask.push(e.path) : St(t, (function(t, r) {
-        var i = jn(r, e.nt(t));
+    e.path && e.path.length > 0 && e.fieldMask.push(e.path) : Et(t, (function(t, r) {
+        var i = Un(r, e.nt(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -3980,12 +4370,12 @@ function Ln(t, e) {
     };
 }
 
-function Rn(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof bt || t instanceof gn || t instanceof yn || t instanceof an || t instanceof vn);
+function zn(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof bt || t instanceof En || t instanceof _n || t instanceof fn || t instanceof Tn);
 }
 
-function xn(t, e, n) {
-    if (!Rn(n) || !function(t) {
+function Gn(t, e, n) {
+    if (!zn(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         var r = at(n);
@@ -3995,20 +4385,20 @@ function xn(t, e, n) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function Mn(t, e, n) {
+ */ function Kn(t, e, n) {
     if (
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    (e = p(e)) instanceof dn) return e._internalPath;
-    if ("string" == typeof e) return Bn(t, e);
-    throw Gn("Field path arguments must be of type string or ", t, 
+    (e = p(e)) instanceof wn) return e._internalPath;
+    if ("string" == typeof e) return Wn(t, e);
+    throw Hn("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.
- */ var Un = new RegExp("[~\\*/\\[\\]]");
+ */ var Qn = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4018,20 +4408,20 @@ function xn(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function Bn(t, e, n) {
-    if (e.search(Un) >= 0) throw Gn("Invalid field path (" + e + "). Paths must not contain '~', '*', '/', '[', or ']'", t, 
+ */ function Wn(t, e, n) {
+    if (e.search(Qn) >= 0) throw Hn("Invalid field path (" + e + "). Paths must not contain '~', '*', '/', '[', or ']'", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return (new (dn.bind.apply(dn, r([ void 0 ], e.split(".")))))._internalPath;
+        return (new (wn.bind.apply(wn, r([ void 0 ], e.split(".")))))._internalPath;
     } catch (r) {
-        throw Gn("Invalid field path (" + e + "). Paths must not be empty, begin with '.', end with '.', or contain '..'", t, 
+        throw Hn("Invalid field path (" + e + "). Paths must not be empty, begin with '.', end with '.', or contain '..'", t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function Gn(t, e, n, r, i) {
+function Hn(t, e, n, r, i) {
     var o = r && !r.isEmpty(), a = void 0 !== i, s = "Function " + e + "() called with invalid data";
     n && (s += " (via `toFirestore()`)");
     var u = "";
@@ -4040,7 +4430,7 @@ function Gn(t, e, n, r, i) {
     /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */;
 }
 
-function zn(t, e) {
+function Yn(t, e) {
     return t.some((function(t) {
         return t.isEqual(e);
     }));
@@ -4070,7 +4460,7 @@ function zn(t, e) {
  * 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.
- */ var Qn = /** @class */ function() {
+ */ var $n = /** @class */ function() {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4091,7 +4481,7 @@ function zn(t, e) {
          * The `DocumentReference` for the document included in the `DocumentSnapshot`.
          */
         get: function() {
-            return new an(this._firestore, this._converter, this._key);
+            return new fn(this._firestore, this._converter, this._key);
         },
         enumerable: !1,
         configurable: !0
@@ -4116,7 +4506,7 @@ function zn(t, e) {
             if (this._converter) {
                 // We only want to use the converter and create a new DocumentSnapshot
                 // if a converter has been provided.
-                var t = new Kn(this._firestore, this._userDataWriter, this._key, this._document, 
+                var t = new Xn(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4136,11 +4526,11 @@ function zn(t, e) {
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     t.prototype.get = function(t) {
         if (this._document) {
-            var e = this._document.data.field(Yn("DocumentSnapshot.get", t));
+            var e = this._document.data.field(tr("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }, t;
-}(), Kn = /** @class */ function(e) {
+}(), Xn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4152,7 +4542,7 @@ function zn(t, e) {
      */    return t(n, e), n.prototype.data = function() {
         return e.prototype.data.call(this);
     }, n;
-}(Qn), Hn = /** @class */ function() {
+}($n), Jn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._docs = e, this.query = t;
@@ -4206,15 +4596,15 @@ function zn(t, e) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */
-function Wn(t, e) {
-    return t = p(t), e = p(e), t instanceof Qn && e instanceof Qn ? 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 Hn && e instanceof Hn && pn(t.query, e.query) && wt(t.docs, e.docs, Wn)
+function Zn(t, e) {
+    return t = p(t), e = p(e), t instanceof $n && e instanceof $n ? 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 Jn && e instanceof Jn && gn(t.query, e.query) && wt(t.docs, e.docs, Zn)
     /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */;
 }
 
-function Yn(t, e) {
-    return "string" == typeof e ? Bn(t, e) : e instanceof dn ? e._internalPath : e._delegate._internalPath;
+function tr(t, e) {
+    return "string" == typeof e ? Wn(t, e) : e instanceof wn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4240,7 +4630,7 @@ function Yn(t, e) {
  * endBefore:1}, {@link (endAt:1)}, {@link limit} or {@link limitToLast} and
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
- */ var $n = function() {};
+ */ var er = function() {};
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4250,7 +4640,7 @@ function Yn(t, e) {
  * @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 Xn(t) {
+ */ function nr(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
     for (var r = 0, i = e; r < i.length; r++) {
         var o = i[r];
@@ -4259,39 +4649,39 @@ function Yn(t, e) {
     return t;
 }
 
-var Jn = /** @class */ function(e) {
+var rr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this) || this).dt = t, i.wt = n, i.yt = r, i.type = "where", 
         i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = An(t.firestore), n = function(t, e, n, r, i, o, a) {
+        var e = Pn(t.firestore), n = function(t, e, n, r, i, o, a) {
             var s;
             if (i.isKeyField()) {
                 if ("array-contains" /* ARRAY_CONTAINS */ === o || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === o) throw new M(V, "Invalid Query. You can't perform '" + o + "' queries on documentId().");
                 if ("in" /* IN */ === o || "not-in" /* NOT_IN */ === o) {
-                    pr(a, o);
+                    gr(a, o);
                     for (var u = [], c = 0, l = a; c < l.length; c++) {
                         var f = l[c];
-                        u.push(hr(r, t, f));
+                        u.push(vr(r, t, f));
                     }
                     s = {
                         arrayValue: {
                             values: u
                         }
                     };
-                } else s = hr(r, t, a);
-            } else "in" /* IN */ !== o && "not-in" /* NOT_IN */ !== o && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== o || pr(a, o), 
-            s = Cn(n, "where", a, 
+                } else s = vr(r, t, a);
+            } else "in" /* IN */ !== o && "not-in" /* NOT_IN */ !== o && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== o || gr(a, o), 
+            s = Mn(n, "where", a, 
             /* allowArrays= */ "in" /* IN */ === o || "not-in" /* NOT_IN */ === o);
-            var h = Yt.create(i, o, s);
+            var h = te.create(i, o, s);
             return function(t, e) {
-                if (e.N()) {
-                    var n = le(t);
+                if (e.D()) {
+                    var n = ye(t);
                     if (null !== n && !n.isEqual(e.field)) throw new M(V, "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() + "'");
-                    var r = ce(t);
-                    null !== r && dr(t, e.field, r);
+                    var r = de(t);
+                    null !== r && wr(t, e.field, r);
                 }
                 var i = function(t, e) {
                     for (var n = 0, r = t.filters; n < r.length; n++) {
@@ -4338,12 +4728,12 @@ var Jn = /** @class */ function(e) {
                 throw i === e.op ? new M(V, "Invalid query. You cannot use more than one '" + e.op.toString() + "' filter.") : new M(V, "Invalid query. You cannot use '" + e.op.toString() + "' filters with '" + i.toString() + "' filters.");
             }(t, h), h;
         }(t._query, 0, e, t.firestore._databaseId, this.dt, this.wt, this.yt);
-        return new sn(t.firestore, t.converter, function(t, e) {
+        return new hn(t.firestore, t.converter, function(t, e) {
             var 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 pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }, n;
-}($n);
+}(er);
 
 /**
  * Creates a {@link QueryConstraint} that enforces that documents must contain the
@@ -4355,12 +4745,12 @@ var Jn = /** @class */ function(e) {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function Zn(t, e, n) {
-    var r = e, i = Yn("where", t);
-    return new Jn(i, r, n);
+ */ function ir(t, e, n) {
+    var r = e, i = tr("where", t);
+    return new rr(i, r, n);
 }
 
-var tr = /** @class */ function(e) {
+var or = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).dt = t, r._t = n, r.type = "orderBy", r;
@@ -4369,22 +4759,22 @@ var tr = /** @class */ function(e) {
         var e = function(t, e, n) {
             if (null !== t.startAt) throw new M(V, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
             if (null !== t.endAt) throw new M(V, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            var r = new oe(e, n);
+            var r = new le(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.
-                    var n = le(t);
-                    null !== n && dr(t, n, e.field);
+                    var n = ye(t);
+                    null !== n && wr(t, n, e.field);
                 }
             }(t, r), r;
         }(t._query, this.dt, this._t);
-        return new sn(t.firestore, t.converter, function(t, e) {
+        return new hn(t.firestore, t.converter, function(t, e) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             var 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 pe(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }, n;
-}($n);
+}(er);
 
 /**
  * Creates a {@link QueryConstraint} that sorts the query result by the
@@ -4394,31 +4784,31 @@ var tr = /** @class */ function(e) {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function er(t, e) {
+ */ function ar(t, e) {
     void 0 === e && (e = "asc");
-    var n = e, r = Yn("orderBy", t);
-    return new tr(r, n);
+    var n = e, r = tr("orderBy", t);
+    return new or(r, n);
 }
 
-var nr = /** @class */ function(e) {
+var sr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.gt = n, i.bt = r, i;
+        return (i = e.call(this) || this).type = t, i.gt = n, i.vt = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        return new sn(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 hn(t.firestore, t.converter, function(t, e, n) {
+            return new pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        }(t._query, this.gt, this.vt));
     }, n;
-}($n);
+}(er);
 
 /**
  * Creates a {@link QueryConstraint} that only returns the first matching documents.
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function rr(t) {
-    return ut("limit", t), new nr("limit", t, "F" /* First */)
+ */ function ur(t) {
+    return ut("limit", t), new sr("limit", t, "F" /* First */)
     /**
  * Creates a {@link QueryConstraint} that only returns the last matching documents.
  *
@@ -4430,61 +4820,61 @@ var nr = /** @class */ function(e) {
  */;
 }
 
-function ir(t) {
-    return ut("limitToLast", t), new nr("limitToLast", t, "L" /* Last */);
+function cr(t) {
+    return ut("limitToLast", t), new sr("limitToLast", t, "L" /* Last */);
 }
 
-var or = /** @class */ function(e) {
+var lr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.vt = n, i.Et = r, i;
+        return (i = e.call(this) || this).type = t, i.bt = n, i.Et = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = fr(t, this.type, this.vt, this.Et);
-        return new sn(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);
+        var e = mr(t, this.type, this.bt, this.Et);
+        return new hn(t.firestore, t.converter, function(t, e) {
+            return new pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }, n;
-}($n);
+}(er);
 
-function ar() {
+function fr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new or("startAt", t, 
+    return new lr("startAt", t, 
     /*inclusive=*/ !0);
 }
 
-function sr() {
+function hr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new or("startAfter", t, 
+    return new lr("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
-var ur = /** @class */ function(e) {
+var pr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this) || this).type = t, i.vt = n, i.Et = r, i;
+        return (i = e.call(this) || this).type = t, i.bt = n, i.Et = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = fr(t, this.type, this.vt, this.Et);
-        return new sn(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);
+        var e = mr(t, this.type, this.bt, this.Et);
+        return new hn(t.firestore, t.converter, function(t, e) {
+            return new pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }, n;
-}($n);
+}(er);
 
-function cr() {
+function dr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new ur("endBefore", t, 
+    return new pr("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function lr() {
+function yr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new ur("endAt", t, /*inclusive=*/ !0);
+    return new pr("endAt", t, /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function fr(t, e, n, r) {
-    if (n[0] = p(n[0]), n[0] instanceof Qn) return function(t, e, n, r, i) {
+/** Helper function to create a bound from a document or fields */ function mr(t, e, n, r) {
+    if (n[0] = p(n[0]), n[0] instanceof $n) return function(t, e, n, r, i) {
         if (!r) throw new M(P, "Can't use a DocumentSnapshot that doesn't exist for " + n + "().");
         // 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
@@ -4493,11 +4883,11 @@ function lr() {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-        for (var o = [], a = 0, s = he(t); a < s.length; a++) {
+        for (var o = [], a = 0, s = ve(t); a < s.length; a++) {
             var u = s[a];
-            if (u.field.isKeyField()) o.push(xt(e, r.key)); else {
+            if (u.field.isKeyField()) o.push(Gt(e, r.key)); else {
                 var c = r.data.field(u.field);
-                if (Pt(c)) throw new M(V, 'Invalid query. You are trying to start or end a query using a document for which the field "' + u.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+                if (Rt(c)) throw new M(V, 'Invalid query. You are trying to start or end a query using a document for which the field "' + u.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
                 if (null === c) {
                     var l = u.field.canonicalString();
                     throw new M(V, "Invalid query. You are trying to start or end a query using a document for which the field '" + l + "' (used as the orderBy) does not exist.");
@@ -4505,9 +4895,9 @@ function lr() {
                 o.push(c);
             }
         }
-        return new ie(o, i);
+        return new ce(o, i);
     }(t._query, t.firestore._databaseId, e, n[0]._document, r);
-    var i = An(t.firestore);
+    var i = Pn(t.firestore);
     return function(t, e, n, r, i, o) {
         // Use explicit order by's because it has to match the query the user made
         var a = t.explicitOrderBy;
@@ -4516,41 +4906,41 @@ function lr() {
             var c = i[u];
             if (a[u].field.isKeyField()) {
                 if ("string" != typeof c) throw new M(V, "Invalid query. Expected a string for document ID in " + r + "(), but got a " + typeof c);
-                if (!fe(t) && -1 !== c.indexOf("/")) throw new M(V, "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 (!me(t) && -1 !== c.indexOf("/")) throw new M(V, "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.");
                 var l = t.path.child(Z.fromString(c));
                 if (!nt.isDocumentKey(l)) throw new M(V, "Invalid query. When querying a collection group and ordering by documentId(), the value passed to " + r + "() must result in a valid document path, but '" + l + "' is not because it contains an odd number of segments.");
                 var f = new nt(l);
-                s.push(xt(e, f));
+                s.push(Gt(e, f));
             } else {
-                var h = Cn(n, r, c);
+                var h = Mn(n, r, c);
                 s.push(h);
             }
         }
-        return new ie(s, o);
+        return new ce(s, o);
     }(t._query, t.firestore._databaseId, i, e, n, r);
 }
 
-function hr(t, e, n) {
+function vr(t, e, n) {
     if ("string" == typeof (n = p(n))) {
         if ("" === n) throw new M(V, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!fe(e) && -1 !== n.indexOf("/")) throw new M(V, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '" + n + "' contains a '/' character.");
+        if (!me(e) && -1 !== n.indexOf("/")) throw new M(V, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '" + n + "' contains a '/' character.");
         var r = e.path.child(Z.fromString(n));
         if (!nt.isDocumentKey(r)) throw new M(V, "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 xt(t, new nt(r));
+        return Gt(t, new nt(r));
     }
-    if (n instanceof an) return xt(t, n._key);
+    if (n instanceof fn) return Gt(t, n._key);
     throw new M(V, "Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: " + at(n) + ".");
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function pr(t, e) {
+ */ function gr(t, e) {
     if (!Array.isArray(t) || 0 === t.length) throw new M(V, "Invalid Query. A non-empty array is required for '" + e.toString() + "' filters.");
     if (t.length > 10) throw new M(V, "Invalid Query. '" + e.toString() + "' filters support a maximum of 10 elements in the value array.");
 }
 
-function dr(t, e, n) {
+function wr(t, e, n) {
     if (!n.isEqual(e)) throw new M(V, "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.");
 }
 
@@ -4600,28 +4990,28 @@ function dr(t, e, n) {
  * because we want to provide the user with a more specific error message if
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
- */ function mr(t, e, n) {
+ */ function br(t, e, n) {
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     return t ? n && (n.merge || n.mergeFields) ? t.toFirestore(e, n) : t.toFirestore(e) : e;
 }
 
-var yr = /** @class */ function(e) {
+var _r = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).firestore = t, n;
     }
     return t(n, e), n.prototype.convertBytes = function(t) {
-        return new yn(t);
+        return new _n(t);
     }, n.prototype.convertReference = function(t) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new an(this.firestore, /* converter= */ null, e);
+        return new fn(this.firestore, /* converter= */ null, e);
     }, n;
 }(/** @class */ function() {
     function t() {}
     return t.prototype.convertValue = function(t, e) {
-        switch (void 0 === e && (e = "none"), Ot(t)) {
+        switch (void 0 === e && (e = "none"), jt(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -4629,7 +5019,7 @@ var yr = /** @class */ function(e) {
             return t.booleanValue;
 
           case 2 /* NumberValue */ :
-            return Vt(t.integerValue || t.doubleValue);
+            return Ot(t.integerValue || t.doubleValue);
 
           case 3 /* TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -4641,7 +5031,7 @@ var yr = /** @class */ function(e) {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(Dt(t.bytesValue));
+            return this.convertBytes(qt(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -4656,15 +5046,15 @@ var yr = /** @class */ function(e) {
             return this.convertObject(t.mapValue, e);
 
           default:
-            throw S();
+            throw E();
         }
     }, t.prototype.convertObject = function(t, e) {
         var n = this, r = {};
-        return St(t.fields, (function(t, i) {
+        return Et(t.fields, (function(t, i) {
             r[t] = n.convertValue(i, e);
         })), r;
     }, t.prototype.convertGeoPoint = function(t) {
-        return new gn(Vt(t.latitude), Vt(t.longitude));
+        return new En(Ot(t.latitude), Ot(t.longitude));
     }, t.prototype.convertArray = function(t, e) {
         var n = this;
         return (t.values || []).map((function(t) {
@@ -4673,21 +5063,21 @@ var yr = /** @class */ function(e) {
     }, t.prototype.convertServerTimestamp = function(t, e) {
         switch (e) {
           case "previous":
-            var n = Nt(t);
+            var n = xt(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(qt(t));
+            return this.convertTimestamp(Ct(t));
 
           default:
             return null;
         }
     }, t.prototype.convertTimestamp = function(t) {
-        var e = kt(t);
+        var e = Ft(t);
         return new bt(e.seconds, e.nanos);
     }, t.prototype.convertDocumentKey = function(t, e) {
         var n = Z.fromString(t);
-        E(ze(n));
+        S(Ye(n));
         var r = new X(n.get(1), n.get(3)), i = new nt(n.popFirst(5));
         return r.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
@@ -4708,12 +5098,12 @@ var yr = /** @class */ function(e) {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function vr(t) {
-    var e = Je((t = st(t, an)).firestore), n = new yr(t.firestore);
-    return Ye(e, [ t._key ]).then((function(e) {
-        E(1 === e.length);
+ */ function Tr(t) {
+    var e = rn((t = st(t, fn)).firestore), n = new _r(t.firestore);
+    return tn(e, [ t._key ]).then((function(e) {
+        S(1 === e.length);
         var r = e[0];
-        return new Qn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new $n(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -4728,35 +5118,35 @@ var yr = /** @class */ function(e) {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function gr(t) {
+ */ function Er(t) {
     !function(t) {
-        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new M(L, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = st(t, sn))._query);
-    var e = Je(t.firestore), n = new yr(t.firestore);
-    return $e(e, t._query).then((function(e) {
+        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new M(C, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = st(t, hn))._query);
+    var e = rn(t.firestore), n = new _r(t.firestore);
+    return en(e, t._query).then((function(e) {
         var r = e.map((function(e) {
-            return new Kn(t.firestore, n, e.key, e, t.converter);
+            return new Xn(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 Hn(t, r);
+        r.reverse(), new Jn(t, r);
     }));
 }
 
-function wr(t, e, n) {
-    var r = mr((t = st(t, an)).converter, e, n), i = In(An(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return We(Je(t.firestore), [ i.toMutation(t._key, _e.none()) ]);
+function Sr(t, e, n) {
+    var r = br((t = st(t, fn)).converter, e, n), i = Nn(Pn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return Ze(rn(t.firestore), [ i.toMutation(t._key, Ie.none()) ]);
 }
 
-function br(t, e, n) {
+function kr(t, e, n) {
     for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-    var o, a = An((t = st(t, an)).firestore);
+    var o, a = Pn((t = st(t, fn)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-        return o = "string" == typeof (e = p(e)) || e instanceof dn ? On(a, "updateDoc", t._key, e, n, r) : Fn(a, "updateDoc", t._key, e), 
-    We(Je(t.firestore), [ o.toMutation(t._key, _e.exists(!0)) ]);
+        return o = "string" == typeof (e = p(e)) || e instanceof wn ? jn(a, "updateDoc", t._key, e, n, r) : Ln(a, "updateDoc", t._key, e), 
+    Ze(rn(t.firestore), [ o.toMutation(t._key, Ie.exists(!0)) ]);
 }
 
 /**
@@ -4770,8 +5160,8 @@ function br(t, e, n) {
  * @param reference - A reference to the document to delete.
  * @returns A `Promise` resolved once the document has been successfully
  * deleted from the backend.
- */ function _r(t) {
-    return We(Je((t = st(t, an)).firestore), [ new Ae(t._key, _e.none()) ]);
+ */ function Ir(t) {
+    return Ze(rn((t = st(t, fn)).firestore), [ new Pe(t._key, Ie.none()) ]);
 }
 
 /**
@@ -4788,9 +5178,9 @@ function br(t, e, n) {
  * @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 Tr(t, e) {
-    var n = fn(t = st(t, un)), r = mr(t.converter, e), i = In(An(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return We(Je(t.firestore), [ i.toMutation(n._key, _e.exists(!1)) ]).then((function() {
+ */ function Ar(t, e) {
+    var n = mn(t = st(t, pn)), r = br(t.converter, e), i = Nn(Pn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return Ze(rn(t.firestore), [ i.toMutation(n._key, Ie.exists(!1)) ]).then((function() {
         return n;
     }));
 }
@@ -4814,15 +5204,15 @@ function br(t, e, n) {
 /**
  * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or
  * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.
- */ function Sr() {
-    return new kn("deleteField");
+ */ function Vr() {
+    return new Fn("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 Er() {
-    return new Dn("serverTimestamp");
+ */ function Dr() {
+    return new qn("serverTimestamp");
 }
 
 /**
@@ -4836,11 +5226,11 @@ function br(t, e, n) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function Ar() {
+ */ function Pr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // 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 Pn("arrayUnion", t);
+        return new Rn("arrayUnion", t);
 }
 
 /**
@@ -4853,11 +5243,11 @@ function br(t, e, n) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Ir() {
+ */ function Nr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // 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 Nn("arrayRemove", t);
+        return new xn("arrayRemove", t);
 }
 
 /**
@@ -4878,8 +5268,8 @@ function br(t, e, n) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function kr(t) {
-    return new qn("increment", t);
+ */ function Fr(t) {
+    return new Cn("increment", t);
 }
 
 /**
@@ -4905,24 +5295,24 @@ function br(t, e, n) {
  * 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.
- */ var Vr = /** @class */ function() {
+ */ var Or = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = An(t);
+        this._dataReader = Pn(t);
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = Dr(t, this._firestore), i = mr(r.converter, e, n), o = In(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
-        return this._mutations.push(o.toMutation(r._key, _e.none())), this;
+        var r = qr(t, this._firestore), i = br(r.converter, e, n), o = Nn(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
+        return this._mutations.push(o.toMutation(r._key, Ie.none())), this;
     }, t.prototype.update = function(t, e, n) {
         for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
         this._verifyNotCommitted();
-        var o, a = Dr(t, this._firestore);
+        var o, a = qr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = p(e)) || e instanceof dn ? On(this._dataReader, "WriteBatch.update", a._key, e, n, r) : Fn(this._dataReader, "WriteBatch.update", a._key, e), 
-        this._mutations.push(o.toMutation(a._key, _e.exists(!0))), this;
+                return o = "string" == typeof (e = p(e)) || e instanceof wn ? jn(this._dataReader, "WriteBatch.update", a._key, e, n, r) : Ln(this._dataReader, "WriteBatch.update", a._key, e), 
+        this._mutations.push(o.toMutation(a._key, Ie.exists(!0))), this;
     }, 
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -4932,8 +5322,8 @@ function br(t, e, n) {
      */
     t.prototype.delete = function(t) {
         this._verifyNotCommitted();
-        var e = Dr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Ae(e._key, _e.none())), this;
+        var e = qr(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Pe(e._key, Ie.none())), this;
     }, 
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -4950,11 +5340,11 @@ function br(t, e, n) {
     t.prototype.commit = function() {
         return this._verifyNotCommitted(), this._committed = !0, this._mutations.length > 0 ? this._commitHandler(this._mutations) : Promise.resolve();
     }, t.prototype._verifyNotCommitted = function() {
-        if (this._committed) throw new M(O, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new M(q, "A write batch can no longer be used after commit() has been called.");
     }, t;
 }();
 
-function Dr(t, e) {
+function qr(t, e) {
     if ((t = p(t)).firestore !== e) throw new M(V, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -4971,10 +5361,10 @@ function Dr(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Pr(t) {
-    var e = Je(t = st(t, tn));
-    return new Vr(t, (function(t) {
-        return We(e, t);
+ */ function Rr(t) {
+    var e = rn(t = st(t, an));
+    return new Or(t, (function(t) {
+        return Ze(e, t);
     }));
 }
 
@@ -4997,7 +5387,7 @@ function Dr(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ var Nr = /** @class */ function() {
+ */ var xr = /** @class */ function() {
     function t(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5022,7 +5412,7 @@ function Dr(t, e) {
                 switch (n.label) {
                   case 0:
                     if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new M(V, "Firestore transactions require all reads to be executed before all writes.");
-                    return [ 4 /*yield*/ , Ye(this.datastore, t) ];
+                    return [ 4 /*yield*/ , tn(this.datastore, t) ];
 
                   case 1:
                     return [ 2 /*return*/ , ((e = n.sent()).forEach((function(t) {
@@ -5041,7 +5431,7 @@ function Dr(t, e) {
         }
         this.writtenDocs.add(t.toString());
     }, t.prototype.delete = function(t) {
-        this.write(new Ae(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Pe(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }, t.prototype.commit = function() {
         return e(this, void 0, void 0, (function() {
             var t, e = this;
@@ -5058,8 +5448,8 @@ function Dr(t, e) {
                     // a `verify` operation.
                     t.forEach((function(t, n) {
                         var r = nt.fromPath(n);
-                        e.mutations.push(new Ie(r, e.precondition(r)));
-                    })), [ 4 /*yield*/ , We(this.datastore, this.mutations) ];
+                        e.mutations.push(new Ne(r, e.precondition(r)));
+                    })), [ 4 /*yield*/ , Ze(this.datastore, this.mutations) ];
 
                   case 1:
                     // For each mutation, note that the doc was written.
@@ -5070,7 +5460,7 @@ function Dr(t, e) {
     }, t.prototype.recordVersion = function(t) {
         var e;
         if (t.isFoundDocument()) e = t.version; else {
-            if (!t.isNoDocument()) throw S();
+            if (!t.isNoDocument()) throw E();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
                         e = _t.min();
         }
@@ -5078,7 +5468,7 @@ function Dr(t, e) {
         if (n) {
             if (!e.isEqual(n)) 
             // This transaction will fail no matter what.
-            throw new M(C, "Document version changed between two reads.");
+            throw new M(R, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }, 
     /**
@@ -5087,7 +5477,7 @@ function Dr(t, e) {
      */
     t.prototype.precondition = function(t) {
         var e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? _e.updateTime(e) : _e.none();
+        return !this.writtenDocs.has(t.toString()) && e ? Ie.updateTime(e) : Ie.none();
     }, 
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5109,31 +5499,31 @@ function Dr(t, e) {
             // transaction.
             throw new M(V, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return _e.updateTime(e);
+                        return Ie.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-                return _e.exists(!0);
+                return Ie.exists(!0);
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), qr = {
+}(), Cr = {
     maxAttempts: 5
-}, Fr = /** @class */ function() {
+}, Lr = /** @class */ function() {
     function t(t, e, n, r, i) {
         this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
-        this.deferred = i, this.Tt = n.maxAttempts, this.At = new Ke(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
+        this.deferred = i, this.Tt = n.maxAttempts, this.It = new Xe(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.run = function() {
-        this.Tt -= 1, this.It();
-    }, t.prototype.It = function() {
+        this.Tt -= 1, this.At();
+    }, t.prototype.At = function() {
         var t = this;
-        this.At.W((function() {
+        this.It.W((function() {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new Nr(this.datastore), (e = this.Rt(t)) && e.then((function(e) {
+                    return t = new xr(this.datastore), (e = this.Rt(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
@@ -5159,7 +5549,7 @@ function Dr(t, e) {
     }, t.prototype.Pt = function(t) {
         var e = this;
         this.Tt > 0 && this.Vt(t) ? (this.Tt -= 1, this.asyncQueue.enqueueAndForget((function() {
-            return e.It(), Promise.resolve();
+            return e.At(), Promise.resolve();
         }))) : this.deferred.reject(t);
     }, t.prototype.Vt = function(t) {
         if ("FirebaseError" === t.name) {
@@ -5176,30 +5566,30 @@ function Dr(t, e) {
             function(t) {
                 switch (t) {
                   default:
-                    return S();
+                    return E();
 
                   case I:
-                  case k:
+                  case A:
                   case D:
-                  case F:
-                  case R:
-                  case x:
+                  case O:
+                  case L:
+                  case j:
  // Unauthenticated means something went wrong with our token and we need
                     // to retry with new credentials which will happen automatically.
-                                      case q:
+                                      case F:
                     return !1;
 
                   case V:
                   case P:
                   case "already-exists":
                   case N:
-                  case O:
+                  case q:
  // 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 C:
-                  case j:
-                  case L:
+                                      case R:
+                  case x:
+                  case C:
                   case "data-loss":
                     return !0;
                 }
@@ -5241,7 +5631,7 @@ function Dr(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** The Platform's 'document' implementation or null if not available. */ function Or() {
+/** The Platform's 'document' implementation or null if not available. */ function 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;
@@ -5273,7 +5663,7 @@ function Dr(t, e) {
  * Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type
  * in newer versions of TypeScript defines `finally`, which is not available in
  * IE.
- */ var Cr = /** @class */ function() {
+ */ var Mr = /** @class */ function() {
     function t(t, e, n, r, i) {
         this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = r, this.removalCallback = i, 
         this.deferred = new U, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
@@ -5337,40 +5727,40 @@ function Dr(t, e) {
         null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle), 
         this.timerHandle = null);
     }, t;
-}(), jr = /** @class */ function() {
+}(), Ur = /** @class */ function() {
     function t() {
         var t = this;
         // 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 Ke(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new Xe(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 = function() {
-            var e = Or();
-            e && w("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.At.H();
+        this.kt = function() {
+            var e = jr();
+            e && w("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.It.Y();
         };
-        var e = Or();
-        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Ct);
+        var e = jr();
+        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.kt);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
         get: function() {
@@ -5387,25 +5777,25 @@ function Dr(t, e) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
         this.enqueue(t);
     }, t.prototype.enqueueAndForgetEvenWhileRestricted = function(t) {
-        this.Lt(), 
+        this.Ct(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.Ut(t);
+        this.Lt(t);
     }, t.prototype.enterRestrictedMode = function(t) {
         if (!this.$t) {
             this.$t = !0, this.qt = t || !1;
-            var e = Or();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ct);
+            var e = jr();
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.kt);
         }
     }, t.prototype.enqueue = function(t) {
         var e = this;
-        if (this.Lt(), this.$t) 
+        if (this.Ct(), this.$t) 
         // Return a Promise which never resolves.
         return new Promise((function() {}));
         // 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.
                 var n = new U;
-        return this.Ut((function() {
+        return this.Lt((function() {
             return e.$t && e.qt ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
         })).then((function() {
             return n.promise;
@@ -5413,27 +5803,27 @@ function Dr(t, e) {
     }, t.prototype.enqueueRetryable = function(t) {
         var e = this;
         this.enqueueAndForget((function() {
-            return e.Nt.push(t), e.kt();
+            return e.Dt.push(t), e.Mt();
         }));
     }, 
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
      */
-    t.prototype.kt = function() {
+    t.prototype.Mt = function() {
         return e(this, void 0, void 0, (function() {
             var t, e = this;
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    if (0 === this.Nt.length) return [ 3 /*break*/ , 5 ];
+                    if (0 === this.Dt.length) return [ 3 /*break*/ , 5 ];
                     n.label = 1;
 
                   case 1:
-                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.Nt[0]() ];
+                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.Dt[0]() ];
 
                   case 2:
-                    return n.sent(), this.Nt.shift(), this.At.reset(), [ 3 /*break*/ , 4 ];
+                    return n.sent(), this.Dt.shift(), this.It.reset(), [ 3 /*break*/ , 4 ];
 
                   case 3:
                     if (t = n.sent(), "IndexedDbTransactionError" !== t.name) throw t;
@@ -5442,7 +5832,7 @@ function Dr(t, e) {
                     [ 3 /*break*/ , 4 ];
 
                   case 4:
-                    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
@@ -5453,8 +5843,8 @@ function Dr(t, e) {
                     // 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((function() {
-                        return e.kt();
+                    this.It.W((function() {
+                        return e.Mt();
                     })), n.label = 5;
 
                   case 5:
@@ -5462,10 +5852,10 @@ function Dr(t, e) {
                 }
             }));
         }));
-    }, t.prototype.Ut = function(t) {
-        var e = this, n = this.Dt.then((function() {
-            return e.Ft = !0, t().catch((function(t) {
-                e.xt = t, e.Ft = !1;
+    }, t.prototype.Lt = function(t) {
+        var e = this, n = this.Nt.then((function() {
+            return e.St = !0, t().catch((function(t) {
+                e.Ft = t, e.St = !1;
                 var n = 
                 /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -5482,39 +5872,39 @@ function Dr(t, e) {
                 // and return the rejected Promise.
                                 throw b("INTERNAL UNHANDLED ERROR: ", n), t;
             })).then((function(t) {
-                return e.Ft = !1, t;
+                return e.St = !1, t;
             }));
         }));
-        return this.Dt = n, n;
+        return this.Nt = n, n;
     }, t.prototype.enqueueAfterDelay = function(t, e, n) {
         var r = this;
-        this.Lt(), 
+        this.Ct(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ot.indexOf(t) > -1 && (e = 0);
-        var i = Cr.createAndSchedule(this, t, e, n, (function(t) {
-            return r.jt(t);
+        var i = Mr.createAndSchedule(this, t, e, n, (function(t) {
+            return r.Ut(t);
         }));
-        return this.St.push(i), i;
-    }, t.prototype.Lt = function() {
-        this.xt && S();
+        return this.xt.push(i), i;
+    }, t.prototype.Ct = function() {
+        this.Ft && E();
     }, t.prototype.verifyOperationInProgress = function() {}, 
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
      */
-    t.prototype.Mt = function() {
+    t.prototype.jt = function() {
         return e(this, void 0, void 0, (function() {
             var t;
             return n(this, (function(e) {
                 switch (e.label) {
                   case 0:
-                    return [ 4 /*yield*/ , t = this.Dt ];
+                    return [ 4 /*yield*/ , t = this.Nt ];
 
                   case 1:
                     e.sent(), e.label = 2;
 
                   case 2:
-                    if (t !== this.Dt) return [ 3 /*break*/ , 0 ];
+                    if (t !== this.Nt) return [ 3 /*break*/ , 0 ];
                     e.label = 3;
 
                   case 3:
@@ -5528,7 +5918,7 @@ function Dr(t, e) {
      * exists.
      */
     t.prototype.Bt = function(t) {
-        for (var e = 0, n = this.St; e < n.length; e++) {
+        for (var e = 0, n = this.xt; e < n.length; e++) {
             if (n[e].timerId === t) return !0;
         }
         return !1;
@@ -5543,16 +5933,16 @@ function Dr(t, e) {
     t.prototype.zt = function(t) {
         var e = this;
         // Note that draining may generate more delayed ops, so we do that first.
-                return this.Mt().then((function() {
+                return this.jt().then((function() {
             // Run ops in the same order they'd run if they ran naturally.
-            e.St.sort((function(t, e) {
+            e.xt.sort((function(t, e) {
                 return t.targetTimeMs - e.targetTimeMs;
             }));
-            for (var n = 0, r = e.St; n < r.length; n++) {
+            for (var n = 0, r = e.xt; n < r.length; n++) {
                 var i = r[n];
                 if (i.skipDelay(), "all" /* All */ !== t && i.timerId === t) break;
             }
-            return e.Mt();
+            return e.jt();
         }));
     }, 
     /**
@@ -5561,15 +5951,15 @@ function Dr(t, e) {
     t.prototype.Gt = function(t) {
         this.Ot.push(t);
     }, 
-    /** Called once a DelayedOperation is run or canceled. */ t.prototype.jt = function(t) {
+    /** Called once a DelayedOperation is run or canceled. */ t.prototype.Ut = function(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        var e = this.St.indexOf(t);
-        this.St.splice(e, 1);
+        var e = this.xt.indexOf(t);
+        this.xt.splice(e, 1);
     }, t;
-}(), Lr = /** @class */ function() {
+}(), Br = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = An(t)
+        this._firestore = t, this._transaction = e, this._dataReader = Pn(t)
         /**
      * Reads the document referenced by the provided {@link DocumentReference}.
      *
@@ -5578,23 +5968,23 @@ function Dr(t, e) {
      */;
     }
     return t.prototype.get = function(t) {
-        var e = this, n = Dr(t, this._firestore), r = new yr(this._firestore);
+        var e = this, n = qr(t, this._firestore), r = new _r(this._firestore);
         return this._transaction.lookup([ n._key ]).then((function(t) {
-            if (!t || 1 !== t.length) return S();
+            if (!t || 1 !== t.length) return E();
             var i = t[0];
-            if (i.isFoundDocument()) return new Qn(e._firestore, r, i.key, i, n.converter);
-            if (i.isNoDocument()) return new Qn(e._firestore, r, n._key, null, n.converter);
-            throw S();
+            if (i.isFoundDocument()) return new $n(e._firestore, r, i.key, i, n.converter);
+            if (i.isNoDocument()) return new $n(e._firestore, r, n._key, null, n.converter);
+            throw E();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = Dr(t, this._firestore), i = mr(r.converter, e, n), o = In(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
+        var r = qr(t, this._firestore), i = br(r.converter, e, n), o = Nn(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
         return this._transaction.set(r._key, o), this;
     }, t.prototype.update = function(t, e, n) {
         for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-        var o, a = Dr(t, this._firestore);
+        var o, a = qr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = p(e)) || e instanceof dn ? On(this._dataReader, "Transaction.update", a._key, e, n, r) : Fn(this._dataReader, "Transaction.update", a._key, e), 
+                return o = "string" == typeof (e = p(e)) || e instanceof wn ? jn(this._dataReader, "Transaction.update", a._key, e, n, r) : Ln(this._dataReader, "Transaction.update", a._key, e), 
         this._transaction.update(a._key, o), this;
     }, 
     /**
@@ -5604,7 +5994,7 @@ function Dr(t, e) {
      * @returns This `Transaction` instance. Used for chaining method calls.
      */
     t.prototype.delete = function(t) {
-        var e = Dr(t, this._firestore);
+        var e = qr(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }, t;
 }();
@@ -5637,19 +6027,21 @@ function Dr(t, e) {
  * 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 Rr(t, e, n) {
-    var r = Je(t = st(t, tn)), i = Object.assign(Object.assign({}, qr), n);
+function zr(t, e, n) {
+    var r = rn(t = st(t, an)), i = Object.assign(Object.assign({}, Cr), n);
     !function(t) {
         if (t.maxAttempts < 1) throw new M(V, "Max attempts must be at least 1");
     }(i);
     var o = new U;
-    return new Fr(new jr, r, i, (function(n) {
-        return e(new Lr(t, n));
+    return new Lr(new Ur, r, i, (function(n) {
+        return e(new Br(t, n));
     }), o).run(), o.promise
     /**
  * Firestore Lite
@@ -5661,12 +6053,12 @@ function Rr(t, e, n) {
  */;
 }
 
-y = i + "_lite", o(new c("firestore/lite", (function(t, e) {
-    var n = e.options, r = t.getProvider("app").getImmediate(), i = new tn(r, new Q(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
+m = i + "_lite", o(new c("firestore/lite", (function(t, e) {
+    var n = e.options, r = t.getProvider("app").getImmediate(), i = new an(r, new K(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
     return n && i._setSettings(n), i;
 }), "PUBLIC")), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-a("firestore-lite", "3.4.9", ""), a("firestore-lite", "3.4.9", "esm5");
+a("firestore-lite", "3.4.10-canary.ebc17e27f", ""), a("firestore-lite", "3.4.10-canary.ebc17e27f", "esm5");
 
-export { yn as Bytes, un as CollectionReference, an as DocumentReference, Qn as DocumentSnapshot, dn as FieldPath, vn as FieldValue, tn as Firestore, M as FirestoreError, gn as GeoPoint, sn as Query, $n as QueryConstraint, Kn as QueryDocumentSnapshot, Hn as QuerySnapshot, bt as Timestamp, Lr as Transaction, Vr as WriteBatch, Tr as addDoc, Ir as arrayRemove, Ar as arrayUnion, cn as collection, ln as collectionGroup, rn as connectFirestoreEmulator, _r as deleteDoc, Sr as deleteField, fn as doc, mn as documentId, lr as endAt, cr as endBefore, vr as getDoc, gr as getDocs, nn as getFirestore, kr as increment, en as initializeFirestore, rr as limit, ir as limitToLast, er as orderBy, Xn as query, pn as queryEqual, hn as refEqual, Rr as runTransaction, Er as serverTimestamp, wr as setDoc, g as setLogLevel, Wn as snapshotEqual, sr as startAfter, ar as startAt, on as terminate, br as updateDoc, Zn as where, Pr as writeBatch };
+export { _n as Bytes, pn as CollectionReference, fn as DocumentReference, $n as DocumentSnapshot, wn as FieldPath, Tn as FieldValue, an as Firestore, M as FirestoreError, En as GeoPoint, hn as Query, er as QueryConstraint, Xn as QueryDocumentSnapshot, Jn as QuerySnapshot, bt as Timestamp, Br as Transaction, Or as WriteBatch, Ar as addDoc, Nr as arrayRemove, Pr as arrayUnion, dn as collection, yn as collectionGroup, cn as connectFirestoreEmulator, Ir as deleteDoc, Vr as deleteField, mn as doc, bn as documentId, yr as endAt, dr as endBefore, Tr as getDoc, Er as getDocs, un as getFirestore, Fr as increment, sn as initializeFirestore, ur as limit, cr as limitToLast, ar as orderBy, nr as query, gn as queryEqual, vn as refEqual, zr as runTransaction, Dr as serverTimestamp, Sr as setDoc, g as setLogLevel, Zn as snapshotEqual, hr as startAfter, fr as startAt, ln as terminate, kr as updateDoc, ir as where, Rr as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map