@firebase/firestore 3.1.0 → 3.1.1-canary.4594d3fd6

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

@@ -6,7 +6,7 @@ import { Component as c } from "@firebase/component";
 
 import { Logger as f, LogLevel as l } from "@firebase/logger";
 
-import { getModularInstance as h, createMockUserToken as p } from "@firebase/util";
+import { getModularInstance as h, 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 p = /** @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. */ p.UNAUTHENTICATED = new p(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");
+p.GOOGLE_CREDENTIALS = new p("google-credentials-uid"), p.FIRST_PARTY = new p("first-party-uid"), 
+p.MOCK_USER = new p("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.1.0", y = new f("@firebase/firestore");
+var m = "9.1.3-canary.4594d3fd6", y = new f("@firebase/firestore");
 
 /**
  * @license
@@ -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 = "ok", A = "cancelled", V = "unknown", D = "invalid-argument", k = "deadline-exceeded", P = "not-found", N = "permission-denied", F = "unauthenticated", O = "resource-exhausted", q = "failed-precondition", j = "aborted", L = "out-of-range", R = "unimplemented", U = "internal", x = "unavailable", B = /** @class */ function(e) {
+ */ var I = "cancelled", A = "unknown", V = "invalid-argument", D = "deadline-exceeded", k = "not-found", P = "permission-denied", N = "unauthenticated", F = "resource-exhausted", O = "failed-precondition", q = "aborted", j = "out-of-range", L = "unimplemented", R = "internal", U = "unavailable", x = /** @class */ function(e) {
     /** @hideconstructor */
     function n(
     /**
@@ -248,26 +248,26 @@ e) {
         }, r;
     }
     return t(n, e), n;
-}(Error), C = function() {
+}(Error), B = function() {
     var t = this;
     this.promise = new Promise((function(e, n) {
         t.resolve = e, t.reject = n;
     }));
-}, M = function(t, e) {
+}, C = function(t, e) {
     this.user = e, this.type = "OAuth", this.authHeaders = {}, 
     // Set the headers using Object Literal notation to avoid minification
     this.authHeaders.Authorization = "Bearer " + t;
-}, G = /** @class */ function() {
+}, M = /** @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(p.UNAUTHENTICATED);
         }));
     }, t.prototype.shutdown = function() {}, t;
-}(), Q = /** @class */ function() {
+}(), G = /** @class */ function() {
     function t(t) {
         this.token = t, 
         /**
@@ -289,7 +289,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) {
@@ -299,13 +299,13 @@ e) {
     return t.prototype.getToken = function() {
         var t = this;
         return this.auth ? this.auth.getToken().then((function(e) {
-            return e ? (T("string" == typeof e.accessToken), new M(e.accessToken, new d(t.auth.getUid()))) : null;
+            return e ? (T("string" == typeof e.accessToken), new C(e.accessToken, new p(t.auth.getUid()))) : null;
         })) : Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
     t.prototype.shutdown = function() {}, t;
-}(), H = /** @class */ function() {
+}(), z = /** @class */ function() {
     function t(t, e, n) {
-        this.t = t, this.i = e, this.o = n, this.type = "FirstParty", this.user = d.FIRST_PARTY;
+        this.t = t, this.i = e, this.o = n, this.type = "FirstParty", this.user = p.FIRST_PARTY;
     }
     return Object.defineProperty(t.prototype, "authHeaders", {
         get: function() {
@@ -319,20 +319,20 @@ e) {
         enumerable: !1,
         configurable: !0
     }), t;
-}(), 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 H(this.t, this.i, this.o));
+        return Promise.resolve(new z(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(p.FIRST_PARTY);
         }));
     }, t.prototype.shutdown = function() {}, t.prototype.invalidateToken = function() {}, 
     t;
-}(), W = 
+}(), K = 
 /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -353,7 +353,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;
-}, Y = /** @class */ function() {
+}, W = /** @class */ function() {
     function t(t, e) {
         this.projectId = t, this.database = e || "(default)";
     }
@@ -366,7 +366,7 @@ 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() {
+}(), Y = /** @class */ function() {
     function t(t, e, n) {
         void 0 === e ? e = 0 : e > t.length && S(), void 0 === n ? n = t.length - e : n > t.length - e && S(), 
         this.segments = t, this.offset = e, this.len = n;
@@ -419,7 +419,7 @@ function(t, e, n, r, i, o, a, s) {
         }
         return t.length < e.length ? -1 : t.length > e.length ? 1 : 0;
     }, t;
-}(), $ = /** @class */ function(e) {
+}(), X = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -445,7 +445,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 B(D, "Invalid segment (" + a + "). Paths must not contain // in them.");
+            if (a.indexOf("//") >= 0) throw new x(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;
@@ -455,7 +455,7 @@ function(t, e, n, r, i, o, a, s) {
     }, n.emptyPath = function() {
         return new n([]);
     }, n;
-}(X), J = /^[_a-zA-Z][_a-zA-Z0-9]*$/, Z = /** @class */ function(e) {
+}(Y), $ = /^[_a-zA-Z][_a-zA-Z0-9]*$/, J = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -467,7 +467,7 @@ function(t, e, n, r, i, o, a, s) {
      * without escaping.
      */
     n.isValidIdentifier = function(t) {
-        return J.test(t);
+        return $.test(t);
     }, n.prototype.canonicalString = function() {
         return this.toArray().map((function(t) {
             return t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"), n.isValidIdentifier(t) || (t = "`" + t + "`"), 
@@ -500,39 +500,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 B(D, "Invalid field path (" + t + "). Paths must not be empty, begin with '.', end with '.', or contain '..'");
+            if (0 === r.length) throw new x(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 B(D, "Path has trailing escape character: " + t);
+                if (i + 1 === t.length) throw new x(V, "Path has trailing escape character: " + t);
                 var u = t[i + 1];
-                if ("\\" !== u && "." !== u && "`" !== u) throw new B(D, "Path has invalid escape sequence: " + t);
+                if ("\\" !== u && "." !== u && "`" !== u) throw new x(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 B(D, "Unterminated ` in path: " + t);
+        if (o(), a) throw new x(V, "Unterminated ` in path: " + t);
         return new n(e);
     }, n.emptyPath = function() {
         return new n([]);
     }, n;
-}(X), tt = /** @class */ function() {
+}(Y), Z = /** @class */ function() {
     function t(t) {
         this.path = t;
     }
     return t.fromPath = function(e) {
-        return new t($.fromString(e));
+        return new t(X.fromString(e));
     }, t.fromName = function(e) {
-        return new t($.fromString(e).popFirst(5));
+        return new t(X.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 === $.comparator(this.path, t.path);
+        return null !== t && 0 === X.comparator(this.path, t.path);
     }, t.prototype.toString = function() {
         return this.path.toString();
     }, t.comparator = function(t, e) {
-        return $.comparator(t.path, e.path);
+        return X.comparator(t.path, e.path);
     }, t.isDocumentKey = function(t) {
         return t.length % 2 == 0;
     }, 
@@ -543,7 +543,7 @@ function(t, e, n, r, i, o, a, s) {
      * @returns A new instance of DocumentKey
      */
     t.fromSegments = function(e) {
-        return new t(new $(e.slice()));
+        return new t(new X(e.slice()));
     }, t;
 }();
 
@@ -564,8 +564,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 et(t, e, n) {
-    if (!n) throw new B(D, "Function " + t + "() cannot be called with an empty " + e + ".");
+function tt(t, e, n) {
+    if (!n) throw new x(V, "Function " + t + "() cannot be called with an empty " + e + ".");
 }
 
 /**
@@ -575,22 +575,22 @@ function et(t, e, n) {
 /**
  * Validates that `path` refers to a document (indicated by the fact it contains
  * an even numbers of segments).
- */ function nt(t) {
-    if (!tt.isDocumentKey(t)) throw new B(D, "Invalid document reference. Document references must have an even number of segments, but " + t + " has " + t.length + ".");
+ */ function et(t) {
+    if (!Z.isDocumentKey(t)) throw new x(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 rt(t) {
-    if (tt.isDocumentKey(t)) throw new B(D, "Invalid collection reference. Collection references must have an odd number of segments, but " + t + " has " + t.length + ".");
+ */ function nt(t) {
+    if (Z.isDocumentKey(t)) throw new x(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 it(t) {
+/** Returns a string describing the type / value of the provided input. */ function rt(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) + "..."), 
@@ -608,22 +608,22 @@ function et(t, e, n) {
     return "function" == typeof t ? "a function" : S();
 }
 
-function ot(t, 
+function it(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 B(D, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
-        var n = it(t);
-        throw new B(D, "Expected type '" + e.name + "', but it was: " + n);
+        if (e.name === t.constructor.name) throw new x(V, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
+        var n = rt(t);
+        throw new x(V, "Expected type '" + e.name + "', but it was: " + n);
     }
     return t;
 }
 
-function at(t, e) {
-    if (e <= 0) throw new B(D, "Function " + t + "() requires a positive number, but it was: " + e + ".");
+function ot(t, e) {
+    if (e <= 0) throw new x(V, "Function " + t + "() requires a positive number, but it was: " + e + ".");
 }
 
 /**
@@ -644,11 +644,11 @@ function at(t, e) {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function st(t) {
+ */ function at(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function ut(t) {
+/** Returns whether the value represents -0. */ function st(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;
@@ -673,7 +673,7 @@ function at(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 ct, ft, lt = {
+ */ var ut, ct, ft = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery"
@@ -717,8 +717,8 @@ function at(t, e) {
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function ht(t) {
-    if (void 0 === t) return w("RPC_ERROR", "HTTP error has no status"), V;
+function lt(t) {
+    if (void 0 === t) return w("RPC_ERROR", "HTTP error has no status"), A;
     // The canonical error codes for Google APIs [1] specify mapping onto HTTP
     // status codes but the mapping is not bijective. In each case of ambiguity
     // this function chooses a primary error.
@@ -727,66 +727,66 @@ function ht(t) {
         switch (t) {
       case 200:
         // OK
-        return I;
+        return "ok";
 
       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 N;
+        return P;
 
       case 404:
         // Not Found
-        return P;
+        return k;
 
       case 409:
         // Conflict
-        return j;
+        return q;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return L;
+        return j;
 
       case 429:
         // Too Many Requests
-        return O;
+        return F;
 
       case 499:
         // Client Closed Request
-        return A;
+        return I;
 
       case 500:
         // Internal Server Error
-        return V;
+        return A;
 
         // Other possibilities:
         // return Code.INTERNAL;
         // return Code.DATA_LOSS;
               case 501:
         // Unimplemented
-        return R;
+        return L;
 
       case 503:
         // Service Unavailable
-        return x;
+        return U;
 
       case 504:
         // Gateway Timeout
-        return k;
+        return D;
 
       default:
-        return t >= 200 && t < 300 ? I : t >= 400 && t < 500 ? q : t >= 500 && t < 600 ? U : V;
+        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? O : t >= 500 && t < 600 ? R : A;
     }
 }
 
@@ -809,29 +809,29 @@ function ht(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (ft = ct || (ct = {}))[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 pt = /** @class */ function(r) {
+ */ (ct = ut || (ut = {}))[ct.OK = 0] = "OK", ct[ct.CANCELLED = 1] = "CANCELLED", 
+ct[ct.UNKNOWN = 2] = "UNKNOWN", ct[ct.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+ct[ct.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", ct[ct.NOT_FOUND = 5] = "NOT_FOUND", 
+ct[ct.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", ct[ct.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+ct[ct.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", ct[ct.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+ct[ct.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", ct[ct.ABORTED = 10] = "ABORTED", 
+ct[ct.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", ct[ct.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+ct[ct.INTERNAL = 13] = "INTERNAL", ct[ct.UNAVAILABLE = 14] = "UNAVAILABLE", ct[ct.DATA_LOSS = 15] = "DATA_LOSS";
+
+var ht = /** @class */ function(r) {
     /**
      * @param databaseInfo - The connection info.
      * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.
      */
     function i(t, e) {
         var n = this;
-        return (n = r.call(this, t) || this).I = e, n;
+        return (n = r.call(this, t) || this).T = e, n;
     }
     /**
      * Base class for all Rest-based connections to the backend (WebChannel and
      * HTTP).
      */
-    return t(i, r), i.prototype.T = function(t, e) {
+    return t(i, r), i.prototype.I = function(t, e) {
         throw new Error("Not supported by FetchConnection");
     }, i.prototype.g = function(t, r, i, o) {
         return e(this, void 0, void 0, (function() {
@@ -842,7 +842,7 @@ var pt = /** @class */ function(r) {
                     t = JSON.stringify(o), n.label = 1;
 
                   case 1:
-                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.I(r, {
+                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.T(r, {
                         method: "POST",
                         headers: i,
                         body: t
@@ -852,10 +852,10 @@ var pt = /** @class */ function(r) {
                     return e = n.sent(), [ 3 /*break*/ , 4 ];
 
                   case 3:
-                    throw a = n.sent(), new B(ht(a.status), "Request failed with error: " + a.statusText);
+                    throw a = n.sent(), new x(lt(a.status), "Request failed with error: " + a.statusText);
 
                   case 4:
-                    if (!e.ok) throw new B(ht(e.status), "Request failed with error: " + e.statusText);
+                    if (!e.ok) throw new x(lt(e.status), "Request failed with error: " + e.statusText);
                     return [ 2 /*return*/ , e.json() ];
                 }
             }));
@@ -895,7 +895,7 @@ var pt = /** @class */ function(r) {
         t["Content-Type"] = "text/plain", this.databaseInfo.appId && (t["X-Firebase-GMPID"] = this.databaseInfo.appId), 
         e) for (var n in e.authHeaders) e.authHeaders.hasOwnProperty(n) && (t[n] = e.authHeaders[n]);
     }, t.prototype.m = function(t, e) {
-        var n = lt[t];
+        var n = ft[t];
         return this.u + "/v1/" + e + ":" + n;
     }, t;
 }());
@@ -963,7 +963,7 @@ var pt = /** @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 mt = /** @class */ function() {
+ */ var pt = /** @class */ function() {
     function t() {}
     return t.A = function() {
         for (
@@ -978,11 +978,11 @@ var pt = /** @class */ function(r) {
     }, t;
 }();
 
-function yt(t, e) {
+function mt(t, e) {
     return t < e ? -1 : t > e ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function vt(t, e, n) {
+/** Helper to compare arrays using isEqual(). */ function yt(t, e, n) {
     return t.length === e.length && t.every((function(t, r) {
         return n(t, e[r]);
     }));
@@ -1018,7 +1018,7 @@ function yt(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 gt = /** @class */ function() {
+ */ var vt = /** @class */ function() {
     /**
      * Creates a new timestamp.
      *
@@ -1039,11 +1039,11 @@ function yt(t, e) {
      * The fractions of a second at nanosecond resolution.*
      */
     e) {
-        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new B(D, "Timestamp nanoseconds out of range: " + e);
-        if (e >= 1e9) throw new B(D, "Timestamp nanoseconds out of range: " + e);
-        if (t < -62135596800) throw new B(D, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new x(V, "Timestamp nanoseconds out of range: " + e);
+        if (e >= 1e9) throw new x(V, "Timestamp nanoseconds out of range: " + e);
+        if (t < -62135596800) throw new x(V, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new B(D, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new x(V, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
@@ -1095,7 +1095,7 @@ function yt(t, e) {
     t.prototype.toMillis = function() {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }, t.prototype._compareTo = function(t) {
-        return this.seconds === t.seconds ? yt(this.nanoseconds, t.nanoseconds) : yt(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? mt(this.nanoseconds, t.nanoseconds) : mt(this.seconds, t.seconds);
     }, 
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1132,14 +1132,14 @@ function yt(t, e) {
         // 'seconds' values.
                 return String(t).padStart(12, "0") + "." + String(this.nanoseconds).padStart(9, "0");
     }, t;
-}(), wt = /** @class */ function() {
+}(), gt = /** @class */ function() {
     function t(t) {
         this.timestamp = t;
     }
     return t.fromTimestamp = function(e) {
         return new t(e);
     }, t.min = function() {
-        return new t(new gt(0, 0));
+        return new t(new vt(0, 0));
     }, t.prototype.compareTo = function(t) {
         return this.timestamp._compareTo(t.timestamp);
     }, t.prototype.isEqual = function(t) {
@@ -1191,13 +1191,13 @@ function yt(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function bt(t) {
+function wt(t) {
     var e = 0;
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
 }
 
-function _t(t, e) {
+function bt(t, e) {
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
@@ -1226,12 +1226,12 @@ function _t(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 _t = /** @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(Z.comparator)
+        t.sort(J.comparator)
         /**
      * Verifies that `fieldPath` is included by at least one field in this field
      * mask.
@@ -1245,25 +1245,26 @@ function _t(t, e) {
         }
         return !1;
     }, t.prototype.isEqual = function(t) {
-        return vt(this.fields, t.fields, (function(t, e) {
+        return yt(this.fields, t.fields, (function(t, e) {
             return t.isEqual(e);
         }));
     }, t;
-}(), Tt = /** @class */ function() {
+}(), St = /** @class */ function() {
     function t(t) {
         this.binaryString = t;
     }
     return t.fromBase64String = function(e) {
         return new t(atob(e));
     }, t.fromUint8Array = function(e) {
-        return new t(
+        var n = 
         /**
  * Helper function to convert an Uint8array to a binary string.
  */
         function(t) {
             for (var e = "", n = 0; n < t.length; ++n) e += String.fromCharCode(t[n]);
             return e;
-        }(e));
+        }(e);
+        return new t(n);
     }, t.prototype.toBase64 = function() {
         return t = this.binaryString, btoa(t);
         /** Converts a binary string to a Base64 encoded string. */        var t;
@@ -1275,7 +1276,7 @@ function _t(t, e) {
     }, t.prototype.approximateByteSize = function() {
         return 2 * this.binaryString.length;
     }, t.prototype.compareTo = function(t) {
-        return yt(this.binaryString, t.binaryString);
+        return mt(this.binaryString, t.binaryString);
     }, t.prototype.isEqual = function(t) {
         return this.binaryString === t.binaryString;
     }, t;
@@ -1322,14 +1323,14 @@ function _t(t, e) {
  * the proto byte string in a common class that must be converted into a string
  * before being sent as a proto.
  * @internal
- */ Tt.EMPTY_BYTE_STRING = new Tt("");
+ */ St.EMPTY_BYTE_STRING = new St("");
 
-var Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+var Tt = 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 It(t) {
+ */ function Et(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.
@@ -1337,7 +1338,7 @@ var Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         // 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 = Et.exec(t);
+        var e = 0, n = Tt.exec(t);
         if (T(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             var r = n[1];
@@ -1351,21 +1352,21 @@ var Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: At(t.seconds),
-        nanos: At(t.nanos)
+        seconds: It(t.seconds),
+        nanos: It(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function At(t) {
+ */ function It(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 ? Tt.fromBase64String(t) : Tt.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function At(t) {
+    return "string" == typeof t ? St.fromBase64String(t) : St.fromUint8Array(t);
 }
 
 /**
@@ -1401,7 +1402,7 @@ var Et = 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 Vt(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);
 }
@@ -1411,16 +1412,16 @@ var Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *
  * Preserving the previous values allows the user to display the last resoled
  * value until the backend responds with the timestamp.
- */ function kt(t) {
+ */ function Dt(t) {
     var e = t.mapValue.fields.__previous_value__;
-    return Dt(e) ? kt(e) : e;
+    return Vt(e) ? Dt(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Pt(t) {
-    var e = It(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new gt(e.seconds, e.nanos);
+ */ function kt(t) {
+    var e = Et(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new vt(e.seconds, e.nanos);
 }
 
 /**
@@ -1439,13 +1440,13 @@ var Et = 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 */ : S();
+/** Extracts the backend's type order for the provided value. */ function Pt(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 ? Vt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : S();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Ft(t, e) {
-    var n = Nt(t);
-    if (n !== Nt(e)) return !1;
+/** Tests `left` and `right` for equality based on the backend semantics. */ function Nt(t, e) {
+    var n = Pt(t);
+    if (n !== Pt(e)) return !1;
     switch (n) {
       case 0 /* NullValue */ :
         return !0;
@@ -1454,14 +1455,14 @@ var Et = 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 Pt(t).isEqual(Pt(e));
+        return kt(t).isEqual(kt(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 = It(t.timestampValue), r = It(e.timestampValue);
+            var n = Et(t.timestampValue), r = Et(e.timestampValue);
             return n.seconds === r.seconds && n.nanos === r.nanos;
         }(t, e);
 
@@ -1470,7 +1471,7 @@ var Et = 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 At(t.bytesValue).isEqual(At(e.bytesValue));
         }(t, e);
 
       case 7 /* RefValue */ :
@@ -1478,27 +1479,27 @@ var Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            return At(t.geoPointValue.latitude) === At(e.geoPointValue.latitude) && At(t.geoPointValue.longitude) === At(e.geoPointValue.longitude);
+            return It(t.geoPointValue.latitude) === It(e.geoPointValue.latitude) && It(t.geoPointValue.longitude) === It(e.geoPointValue.longitude);
         }(t, e);
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            if ("integerValue" in t && "integerValue" in e) return At(t.integerValue) === At(e.integerValue);
+            if ("integerValue" in t && "integerValue" in e) return It(t.integerValue) === It(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
-                var n = At(t.doubleValue), r = At(e.doubleValue);
-                return n === r ? ut(n) === ut(r) : isNaN(n) && isNaN(r);
+                var n = It(t.doubleValue), r = It(e.doubleValue);
+                return n === r ? st(n) === st(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* ArrayValue */ :
-        return vt(t.arrayValue.values || [], e.arrayValue.values || [], Ft);
+        return yt(t.arrayValue.values || [], e.arrayValue.values || [], Nt);
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
             var n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (bt(n) !== bt(r)) return !1;
-            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !Ft(n[i], r[i]))) return !1;
+            if (wt(n) !== wt(r)) return !1;
+            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !Nt(n[i], r[i]))) return !1;
             return !0;
         }(t, e);
 
@@ -1507,67 +1508,67 @@ var Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     }
 }
 
-function Ot(t, e) {
+function Ft(t, e) {
     return void 0 !== (t.values || []).find((function(t) {
-        return Ft(t, e);
+        return Nt(t, e);
     }));
 }
 
-function qt(t, e) {
-    var n = Nt(t), r = Nt(e);
-    if (n !== r) return yt(n, r);
+function Ot(t, e) {
+    var n = Pt(t), r = Pt(e);
+    if (n !== r) return mt(n, r);
     switch (n) {
       case 0 /* NullValue */ :
         return 0;
 
       case 1 /* BooleanValue */ :
-        return yt(t.booleanValue, e.booleanValue);
+        return mt(t.booleanValue, e.booleanValue);
 
       case 2 /* NumberValue */ :
         return function(t, e) {
-            var n = At(t.integerValue || t.doubleValue), r = At(e.integerValue || e.doubleValue);
+            var n = It(t.integerValue || t.doubleValue), r = It(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 qt(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return jt(Pt(t), Pt(e));
+        return qt(kt(t), kt(e));
 
       case 5 /* StringValue */ :
-        return yt(t.stringValue, e.stringValue);
+        return mt(t.stringValue, e.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, e) {
-            var n = Vt(t), r = Vt(e);
+            var n = At(t), r = At(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 = yt(n[i], r[i]);
+                var o = mt(n[i], r[i]);
                 if (0 !== o) return o;
             }
-            return yt(n.length, r.length);
+            return mt(n.length, r.length);
         }(t.referenceValue, e.referenceValue);
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            var n = yt(At(t.latitude), At(e.latitude));
-            return 0 !== n ? n : yt(At(t.longitude), At(e.longitude));
+            var n = mt(It(t.latitude), It(e.latitude));
+            return 0 !== n ? n : mt(It(t.longitude), It(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 = qt(n[i], r[i]);
+                var o = Ot(n[i], r[i]);
                 if (o) return o;
             }
-            return yt(n.length, r.length);
+            return mt(n.length, r.length);
         }(t.arrayValue, e.arrayValue);
 
       case 10 /* ObjectValue */ :
@@ -1579,12 +1580,12 @@ function qt(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 = yt(r[a], o[a]);
+                var s = mt(r[a], o[a]);
                 if (0 !== s) return s;
-                var u = qt(n[r[a]], i[o[a]]);
+                var u = Ot(n[r[a]], i[o[a]]);
                 if (0 !== u) return u;
             }
-            return yt(r.length, o.length);
+            return mt(r.length, o.length);
         }(t.mapValue, e.mapValue);
 
       default:
@@ -1592,35 +1593,35 @@ function qt(t, e) {
     }
 }
 
-function jt(t, e) {
-    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return yt(t, e);
-    var n = It(t), r = It(e), i = yt(n.seconds, r.seconds);
-    return 0 !== i ? i : yt(n.nanos, r.nanos);
+function qt(t, e) {
+    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return mt(t, e);
+    var n = Et(t), r = Et(e), i = mt(n.seconds, r.seconds);
+    return 0 !== i ? i : mt(n.nanos, r.nanos);
 }
 
-function Lt(t, e) {
+function jt(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 Lt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Ut(t) {
+/** Returns true if `value` is a NullValue. */ function Rt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function xt(t) {
+/** Returns true if `value` is NaN. */ function Ut(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function Bt(t) {
+/** Returns true if `value` is a MapValue. */ function xt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Ct(t) {
+/** Creates a deep copy of `source`. */ function Bt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1633,8 +1634,8 @@ function Lt(t, e) {
                 fields: {}
             }
         };
-        return _t(t.mapValue.fields, (function(t, n) {
-            return e.mapValue.fields[t] = Ct(n);
+        return bt(t.mapValue.fields, (function(t, n) {
+            return e.mapValue.fields[t] = Bt(n);
         })), e;
     }
     if (t.arrayValue) {
@@ -1642,7 +1643,7 @@ function Lt(t, e) {
             arrayValue: {
                 values: []
             }
-        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = Ct(t.arrayValue.values[r]);
+        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = Bt(t.arrayValue.values[r]);
         return n;
     }
     return Object.assign({}, t);
@@ -1667,7 +1668,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 Mt = /** @class */ function() {
+ */ var Ct = /** @class */ function() {
     function t(t) {
         this.value = t;
     }
@@ -1684,7 +1685,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 (!Bt(e = (e.mapValue.fields || {})[t.get(n)])) return null;
+        for (var e = this.value, n = 0; n < t.length - 1; ++n) if (!xt(e = (e.mapValue.fields || {})[t.get(n)])) return null;
         return (e = (e.mapValue.fields || {})[t.lastSegment()]) || null;
     }, 
     /**
@@ -1694,7 +1695,7 @@ function Lt(t, e) {
      * @param value - The value to set.
      */
     t.prototype.set = function(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Ct(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Bt(e);
     }, 
     /**
      * Sets the provided fields to the provided values.
@@ -1702,14 +1703,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 = Z.emptyPath(), r = {}, i = [];
+        var e = this, n = J.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()] = Ct(t) : i.push(o.lastSegment());
+            t ? r[o.lastSegment()] = Bt(t) : i.push(o.lastSegment());
         }));
         var o = this.getFieldsMap(n);
         this.applyChanges(o, r, i);
@@ -1722,9 +1723,9 @@ function Lt(t, e) {
      */
     t.prototype.delete = function(t) {
         var e = this.field(t.popLast());
-        Bt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        xt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }, t.prototype.isEqual = function(t) {
-        return Ft(this.value, t.value);
+        return Nt(this.value, t.value);
     }, 
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -1737,7 +1738,7 @@ function Lt(t, e) {
         });
         for (var n = 0; n < t.length; ++n) {
             var r = e.mapValue.fields[t.get(n)];
-            Bt(r) && r.mapValue.fields || (r = {
+            xt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -1750,7 +1751,7 @@ function Lt(t, e) {
      * entries.
      */
     t.prototype.applyChanges = function(t, e, n) {
-        _t(e, (function(e, n) {
+        bt(e, (function(e, n) {
             return t[e] = n;
         }));
         for (var r = 0, i = n; r < i.length; r++) {
@@ -1758,9 +1759,9 @@ function Lt(t, e) {
             delete t[o];
         }
     }, t.prototype.clone = function() {
-        return new t(Ct(this.value));
+        return new t(Bt(this.value));
     }, t;
-}(), Gt = /** @class */ function() {
+}(), Mt = /** @class */ function() {
     function t(t, e, n, r, i) {
         this.key = t, this.documentType = e, this.version = n, this.data = r, this.documentState = i
         /**
@@ -1769,7 +1770,7 @@ function Lt(t, e) {
      */;
     }
     return t.newInvalidDocument = function(e) {
-        return new t(e, 0 /* INVALID */ , wt.min(), Mt.empty(), 0 /* SYNCED */);
+        return new t(e, 0 /* INVALID */ , gt.min(), Ct.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist with the given data at the
@@ -1779,7 +1780,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, Mt.empty(), 0 /* SYNCED */);
+        return new t(e, 2 /* NO_DOCUMENT */ , n, Ct.empty(), 0 /* SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist at the given version but
@@ -1787,7 +1788,7 @@ function Lt(t, e) {
      * base document).
      */
     t.newUnknownDocument = function(e, n) {
-        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, Mt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new t(e, 3 /* UNKNOWN_DOCUMENT */ , n, Ct.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }, 
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -1802,7 +1803,7 @@ function Lt(t, e) {
      * version.
      */
     t.prototype.convertToNoDocument = function(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Mt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Ct.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }, 
     /**
@@ -1811,7 +1812,7 @@ function Lt(t, e) {
      * base document).
      */
     t.prototype.convertToUnknownDocument = function(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Mt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Ct.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }, t.prototype.setHasCommittedMutations = function() {
         return this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
@@ -1850,7 +1851,7 @@ function Lt(t, e) {
     }, 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) {
+}(), Gt = 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, 
@@ -1891,13 +1892,13 @@ function Lt(t, e) {
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
  */
-function zt(t, e, n, r, i, o, a) {
+function Qt(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 Gt(t, e, n, r, i, o, a);
 }
 
-var Ht = /** @class */ function(e) {
+var zt = /** @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;
@@ -1905,13 +1906,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.R(t, e, r) : new Kt(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new $t(t, r) : "in" /* IN */ === e ? new Jt(t, r) : "not-in" /* NOT_IN */ === e ? new Zt(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new te(t, r) : new n(t, e, r);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.R(t, e, r) : new Ht(t, e, r) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Xt(t, r) : "in" /* IN */ === e ? new $t(t, r) : "not-in" /* NOT_IN */ === e ? new Jt(t, r) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new Zt(t, r) : new n(t, e, r);
     }, n.R = function(t, e, n) {
-        return "in" /* IN */ === e ? new Wt(t, n) : new Yt(t, n);
+        return "in" /* IN */ === e ? new Kt(t, n) : new Wt(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.V(qt(e, this.value)) : null !== e && Nt(this.value) === Nt(e) && this.V(qt(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.V(Ot(e, this.value)) : null !== e && Pt(this.value) === Pt(e) && this.V(Ot(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }, n.prototype.V = function(t) {
         switch (this.op) {
@@ -1936,23 +1937,22 @@ var Ht = /** @class */ function(e) {
           default:
             return S();
         }
-    }, n.prototype.N = function() {
+    }, n.prototype.D = function() {
         return [ "<" /* LESS_THAN */ , "<=" /* LESS_THAN_OR_EQUAL */ , ">" /* GREATER_THAN */ , ">=" /* GREATER_THAN_OR_EQUAL */ , "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ].indexOf(this.op) >= 0;
     }, n;
-}((function() {})), Kt = /** @class */ function(e) {
+}((function() {})), Ht = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this, t, n, r) || this).key = tt.fromName(r.referenceValue), 
-        i;
+        return (i = e.call(this, t, n, r) || this).key = Z.fromName(r.referenceValue), i;
     }
     return t(n, e), n.prototype.matches = function(t) {
-        var e = tt.comparator(t.key, this.key);
+        var e = Z.comparator(t.key, this.key);
         return this.V(e);
     }, n;
-}(Ht), Wt = /** @class */ function(e) {
+}(zt), Kt = /** @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 = Yt("in" /* IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1960,10 +1960,10 @@ var Ht = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Ht), Yt = /** @class */ function(e) {
+}(zt), Wt = /** @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 = Yt("not-in" /* NOT_IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1971,67 +1971,67 @@ var Ht = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Ht);
+}(zt);
 
-/** Filter that matches on key fields (i.e. '__name__'). */ function Xt(t, e) {
+/** Filter that matches on key fields (i.e. '__name__'). */ function Yt(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((function(t) {
-        return tt.fromName(t.referenceValue);
+        return Z.fromName(t.referenceValue);
     }));
 }
 
-/** A Filter that implements the array-contains operator. */ var $t = /** @class */ function(e) {
+/** A Filter that implements the array-contains operator. */ var Xt = /** @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 Lt(e) && Ft(e.arrayValue, this.value);
     }, n;
-}(Ht), Jt = /** @class */ function(e) {
+}(zt), $t = /** @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 && Ft(this.value.arrayValue, e);
     }, n;
-}(Ht), Zt = /** @class */ function(e) {
+}(zt), Jt = /** @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 (Ft(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 && !Ft(this.value.arrayValue, e);
     }, n;
-}(Ht), te = /** @class */ function(e) {
+}(zt), Zt = /** @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 !(!Lt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
+            return Ft(e.value.arrayValue, t);
         }));
     }, n;
-}(Ht), ee = function(t, e) {
+}(zt), te = function(t, e) {
     this.position = t, this.before = e;
-}, ne = function(t, e /* ASCENDING */) {
+}, ee = function(t, e /* ASCENDING */) {
     void 0 === e && (e = "asc"), this.field = t, this.dir = e;
 };
 
-/** A Filter that implements the IN operator. */ function re(t, e) {
+/** A Filter that implements the IN operator. */ function ne(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
-function ie(t, e) {
+function re(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 (!Ft(t.position[n], e.position[n])) return !1;
+    for (var n = 0; n < t.position.length; n++) if (!Nt(t.position[n], e.position[n])) return !1;
     return !0;
 }
 
@@ -2057,7 +2057,7 @@ function ie(t, e) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ var oe = 
+ */ var ie = 
 /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2067,23 +2067,23 @@ function(t, e, n, r, i, o /* First */ , a, s) {
     void 0 === i && (i = null), void 0 === o && (o = "F"), void 0 === a && (a = null), 
     void 0 === s && (s = null), this.path = t, this.collectionGroup = e, this.explicitOrderBy = n, 
     this.filters = r, this.limit = i, this.limitType = o, this.startAt = a, this.endAt = s, 
-    this.D = null, 
+    this.N = null, 
     // The corresponding `Target` of this `Query` instance.
     this.$ = null, this.startAt, this.endAt;
 };
 
-/** Creates a new Query for a query that matches all documents at `path` */ function ae(t) {
-    return !st(t.limit) && "L" /* Last */ === t.limitType;
+/** Creates a new Query for a query that matches all documents at `path` */ function oe(t) {
+    return !at(t.limit) && "L" /* Last */ === t.limitType;
 }
 
-function se(t) {
+function ae(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function ue(t) {
+function se(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
         var r = n[e];
-        if (r.N()) return r.field;
+        if (r.D()) return r.field;
     }
     return null;
 }
@@ -2095,7 +2095,7 @@ function ue(t) {
 /**
  * Returns whether the query matches a collection group rather than a specific
  * collection.
- */ function ce(t) {
+ */ function ue(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2103,46 +2103,46 @@ function ue(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) {
+ */ function ce(t) {
     var e = E(t);
-    if (null === e.D) {
-        e.D = [];
-        var n = ue(e), r = se(e);
+    if (null === e.N) {
+        e.N = [];
+        var n = se(e), r = ae(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.D.push(new ne(n)), e.D.push(new ne(Z.keyField(), "asc" /* ASCENDING */)); else {
+        n.isKeyField() || e.N.push(new ee(n)), e.N.push(new ee(J.keyField(), "asc" /* ASCENDING */)); else {
             for (var i = !1, o = 0, a = e.explicitOrderBy; o < a.length; o++) {
                 var s = a[o];
-                e.D.push(s), s.field.isKeyField() && (i = !0);
+                e.N.push(s), s.field.isKeyField() && (i = !0);
             }
             if (!i) {
                 // 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.D.push(new ne(Z.keyField(), u));
+                e.N.push(new ee(J.keyField(), u));
             }
         }
     }
-    return e.D;
+    return e.N;
 }
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function le(t) {
+ */ function fe(t) {
     var e = E(t);
-    if (!e.$) if ("F" /* First */ === e.limitType) e.$ = zt(e.path, e.collectionGroup, fe(e), e.filters, e.limit, e.startAt, e.endAt); else {
+    if (!e.$) if ("F" /* First */ === e.limitType) e.$ = Qt(e.path, e.collectionGroup, ce(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 = ce(e); r < i.length; r++) {
             var o = i[r], a = "desc" /* DESCENDING */ === o.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            n.push(new ne(o.field, a));
+            n.push(new ee(o.field, a));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                var s = e.endAt ? new ee(e.endAt.position, !e.endAt.before) : null, u = e.startAt ? new ee(e.startAt.position, !e.startAt.before) : null;
+                var s = e.endAt ? new te(e.endAt.position, !e.endAt.before) : null, u = e.startAt ? new te(e.startAt.position, !e.startAt.before) : null;
         // Now return as a LimitType.First query.
-                e.$ = zt(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
+                e.$ = Qt(e.path, e.collectionGroup, n, e.filters, e.limit, s, u);
     }
     return e.$;
 }
@@ -2172,9 +2172,9 @@ function ue(t) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function he(t, e) {
+function le(t, e) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !ut(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !st(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
     /**
      * Returns an IntegerValue for `value`.
@@ -2196,7 +2196,7 @@ function he(t, e) {
             };
         }
         return {
-            doubleValue: ut(e) ? "-0" : e
+            doubleValue: st(e) ? "-0" : e
         };
     }(t, e);
 }
@@ -2217,7 +2217,7 @@ function he(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 pe = function() {
+/** Used to represent a field transform on a mutation. */ var he = function() {
     // Make sure that the structural type of `TransformOperation` is unique.
     // See https://github.com/microsoft/TypeScript/issues/5451
     this._ = void 0;
@@ -2226,27 +2226,27 @@ function he(t, e) {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(pe), me = /** @class */ function(e) {
+}(he), pe = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(pe), ye = /** @class */ function(e) {
+}(he), me = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(pe), ve = /** @class */ function(e) {
+}(he), ye = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).S = t, r.q = n, r;
     }
     return t(n, e), n;
-}(pe), ge = function(t, e) {
+}(he), ve = function(t, e) {
     this.field = t, this.transform = e;
-}, we = /** @class */ function() {
+}, ge = /** @class */ function() {
     function t(t, e) {
         this.updateTime = t, this.exists = e
         /** Creates a new empty Precondition. */;
@@ -2268,7 +2268,7 @@ function he(t, e) {
     }), t.prototype.isEqual = function(t) {
         return this.exists === t.exists && (this.updateTime ? !!t.updateTime && this.updateTime.isEqual(t.updateTime) : !t.updateTime);
     }, t;
-}(), be = function() {}, _e = /** @class */ function(e) {
+}(), we = function() {}, be = /** @class */ function(e) {
     function n(t, n, r, i) {
         void 0 === i && (i = []);
         var o = this;
@@ -2276,7 +2276,7 @@ function he(t, e) {
         o.type = 0 /* Set */ , o;
     }
     return t(n, e), n;
-}(be), Se = /** @class */ function(e) {
+}(we), _e = /** @class */ function(e) {
     function n(t, n, r, i, o) {
         void 0 === o && (o = []);
         var a = this;
@@ -2284,24 +2284,24 @@ function he(t, e) {
         a.fieldTransforms = o, a.type = 1 /* Patch */ , a;
     }
     return t(n, e), n;
-}(be), Te = /** @class */ function(e) {
+}(we), Se = /** @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;
-}(be), Ee = /** @class */ function(e) {
+}(we), Te = /** @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;
-}(be), Ie = {
+}(we), Ee = {
     asc: "ASCENDING",
     desc: "DESCENDING"
-}, Ae = {
+}, Ie = {
     "<": "LESS_THAN",
     "<=": "LESS_THAN_OR_EQUAL",
     ">": "GREATER_THAN",
@@ -2312,7 +2312,7 @@ function he(t, e) {
     in: "IN",
     "not-in": "NOT_IN",
     "array-contains-any": "ARRAY_CONTAINS_ANY"
-}, Ve = function(t, e) {
+}, Ae = function(t, e) {
     this.databaseId = t, this.F = e;
 };
 
@@ -2328,7 +2328,7 @@ function he(t, e) {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function De(t, e) {
+function Ve(t, e) {
     return t.F ? new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "") + "." + ("000000000" + e.nanoseconds).slice(-9) + "Z" : {
         seconds: "" + e.seconds,
         nanos: e.nanoseconds
@@ -2339,57 +2339,57 @@ function De(t, e) {
  * Returns a value for bytes that's appropriate to put in a proto.
  *
  * Visible for testing.
- */ function ke(t, e) {
+ */ function De(t, e) {
     return t.F ? e.toBase64() : e.toUint8Array();
 }
 
-function Pe(t, e) {
-    return De(t, e.toTimestamp());
+function ke(t, e) {
+    return Ve(t, e.toTimestamp());
 }
 
-function Ne(t) {
-    return T(!!t), wt.fromTimestamp(function(t) {
-        var e = It(t);
-        return new gt(e.seconds, e.nanos);
+function Pe(t) {
+    return T(!!t), gt.fromTimestamp(function(t) {
+        var e = Et(t);
+        return new vt(e.seconds, e.nanos);
     }(t));
 }
 
-function Fe(t, e) {
+function Ne(t, e) {
     return function(t) {
-        return new $([ "projects", t.projectId, "databases", t.database ]);
+        return new X([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
-function Oe(t, e) {
-    return Fe(t.databaseId, e.path);
+function Fe(t, e) {
+    return Ne(t.databaseId, e.path);
 }
 
-function qe(t, e) {
+function Oe(t, e) {
     var n, r = function(t) {
-        var e = $.fromString(t);
-        return T(Ge(e)), e;
+        var e = X.fromString(t);
+        return T(Me(e)), e;
     }(e);
-    if (r.get(1) !== t.databaseId.projectId) throw new B(D, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
-    if (r.get(3) !== t.databaseId.database) throw new B(D, "Tried to deserialize key from different database: " + r.get(3) + " vs " + t.databaseId.database);
-    return new tt((T((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
+    if (r.get(1) !== t.databaseId.projectId) throw new x(V, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
+    if (r.get(3) !== t.databaseId.database) throw new x(V, "Tried to deserialize key from different database: " + r.get(3) + " vs " + t.databaseId.database);
+    return new Z((T((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
 }
 
-function je(t, e) {
-    return Fe(t.databaseId, e);
+function qe(t, e) {
+    return Ne(t.databaseId, e);
 }
 
-function Le(t) {
-    return new $([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
+function je(t) {
+    return new X([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Re(t, e, n) {
+function Le(t, e, n) {
     return {
-        name: Oe(t, e),
+        name: Fe(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function Ue(t) {
+function Re(t) {
     return {
         before: t.before,
         values: t.position
@@ -2397,22 +2397,22 @@ function Ue(t) {
 }
 
 // visible for testing
-function xe(t) {
-    return Ie[t];
+function Ue(t) {
+    return Ee[t];
 }
 
 // visible for testing
-function Be(t) {
-    return Ae[t];
+function xe(t) {
+    return Ie[t];
 }
 
-function Ce(t) {
+function Be(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Me(t) {
+function Ce(t) {
     var e = [];
     return t.fields.forEach((function(t) {
         return e.push(t.canonicalString());
@@ -2421,7 +2421,7 @@ function Me(t) {
     };
 }
 
-function Ge(t) {
+function Me(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2441,8 +2441,8 @@ function Ge(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 Ge(t) {
+    return new Ae(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -2469,7 +2469,7 @@ function Ge(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 ze = /** @class */ function() {
+ */ var Qe = /** @class */ function() {
     function t(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -2497,7 +2497,7 @@ function Ge(t) {
         void 0 === n && (n = 1e3), void 0 === r && (r = 1.5), void 0 === i && (i = 6e4), 
         this.O = t, this.timerId = e, this.C = n, this.L = r, this.U = i, this.j = 0, this.k = null, 
         /** The last backoff attempt, as epoch milliseconds. */
-        this.M = Date.now(), this.reset();
+        this.B = Date.now(), this.reset();
     }
     /**
      * Resets the backoff delay.
@@ -2512,7 +2512,7 @@ function Ge(t) {
      * Resets the backoff delay to the maximum delay (e.g. for use after a
      * RESOURCE_EXHAUSTED error).
      */
-    t.prototype.B = function() {
+    t.prototype.M = function() {
         this.j = this.U;
     }, 
     /**
@@ -2520,17 +2520,17 @@ function Ge(t) {
      * delay for any subsequent attempts. If there was a pending backoff operation
      * already, it will be canceled.
      */
-    t.prototype.W = function(t) {
+    t.prototype.G = function(t) {
         var e = this;
         // Cancel any pending backoff operation.
                 this.cancel();
         // First schedule using the current base (which may be 0 and should be
         // honored as such).
-        var n = Math.floor(this.j + this.G()), r = Math.max(0, Date.now() - this.M), i = Math.max(0, n - r);
+        var n = Math.floor(this.j + this.W()), 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)"), 
         this.k = this.O.enqueueAfterDelay(this.timerId, i, (function() {
-            return e.M = Date.now(), t();
+            return e.B = Date.now(), t();
         })), 
         // Apply backoff factor to determine next delay and ensure it is within
         // bounds.
@@ -2540,24 +2540,24 @@ function Ge(t) {
     }, t.prototype.cancel = function() {
         null !== this.k && (this.k.cancel(), this.k = null);
     }, 
-    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.G = function() {
+    /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.W = function() {
         return (Math.random() - .5) * this.j;
     }, t;
-}(), He = /** @class */ function(e) {
+}(), ze = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this) || this).credentials = t, i.Y = n, i.S = r, i.K = !1, i;
     }
     return t(n, e), n.prototype.J = function() {
-        if (this.K) throw new B(q, "The client has already been terminated.");
+        if (this.K) throw new x(O, "The client has already been terminated.");
     }, 
     /** Gets an auth token and invokes the provided RPC. */ n.prototype.l = function(t, e, n) {
         var r = this;
         return this.J(), this.credentials.getToken().then((function(i) {
             return r.Y.l(t, e, n, i);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === F && r.credentials.invalidateToken(), 
-            t) : new B(V, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === N && r.credentials.invalidateToken(), 
+            t) : new x(A, t.toString());
         }));
     }, 
     /** Gets an auth token and invokes the provided RPC with streamed results. */ n.prototype.v = function(t, e, n) {
@@ -2565,8 +2565,8 @@ function Ge(t) {
         return this.J(), this.credentials.getToken().then((function(i) {
             return r.Y.v(t, e, n, i);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === F && r.credentials.invalidateToken(), 
-            t) : new B(V, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === N && r.credentials.invalidateToken(), 
+            t) : new x(A, t.toString());
         }));
     }, n.prototype.terminate = function() {
         this.K = !0;
@@ -2600,27 +2600,27 @@ function Ge(t) {
  */
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-function Ke(t, r) {
+function He(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.S) + "/documents", o = {
+                return e = E(t), i = je(e.S) + "/documents", o = {
                     writes: r.map((function(t) {
                         return function(t, e) {
                             var n;
-                            if (e instanceof _e) n = {
-                                update: Re(t, e.key, e.value)
-                            }; else if (e instanceof Te) n = {
-                                delete: Oe(t, e.key)
+                            if (e instanceof be) n = {
+                                update: Le(t, e.key, e.value)
                             }; else if (e instanceof Se) n = {
-                                update: Re(t, e.key, e.data),
-                                updateMask: Me(e.fieldMask)
+                                delete: Fe(t, e.key)
+                            }; else if (e instanceof _e) n = {
+                                update: Le(t, e.key, e.data),
+                                updateMask: Ce(e.fieldMask)
                             }; else {
-                                if (!(e instanceof Ee)) return S();
+                                if (!(e instanceof Te)) return S();
                                 n = {
-                                    verify: Oe(t, e.key)
+                                    verify: Fe(t, e.key)
                                 };
                             }
                             return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((function(t) {
@@ -2630,19 +2630,19 @@ function Ke(t, r) {
                                         fieldPath: e.field.canonicalString(),
                                         setToServerValue: "REQUEST_TIME"
                                     };
-                                    if (n instanceof me) return {
+                                    if (n instanceof pe) return {
                                         fieldPath: e.field.canonicalString(),
                                         appendMissingElements: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof ye) return {
+                                    if (n instanceof me) return {
                                         fieldPath: e.field.canonicalString(),
                                         removeAllFromArray: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof ve) return {
+                                    if (n instanceof ye) return {
                                         fieldPath: e.field.canonicalString(),
                                         increment: n.q
                                     };
@@ -2650,7 +2650,7 @@ function Ke(t, r) {
                                 }(0, t);
                             }))), e.precondition.isNone || (n.currentDocument = function(t, e) {
                                 return void 0 !== e.updateTime ? {
-                                    updateTime: Pe(t, e.updateTime)
+                                    updateTime: ke(t, e.updateTime)
                                 } : void 0 !== e.exists ? {
                                     exists: e.exists
                                 } : S();
@@ -2666,15 +2666,15 @@ function Ke(t, r) {
     }));
 }
 
-function We(t, r) {
+function Ke(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.S) + "/documents", o = {
+                return e = E(t), i = je(e.S) + "/documents", o = {
                     documents: r.map((function(t) {
-                        return Oe(e.S, t);
+                        return Fe(e.S, t);
                     }))
                 }, [ 4 /*yield*/ , e.v("BatchGetDocuments", i, o) ];
 
@@ -2683,16 +2683,16 @@ function We(t, r) {
                     var n = function(t, e) {
                         return "found" in e ? function(t, e) {
                             T(!!e.found), e.found.name, e.found.updateTime;
-                            var n = qe(t, e.found.name), r = Ne(e.found.updateTime), i = new Mt({
+                            var n = Oe(t, e.found.name), r = Pe(e.found.updateTime), i = new Ct({
                                 mapValue: {
                                     fields: e.found.fields
                                 }
                             });
-                            return Gt.newFoundDocument(n, r, i);
+                            return Mt.newFoundDocument(n, r, i);
                         }(t, e) : "missing" in e ? function(t, e) {
                             T(!!e.missing), T(!!e.readTime);
-                            var n = qe(t, e.missing), r = Ne(e.readTime);
-                            return Gt.newNoDocument(n, r);
+                            var n = Oe(t, e.missing), r = Pe(e.readTime);
+                            return Mt.newNoDocument(n, r);
                         }(t, e) : S();
                     }(e.S, t);
                     s.set(n.key.toString(), n);
@@ -2705,7 +2705,7 @@ function We(t, r) {
     }));
 }
 
-function Ye(t, r) {
+function We(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i;
         return n(this, (function(n) {
@@ -2716,10 +2716,10 @@ function Ye(t, r) {
                     var n = {
                         structuredQuery: {}
                     }, r = e.path;
-                    null !== e.collectionGroup ? (n.parent = je(t, r), n.structuredQuery.from = [ {
+                    null !== e.collectionGroup ? (n.parent = qe(t, r), n.structuredQuery.from = [ {
                         collectionId: e.collectionGroup,
                         allDescendants: !0
-                    } ]) : (n.parent = je(t, r.popLast()), n.structuredQuery.from = [ {
+                    } ]) : (n.parent = qe(t, r.popLast()), n.structuredQuery.from = [ {
                         collectionId: r.lastSegment()
                     } ]);
                     var i = function(t) {
@@ -2728,36 +2728,36 @@ function Ye(t, r) {
                                 // visible for testing
                                 return function(t) {
                                     if ("==" /* EQUAL */ === t.op) {
-                                        if (xt(t.value)) return {
+                                        if (Ut(t.value)) return {
                                             unaryFilter: {
-                                                field: Ce(t.field),
+                                                field: Be(t.field),
                                                 op: "IS_NAN"
                                             }
                                         };
-                                        if (Ut(t.value)) return {
+                                        if (Rt(t.value)) return {
                                             unaryFilter: {
-                                                field: Ce(t.field),
+                                                field: Be(t.field),
                                                 op: "IS_NULL"
                                             }
                                         };
                                     } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                                        if (xt(t.value)) return {
+                                        if (Ut(t.value)) return {
                                             unaryFilter: {
-                                                field: Ce(t.field),
+                                                field: Be(t.field),
                                                 op: "IS_NOT_NAN"
                                             }
                                         };
-                                        if (Ut(t.value)) return {
+                                        if (Rt(t.value)) return {
                                             unaryFilter: {
-                                                field: Ce(t.field),
+                                                field: Be(t.field),
                                                 op: "IS_NOT_NULL"
                                             }
                                         };
                                     }
                                     return {
                                         fieldFilter: {
-                                            field: Ce(t.field),
-                                            op: Be(t.op),
+                                            field: Be(t.field),
+                                            op: xe(t.op),
                                             value: t.value
                                         }
                                     };
@@ -2777,21 +2777,21 @@ function Ye(t, r) {
                             // visible for testing
                             return function(t) {
                                 return {
-                                    field: Ce(t.field),
-                                    direction: xe(t.dir)
+                                    field: Be(t.field),
+                                    direction: Ue(t.dir)
                                 };
                             }(t);
                         }));
                     }(e.orderBy);
                     o && (n.structuredQuery.orderBy = o);
                     var a = function(t, e) {
-                        return t.F || st(e) ? e : {
+                        return t.F || at(e) ? e : {
                             value: e
                         };
                     }(t, e.limit);
-                    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.S, le(r)), [ 4 /*yield*/ , e.v("RunQuery", i.parent, {
+                    return null !== a && (n.structuredQuery.limit = a), e.startAt && (n.structuredQuery.startAt = Re(e.startAt)), 
+                    e.endAt && (n.structuredQuery.endAt = Re(e.endAt)), n;
+                }(e.S, fe(r)), [ 4 /*yield*/ , e.v("RunQuery", i.parent, {
                     structuredQuery: i.structuredQuery
                 }) ];
 
@@ -2800,11 +2800,11 @@ function Ye(t, r) {
                     return !!t.document;
                 })).map((function(t) {
                     return function(t, e, n) {
-                        var r = qe(t, e.name), i = Ne(e.updateTime), o = new Mt({
+                        var r = Oe(t, e.name), i = Pe(e.updateTime), o = new Ct({
                             mapValue: {
                                 fields: e.fields
                             }
-                        }), a = Gt.newFoundDocument(r, i, o);
+                        }), a = Mt.newFoundDocument(r, i, o);
                         return a;
                     }(e.S, t.document);
                 })) ];
@@ -2828,7 +2828,7 @@ function Ye(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 Ye = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -2838,17 +2838,17 @@ function Ye(t, r) {
  * Returns an initialized and started Datastore for the given Firestore
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
- */ function $e(t) {
-    if (t._terminated) throw new B(q, "The client has already been terminated.");
-    if (!Xe.has(t)) {
+ */ function Xe(t) {
+    if (t._terminated) throw new x(O, "The client has already been terminated.");
+    if (!Ye.has(t)) {
         g("ComponentProvider", "Initializing Datastore");
         var e = function(t) {
-            return new pt(t, fetch.bind(null));
+            return new ht(t, fetch.bind(null));
         }((i = t._databaseId, o = t.app.options.appId || "", a = t._persistenceKey, s = t._freezeSettings(), 
-        new W(i, o, a, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), n = Qe(t._databaseId), r = function(t, e, n) {
-            return new He(t, e, n);
+        new K(i, o, a, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), n = Ge(t._databaseId), r = function(t, e, n) {
+            return new ze(t, e, n);
         }(t._credentials, e, n);
-        Xe.set(t, r);
+        Ye.set(t, r);
     }
     var i, o, a, s;
     /**
@@ -2866,7 +2866,7 @@ function Ye(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 Ye.get(t);
 }
 
 /**
@@ -2877,38 +2877,38 @@ function Ye(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 Je = /** @class */ function() {
+ */ var $e = /** @class */ function() {
     function t(t) {
         var e;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new B(D, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new x(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 B(D, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new x(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 B(D, "experimentalForceLongPolling and experimentalAutoDetectLongPolling cannot be used together.");
+            if (!0 === e && !0 === r) throw new x(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;
-}(), Ze = /** @class */ function() {
+}(), Je = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._credentials = e, 
         /**
              * Whether it's a Firestore or Firestore Lite instance.
              */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new Je({}), 
-        this._settingsFrozen = !1, t instanceof Y ? this._databaseId = t : (this._app = t, 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new $e({}), 
+        this._settingsFrozen = !1, t instanceof W ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
-            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new B(D, '"projectId" not provided in firebase.initializeApp.');
-            return new Y(t.options.projectId);
+            if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new x(V, '"projectId" not provided in firebase.initializeApp.');
+            return new W(t.options.projectId);
         }(t));
     }
     return Object.defineProperty(t.prototype, "app", {
@@ -2917,7 +2917,7 @@ function Ye(t, r) {
          * instance.
          */
         get: function() {
-            if (!this._app) throw new B(q, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+            if (!this._app) throw new x(O, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
             return this._app;
         },
         enumerable: !1,
@@ -2935,21 +2935,21 @@ function Ye(t, r) {
         enumerable: !1,
         configurable: !0
     }), t.prototype._setSettings = function(t) {
-        if (this._settingsFrozen) throw new B(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 Je(t), void 0 !== t.credentials && (this._credentials = function(t) {
-            if (!t) return new G;
+        if (this._settingsFrozen) throw new x(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 $e(t), void 0 !== t.credentials && (this._credentials = function(t) {
+            if (!t) return new M;
             switch (t.type) {
               case "gapi":
                 var e = t.client;
                 // Make sure this really is a Gapi client.
                                 return T(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty)), 
-                new K(e, t.sessionIndex || "0", t.iamToken || null);
+                new H(e, t.sessionIndex || "0", t.iamToken || null);
 
               case "provider":
                 return t.client;
 
               default:
-                throw new B(D, "makeCredentialsProvider failed due to invalid credential type");
+                throw new x(V, "makeCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }, t.prototype._getSettings = function() {
@@ -2974,8 +2974,8 @@ function Ye(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 = Ye.get(t)) && (g("ComponentProvider", "Removing Datastore"), 
+        Ye.delete(t), e.terminate()), Promise.resolve();
         var t, e;
     }, t;
 }();
@@ -3000,9 +3000,9 @@ function Ye(t, r) {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ function tn(t, e) {
+ */ function Ze(t, e) {
     var n = _getProvider(t, "firestore/lite");
-    if (n.isInitialized()) throw new B(q, "Firestore can only be initialized once per app.");
+    if (n.isInitialized()) throw new x(O, "Firestore can only be initialized once per app.");
     return n.initialize({
         options: e
     });
@@ -3016,7 +3016,7 @@ function Ye(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 en(t) {
+ */ function tn(t) {
     return void 0 === t && (t = s()), _getProvider(t, "firestore/lite").getImmediate();
 }
 
@@ -3032,25 +3032,25 @@ function Ye(t, r) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function nn(t, e, n, r) {
+ */ function en(t, e, n, r) {
     var i;
     void 0 === r && (r = {});
-    var o = (t = ot(t, Ze))._getSettings();
+    var o = (t = it(t, Je))._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"), 
     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 = p.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 B(D, "mockUserToken must contain 'sub' or 'user_id' field!");
-            s = new d(u);
+            if (!u) throw new x(V, "mockUserToken must contain 'sub' or 'user_id' field!");
+            s = new p(u);
         }
-        t._credentials = new Q(new M(a, s));
+        t._credentials = new G(new C(a, s));
     }
 }
 
@@ -3073,8 +3073,8 @@ function Ye(t, r) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function rn(t) {
-    return t = ot(t, Ze), u(t.app, "firestore/lite"), t._delete()
+ */ function nn(t) {
+    return t = it(t, Je), u(t.app, "firestore/lite"), t._delete()
     /**
  * @license
  * Copyright 2020 Google LLC
@@ -3114,7 +3114,7 @@ function Ye(t, r) {
  */;
 }
 
-var on = /** @class */ function() {
+var rn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, 
     /**
@@ -3155,14 +3155,14 @@ var on = /** @class */ function() {
          * The collection this `DocumentReference` belongs to.
          */
         get: function() {
-            return new sn(this.firestore, this.converter, this._key.path.popLast());
+            return new an(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;
-}(), an = /** @class */ function() {
+}(), on = /** @class */ function() {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     function t(t, 
@@ -3177,11 +3177,11 @@ var on = /** @class */ function() {
     return t.prototype.withConverter = function(e) {
         return new t(this.firestore, e, this._query);
     }, t;
-}(), sn = /** @class */ function(e) {
+}(), an = /** @class */ function(e) {
     /** @hideconstructor */
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this, t, n, new oe(r)) || this)._path = r, 
+        return (i = e.call(this, t, n, new ie(r)) || this)._path = r, 
         /** The type of this Firestore reference. */
         i.type = "collection", i;
     }
@@ -3208,28 +3208,28 @@ var on = /** @class */ function() {
          */
         get: function() {
             var t = this._path.popLast();
-            return t.isEmpty() ? null : new on(this.firestore, 
-            /* converter= */ null, new tt(t));
+            return t.isEmpty() ? null : new rn(this.firestore, 
+            /* converter= */ null, new Z(t));
         },
         enumerable: !1,
         configurable: !0
     }), n.prototype.withConverter = function(t) {
         return new n(this.firestore, t, this._path);
     }, n;
-}(an);
+}(on);
 
 /**
  * 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 un(t, e) {
+ */ function sn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
-    if (t = h(t), et("collection", "path", e), t instanceof Ze) {
-        var o = $.fromString.apply($, r([ e ], n));
-        return rt(o), new sn(t, /* converter= */ null, o);
+    if (t = h(t), tt("collection", "path", e), t instanceof Je) {
+        var o = X.fromString.apply(X, r([ e ], n));
+        return nt(o), new an(t, /* converter= */ null, o);
     }
-    if (!(t instanceof on || t instanceof sn)) throw new B(D, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-    var a = t._path.child($.fromString.apply($, r([ e ], n)));
-    return rt(a), new sn(t.firestore, 
+    if (!(t instanceof rn || t instanceof an)) throw new x(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    var a = t._path.child(X.fromString.apply(X, r([ e ], n)));
+    return nt(a), new an(t.firestore, 
     /* converter= */ null, a);
 }
 
@@ -3245,32 +3245,32 @@ var on = /** @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 cn(t, e) {
-    if (t = ot(t, Ze), et("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new B(D, "Invalid collection ID '" + e + "' passed to function collectionGroup(). Collection IDs must not contain '/'.");
-    return new an(t, 
+ */ function un(t, e) {
+    if (t = it(t, Je), tt("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new x(V, "Invalid collection ID '" + e + "' passed to function collectionGroup(). Collection IDs must not contain '/'.");
+    return new on(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 oe($.emptyPath(), t);
+        return new ie(X.emptyPath(), t);
     }(e));
 }
 
-function fn(t, e) {
+function cn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
     if (t = h(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = mt.A()), et("doc", "path", e), t instanceof Ze) {
-        var o = $.fromString.apply($, r([ e ], n));
-        return nt(o), new on(t, 
-        /* converter= */ null, new tt(o));
+    1 === arguments.length && (e = pt.A()), tt("doc", "path", e), t instanceof Je) {
+        var o = X.fromString.apply(X, r([ e ], n));
+        return et(o), new rn(t, 
+        /* converter= */ null, new Z(o));
     }
-    if (!(t instanceof on || t instanceof sn)) throw new B(D, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-    var a = t._path.child($.fromString.apply($, r([ e ], n)));
-    return nt(a), new on(t.firestore, t instanceof sn ? t.converter : null, new tt(a));
+    if (!(t instanceof rn || t instanceof an)) throw new x(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    var a = t._path.child(X.fromString.apply(X, r([ e ], n)));
+    return et(a), new rn(t.firestore, t instanceof an ? t.converter : null, new Z(a));
 }
 
 /**
@@ -3280,8 +3280,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 ln(t, e) {
-    return t = h(t), e = h(e), (t instanceof on || t instanceof sn) && (e instanceof on || e instanceof sn) && t.firestore === e.firestore && t.path === e.path && t.converter === e.converter
+ */ function fn(t, e) {
+    return t = h(t), e = h(e), (t instanceof rn || t instanceof an) && (e instanceof rn || e instanceof an) && 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.
@@ -3293,18 +3293,18 @@ function fn(t, e) {
  */;
 }
 
-function hn(t, e) {
-    return t = h(t), e = h(e), t instanceof an && e instanceof an && t.firestore === e.firestore && function(t, e) {
+function ln(t, e) {
+    return t = h(t), e = h(e), t instanceof on && e instanceof on && 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 (!re(t.orderBy[n], e.orderBy[n])) return !1;
+            for (var n = 0; n < t.orderBy.length; n++) if (!ne(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) || !Ft(i.value, o.value)) return !1;
+            i.op !== o.op || !i.field.isEqual(o.field) || !Nt(i.value, o.value)) return !1;
             var i, o;
-            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!ie(t.startAt, e.startAt) && ie(t.endAt, e.endAt);
-        }(le(t), le(e)) && t.limitType === e.limitType;
+            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!re(t.startAt, e.startAt) && re(t.endAt, e.endAt);
+        }(fe(t), fe(e)) && t.limitType === e.limitType;
     }(t._query, e._query) && t.converter === e.converter
     /**
  * @license
@@ -3332,7 +3332,7 @@ function hn(t, e) {
  */;
 }
 
-var pn = /** @class */ function() {
+var hn = /** @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.
@@ -3341,8 +3341,8 @@ var pn = /** @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 B(D, "Invalid field name at argument $(i + 1). Field names must not be empty.");
-        this._internalPath = new Z(t);
+        for (var n = 0; n < t.length; ++n) if (0 === t[n].length) throw new x(V, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        this._internalPath = new J(t);
     }
     /**
      * Returns true if this `FieldPath` is equal to the provided one.
@@ -3358,7 +3358,7 @@ var pn = /** @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 dn() {
-    return new pn("__name__");
+    return new hn("__name__");
 }
 
 /**
@@ -3379,7 +3379,7 @@ var pn = /** @class */ function() {
  */
 /**
  * An immutable object representing an array of bytes.
- */ var mn = /** @class */ function() {
+ */ var pn = /** @class */ function() {
     /** @hideconstructor */
     function t(t) {
         this._byteString = t;
@@ -3391,9 +3391,9 @@ var pn = /** @class */ function() {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    return t.fromBase64String = function(e) {
         try {
-            return new t(Tt.fromBase64String(e));
+            return new t(St.fromBase64String(e));
         } catch (e) {
-            throw new B(D, "Failed to construct data from Base64 string: " + e);
+            throw new x(V, "Failed to construct data from Base64 string: " + e);
         }
     }, 
     /**
@@ -3402,7 +3402,7 @@ var pn = /** @class */ function() {
      * @param array - The Uint8Array used to create the `Bytes` object.
      */
     t.fromUint8Array = function(e) {
-        return new t(Tt.fromUint8Array(e));
+        return new t(St.fromUint8Array(e));
     }, 
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3437,14 +3437,14 @@ var pn = /** @class */ function() {
     t.prototype.isEqual = function(t) {
         return this._byteString.isEqual(t._byteString);
     }, t;
-}(), yn = 
+}(), mn = 
 /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
      */
 function(t) {
     this._methodName = t;
-}, vn = /** @class */ function() {
+}, yn = /** @class */ function() {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3452,8 +3452,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 B(D, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(e) || e < -180 || e > 180) throw new B(D, "Longitude must be a number between -180 and 180, but was: " + e);
+        if (!isFinite(t) || t < -90 || t > 90) throw new x(V, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(e) || e < -180 || e > 180) throw new x(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", {
@@ -3495,23 +3495,23 @@ function(t) {
      * with an underscore.
      */
     t.prototype._compareTo = function(t) {
-        return yt(this._lat, t._lat) || yt(this._long, t._long);
+        return mt(this._lat, t._lat) || mt(this._long, t._long);
     }, t;
-}(), gn = /^__.*__$/, wn = /** @class */ function() {
+}(), vn = /^__.*__$/, gn = /** @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 _e(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new _e(t, this.data, this.fieldMask, e, this.fieldTransforms) : new be(t, this.data, e, this.fieldTransforms);
     }, t;
-}(), bn = /** @class */ function() {
+}(), wn = /** @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 _e(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }, t;
 }();
 
@@ -3534,7 +3534,7 @@ function(t) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ function _n(t) {
+ */ function bn(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3552,7 +3552,7 @@ function(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ var Sn = /** @class */ function() {
+/** A "context" object passed around while parsing user data. */ var _n = /** @class */ function() {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3592,16 +3592,16 @@ function(t) {
     }), 
     /** Returns a new context with the specified settings overwritten. */ t.prototype.tt = function(e) {
         return new t(Object.assign(Object.assign({}, this.settings), e), this.databaseId, this.S, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
-    }, t.prototype.et = function(t) {
+    }, t.prototype.nt = function(t) {
         var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.tt({
             path: n,
-            nt: !1
+            et: !1
         });
         return r.rt(t), r;
     }, t.prototype.st = function(t) {
         var e, n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.tt({
             path: n,
-            nt: !1
+            et: !1
         });
         return r.Z(), r;
     }, t.prototype.it = function(t) {
@@ -3609,10 +3609,10 @@ function(t) {
         // undefined.
         return this.tt({
             path: void 0,
-            nt: !0
+            et: !0
         });
     }, t.prototype.ot = function(t) {
-        return Mn(t, this.settings.methodName, this.settings.ut || !1, this.path, this.settings.ct);
+        return Cn(t, this.settings.methodName, this.settings.ut || !1, this.path, this.settings.ct);
     }, 
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */ t.prototype.contains = function(t) {
         return void 0 !== this.fieldMask.find((function(e) {
@@ -3626,20 +3626,20 @@ function(t) {
         if (this.path) for (var t = 0; t < this.path.length; t++) this.rt(this.path.get(t));
     }, t.prototype.rt = function(t) {
         if (0 === t.length) throw this.ot("Document fields must not be empty");
-        if (_n(this.X) && gn.test(t)) throw this.ot('Document fields cannot begin and end with "__"');
+        if (bn(this.X) && vn.test(t)) throw this.ot('Document fields cannot begin and end with "__"');
     }, t;
-}(), Tn = /** @class */ function() {
+}(), Sn = /** @class */ function() {
     function t(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.S = n || Qe(t)
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.S = n || Ge(t)
         /** Creates a new top-level parse context. */;
     }
     return t.prototype.at = function(t, e, n, r) {
-        return void 0 === r && (r = !1), new Sn({
+        return void 0 === r && (r = !1), new _n({
             X: t,
             methodName: e,
             ct: n,
-            path: Z.emptyPath(),
-            nt: !1,
+            path: J.emptyPath(),
+            et: !1,
             ut: r
         }, this.databaseId, this.S, this.ignoreUndefinedProperties);
     }, t;
@@ -3648,30 +3648,30 @@ function(t) {
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ function En(t) {
-    var e = t._freezeSettings(), n = Qe(t._databaseId);
-    return new Tn(t._databaseId, !!e.ignoreUndefinedProperties, n);
+ */ function Tn(t) {
+    var e = t._freezeSettings(), n = Ge(t._databaseId);
+    return new Sn(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function In(t, e, n, r, i, o) {
+/** Parse document data from a set() call. */ function En(t, e, n, r, i, o) {
     void 0 === o && (o = {});
     var a = t.at(o.merge || o.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, i);
-    Un("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) {
+    Rn("Data must be an object, but it was:", a, r);
+    var s, u, c = jn(r, a);
+    if (o.merge) s = new _t(a.fieldMask), u = a.fieldTransforms; else if (o.mergeFields) {
         for (var f = [], l = 0, h = o.mergeFields; l < h.length; l++) {
-            var p = xn(e, h[l], n);
-            if (!a.contains(p)) throw new B(D, "Field '" + p + "' is specified in your field mask but missing from your input data.");
-            Gn(f, p) || f.push(p);
+            var d = Un(e, h[l], n);
+            if (!a.contains(d)) throw new x(V, "Field '" + d + "' is specified in your field mask but missing from your input data.");
+            Mn(f, d) || f.push(d);
         }
-        s = new St(f), u = a.fieldTransforms.filter((function(t) {
+        s = new _t(f), u = a.fieldTransforms.filter((function(t) {
             return s.covers(t.field);
         }));
     } else s = null, u = a.fieldTransforms;
-    return new wn(new Mt(c), s, u);
+    return new gn(new Ct(c), s, u);
 }
 
-var An = /** @class */ function(e) {
+var In = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -3683,7 +3683,7 @@ var An = /** @class */ function(e) {
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(yn);
+}(mn);
 
 /**
  * Creates a child context for parsing SerializableFieldValues.
@@ -3700,110 +3700,110 @@ var An = /** @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 An(t, e, n) {
+    return new _n({
         X: 3 /* Argument */ ,
         ct: e.settings.ct,
         methodName: t._methodName,
-        nt: n
+        et: n
     }, e.databaseId, e.S, e.ignoreUndefinedProperties);
 }
 
-var Dn = /** @class */ function(e) {
+var Vn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        return new ge(t.path, new de);
+        return new ve(t.path, new de);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(yn), kn = /** @class */ function(e) {
+}(mn), Dn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).ht = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = Vn(this, t, 
+        var e = An(this, t, 
         /*array=*/ !0), n = this.ht.map((function(t) {
-            return jn(t, e);
-        })), r = new me(n);
-        return new ge(t.path, r);
+            return qn(t, e);
+        })), r = new pe(n);
+        return new ve(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(yn), Pn = /** @class */ function(e) {
+}(mn), kn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).ht = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = Vn(this, t, 
+        var e = An(this, t, 
         /*array=*/ !0), n = this.ht.map((function(t) {
-            return jn(t, e);
-        })), r = new ye(n);
-        return new ge(t.path, r);
+            return qn(t, e);
+        })), r = new me(n);
+        return new ve(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(yn), Nn = /** @class */ function(e) {
+}(mn), Pn = /** @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 = new ve(t.S, he(t.S, this.lt));
-        return new ge(t.path, e);
+        var e = new ye(t.S, le(t.S, this.lt));
+        return new ve(t.path, e);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(yn);
+}(mn);
 
-/** Parse update data from an update() call. */ function Fn(t, e, n, r) {
+/** Parse update data from an update() call. */ function Nn(t, e, n, r) {
     var i = t.at(1 /* Update */ , e, n);
-    Un("Data must be an object, but it was:", i, r);
-    var o = [], a = Mt.empty();
-    _t(r, (function(t, r) {
-        var s = Cn(e, t, n);
+    Rn("Data must be an object, but it was:", i, r);
+    var o = [], a = Ct.empty();
+    bt(r, (function(t, r) {
+        var s = Bn(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = h(r);
         var u = i.st(s);
-        if (r instanceof An) 
+        if (r instanceof In) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(s); else {
-            var c = jn(r, u);
+            var c = qn(r, u);
             null != c && (o.push(s), a.set(s, c));
         }
     }));
-    var s = new St(o);
-    return new bn(a, s, i.fieldTransforms);
+    var s = new _t(o);
+    return new wn(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.at(1 /* Update */ , e, n), s = [ xn(e, r, n) ], u = [ i ];
-    if (o.length % 2 != 0) throw new B(D, "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]);
+/** Parse update data from a list of field/value arguments. */ function Fn(t, e, n, r, i, o) {
+    var a = t.at(1 /* Update */ , e, n), s = [ Un(e, r, n) ], u = [ i ];
+    if (o.length % 2 != 0) throw new x(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(Un(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 f = [], l = Mt.empty(), p = s.length - 1; p >= 0; --p) if (!Gn(f, s[p])) {
-        var d = s[p], m = u[p];
+    for (var f = [], l = Ct.empty(), d = s.length - 1; d >= 0; --d) if (!Mn(f, s[d])) {
+        var p = s[d], m = u[d];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
         m = h(m);
-        var y = a.st(d);
-        if (m instanceof An) 
+        var y = a.st(p);
+        if (m instanceof In) 
         // Add it to the field mask, but don't add anything to updateData.
-        f.push(d); else {
-            var v = jn(m, y);
-            null != v && (f.push(d), l.set(d, v));
+        f.push(p); else {
+            var v = qn(m, y);
+            null != v && (f.push(p), l.set(p, v));
         }
     }
-    var g = new St(f);
-    return new bn(l, g, a.fieldTransforms);
+    var g = new _t(f);
+    return new wn(l, g, a.fieldTransforms);
 }
 
 /**
@@ -3812,8 +3812,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 qn(t, e, n, r) {
-    return void 0 === r && (r = !1), jn(n, t.at(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+ */ function On(t, e, n, r) {
+    return void 0 === r && (r = !1), qn(n, t.at(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -3824,12 +3824,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 qn(t, e) {
+    if (Ln(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = h(t))) return Un("Unsupported field value:", e, t), Ln(t, e);
-    if (t instanceof yn) 
+    t = h(t))) return Rn("Unsupported field value:", e, t), jn(t, e);
+    if (t instanceof mn) 
     // 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
@@ -3841,7 +3841,7 @@ var Dn = /** @class */ function(e) {
      */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!_n(e.X)) throw e.ot(t._methodName + "() can only be used with update() and set()");
+        if (!bn(e.X)) throw e.ot(t._methodName + "() can only be used with update() and set()");
         if (!e.path) throw e.ot(t._methodName + "() is not currently supported inside arrays");
         var n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
@@ -3861,10 +3861,10 @@ var Dn = /** @class */ function(e) {
         // the set of values to be included for the IN query) that may directly
         // contain additional arrays (each representing an individual field
         // value), so we disable this validation.
-        if (e.settings.nt && 4 /* ArrayArgument */ !== e.X) throw e.ot("Nested arrays are not supported");
+        if (e.settings.et && 4 /* ArrayArgument */ !== e.X) throw e.ot("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.it(r));
+                var a = qn(o[i], e.it(r));
                 null == a && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -3883,7 +3883,7 @@ var Dn = /** @class */ function(e) {
         if (null === (t = h(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return he(e.S, t);
+        if ("number" == typeof t) return le(e.S, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -3891,41 +3891,41 @@ var Dn = /** @class */ function(e) {
             stringValue: t
         };
         if (t instanceof Date) {
-            var n = gt.fromDate(t);
+            var n = vt.fromDate(t);
             return {
-                timestampValue: De(e.S, n)
+                timestampValue: Ve(e.S, n)
             };
         }
-        if (t instanceof gt) {
+        if (t instanceof vt) {
             // 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 gt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            var r = new vt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: De(e.S, r)
+                timestampValue: Ve(e.S, r)
             };
         }
-        if (t instanceof vn) return {
+        if (t instanceof yn) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof mn) return {
-            bytesValue: ke(e.S, t._byteString)
+        if (t instanceof pn) return {
+            bytesValue: De(e.S, t._byteString)
         };
-        if (t instanceof on) {
+        if (t instanceof rn) {
             var i = e.databaseId, o = t.firestore._databaseId;
             if (!o.isEqual(i)) throw e.ot("Document reference is for database " + o.projectId + "/" + o.database + " but should be for database " + i.projectId + "/" + i.database);
             return {
-                referenceValue: Fe(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: Ne(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.ot("Unsupported field value: " + it(t));
+        throw e.ot("Unsupported field value: " + rt(t));
     }(t, e);
 }
 
-function Ln(t, e) {
+function jn(t, e) {
     var n = {};
     return function(t) {
         for (var e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
@@ -3933,8 +3933,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) : _t(t, (function(t, r) {
-        var i = jn(r, e.et(t));
+    e.path && e.path.length > 0 && e.fieldMask.push(e.path) : bt(t, (function(t, r) {
+        var i = qn(r, e.nt(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -3943,35 +3943,35 @@ function Ln(t, e) {
     };
 }
 
-function Rn(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof gt || t instanceof vn || t instanceof mn || t instanceof on || t instanceof yn);
+function Ln(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof vt || t instanceof yn || t instanceof pn || t instanceof rn || t instanceof mn);
 }
 
-function Un(t, e, n) {
-    if (!Rn(n) || !function(t) {
+function Rn(t, e, n) {
+    if (!Ln(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
-        var r = it(n);
+        var r = rt(n);
         throw "an object" === r ? e.ot(t + " a custom object") : e.ot(t + " " + r);
     }
 }
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function xn(t, e, n) {
+ */ function Un(t, e, n) {
     if (
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    (e = h(e)) instanceof pn) return e._internalPath;
-    if ("string" == typeof e) return Cn(t, e);
-    throw Mn("Field path arguments must be of type string or FieldPath.", t, 
+    (e = h(e)) instanceof hn) return e._internalPath;
+    if ("string" == typeof e) return Bn(t, e);
+    throw Cn("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 Bn = new RegExp("[~\\*/\\[\\]]");
+ */ var xn = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -3981,29 +3981,29 @@ function Un(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function Cn(t, e, n) {
-    if (e.search(Bn) >= 0) throw Mn("Invalid field path (" + e + "). Paths must not contain '~', '*', '/', '[', or ']'", t, 
+ */ function Bn(t, e, n) {
+    if (e.search(xn) >= 0) throw Cn("Invalid field path (" + e + "). Paths must not contain '~', '*', '/', '[', or ']'", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return (new (pn.bind.apply(pn, r([ void 0 ], e.split(".")))))._internalPath;
+        return (new (hn.bind.apply(hn, r([ void 0 ], e.split(".")))))._internalPath;
     } catch (r) {
-        throw Mn("Invalid field path (" + e + "). Paths must not be empty, begin with '.', end with '.', or contain '..'", t, 
+        throw Cn("Invalid field path (" + e + "). Paths must not be empty, begin with '.', end with '.', or contain '..'", t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function Mn(t, e, n, r, i) {
+function Cn(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 B(D, (s += ". ") + t + u)
+    u += ")"), new x(V, (s += ". ") + t + u)
     /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */;
 }
 
-function Gn(t, e) {
+function Mn(t, e) {
     return t.some((function(t) {
         return t.isEqual(e);
     }));
@@ -4033,7 +4033,7 @@ function Gn(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 Gn = /** @class */ function() {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4054,7 +4054,7 @@ function Gn(t, e) {
          * The `DocumentReference` for the document included in the `DocumentSnapshot`.
          */
         get: function() {
-            return new on(this._firestore, this._converter, this._key);
+            return new rn(this._firestore, this._converter, this._key);
         },
         enumerable: !1,
         configurable: !0
@@ -4079,7 +4079,7 @@ function Gn(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 zn(this._firestore, this._userDataWriter, this._key, this._document, 
+                var t = new Qn(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4099,11 +4099,11 @@ function Gn(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(Wn("DocumentSnapshot.get", t));
+            var e = this._document.data.field(Kn("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }, t;
-}(), zn = /** @class */ function(e) {
+}(), Qn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4115,7 +4115,7 @@ function Gn(t, e) {
      */    return t(n, e), n.prototype.data = function() {
         return e.prototype.data.call(this);
     }, n;
-}(Qn), Hn = /** @class */ function() {
+}(Gn), zn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._docs = e, this.query = t;
@@ -4169,15 +4169,15 @@ function Gn(t, e) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */
-function Kn(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 && hn(t.query, e.query) && vt(t.docs, e.docs, Kn)
+function Hn(t, e) {
+    return t = h(t), e = h(e), t instanceof Gn && e instanceof Gn ? 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 zn && e instanceof zn && ln(t.query, e.query) && yt(t.docs, e.docs, Hn)
     /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */;
 }
 
-function Wn(t, e) {
-    return "string" == typeof e ? Cn(t, e) : e instanceof pn ? e._internalPath : e._delegate._internalPath;
+function Kn(t, e) {
+    return "string" == typeof e ? Bn(t, e) : e instanceof hn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4203,7 +4203,7 @@ function Wn(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 Yn = function() {};
+ */ var Wn = function() {};
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4213,7 +4213,7 @@ function Wn(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 Yn(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];
@@ -4222,39 +4222,39 @@ function Wn(t, e) {
     return t;
 }
 
-var $n = /** @class */ function(e) {
+var Xn = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this) || this).ft = t, i.dt = n, i.wt = r, i.type = "where", 
         i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = En(t.firestore), n = function(t, e, n, r, i, o, a) {
+        var e = Tn(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 B(D, "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 x(V, "Invalid Query. You can't perform '" + o + "' queries on FieldPath.documentId().");
                 if ("in" /* IN */ === o || "not-in" /* NOT_IN */ === o) {
-                    hr(a, o);
+                    lr(a, o);
                     for (var u = [], c = 0, f = a; c < f.length; c++) {
                         var l = f[c];
-                        u.push(lr(r, t, l));
+                        u.push(fr(r, t, l));
                     }
                     s = {
                         arrayValue: {
                             values: u
                         }
                     };
-                } else s = lr(r, t, a);
-            } else "in" /* IN */ !== o && "not-in" /* NOT_IN */ !== o && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== o || hr(a, o), 
-            s = qn(n, "where", a, 
+                } else s = fr(r, t, a);
+            } else "in" /* IN */ !== o && "not-in" /* NOT_IN */ !== o && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== o || lr(a, o), 
+            s = On(n, "where", a, 
             /* allowArrays= */ "in" /* IN */ === o || "not-in" /* NOT_IN */ === o);
-            var h = Ht.create(i, o, s);
+            var h = zt.create(i, o, s);
             return function(t, e) {
-                if (e.N()) {
-                    var n = ue(t);
-                    if (null !== n && !n.isEqual(e.field)) throw new B(D, "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 = se(t);
-                    null !== r && pr(t, e.field, r);
+                if (e.D()) {
+                    var n = se(t);
+                    if (null !== n && !n.isEqual(e.field)) throw new x(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 = ae(t);
+                    null !== r && hr(t, e.field, r);
                 }
                 var i = function(t, e) {
                     for (var n = 0, r = t.filters; n < r.length; n++) {
@@ -4298,15 +4298,15 @@ var $n = /** @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 B(D, "Invalid query. You cannot use more than one '" + e.op.toString() + "' filter.") : new B(D, "Invalid query. You cannot use '" + e.op.toString() + "' filters with '" + i.toString() + "' filters.");
+                throw i === e.op ? new x(V, "Invalid query. You cannot use more than one '" + e.op.toString() + "' filter.") : new x(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.ft, this.dt, this.wt);
-        return new an(t.firestore, t.converter, function(t, e) {
+        return new on(t.firestore, t.converter, function(t, e) {
             var n = t.filters.concat([ e ]);
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+            return new ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }, n;
-}(Yn);
+}(Wn);
 
 /**
  * Creates a {@link QueryConstraint} that enforces that documents must contain the
@@ -4318,36 +4318,36 @@ var $n = /** @class */ function(e) {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function Jn(t, e, n) {
-    var r = e, i = Wn("where", t);
-    return new $n(i, r, n);
+ */ function $n(t, e, n) {
+    var r = e, i = Kn("where", t);
+    return new Xn(i, r, n);
 }
 
-var Zn = /** @class */ function(e) {
+var Jn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).ft = t, r.yt = 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 B(D, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
-            if (null !== t.endAt) throw new B(D, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            var r = new ne(e, n);
+            if (null !== t.startAt) throw new x(V, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new x(V, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            var r = new ee(e, n);
             return function(t, e) {
-                if (null === se(t)) {
+                if (null === ae(t)) {
                     // This is the first order by. It must match any inequality.
-                    var n = ue(t);
-                    null !== n && pr(t, n, e.field);
+                    var n = se(t);
+                    null !== n && hr(t, n, e.field);
                 }
             }(t, r), r;
         }(t._query, this.ft, this.yt);
-        return new an(t.firestore, t.converter, function(t, e) {
+        return new on(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 oe(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new ie(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }, n;
-}(Yn);
+}(Wn);
 
 /**
  * Creates a {@link QueryConstraint} that sorts the query result by the
@@ -4357,31 +4357,31 @@ var Zn = /** @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 tr(t, e) {
+ */ function Zn(t, e) {
     void 0 === e && (e = "asc");
-    var n = e, r = Wn("orderBy", t);
-    return new Zn(r, n);
+    var n = e, r = Kn("orderBy", t);
+    return new Jn(r, n);
 }
 
-var er = /** @class */ function(e) {
+var tr = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this) || this).type = t, i._t = n, i.gt = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        return new an(t.firestore, t.converter, function(t, e, n) {
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        return new on(t.firestore, t.converter, function(t, e, n) {
+            return new ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
         }(t._query, this._t, this.gt));
     }, n;
-}(Yn);
+}(Wn);
 
 /**
  * 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 nr(t) {
-    return at("limit", t), new er("limit", t, "F" /* First */)
+ */ function er(t) {
+    return ot("limit", t), new tr("limit", t, "F" /* First */)
     /**
  * Creates a {@link QueryConstraint} that only returns the last matching documents.
  *
@@ -4393,60 +4393,60 @@ var er = /** @class */ function(e) {
  */;
 }
 
-function rr(t) {
-    return at("limitToLast", t), new er("limitToLast", t, "L" /* Last */);
+function nr(t) {
+    return ot("limitToLast", t), new tr("limitToLast", t, "L" /* Last */);
 }
 
-var ir = /** @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.bt = n, i.vt = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = fr(t, this.type, this.bt, this.vt);
-        return new an(t.firestore, t.converter, function(t, e) {
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+        var e = cr(t, this.type, this.bt, this.vt);
+        return new on(t.firestore, t.converter, function(t, e) {
+            return new ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }, n;
-}(Yn);
+}(Wn);
 
-function or() {
+function ir() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new ir("startAt", t, /*before=*/ !0);
+    return new rr("startAt", t, /*before=*/ !0);
 }
 
-function ar() {
+function or() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new ir("startAfter", t, 
+    return new rr("startAfter", t, 
     /*before=*/ !1);
 }
 
-var sr = /** @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.bt = n, i.vt = r, i;
     }
     return t(n, e), n.prototype._apply = function(t) {
-        var e = fr(t, this.type, this.bt, this.vt);
-        return new an(t.firestore, t.converter, function(t, e) {
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+        var e = cr(t, this.type, this.bt, this.vt);
+        return new on(t.firestore, t.converter, function(t, e) {
+            return new ie(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }, n;
-}(Yn);
+}(Wn);
 
-function ur() {
+function sr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new sr("endBefore", t, /*before=*/ !0);
+    return new ar("endBefore", t, /*before=*/ !0);
 }
 
-function cr() {
+function ur() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return new sr("endAt", t, /*before=*/ !1);
+    return new ar("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 B(P, "Can't use a DocumentSnapshot that doesn't exist for " + n + "().");
+/** Helper function to create a bound from a document or fields */ function cr(t, e, n, r) {
+    if (n[0] = h(n[0]), n[0] instanceof Gn) return function(t, e, n, r, i) {
+        if (!r) throw new x(k, "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
@@ -4454,65 +4454,65 @@ function cr() {
         // 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 = ce(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(jt(e, r.key)); else {
                 var c = r.data.field(u.field);
-                if (Dt(c)) throw new B(D, '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 (Vt(c)) throw new x(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 f = u.field.canonicalString();
-                    throw new B(D, "Invalid query. You are trying to start or end a query using a document for which the field '" + f + "' (used as the orderBy) does not exist.");
+                    throw new x(V, "Invalid query. You are trying to start or end a query using a document for which the field '" + f + "' (used as the orderBy) does not exist.");
                 }
                 o.push(c);
             }
         }
-        return new ee(o, i);
+        return new te(o, i);
     }(t._query, t.firestore._databaseId, e, n[0]._document, r);
-    var i = En(t.firestore);
+    var i = Tn(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 B(D, "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 x(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 B(D, "Invalid query. Expected a string for document ID in " + r + "(), but got a " + typeof c);
-                if (!ce(t) && -1 !== c.indexOf("/")) throw new B(D, "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 f = t.path.child($.fromString(c));
-                if (!tt.isDocumentKey(f)) throw new B(D, "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 '" + f + "' is not because it contains an odd number of segments.");
-                var l = new tt(f);
-                s.push(Lt(e, l));
+                if ("string" != typeof c) throw new x(V, "Invalid query. Expected a string for document ID in " + r + "(), but got a " + typeof c);
+                if (!ue(t) && -1 !== c.indexOf("/")) throw new x(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 f = t.path.child(X.fromString(c));
+                if (!Z.isDocumentKey(f)) throw new x(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 '" + f + "' is not because it contains an odd number of segments.");
+                var l = new Z(f);
+                s.push(jt(e, l));
             } else {
-                var h = qn(n, r, c);
+                var h = On(n, r, c);
                 s.push(h);
             }
         }
-        return new ee(s, o);
+        return new te(s, o);
     }(t._query, t.firestore._databaseId, i, e, n, r);
 }
 
-function lr(t, e, n) {
+function fr(t, e, n) {
     if ("string" == typeof (n = h(n))) {
-        if ("" === n) throw new B(D, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!ce(e) && -1 !== n.indexOf("/")) throw new B(D, "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($.fromString(n));
-        if (!tt.isDocumentKey(r)) throw new B(D, "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 tt(r));
+        if ("" === n) throw new x(V, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
+        if (!ue(e) && -1 !== n.indexOf("/")) throw new x(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(X.fromString(n));
+        if (!Z.isDocumentKey(r)) throw new x(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 jt(t, new Z(r));
     }
-    if (n instanceof on) return Lt(t, n._key);
-    throw new B(D, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: " + it(n) + ".");
+    if (n instanceof rn) return jt(t, n._key);
+    throw new x(V, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: " + rt(n) + ".");
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function hr(t, e) {
-    if (!Array.isArray(t) || 0 === t.length) throw new B(D, "Invalid Query. A non-empty array is required for '" + e.toString() + "' filters.");
-    if (t.length > 10) throw new B(D, "Invalid Query. '" + e.toString() + "' filters support a maximum of 10 elements in the value array.");
+ */ function lr(t, e) {
+    if (!Array.isArray(t) || 0 === t.length) throw new x(V, "Invalid Query. A non-empty array is required for '" + e.toString() + "' filters.");
+    if (t.length > 10) throw new x(V, "Invalid Query. '" + e.toString() + "' filters support a maximum of 10 elements in the value array.");
 }
 
-function pr(t, e, n) {
-    if (!n.isEqual(e)) throw new B(D, "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 hr(t, e, n) {
+    if (!n.isEqual(e)) throw new x(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.");
 }
 
 /**
@@ -4568,21 +4568,21 @@ function pr(t, e, n) {
     return t ? n && (n.merge || n.mergeFields) ? t.toFirestore(e, n) : t.toFirestore(e) : e;
 }
 
-var mr = /** @class */ function(e) {
+var pr = /** @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 mn(t);
+        return new pn(t);
     }, n.prototype.convertReference = function(t) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new on(this.firestore, /* converter= */ null, e);
+        return new rn(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"), Pt(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -4590,7 +4590,7 @@ var mr = /** @class */ function(e) {
             return t.booleanValue;
 
           case 2 /* NumberValue */ :
-            return At(t.integerValue || t.doubleValue);
+            return It(t.integerValue || t.doubleValue);
 
           case 3 /* TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -4602,7 +4602,7 @@ var mr = /** @class */ function(e) {
             return t.stringValue;
 
           case 6 /* BlobValue */ :
-            return this.convertBytes(Vt(t.bytesValue));
+            return this.convertBytes(At(t.bytesValue));
 
           case 7 /* RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -4621,11 +4621,11 @@ var mr = /** @class */ function(e) {
         }
     }, t.prototype.convertObject = function(t, e) {
         var n = this, r = {};
-        return _t(t.fields, (function(t, i) {
+        return bt(t.fields, (function(t, i) {
             r[t] = n.convertValue(i, e);
         })), r;
     }, t.prototype.convertGeoPoint = function(t) {
-        return new vn(At(t.latitude), At(t.longitude));
+        return new yn(It(t.latitude), It(t.longitude));
     }, t.prototype.convertArray = function(t, e) {
         var n = this;
         return (t.values || []).map((function(t) {
@@ -4634,22 +4634,22 @@ var mr = /** @class */ function(e) {
     }, t.prototype.convertServerTimestamp = function(t, e) {
         switch (e) {
           case "previous":
-            var n = kt(t);
+            var n = Dt(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Pt(t));
+            return this.convertTimestamp(kt(t));
 
           default:
             return null;
         }
     }, t.prototype.convertTimestamp = function(t) {
-        var e = It(t);
-        return new gt(e.seconds, e.nanos);
+        var e = Et(t);
+        return new vt(e.seconds, e.nanos);
     }, t.prototype.convertDocumentKey = function(t, e) {
-        var n = $.fromString(t);
-        T(Ge(n));
-        var r = new Y(n.get(1), n.get(3)), i = new tt(n.popFirst(5));
+        var n = X.fromString(t);
+        T(Me(n));
+        var r = new W(n.get(1), n.get(3)), i = new Z(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."), 
@@ -4669,12 +4669,12 @@ var mr = /** @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 yr(t) {
-    var e = $e((t = ot(t, on)).firestore), n = new mr(t.firestore);
-    return We(e, [ t._key ]).then((function(e) {
+ */ function mr(t) {
+    var e = Xe((t = it(t, rn)).firestore), n = new pr(t.firestore);
+    return Ke(e, [ t._key ]).then((function(e) {
         T(1 === e.length);
         var r = e[0];
-        return new Qn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new Gn(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -4689,35 +4689,35 @@ var mr = /** @class */ function(e) {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function vr(t) {
+ */ function yr(t) {
     !function(t) {
-        if (ae(t) && 0 === t.explicitOrderBy.length) throw new B(R, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = ot(t, an))._query);
-    var e = $e(t.firestore), n = new mr(t.firestore);
-    return Ye(e, t._query).then((function(e) {
+        if (oe(t) && 0 === t.explicitOrderBy.length) throw new x(L, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = it(t, on))._query);
+    var e = Xe(t.firestore), n = new pr(t.firestore);
+    return We(e, t._query).then((function(e) {
         var r = e.map((function(e) {
-            return new zn(t.firestore, n, e.key, e, t.converter);
+            return new Qn(t.firestore, n, e.key, e, t.converter);
         }));
-        return ae(t._query) && 
+        return oe(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 zn(t, r);
     }));
 }
 
-function gr(t, e, n) {
-    var r = dr((t = ot(t, on)).converter, e, n), i = In(En(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return Ke($e(t.firestore), [ i.toMutation(t._key, we.none()) ]);
+function vr(t, e, n) {
+    var r = dr((t = it(t, rn)).converter, e, n), i = En(Tn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return He(Xe(t.firestore), [ i.toMutation(t._key, ge.none()) ]);
 }
 
-function wr(t, e, n) {
+function gr(t, e, n) {
     for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-    var o, a = En((t = ot(t, on)).firestore);
+    var o, a = Tn((t = it(t, rn)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-        return o = "string" == typeof (e = h(e)) || e instanceof pn ? On(a, "updateDoc", t._key, e, n, r) : Fn(a, "updateDoc", t._key, e), 
-    Ke($e(t.firestore), [ o.toMutation(t._key, we.exists(!0)) ]);
+        return o = "string" == typeof (e = h(e)) || e instanceof hn ? Fn(a, "updateDoc", t._key, e, n, r) : Nn(a, "updateDoc", t._key, e), 
+    He(Xe(t.firestore), [ o.toMutation(t._key, ge.exists(!0)) ]);
 }
 
 /**
@@ -4731,8 +4731,8 @@ function wr(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 br(t) {
-    return Ke($e((t = ot(t, on)).firestore), [ new Te(t._key, we.none()) ]);
+ */ function wr(t) {
+    return He(Xe((t = it(t, rn)).firestore), [ new Se(t._key, ge.none()) ]);
 }
 
 /**
@@ -4748,9 +4748,9 @@ function wr(t, e, n) {
  * @param data - An Object containing the data for the new document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function _r(t, e) {
-    var n = fn(t = ot(t, sn)), r = dr(t.converter, e), i = In(En(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return Ke($e(t.firestore), [ i.toMutation(n._key, we.exists(!1)) ]).then((function() {
+ */ function br(t, e) {
+    var n = cn(t = it(t, an)), r = dr(t.converter, e), i = En(Tn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return He(Xe(t.firestore), [ i.toMutation(n._key, ge.exists(!1)) ]).then((function() {
         return n;
     }));
 }
@@ -4774,15 +4774,15 @@ function wr(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 An("deleteField");
+ */ function _r() {
+    return new In("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 Tr() {
-    return new Dn("serverTimestamp");
+ */ function Sr() {
+    return new Vn("serverTimestamp");
 }
 
 /**
@@ -4796,11 +4796,11 @@ function wr(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 Er() {
+ */ function Tr() {
     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 kn("arrayUnion", t);
+        return new Dn("arrayUnion", t);
 }
 
 /**
@@ -4813,11 +4813,11 @@ function wr(t, e, n) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Ir() {
+ */ function Er() {
     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("arrayRemove", t);
+        return new kn("arrayRemove", t);
 }
 
 /**
@@ -4838,8 +4838,8 @@ function wr(t, e, n) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Ar(t) {
-    return new Nn("increment", t);
+ */ function Ir(t) {
+    return new Pn("increment", t);
 }
 
 /**
@@ -4865,24 +4865,24 @@ function wr(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 Ar = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = En(t);
+        this._dataReader = Tn(t);
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = Dr(t, this._firestore), i = dr(r.converter, e, n), o = In(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
-        return this._mutations.push(o.toMutation(r._key, we.none())), this;
+        var r = Vr(t, this._firestore), i = dr(r.converter, e, n), o = En(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
+        return this._mutations.push(o.toMutation(r._key, ge.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 = Vr(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 pn ? On(this._dataReader, "WriteBatch.update", a._key, e, n, r) : Fn(this._dataReader, "WriteBatch.update", a._key, e), 
-        this._mutations.push(o.toMutation(a._key, we.exists(!0))), this;
+                return o = "string" == typeof (e = h(e)) || e instanceof hn ? Fn(this._dataReader, "WriteBatch.update", a._key, e, n, r) : Nn(this._dataReader, "WriteBatch.update", a._key, e), 
+        this._mutations.push(o.toMutation(a._key, ge.exists(!0))), this;
     }, 
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -4892,8 +4892,8 @@ function wr(t, e, n) {
      */
     t.prototype.delete = function(t) {
         this._verifyNotCommitted();
-        var e = Dr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Te(e._key, we.none())), this;
+        var e = Vr(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Se(e._key, ge.none())), this;
     }, 
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -4910,12 +4910,12 @@ function wr(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 B(q, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new x(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 B(D, "Provided document reference is from a different Firestore instance.");
+function Vr(t, e) {
+    if ((t = h(t)).firestore !== e) throw new x(V, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -4931,10 +4931,10 @@ function Dr(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function kr(t) {
-    var e = $e(t = ot(t, Ze));
-    return new Vr(t, (function(t) {
-        return Ke(e, t);
+ */ function Dr(t) {
+    var e = Xe(t = it(t, Je));
+    return new Ar(t, (function(t) {
+        return He(e, t);
     }));
 }
 
@@ -4957,7 +4957,7 @@ function Dr(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ var Pr = /** @class */ function() {
+ */ var kr = /** @class */ function() {
     function t(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -4981,8 +4981,8 @@ function Dr(t, e) {
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new B(D, "Firestore transactions require all reads to be executed before all writes.");
-                    return [ 4 /*yield*/ , We(this.datastore, t) ];
+                    if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new x(V, "Firestore transactions require all reads to be executed before all writes.");
+                    return [ 4 /*yield*/ , Ke(this.datastore, t) ];
 
                   case 1:
                     return [ 2 /*return*/ , ((e = n.sent()).forEach((function(t) {
@@ -5001,7 +5001,7 @@ function Dr(t, e) {
         }
         this.writtenDocs.add(t.toString());
     }, t.prototype.delete = function(t) {
-        this.write(new Te(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Se(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;
@@ -5017,9 +5017,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 = tt.fromPath(n);
-                        e.mutations.push(new Ee(r, e.precondition(r)));
-                    })), [ 4 /*yield*/ , Ke(this.datastore, this.mutations) ];
+                        var r = Z.fromPath(n);
+                        e.mutations.push(new Te(r, e.precondition(r)));
+                    })), [ 4 /*yield*/ , He(this.datastore, this.mutations) ];
 
                   case 1:
                     // For each mutation, note that the doc was written.
@@ -5032,13 +5032,13 @@ function Dr(t, e) {
         if (t.isFoundDocument()) e = t.version; else {
             if (!t.isNoDocument()) throw S();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
-                        e = wt.min();
+                        e = gt.min();
         }
         var n = this.readVersions.get(t.key.toString());
         if (n) {
             if (!e.isEqual(n)) 
             // This transaction will fail no matter what.
-            throw new B(j, "Document version changed between two reads.");
+            throw new x(q, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }, 
     /**
@@ -5047,7 +5047,7 @@ function Dr(t, e) {
      */
     t.prototype.precondition = function(t) {
         var e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? we.updateTime(e) : we.none();
+        return !this.writtenDocs.has(t.toString()) && e ? ge.updateTime(e) : ge.none();
     }, 
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5057,7 +5057,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(wt.min())) 
+            if (e.isEqual(gt.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
@@ -5067,31 +5067,31 @@ 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 B(D, "Can't update a document that doesn't exist.");
+            throw new x(V, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return we.updateTime(e);
+                        return ge.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-                return we.exists(!0);
+                return ge.exists(!0);
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), Nr = /** @class */ function() {
+}(), Pr = /** @class */ function() {
     function t(t, e, n, r) {
         this.asyncQueue = t, this.datastore = e, this.updateFunction = n, this.deferred = r, 
-        this.Et = 5, this.It = new ze(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
+        this.Et = 5, this.Tt = new Qe(this.asyncQueue, "transaction_retry" /* TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.run = function() {
-        this.Et -= 1, this.Tt();
-    }, t.prototype.Tt = function() {
+        this.Et -= 1, this.It();
+    }, t.prototype.It = function() {
         var t = this;
-        this.It.W((function() {
+        this.Tt.G((function() {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new Pr(this.datastore), (e = this.At(t)) && e.then((function(e) {
+                    return t = new kr(this.datastore), (e = this.At(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
@@ -5108,7 +5108,7 @@ function Dr(t, e) {
     }, t.prototype.At = function(t) {
         try {
             var e = this.updateFunction(t);
-            return !st(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !at(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.
@@ -5117,7 +5117,7 @@ function Dr(t, e) {
     }, t.prototype.Pt = function(t) {
         var e = this;
         this.Et > 0 && this.Rt(t) ? (this.Et -= 1, this.asyncQueue.enqueueAndForget((function() {
-            return e.Tt(), Promise.resolve();
+            return e.It(), Promise.resolve();
         }))) : this.deferred.reject(t);
     }, t.prototype.Rt = function(t) {
         if ("FirebaseError" === t.name) {
@@ -5133,36 +5133,33 @@ function Dr(t, e) {
  */
             function(t) {
                 switch (t) {
-                  case I:
+                  default:
                     return S();
 
+                  case I:
                   case A:
-                  case V:
-                  case k:
-                  case O:
+                  case D:
+                  case F:
+                  case R:
                   case U:
-                  case x:
  // 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 D:
-                  case P:
+                  case V:
+                  case k:
                   case "already-exists":
-                  case N:
-                  case q:
+                  case P:
+                  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 j:
+                                      case q:
+                  case j:
                   case L:
-                  case R:
                   case "data-loss":
                     return !0;
-
-                  default:
-                    return S();
                 }
             }(e);
         }
@@ -5206,7 +5203,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 Fr() {
+/** The Platform's 'document' implementation or null if not available. */ function Nr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5238,10 +5235,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 Fr = /** @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 C, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
+        this.deferred = new B, 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.
@@ -5290,7 +5287,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 B(A, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new x(I, "Operation cancelled" + (t ? ": " + t : ""))));
     }, t.prototype.handleDelayElapsed = function() {
         var t = this;
         this.asyncQueue.enqueueAndForget((function() {
@@ -5302,17 +5299,17 @@ function Dr(t, e) {
         null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle), 
         this.timerHandle = null);
     }, t;
-}(), qr = /** @class */ function() {
+}(), Or = /** @class */ function() {
     function t() {
         var t = this;
         // The last promise in the queue.
                 this.Vt = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.Nt = [], 
+        this.Dt = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.Dt = !1, 
+        this.Nt = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
         this.$t = [], 
@@ -5326,20 +5323,20 @@ function Dr(t, e) {
         // List of TimerIds to fast-forward delays for.
         this.xt = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new ze(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.Tt = new Qe(this, "async_queue_retry" /* AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
         this.Ot = function() {
-            var e = Fr();
-            e && g("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.It.H();
+            var e = Nr();
+            e && g("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.Tt.H();
         };
-        var e = Fr();
+        var e = Nr();
         e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Ot);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
         get: function() {
-            return this.Dt;
+            return this.Nt;
         },
         enumerable: !1,
         configurable: !0
@@ -5356,29 +5353,29 @@ function Dr(t, e) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
         this.Lt(t);
     }, t.prototype.enterRestrictedMode = function(t) {
-        if (!this.Dt) {
-            this.Dt = !0, this.qt = t || !1;
-            var e = Fr();
+        if (!this.Nt) {
+            this.Nt = !0, this.qt = t || !1;
+            var e = Nr();
             e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ot);
         }
     }, t.prototype.enqueue = function(t) {
         var e = this;
-        if (this.Ct(), this.Dt) 
+        if (this.Ct(), this.Nt) 
         // Return a Promise which never resolves.
         return new Promise((function() {}));
         // Create a deferred Promise that we can return to the callee. This
         // allows us to return a "hanging Promise" only to the callee and still
         // advance the queue even when the operation is not run.
-                var n = new C;
+                var n = new B;
         return this.Lt((function() {
-            return e.Dt && e.qt ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
+            return e.Nt && e.qt ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
         })).then((function() {
             return n.promise;
         }));
     }, t.prototype.enqueueRetryable = function(t) {
         var e = this;
         this.enqueueAndForget((function() {
-            return e.Nt.push(t), e.Ut();
+            return e.Dt.push(t), e.Ut();
         }));
     }, 
     /**
@@ -5391,14 +5388,14 @@ function Dr(t, e) {
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    if (0 === this.Nt.length) return [ 3 /*break*/ , 5 ];
+                    if (0 === this.Dt.length) return [ 3 /*break*/ , 5 ];
                     n.label = 1;
 
                   case 1:
-                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.Nt[0]() ];
+                    return n.trys.push([ 1, 3, , 4 ]), [ 4 /*yield*/ , this.Dt[0]() ];
 
                   case 2:
-                    return n.sent(), this.Nt.shift(), this.It.reset(), [ 3 /*break*/ , 4 ];
+                    return n.sent(), this.Dt.shift(), this.Tt.reset(), [ 3 /*break*/ , 4 ];
 
                   case 3:
                     if (t = n.sent(), "IndexedDbTransactionError" !== t.name) throw t;
@@ -5407,7 +5404,7 @@ function Dr(t, e) {
                     [ 3 /*break*/ , 4 ];
 
                   case 4:
-                    this.Nt.length > 0 && 
+                    this.Dt.length > 0 && 
                     // If there are additional operations, we re-schedule `retryNextOp()`.
                     // This is necessary to run retryable operations that failed during
                     // their initial attempt since we don't know whether they are already
@@ -5418,7 +5415,7 @@ function Dr(t, e) {
                     // Since `backoffAndRun()` cancels an existing backoff and schedules a
                     // new backoff on every call, there is only ever a single additional
                     // operation in the queue.
-                    this.It.W((function() {
+                    this.Tt.G((function() {
                         return e.Ut();
                     })), n.label = 5;
 
@@ -5430,10 +5427,8 @@ function Dr(t, e) {
     }, t.prototype.Lt = function(t) {
         var e = this, n = this.Vt.then((function() {
             return e.St = !0, t().catch((function(t) {
-                // 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 e.Ft = t, e.St = !1, w("INTERNAL UNHANDLED ERROR: ", 
+                e.Ft = t, e.St = !1;
+                var n = 
                 /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
  * This returns expected output of message + stack when available.
@@ -5443,7 +5438,11 @@ function Dr(t, e) {
                     var e = t.message || "";
                     return t.stack && (e = t.stack.includes(t.message) ? t.stack : t.message + "\n" + t.stack), 
                     e;
-                }(t)), t;
+                }(t);
+                // 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;
             })).then((function(t) {
                 return e.St = !1, t;
             }));
@@ -5454,7 +5453,7 @@ function Dr(t, e) {
         this.Ct(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.xt.indexOf(t) > -1 && (e = 0);
-        var i = Or.createAndSchedule(this, t, e, n, (function(t) {
+        var i = Fr.createAndSchedule(this, t, e, n, (function(t) {
             return r.jt(t);
         }));
         return this.$t.push(i), i;
@@ -5490,7 +5489,7 @@ function Dr(t, e) {
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
      */
-    t.prototype.Mt = function(t) {
+    t.prototype.Bt = function(t) {
         for (var e = 0, n = this.$t; e < n.length; e++) {
             if (n[e].timerId === t) return !0;
         }
@@ -5503,7 +5502,7 @@ function Dr(t, e) {
      * will be drained. Pass TimerId.All to run all delayed operations.
      * @returns a Promise that resolves once all operations have been run.
      */
-    t.prototype.Bt = function(t) {
+    t.prototype.Mt = function(t) {
         var e = this;
         // Note that draining may generate more delayed ops, so we do that first.
                 return this.kt().then((function() {
@@ -5529,10 +5528,10 @@ function Dr(t, e) {
         var e = this.$t.indexOf(t);
         this.$t.splice(e, 1);
     }, t;
-}(), jr = /** @class */ function() {
+}(), qr = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = En(t)
+        this._firestore = t, this._transaction = e, this._dataReader = Tn(t)
         /**
      * Reads the document referenced by the provided {@link DocumentReference}.
      *
@@ -5541,23 +5540,23 @@ function Dr(t, e) {
      */;
     }
     return t.prototype.get = function(t) {
-        var e = this, n = Dr(t, this._firestore), r = new mr(this._firestore);
+        var e = this, n = Vr(t, this._firestore), r = new pr(this._firestore);
         return this._transaction.lookup([ n._key ]).then((function(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);
+            if (i.isFoundDocument()) return new Gn(e._firestore, r, i.key, i, n.converter);
+            if (i.isNoDocument()) return new Gn(e._firestore, r, n._key, null, n.converter);
             throw S();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = Dr(t, this._firestore), i = dr(r.converter, e, n), o = In(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
+        var r = Vr(t, this._firestore), i = dr(r.converter, e, n), o = En(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 = Vr(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 pn ? On(this._dataReader, "Transaction.update", a._key, e, n, r) : Fn(this._dataReader, "Transaction.update", a._key, e), 
+                return o = "string" == typeof (e = h(e)) || e instanceof hn ? Fn(this._dataReader, "Transaction.update", a._key, e, n, r) : Nn(this._dataReader, "Transaction.update", a._key, e), 
         this._transaction.update(a._key, o), this;
     }, 
     /**
@@ -5567,7 +5566,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 = Vr(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }, t;
 }();
@@ -5605,10 +5604,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 = $e(t = ot(t, Ze)), r = new C;
-    return new Nr(new qr, n, (function(n) {
-        return e(new jr(t, n));
+function jr(t, e) {
+    var n = Xe(t = it(t, Je)), r = new B;
+    return new Pr(new Or, n, (function(n) {
+        return e(new qr(t, n));
     }), r).run(), r.promise
     /**
  * Firestore Lite
@@ -5621,9 +5620,11 @@ 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 Ze(r, new z(t.getProvider("auth-internal")));
+    var n = e.options, r = t.getProvider("app").getImmediate(), i = new Je(r, new Q(t.getProvider("auth-internal")));
     return n && i._setSettings(n), i;
-}), "PUBLIC" /* PUBLIC */)), a("firestore-lite", "3.1.0", "node");
+}), "PUBLIC" /* PUBLIC */)), 
+// RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
+a("firestore-lite", "3.1.1-canary.4594d3fd6", ""), a("firestore-lite", "3.1.1-canary.4594d3fd6", "esm5");
 
-export { mn as Bytes, sn as CollectionReference, on as DocumentReference, Qn as DocumentSnapshot, pn as FieldPath, yn as FieldValue, Ze as Firestore, B as FirestoreError, vn as GeoPoint, an as Query, Yn as QueryConstraint, zn as QueryDocumentSnapshot, Hn as QuerySnapshot, gt as Timestamp, jr as Transaction, Vr as WriteBatch, _r as addDoc, Ir as arrayRemove, Er as arrayUnion, un as collection, cn as collectionGroup, nn as connectFirestoreEmulator, br as deleteDoc, Sr as deleteField, fn as doc, dn as documentId, cr as endAt, ur as endBefore, yr as getDoc, vr as getDocs, en as getFirestore, Ar as increment, tn as initializeFirestore, nr as limit, rr as limitToLast, tr as orderBy, Xn as query, hn as queryEqual, ln as refEqual, Lr as runTransaction, Tr as serverTimestamp, gr as setDoc, v as setLogLevel, Kn as snapshotEqual, ar as startAfter, or as startAt, rn as terminate, wr as updateDoc, Jn as where, kr as writeBatch };
+export { pn as Bytes, an as CollectionReference, rn as DocumentReference, Gn as DocumentSnapshot, hn as FieldPath, mn as FieldValue, Je as Firestore, x as FirestoreError, yn as GeoPoint, on as Query, Wn as QueryConstraint, Qn as QueryDocumentSnapshot, zn as QuerySnapshot, vt as Timestamp, qr as Transaction, Ar as WriteBatch, br as addDoc, Er as arrayRemove, Tr as arrayUnion, sn as collection, un as collectionGroup, en as connectFirestoreEmulator, wr as deleteDoc, _r as deleteField, cn as doc, dn as documentId, ur as endAt, sr as endBefore, mr as getDoc, yr as getDocs, tn as getFirestore, Ir as increment, Ze as initializeFirestore, er as limit, nr as limitToLast, Zn as orderBy, Yn as query, ln as queryEqual, fn as refEqual, jr as runTransaction, Sr as serverTimestamp, vr as setDoc, v as setLogLevel, Hn as snapshotEqual, or as startAfter, ir as startAt, nn as terminate, gr as updateDoc, $n as where, Dr as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map