@firebase/firestore 3.4.1 → 3.4.2-202205224240

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

@@ -6,7 +6,7 @@ import { Component as c } from "@firebase/component";
 
 import { Logger as l, LogLevel as f } from "@firebase/logger";
 
-import { getModularInstance as h, createMockUserToken as p } from "@firebase/util";
+import { FirebaseError as h, getModularInstance as p, createMockUserToken as d } from "@firebase/util";
 
 /**
  * @license
@@ -27,7 +27,7 @@ import { getModularInstance as h, createMockUserToken as p } from "@firebase/uti
 /**
  * Simple wrapper around a nullable UID. Mostly exists to make code more
  * readable.
- */ var d = /** @class */ function() {
+ */ var m = /** @class */ function() {
     function t(t) {
         this.uid = t;
     }
@@ -45,11 +45,11 @@ import { getModularInstance as h, createMockUserToken as p } from "@firebase/uti
     }, t;
 }();
 
-/** A user with a null UID. */ d.UNAUTHENTICATED = new d(null), 
+/** A user with a null UID. */ m.UNAUTHENTICATED = new m(null), 
 // TODO(mikelehen): Look into getting a proper uid-equivalent for
 // non-FirebaseAuth providers.
-d.GOOGLE_CREDENTIALS = new d("google-credentials-uid"), d.FIRST_PARTY = new d("first-party-uid"), 
-d.MOCK_USER = new d("mock-user");
+m.GOOGLE_CREDENTIALS = new m("google-credentials-uid"), m.FIRST_PARTY = new m("first-party-uid"), 
+m.MOCK_USER = new m("mock-user");
 
 /**
  * @license
@@ -67,7 +67,7 @@ d.MOCK_USER = new d("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var m = "9.6.1", y = new l("@firebase/firestore");
+var y = "9.6.2-202205224240", v = new l("@firebase/firestore");
 
 /**
  * @license
@@ -98,39 +98,39 @@ var m = "9.6.1", y = new l("@firebase/firestore");
  *     <li><code>`silent` to turn off logging.</li>
  *   </ul>
  */
-function v(t) {
-    y.setLogLevel(t);
+function g(t) {
+    v.setLogLevel(t);
 }
 
-function g(t) {
+function w(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (y.logLevel <= f.DEBUG) {
-        var i = e.map(_);
-        y.debug.apply(y, r([ "Firestore (" + m + "): " + t ], i));
+    if (v.logLevel <= f.DEBUG) {
+        var i = e.map(T);
+        v.debug.apply(v, r([ "Firestore (" + y + "): " + t ], i));
     }
 }
 
-function w(t) {
+function b(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (y.logLevel <= f.ERROR) {
-        var i = e.map(_);
-        y.error.apply(y, r([ "Firestore (" + m + "): " + t ], i));
+    if (v.logLevel <= f.ERROR) {
+        var i = e.map(T);
+        v.error.apply(v, r([ "Firestore (" + y + "): " + t ], i));
     }
 }
 
 /**
  * @internal
- */ function b(t) {
+ */ function _(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (y.logLevel <= f.WARN) {
-        var i = e.map(_);
-        y.warn.apply(y, r([ "Firestore (" + m + "): " + t ], i));
+    if (v.logLevel <= f.WARN) {
+        var i = e.map(T);
+        v.warn.apply(v, r([ "Firestore (" + y + "): " + t ], i));
     }
 }
 
 /**
  * Converts an additional log parameter to a string representation.
- */ function _(t) {
+ */ function T(t) {
     if ("string" == typeof t) return t;
     try {
         return e = t, JSON.stringify(e);
@@ -180,15 +180,15 @@ function w(t) {
  * Returns `never` and can be used in expressions:
  * @example
  * let futureVar = fail('not implemented yet');
- */ function T(t) {
+ */ function S(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 (" + m + ") INTERNAL ASSERTION FAILED: " + t;
+        var e = "FIRESTORE (" + y + ") INTERNAL ASSERTION FAILED: " + t;
     // NOTE: We don't use FirestoreError here because these are internal failures
     // that cannot be handled by the user. (Also it would create a circular
     // dependency between the error and assert modules which doesn't work.)
-        throw w(e), new Error(e)
+        throw b(e), new Error(e)
     /**
  * Fails if the given assertion condition is false, throwing an Error with the
  * given message if it did.
@@ -197,14 +197,14 @@ function w(t) {
  */;
 }
 
-function S(t, e) {
-    t || T();
+function E(t, e) {
+    t || S();
 }
 
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function E(t, 
+ */ function I(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     return t;
@@ -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", A = "unknown", k = "invalid-argument", V = "deadline-exceeded", D = "not-found", P = "permission-denied", F = "unauthenticated", N = "resource-exhausted", q = "failed-precondition", O = "aborted", C = "out-of-range", j = "unimplemented", L = "internal", R = "unavailable", M = /** @class */ function(e) {
+ */ var A = "cancelled", k = "unknown", V = "invalid-argument", D = "deadline-exceeded", P = "not-found", F = "permission-denied", N = "unauthenticated", q = "resource-exhausted", O = "failed-precondition", C = "aborted", j = "out-of-range", L = "unimplemented", R = "internal", M = "unavailable", U = /** @class */ function(e) {
     /** @hideconstructor */
     function n(
     /**
@@ -237,9 +237,7 @@ e) {
      */
     n) {
         var r = this;
-        return (r = e.call(this, n) || this).code = t, r.message = n, 
-        /** The custom name for all FirestoreErrors. */
-        r.name = "FirebaseError", 
+        return (r = e.call(this, t, n) || this).code = t, r.message = n, 
         // HACK: We write a toString property directly because Error is not a real
         // class and so inheritance does not work correctly. We could alternatively
         // do the same "back-door inheritance" trick that FirebaseError does.
@@ -248,24 +246,24 @@ e) {
         }, r;
     }
     return t(n, e), n;
-}(Error), U = function() {
+}(h), x = function() {
     var t = this;
     this.promise = new Promise((function(e, n) {
         t.resolve = e, t.reject = n;
     }));
-}, x = function(t, e) {
+}, B = function(t, e) {
     this.user = e, this.type = "OAuth", this.headers = new Map, this.headers.set("Authorization", "Bearer " + t);
-}, B = /** @class */ function() {
+}, G = /** @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(d.UNAUTHENTICATED);
+            return e(m.UNAUTHENTICATED);
         }));
     }, t.prototype.shutdown = function() {}, t;
-}(), G = /** @class */ function() {
+}(), z = /** @class */ function() {
     function t(t) {
         this.token = t, 
         /**
@@ -287,7 +285,7 @@ e) {
     }, t.prototype.shutdown = function() {
         this.changeListener = null;
     }, t;
-}(), z = /** @class */ function() {
+}(), Q = /** @class */ function() {
     function t(t) {
         var e = this;
         this.auth = null, t.onInit((function(t) {
@@ -297,30 +295,30 @@ e) {
     return t.prototype.getToken = function() {
         var t = this;
         return this.auth ? this.auth.getToken().then((function(e) {
-            return e ? (S("string" == typeof e.accessToken), new x(e.accessToken, new d(t.auth.getUid()))) : null;
+            return e ? (E("string" == typeof e.accessToken), new B(e.accessToken, new m(t.auth.getUid()))) : null;
         })) : Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
     t.prototype.shutdown = function() {}, t;
-}(), Q = function(t, e, n) {
-    this.type = "FirstParty", this.user = d.FIRST_PARTY, this.headers = new Map, this.headers.set("X-Goog-AuthUser", e);
+}(), K = function(t, e, n) {
+    this.type = "FirstParty", this.user = m.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);
-}, K = /** @class */ function() {
+}, H = /** @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 Q(this.t, this.i, this.o));
+        return Promise.resolve(new K(this.t, this.i, this.o));
     }, t.prototype.start = function(t, e) {
         // Fire with initial uid.
         t.enqueueRetryable((function() {
-            return e(d.FIRST_PARTY);
+            return e(m.FIRST_PARTY);
         }));
     }, t.prototype.shutdown = function() {}, t.prototype.invalidateToken = function() {}, 
     t;
-}(), H = function(t) {
+}(), W = function(t) {
     this.value = t, this.type = "AppCheck", this.headers = new Map, t && t.length > 0 && this.headers.set("x-firebase-appcheck", this.value);
-}, W = /** @class */ function() {
+}, Y = /** @class */ function() {
     function t(t) {
         var e = this;
         this.u = t, this.appCheck = null, t.onInit((function(t) {
@@ -329,11 +327,11 @@ e) {
     }
     return t.prototype.getToken = function() {
         return this.appCheck ? this.appCheck.getToken().then((function(t) {
-            return t ? (S("string" == typeof t.token), new H(t.token)) : null;
+            return t ? (E("string" == typeof t.token), new W(t.token)) : null;
         })) : Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
     t.prototype.shutdown = function() {}, t;
-}(), Y = 
+}(), $ = 
 /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -354,7 +352,7 @@ e) {
 function(t, e, n, r, i, o, a, s) {
     this.databaseId = t, this.appId = e, this.persistenceKey = n, this.host = r, this.ssl = i, 
     this.forceLongPolling = o, this.autoDetectLongPolling = a, this.useFetchStreams = s;
-}, $ = /** @class */ function() {
+}, X = /** @class */ function() {
     function t(t, e) {
         this.projectId = t, this.database = e || "(default)";
     }
@@ -367,9 +365,9 @@ function(t, e, n, r, i, o, a, s) {
     }), t.prototype.isEqual = function(e) {
         return e instanceof t && e.projectId === this.projectId && e.database === this.database;
     }, t;
-}(), X = /** @class */ function() {
+}(), J = /** @class */ function() {
     function t(t, e, n) {
-        void 0 === e ? e = 0 : e > t.length && T(), void 0 === n ? n = t.length - e : n > t.length - e && T(), 
+        void 0 === e ? e = 0 : e > t.length && S(), void 0 === n ? n = t.length - e : n > t.length - e && S(), 
         this.segments = t, this.offset = e, this.len = n;
     }
     return Object.defineProperty(t.prototype, "length", {
@@ -420,7 +418,7 @@ function(t, e, n, r, i, o, a, s) {
         }
         return t.length < e.length ? -1 : t.length > e.length ? 1 : 0;
     }, t;
-}(), J = /** @class */ function(e) {
+}(), Z = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -446,7 +444,7 @@ function(t, e, n, r, i, o, a, s) {
         // for legacy reasons and should not be used frequently).
                 for (var r = [], i = 0, o = t; i < o.length; i++) {
             var a = o[i];
-            if (a.indexOf("//") >= 0) throw new M(k, "Invalid segment (" + a + "). Paths must not contain // in them.");
+            if (a.indexOf("//") >= 0) throw new U(V, "Invalid segment (" + a + "). Paths must not contain // in them.");
             // Strip leading and traling slashed.
                         r.push.apply(r, a.split("/").filter((function(t) {
                 return t.length > 0;
@@ -456,7 +454,7 @@ function(t, e, n, r, i, o, a, s) {
     }, n.emptyPath = function() {
         return new n([]);
     }, n;
-}(X), Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/, tt = /** @class */ function(e) {
+}(J), tt = /^[_a-zA-Z][_a-zA-Z0-9]*$/, et = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -468,7 +466,7 @@ function(t, e, n, r, i, o, a, s) {
      * without escaping.
      */
     n.isValidIdentifier = function(t) {
-        return Z.test(t);
+        return tt.test(t);
     }, n.prototype.canonicalString = function() {
         return this.toArray().map((function(t) {
             return t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"), n.isValidIdentifier(t) || (t = "`" + t + "`"), 
@@ -501,39 +499,39 @@ function(t, e, n, r, i, o, a, s) {
      */
     n.fromServerFormat = function(t) {
         for (var e = [], r = "", i = 0, o = function() {
-            if (0 === r.length) throw new M(k, "Invalid field path (" + t + "). Paths must not be empty, begin with '.', end with '.', or contain '..'");
+            if (0 === r.length) throw new U(V, "Invalid field path (" + t + "). Paths must not be empty, begin with '.', end with '.', or contain '..'");
             e.push(r), r = "";
         }, a = !1; i < t.length; ) {
             var s = t[i];
             if ("\\" === s) {
-                if (i + 1 === t.length) throw new M(k, "Path has trailing escape character: " + t);
+                if (i + 1 === t.length) throw new U(V, "Path has trailing escape character: " + t);
                 var u = t[i + 1];
-                if ("\\" !== u && "." !== u && "`" !== u) throw new M(k, "Path has invalid escape sequence: " + t);
+                if ("\\" !== u && "." !== u && "`" !== u) throw new U(V, "Path has invalid escape sequence: " + t);
                 r += u, i += 2;
             } else "`" === s ? (a = !a, i++) : "." !== s || a ? (r += s, i++) : (o(), i++);
         }
-        if (o(), a) throw new M(k, "Unterminated ` in path: " + t);
+        if (o(), a) throw new U(V, "Unterminated ` in path: " + t);
         return new n(e);
     }, n.emptyPath = function() {
         return new n([]);
     }, n;
-}(X), et = /** @class */ function() {
+}(J), nt = /** @class */ function() {
     function t(t) {
         this.path = t;
     }
     return t.fromPath = function(e) {
-        return new t(J.fromString(e));
+        return new t(Z.fromString(e));
     }, t.fromName = function(e) {
-        return new t(J.fromString(e).popFirst(5));
+        return new t(Z.fromString(e).popFirst(5));
     }, 
     /** Returns true if the document is in the specified collectionId. */ t.prototype.hasCollectionId = function(t) {
         return this.path.length >= 2 && this.path.get(this.path.length - 2) === t;
     }, t.prototype.isEqual = function(t) {
-        return null !== t && 0 === J.comparator(this.path, t.path);
+        return null !== t && 0 === Z.comparator(this.path, t.path);
     }, t.prototype.toString = function() {
         return this.path.toString();
     }, t.comparator = function(t, e) {
-        return J.comparator(t.path, e.path);
+        return Z.comparator(t.path, e.path);
     }, t.isDocumentKey = function(t) {
         return t.length % 2 == 0;
     }, 
@@ -544,7 +542,7 @@ function(t, e, n, r, i, o, a, s) {
      * @returns A new instance of DocumentKey
      */
     t.fromSegments = function(e) {
-        return new t(new J(e.slice()));
+        return new t(new Z(e.slice()));
     }, t;
 }();
 
@@ -565,8 +563,8 @@ function(t, e, n, r, i, o, a, s) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function nt(t, e, n) {
-    if (!n) throw new M(k, "Function " + t + "() cannot be called with an empty " + e + ".");
+function rt(t, e, n) {
+    if (!n) throw new U(V, "Function " + t + "() cannot be called with an empty " + e + ".");
 }
 
 /**
@@ -576,22 +574,22 @@ function nt(t, e, n) {
 /**
  * Validates that `path` refers to a document (indicated by the fact it contains
  * an even numbers of segments).
- */ function rt(t) {
-    if (!et.isDocumentKey(t)) throw new M(k, "Invalid document reference. Document references must have an even number of segments, but " + t + " has " + t.length + ".");
+ */ function it(t) {
+    if (!nt.isDocumentKey(t)) throw new U(V, "Invalid document reference. Document references must have an even number of segments, but " + t + " has " + t.length + ".");
 }
 
 /**
  * Validates that `path` refers to a collection (indicated by the fact it
  * contains an odd numbers of segments).
- */ function it(t) {
-    if (et.isDocumentKey(t)) throw new M(k, "Invalid collection reference. Collection references must have an odd number of segments, but " + t + " has " + t.length + ".");
+ */ function ot(t) {
+    if (nt.isDocumentKey(t)) throw new U(V, "Invalid collection reference. Collection references must have an odd number of segments, but " + t + " has " + t.length + ".");
 }
 
 /**
  * Returns true if it's a non-null object without a custom prototype
  * (i.e. excludes Array, Date, etc.).
  */
-/** Returns a string describing the type / value of the provided input. */ function ot(t) {
+/** Returns a string describing the type / value of the provided input. */ function at(t) {
     if (void 0 === t) return "undefined";
     if (null === t) return "null";
     if ("string" == typeof t) return t.length > 20 && (t = t.substring(0, 20) + "..."), 
@@ -606,25 +604,25 @@ function nt(t, e, n) {
         }(t);
         return e ? "a custom " + e + " object" : "an object";
     }
-    return "function" == typeof t ? "a function" : T();
+    return "function" == typeof t ? "a function" : S();
 }
 
-function at(t, 
+function st(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     if ("_delegate" in t && (
     // Unwrap Compat types
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     t = t._delegate), !(t instanceof e)) {
-        if (e.name === t.constructor.name) throw new M(k, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
-        var n = ot(t);
-        throw new M(k, "Expected type '" + e.name + "', but it was: " + n);
+        if (e.name === t.constructor.name) throw new U(V, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
+        var n = at(t);
+        throw new U(V, "Expected type '" + e.name + "', but it was: " + n);
     }
     return t;
 }
 
-function st(t, e) {
-    if (e <= 0) throw new M(k, "Function " + t + "() requires a positive number, but it was: " + e + ".");
+function ut(t, e) {
+    if (e <= 0) throw new U(V, "Function " + t + "() requires a positive number, but it was: " + e + ".");
 }
 
 /**
@@ -645,11 +643,11 @@ function st(t, e) {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function ut(t) {
+ */ function ct(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function ct(t) {
+/** Returns whether the value represents -0. */ function lt(t) {
     // Detect if the value is -0.0. Based on polyfill from
     // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
     return 0 === t && 1 / t == -1 / 0;
@@ -674,7 +672,7 @@ function st(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ var lt, ft, ht = {
+ */ var ft, ht, pt = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery"
@@ -718,8 +716,8 @@ function st(t, e) {
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function pt(t) {
-    if (void 0 === t) return w("RPC_ERROR", "HTTP error has no status"), A;
+function dt(t) {
+    if (void 0 === t) return b("RPC_ERROR", "HTTP error has no status"), k;
     // 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.
@@ -732,62 +730,62 @@ function pt(t) {
 
       case 400:
         // Bad Request
-        return q;
+        return O;
 
         // Other possibilities based on the forward mapping
         // return Code.INVALID_ARGUMENT;
         // return Code.OUT_OF_RANGE;
               case 401:
         // Unauthorized
-        return F;
+        return N;
 
       case 403:
         // Forbidden
-        return P;
+        return F;
 
       case 404:
         // Not Found
-        return D;
+        return P;
 
       case 409:
         // Conflict
-        return O;
+        return C;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return C;
+        return j;
 
       case 429:
         // Too Many Requests
-        return N;
+        return q;
 
       case 499:
         // Client Closed Request
-        return I;
+        return A;
 
       case 500:
         // Internal Server Error
-        return A;
+        return k;
 
         // Other possibilities:
         // return Code.INTERNAL;
         // return Code.DATA_LOSS;
               case 501:
         // Unimplemented
-        return j;
+        return L;
 
       case 503:
         // Service Unavailable
-        return R;
+        return M;
 
       case 504:
         // Gateway Timeout
-        return V;
+        return D;
 
       default:
-        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? q : t >= 500 && t < 600 ? L : A;
+        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? O : t >= 500 && t < 600 ? R : k;
     }
 }
 
@@ -810,16 +808,16 @@ function pt(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (ft = lt || (lt = {}))[ft.OK = 0] = "OK", ft[ft.CANCELLED = 1] = "CANCELLED", 
-ft[ft.UNKNOWN = 2] = "UNKNOWN", ft[ft.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
-ft[ft.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", ft[ft.NOT_FOUND = 5] = "NOT_FOUND", 
-ft[ft.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", ft[ft.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
-ft[ft.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", ft[ft.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
-ft[ft.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", ft[ft.ABORTED = 10] = "ABORTED", 
-ft[ft.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", ft[ft.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
-ft[ft.INTERNAL = 13] = "INTERNAL", ft[ft.UNAVAILABLE = 14] = "UNAVAILABLE", ft[ft.DATA_LOSS = 15] = "DATA_LOSS";
-
-var dt = /** @class */ function(r) {
+ */ (ht = ft || (ft = {}))[ht.OK = 0] = "OK", ht[ht.CANCELLED = 1] = "CANCELLED", 
+ht[ht.UNKNOWN = 2] = "UNKNOWN", ht[ht.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+ht[ht.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", ht[ht.NOT_FOUND = 5] = "NOT_FOUND", 
+ht[ht.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", ht[ht.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+ht[ht.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", ht[ht.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+ht[ht.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", ht[ht.ABORTED = 10] = "ABORTED", 
+ht[ht.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", ht[ht.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+ht[ht.INTERNAL = 13] = "INTERNAL", ht[ht.UNAVAILABLE = 14] = "UNAVAILABLE", ht[ht.DATA_LOSS = 15] = "DATA_LOSS";
+
+var mt = /** @class */ function(r) {
     /**
      * @param databaseInfo - The connection info.
      * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.
@@ -853,10 +851,10 @@ var dt = /** @class */ function(r) {
                     return e = n.sent(), [ 3 /*break*/ , 4 ];
 
                   case 3:
-                    throw a = n.sent(), new M(pt(a.status), "Request failed with error: " + a.statusText);
+                    throw a = n.sent(), new U(dt(a.status), "Request failed with error: " + a.statusText);
 
                   case 4:
-                    if (!e.ok) throw new M(pt(e.status), "Request failed with error: " + e.statusText);
+                    if (!e.ok) throw new U(dt(e.status), "Request failed with error: " + e.statusText);
                     return [ 2 /*return*/ , e.json() ];
                 }
             }));
@@ -870,12 +868,12 @@ var dt = /** @class */ function(r) {
     }
     return t.prototype.m = function(t, e, n, r, i) {
         var o = this.p(t, e);
-        g("RestConnection", "Sending: ", o, n);
+        w("RestConnection", "Sending: ", o, n);
         var a = {};
         return this.g(a, r, i), this.v(t, o, a, n).then((function(t) {
-            return g("RestConnection", "Received: ", t), t;
+            return w("RestConnection", "Received: ", t), t;
         }), (function(e) {
-            throw b("RestConnection", t + " failed with error: ", e, "url: ", o, "request:", n), 
+            throw _("RestConnection", t + " failed with error: ", e, "url: ", o, "request:", n), 
             e;
         }));
     }, t.prototype.T = function(t, e, n, r, i) {
@@ -888,7 +886,7 @@ var dt = /** @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/" + m, 
+        t["X-Goog-Api-Client"] = "gl-js/ fire/" + y, 
         // 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
@@ -900,7 +898,7 @@ var dt = /** @class */ function(r) {
             return t[n] = e;
         }));
     }, t.prototype.p = function(t, e) {
-        var n = ht[t];
+        var n = pt[t];
         return this.h + "/v1/" + e + ":" + n;
     }, t;
 }());
@@ -942,7 +940,7 @@ var dt = /** @class */ function(r) {
  * Generates `nBytes` of random bytes.
  *
  * If `nBytes < 0` , an error will be thrown.
- */ function mt(t) {
+ */ function yt(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
@@ -968,14 +966,14 @@ var dt = /** @class */ function(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 yt = /** @class */ function() {
+ */ var vt = /** @class */ function() {
     function t() {}
     return t.P = function() {
         for (
         // 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 = mt(40), i = 0; i < r.length; ++i) 
+        ; n.length < 20; ) for (var r = yt(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));
@@ -983,11 +981,11 @@ var dt = /** @class */ function(r) {
     }, t;
 }();
 
-function vt(t, e) {
+function gt(t, e) {
     return t < e ? -1 : t > e ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function gt(t, e, n) {
+/** Helper to compare arrays using isEqual(). */ function wt(t, e, n) {
     return t.length === e.length && t.every((function(t, r) {
         return n(t, e[r]);
     }));
@@ -1023,7 +1021,7 @@ function vt(t, e) {
  *
  * For examples and further specifications, refer to the
  * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
- */ var wt = /** @class */ function() {
+ */ var bt = /** @class */ function() {
     /**
      * Creates a new timestamp.
      *
@@ -1044,11 +1042,11 @@ function vt(t, e) {
      * The fractions of a second at nanosecond resolution.*
      */
     e) {
-        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new M(k, "Timestamp nanoseconds out of range: " + e);
-        if (e >= 1e9) throw new M(k, "Timestamp nanoseconds out of range: " + e);
-        if (t < -62135596800) throw new M(k, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new U(V, "Timestamp nanoseconds out of range: " + e);
+        if (e >= 1e9) throw new U(V, "Timestamp nanoseconds out of range: " + e);
+        if (t < -62135596800) throw new U(V, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new M(k, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new U(V, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
@@ -1100,7 +1098,7 @@ function vt(t, e) {
     t.prototype.toMillis = function() {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }, t.prototype._compareTo = function(t) {
-        return this.seconds === t.seconds ? vt(this.nanoseconds, t.nanoseconds) : vt(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? gt(this.nanoseconds, t.nanoseconds) : gt(this.seconds, t.seconds);
     }, 
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1137,14 +1135,14 @@ function vt(t, e) {
         // 'seconds' values.
                 return String(t).padStart(12, "0") + "." + String(this.nanoseconds).padStart(9, "0");
     }, t;
-}(), bt = /** @class */ function() {
+}(), _t = /** @class */ function() {
     function t(t) {
         this.timestamp = t;
     }
     return t.fromTimestamp = function(e) {
         return new t(e);
     }, t.min = function() {
-        return new t(new wt(0, 0));
+        return new t(new bt(0, 0));
     }, t.prototype.compareTo = function(t) {
         return this.timestamp._compareTo(t.timestamp);
     }, t.prototype.isEqual = function(t) {
@@ -1196,13 +1194,13 @@ function vt(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function _t(t) {
+function Tt(t) {
     var e = 0;
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
 }
 
-function Tt(t, e) {
+function St(t, e) {
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
@@ -1231,12 +1229,12 @@ function Tt(t, e) {
  *   foo.bar - Overwrites only the field bar of the object foo.
  *             If foo is not an object, foo is replaced with an object
  *             containing foo
- */ var St = /** @class */ function() {
+ */ var Et = /** @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(tt.comparator)
+        t.sort(et.comparator)
         /**
      * Verifies that `fieldPath` is included by at least one field in this field
      * mask.
@@ -1250,11 +1248,11 @@ function Tt(t, e) {
         }
         return !1;
     }, t.prototype.isEqual = function(t) {
-        return gt(this.fields, t.fields, (function(t, e) {
+        return wt(this.fields, t.fields, (function(t, e) {
             return t.isEqual(e);
         }));
     }, t;
-}(), Et = /** @class */ function() {
+}(), It = /** @class */ function() {
     function t(t) {
         this.binaryString = t;
     }
@@ -1270,6 +1268,19 @@ function Tt(t, e) {
             return e;
         }(e);
         return new t(n);
+    }, t.prototype[Symbol.iterator] = function() {
+        var t = this, e = 0;
+        return {
+            next: function() {
+                return e < t.binaryString.length ? {
+                    value: t.binaryString.charCodeAt(e++),
+                    done: !1
+                } : {
+                    value: void 0,
+                    done: !0
+                };
+            }
+        };
     }, t.prototype.toBase64 = function() {
         return t = this.binaryString, btoa(t);
         /** Converts a binary string to a Base64 encoded string. */        var t;
@@ -1281,7 +1292,7 @@ function Tt(t, e) {
     }, t.prototype.approximateByteSize = function() {
         return 2 * this.binaryString.length;
     }, t.prototype.compareTo = function(t) {
-        return vt(this.binaryString, t.binaryString);
+        return gt(this.binaryString, t.binaryString);
     }, t.prototype.isEqual = function(t) {
         return this.binaryString === t.binaryString;
     }, t;
@@ -1328,23 +1339,23 @@ function Tt(t, e) {
  * the proto byte string in a common class that must be converted into a string
  * before being sent as a proto.
  * @internal
- */ Et.EMPTY_BYTE_STRING = new Et("");
+ */ It.EMPTY_BYTE_STRING = new It("");
 
-var It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+var At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
 /**
  * Converts the possible Proto values for a timestamp value into a "seconds and
  * nanos" representation.
- */ function At(t) {
+ */ function kt(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 (S(!!t), "string" == typeof t) {
+    if (E(!!t), "string" == typeof t) {
         // The date string can have higher precision (nanos) than the Date class
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
-        var e = 0, n = It.exec(t);
-        if (S(!!n), n[1]) {
+        var e = 0, n = At.exec(t);
+        if (E(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             var r = n[1];
             r = (r + "000000000").substr(0, 9), e = Number(r);
@@ -1357,21 +1368,21 @@ var It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: kt(t.seconds),
-        nanos: kt(t.nanos)
+        seconds: Vt(t.seconds),
+        nanos: Vt(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function kt(t) {
+ */ function Vt(t) {
     // TODO(bjornick): Handle int64 greater than 53 bits.
     return "number" == typeof t ? t : "string" == typeof t ? Number(t) : 0;
 }
 
-/** Converts the possible Proto types for Blobs into a ByteString. */ function Vt(t) {
-    return "string" == typeof t ? Et.fromBase64String(t) : Et.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Dt(t) {
+    return "string" == typeof t ? It.fromBase64String(t) : It.fromUint8Array(t);
 }
 
 /**
@@ -1407,7 +1418,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 Dt(t) {
+ */ function Pt(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);
 }
@@ -1417,16 +1428,16 @@ 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 Pt(t) {
+ */ function Ft(t) {
     var e = t.mapValue.fields.__previous_value__;
-    return Dt(e) ? Pt(e) : e;
+    return Pt(e) ? Ft(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Ft(t) {
-    var e = At(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new wt(e.seconds, e.nanos);
+ */ function Nt(t) {
+    var e = kt(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new bt(e.seconds, e.nanos);
 }
 
 /**
@@ -1445,13 +1456,14 @@ var It = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Extracts the backend's type order for the provided value. */ function Nt(t) {
-    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Dt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : T();
+/** Extracts the backend's type order for the provided value. */ function qt(t) {
+    return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Pt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : S();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function qt(t, e) {
-    var n = Nt(t);
-    if (n !== Nt(e)) return !1;
+/** Tests `left` and `right` for equality based on the backend semantics. */ function Ot(t, e) {
+    if (t === e) return !0;
+    var n = qt(t);
+    if (n !== qt(e)) return !1;
     switch (n) {
       case 0 /* NullValue */ :
         return !0;
@@ -1460,14 +1472,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 Ft(t).isEqual(Ft(e));
+        return Nt(t).isEqual(Nt(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 = At(t.timestampValue), r = At(e.timestampValue);
+            var n = kt(t.timestampValue), r = kt(e.timestampValue);
             return n.seconds === r.seconds && n.nanos === r.nanos;
         }(t, e);
 
@@ -1476,7 +1488,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 Vt(t.bytesValue).isEqual(Vt(e.bytesValue));
+            return Dt(t.bytesValue).isEqual(Dt(e.bytesValue));
         }(t, e);
 
       case 7 /* RefValue */ :
@@ -1484,96 +1496,97 @@ 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 kt(t.geoPointValue.latitude) === kt(e.geoPointValue.latitude) && kt(t.geoPointValue.longitude) === kt(e.geoPointValue.longitude);
+            return Vt(t.geoPointValue.latitude) === Vt(e.geoPointValue.latitude) && Vt(t.geoPointValue.longitude) === Vt(e.geoPointValue.longitude);
         }(t, e);
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            if ("integerValue" in t && "integerValue" in e) return kt(t.integerValue) === kt(e.integerValue);
+            if ("integerValue" in t && "integerValue" in e) return Vt(t.integerValue) === Vt(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
-                var n = kt(t.doubleValue), r = kt(e.doubleValue);
-                return n === r ? ct(n) === ct(r) : isNaN(n) && isNaN(r);
+                var n = Vt(t.doubleValue), r = Vt(e.doubleValue);
+                return n === r ? lt(n) === lt(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* ArrayValue */ :
-        return gt(t.arrayValue.values || [], e.arrayValue.values || [], qt);
+        return wt(t.arrayValue.values || [], e.arrayValue.values || [], Ot);
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
             var n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (_t(n) !== _t(r)) return !1;
-            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !qt(n[i], r[i]))) return !1;
+            if (Tt(n) !== Tt(r)) return !1;
+            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !Ot(n[i], r[i]))) return !1;
             return !0;
         }(t, e);
 
       default:
-        return T();
+        return S();
     }
 }
 
-function Ot(t, e) {
+function Ct(t, e) {
     return void 0 !== (t.values || []).find((function(t) {
-        return qt(t, e);
+        return Ot(t, e);
     }));
 }
 
-function Ct(t, e) {
-    var n = Nt(t), r = Nt(e);
-    if (n !== r) return vt(n, r);
+function jt(t, e) {
+    if (t === e) return 0;
+    var n = qt(t), r = qt(e);
+    if (n !== r) return gt(n, r);
     switch (n) {
       case 0 /* NullValue */ :
         return 0;
 
       case 1 /* BooleanValue */ :
-        return vt(t.booleanValue, e.booleanValue);
+        return gt(t.booleanValue, e.booleanValue);
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            var n = kt(t.integerValue || t.doubleValue), r = kt(e.integerValue || e.doubleValue);
+            var n = Vt(t.integerValue || t.doubleValue), r = Vt(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 jt(t.timestampValue, e.timestampValue);
+        return Lt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return jt(Ft(t), Ft(e));
+        return Lt(Nt(t), Nt(e));
 
       case 5 /* StringValue */ :
-        return vt(t.stringValue, e.stringValue);
+        return gt(t.stringValue, e.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            var n = Vt(t), r = Vt(e);
+            var n = Dt(t), r = Dt(e);
             return n.compareTo(r);
         }(t.bytesValue, e.bytesValue);
 
       case 7 /* RefValue */ :
         return function(t, e) {
             for (var n = t.split("/"), r = e.split("/"), i = 0; i < n.length && i < r.length; i++) {
-                var o = vt(n[i], r[i]);
+                var o = gt(n[i], r[i]);
                 if (0 !== o) return o;
             }
-            return vt(n.length, r.length);
+            return gt(n.length, r.length);
         }(t.referenceValue, e.referenceValue);
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            var n = vt(kt(t.latitude), kt(e.latitude));
-            return 0 !== n ? n : vt(kt(t.longitude), kt(e.longitude));
+            var n = gt(Vt(t.latitude), Vt(e.latitude));
+            return 0 !== n ? n : gt(Vt(t.longitude), Vt(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 = Ct(n[i], r[i]);
+                var o = jt(n[i], r[i]);
                 if (o) return o;
             }
-            return vt(n.length, r.length);
+            return gt(n.length, r.length);
         }(t.arrayValue, e.arrayValue);
 
       case 10 /* ObjectValue */ :
@@ -1585,48 +1598,48 @@ function Ct(t, e) {
             // canonical IDs are independent of insertion order.
                         r.sort(), o.sort();
             for (var a = 0; a < r.length && a < o.length; ++a) {
-                var s = vt(r[a], o[a]);
+                var s = gt(r[a], o[a]);
                 if (0 !== s) return s;
-                var u = Ct(n[r[a]], i[o[a]]);
+                var u = jt(n[r[a]], i[o[a]]);
                 if (0 !== u) return u;
             }
-            return vt(r.length, o.length);
+            return gt(r.length, o.length);
         }(t.mapValue, e.mapValue);
 
       default:
-        throw T();
+        throw S();
     }
 }
 
-function jt(t, e) {
-    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return vt(t, e);
-    var n = At(t), r = At(e), i = vt(n.seconds, r.seconds);
-    return 0 !== i ? i : vt(n.nanos, r.nanos);
+function Lt(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);
+    return 0 !== i ? i : gt(n.nanos, r.nanos);
 }
 
-function Lt(t, e) {
+function Rt(t, e) {
     return {
         referenceValue: "projects/" + t.projectId + "/databases/" + t.database + "/documents/" + e.path.canonicalString()
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Rt(t) {
+/** Returns true if `value` is an ArrayValue. */ function Mt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Mt(t) {
+/** Returns true if `value` is a NullValue. */ function Ut(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function Ut(t) {
+/** Returns true if `value` is NaN. */ function xt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function xt(t) {
+/** Returns true if `value` is a MapValue. */ function Bt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Bt(t) {
+/** Creates a deep copy of `source`. */ function Gt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1639,8 +1652,8 @@ function Lt(t, e) {
                 fields: {}
             }
         };
-        return Tt(t.mapValue.fields, (function(t, n) {
-            return e.mapValue.fields[t] = Bt(n);
+        return St(t.mapValue.fields, (function(t, n) {
+            return e.mapValue.fields[t] = Gt(n);
         })), e;
     }
     if (t.arrayValue) {
@@ -1648,7 +1661,7 @@ function Lt(t, e) {
             arrayValue: {
                 values: []
             }
-        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = Bt(t.arrayValue.values[r]);
+        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = Gt(t.arrayValue.values[r]);
         return n;
     }
     return Object.assign({}, t);
@@ -1673,7 +1686,7 @@ function Lt(t, e) {
 /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ var Gt = /** @class */ function() {
+ */ var zt = /** @class */ function() {
     function t(t) {
         this.value = t;
     }
@@ -1690,7 +1703,7 @@ function Lt(t, e) {
      */
     t.prototype.field = function(t) {
         if (t.isEmpty()) return this.value;
-        for (var e = this.value, n = 0; n < t.length - 1; ++n) if (!xt(e = (e.mapValue.fields || {})[t.get(n)])) return null;
+        for (var e = this.value, n = 0; n < t.length - 1; ++n) if (!Bt(e = (e.mapValue.fields || {})[t.get(n)])) return null;
         return (e = (e.mapValue.fields || {})[t.lastSegment()]) || null;
     }, 
     /**
@@ -1700,7 +1713,7 @@ function Lt(t, e) {
      * @param value - The value to set.
      */
     t.prototype.set = function(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Bt(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Gt(e);
     }, 
     /**
      * Sets the provided fields to the provided values.
@@ -1708,14 +1721,14 @@ function Lt(t, e) {
      * @param data - A map of fields to values (or null for deletes).
      */
     t.prototype.setAll = function(t) {
-        var e = this, n = tt.emptyPath(), r = {}, i = [];
+        var e = this, n = et.emptyPath(), r = {}, i = [];
         t.forEach((function(t, o) {
             if (!n.isImmediateParentOf(o)) {
                 // Insert the accumulated changes at this parent location
                 var a = e.getFieldsMap(n);
                 e.applyChanges(a, r, i), r = {}, i = [], n = o.popLast();
             }
-            t ? r[o.lastSegment()] = Bt(t) : i.push(o.lastSegment());
+            t ? r[o.lastSegment()] = Gt(t) : i.push(o.lastSegment());
         }));
         var o = this.getFieldsMap(n);
         this.applyChanges(o, r, i);
@@ -1728,9 +1741,9 @@ function Lt(t, e) {
      */
     t.prototype.delete = function(t) {
         var e = this.field(t.popLast());
-        xt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        Bt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }, t.prototype.isEqual = function(t) {
-        return qt(this.value, t.value);
+        return Ot(this.value, t.value);
     }, 
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -1743,7 +1756,7 @@ function Lt(t, e) {
         });
         for (var n = 0; n < t.length; ++n) {
             var r = e.mapValue.fields[t.get(n)];
-            xt(r) && r.mapValue.fields || (r = {
+            Bt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -1756,7 +1769,7 @@ function Lt(t, e) {
      * entries.
      */
     t.prototype.applyChanges = function(t, e, n) {
-        Tt(e, (function(e, n) {
+        St(e, (function(e, n) {
             return t[e] = n;
         }));
         for (var r = 0, i = n; r < i.length; r++) {
@@ -1764,9 +1777,9 @@ function Lt(t, e) {
             delete t[o];
         }
     }, t.prototype.clone = function() {
-        return new t(Bt(this.value));
+        return new t(Gt(this.value));
     }, t;
-}(), zt = /** @class */ function() {
+}(), Qt = /** @class */ function() {
     function t(t, e, n, r, i) {
         this.key = t, this.documentType = e, this.version = n, this.data = r, this.documentState = i
         /**
@@ -1775,7 +1788,7 @@ function Lt(t, e) {
      */;
     }
     return t.newInvalidDocument = function(e) {
-        return new t(e, 0 /* INVALID */ , bt.min(), Gt.empty(), 0 /* SYNCED */);
+        return new t(e, 0 /* INVALID */ , _t.min(), zt.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist with the given data at the
@@ -1785,7 +1798,7 @@ function Lt(t, e) {
         return new t(e, 1 /* FOUND_DOCUMENT */ , n, 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, Gt.empty(), 0 /* SYNCED */);
+        return new t(e, 2 /* NO_DOCUMENT */ , n, zt.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist at the given version but
@@ -1793,7 +1806,7 @@ function Lt(t, e) {
      * base document).
      */
     t.newUnknownDocument = function(e, n) {
-        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, Gt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, zt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }, 
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -1808,7 +1821,7 @@ function Lt(t, e) {
      * version.
      */
     t.prototype.convertToNoDocument = function(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Gt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = zt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }, 
     /**
@@ -1817,7 +1830,7 @@ function Lt(t, e) {
      * base document).
      */
     t.prototype.convertToUnknownDocument = function(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Gt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = zt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }, t.prototype.setHasCommittedMutations = function() {
         return this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
@@ -1851,12 +1864,12 @@ function Lt(t, e) {
         return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
     }, t.prototype.isEqual = function(e) {
         return e instanceof t && this.key.isEqual(e.key) && this.version.isEqual(e.version) && this.documentType === e.documentType && this.documentState === e.documentState && this.data.isEqual(e.data);
-    }, t.prototype.clone = function() {
+    }, t.prototype.mutableCopy = function() {
         return new t(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
     }, t.prototype.toString = function() {
         return "Document(" + this.key + ", " + this.version + ", " + JSON.stringify(this.data.value) + ", {documentType: " + this.documentType + "}), {documentState: " + this.documentState + "})";
     }, t;
-}(), Qt = function(t, e, n, r, i, o, a) {
+}(), Kt = 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, 
@@ -1897,13 +1910,13 @@ function Lt(t, e) {
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
  */
-function Kt(t, e, n, r, i, o, a) {
+function Ht(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 Qt(t, e, n, r, i, o, a);
+    new Kt(t, e, n, r, i, o, a);
 }
 
-var Ht = /** @class */ function(e) {
+var Wt = /** @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;
@@ -1911,13 +1924,13 @@ var Ht = /** @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 Wt(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Jt(t, r) : "in" /* IN */ === e ? new Zt(t, r) : "not-in" /* NOT_IN */ === e ? new te(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ee(t, r) : new n(t, e, r);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, r) : new Yt(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Zt(t, r) : "in" /* IN */ === e ? new te(t, r) : "not-in" /* NOT_IN */ === e ? new ee(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ne(t, r) : new n(t, e, r);
     }, n.V = function(t, e, n) {
-        return "in" /* IN */ === e ? new Yt(t, n) : new $t(t, n);
+        return "in" /* IN */ === e ? new $t(t, n) : new Xt(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(Ct(e, this.value)) : null !== e && Nt(this.value) === Nt(e) && this.D(Ct(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.D(jt(e, this.value)) : null !== e && qt(this.value) === qt(e) && this.D(jt(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }, n.prototype.D = function(t) {
         switch (this.op) {
@@ -1940,25 +1953,25 @@ var Ht = /** @class */ function(e) {
             return t >= 0;
 
           default:
-            return T();
+            return S();
         }
     }, n.prototype.N = 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() {})), Wt = /** @class */ function(e) {
+}((function() {})), Yt = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this, t, n, r) || this).key = et.fromName(r.referenceValue), 
+        return (i = e.call(this, t, n, r) || this).key = nt.fromName(r.referenceValue), 
         i;
     }
     return t(n, e), n.prototype.matches = function(t) {
-        var e = et.comparator(t.key, this.key);
+        var e = nt.comparator(t.key, this.key);
         return this.D(e);
     }, n;
-}(Ht), Yt = /** @class */ function(e) {
+}(Wt), $t = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "in" /* IN */ , n) || this).keys = Xt("in" /* IN */ , n), 
+        return (r = e.call(this, t, "in" /* IN */ , n) || this).keys = Jt("in" /* IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1966,10 +1979,10 @@ var Ht = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Ht), $t = /** @class */ function(e) {
+}(Wt), Xt = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "not-in" /* NOT_IN */ , n) || this).keys = Xt("not-in" /* NOT_IN */ , n), 
+        return (r = e.call(this, t, "not-in" /* NOT_IN */ , n) || this).keys = Jt("not-in" /* NOT_IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1977,67 +1990,67 @@ var Ht = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Ht);
+}(Wt);
 
-/** Filter that matches on key fields (i.e. '__name__'). */ function Xt(t, e) {
+/** Filter that matches on key fields (i.e. '__name__'). */ function Jt(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((function(t) {
-        return et.fromName(t.referenceValue);
+        return nt.fromName(t.referenceValue);
     }));
 }
 
-/** A Filter that implements the array-contains operator. */ var Jt = /** @class */ function(e) {
+/** A Filter that implements the array-contains operator. */ var Zt = /** @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 Rt(e) && Ot(e.arrayValue, this.value);
+        return Mt(e) && Ct(e.arrayValue, this.value);
     }, n;
-}(Ht), Zt = /** @class */ function(e) {
+}(Wt), te = /** @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 && Ot(this.value.arrayValue, e);
+        return null !== e && Ct(this.value.arrayValue, e);
     }, n;
-}(Ht), te = /** @class */ function(e) {
+}(Wt), ee = /** @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 (Ot(this.value.arrayValue, {
+        if (Ct(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         var e = t.data.field(this.field);
-        return null !== e && !Ot(this.value.arrayValue, e);
+        return null !== e && !Ct(this.value.arrayValue, e);
     }, n;
-}(Ht), ee = /** @class */ function(e) {
+}(Wt), ne = /** @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 !(!Rt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
-            return Ot(e.value.arrayValue, t);
+        return !(!Mt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
+            return Ct(e.value.arrayValue, t);
         }));
     }, n;
-}(Ht), ne = function(t, e) {
+}(Wt), re = function(t, e) {
     this.position = t, this.before = e;
-}, re = function(t, e /* ASCENDING */) {
+}, ie = function(t, e /* ASCENDING */) {
     void 0 === e && (e = "asc"), this.field = t, this.dir = e;
 };
 
-/** A Filter that implements the IN operator. */ function ie(t, e) {
+/** A Filter that implements the IN operator. */ function oe(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
-function oe(t, e) {
+function ae(t, e) {
     if (null === t) return null === e;
     if (null === e) return !1;
     if (t.before !== e.before || t.position.length !== e.position.length) return !1;
-    for (var n = 0; n < t.position.length; n++) if (!qt(t.position[n], e.position[n])) return !1;
+    for (var n = 0; n < t.position.length; n++) if (!Ot(t.position[n], e.position[n])) return !1;
     return !0;
 }
 
@@ -2063,7 +2076,7 @@ function oe(t, e) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ var ae = 
+ */ var se = 
 /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2078,15 +2091,15 @@ function(t, e, n, r, i, o /* First */ , a, s) {
     this.F = null, this.startAt, this.endAt;
 };
 
-/** Creates a new Query for a query that matches all documents at `path` */ function se(t) {
-    return !ut(t.limit) && "L" /* Last */ === t.limitType;
+/** Creates a new Query for a query that matches all documents at `path` */ function ue(t) {
+    return !ct(t.limit) && "L" /* Last */ === t.limitType;
 }
 
-function ue(t) {
+function ce(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function ce(t) {
+function le(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
         var r = n[e];
         if (r.N()) return r.field;
@@ -2101,7 +2114,7 @@ function ce(t) {
 /**
  * Returns whether the query matches a collection group rather than a specific
  * collection.
- */ function le(t) {
+ */ function fe(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2109,16 +2122,16 @@ function ce(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 fe(t) {
-    var e = E(t);
+ */ function he(t) {
+    var e = I(t);
     if (null === e.$) {
         e.$ = [];
-        var n = ce(e), r = ue(e);
+        var n = le(e), r = ce(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 re(n)), e.$.push(new re(tt.keyField(), "asc" /* ASCENDING */)); else {
+        n.isKeyField() || e.$.push(new ie(n)), e.$.push(new ie(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);
@@ -2127,7 +2140,7 @@ function ce(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 re(tt.keyField(), u));
+                e.$.push(new ie(et.keyField(), u));
             }
         }
     }
@@ -2136,19 +2149,19 @@ function ce(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function he(t) {
-    var e = E(t);
-    if (!e.F) if ("F" /* First */ === e.limitType) e.F = Kt(e.path, e.collectionGroup, fe(e), e.filters, e.limit, e.startAt, e.endAt); else {
+ */ function pe(t) {
+    var e = I(t);
+    if (!e.F) if ("F" /* First */ === e.limitType) e.F = Ht(e.path, e.collectionGroup, he(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 = fe(e); r < i.length; r++) {
+        var n = [], r = 0, i = he(e); r < i.length; r++) {
             var o = i[r], a = "desc" /* DESCENDING */ === o.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            n.push(new re(o.field, a));
+            n.push(new ie(o.field, a));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                var s = e.endAt ? new ne(e.endAt.position, !e.endAt.before) : null, u = e.startAt ? new ne(e.startAt.position, !e.startAt.before) : null;
+                var s = e.endAt ? new re(e.endAt.position, !e.endAt.before) : null, u = e.startAt ? new re(e.startAt.position, !e.startAt.before) : null;
         // Now return as a LimitType.First query.
-                e.F = Kt(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
+                e.F = Ht(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
     }
     return e.F;
 }
@@ -2178,9 +2191,9 @@ function ce(t) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function pe(t, e) {
+function de(t, e) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !ct(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !lt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
     /**
      * Returns an IntegerValue for `value`.
@@ -2202,7 +2215,7 @@ function pe(t, e) {
             };
         }
         return {
-            doubleValue: ct(e) ? "-0" : e
+            doubleValue: lt(e) ? "-0" : e
         };
     }(t, e);
 }
@@ -2223,36 +2236,36 @@ function pe(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 de = function() {
+/** Used to represent a field transform on a mutation. */ var me = function() {
     // Make sure that the structural type of `TransformOperation` is unique.
     // See https://github.com/microsoft/TypeScript/issues/5451
     this._ = void 0;
-}, me = /** @class */ function(e) {
+}, ye = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(de), ye = /** @class */ function(e) {
+}(me), ve = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(de), ve = /** @class */ function(e) {
+}(me), ge = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(de), ge = /** @class */ function(e) {
+}(me), we = /** @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;
-}(de), we = function(t, e) {
+}(me), be = function(t, e) {
     this.field = t, this.transform = e;
-}, be = /** @class */ function() {
+}, _e = /** @class */ function() {
     function t(t, e) {
         this.updateTime = t, this.exists = e
         /** Creates a new empty Precondition. */;
@@ -2274,7 +2287,7 @@ function pe(t, e) {
     }), t.prototype.isEqual = function(t) {
         return this.exists === t.exists && (this.updateTime ? !!t.updateTime && this.updateTime.isEqual(t.updateTime) : !t.updateTime);
     }, t;
-}(), _e = function() {}, Te = /** @class */ function(e) {
+}(), Te = function() {}, Se = /** @class */ function(e) {
     function n(t, n, r, i) {
         void 0 === i && (i = []);
         var o = this;
@@ -2282,7 +2295,7 @@ function pe(t, e) {
         o.type = 0 /* Set */ , o;
     }
     return t(n, e), n;
-}(_e), Se = /** @class */ function(e) {
+}(Te), Ee = /** @class */ function(e) {
     function n(t, n, r, i, o) {
         void 0 === o && (o = []);
         var a = this;
@@ -2290,24 +2303,24 @@ function pe(t, e) {
         a.fieldTransforms = o, a.type = 1 /* Patch */ , a;
     }
     return t(n, e), n;
-}(_e), Ee = /** @class */ function(e) {
+}(Te), Ie = /** @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;
-}(_e), Ie = /** @class */ function(e) {
+}(Te), Ae = /** @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;
-}(_e), Ae = {
+}(Te), ke = {
     asc: "ASCENDING",
     desc: "DESCENDING"
-}, ke = {
+}, Ve = {
     "<": "LESS_THAN",
     "<=": "LESS_THAN_OR_EQUAL",
     ">": "GREATER_THAN",
@@ -2318,7 +2331,7 @@ function pe(t, e) {
     in: "IN",
     "not-in": "NOT_IN",
     "array-contains-any": "ARRAY_CONTAINS_ANY"
-}, Ve = function(t, e) {
+}, De = function(t, e) {
     this.databaseId = t, this.S = e;
 };
 
@@ -2334,7 +2347,7 @@ function pe(t, e) {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function De(t, e) {
+function Pe(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
@@ -2345,80 +2358,80 @@ function De(t, e) {
  * Returns a value for bytes that's appropriate to put in a proto.
  *
  * Visible for testing.
- */ function Pe(t, e) {
+ */ function Fe(t, e) {
     return t.S ? e.toBase64() : e.toUint8Array();
 }
 
-function Fe(t, e) {
-    return De(t, e.toTimestamp());
+function Ne(t, e) {
+    return Pe(t, e.toTimestamp());
 }
 
-function Ne(t) {
-    return S(!!t), bt.fromTimestamp(function(t) {
-        var e = At(t);
-        return new wt(e.seconds, e.nanos);
+function qe(t) {
+    return E(!!t), _t.fromTimestamp(function(t) {
+        var e = kt(t);
+        return new bt(e.seconds, e.nanos);
     }(t));
 }
 
-function qe(t, e) {
+function Oe(t, e) {
     return function(t) {
-        return new J([ "projects", t.projectId, "databases", t.database ]);
+        return new Z([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
-function Oe(t, e) {
-    return qe(t.databaseId, e.path);
+function Ce(t, e) {
+    return Oe(t.databaseId, e.path);
 }
 
-function Ce(t, e) {
+function je(t, e) {
     var n, r = function(t) {
-        var e = J.fromString(t);
-        return S(ze(e)), e;
+        var e = Z.fromString(t);
+        return E(Qe(e)), e;
     }(e);
-    if (r.get(1) !== t.databaseId.projectId) throw new M(k, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
-    if (r.get(3) !== t.databaseId.database) throw new M(k, "Tried to deserialize key from different database: " + r.get(3) + " vs " + t.databaseId.database);
-    return new et((S((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
+    if (r.get(1) !== t.databaseId.projectId) throw new U(V, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
+    if (r.get(3) !== t.databaseId.database) throw new U(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)));
 }
 
-function je(t, e) {
-    return qe(t.databaseId, e);
+function Le(t, e) {
+    return Oe(t.databaseId, e);
 }
 
-function Le(t) {
-    return new J([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
+function Re(t) {
+    return new Z([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Re(t, e, n) {
+function Me(t, e, n) {
     return {
-        name: Oe(t, e),
+        name: Ce(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function Me(t) {
+function Ue(t) {
     return {
         before: t.before,
         values: t.position
     };
 }
 
-// visible for testing
-function Ue(t) {
-    return Ae[t];
-}
-
 // visible for testing
 function xe(t) {
     return ke[t];
 }
 
+// visible for testing
 function Be(t) {
+    return Ve[t];
+}
+
+function Ge(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Ge(t) {
+function ze(t) {
     var e = [];
     return t.fields.forEach((function(t) {
         return e.push(t.canonicalString());
@@ -2427,7 +2440,7 @@ function Ge(t) {
     };
 }
 
-function ze(t) {
+function Qe(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2447,8 +2460,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 Ve(t, /* useProto3Json= */ !0);
+ */ function Ke(t) {
+    return new De(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -2475,7 +2488,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 He = /** @class */ function() {
     function t(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -2534,7 +2547,7 @@ function ze(t) {
         // 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);
         // Guard against lastAttemptTime being in the future due to a clock change.
-                i > 0 && g("ExponentialBackoff", "Backing off for " + i + " ms (base delay: " + this.j + " ms, delay with jitter: " + n + " ms, last attempt: " + r + " ms ago)"), 
+                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() {
             return e.B = Date.now(), t();
         })), 
@@ -2549,14 +2562,14 @@ function ze(t) {
     /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.Y = function() {
         return (Math.random() - .5) * this.j;
     }, t;
-}(), He = /** @class */ function(e) {
+}(), We = /** @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;
     }
     return t(n, e), n.prototype.X = function() {
-        if (this.J) throw new M(q, "The client has already been terminated.");
+        if (this.J) throw new U(O, "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;
@@ -2564,8 +2577,8 @@ function ze(t) {
             var o = i[0], a = i[1];
             return r.K.m(t, e, n, o, a);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === F && (r.authCredentials.invalidateToken(), 
-            r.appCheckCredentials.invalidateToken()), t) : new M(A, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === N && (r.authCredentials.invalidateToken(), 
+            r.appCheckCredentials.invalidateToken()), t) : new U(k, t.toString());
         }));
     }, 
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */ n.prototype.T = function(t, e, n) {
@@ -2574,8 +2587,8 @@ function ze(t) {
             var o = i[0], a = i[1];
             return r.K.T(t, e, n, o, a);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === F && (r.authCredentials.invalidateToken(), 
-            r.appCheckCredentials.invalidateToken()), t) : new M(A, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === N && (r.authCredentials.invalidateToken(), 
+            r.appCheckCredentials.invalidateToken()), t) : new U(k, t.toString());
         }));
     }, n.prototype.terminate = function() {
         this.J = !0;
@@ -2609,60 +2622,60 @@ function ze(t) {
  */
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-function We(t, r) {
+function Ye(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 = E(t), i = Le(e.q) + "/documents", o = {
+                return e = I(t), i = Re(e.q) + "/documents", o = {
                     writes: r.map((function(t) {
                         return function(t, e) {
                             var n;
-                            if (e instanceof Te) n = {
-                                update: Re(t, e.key, e.value)
+                            if (e instanceof Se) n = {
+                                update: Me(t, e.key, e.value)
+                            }; else if (e instanceof Ie) n = {
+                                delete: Ce(t, e.key)
                             }; else if (e instanceof Ee) n = {
-                                delete: Oe(t, e.key)
-                            }; else if (e instanceof Se) n = {
-                                update: Re(t, e.key, e.data),
-                                updateMask: Ge(e.fieldMask)
+                                update: Me(t, e.key, e.data),
+                                updateMask: ze(e.fieldMask)
                             }; else {
-                                if (!(e instanceof Ie)) return T();
+                                if (!(e instanceof Ae)) return S();
                                 n = {
-                                    verify: Oe(t, e.key)
+                                    verify: Ce(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 me) return {
+                                    if (n instanceof ye) return {
                                         fieldPath: e.field.canonicalString(),
                                         setToServerValue: "REQUEST_TIME"
                                     };
-                                    if (n instanceof ye) return {
+                                    if (n instanceof ve) return {
                                         fieldPath: e.field.canonicalString(),
                                         appendMissingElements: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof ve) return {
+                                    if (n instanceof ge) return {
                                         fieldPath: e.field.canonicalString(),
                                         removeAllFromArray: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof ge) return {
+                                    if (n instanceof we) return {
                                         fieldPath: e.field.canonicalString(),
                                         increment: n.O
                                     };
-                                    throw T();
+                                    throw S();
                                 }(0, t);
                             }))), e.precondition.isNone || (n.currentDocument = function(t, e) {
                                 return void 0 !== e.updateTime ? {
-                                    updateTime: Fe(t, e.updateTime)
+                                    updateTime: Ne(t, e.updateTime)
                                 } : void 0 !== e.exists ? {
                                     exists: e.exists
-                                } : T();
+                                } : S();
                             }(t, e.precondition)), n;
                         }(e.q, t);
                     }))
@@ -2675,15 +2688,15 @@ function We(t, r) {
     }));
 }
 
-function Ye(t, r) {
+function $e(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 = E(t), i = Le(e.q) + "/documents", o = {
+                return e = I(t), i = Re(e.q) + "/documents", o = {
                     documents: r.map((function(t) {
-                        return Oe(e.q, t);
+                        return Ce(e.q, t);
                     }))
                 }, [ 4 /*yield*/ , e.T("BatchGetDocuments", i, o) ];
 
@@ -2691,44 +2704,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) {
-                            S(!!e.found), e.found.name, e.found.updateTime;
-                            var n = Ce(t, e.found.name), r = Ne(e.found.updateTime), i = new Gt({
+                            E(!!e.found), e.found.name, e.found.updateTime;
+                            var n = je(t, e.found.name), r = qe(e.found.updateTime), i = new zt({
                                 mapValue: {
                                     fields: e.found.fields
                                 }
                             });
-                            return zt.newFoundDocument(n, r, i);
+                            return Qt.newFoundDocument(n, r, i);
                         }(t, e) : "missing" in e ? function(t, e) {
-                            S(!!e.missing), S(!!e.readTime);
-                            var n = Ce(t, e.missing), r = Ne(e.readTime);
-                            return zt.newNoDocument(n, r);
-                        }(t, e) : T();
+                            E(!!e.missing), E(!!e.readTime);
+                            var n = je(t, e.missing), r = qe(e.readTime);
+                            return Qt.newNoDocument(n, r);
+                        }(t, e) : S();
                     }(e.q, t);
                     s.set(n.key.toString(), n);
                 })), u = [], [ 2 /*return*/ , (r.forEach((function(t) {
                     var e = s.get(t.toString());
-                    S(!!e), u.push(e);
+                    E(!!e), u.push(e);
                 })), u) ];
             }
         }));
     }));
 }
 
-function $e(t, r) {
+function Xe(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 = E(t), i = function(t, e) {
+                return e = I(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 = je(t, r), n.structuredQuery.from = [ {
+                    null !== e.collectionGroup ? (n.parent = Le(t, r), n.structuredQuery.from = [ {
                         collectionId: e.collectionGroup,
                         allDescendants: !0
-                    } ]) : (n.parent = je(t, r.popLast()), n.structuredQuery.from = [ {
+                    } ]) : (n.parent = Le(t, r.popLast()), n.structuredQuery.from = [ {
                         collectionId: r.lastSegment()
                     } ]);
                     var i = function(t) {
@@ -2737,36 +2750,36 @@ function $e(t, r) {
                                 // visible for testing
                                 return function(t) {
                                     if ("==" /* EQUAL */ === t.op) {
-                                        if (Ut(t.value)) return {
+                                        if (xt(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: Ge(t.field),
                                                 op: "IS_NAN"
                                             }
                                         };
-                                        if (Mt(t.value)) return {
+                                        if (Ut(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: Ge(t.field),
                                                 op: "IS_NULL"
                                             }
                                         };
                                     } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                                        if (Ut(t.value)) return {
+                                        if (xt(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: Ge(t.field),
                                                 op: "IS_NOT_NAN"
                                             }
                                         };
-                                        if (Mt(t.value)) return {
+                                        if (Ut(t.value)) return {
                                             unaryFilter: {
-                                                field: Be(t.field),
+                                                field: Ge(t.field),
                                                 op: "IS_NOT_NULL"
                                             }
                                         };
                                     }
                                     return {
                                         fieldFilter: {
-                                            field: Be(t.field),
-                                            op: xe(t.op),
+                                            field: Ge(t.field),
+                                            op: Be(t.op),
                                             value: t.value
                                         }
                                     };
@@ -2786,21 +2799,21 @@ function $e(t, r) {
                             // visible for testing
                             return function(t) {
                                 return {
-                                    field: Be(t.field),
-                                    direction: Ue(t.dir)
+                                    field: Ge(t.field),
+                                    direction: xe(t.dir)
                                 };
                             }(t);
                         }));
                     }(e.orderBy);
                     o && (n.structuredQuery.orderBy = o);
                     var a = function(t, e) {
-                        return t.S || ut(e) ? e : {
+                        return t.S || ct(e) ? e : {
                             value: e
                         };
                     }(t, e.limit);
-                    return null !== a && (n.structuredQuery.limit = a), e.startAt && (n.structuredQuery.startAt = Me(e.startAt)), 
-                    e.endAt && (n.structuredQuery.endAt = Me(e.endAt)), n;
-                }(e.q, he(r)), [ 4 /*yield*/ , e.T("RunQuery", i.parent, {
+                    return null !== a && (n.structuredQuery.limit = a), e.startAt && (n.structuredQuery.startAt = Ue(e.startAt)), 
+                    e.endAt && (n.structuredQuery.endAt = Ue(e.endAt)), n;
+                }(e.q, pe(r)), [ 4 /*yield*/ , e.T("RunQuery", i.parent, {
                     structuredQuery: i.structuredQuery
                 }) ];
 
@@ -2809,11 +2822,11 @@ function $e(t, r) {
                     return !!t.document;
                 })).map((function(t) {
                     return function(t, e, n) {
-                        var r = Ce(t, e.name), i = Ne(e.updateTime), o = new Gt({
+                        var r = je(t, e.name), i = qe(e.updateTime), o = new zt({
                             mapValue: {
                                 fields: e.fields
                             }
-                        }), a = zt.newFoundDocument(r, i, o);
+                        }), a = Qt.newFoundDocument(r, i, o);
                         return a;
                     }(e.q, t.document);
                 })) ];
@@ -2837,7 +2850,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 Je = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -2847,17 +2860,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(q, "The client has already been terminated.");
-    if (!Xe.has(t)) {
-        g("ComponentProvider", "Initializing Datastore");
+ */ function Ze(t) {
+    if (t._terminated) throw new U(O, "The client has already been terminated.");
+    if (!Je.has(t)) {
+        w("ComponentProvider", "Initializing Datastore");
         var e = function(t) {
-            return new dt(t, fetch.bind(null));
+            return new mt(t, fetch.bind(null));
         }((i = t._databaseId, o = t.app.options.appId || "", a = t._persistenceKey, s = t._freezeSettings(), 
-        new Y(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 = Ke(t._databaseId), r = function(t, e, n, r) {
+            return new We(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, e, n);
-        Xe.set(t, r);
+        Je.set(t, r);
     }
     var i, o, a, s;
     /**
@@ -2875,7 +2888,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 Je.get(t);
 }
 
 /**
@@ -2886,38 +2899,38 @@ 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 tn = /** @class */ function() {
     function t(t) {
         var e;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new M(k, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new U(V, "Can't provide ssl option if host option is not set");
             this.host = "firestore.googleapis.com", this.ssl = !0;
         } else this.host = t.host, this.ssl = null === (e = t.ssl) || void 0 === e || e;
         if (this.credentials = t.credentials, this.ignoreUndefinedProperties = !!t.ignoreUndefinedProperties, 
         void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
-            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new M(k, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new U(V, "cacheSizeBytes must be at least 1048576");
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
         this.useFetchStreams = !!t.useFetchStreams, function(t, e, n, r) {
-            if (!0 === e && !0 === r) throw new M(k, "experimentalForceLongPolling and experimentalAutoDetectLongPolling cannot be used together.");
+            if (!0 === e && !0 === r) throw new U(V, "experimentalForceLongPolling and experimentalAutoDetectLongPolling cannot be used together.");
         }(0, t.experimentalForceLongPolling, 0, t.experimentalAutoDetectLongPolling);
     }
     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() {
+}(), en = /** @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._settingsFrozen = !1, t instanceof $ ? this._databaseId = t : (this._app = t, 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new tn({}), 
+        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(k, '"projectId" not provided in firebase.initializeApp.');
-            return new $(t.options.projectId);
+            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(V, '"projectId" not provided in firebase.initializeApp.');
+            return new X(t.options.projectId);
         }(t));
     }
     return Object.defineProperty(t.prototype, "app", {
@@ -2926,7 +2939,7 @@ function $e(t, r) {
          * instance.
          */
         get: function() {
-            if (!this._app) throw new M(q, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+            if (!this._app) throw new U(O, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
             return this._app;
         },
         enumerable: !1,
@@ -2944,21 +2957,21 @@ function $e(t, r) {
         enumerable: !1,
         configurable: !0
     }), t.prototype._setSettings = function(t) {
-        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 Ze(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
-            if (!t) return new B;
+        if (this._settingsFrozen) throw new U(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 tn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+            if (!t) return new G;
             switch (t.type) {
               case "gapi":
                 var e = t.client;
                 // Make sure this really is a Gapi client.
-                                return S(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
-                new K(e, t.sessionIndex || "0", t.iamToken || null);
+                                return E(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
+                new H(e, t.sessionIndex || "0", t.iamToken || null);
 
               case "provider":
                 return t.client;
 
               default:
-                throw new M(k, "makeAuthCredentialsProvider failed due to invalid credential type");
+                throw new U(V, "makeAuthCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }, t.prototype._getSettings = function() {
@@ -2983,8 +2996,8 @@ function $e(t, r) {
      * Only ever called once.
      */
     t.prototype._terminate = function() {
-        return t = this, (e = Xe.get(t)) && (g("ComponentProvider", "Removing Datastore"), 
-        Xe.delete(t), e.terminate()), Promise.resolve();
+        return t = this, (e = Je.get(t)) && (w("ComponentProvider", "Removing Datastore"), 
+        Je.delete(t), e.terminate()), Promise.resolve();
         var t, e;
     }, t;
 }();
@@ -3009,9 +3022,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 nn(t, e) {
     var n = _getProvider(t, "firestore/lite");
-    if (n.isInitialized()) throw new M(q, "Firestore can only be initialized once per app.");
+    if (n.isInitialized()) throw new U(O, "Firestore can only be initialized once per app.");
     return n.initialize({
         options: e
     });
@@ -3025,7 +3038,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 rn(t) {
     return void 0 === t && (t = s()), _getProvider(t, "firestore/lite").getImmediate();
 }
 
@@ -3041,25 +3054,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 on(t, e, n, r) {
     var i;
     void 0 === r && (r = {});
-    var o = (t = at(t, tn))._getSettings();
-    if ("firestore.googleapis.com" !== o.host && o.host !== e && b("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
+    var o = (t = st(t, en))._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 = d.MOCK_USER; else {
+        if ("string" == typeof r.mockUserToken) a = r.mockUserToken, s = m.MOCK_USER; else {
             // Let createMockUserToken validate first (catches common mistakes like
             // invalid field "uid" and missing field "sub" / "user_id".)
-            a = p(r.mockUserToken, null === (i = t._app) || void 0 === i ? void 0 : i.options.projectId);
+            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(k, "mockUserToken must contain 'sub' or 'user_id' field!");
-            s = new d(u);
+            if (!u) throw new U(V, "mockUserToken must contain 'sub' or 'user_id' field!");
+            s = new m(u);
         }
-        t._authCredentials = new G(new x(a, s));
+        t._authCredentials = new z(new B(a, s));
     }
 }
 
@@ -3082,8 +3095,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 = at(t, tn), u(t.app, "firestore/lite"), t._delete()
+ */ function an(t) {
+    return t = st(t, en), u(t.app, "firestore/lite"), t._delete()
     /**
  * @license
  * Copyright 2020 Google LLC
@@ -3123,7 +3136,7 @@ function $e(t, r) {
  */;
 }
 
-var an = /** @class */ function() {
+var sn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, 
     /**
@@ -3164,14 +3177,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 cn(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() {
+}(), un = /** @class */ function() {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     function t(t, 
@@ -3186,11 +3199,11 @@ var an = /** @class */ function() {
     return t.prototype.withConverter = function(e) {
         return new t(this.firestore, e, this._query);
     }, t;
-}(), un = /** @class */ function(e) {
+}(), cn = /** @class */ function(e) {
     /** @hideconstructor */
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this, t, n, new ae(r)) || this)._path = r, 
+        return (i = e.call(this, t, n, new se(r)) || this)._path = r, 
         /** The type of this Firestore reference. */
         i.type = "collection", i;
     }
@@ -3217,28 +3230,28 @@ var an = /** @class */ function() {
          */
         get: function() {
             var t = this._path.popLast();
-            return t.isEmpty() ? null : new an(this.firestore, 
-            /* converter= */ null, new et(t));
+            return t.isEmpty() ? null : new sn(this.firestore, 
+            /* converter= */ null, new nt(t));
         },
         enumerable: !1,
         configurable: !0
     }), n.prototype.withConverter = function(t) {
         return new n(this.firestore, t, this._path);
     }, n;
-}(sn);
+}(un);
 
 /**
  * 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 ln(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
-    if (t = h(t), nt("collection", "path", e), t instanceof tn) {
-        var o = J.fromString.apply(J, r([ e ], n));
-        return it(o), new un(t, /* converter= */ null, o);
+    if (t = p(t), rt("collection", "path", e), t instanceof en) {
+        var o = Z.fromString.apply(Z, r([ e ], n));
+        return ot(o), new cn(t, /* converter= */ null, o);
     }
-    if (!(t instanceof an || t instanceof un)) throw new M(k, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-    var a = t._path.child(J.fromString.apply(J, r([ e ], n)));
-    return it(a), new un(t.firestore, 
+    if (!(t instanceof sn || t instanceof cn)) throw new U(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 cn(t.firestore, 
     /* converter= */ null, a);
 }
 
@@ -3254,32 +3267,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 = at(t, tn), nt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new M(k, "Invalid collection ID '" + e + "' passed to function collectionGroup(). Collection IDs must not contain '/'.");
-    return new sn(t, 
+ */ function fn(t, e) {
+    if (t = st(t, en), rt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new U(V, "Invalid collection ID '" + e + "' passed to function collectionGroup(). Collection IDs must not contain '/'.");
+    return new un(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 ae(J.emptyPath(), t);
+        return new se(Z.emptyPath(), t);
     }(e));
 }
 
-function fn(t, e) {
+function hn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
-    if (t = h(t), 
+    if (t = p(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = yt.P()), nt("doc", "path", e), t instanceof tn) {
-        var o = J.fromString.apply(J, r([ e ], n));
-        return rt(o), new an(t, 
-        /* converter= */ null, new et(o));
+    1 === arguments.length && (e = vt.P()), rt("doc", "path", e), t instanceof en) {
+        var o = Z.fromString.apply(Z, r([ e ], n));
+        return it(o), new sn(t, 
+        /* converter= */ null, new nt(o));
     }
-    if (!(t instanceof an || t instanceof un)) throw new M(k, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-    var a = t._path.child(J.fromString.apply(J, r([ e ], n)));
-    return rt(a), new an(t.firestore, t instanceof un ? t.converter : null, new et(a));
+    if (!(t instanceof sn || t instanceof cn)) throw new U(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 sn(t.firestore, t instanceof cn ? t.converter : null, new nt(a));
 }
 
 /**
@@ -3289,8 +3302,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 = h(t), e = h(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 pn(t, e) {
+    return t = p(t), e = p(e), (t instanceof sn || t instanceof cn) && (e instanceof sn || e instanceof cn) && 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.
@@ -3302,18 +3315,18 @@ function fn(t, e) {
  */;
 }
 
-function pn(t, e) {
-    return t = h(t), e = h(e), t instanceof sn && e instanceof sn && t.firestore === e.firestore && function(t, e) {
+function dn(t, e) {
+    return t = p(t), e = p(e), t instanceof un && e instanceof un && 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 (!ie(t.orderBy[n], e.orderBy[n])) return !1;
+            for (var n = 0; n < t.orderBy.length; n++) if (!oe(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) || !qt(i.value, o.value)) return !1;
+            i.op !== o.op || !i.field.isEqual(o.field) || !Ot(i.value, o.value)) return !1;
             var i, o;
-            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!oe(t.startAt, e.startAt) && oe(t.endAt, e.endAt);
-        }(he(t), he(e)) && t.limitType === e.limitType;
+            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!ae(t.startAt, e.startAt) && ae(t.endAt, e.endAt);
+        }(pe(t), pe(e)) && t.limitType === e.limitType;
     }(t._query, e._query) && t.converter === e.converter
     /**
  * @license
@@ -3341,7 +3354,7 @@ function pn(t, e) {
  */;
 }
 
-var dn = /** @class */ function() {
+var mn = /** @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.
@@ -3350,8 +3363,8 @@ var dn = /** @class */ function() {
      */
     function t() {
         for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-        for (var n = 0; n < t.length; ++n) if (0 === t[n].length) throw new M(k, "Invalid field name at argument $(i + 1). Field names must not be empty.");
-        this._internalPath = new tt(t);
+        for (var n = 0; n < t.length; ++n) if (0 === t[n].length) throw new U(V, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        this._internalPath = new et(t);
     }
     /**
      * Returns true if this `FieldPath` is equal to the provided one.
@@ -3366,8 +3379,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 yn() {
+    return new mn("__name__");
 }
 
 /**
@@ -3388,7 +3401,7 @@ var dn = /** @class */ function() {
  */
 /**
  * An immutable object representing an array of bytes.
- */ var yn = /** @class */ function() {
+ */ var vn = /** @class */ function() {
     /** @hideconstructor */
     function t(t) {
         this._byteString = t;
@@ -3400,9 +3413,9 @@ var dn = /** @class */ function() {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    return t.fromBase64String = function(e) {
         try {
-            return new t(Et.fromBase64String(e));
+            return new t(It.fromBase64String(e));
         } catch (e) {
-            throw new M(k, "Failed to construct data from Base64 string: " + e);
+            throw new U(V, "Failed to construct data from Base64 string: " + e);
         }
     }, 
     /**
@@ -3411,7 +3424,7 @@ var dn = /** @class */ function() {
      * @param array - The Uint8Array used to create the `Bytes` object.
      */
     t.fromUint8Array = function(e) {
-        return new t(Et.fromUint8Array(e));
+        return new t(It.fromUint8Array(e));
     }, 
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3446,14 +3459,14 @@ var dn = /** @class */ function() {
     t.prototype.isEqual = function(t) {
         return this._byteString.isEqual(t._byteString);
     }, t;
-}(), vn = 
+}(), gn = 
 /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
      */
 function(t) {
     this._methodName = t;
-}, gn = /** @class */ function() {
+}, wn = /** @class */ function() {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3461,8 +3474,8 @@ function(t) {
      * @param longitude - The longitude as number between -180 and 180.
      */
     function t(t, e) {
-        if (!isFinite(t) || t < -90 || t > 90) throw new M(k, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(e) || e < -180 || e > 180) throw new M(k, "Longitude must be a number between -180 and 180, but was: " + e);
+        if (!isFinite(t) || t < -90 || t > 90) throw new U(V, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(e) || e < -180 || e > 180) throw new U(V, "Longitude must be a number between -180 and 180, but was: " + e);
         this._lat = t, this._long = e;
     }
     return Object.defineProperty(t.prototype, "latitude", {
@@ -3504,23 +3517,23 @@ function(t) {
      * with an underscore.
      */
     t.prototype._compareTo = function(t) {
-        return vt(this._lat, t._lat) || vt(this._long, t._long);
+        return gt(this._lat, t._lat) || gt(this._long, t._long);
     }, t;
-}(), wn = /^__.*__$/, bn = /** @class */ function() {
+}(), bn = /^__.*__$/, _n = /** @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 Se(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Te(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new Ee(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Se(t, this.data, e, this.fieldTransforms);
     }, t;
-}(), _n = /** @class */ function() {
+}(), Tn = /** @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 Se(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new Ee(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }, t;
 }();
 
@@ -3543,7 +3556,7 @@ function(t) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ function Tn(t) {
+ */ function Sn(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3557,11 +3570,11 @@ function(t) {
         return !1;
 
       default:
-        throw T();
+        throw S();
     }
 }
 
-/** A "context" object passed around while parsing user data. */ var Sn = /** @class */ function() {
+/** A "context" object passed around while parsing user data. */ var En = /** @class */ function() {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3599,16 +3612,16 @@ function(t) {
         enumerable: !1,
         configurable: !0
     }), 
-    /** Returns a new context with the specified settings overwritten. */ t.prototype.nt = function(e) {
+    /** Returns a new context with the specified settings overwritten. */ t.prototype.et = function(e) {
         return new t(Object.assign(Object.assign({}, this.settings), e), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
-    }, t.prototype.et = function(t) {
-        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.nt({
+    }, t.prototype.nt = function(t) {
+        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.et({
             path: n,
             rt: !1
         });
         return r.st(t), r;
     }, t.prototype.it = function(t) {
-        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.nt({
+        var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.et({
             path: n,
             rt: !1
         });
@@ -3616,12 +3629,12 @@ function(t) {
     }, t.prototype.ot = function(t) {
         // TODO(b/34871131): We don't support array paths right now; so make path
         // undefined.
-        return this.nt({
+        return this.et({
             path: void 0,
             rt: !0
         });
     }, t.prototype.ut = function(t) {
-        return Gn(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
+        return zn(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) {
@@ -3635,19 +3648,19 @@ 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 (Sn(this.tt) && bn.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
     }, t;
-}(), En = /** @class */ function() {
+}(), In = /** @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 || Ke(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 En({
             tt: t,
             methodName: e,
             at: n,
-            path: tt.emptyPath(),
+            path: et.emptyPath(),
             rt: !1,
             ct: r
         }, this.databaseId, this.q, this.ignoreUndefinedProperties);
@@ -3657,30 +3670,30 @@ function(t) {
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ function In(t) {
-    var e = t._freezeSettings(), n = Qe(t._databaseId);
-    return new En(t._databaseId, !!e.ignoreUndefinedProperties, n);
+ */ function An(t) {
+    var e = t._freezeSettings(), n = Ke(t._databaseId);
+    return new In(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function An(t, e, n, r, i, o) {
+/** Parse document data from a set() call. */ function kn(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);
-    Mn("Data must be an object, but it was:", a, r);
-    var s, u, c = Ln(r, a);
-    if (o.merge) s = new St(a.fieldMask), u = a.fieldTransforms; else if (o.mergeFields) {
+    Un("Data must be an object, but it was:", a, r);
+    var s, u, c = Rn(r, a);
+    if (o.merge) s = new Et(a.fieldMask), u = a.fieldTransforms; else if (o.mergeFields) {
         for (var l = [], f = 0, h = o.mergeFields; f < h.length; f++) {
-            var p = Un(e, h[f], n);
-            if (!a.contains(p)) throw new M(k, "Field '" + p + "' is specified in your field mask but missing from your input data.");
-            zn(l, p) || l.push(p);
+            var p = xn(e, h[f], n);
+            if (!a.contains(p)) throw new U(V, "Field '" + p + "' is specified in your field mask but missing from your input data.");
+            Qn(l, p) || l.push(p);
         }
-        s = new St(l), u = a.fieldTransforms.filter((function(t) {
+        s = new Et(l), u = a.fieldTransforms.filter((function(t) {
             return s.covers(t.field);
         }));
     } else s = null, u = a.fieldTransforms;
-    return new bn(new Gt(c), s, u);
+    return new _n(new zt(c), s, u);
 }
 
-var kn = /** @class */ function(e) {
+var Vn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -3692,7 +3705,7 @@ var kn = /** @class */ function(e) {
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(vn);
+}(gn);
 
 /**
  * Creates a child context for parsing SerializableFieldValues.
@@ -3709,8 +3722,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 Dn(t, e, n) {
+    return new En({
         tt: 3 /* Argument */ ,
         at: e.settings.at,
         methodName: t._methodName,
@@ -3718,101 +3731,101 @@ var kn = /** @class */ function(e) {
     }, e.databaseId, e.q, e.ignoreUndefinedProperties);
 }
 
-var Dn = /** @class */ function(e) {
+var Pn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        return new we(t.path, new me);
+        return new be(t.path, new ye);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(vn), Pn = /** @class */ function(e) {
+}(gn), Fn = /** @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 = Dn(this, t, 
         /*array=*/ !0), n = this.lt.map((function(t) {
-            return jn(t, e);
-        })), r = new ye(n);
-        return new we(t.path, r);
+            return Ln(t, e);
+        })), r = new ve(n);
+        return new be(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(vn), Fn = /** @class */ function(e) {
+}(gn), Nn = /** @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 = Dn(this, t, 
         /*array=*/ !0), n = this.lt.map((function(t) {
-            return jn(t, e);
-        })), r = new ve(n);
-        return new we(t.path, r);
+            return Ln(t, e);
+        })), r = new ge(n);
+        return new be(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(vn), Nn = /** @class */ function(e) {
+}(gn), qn = /** @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 ge(t.q, pe(t.q, this.ft));
-        return new we(t.path, e);
+        var e = new we(t.q, de(t.q, this.ft));
+        return new be(t.path, e);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(vn);
+}(gn);
 
-/** Parse update data from an update() call. */ function qn(t, e, n, r) {
+/** Parse update data from an update() call. */ function On(t, e, n, r) {
     var i = t.ht(1 /* Update */ , e, n);
-    Mn("Data must be an object, but it was:", i, r);
-    var o = [], a = Gt.empty();
-    Tt(r, (function(t, r) {
-        var s = Bn(e, t, n);
+    Un("Data must be an object, but it was:", i, r);
+    var o = [], a = zt.empty();
+    St(r, (function(t, r) {
+        var s = Gn(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                r = h(r);
+                r = p(r);
         var u = i.it(s);
-        if (r instanceof kn) 
+        if (r instanceof Vn) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(s); else {
-            var c = jn(r, u);
+            var c = Ln(r, u);
             null != c && (o.push(s), a.set(s, c));
         }
     }));
-    var s = new St(o);
-    return new _n(a, s, i.fieldTransforms);
+    var s = new Et(o);
+    return new Tn(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 = [ Un(e, r, n) ], u = [ i ];
-    if (o.length % 2 != 0) throw new M(k, "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(Un(e, o[c])), u.push(o[c + 1]);
+/** Parse update data from a list of field/value arguments. */ function Cn(t, e, n, r, i, o) {
+    var a = t.ht(1 /* Update */ , e, n), s = [ xn(e, r, n) ], u = [ i ];
+    if (o.length % 2 != 0) throw new U(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(xn(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 = Gt.empty(), p = s.length - 1; p >= 0; --p) if (!zn(l, s[p])) {
-        var d = s[p], m = u[p];
+    for (var l = [], f = zt.empty(), h = s.length - 1; h >= 0; --h) if (!Qn(l, s[h])) {
+        var d = s[h], m = u[h];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-        m = h(m);
+        m = p(m);
         var y = a.it(d);
-        if (m instanceof kn) 
+        if (m instanceof Vn) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(d); else {
-            var v = jn(m, y);
+            var v = Ln(m, y);
             null != v && (l.push(d), f.set(d, v));
         }
     }
-    var g = new St(l);
-    return new _n(f, g, a.fieldTransforms);
+    var g = new Et(l);
+    return new Tn(f, g, a.fieldTransforms);
 }
 
 /**
@@ -3821,8 +3834,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 jn(t, e, n, r) {
+    return void 0 === r && (r = !1), Ln(n, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -3833,12 +3846,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 Ln(t, e) {
+    if (Mn(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = h(t))) return Mn("Unsupported field value:", e, t), Ln(t, e);
-    if (t instanceof vn) 
+    t = p(t))) return Un("Unsupported field value:", e, t), Rn(t, e);
+    if (t instanceof gn) 
     // FieldValues usually parse into transforms (except FieldValue.delete())
     // in which case we do not want to include this field in our parsed data
     // (as doing so will overwrite the field directly prior to the transform
@@ -3850,7 +3863,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 (!Sn(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);
@@ -3873,7 +3886,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 = Ln(o[i], e.ot(r));
                 null == a && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -3889,10 +3902,10 @@ var Dn = /** @class */ function(e) {
         }(t, e);
     }
     return function(t, e) {
-        if (null === (t = h(t))) return {
+        if (null === (t = p(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return pe(e.q, t);
+        if ("number" == typeof t) return de(e.q, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -3900,41 +3913,41 @@ var Dn = /** @class */ function(e) {
             stringValue: t
         };
         if (t instanceof Date) {
-            var n = wt.fromDate(t);
+            var n = bt.fromDate(t);
             return {
-                timestampValue: De(e.q, n)
+                timestampValue: Pe(e.q, n)
             };
         }
-        if (t instanceof wt) {
+        if (t instanceof bt) {
             // Firestore backend truncates precision down to microseconds. To ensure
             // offline mode works the same with regards to truncation, perform the
             // truncation immediately without waiting for the backend to do that.
-            var r = new wt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            var r = new bt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: De(e.q, r)
+                timestampValue: Pe(e.q, r)
             };
         }
-        if (t instanceof gn) return {
+        if (t instanceof wn) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof yn) return {
-            bytesValue: Pe(e.q, t._byteString)
+        if (t instanceof vn) return {
+            bytesValue: Fe(e.q, t._byteString)
         };
-        if (t instanceof an) {
+        if (t instanceof sn) {
             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: qe(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: Oe(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.ut("Unsupported field value: " + ot(t));
+        throw e.ut("Unsupported field value: " + at(t));
     }(t, e);
 }
 
-function Ln(t, e) {
+function Rn(t, e) {
     var n = {};
     return function(t) {
         for (var e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
@@ -3942,8 +3955,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) : Tt(t, (function(t, r) {
-        var i = jn(r, e.et(t));
+    e.path && e.path.length > 0 && e.fieldMask.push(e.path) : St(t, (function(t, r) {
+        var i = Ln(r, e.nt(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -3952,35 +3965,35 @@ function Ln(t, e) {
     };
 }
 
-function Rn(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof wt || t instanceof gn || t instanceof yn || t instanceof an || t instanceof vn);
+function Mn(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof bt || t instanceof wn || t instanceof vn || t instanceof sn || t instanceof gn);
 }
 
-function Mn(t, e, n) {
-    if (!Rn(n) || !function(t) {
+function Un(t, e, n) {
+    if (!Mn(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
-        var r = ot(n);
+        var r = at(n);
         throw "an object" === r ? e.ut(t + " a custom object") : e.ut(t + " " + r);
     }
 }
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function Un(t, e, n) {
+ */ function xn(t, e, n) {
     if (
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    (e = h(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 FieldPath.", t, 
+    (e = p(e)) instanceof mn) return e._internalPath;
+    if ("string" == typeof e) return Gn(t, e);
+    throw zn("Field path arguments must be of type string or FieldPath.", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
 }
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ var xn = new RegExp("[~\\*/\\[\\]]");
+ */ var Bn = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -3990,29 +4003,29 @@ function Mn(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(xn) >= 0) throw Gn("Invalid field path (" + e + "). Paths must not contain '~', '*', '/', '[', or ']'", t, 
+ */ function Gn(t, e, n) {
+    if (e.search(Bn) >= 0) throw zn("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 (mn.bind.apply(mn, 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 zn("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 zn(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 = "";
     return (o || a) && (u += " (found", o && (u += " in field " + r), a && (u += " in document " + i), 
-    u += ")"), new M(k, (s += ". ") + t + u)
+    u += ")"), new U(V, (s += ". ") + t + u)
     /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */;
 }
 
-function zn(t, e) {
+function Qn(t, e) {
     return t.some((function(t) {
         return t.isEqual(e);
     }));
@@ -4042,7 +4055,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 Kn = /** @class */ function() {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4063,7 +4076,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 sn(this._firestore, this._converter, this._key);
         },
         enumerable: !1,
         configurable: !0
@@ -4088,7 +4101,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 Hn(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4108,11 +4121,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($n("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }, t;
-}(), Kn = /** @class */ function(e) {
+}(), Hn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4124,7 +4137,7 @@ function zn(t, e) {
      */    return t(n, e), n.prototype.data = function() {
         return e.prototype.data.call(this);
     }, n;
-}(Qn), Hn = /** @class */ function() {
+}(Kn), Wn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._docs = e, this.query = t;
@@ -4178,15 +4191,15 @@ function zn(t, e) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */
-function Wn(t, e) {
-    return t = h(t), e = h(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) && gt(t.docs, e.docs, Wn)
+function Yn(t, e) {
+    return t = p(t), e = p(e), t instanceof Kn && e instanceof Kn ? 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 Wn && e instanceof Wn && dn(t.query, e.query) && wt(t.docs, e.docs, Yn)
     /**
  * 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 $n(t, e) {
+    return "string" == typeof e ? Gn(t, e) : e instanceof mn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4212,7 +4225,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 Xn = function() {};
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4222,7 +4235,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 Jn(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];
@@ -4231,39 +4244,39 @@ function Yn(t, e) {
     return t;
 }
 
-var Jn = /** @class */ function(e) {
+var Zn = /** @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 = In(t.firestore), n = function(t, e, n, r, i, o, a) {
+        var e = An(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(k, "Invalid Query. You can't perform '" + o + "' queries on FieldPath.documentId().");
+                if ("array-contains" /* ARRAY_CONTAINS */ === o || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === o) throw new U(V, "Invalid Query. You can't perform '" + o + "' queries on FieldPath.documentId().");
                 if ("in" /* IN */ === o || "not-in" /* NOT_IN */ === o) {
-                    pr(a, o);
+                    dr(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(pr(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 = pr(r, t, a);
+            } else "in" /* IN */ !== o && "not-in" /* NOT_IN */ !== o && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== o || dr(a, o), 
+            s = jn(n, "where", a, 
             /* allowArrays= */ "in" /* IN */ === o || "not-in" /* NOT_IN */ === o);
-            var h = Ht.create(i, o, s);
+            var h = Wt.create(i, o, s);
             return function(t, e) {
                 if (e.N()) {
-                    var n = ce(t);
-                    if (null !== n && !n.isEqual(e.field)) throw new M(k, "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 = ue(t);
-                    null !== r && dr(t, e.field, r);
+                    var n = le(t);
+                    if (null !== n && !n.isEqual(e.field)) throw new U(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 && mr(t, e.field, r);
                 }
                 var i = function(t, e) {
                     for (var n = 0, r = t.filters; n < r.length; n++) {
@@ -4307,15 +4320,15 @@ var Jn = /** @class */ function(e) {
                 }(e.op));
                 if (null !== i) 
                 // Special case when it's a duplicate op to give a slightly clearer error message.
-                throw i === e.op ? new M(k, "Invalid query. You cannot use more than one '" + e.op.toString() + "' filter.") : new M(k, "Invalid query. You cannot use '" + e.op.toString() + "' filters with '" + i.toString() + "' filters.");
+                throw i === e.op ? new U(V, "Invalid query. You cannot use more than one '" + e.op.toString() + "' filter.") : new U(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 un(t.firestore, t.converter, function(t, e) {
             var n = t.filters.concat([ e ]);
-            return new ae(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+            return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }, n;
-}($n);
+}(Xn);
 
 /**
  * Creates a {@link QueryConstraint} that enforces that documents must contain the
@@ -4327,36 +4340,36 @@ 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 tr(t, e, n) {
+    var r = e, i = $n("where", t);
+    return new Zn(i, r, n);
 }
 
-var tr = /** @class */ function(e) {
+var er = /** @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;
     }
     return t(n, e), n.prototype._apply = function(t) {
         var e = function(t, e, n) {
-            if (null !== t.startAt) throw new M(k, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
-            if (null !== t.endAt) throw new M(k, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            var r = new re(e, n);
+            if (null !== t.startAt) throw new U(V, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new U(V, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            var r = new ie(e, n);
             return function(t, e) {
-                if (null === ue(t)) {
+                if (null === ce(t)) {
                     // This is the first order by. It must match any inequality.
-                    var n = ce(t);
-                    null !== n && dr(t, n, e.field);
+                    var n = le(t);
+                    null !== n && mr(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 un(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 ae(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new se(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }, n;
-}($n);
+}(Xn);
 
 /**
  * Creates a {@link QueryConstraint} that sorts the query result by the
@@ -4366,31 +4379,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 nr(t, e) {
     void 0 === e && (e = "asc");
-    var n = e, r = Yn("orderBy", t);
-    return new tr(r, n);
+    var n = e, r = $n("orderBy", t);
+    return new er(r, n);
 }
 
-var nr = /** @class */ function(e) {
+var rr = /** @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 ae(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
-        }(t._query, this.gt, this.bt));
+        return new un(t.firestore, t.converter, function(t, e, n) {
+            return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        }(t._query, this.gt, this.vt));
     }, n;
-}($n);
+}(Xn);
 
 /**
  * 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 st("limit", t), new nr("limit", t, "F" /* First */)
+ */ function ir(t) {
+    return ut("limit", t), new rr("limit", t, "F" /* First */)
     /**
  * Creates a {@link QueryConstraint} that only returns the last matching documents.
  *
@@ -4402,60 +4415,60 @@ var nr = /** @class */ function(e) {
  */;
 }
 
-function ir(t) {
-    return st("limitToLast", t), new nr("limitToLast", t, "L" /* Last */);
+function or(t) {
+    return ut("limitToLast", t), new rr("limitToLast", t, "L" /* Last */);
 }
 
-var or = /** @class */ function(e) {
+var ar = /** @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 ae(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+        var e = hr(t, this.type, this.bt, this.Et);
+        return new un(t.firestore, t.converter, function(t, e) {
+            return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }, n;
-}($n);
+}(Xn);
 
-function ar() {
+function sr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new or("startAt", t, /*before=*/ !0);
+    return new ar("startAt", t, /*before=*/ !0);
 }
 
-function sr() {
+function ur() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new or("startAfter", t, 
+    return new ar("startAfter", t, 
     /*before=*/ !1);
 }
 
-var ur = /** @class */ function(e) {
+var cr = /** @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 ae(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+        var e = hr(t, this.type, this.bt, this.Et);
+        return new un(t.firestore, t.converter, function(t, e) {
+            return new se(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }, n;
-}($n);
+}(Xn);
 
-function cr() {
+function lr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new ur("endBefore", t, /*before=*/ !0);
+    return new cr("endBefore", t, /*before=*/ !0);
 }
 
-function lr() {
+function fr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new ur("endAt", t, /*before=*/ !1);
+    return new cr("endAt", t, /*before=*/ !1);
 }
 
-/** Helper function to create a bound from a document or fields */ function fr(t, e, n, r) {
-    if (n[0] = h(n[0]), n[0] instanceof Qn) return function(t, e, n, r, i) {
-        if (!r) throw new M(D, "Can't use a DocumentSnapshot that doesn't exist for " + n + "().");
+/** Helper function to create a bound from a document or fields */ function hr(t, e, n, r) {
+    if (n[0] = p(n[0]), n[0] instanceof Kn) return function(t, e, n, r, i) {
+        if (!r) throw new U(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
         // sort order, because it's guaranteed to contain the document key. That way
@@ -4463,65 +4476,65 @@ 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 = fe(t); a < s.length; a++) {
+        for (var o = [], a = 0, s = he(t); a < s.length; a++) {
             var u = s[a];
-            if (u.field.isKeyField()) o.push(Lt(e, r.key)); else {
+            if (u.field.isKeyField()) o.push(Rt(e, r.key)); else {
                 var c = r.data.field(u.field);
-                if (Dt(c)) throw new M(k, '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 (Pt(c)) throw new U(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(k, "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.");
+                    throw new U(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.");
                 }
                 o.push(c);
             }
         }
-        return new ne(o, i);
+        return new re(o, i);
     }(t._query, t.firestore._databaseId, e, n[0]._document, r);
-    var i = In(t.firestore);
+    var i = An(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;
-        if (i.length > a.length) throw new M(k, "Too many arguments provided to " + r + "(). The number of arguments must be less than or equal to the number of orderBy() clauses");
+        if (i.length > a.length) throw new U(V, "Too many arguments provided to " + r + "(). The number of arguments must be less than or equal to the number of orderBy() clauses");
         for (var s = [], u = 0; u < i.length; u++) {
             var c = i[u];
             if (a[u].field.isKeyField()) {
-                if ("string" != typeof c) throw new M(k, "Invalid query. Expected a string for document ID in " + r + "(), but got a " + typeof c);
-                if (!le(t) && -1 !== c.indexOf("/")) throw new M(k, "Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to " + r + "() must be a plain document ID, but '" + c + "' contains a slash.");
-                var l = t.path.child(J.fromString(c));
-                if (!et.isDocumentKey(l)) throw new M(k, "Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to " + r + "() must result in a valid document path, but '" + l + "' is not because it contains an odd number of segments.");
-                var f = new et(l);
-                s.push(Lt(e, f));
+                if ("string" != typeof c) throw new U(V, "Invalid query. Expected a string for document ID in " + r + "(), but got a " + typeof c);
+                if (!fe(t) && -1 !== c.indexOf("/")) throw new U(V, "Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to " + r + "() must be a plain document ID, but '" + c + "' contains a slash.");
+                var l = t.path.child(Z.fromString(c));
+                if (!nt.isDocumentKey(l)) throw new U(V, "Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to " + r + "() must result in a valid document path, but '" + l + "' is not because it contains an odd number of segments.");
+                var f = new nt(l);
+                s.push(Rt(e, f));
             } else {
-                var h = Cn(n, r, c);
+                var h = jn(n, r, c);
                 s.push(h);
             }
         }
-        return new ne(s, o);
+        return new re(s, o);
     }(t._query, t.firestore._databaseId, i, e, n, r);
 }
 
-function hr(t, e, n) {
-    if ("string" == typeof (n = h(n))) {
-        if ("" === n) throw new M(k, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!le(e) && -1 !== n.indexOf("/")) throw new M(k, "Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '" + n + "' contains a '/' character.");
-        var r = e.path.child(J.fromString(n));
-        if (!et.isDocumentKey(r)) throw new M(k, "Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '" + r + "' is not because it has an odd number of segments (" + r.length + ").");
-        return Lt(t, new et(r));
+function pr(t, e, n) {
+    if ("string" == typeof (n = p(n))) {
+        if ("" === n) throw new U(V, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!fe(e) && -1 !== n.indexOf("/")) throw new U(V, "Invalid query. When querying a collection by FieldPath.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 U(V, "Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '" + r + "' is not because it has an odd number of segments (" + r.length + ").");
+        return Rt(t, new nt(r));
     }
-    if (n instanceof an) return Lt(t, n._key);
-    throw new M(k, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: " + ot(n) + ".");
+    if (n instanceof sn) return Rt(t, n._key);
+    throw new U(V, "Invalid query. When querying with FieldPath.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) {
-    if (!Array.isArray(t) || 0 === t.length) throw new M(k, "Invalid Query. A non-empty array is required for '" + e.toString() + "' filters.");
-    if (t.length > 10) throw new M(k, "Invalid Query. '" + e.toString() + "' filters support a maximum of 10 elements in the value array.");
+ */ function dr(t, e) {
+    if (!Array.isArray(t) || 0 === t.length) throw new U(V, "Invalid Query. A non-empty array is required for '" + e.toString() + "' filters.");
+    if (t.length > 10) throw new U(V, "Invalid Query. '" + e.toString() + "' filters support a maximum of 10 elements in the value array.");
 }
 
-function dr(t, e, n) {
-    if (!n.isEqual(e)) throw new M(k, "Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '" + e.toString() + "' and so you must also use '" + e.toString() + "' as your first argument to orderBy(), but your first orderBy() is on field '" + n.toString() + "' instead.");
+function mr(t, e, n) {
+    if (!n.isEqual(e)) throw new U(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.");
 }
 
 /**
@@ -4570,28 +4583,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 yr(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 vr = /** @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 vn(t);
     }, n.prototype.convertReference = function(t) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new an(this.firestore, /* converter= */ null, e);
+        return new sn(this.firestore, /* converter= */ null, e);
     }, n;
 }(/** @class */ function() {
     function t() {}
     return t.prototype.convertValue = function(t, e) {
-        switch (void 0 === e && (e = "none"), Nt(t)) {
+        switch (void 0 === e && (e = "none"), qt(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -4599,7 +4612,7 @@ var yr = /** @class */ function(e) {
             return t.booleanValue;
 
           case 2 /* NumberValue */ :
-            return kt(t.integerValue || t.doubleValue);
+            return Vt(t.integerValue || t.doubleValue);
 
           case 3 /* TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -4611,7 +4624,7 @@ var yr = /** @class */ function(e) {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(Vt(t.bytesValue));
+            return this.convertBytes(Dt(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -4626,15 +4639,15 @@ var yr = /** @class */ function(e) {
             return this.convertObject(t.mapValue, e);
 
           default:
-            throw T();
+            throw S();
         }
     }, t.prototype.convertObject = function(t, e) {
         var n = this, r = {};
-        return Tt(t.fields, (function(t, i) {
+        return St(t.fields, (function(t, i) {
             r[t] = n.convertValue(i, e);
         })), r;
     }, t.prototype.convertGeoPoint = function(t) {
-        return new gn(kt(t.latitude), kt(t.longitude));
+        return new wn(Vt(t.latitude), Vt(t.longitude));
     }, t.prototype.convertArray = function(t, e) {
         var n = this;
         return (t.values || []).map((function(t) {
@@ -4643,25 +4656,25 @@ var yr = /** @class */ function(e) {
     }, t.prototype.convertServerTimestamp = function(t, e) {
         switch (e) {
           case "previous":
-            var n = Pt(t);
+            var n = Ft(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Ft(t));
+            return this.convertTimestamp(Nt(t));
 
           default:
             return null;
         }
     }, t.prototype.convertTimestamp = function(t) {
-        var e = At(t);
-        return new wt(e.seconds, e.nanos);
+        var e = kt(t);
+        return new bt(e.seconds, e.nanos);
     }, t.prototype.convertDocumentKey = function(t, e) {
-        var n = J.fromString(t);
-        S(ze(n));
-        var r = new $(n.get(1), n.get(3)), i = new et(n.popFirst(5));
+        var n = Z.fromString(t);
+        E(Qe(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.
-        w("Document " + i + " contains a document reference within a different database (" + r.projectId + "/" + r.database + ") which is not supported. It will be treated as a reference in the current database (" + e.projectId + "/" + e.database + ") instead."), 
+        b("Document " + i + " contains a document reference within a different database (" + r.projectId + "/" + r.database + ") which is not supported. It will be treated as a reference in the current database (" + e.projectId + "/" + e.database + ") instead."), 
         i;
     }, t;
 }());
@@ -4678,12 +4691,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 = at(t, an)).firestore), n = new yr(t.firestore);
-    return Ye(e, [ t._key ]).then((function(e) {
-        S(1 === e.length);
+ */ function gr(t) {
+    var e = Ze((t = st(t, sn)).firestore), n = new vr(t.firestore);
+    return $e(e, [ t._key ]).then((function(e) {
+        E(1 === e.length);
         var r = e[0];
-        return new Qn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new Kn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -4698,35 +4711,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 wr(t) {
     !function(t) {
-        if (se(t) && 0 === t.explicitOrderBy.length) throw new M(j, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = at(t, sn))._query);
-    var e = Je(t.firestore), n = new yr(t.firestore);
-    return $e(e, t._query).then((function(e) {
+        if (ue(t) && 0 === t.explicitOrderBy.length) throw new U(L, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = st(t, un))._query);
+    var e = Ze(t.firestore), n = new vr(t.firestore);
+    return Xe(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 Hn(t.firestore, n, e.key, e, t.converter);
         }));
-        return se(t._query) && 
+        return ue(t._query) && 
         // Limit to last queries reverse the orderBy constraint that was
         // specified by the user. As such, we need to reverse the order of the
         // results to return the documents in the expected order.
-        r.reverse(), new Hn(t, r);
+        r.reverse(), new Wn(t, r);
     }));
 }
 
-function wr(t, e, n) {
-    var r = mr((t = at(t, an)).converter, e, n), i = An(In(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return We(Je(t.firestore), [ i.toMutation(t._key, be.none()) ]);
+function br(t, e, n) {
+    var r = yr((t = st(t, sn)).converter, e, n), i = kn(An(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return Ye(Ze(t.firestore), [ i.toMutation(t._key, _e.none()) ]);
 }
 
-function br(t, e, n) {
+function _r(t, e, n) {
     for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-    var o, a = In((t = at(t, an)).firestore);
+    var o, a = An((t = st(t, sn)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-        return o = "string" == typeof (e = h(e)) || e instanceof dn ? On(a, "updateDoc", t._key, e, n, r) : qn(a, "updateDoc", t._key, e), 
-    We(Je(t.firestore), [ o.toMutation(t._key, be.exists(!0)) ]);
+        return o = "string" == typeof (e = p(e)) || e instanceof mn ? Cn(a, "updateDoc", t._key, e, n, r) : On(a, "updateDoc", t._key, e), 
+    Ye(Ze(t.firestore), [ o.toMutation(t._key, _e.exists(!0)) ]);
 }
 
 /**
@@ -4740,8 +4753,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 = at(t, an)).firestore), [ new Ee(t._key, be.none()) ]);
+ */ function Tr(t) {
+    return Ye(Ze((t = st(t, sn)).firestore), [ new Ie(t._key, _e.none()) ]);
 }
 
 /**
@@ -4755,11 +4768,12 @@ function br(t, e, n) {
  *
  * @param reference - A reference to the collection to add this document to.
  * @param data - An Object containing the data for the new document.
+ * @throws Error - If the provided input is not a valid Firestore document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function Tr(t, e) {
-    var n = fn(t = at(t, un)), r = mr(t.converter, e), i = An(In(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return We(Je(t.firestore), [ i.toMutation(n._key, be.exists(!1)) ]).then((function() {
+ */ function Sr(t, e) {
+    var n = hn(t = st(t, cn)), r = yr(t.converter, e), i = kn(An(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return Ye(Ze(t.firestore), [ i.toMutation(n._key, _e.exists(!1)) ]).then((function() {
         return n;
     }));
 }
@@ -4783,15 +4797,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 Er() {
+    return new Vn("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 Ir() {
+    return new Pn("serverTimestamp");
 }
 
 /**
@@ -4805,11 +4819,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 Ir() {
+ */ function Ar() {
     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 Fn("arrayUnion", t);
 }
 
 /**
@@ -4822,11 +4836,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 Ar() {
+ */ function kr() {
     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 Fn("arrayRemove", t);
+        return new Nn("arrayRemove", t);
 }
 
 /**
@@ -4847,8 +4861,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 Nn("increment", t);
+ */ function Vr(t) {
+    return new qn("increment", t);
 }
 
 /**
@@ -4874,24 +4888,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 Dr = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = In(t);
+        this._dataReader = An(t);
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = Dr(t, this._firestore), i = mr(r.converter, e, n), o = An(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
-        return this._mutations.push(o.toMutation(r._key, be.none())), this;
+        var r = Pr(t, this._firestore), i = yr(r.converter, e, n), o = kn(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
+        return this._mutations.push(o.toMutation(r._key, _e.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 = Pr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = h(e)) || e instanceof dn ? On(this._dataReader, "WriteBatch.update", a._key, e, n, r) : qn(this._dataReader, "WriteBatch.update", a._key, e), 
-        this._mutations.push(o.toMutation(a._key, be.exists(!0))), this;
+                return o = "string" == typeof (e = p(e)) || e instanceof mn ? Cn(this._dataReader, "WriteBatch.update", a._key, e, n, r) : On(this._dataReader, "WriteBatch.update", a._key, e), 
+        this._mutations.push(o.toMutation(a._key, _e.exists(!0))), this;
     }, 
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -4901,8 +4915,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 Ee(e._key, be.none())), this;
+        var e = Pr(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Ie(e._key, _e.none())), this;
     }, 
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -4919,12 +4933,12 @@ 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(q, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new U(O, "A write batch can no longer be used after commit() has been called.");
     }, t;
 }();
 
-function Dr(t, e) {
-    if ((t = h(t)).firestore !== e) throw new M(k, "Provided document reference is from a different Firestore instance.");
+function Pr(t, e) {
+    if ((t = p(t)).firestore !== e) throw new U(V, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -4940,10 +4954,10 @@ function Dr(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Pr(t) {
-    var e = Je(t = at(t, tn));
-    return new Vr(t, (function(t) {
-        return We(e, t);
+ */ function Fr(t) {
+    var e = Ze(t = st(t, en));
+    return new Dr(t, (function(t) {
+        return Ye(e, t);
     }));
 }
 
@@ -4966,7 +4980,7 @@ function Dr(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ var Fr = /** @class */ function() {
+ */ var Nr = /** @class */ function() {
     function t(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -4990,8 +5004,8 @@ function Dr(t, e) {
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new M(k, "Firestore transactions require all reads to be executed before all writes.");
-                    return [ 4 /*yield*/ , Ye(this.datastore, t) ];
+                    if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(V, "Firestore transactions require all reads to be executed before all writes.");
+                    return [ 4 /*yield*/ , $e(this.datastore, t) ];
 
                   case 1:
                     return [ 2 /*return*/ , ((e = n.sent()).forEach((function(t) {
@@ -5010,7 +5024,7 @@ function Dr(t, e) {
         }
         this.writtenDocs.add(t.toString());
     }, t.prototype.delete = function(t) {
-        this.write(new Ee(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Ie(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;
@@ -5026,9 +5040,9 @@ function Dr(t, e) {
                     // For each document that was read but not written to, we want to perform
                     // a `verify` operation.
                     t.forEach((function(t, n) {
-                        var r = et.fromPath(n);
-                        e.mutations.push(new Ie(r, e.precondition(r)));
-                    })), [ 4 /*yield*/ , We(this.datastore, this.mutations) ];
+                        var r = nt.fromPath(n);
+                        e.mutations.push(new Ae(r, e.precondition(r)));
+                    })), [ 4 /*yield*/ , Ye(this.datastore, this.mutations) ];
 
                   case 1:
                     // For each mutation, note that the doc was written.
@@ -5039,15 +5053,15 @@ function Dr(t, e) {
     }, t.prototype.recordVersion = function(t) {
         var e;
         if (t.isFoundDocument()) e = t.version; else {
-            if (!t.isNoDocument()) throw T();
+            if (!t.isNoDocument()) throw S();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
-                        e = bt.min();
+                        e = _t.min();
         }
         var n = this.readVersions.get(t.key.toString());
         if (n) {
             if (!e.isEqual(n)) 
             // This transaction will fail no matter what.
-            throw new M(O, "Document version changed between two reads.");
+            throw new U(C, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }, 
     /**
@@ -5056,7 +5070,7 @@ function Dr(t, e) {
      */
     t.prototype.precondition = function(t) {
         var e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? be.updateTime(e) : be.none();
+        return !this.writtenDocs.has(t.toString()) && e ? _e.updateTime(e) : _e.none();
     }, 
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5066,7 +5080,7 @@ function Dr(t, e) {
         // The first time a document is written, we want to take into account the
         // read time and existence
                 if (!this.writtenDocs.has(t.toString()) && e) {
-            if (e.isEqual(bt.min())) 
+            if (e.isEqual(_t.min())) 
             // The document doesn't exist, so fail the transaction.
             // This has to be validated locally because you can't send a
             // precondition that a document does not exist without changing the
@@ -5076,20 +5090,20 @@ function Dr(t, e) {
             // express that to the backend, we have to validate locally.
             // Note: this can change once we can send separate verify writes in the
             // transaction.
-            throw new M(k, "Can't update a document that doesn't exist.");
+            throw new U(V, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return be.updateTime(e);
+                        return _e.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-                return be.exists(!0);
+                return _e.exists(!0);
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), Nr = /** @class */ function() {
+}(), qr = /** @class */ function() {
     function t(t, e, n, r) {
         this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = r, 
-        this.Tt = 5, this.It = new Ke(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
+        this.Tt = 5, this.It = new He(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.run = function() {
@@ -5100,7 +5114,7 @@ function Dr(t, e) {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new Fr(this.datastore), (e = this.Pt(t)) && e.then((function(e) {
+                    return t = new Nr(this.datastore), (e = this.Pt(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
@@ -5117,7 +5131,7 @@ function Dr(t, e) {
     }, t.prototype.Pt = function(t) {
         try {
             var e = this.updateFunction(t);
-            return !ut(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !ct(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
             null);
         } catch (t) {
             // Do not retry errors thrown by user provided updateFunction.
@@ -5143,30 +5157,30 @@ function Dr(t, e) {
             function(t) {
                 switch (t) {
                   default:
-                    return T();
+                    return S();
 
-                  case I:
                   case A:
-                  case V:
-                  case N:
-                  case L:
+                  case k:
+                  case D:
+                  case q:
                   case R:
+                  case M:
  // Unauthenticated means something went wrong with our token and we need
                     // to retry with new credentials which will happen automatically.
-                                      case F:
+                                      case N:
                     return !1;
 
-                  case k:
-                  case D:
-                  case "already-exists":
+                  case V:
                   case P:
-                  case q:
+                  case "already-exists":
+                  case F:
+                  case O:
  // 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 O:
-                  case C:
+                                      case C:
                   case j:
+                  case L:
                   case "data-loss":
                     return !0;
                 }
@@ -5212,7 +5226,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 qr() {
+/** The Platform's 'document' implementation or null if not available. */ function Or() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5244,10 +5258,10 @@ 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 Or = /** @class */ function() {
+ */ var Cr = /** @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), 
+        this.deferred = new x, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
         // It's normal for the deferred promise to be canceled (due to cancellation)
         // and so we attach a dummy catch callback to avoid
         // 'UnhandledPromiseRejectionWarning' log spam.
@@ -5296,7 +5310,7 @@ function Dr(t, e) {
      * guarantee that the operation will not be run.
      */
     t.prototype.cancel = function(t) {
-        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new M(I, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new U(A, "Operation cancelled" + (t ? ": " + t : ""))));
     }, t.prototype.handleDelayElapsed = function() {
         var t = this;
         this.asyncQueue.enqueueAndForget((function() {
@@ -5308,7 +5322,7 @@ function Dr(t, e) {
         null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle), 
         this.timerHandle = null);
     }, t;
-}(), Cr = /** @class */ function() {
+}(), jr = /** @class */ function() {
     function t() {
         var t = this;
         // The last promise in the queue.
@@ -5326,21 +5340,21 @@ function Dr(t, e) {
         this.St = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.qt = !1, 
-        // Enabled during shutdown on Safari to prevent future access to IndexedDB.
         this.xt = !1, 
+        // Enabled during shutdown on Safari to prevent future access to IndexedDB.
+        this.qt = !1, 
         // List of TimerIds to fast-forward delays for.
         this.Ot = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new Ke(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new He(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 = qr();
-            e && g("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.It.H();
+            var e = Or();
+            e && w("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.It.H();
         };
-        var e = qr();
+        var e = Or();
         e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Ct);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
@@ -5363,8 +5377,8 @@ function Dr(t, e) {
         this.Ut(t);
     }, t.prototype.enterRestrictedMode = function(t) {
         if (!this.$t) {
-            this.$t = !0, this.xt = t || !1;
-            var e = qr();
+            this.$t = !0, this.qt = t || !1;
+            var e = Or();
             e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ct);
         }
     }, t.prototype.enqueue = function(t) {
@@ -5375,9 +5389,9 @@ function Dr(t, e) {
         // 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;
+                var n = new x;
         return this.Ut((function() {
-            return e.$t && e.xt ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
+            return e.$t && e.qt ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
         })).then((function() {
             return n.promise;
         }));
@@ -5409,7 +5423,7 @@ function Dr(t, e) {
                   case 3:
                     if (t = n.sent(), "IndexedDbTransactionError" !== t.name) throw t;
                     // Failure will be handled by AsyncQueue
-                                        return g("AsyncQueue", "Operation failed with retryable error: " + t), 
+                                        return w("AsyncQueue", "Operation failed with retryable error: " + t), 
                     [ 3 /*break*/ , 4 ];
 
                   case 4:
@@ -5435,8 +5449,8 @@ function Dr(t, e) {
         }));
     }, t.prototype.Ut = function(t) {
         var e = this, n = this.Dt.then((function() {
-            return e.qt = !0, t().catch((function(t) {
-                e.St = t, e.qt = !1;
+            return e.xt = !0, t().catch((function(t) {
+                e.St = t, e.xt = !1;
                 var n = 
                 /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -5451,9 +5465,9 @@ function Dr(t, e) {
                 // Re-throw the error so that this.tail becomes a rejected Promise and
                 // all further attempts to chain (via .then) will just short-circuit
                 // and return the rejected Promise.
-                                throw w("INTERNAL UNHANDLED ERROR: ", n), t;
+                                throw b("INTERNAL UNHANDLED ERROR: ", n), t;
             })).then((function(t) {
-                return e.qt = !1, t;
+                return e.xt = !1, t;
             }));
         }));
         return this.Dt = n, n;
@@ -5462,12 +5476,12 @@ function Dr(t, e) {
         this.Lt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ot.indexOf(t) > -1 && (e = 0);
-        var i = Or.createAndSchedule(this, t, e, n, (function(t) {
+        var i = Cr.createAndSchedule(this, t, e, n, (function(t) {
             return r.jt(t);
         }));
         return this.Ft.push(i), i;
     }, t.prototype.Lt = function() {
-        this.St && T();
+        this.St && S();
     }, t.prototype.verifyOperationInProgress = function() {}, 
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
@@ -5537,10 +5551,10 @@ function Dr(t, e) {
         var e = this.Ft.indexOf(t);
         this.Ft.splice(e, 1);
     }, t;
-}(), jr = /** @class */ function() {
+}(), Lr = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = In(t)
+        this._firestore = t, this._transaction = e, this._dataReader = An(t)
         /**
      * Reads the document referenced by the provided {@link DocumentReference}.
      *
@@ -5549,23 +5563,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 = Pr(t, this._firestore), r = new vr(this._firestore);
         return this._transaction.lookup([ n._key ]).then((function(t) {
-            if (!t || 1 !== t.length) return T();
+            if (!t || 1 !== t.length) return S();
             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 T();
+            if (i.isFoundDocument()) return new Kn(e._firestore, r, i.key, i, n.converter);
+            if (i.isNoDocument()) return new Kn(e._firestore, r, n._key, null, n.converter);
+            throw S();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = Dr(t, this._firestore), i = mr(r.converter, e, n), o = An(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
+        var r = Pr(t, this._firestore), i = yr(r.converter, e, n), o = kn(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 = Pr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = h(e)) || e instanceof dn ? On(this._dataReader, "Transaction.update", a._key, e, n, r) : qn(this._dataReader, "Transaction.update", a._key, e), 
+                return o = "string" == typeof (e = p(e)) || e instanceof mn ? Cn(this._dataReader, "Transaction.update", a._key, e, n, r) : On(this._dataReader, "Transaction.update", a._key, e), 
         this._transaction.update(a._key, o), this;
     }, 
     /**
@@ -5575,7 +5589,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 = Pr(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }, t;
 }();
@@ -5613,10 +5627,10 @@ function Dr(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */
-function Lr(t, e) {
-    var n = Je(t = at(t, tn)), r = new U;
-    return new Nr(new Cr, n, (function(n) {
-        return e(new jr(t, n));
+function Rr(t, e) {
+    var n = Ze(t = st(t, en)), r = new x;
+    return new qr(new jr, n, (function(n) {
+        return e(new Lr(t, n));
     }), r).run(), r.promise
     /**
  * Firestore Lite
@@ -5628,12 +5642,12 @@ function Lr(t, e) {
  */;
 }
 
-m = i + "_lite", o(new c("firestore/lite", (function(t, e) {
-    var n = e.options, r = t.getProvider("app").getImmediate(), i = new tn(r, new z(t.getProvider("auth-internal")), new W(t.getProvider("app-check-internal")));
+y = i + "_lite", o(new c("firestore/lite", (function(t, e) {
+    var n = e.options, r = t.getProvider("app").getImmediate(), i = new en(r, new Q(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.1", ""), a("firestore-lite", "3.4.1", "esm5");
+a("firestore-lite", "3.4.2-202205224240", ""), a("firestore-lite", "3.4.2-202205224240", "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, wt as Timestamp, jr as Transaction, Vr as WriteBatch, Tr as addDoc, Ar as arrayRemove, Ir 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, Lr as runTransaction, Er as serverTimestamp, wr as setDoc, v as setLogLevel, Wn as snapshotEqual, sr as startAfter, ar as startAt, on as terminate, br as updateDoc, Zn as where, Pr as writeBatch };
+export { vn as Bytes, cn as CollectionReference, sn as DocumentReference, Kn as DocumentSnapshot, mn as FieldPath, gn as FieldValue, en as Firestore, U as FirestoreError, wn as GeoPoint, un as Query, Xn as QueryConstraint, Hn as QueryDocumentSnapshot, Wn as QuerySnapshot, bt as Timestamp, Lr as Transaction, Dr as WriteBatch, Sr as addDoc, kr as arrayRemove, Ar as arrayUnion, ln as collection, fn as collectionGroup, on as connectFirestoreEmulator, Tr as deleteDoc, Er as deleteField, hn as doc, yn as documentId, fr as endAt, lr as endBefore, gr as getDoc, wr as getDocs, rn as getFirestore, Vr as increment, nn as initializeFirestore, ir as limit, or as limitToLast, nr as orderBy, Jn as query, dn as queryEqual, pn as refEqual, Rr as runTransaction, Ir as serverTimestamp, br as setDoc, g as setLogLevel, Yn as snapshotEqual, ur as startAfter, sr as startAt, an as terminate, _r as updateDoc, tr as where, Fr as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map