@firebase/firestore 1.14.0-canary.daf63c2c → 1.14.0

package/dist/index.cjs.js

@@ -289,7 +289,7 @@ var h = {
     }, t.prototype.toMillis = function() {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }, t.prototype.p = function(t) {
-        return this.seconds === t.seconds ? Ie(this.nanoseconds, t.nanoseconds) : Ie(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? Ee(this.nanoseconds, t.nanoseconds) : Ee(this.seconds, t.seconds);
     }, t.prototype.isEqual = function(t) {
         return t.seconds === this.seconds && t.nanoseconds === this.nanoseconds;
     }, t.prototype.toString = function() {
@@ -555,7 +555,7 @@ T.EMPTY = new T(new w([]));
  */
 // An immutable sorted map implementation, based on a Left-leaning Red-Black
 // tree.
-var I = /** @class */ function() {
+var E = /** @class */ function() {
     function t(t, e) {
         this.F = t, this.root = e || N.EMPTY;
     }
@@ -634,17 +634,17 @@ var I = /** @class */ function() {
     }, 
     // Returns an iterator over the SortedMap.
     t.prototype._t = function() {
-        return new E(this.root, null, this.F, !1);
+        return new I(this.root, null, this.F, !1);
     }, t.prototype.lt = function(t) {
-        return new E(this.root, t, this.F, !1);
+        return new I(this.root, t, this.F, !1);
     }, t.prototype.dt = function() {
-        return new E(this.root, null, this.F, !0);
+        return new I(this.root, null, this.F, !0);
     }, t.prototype.ft = function(t) {
-        return new E(this.root, t, this.F, !0);
+        return new I(this.root, t, this.F, !0);
     }, t;
-}(), E = /** @class */ function() {
+}(), I = /** @class */ function() {
     function t(t, e, n, r) {
-        this.Tt = r, this.Et = [];
+        this.Tt = r, this.wt = [];
         for (var i = 1; !t.U(); ) if (i = e ? n(t.key, e) : 1, 
         // flip the comparison if we're going in reverse
         r && (i *= -1), i < 0) 
@@ -653,27 +653,27 @@ var I = /** @class */ function() {
             if (0 === i) {
                 // This node is exactly equal to our start key. Push it on the stack,
                 // but stop iterating;
-                this.Et.push(t);
+                this.wt.push(t);
                 break;
             }
             // This node is greater than our start key, add it to the stack and move
             // to the next one
-                        this.Et.push(t), t = this.Tt ? t.right : t.left;
+                        this.wt.push(t), t = this.Tt ? t.right : t.left;
         }
     }
-    return t.prototype.wt = function() {
-        var t = this.Et.pop(), e = {
+    return t.prototype.Et = function() {
+        var t = this.wt.pop(), e = {
             key: t.key,
             value: t.value
         };
-        if (this.Tt) for (t = t.left; !t.U(); ) this.Et.push(t), t = t.right; else for (t = t.right; !t.U(); ) this.Et.push(t), 
+        if (this.Tt) for (t = t.left; !t.U(); ) this.wt.push(t), t = t.right; else for (t = t.right; !t.U(); ) this.wt.push(t), 
         t = t.left;
         return e;
     }, t.prototype.It = function() {
-        return this.Et.length > 0;
+        return this.wt.length > 0;
     }, t.prototype.Rt = function() {
-        if (0 === this.Et.length) return null;
-        var t = this.Et[this.Et.length - 1];
+        if (0 === this.wt.length) return null;
+        var t = this.wt[this.wt.length - 1];
         return {
             key: t.key,
             value: t.value
@@ -878,7 +878,7 @@ N.EMPTY = new (/** @class */ function() {
  */
 var A = /** @class */ function() {
     function t(t) {
-        this.F = t, this.data = new I(this.F);
+        this.F = t, this.data = new E(this.F);
     }
     return t.prototype.has = function(t) {
         return null !== this.data.get(t);
@@ -902,7 +902,7 @@ var A = /** @class */ function() {
     }, 
     /** Iterates over `elem`s such that: range[0] <= elem < range[1]. */ t.prototype.Ct = function(t, e) {
         for (var n = this.data.lt(t[0]); n.It(); ) {
-            var r = n.wt();
+            var r = n.Et();
             if (this.F(r.key, t[1]) >= 0) return;
             e(r.key);
         }
@@ -912,11 +912,11 @@ var A = /** @class */ function() {
      */
     t.prototype.kt = function(t, e) {
         var n;
-        for (n = void 0 !== e ? this.data.lt(e) : this.data._t(); n.It(); ) if (!t(n.wt().key)) return;
+        for (n = void 0 !== e ? this.data.lt(e) : this.data._t(); n.It(); ) if (!t(n.Et().key)) return;
     }, 
     /** Finds the least element greater than or equal to `elem`. */ t.prototype.Nt = function(t) {
         var e = this.data.lt(t);
-        return e.It() ? e.wt().key : null;
+        return e.It() ? e.Et().key : null;
     }, t.prototype._t = function() {
         return new S(this.data._t());
     }, t.prototype.lt = function(t) {
@@ -939,7 +939,7 @@ var A = /** @class */ function() {
         if (!(e instanceof t)) return !1;
         if (this.size !== e.size) return !1;
         for (var n = this.data._t(), r = e.data._t(); n.It(); ) {
-            var i = n.wt().key, o = r.wt().key;
+            var i = n.Et().key, o = r.Et().key;
             if (0 !== this.F(i, o)) return !1;
         }
         return !0;
@@ -961,8 +961,8 @@ var A = /** @class */ function() {
     function t(t) {
         this.$t = t;
     }
-    return t.prototype.wt = function() {
-        return this.$t.wt().key;
+    return t.prototype.Et = function() {
+        return this.$t.Et().key;
     }, t.prototype.It = function() {
         return this.$t.It();
     }, t;
@@ -1047,17 +1047,17 @@ function x(t) {
     }, t.prototype.Ot = function() {
         return 2 * this.Mt.length;
     }, t.prototype.D = function(t) {
-        return Ie(this.Mt, t.Mt);
+        return Ee(this.Mt, t.Mt);
     }, t.prototype.isEqual = function(t) {
         return this.Mt === t.Mt;
     }, t;
 }();
 
-function V(t) {
+function L(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function L(t) {
+/** Returns whether the value represents -0. */ function U(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;
@@ -1066,8 +1066,8 @@ function V(t) {
 /**
  * Returns whether a value is an integer and in the safe integer range
  * @param value The value to test for being an integer and in the safe range
- */ function U(t) {
-    return "number" == typeof t && Number.isInteger(t) && !L(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+ */ function V(t) {
+    return "number" == typeof t && Number.isInteger(t) && !U(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
 }
 
 /**
@@ -1187,13 +1187,13 @@ var C = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
             if ("integerValue" in t && "integerValue" in e) return K(t.integerValue) === K(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
                 var n = K(t.doubleValue), r = K(e.doubleValue);
-                return n === r ? L(n) === L(r) : isNaN(n) && isNaN(r);
+                return n === r ? U(n) === U(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* ArrayValue */ :
-        return Ee(t.arrayValue.values || [], e.arrayValue.values || [], q);
+        return Ie(t.arrayValue.values || [], e.arrayValue.values || [], q);
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
@@ -1216,13 +1216,13 @@ function F(t, e) {
 
 function j(t, e) {
     var n = M(t), r = M(e);
-    if (n !== r) return Ie(n, r);
+    if (n !== r) return Ee(n, r);
     switch (n) {
       case 0 /* NullValue */ :
         return 0;
 
       case 1 /* BooleanValue */ :
-        return Ie(t.booleanValue, e.booleanValue);
+        return Ee(t.booleanValue, e.booleanValue);
 
       case 2 /* NumberValue */ :
         return function(t, e) {
@@ -1239,7 +1239,7 @@ function j(t, e) {
         return G(P(t), P(e));
 
       case 5 /* StringValue */ :
-        return Ie(t.stringValue, e.stringValue);
+        return Ee(t.stringValue, e.stringValue);
 
       case 6 /* BlobValue */ :
         return function(t, e) {
@@ -1250,16 +1250,16 @@ function j(t, e) {
       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 = Ie(n[i], r[i]);
+                var o = Ee(n[i], r[i]);
                 if (0 !== o) return o;
             }
-            return Ie(n.length, r.length);
+            return Ee(n.length, r.length);
         }(t.referenceValue, e.referenceValue);
 
       case 8 /* GeoPointValue */ :
         return function(t, e) {
-            var n = Ie(K(t.latitude), K(e.latitude));
-            return 0 !== n ? n : Ie(K(t.longitude), K(e.longitude));
+            var n = Ee(K(t.latitude), K(e.latitude));
+            return 0 !== n ? n : Ee(K(t.longitude), K(e.longitude));
         }(t.geoPointValue, e.geoPointValue);
 
       case 9 /* ArrayValue */ :
@@ -1268,7 +1268,7 @@ function j(t, e) {
                 var o = j(n[i], r[i]);
                 if (o) return o;
             }
-            return Ie(n.length, r.length);
+            return Ee(n.length, r.length);
         }(t.arrayValue, e.arrayValue);
 
       case 10 /* ObjectValue */ :
@@ -1280,12 +1280,12 @@ function j(t, e) {
             // canonical IDs are independent of insertion order.
                         r.sort(), o.sort();
             for (var s = 0; s < r.length && s < o.length; ++s) {
-                var u = Ie(r[s], o[s]);
+                var u = Ee(r[s], o[s]);
                 if (0 !== u) return u;
                 var a = j(n[r[s]], i[o[s]]);
                 if (0 !== a) return a;
             }
-            return Ie(r.length, o.length);
+            return Ee(r.length, o.length);
         }(t.mapValue, e.mapValue);
 
       default:
@@ -1294,9 +1294,9 @@ function j(t, e) {
 }
 
 function G(t, e) {
-    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return Ie(t, e);
-    var n = z(t), r = z(e), i = Ie(n.seconds, r.seconds);
-    return 0 !== i ? i : Ie(n.nanos, r.nanos);
+    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return Ee(t, e);
+    var n = z(t), r = z(e), i = Ee(n.seconds, r.seconds);
+    return 0 !== i ? i : Ee(n.nanos, r.nanos);
 }
 
 function B(t) {
@@ -1375,7 +1375,7 @@ function z(t) {
 }
 
 /** Returns true if `value` is a DoubleValue. */
-/** Returns true if `value` is an ArrayValue. */ function J(t) {
+/** Returns true if `value` is an ArrayValue. */ function X(t) {
     return !!t && "arrayValue" in t;
 }
 
@@ -1383,7 +1383,7 @@ function z(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function X(t) {
+/** Returns true if `value` is NaN. */ function J(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
@@ -1469,7 +1469,7 @@ var tt = /** @class */ function() {
         return null;
         // Array transforms are idempotent and don't require a base value.
         }, t.prototype.isEqual = function(e) {
-        return e instanceof t && Ee(this.elements, e.elements, q);
+        return e instanceof t && Ie(this.elements, e.elements, q);
     }, t;
 }(), et = /** @class */ function() {
     function t(t) {
@@ -1499,7 +1499,7 @@ var tt = /** @class */ function() {
         return null;
         // Array transforms are idempotent and don't require a base value.
         }, t.prototype.isEqual = function(e) {
-        return e instanceof t && Ee(this.elements, e.elements, q);
+        return e instanceof t && Ie(this.elements, e.elements, q);
     }, t;
 }(), nt = /** @class */ function() {
     function t(t, e) {
@@ -1533,7 +1533,7 @@ var tt = /** @class */ function() {
 }();
 
 /** Transforms an array value via a remove operation. */ function rt(t) {
-    return J(t) && t.arrayValue.values ? t.arrayValue.values.slice() : [];
+    return X(t) && t.arrayValue.values ? t.arrayValue.values.slice() : [];
 }
 
 /**
@@ -1812,7 +1812,7 @@ var at = /** @class */ function() {
         }
         return e ? e.oe() : null;
     }, n.prototype.isEqual = function(t) {
-        return t instanceof n && this.key.isEqual(t.key) && Ee(this.fieldTransforms, t.fieldTransforms, (function(t, e) {
+        return t instanceof n && this.key.isEqual(t.key) && Ie(this.fieldTransforms, t.fieldTransforms, (function(t, e) {
             return t.isEqual(e);
         })) && this.Zt.isEqual(t.Zt);
     }, 
@@ -2051,25 +2051,25 @@ var yt = /** @class */ function() {
     function t(t, e) {
         this.key = t, this.version = e;
     }
-    return t.Ee = function(t, e) {
+    return t.we = function(t, e) {
         return T.F(t.key, e.key);
     }, t;
 }(), vt = /** @class */ function(t) {
     function n(e, n, r, i) {
         var o = this;
-        return (o = t.call(this, e, n) || this).we = r, o.te = !!i.te, o.hasCommittedMutations = !!i.hasCommittedMutations, 
+        return (o = t.call(this, e, n) || this).Ee = r, o.te = !!i.te, o.hasCommittedMutations = !!i.hasCommittedMutations, 
         o;
     }
     return e.__extends(n, t), n.prototype.field = function(t) {
-        return this.we.field(t);
+        return this.Ee.field(t);
     }, n.prototype.data = function() {
-        return this.we;
+        return this.Ee;
     }, n.prototype.Ie = function() {
-        return this.we.proto;
+        return this.Ee.proto;
     }, n.prototype.isEqual = function(t) {
-        return t instanceof n && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.te === t.te && this.hasCommittedMutations === t.hasCommittedMutations && this.we.isEqual(t.we);
+        return t instanceof n && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.te === t.te && this.hasCommittedMutations === t.hasCommittedMutations && this.Ee.isEqual(t.Ee);
     }, n.prototype.toString = function() {
-        return "Document(" + this.key + ", " + this.version + ", " + this.we.toString() + ", {hasLocalMutations: " + this.te + "}), {hasCommittedMutations: " + this.hasCommittedMutations + "})";
+        return "Document(" + this.key + ", " + this.version + ", " + this.Ee.toString() + ", {hasLocalMutations: " + this.te + "}), {hasCommittedMutations: " + this.hasCommittedMutations + "})";
     }, Object.defineProperty(n.prototype, "hasPendingWrites", {
         get: function() {
             return this.te || this.hasCommittedMutations;
@@ -2135,7 +2135,7 @@ var yt = /** @class */ function() {
                 return t.canonicalId();
             })).join(","), t += "|ob:", t += this.orderBy.map((function(t) {
                 return t.canonicalId();
-            })).join(","), V(this.limit) || (t += "|l:", t += this.limit), this.startAt && (t += "|lb:", 
+            })).join(","), L(this.limit) || (t += "|l:", t += this.limit), this.startAt && (t += "|lb:", 
             t += this.startAt.canonicalId()), this.endAt && (t += "|ub:", t += this.endAt.canonicalId()), 
             this.Ae = t;
         }
@@ -2144,7 +2144,7 @@ var yt = /** @class */ function() {
         var t = this.path.K();
         return null !== this.collectionGroup && (t += " collectionGroup=" + this.collectionGroup), 
         this.filters.length > 0 && (t += ", filters: [" + this.filters.join(", ") + "]"), 
-        V(this.limit) || (t += ", limit: " + this.limit), this.orderBy.length > 0 && (t += ", orderBy: [" + this.orderBy.join(", ") + "]"), 
+        L(this.limit) || (t += ", limit: " + this.limit), this.orderBy.length > 0 && (t += ", orderBy: [" + this.orderBy.join(", ") + "]"), 
         this.startAt && (t += ", startAt: " + this.startAt.canonicalId()), this.endAt && (t += ", endAt: " + this.endAt.canonicalId()), 
         "Target(" + t + ")";
     }, t.prototype.isEqual = function(t) {
@@ -2181,7 +2181,7 @@ var yt = /** @class */ function() {
                 // In order to implicitly add key ordering, we must also add the
                 // inequality filter field for it to be a valid query.
                 // Note that the default inequality field and key ordering is ascending.
-                t.Y() ? this.pe = [ Ut ] : this.pe = [ new Lt(t), Ut ]; else {
+                t.Y() ? this.pe = [ Vt ] : this.pe = [ new Ut(t), Vt ]; else {
                     this.pe = [];
                     for (var n = !1, r = 0, i = this.Ve; r < i.length; r++) {
                         var o = i[r];
@@ -2191,7 +2191,7 @@ var yt = /** @class */ function() {
                         // The order of the implicit key ordering always matches the last
                         // explicit order by
                         var s = this.Ve.length > 0 ? this.Ve[this.Ve.length - 1].dir : kt.ASCENDING;
-                        this.pe.push(s === kt.ASCENDING ? Ut : Ot);
+                        this.pe.push(s === kt.ASCENDING ? Vt : Ot);
                     }
                 }
             }
@@ -2251,15 +2251,15 @@ var yt = /** @class */ function() {
     }, t.prototype.matches = function(t) {
         return this.Ue(t) && this.qe(t) && this.Qe(t) && this.We(t);
     }, t.prototype.je = function() {
-        return !V(this.limit) && "F" /* First */ === this.ge;
+        return !L(this.limit) && "F" /* First */ === this.ge;
     }, t.prototype.Ke = function() {
-        return !V(this.limit) && "L" /* Last */ === this.ge;
+        return !L(this.limit) && "L" /* Last */ === this.ge;
     }, t.prototype.De = function() {
         return this.Ve.length > 0 ? this.Ve[0].field : null;
     }, t.prototype.Se = function() {
         for (var t = 0, e = this.filters; t < e.length; t++) {
             var n = e[t];
-            if (n instanceof It && n.Ge()) return n.field;
+            if (n instanceof Et && n.Ge()) return n.field;
         }
         return null;
     }, 
@@ -2268,7 +2268,7 @@ var yt = /** @class */ function() {
     t.prototype.ze = function(t) {
         for (var e = 0, n = this.filters; e < n.length; e++) {
             var r = n[e];
-            if (r instanceof It && t.indexOf(r.op) >= 0) return r.op;
+            if (r instanceof Et && t.indexOf(r.op) >= 0) return r.op;
         }
         return null;
     }, t.prototype.Pe = function() {
@@ -2286,10 +2286,10 @@ var yt = /** @class */ function() {
             // Flip the orderBy directions since we want the last results
             var t = [], e = 0, n = this.orderBy; e < n.length; e++) {
                 var r = n[e], i = r.dir === kt.DESCENDING ? kt.ASCENDING : kt.DESCENDING;
-                t.push(new Lt(r.field, i));
+                t.push(new Ut(r.field, i));
             }
             // We need to swap the cursors to match the now-flipped query ordering.
-                        var o = this.endAt ? new Vt(this.endAt.position, !this.endAt.before) : null, s = this.startAt ? new Vt(this.startAt.position, !this.startAt.before) : null;
+                        var o = this.endAt ? new Lt(this.endAt.position, !this.endAt.before) : null, s = this.startAt ? new Lt(this.startAt.position, !this.startAt.before) : null;
             // Now return as a LimitType.First query.
                         this.ye = new _t(this.path, this.collectionGroup, t, this.filters, this.limit, o, s);
         }
@@ -2384,7 +2384,7 @@ var yt = /** @class */ function() {
 Tt.GREATER_THAN = new Tt(">"), Tt.GREATER_THAN_OR_EQUAL = new Tt(">="), Tt.ARRAY_CONTAINS = new Tt("array-contains"), 
 Tt.IN = new Tt("in"), Tt.ARRAY_CONTAINS_ANY = new Tt("array-contains-any");
 
-var It = /** @class */ function(t) {
+var Et = /** @class */ function(t) {
     function n(e, n, r) {
         var i = this;
         return (i = t.call(this) || this).field = e, i.op = n, i.value = r, i;
@@ -2392,12 +2392,12 @@ var It = /** @class */ function(t) {
     /**
      * Creates a filter based on the provided arguments.
      */    return e.__extends(n, t), n.create = function(t, e, r) {
-        if (t.Y()) return e === Tt.IN ? new Nt(t, r) : new Et(t, e, r);
+        if (t.Y()) return e === Tt.IN ? new Nt(t, r) : new It(t, e, r);
         if (H(r)) {
             if (e !== Tt.EQUAL) throw new c(h.INVALID_ARGUMENT, "Invalid query. Null supports only equality comparisons.");
             return new n(t, e, r);
         }
-        if (X(r)) {
+        if (J(r)) {
             if (e !== Tt.EQUAL) throw new c(h.INVALID_ARGUMENT, "Invalid query. NaN supports only equality comparisons.");
             return new n(t, e, r);
         }
@@ -2438,7 +2438,7 @@ var It = /** @class */ function(t) {
     }, n.prototype.toString = function() {
         return this.field.K() + " " + this.op + " " + B(this.value);
     }, n;
-}((function() {})), Et = /** @class */ function(t) {
+}((function() {})), It = /** @class */ function(t) {
     function n(e, n, r) {
         var i = this;
         return (i = t.call(this, e, n, r) || this).key = T.tt(r.referenceValue), i;
@@ -2447,7 +2447,7 @@ var It = /** @class */ function(t) {
         var e = T.F(t.key, this.key);
         return this.Ye(e);
     }, n;
-}(It), Nt = /** @class */ function(t) {
+}(Et), Nt = /** @class */ function(t) {
     function n(e, n) {
         var r = this;
         return (r = t.call(this, e, Tt.IN, n) || this).keys = (n.arrayValue.values || []).map((function(t) {
@@ -2459,15 +2459,15 @@ var It = /** @class */ function(t) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(It), At = /** @class */ function(t) {
+}(Et), At = /** @class */ function(t) {
     function n(e, n) {
         return t.call(this, e, Tt.ARRAY_CONTAINS, n) || this;
     }
     return e.__extends(n, t), n.prototype.matches = function(t) {
         var e = t.field(this.field);
-        return J(e) && F(e.arrayValue, this.value);
+        return X(e) && F(e.arrayValue, this.value);
     }, n;
-}(It), St = /** @class */ function(t) {
+}(Et), St = /** @class */ function(t) {
     function n(e, n) {
         return t.call(this, e, Tt.IN, n) || this;
     }
@@ -2475,17 +2475,17 @@ var It = /** @class */ function(t) {
         var e = t.field(this.field);
         return null !== e && F(this.value.arrayValue, e);
     }, n;
-}(It), Dt = /** @class */ function(t) {
+}(Et), Dt = /** @class */ function(t) {
     function n(e, n) {
         return t.call(this, e, Tt.ARRAY_CONTAINS_ANY, n) || this;
     }
     return e.__extends(n, t), n.prototype.matches = function(t) {
         var e = this, n = t.field(this.field);
-        return !(!J(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
+        return !(!X(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
             return F(e.value.arrayValue, t);
         }));
     }, n;
-}(It), kt = /** @class */ function() {
+}(Et), kt = /** @class */ function() {
     function t(t) {
         this.name = t;
     }
@@ -2511,7 +2511,7 @@ kt.DESCENDING = new kt("desc");
  * after a bound. This is influenced by whether the position is just before or
  * just after the provided values.
  */
-var xt, Rt, Vt = /** @class */ function() {
+var xt, Rt, Lt = /** @class */ function() {
     function t(t, e) {
         this.position = t, this.before = e;
     }
@@ -2538,12 +2538,12 @@ var xt, Rt, Vt = /** @class */ function() {
         for (var e = 0; e < this.position.length; e++) if (!q(this.position[e], t.position[e])) return !1;
         return !0;
     }, t;
-}(), Lt = /** @class */ function() {
+}(), Ut = /** @class */ function() {
     function t(t, e) {
         this.field = t, void 0 === e && (e = kt.ASCENDING), this.dir = e, this.Xe = t.Y();
     }
     return t.prototype.compare = function(t, e) {
-        var n = this.Xe ? vt.Ee(t, e) : vt.Re(this.field, t, e);
+        var n = this.Xe ? vt.we(t, e) : vt.Re(this.field, t, e);
         switch (this.dir) {
           case kt.ASCENDING:
             return n;
@@ -2562,7 +2562,7 @@ var xt, Rt, Vt = /** @class */ function() {
     }, t.prototype.isEqual = function(t) {
         return this.dir === t.dir && this.field.isEqual(t.field);
     }, t;
-}(), Ut = new Lt(b.X(), kt.ASCENDING), Ot = new Lt(b.X(), kt.DESCENDING), Pt = /** @class */ function() {
+}(), Vt = new Ut(b.X(), kt.ASCENDING), Ot = new Ut(b.X(), kt.DESCENDING), Pt = /** @class */ function() {
     function t(
     /** The target being listened to. */
     t, 
@@ -2773,7 +2773,7 @@ Rt[Rt.INTERNAL = 13] = "INTERNAL", Rt[Rt.UNAVAILABLE = 14] = "UNAVAILABLE", Rt[R
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var Ft = new I(T.F);
+var Ft = new E(T.F);
 
 function jt() {
     return Ft;
@@ -2783,13 +2783,13 @@ function Gt() {
     return jt();
 }
 
-var Bt = new I(T.F);
+var Bt = new E(T.F);
 
 function zt() {
     return Bt;
 }
 
-var Kt = new I(T.F);
+var Kt = new E(T.F);
 
 function Wt() {
     return Kt;
@@ -2806,10 +2806,10 @@ function Qt() {
     return n;
 }
 
-var Jt = new A(Ie);
+var Xt = new A(Ee);
 
 function Ht() {
-    return Jt;
+    return Xt;
 }
 
 /**
@@ -2833,7 +2833,7 @@ function Ht() {
  * in order specified by the provided comparator. We always add a document key
  * comparator on top of what is provided to guarantee document equality based on
  * the key.
- */ var Xt = /** @class */ function() {
+ */ var Jt = /** @class */ function() {
     /** The default ordering is by key if the comparator is omitted */
     function t(t) {
         // We are adding document key comparator to the end as it's the only
@@ -2842,7 +2842,7 @@ function Ht() {
             return t(e, n) || T.F(e.key, n.key);
         } : function(t, e) {
             return T.F(t.key, e.key);
-        }, this.rs = zt(), this.os = new I(this.F)
+        }, this.rs = zt(), this.os = new E(this.F)
         /**
      * Returns an empty copy of the existing DocumentSet, using the same
      * comparator.
@@ -2892,7 +2892,7 @@ function Ht() {
         if (!(e instanceof t)) return !1;
         if (this.size !== e.size) return !1;
         for (var n = this.os._t(), r = e.os._t(); n.It(); ) {
-            var i = n.wt().key, o = r.wt().key;
+            var i = n.Et().key, o = r.Et().key;
             if (!i.isEqual(o)) return !1;
         }
         return !0;
@@ -2907,7 +2907,7 @@ function Ht() {
     }, t;
 }(), Zt = /** @class */ function() {
     function t() {
-        this.as = new I(T.F);
+        this.as = new E(T.F);
     }
     return t.prototype.track = function(t) {
         var e = t.doc.key, n = this.as.get(e);
@@ -2956,7 +2956,7 @@ function Ht() {
                 type: 0 /* Added */ ,
                 doc: t
             });
-        })), new t(e, n, Xt.hs(n), o, r, i, 
+        })), new t(e, n, Jt.hs(n), o, r, i, 
         /* syncStateChanged= */ !0, 
         /* excludesMetadataChanges= */ !1);
     }, Object.defineProperty(t.prototype, "hasPendingWrites", {
@@ -2996,7 +2996,7 @@ function Ht() {
      * A set of which document updates are due only to limbo resolution targets.
      */
     i) {
-        this.ts = t, this.Ts = e, this.ms = n, this.Es = r, this.ws = i;
+        this.ts = t, this.Ts = e, this.ms = n, this.ws = r, this.Es = i;
     }
     /**
      * HACK: Views require RemoteEvents in order to determine whether the view is
@@ -3199,7 +3199,7 @@ n
              * known to be inconsistent and their listens needs to be re-established by
              * RemoteStore.
              */
-        this.Gs = new A(Ie)
+        this.Gs = new A(Ee)
         /**
      * Processes and adds the DocumentWatchChange to the current set of changes.
      */;
@@ -3330,7 +3330,7 @@ n
             })), i && (r = r.add(t));
         }));
         var i = new te(t, n, this.Gs, this.js, r);
-        return this.js = jt(), this.Ks = ue(), this.Gs = new A(Ie), i;
+        return this.js = jt(), this.Ks = ue(), this.Gs = new A(Ee), i;
     }, 
     /**
      * Adds the provided document to the internal list of document updates and
@@ -3382,7 +3382,7 @@ n
         return e || (e = new oe, this.Ws.set(t, e)), e;
     }, t.prototype.hn = function(t) {
         var e = this.Ks.get(t);
-        return e || (e = new A(Ie), this.Ks = this.Ks.it(t, e)), e;
+        return e || (e = new A(Ee), this.Ks = this.Ks.it(t, e)), e;
     }, 
     /**
      * Verifies that the user is still interested in this target (by calling
@@ -3441,11 +3441,11 @@ n
  * DocumentChangeSet keeps track of a set of changes to docs in a query, merging
  * duplicate events for the same doc.
  */ function ue() {
-    return new I(T.F);
+    return new E(T.F);
 }
 
 function ae() {
-    return new I(T.F);
+    return new E(T.F);
 }
 
 /**
@@ -3490,7 +3490,7 @@ function ae() {
      * expects a { value: <number> } struct.
      */
     t.prototype.ln = function(t) {
-        return this.options.dn || V(t) ? t : {
+        return this.options.dn || L(t) ? t : {
             value: t
         };
     }, 
@@ -3499,7 +3499,7 @@ function ae() {
      */
     t.prototype.fn = function(t) {
         var e;
-        return V(e = "object" == typeof t ? t.value : t) ? null : e;
+        return L(e = "object" == typeof t ? t.value : t) ? null : e;
     }, 
     /**
      * Returns an IntegerValue for `value`.
@@ -3526,7 +3526,7 @@ function ae() {
             };
         }
         return {
-            doubleValue: L(t) ? "-0" : t
+            doubleValue: U(t) ? "-0" : t
         };
     }, 
     /**
@@ -3535,7 +3535,7 @@ function ae() {
      * otherwise a DoubleValue is returned.
      */
     t.prototype.Tn = function(t) {
-        return U(t) ? this.Wt(t) : this.jt(t);
+        return V(t) ? this.Wt(t) : this.jt(t);
     }, 
     /**
      * Returns a value for a Date that's appropriate to put into a proto.
@@ -3560,7 +3560,7 @@ function ae() {
     /**
      * Returns a ByteString based on the proto string value.
      */
-    t.prototype.En = function(t) {
+    t.prototype.wn = function(t) {
         return this.options.dn ? (be(void 0 === t || "string" == typeof t, "value must be undefined or a string when using proto3 Json"), 
         R.fromBase64String(t || "")) : (be(void 0 === t || t instanceof Uint8Array, "value must be undefined or Uint8Array"), 
         R.fromUint8Array(t || new Uint8Array));
@@ -3568,20 +3568,20 @@ function ae() {
         return this.k(t.k());
     }, t.prototype.fromVersion = function(t) {
         return be(!!t, "Trying to deserialize version that isn't set"), v.v(this.v(t));
-    }, t.prototype.wn = function(t, e) {
+    }, t.prototype.En = function(t, e) {
         return this.In(e || this.cn).child("documents").child(t).K();
     }, t.prototype.Rn = function(t) {
         var e = w.G(t);
         return be(le(e), "Tried to deserialize invalid key " + e.toString()), e;
     }, t.prototype.An = function(t) {
-        return this.wn(t.path);
+        return this.En(t.path);
     }, t.prototype.tt = function(t) {
         var e = this.Rn(t);
         return be(e.get(1) === this.cn.projectId, "Tried to deserialize key from different project: " + e.get(1) + " vs " + this.cn.projectId), 
         be(!e.get(3) && !this.cn.database || e.get(3) === this.cn.database, "Tried to deserialize key from different database: " + e.get(3) + " vs " + this.cn.database), 
         new T(this.Pn(e));
     }, t.prototype.Vn = function(t) {
-        return this.wn(t);
+        return this.En(t);
     }, t.prototype.gn = function(t) {
         var e = this.Rn(t);
         // In v1beta1 queries for collections at the root did not have a trailing
@@ -3643,7 +3643,7 @@ function ae() {
             t.targetChange;
             // proto3 default value is unset in JSON (undefined), so use 'NO_CHANGE'
             // if unset
-            var n = this.Nn(t.targetChange.targetChangeType || "NO_CHANGE"), r = t.targetChange.targetIds || [], i = this.En(t.targetChange.resumeToken), o = t.targetChange.cause, s = o && this._n(o);
+            var n = this.Nn(t.targetChange.targetChangeType || "NO_CHANGE"), r = t.targetChange.targetIds || [], i = this.wn(t.targetChange.resumeToken), o = t.targetChange.cause, s = o && this._n(o);
             e = new ie(n, r, i, s || null);
         } else if ("documentChange" in t) {
             t.documentChange;
@@ -3670,9 +3670,9 @@ function ae() {
         } else {
             if (!("filter" in t)) return _e("Unknown change type " + JSON.stringify(t));
             t.filter;
-            var I = t.filter;
-            I.targetId;
-            var E = I.count || 0, N = new Ct(E), A = I.targetId;
+            var E = t.filter;
+            E.targetId;
+            var I = E.count || 0, N = new Ct(I), A = E.targetId;
             e = new re(A, N);
         }
         return e;
@@ -3876,7 +3876,7 @@ function ae() {
         var e = this;
         if (0 !== t.length) {
             var n = t.map((function(t) {
-                return t instanceof It ? e.ni(t) : _e("Unrecognized filter: " + JSON.stringify(t));
+                return t instanceof Et ? e.ni(t) : _e("Unrecognized filter: " + JSON.stringify(t));
             }));
             return 1 === n.length ? n[0] : {
                 compositeFilter: {
@@ -3909,7 +3909,7 @@ function ae() {
         };
     }, t.prototype.ti = function(t) {
         var e = !!t.before, n = t.values || [];
-        return new Vt(n, e);
+        return new Lt(n, e);
     }, 
     // visible for testing
     t.prototype.ai = function(t) {
@@ -3977,14 +3977,14 @@ function ae() {
             direction: this.ai(t.dir)
         };
     }, t.prototype.hi = function(t) {
-        return new Lt(this.di(t.field), this.ui(t.direction));
+        return new Ut(this.di(t.field), this.ui(t.direction));
     }, t.prototype.ri = function(t) {
-        return It.create(this.di(t.fieldFilter.field), this._i(t.fieldFilter.op), t.fieldFilter.value);
+        return Et.create(this.di(t.fieldFilter.field), this._i(t.fieldFilter.op), t.fieldFilter.value);
     }, 
     // visible for testing
     t.prototype.ni = function(t) {
         if (t.op === Tt.EQUAL) {
-            if (X(t.value)) return {
+            if (J(t.value)) return {
                 unaryFilter: {
                     field: this.li(t.field),
                     op: "IS_NAN"
@@ -4008,13 +4008,13 @@ function ae() {
         switch (t.unaryFilter.op) {
           case "IS_NAN":
             var e = this.di(t.unaryFilter.field);
-            return It.create(e, Tt.EQUAL, {
+            return Et.create(e, Tt.EQUAL, {
                 doubleValue: NaN
             });
 
           case "IS_NULL":
             var n = this.di(t.unaryFilter.field);
-            return It.create(n, Tt.EQUAL, {
+            return Et.create(n, Tt.EQUAL, {
                 nullValue: "NULL_VALUE"
             });
 
@@ -4197,11 +4197,11 @@ function be(t, e) {
     }, t;
 }();
 
-function Ie(t, e) {
+function Ee(t, e) {
     return t < e ? -1 : t > e ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function Ee(t, e, n) {
+/** Helper to compare arrays using isEqual(). */ function Ie(t, e, n) {
     return t.length === e.length && t.every((function(t, r) {
         return n(t, e[r]);
     }));
@@ -4249,7 +4249,7 @@ function(t, e, n, r, i) {
     function t(t, e) {
         this.projectId = t, this.database = e || "(default)";
     }
-    return Object.defineProperty(t.prototype, "Ei", {
+    return Object.defineProperty(t.prototype, "wi", {
         get: function() {
             return "(default)" === this.database;
         },
@@ -4258,11 +4258,11 @@ function(t, e, n, r, i) {
     }), t.prototype.isEqual = function(e) {
         return e instanceof t && e.projectId === this.projectId && e.database === this.database;
     }, t.prototype.D = function(t) {
-        return Ie(this.projectId, t.projectId) || Ie(this.database, t.database);
+        return Ee(this.projectId, t.projectId) || Ee(this.database, t.database);
     }, t;
 }(), De = /** @class */ function() {
     function t(t) {
-        this.wi = t, 
+        this.Ei = t, 
         /**
              * The inner map for a key -> value pair. Due to the possibility of
              * collisions we keep a list of entries that we do a linear search through
@@ -4273,7 +4273,7 @@ function(t, e, n, r, i) {
         /** Get a value for this key, or undefined if it does not exist. */;
     }
     return t.prototype.get = function(t) {
-        var e = this.wi(t), n = this.Ii[e];
+        var e = this.Ei(t), n = this.Ii[e];
         if (void 0 !== n) for (var r = 0, i = n; r < i.length; r++) {
             var o = i[r], s = o[0], u = o[1];
             if (s.isEqual(t)) return u;
@@ -4282,7 +4282,7 @@ function(t, e, n, r, i) {
         return void 0 !== this.get(t);
     }, 
     /** Put this key and value in the map. */ t.prototype.set = function(t, e) {
-        var n = this.wi(t), r = this.Ii[n];
+        var n = this.Ei(t), r = this.Ii[n];
         if (void 0 !== r) {
             for (var i = 0; i < r.length; i++) if (r[i][0].isEqual(t)) return void (r[i] = [ t, e ]);
             r.push([ t, e ]);
@@ -4292,7 +4292,7 @@ function(t, e, n, r, i) {
      * Remove this key from the map. Returns a boolean if anything was deleted.
      */
     t.prototype.delete = function(t) {
-        var e = this.wi(t), n = this.Ii[e];
+        var e = this.Ei(t), n = this.Ii[e];
         if (void 0 === n) return !1;
         for (var r = 0; r < n.length; r++) if (n[r][0].isEqual(t)) return 1 === n.length ? delete this.Ii[e] : n.splice(r, 1), 
         !0;
@@ -4380,9 +4380,9 @@ function(t, e, n, r, i) {
             return t.add(e.key);
         }), Qt());
     }, t.prototype.isEqual = function(t) {
-        return this.batchId === t.batchId && Ee(this.mutations, t.mutations, (function(t, e) {
+        return this.batchId === t.batchId && Ie(this.mutations, t.mutations, (function(t, e) {
             return t.isEqual(e);
-        })) && Ee(this.baseMutations, t.baseMutations, (function(t, e) {
+        })) && Ie(this.baseMutations, t.baseMutations, (function(t, e) {
             return t.isEqual(e);
         }));
     }, t;
@@ -4408,16 +4408,16 @@ function(t, e, n, r, i) {
 }(), Re = /** @class */ function() {
     function t() {
         // A set of outstanding references to a document sorted by key.
-        this.pi = new A(Ve.Ee), 
+        this.pi = new A(Le.we), 
         // A set of outstanding references to a document sorted by target id.
-        this.yi = new A(Ve.bi)
+        this.yi = new A(Le.bi)
         /** Returns true if the reference set contains no references. */;
     }
     return t.prototype.U = function() {
         return this.pi.U();
     }, 
     /** Adds a reference to the given document key for the given ID. */ t.prototype.vi = function(t, e) {
-        var n = new Ve(t, e);
+        var n = new Le(t, e);
         this.pi = this.pi.add(n), this.yi = this.yi.add(n);
     }, 
     /** Add references to the given document keys for the given ID. */ t.prototype.Si = function(t, e) {
@@ -4431,7 +4431,7 @@ function(t, e, n, r, i) {
      * ID.
      */
     t.prototype.Di = function(t, e) {
-        this.Ci(new Ve(t, e));
+        this.Ci(new Le(t, e));
     }, t.prototype.ki = function(t, e) {
         var n = this;
         t.forEach((function(t) {
@@ -4443,7 +4443,7 @@ function(t, e, n, r, i) {
      * removed.
      */
     t.prototype.Ni = function(t) {
-        var e = this, n = T.EMPTY, r = new Ve(n, t), i = new Ve(n, t + 1), o = [];
+        var e = this, n = T.EMPTY, r = new Le(n, t), i = new Le(n, t + 1), o = [];
         return this.yi.Ct([ r, i ], (function(t) {
             e.Ci(t), o.push(t.key);
         })), o;
@@ -4455,26 +4455,26 @@ function(t, e, n, r, i) {
     }, t.prototype.Ci = function(t) {
         this.pi = this.pi.delete(t), this.yi = this.yi.delete(t);
     }, t.prototype.$i = function(t) {
-        var e = T.EMPTY, n = new Ve(e, t), r = new Ve(e, t + 1), i = Qt();
+        var e = T.EMPTY, n = new Le(e, t), r = new Le(e, t + 1), i = Qt();
         return this.yi.Ct([ n, r ], (function(t) {
             i = i.add(t.key);
         })), i;
     }, t.prototype.Mi = function(t) {
-        var e = new Ve(t, 0), n = this.pi.Nt(e);
+        var e = new Le(t, 0), n = this.pi.Nt(e);
         return null !== n && t.isEqual(n.key);
     }, t;
-}(), Ve = /** @class */ function() {
+}(), Le = /** @class */ function() {
     function t(t, e) {
         this.key = t, this.Li = e
         /** Compare by key then by ID */;
     }
-    return t.Ee = function(t, e) {
-        return T.F(t.key, e.key) || Ie(t.Li, e.Li);
+    return t.we = function(t, e) {
+        return T.F(t.key, e.key) || Ee(t.Li, e.Li);
     }, 
     /** Compare by ID then by key */ t.bi = function(t, e) {
-        return Ie(t.Li, e.Li) || T.F(t.key, e.key);
+        return Ee(t.Li, e.Li) || T.F(t.key, e.key);
     }, t;
-}(), Le = /** @class */ function() {
+}(), Ue = /** @class */ function() {
     function t(t) {
         var e = this;
         // NOTE: next/catchCallback will always point to our own wrapper functions,
@@ -4569,7 +4569,7 @@ function(t, e, n, r, i) {
             r.push(e.call(n, t, i));
         })), this.Ki(r);
     }, t;
-}(), Ue = /** @class */ function() {
+}(), Ve = /** @class */ function() {
     function t() {
         // A mapping of document key to the new cache entry that should be written (or null if any
         // existing cache entry should be removed).
@@ -4619,7 +4619,7 @@ function(t, e, n, r, i) {
     t.prototype.tr = function(t, e) {
         this.Xi();
         var n = this.zi.get(e);
-        return void 0 !== n ? Le.resolve(n) : this.er(t, e);
+        return void 0 !== n ? Ue.resolve(n) : this.er(t, e);
     }, 
     /**
      * Looks up several entries in the cache, forwarding to
@@ -4708,7 +4708,7 @@ function(t, e, n, r, i) {
      */
     t.prototype.mr = function(t, e) {
         var n = this;
-        return this.ar.Er(t, e).next((function(r) {
+        return this.ar.wr(t, e).next((function(r) {
             var i = n.dr(t, e, r), o = jt();
             return i.forEach((function(t, e) {
                 // TODO(http://b/32275378): Don't conflate missing / deleted.
@@ -4724,7 +4724,7 @@ function(t, e, n, r, i) {
      * @param sinceReadTime If not set to SnapshotVersion.MIN, return only
      *     documents that have been read since this snapshot version (exclusive).
      */
-    t.prototype.wr = function(t, e, n) {
+    t.prototype.Er = function(t, e, n) {
         return e.Pe() ? this.Ir(t, e.path) : e.He() ? this.Rr(t, e, n) : this.Ar(t, e, n);
     }, t.prototype.Ir = function(t, e) {
         // Just do a simple document lookup.
@@ -4735,7 +4735,7 @@ function(t, e, n, r, i) {
     }, t.prototype.Rr = function(t, e, n) {
         var r = this, i = e.collectionGroup, o = zt();
         return this.ur.Pr(t, i).next((function(s) {
-            return Le.forEach(s, (function(s) {
+            return Ue.forEach(s, (function(s) {
                 var u = e.Le(s.child(i));
                 return r.Ar(t, u, n).next((function(t) {
                     t.forEach((function(t, e) {
@@ -4749,7 +4749,7 @@ function(t, e, n, r, i) {
     }, t.prototype.Ar = function(t, e, n) {
         var r, i, o = this;
         // Query the remote documents and overlay mutations.
-                return this.hr.wr(t, e, n).next((function(n) {
+                return this.hr.Er(t, e, n).next((function(n) {
             return r = n, o.ar.Vr(t, e);
         })).next((function(e) {
             return i = e, o.gr(t, i, r).next((function(t) {
@@ -5130,8 +5130,8 @@ var Fe = function() {
  * limitations under the License.
  */
 function Be(t, e) {
-    var n = t[0], r = t[1], i = e[0], o = e[1], s = Ie(n, i);
-    return 0 === s ? Ie(r, o) : s;
+    var n = t[0], r = t[1], i = e[0], o = e[1], s = Ee(n, i);
+    return 0 === s ? Ee(r, o) : s;
 }
 
 /**
@@ -5178,7 +5178,7 @@ function Be(t, e) {
     // A cap on the total number of sequence numbers that will be collected. This prevents
     // us from collecting a huge number of sequence numbers if the cache has grown very large.
     n) {
-        this.mo = t, this.Eo = e, this.wo = n;
+        this.mo = t, this.wo = e, this.Eo = n;
     }
     return t.Io = function(e) {
         return new t(e, t.Ro, t.Ao);
@@ -5226,7 +5226,7 @@ var Ye = /** @class */ function() {
     }, 
     /** Returns the nth sequence number, counting in order from the smallest. */ t.prototype.Lo = function(t, e) {
         var n = this;
-        if (0 === e) return Le.resolve(qe.kr);
+        if (0 === e) return Ue.resolve(qe.kr);
         var r = new ze(e);
         return this.Fo.Xs(t, (function(t) {
             return r._o(t.sequenceNumber);
@@ -5254,7 +5254,7 @@ var Ye = /** @class */ function() {
     }, t.prototype.Uo = function(t, e) {
         var n = this;
         return this.Do.mo === We.Po ? (ve("LruGarbageCollector", "Garbage collection skipped; disabled"), 
-        Le.resolve(Ke)) : this.qo(t).next((function(r) {
+        Ue.resolve(Ke)) : this.qo(t).next((function(r) {
             return r < n.Do.mo ? (ve("LruGarbageCollector", "Garbage collection skipped; Cache size " + r + " is lower than threshold " + n.Do.mo), 
             Ke) : n.Qo(t, e);
         }));
@@ -5262,17 +5262,17 @@ var Ye = /** @class */ function() {
         return this.Fo.qo(t);
     }, t.prototype.Qo = function(t, e) {
         var n, i, o, s, u, a, h, c = this, f = Date.now();
-        return this.$o(t, this.Do.Eo).next((function(e) {
+        return this.$o(t, this.Do.wo).next((function(e) {
             // Cap at the configured max
-            return e > c.Do.wo ? (ve("LruGarbageCollector", "Capping sequence numbers to collect down to the maximum of " + c.Do.wo + " from " + e), 
-            i = c.Do.wo) : i = e, s = Date.now(), c.Lo(t, i);
+            return e > c.Do.Eo ? (ve("LruGarbageCollector", "Capping sequence numbers to collect down to the maximum of " + c.Do.Eo + " from " + e), 
+            i = c.Do.Eo) : i = e, s = Date.now(), c.Lo(t, i);
         })).next((function(r) {
             return n = r, u = Date.now(), c.xo(t, n, e);
         })).next((function(e) {
             return o = e, a = Date.now(), c.Bo(t, n);
         })).next((function(t) {
             return h = Date.now(), ye() <= r.LogLevel.DEBUG && ve("LruGarbageCollector", "LRU Garbage Collection\n\tCounted targets in " + (s - f) + "ms\n\tDetermined least recently used " + i + " in " + (u - s) + "ms\n\tRemoved " + o + " targets in " + (a - u) + "ms\n\tRemoved " + t + " documents in " + (h - a) + "ms\nTotal Duration: " + (h - f) + "ms"), 
-            Le.resolve({
+            Ue.resolve({
                 lo: !0,
                 do: i,
                 fo: o,
@@ -5280,7 +5280,7 @@ var Ye = /** @class */ function() {
             });
         }));
     }, t;
-}(), Je = /** @class */ function() {
+}(), Xe = /** @class */ function() {
     function t(
     /** Manages our in-memory or durable persistence. */
     t, e, n) {
@@ -5295,7 +5295,7 @@ var Ye = /** @class */ function() {
              * PORTING NOTE: We are using an immutable data structure on Web to make re-runs
              * of `applyRemoteEvent()` idempotent.
              */
-        this.Ko = new I(Ie), 
+        this.Ko = new E(Ee), 
         /** Maps a target to its targetID. */
         // TODO(wuandy): Evaluate if TargetId can be part of Target.
         this.Go = new De((function(t) {
@@ -5411,7 +5411,7 @@ var Ye = /** @class */ function() {
         var e = this;
         return this.persistence.runTransaction("Lookup mutation documents", "readonly", (function(n) {
             return e.ar.Th(n, t).next((function(t) {
-                return t ? e.sh.Tr(n, t) : Le.resolve(null);
+                return t ? e.sh.Tr(n, t) : Ue.resolve(null);
             }));
         }));
     }, 
@@ -5432,8 +5432,8 @@ var Ye = /** @class */ function() {
     t.prototype.mh = function(t) {
         var e = this;
         return this.persistence.runTransaction("Acknowledge batch", "readwrite-primary", (function(n) {
-            var r = t.batch.keys(), i = e.Xo.Eh({
-                wh: !0
+            var r = t.batch.keys(), i = e.Xo.wh({
+                Eh: !0
             });
             return e.ar.mh(n, t.batch, t.streamToken).next((function() {
                 return e.Ih(n, t, i);
@@ -5513,8 +5513,8 @@ var Ye = /** @class */ function() {
     t.prototype.vh = function(e) {
         var n = this, r = e.ts, i = this.Ko;
         return this.persistence.runTransaction("Apply remote event", "readwrite-primary", (function(o) {
-            var s = n.Xo.Eh({
-                wh: !0
+            var s = n.Xo.wh({
+                Eh: !0
             });
             // Reset newTargetDataByTargetMap in case this transaction gets re-run.
                         i = n.Ko;
@@ -5544,13 +5544,13 @@ var Ye = /** @class */ function() {
             // can synthesize remote events when we get permission denied errors while
             // trying to resolve the state of a locally cached document that is in
             // limbo.
-                        if (e.Es.forEach((function(t, e) {
+                        if (e.ws.forEach((function(t, e) {
                 h = h.add(t);
             })), 
             // Each loop iteration only affects its "own" doc, so it's safe to get all the remote
             // documents in advance in a single call.
             u.push(s.getEntries(o, h).next((function(t) {
-                e.Es.forEach((function(i, h) {
+                e.ws.forEach((function(i, h) {
                     var c = t.get(i);
                     // Note: The order of the steps below is important, since we want
                     // to ensure that rejected limbo resolutions (which fabricate
@@ -5562,7 +5562,7 @@ var Ye = /** @class */ function() {
                     // access.
                     s.Zi(i, r), a = a.it(i, h)) : null == c || h.version.D(c.version) > 0 || 0 === h.version.D(c.version) && c.hasPendingWrites ? (s.Yi(h, r), 
                     a = a.it(i, h)) : ve("LocalStore", "Ignoring outdated watch update for ", i, ". Current version:", c.version, " Watch version:", h.version), 
-                    e.ws.has(i) && u.push(n.persistence.Jo.Fh(o, i));
+                    e.Es.has(i) && u.push(n.persistence.Jo.Fh(o, i));
                 }));
             }))), !r.isEqual(v.MIN)) {
                 var c = n.th.bh(o).next((function(t) {
@@ -5570,7 +5570,7 @@ var Ye = /** @class */ function() {
                 }));
                 u.push(c);
             }
-            return Le.Ki(u).next((function() {
+            return Ue.Ki(u).next((function() {
                 return s.apply(o);
             })).next((function() {
                 return n.sh.mr(o, a);
@@ -5613,8 +5613,8 @@ var Ye = /** @class */ function() {
             }
         }
         return this.persistence.runTransaction("notifyLocalViewChanges", "readwrite", (function(n) {
-            return Le.forEach(t, (function(t) {
-                return Le.forEach(t.yr, (function(t) {
+            return Ue.forEach(t, (function(t) {
+                return Ue.forEach(t.yr, (function(t) {
                     return e.persistence.Jo.Di(n, t);
                 }));
             }));
@@ -5659,7 +5659,7 @@ var Ye = /** @class */ function() {
                 // This target has been listened to previously, so reuse the
                 // previous targetID.
                 // TODO(mcg): freshen last accessed date?
-                r = i, Le.resolve(r)) : e.th.Qh(n).next((function(i) {
+                r = i, Ue.resolve(r)) : e.th.Qh(n).next((function(i) {
                     return r = new Pt(t, i, 0 /* Listen */ , n.Ch), e.th.Wh(n, r).next((function() {
                         return r;
                     }));
@@ -5677,7 +5677,7 @@ var Ye = /** @class */ function() {
     // Visible for testing.
     t.prototype.qh = function(t, e) {
         var n = this.Go.get(e);
-        return void 0 !== n ? Le.resolve(this.Ko.get(n)) : this.th.qh(t, e);
+        return void 0 !== n ? Ue.resolve(this.Ko.get(n)) : this.th.qh(t, e);
     }, 
     /**
      * Unpin all the documents associated with the given target. If
@@ -5701,7 +5701,7 @@ var Ye = /** @class */ function() {
             // transaction fails since there are no side effects if the target has
             // already been removed.
             var o = n.jo.Ni(t);
-            return e ? Le.resolve() : Le.forEach(o, (function(t) {
+            return e ? Ue.resolve() : Ue.forEach(o, (function(t) {
                 return n.persistence.Jo.Di(i, t);
             })).next((function() {
                 n.persistence.Jo.removeTarget(i, r);
@@ -5726,7 +5726,7 @@ var Ye = /** @class */ function() {
                     i = t;
                 }));
             })).next((function() {
-                return n.Wo.wr(o, t, e ? r : v.MIN, e ? i : Qt());
+                return n.Wo.Er(o, t, e ? r : v.MIN, e ? i : Qt());
             })).next((function(t) {
                 return {
                     documents: t,
@@ -5757,7 +5757,7 @@ var Ye = /** @class */ function() {
     t.prototype.Zh = function(t) {
         this.persistence.Zh(t);
     }, t.prototype.Ih = function(t, e, n) {
-        var r = this, i = e.batch, o = i.keys(), s = Le.resolve();
+        var r = this, i = e.batch, o = i.keys(), s = Ue.resolve();
         return o.forEach((function(r) {
             s = s.next((function() {
                 return n.tr(t, r);
@@ -5876,7 +5876,7 @@ function He(t) {
  * Forward the magic "arguments" variable as second parameter on which the
  * parameter validation is performed:
  * validateNoArgs('myFunction', arguments);
- */ function Xe(t, e) {
+ */ function Je(t, e) {
     if (0 !== e.length) throw new c(h.INVALID_ARGUMENT, "Function " + t + "() does not support arguments, but was called with " + yn(e.length, "argument") + ".");
 }
 
@@ -6124,7 +6124,7 @@ function vn() {
  *
  * Note that while you can't hide the constructor in JavaScript code, we are
  * using the hack above to make sure no-one outside this module can call it.
- */ Je.Mh = 3e8;
+ */ Xe.Mh = 3e8;
 
 var wn = /** @class */ function() {
     function t(t) {
@@ -6191,14 +6191,14 @@ bn.ha = new bn(b.X().K());
 /**
  * Matches any characters in a field path string that are reserved.
  */
-var Tn = new RegExp("[~\\*/\\[\\]]"), In = /** @class */ function() {
+var Tn = new RegExp("[~\\*/\\[\\]]"), En = /** @class */ function() {
     function t(t) {
         this.aa = t;
     }
     return t.delete = function() {
-        return Xe("FieldValue.delete", arguments), En.instance;
+        return Je("FieldValue.delete", arguments), In.instance;
     }, t.serverTimestamp = function() {
-        return Xe("FieldValue.serverTimestamp", arguments), Nn.instance;
+        return Je("FieldValue.serverTimestamp", arguments), Nn.instance;
     }, t.arrayUnion = function() {
         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
@@ -6215,12 +6215,12 @@ var Tn = new RegExp("[~\\*/\\[\\]]"), In = /** @class */ function() {
     }, t.prototype.isEqual = function(t) {
         return this === t;
     }, t;
-}(), En = /** @class */ function(t) {
+}(), In = /** @class */ function(t) {
     function n() {
         return t.call(this, "FieldValue.delete") || this;
     }
     return e.__extends(n, t), n;
-}(In);
+}(En);
 
 /**
  * Parses a field path string into a FieldPath, treating dots as separators.
@@ -6245,14 +6245,14 @@ var Tn = new RegExp("[~\\*/\\[\\]]"), In = /** @class */ function() {
  * An opaque base class for FieldValue sentinel objects in our public API,
  * with public static methods for creating said sentinel objects.
  */
-/** Singleton instance. */ En.instance = new En;
+/** Singleton instance. */ In.instance = new In;
 
 var Nn = /** @class */ function(t) {
     function n() {
         return t.call(this, "FieldValue.serverTimestamp") || this;
     }
     return e.__extends(n, t), n;
-}(In);
+}(En);
 
 /** Singleton instance. */ Nn.instance = new Nn;
 
@@ -6262,19 +6262,19 @@ var An = /** @class */ function(t) {
         return (n = t.call(this, "FieldValue.arrayUnion") || this).ua = e, n;
     }
     return e.__extends(n, t), n;
-}(In), Sn = /** @class */ function(t) {
+}(En), Sn = /** @class */ function(t) {
     function n(e) {
         var n = this;
         return (n = t.call(this, "FieldValue.arrayRemove") || this).ua = e, n;
     }
     return e.__extends(n, t), n;
-}(In), Dn = /** @class */ function(t) {
+}(En), Dn = /** @class */ function(t) {
     function n(e) {
         var n = this;
         return (n = t.call(this, "FieldValue.increment") || this).ca = e, n;
     }
     return e.__extends(n, t), n;
-}(In), kn = mn(In, "Use FieldValue.<field>() instead."), xn = /** @class */ function() {
+}(En), kn = mn(En, "Use FieldValue.<field>() instead."), xn = /** @class */ function() {
     function t(t, e) {
         if (Ze("GeoPoint", arguments, 2), en("GeoPoint", "number", 1, t), en("GeoPoint", "number", 2, e), 
         !isFinite(t) || t < -90 || t > 90) throw new c(h.INVALID_ARGUMENT, "Latitude must be a number between -90 and 90, but was: " + t);
@@ -6307,9 +6307,9 @@ var An = /** @class */ function(t) {
      * with an underscore.
      */
     t.prototype.p = function(t) {
-        return Ie(this._a, t._a) || Ie(this.la, t.la);
+        return Ee(this._a, t._a) || Ee(this.la, t.la);
     }, t;
-}(), Rn = /^__.*__$/, Vn = /** @class */ function() {
+}(), Rn = /^__.*__$/, Ln = /** @class */ function() {
     function t(t, e, n) {
         this.data = t, this.se = e, this.fieldTransforms = n;
     }
@@ -6318,7 +6318,7 @@ var An = /** @class */ function(t) {
         return null !== this.se ? n.push(new ct(t, this.data, this.se, e)) : n.push(new ht(t, this.data, e)), 
         this.fieldTransforms.length > 0 && n.push(new ft(t, this.fieldTransforms)), n;
     }, t;
-}(), Ln = /** @class */ function() {
+}(), Un = /** @class */ function() {
     function t(t, e, n) {
         this.data = t, this.se = e, this.fieldTransforms = n;
     }
@@ -6329,7 +6329,7 @@ var An = /** @class */ function(t) {
     }, t;
 }();
 
-function Un(t) {
+function Vn(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -6377,10 +6377,10 @@ function Un(t) {
         void 0 === i && this.ma(), this.Ta = void 0 !== r && r, this.fieldTransforms = i || [], 
         this.se = o || [];
     }
-    return t.prototype.Ea = function(e) {
+    return t.prototype.wa = function(e) {
         var n = null == this.path ? null : this.path.child(e), r = new t(this.fa, this.methodName, n, 
         /*arrayElement=*/ !1, this.fieldTransforms, this.se);
-        return r.wa(e), r;
+        return r.Ea(e), r;
     }, t.prototype.Ia = function(e) {
         var n = null == this.path ? null : this.path.child(e), r = new t(this.fa, this.methodName, n, 
         /*arrayElement=*/ !1, this.fieldTransforms, this.se);
@@ -6404,10 +6404,10 @@ function Un(t) {
     }, t.prototype.ma = function() {
         // TODO(b/34871131): Remove null check once we have proper paths for fields
         // within arrays.
-        if (null !== this.path) for (var t = 0; t < this.path.length; t++) this.wa(this.path.get(t));
-    }, t.prototype.wa = function(t) {
+        if (null !== this.path) for (var t = 0; t < this.path.length; t++) this.Ea(this.path.get(t));
+    }, t.prototype.Ea = function(t) {
         if (0 === t.length) throw this.Aa("Document fields must not be empty");
-        if (Un(this.fa) && Rn.test(t)) throw this.Aa('Document fields cannot begin and end with "__"');
+        if (Vn(this.fa) && Rn.test(t)) throw this.Aa('Document fields cannot begin and end with "__"');
     }, t;
 }(), Pn = function(t, e) {
     this.cn = t, this.key = e;
@@ -6420,7 +6420,7 @@ function Un(t) {
         var n = new On(0 /* Set */ , t, b.H);
         qn("Data must be an object, but it was:", n, e);
         var r = this.ga(e, n);
-        return new Vn(new dt(r), 
+        return new Ln(new dt(r), 
         /* fieldMask= */ null, n.fieldTransforms);
     }, 
     /** Parse document data from a set() call with '{merge:true}'. */ t.prototype.pa = function(t, e, n) {
@@ -6441,7 +6441,7 @@ function Un(t) {
                 return i.zt(t.field);
             }));
         } else i = it.Gt(r.se), o = r.fieldTransforms;
-        return new Vn(new dt(s), i, o);
+        return new Ln(new dt(s), i, o);
     }, 
     /** Parse update data from an update() call. */ t.prototype.ya = function(t, e) {
         var n = this, r = new On(1 /* Update */ , t, b.H);
@@ -6449,7 +6449,7 @@ function Un(t) {
         var i = new A(b.F), o = dt._e();
         k(e, (function(e, s) {
             var u = jn(t, e), a = r.Ia(u);
-            if ((s = n.ba(s, a)) instanceof En) 
+            if ((s = n.ba(s, a)) instanceof In) 
             // Add it to the field mask, but don't add anything to updateData.
             i = i.add(u); else {
                 var h = n.va(s, a);
@@ -6457,7 +6457,7 @@ function Un(t) {
             }
         }));
         var s = it.Kt(i);
-        return new Ln(o.oe(), s, r.fieldTransforms);
+        return new Un(o.oe(), s, r.fieldTransforms);
     }, 
     /** Parse update data from a list of field/value arguments. */ t.prototype.Sa = function(t, e, n, r) {
         var i = new On(1 /* Update */ , t, b.H), o = [ Fn(t, e) ], s = [ n ];
@@ -6465,7 +6465,7 @@ function Un(t) {
         for (var u = 0; u < r.length; u += 2) o.push(Fn(t, r[u])), s.push(r[u + 1]);
         for (var a = new A(b.F), f = dt._e(), l = 0; l < o.length; ++l) {
             var p = o[l], d = i.Ia(p), y = this.ba(s[l], d);
-            if (y instanceof En) 
+            if (y instanceof In) 
             // Add it to the field mask, but don't add anything to updateData.
             a = a.add(p); else {
                 var m = this.va(y, d);
@@ -6473,7 +6473,7 @@ function Un(t) {
             }
         }
         var v = it.Kt(a);
-        return new Ln(f.oe(), v, i.fieldTransforms);
+        return new Un(f.oe(), v, i.fieldTransforms);
     }, 
     /**
      * Parse a "query value" (e.g. value in a where filter or a value in a cursor
@@ -6506,7 +6506,7 @@ function Un(t) {
      */
     t.prototype.va = function(t, e) {
         if (Mn(t = this.ba(t, e))) return qn("Unsupported field value:", e, t), this.ga(t, e);
-        if (t instanceof In) 
+        if (t instanceof En) 
         // 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
@@ -6533,7 +6533,7 @@ function Un(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.se.push(e.path) : k(t, (function(t, i) {
-            var o = n.va(i, e.Ea(t));
+            var o = n.va(i, e.wa(t));
             null != o && (r[t] = o);
         })), {
             mapValue: {
@@ -6562,9 +6562,9 @@ function Un(t) {
      */
     t.prototype.Ca = function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Un(e.fa)) throw e.Aa(t.aa + "() can only be used with update() and set()");
+        if (!Vn(e.fa)) throw e.Aa(t.aa + "() can only be used with update() and set()");
         if (null === e.path) throw e.Aa(t.aa + "() is not currently supported inside arrays");
-        if (t instanceof En) {
+        if (t instanceof In) {
             if (2 /* MergeSet */ !== e.fa) throw 1 /* Update */ === e.fa ? e.Aa("FieldValue.delete() can only appear at the top level of your update data") : e.Aa("FieldValue.delete() cannot be used with set() unless you pass {merge:true}");
             // No transform to add for a delete, but we need to add it to our
             // fieldMask so it gets deleted.
@@ -6621,7 +6621,7 @@ function Un(t) {
             bytesValue: this.serializer.mn(t)
         };
         if (t instanceof Pn) return {
-            referenceValue: this.serializer.wn(t.key.path, t.cn)
+            referenceValue: this.serializer.En(t.key.path, t.cn)
         };
         throw e.Aa("Unsupported field value: " + hn(t));
     }, t.prototype.Fa = function(t, e) {
@@ -6649,7 +6649,7 @@ function Un(t) {
  * to specific FieldValue types other than ObjectValue.
  */
 function Mn(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof m || t instanceof xn || t instanceof wn || t instanceof Pn || t instanceof In);
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof m || t instanceof xn || t instanceof wn || t instanceof Pn || t instanceof En);
 }
 
 function qn(t, e, n) {
@@ -7061,7 +7061,7 @@ function qn(t, e, n) {
              */
         s.lastStreamToken = R.xt, s;
     }
-    return e.__extends(n, t), Object.defineProperty(n.prototype, "Eu", {
+    return e.__extends(n, t), Object.defineProperty(n.prototype, "wu", {
         /**
          * Tracks whether or not a handshake has been successfully exchanged and
          * the stream is ready to accept mutations.
@@ -7076,13 +7076,13 @@ function qn(t, e, n) {
     n.prototype.start = function() {
         this.mu = !1, t.prototype.start.call(this);
     }, n.prototype.ru = function() {
-        this.mu && this.wu([]);
+        this.mu && this.Eu([]);
     }, n.prototype.cu = function(t) {
         return this.Ka.lu("Write", t);
     }, n.prototype.onMessage = function(t) {
         if (
         // Always capture the last stream token.
-        be(!!t.streamToken, "Got a write response without a stream token"), this.lastStreamToken = this.serializer.En(t.streamToken), 
+        be(!!t.streamToken, "Got a write response without a stream token"), this.lastStreamToken = this.serializer.wn(t.streamToken), 
         this.mu) {
             // A successful first write response means the stream is healthy,
             // Note, that we could consider a successful handshake healthy, however,
@@ -7106,7 +7106,7 @@ function qn(t, e, n) {
         var t = {};
         t.database = this.serializer.pn, this.nu(t);
     }, 
-    /** Sends a group of mutations to the Firestore backend to apply. */ n.prototype.wu = function(t) {
+    /** Sends a group of mutations to the Firestore backend to apply. */ n.prototype.Eu = function(t) {
         var e = this, n = {
             streamToken: this.serializer.mn(this.lastStreamToken),
             writes: t.map((function(t) {
@@ -7288,7 +7288,7 @@ function qn(t, e, n) {
     }, t.prototype.write = function(t) {
         this.ku(), this.mutations = this.mutations.concat(t);
     }, t.prototype.ku = function() {}, t;
-}(), Jn = /** @class */ function() {
+}(), Xn = /** @class */ function() {
     function t(t, e) {
         this.Nr = t, this.$u = e, 
         /** The current OnlineState. */
@@ -7417,7 +7417,7 @@ function qn(t, e, n) {
                     }));
                 }));
             }));
-        })), this.Xu = new Jn(r, i), 
+        })), this.Xu = new Xn(r, i), 
         // Create streams (but note they're not started yet).
         this.Zu = this.bu.Vu({
             _u: this.tc.bind(this),
@@ -7593,11 +7593,11 @@ function qn(t, e, n) {
                 switch (e.label) {
                   case 0:
                     // Mark the client as online since we got a message from the server
-                    return this.Xu.set("Online" /* Online */), t instanceof ie && 2 /* Removed */ === t.state && t.cause ? [ 2 /*return*/ , this.Ec(t) ] : (t instanceof ne ? this.Gu.zs(t) : t instanceof re ? this.Gu.sn(t) : this.Gu.Ys(t), 
+                    return this.Xu.set("Online" /* Online */), t instanceof ie && 2 /* Removed */ === t.state && t.cause ? [ 2 /*return*/ , this.wc(t) ] : (t instanceof ne ? this.Gu.zs(t) : t instanceof re ? this.Gu.sn(t) : this.Gu.Ys(t), 
                     n.isEqual(v.MIN) ? [ 3 /*break*/ , 4 ] : [ 4 /*yield*/ , this.Wu.bh() ]);
 
                   case 1:
-                    return r = e.sent(), n.D(r) >= 0 ? [ 4 /*yield*/ , this.wc(n) ] : [ 3 /*break*/ , 3 ];
+                    return r = e.sent(), n.D(r) >= 0 ? [ 4 /*yield*/ , this.Ec(n) ] : [ 3 /*break*/ , 3 ];
 
                     // We have received a target change with a global snapshot if the snapshot
                     // version is not equal to SnapshotVersion.MIN.
@@ -7620,7 +7620,7 @@ function qn(t, e, n) {
      * RemoteEvent, and passes that on to the listener, which is typically the
      * SyncEngine.
      */
-    t.prototype.wc = function(t) {
+    t.prototype.Ec = function(t) {
         var e = this, n = this.Gu.rn(t);
         // Update in-memory resume tokens. LocalStore will update the
         // persistent view of these when applying the completed RemoteEvent.
@@ -7652,7 +7652,7 @@ function qn(t, e, n) {
             }
         })), this.mc.vh(n);
     }, 
-    /** Handles an error on a target */ t.prototype.Ec = function(t) {
+    /** Handles an error on a target */ t.prototype.wc = function(t) {
         var n = this, r = t.cause, i = Promise.resolve();
         return t.targetIds.forEach((function(t) {
             i = i.then((function() {
@@ -7718,7 +7718,7 @@ function qn(t, e, n) {
      * immediately if the write stream is established.
      */
     t.prototype.Ac = function(t) {
-        this.ju.push(t), this.nc.Xa() && this.nc.Eu && this.nc.wu(t.mutations);
+        this.ju.push(t), this.nc.Xa() && this.nc.wu && this.nc.Eu(t.mutations);
     }, t.prototype.Pc = function() {
         return this.Ju() && !this.nc.Ya() && this.ju.length > 0;
     }, t.prototype.Vc = function() {
@@ -7736,7 +7736,7 @@ function qn(t, e, n) {
             // Send the write pipeline now that the stream is established.
             for (var e = 0, n = t.ju; e < n.length; e++) {
                 var r = n[e];
-                t.nc.wu(r.mutations);
+                t.nc.Eu(r.mutations);
             }
         })).catch(He);
     }, t.prototype.Iu = function(t, e) {
@@ -7750,7 +7750,7 @@ function qn(t, e, n) {
             return e.__generator(this, (function(e) {
                 // If the write stream closed due to an error, invoke the error callbacks if
                 // there are pending writes.
-                return t && this.ju.length > 0 ? [ 2 /*return*/ , (n = this.nc.Eu ? this.yc(t) : this.bc(t), 
+                return t && this.ju.length > 0 ? [ 2 /*return*/ , (n = this.nc.wu ? this.yc(t) : this.bc(t), 
                 n.then((function() {
                     // The write stream might have been started by refilling the write
                     // pipeline for failed writes
@@ -7915,7 +7915,7 @@ function qn(t, e, n) {
 // The format of the LocalStorage key that stores the client state is:
 //     firestore_clients_<persistence_prefix>_<instance_key>
 /** Assembles the key for a client state in WebStorage */
-function Xn(t, e) {
+function Jn(t, e) {
     return "firestore_clients_" + t + "_" + e;
 }
 
@@ -7999,7 +7999,7 @@ var tr = /** @class */ function() {
      */;
     }
     return t.kc = function(e, n) {
-        for (var r = JSON.parse(n), i = "object" == typeof r && r.activeTargetIds instanceof Array, o = Ht(), s = 0; i && s < r.activeTargetIds.length; ++s) i = U(r.activeTargetIds[s]), 
+        for (var r = JSON.parse(n), i = "object" == typeof r && r.activeTargetIds instanceof Array, o = Ht(), s = 0; i && s < r.activeTargetIds.length; ++s) i = V(r.activeTargetIds[s]), 
         o = o.add(r.activeTargetIds[s]);
         return i ? new t(e, o) : (ge("SharedClientState", "Failed to parse client data for instance '" + e + "': " + n), 
         null);
@@ -8049,7 +8049,7 @@ var tr = /** @class */ function() {
         // Escape the special characters mentioned here:
         // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions
                 var s = r.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
-        this.storage = this.platform.window.localStorage, this.currentUser = o, this.qc = Xn(this.persistenceKey, this.Mc), 
+        this.storage = this.platform.window.localStorage, this.currentUser = o, this.qc = Jn(this.persistenceKey, this.Mc), 
         this.Qc = 
         /** Assembles the key for the current sequence number. */
         function(t) {
@@ -8080,7 +8080,7 @@ var tr = /** @class */ function() {
                     return [ 4 /*yield*/ , this.mc.Jh() ];
 
                   case 1:
-                    for (t = e.sent(), n = 0, r = t; n < r.length; n++) (i = r[n]) !== this.Mc && (o = this.getItem(Xn(this.persistenceKey, i))) && (s = nr.kc(i, o)) && (this.Lc[s.clientId] = s);
+                    for (t = e.sent(), n = 0, r = t; n < r.length; n++) (i = r[n]) !== this.Mc && (o = this.getItem(Jn(this.persistenceKey, i))) && (s = nr.kc(i, o)) && (this.Lc[s.clientId] = s);
                     for (this.zc(), (u = this.storage.getItem(this.Gc)) && (a = this.Hc(u)) && this.Jc(a), 
                     h = 0, c = this.Bc; h < c.length; h++) f = c[h], this.xc(f);
                     return this.Bc = [], 
@@ -8166,7 +8166,7 @@ var tr = /** @class */ function() {
                             } else if (this.jc.test(t.key)) {
                                 if (null !== t.newValue && (i = this.T_(t.key, t.newValue))) return [ 2 /*return*/ , this.m_(i) ];
                             } else if (this.Kc.test(t.key)) {
-                                if (null !== t.newValue && (o = this.E_(t.key, t.newValue))) return [ 2 /*return*/ , this.w_(o) ];
+                                if (null !== t.newValue && (o = this.w_(t.key, t.newValue))) return [ 2 /*return*/ , this.E_(o) ];
                             } else if (t.key === this.Gc) {
                                 if (null !== t.newValue && (s = this.Hc(t.newValue))) return [ 2 /*return*/ , this.Jc(s) ];
                             } else t.key === this.Qc && (u = function(t) {
@@ -8237,7 +8237,7 @@ var tr = /** @class */ function() {
      * Parses a query target state from WebStorage. Returns 'null' if the value
      * could not be parsed.
      */
-    t.prototype.E_ = function(t, e) {
+    t.prototype.w_ = function(t, e) {
         var n = this.Kc.exec(t), r = Number(n[1]);
         return er.kc(r, e);
     }, 
@@ -8254,7 +8254,7 @@ var tr = /** @class */ function() {
                 [ 2 /*return*/ ]);
             }));
         }));
-    }, t.prototype.w_ = function(t) {
+    }, t.prototype.E_ = function(t) {
         return this.mc.R_(t.targetId, t.state, t.error);
     }, t.prototype.d_ = function(t, n) {
         var r = this, i = this.Yc();
@@ -8345,7 +8345,7 @@ var tr = /** @class */ function() {
         /** Documents in the view but not in the remote target */
         this.S_ = Qt(), 
         /** Document Keys that have local changes */
-        this._s = Qt(), this.D_ = new Xt(t.Be.bind(t));
+        this._s = Qt(), this.D_ = new Jt(t.Be.bind(t));
     }
     return Object.defineProperty(t.prototype, "C_", {
         /**
@@ -8596,7 +8596,7 @@ var tr = /** @class */ function() {
     }, t.prototype.z_ = function(t) {
         try {
             var e = this.updateFunction(t);
-            return !V(e) && e.catch && e.then ? e : (this.Lr.reject(Error("Transaction callback must return a Promise")), 
+            return !L(e) && e.catch && e.then ? e : (this.Lr.reject(Error("Transaction callback must return a Promise")), 
             null);
         } catch (t) {
             // Do not retry errors thrown by user provided updateFunction.
@@ -8660,7 +8660,7 @@ n) {
              * Keeps track of the target ID for each document that is in limbo with an
              * active target.
              */
-        this.il = new I(T.F), 
+        this.il = new E(T.F), 
         /**
              * Keeps track of the information about an active limbo resolution for each
              * active target ID that was started for the purpose of limbo resolution.
@@ -8819,7 +8819,7 @@ n) {
                     return this._l("write()"), [ 4 /*yield*/ , this.Wu.lh(t) ];
 
                   case 1:
-                    return r = e.sent(), this.X_.Zc(r.batchId), this.ml(r.batchId, n), [ 4 /*yield*/ , this.El(r.zi) ];
+                    return r = e.sent(), this.X_.Zc(r.batchId), this.ml(r.batchId, n), [ 4 /*yield*/ , this.wl(r.zi) ];
 
                   case 2:
                     return e.sent(), [ 4 /*yield*/ , this.W_.uc() ];
@@ -8871,7 +8871,7 @@ n) {
                         be(t.Ps.size + t.Vs.size + t.gs.size <= 1, "Limbo resolution for single document contains multiple changes."), 
                         t.Ps.size > 0 ? n.Y_ = !0 : t.Vs.size > 0 ? be(n.Y_, "Received change for limbo target document without add.") : t.gs.size > 0 && (be(n.Y_, "Received remove for limbo target document without add."), 
                         n.Y_ = !1));
-                    })), [ 4 /*yield*/ , this.El(n, t) ];
+                    })), [ 4 /*yield*/ , this.wl(n, t) ];
 
                   case 3:
                     // Update `receivedDocument` as appropriate for any limbo targets.
@@ -8904,7 +8904,7 @@ n) {
             this.el.forEach((function(e, r) {
                 var i = r.view.B_(t);
                 i.snapshot && n.push(i.snapshot);
-            })), this.tl.wl(t), this.tl.du(n), this.onlineState = t, this.isPrimary && this.X_.c_(t);
+            })), this.tl.El(t), this.tl.du(n), this.onlineState = t, this.isPrimary && this.X_.c_(t);
         }
     }, t.prototype.Ic = function(t, n) {
         return e.__awaiter(this, void 0, void 0, (function() {
@@ -8917,10 +8917,10 @@ n) {
                     this.X_.a_(t, "rejected", n), r = this.rl.get(t), (i = r && r.key) ? (
                     // Since this query failed, we won't want to manually unlisten to it.
                     // So go ahead and remove it from bookkeeping.
-                    this.il = this.il.remove(i), this.rl.delete(t), this.Il(), o = (o = new I(T.F)).it(i, new gt(i, v.S())), 
+                    this.il = this.il.remove(i), this.rl.delete(t), this.Il(), o = (o = new E(T.F)).it(i, new gt(i, v.S())), 
                     s = Qt().add(i), u = new te(v.MIN, 
                     /* targetChanges= */ new Map, 
-                    /* targetMismatches= */ new A(Ie), o, s), [ 2 /*return*/ , this.vh(u) ]) : [ 4 /*yield*/ , this.Wu.jh(t, /* keepPersistedTargetData */ !1).then((function() {
+                    /* targetMismatches= */ new A(Ee), o, s), [ 2 /*return*/ , this.vh(u) ]) : [ 4 /*yield*/ , this.Wu.jh(t, /* keepPersistedTargetData */ !1).then((function() {
                         return a.Tl(t, n);
                     })).catch(He) ];
 
@@ -8955,7 +8955,7 @@ n) {
                     this.Rl(t, r || null), this.Wu.Yh(t)) : _e("Unknown batchState: " + n), e.label = 4;
 
                   case 4:
-                    return [ 4 /*yield*/ , this.El(i) ];
+                    return [ 4 /*yield*/ , this.wl(i) ];
 
                   case 5:
                     return e.sent(), [ 3 /*break*/ , 7 ];
@@ -8992,7 +8992,7 @@ n) {
                     return e.trys.push([ 1, 4, , 6 ]), [ 4 /*yield*/ , this.Wu.mh(t) ];
 
                   case 2:
-                    return r = e.sent(), this.X_.e_(n, "acknowledged"), [ 4 /*yield*/ , this.El(r) ];
+                    return r = e.sent(), this.X_.e_(n, "acknowledged"), [ 4 /*yield*/ , this.wl(r) ];
 
                   case 3:
                     return e.sent(), [ 3 /*break*/ , 6 ];
@@ -9025,7 +9025,7 @@ n) {
                     return e.trys.push([ 1, 4, , 6 ]), [ 4 /*yield*/ , this.Wu.Ah(t) ];
 
                   case 2:
-                    return r = e.sent(), this.X_.e_(t, "rejected", n), [ 4 /*yield*/ , this.El(r) ];
+                    return r = e.sent(), this.X_.e_(t, "rejected", n), [ 4 /*yield*/ , this.wl(r) ];
 
                   case 3:
                     return e.sent(), [ 3 /*break*/ , 6 ];
@@ -9079,7 +9079,7 @@ n) {
         })), this.al.clear();
     }, t.prototype.ml = function(t, e) {
         var n = this.hl[this.currentUser.s()];
-        n || (n = new I(Ie)), n = n.it(t, e), this.hl[this.currentUser.s()] = n;
+        n || (n = new E(Ee)), n = n.it(t, e), this.hl[this.currentUser.s()] = n;
     }, 
     /**
      * Resolves or rejects the user callback for the given batch and then discards
@@ -9147,7 +9147,7 @@ n) {
     // Visible for testing
     t.prototype.vl = function() {
         return this.nl;
-    }, t.prototype.El = function(t, n) {
+    }, t.prototype.wl = function(t, n) {
         return e.__awaiter(this, void 0, void 0, (function() {
             var r, i, o, s = this;
             return e.__generator(this, (function(e) {
@@ -9196,7 +9196,7 @@ n) {
                   case 1:
                     return r = e.sent(), 
                     // TODO(b/114226417): Consider calling this only in the primary tab.
-                    this.X_.oh(t, r.uh, r._h), [ 4 /*yield*/ , this.El(r.ah) ];
+                    this.X_.oh(t, r.uh, r._h), [ 4 /*yield*/ , this.wl(r.ah) ];
 
                   case 2:
                     // TODO(b/114226417): Consider calling this only in the primary tab.
@@ -9257,7 +9257,7 @@ n) {
         var t = this;
         this.rl.forEach((function(e, n) {
             t.W_.fc(n);
-        })), this.ol.Fi(), this.rl = new Map, this.il = new I(T.F);
+        })), this.ol.Fi(), this.rl = new Map, this.il = new E(T.F);
     }, 
     /**
      * Reconcile the query views of the provided query targets with the state from
@@ -9374,7 +9374,7 @@ n) {
                     return [ 4 /*yield*/ , this.Wu.ea() ];
 
                   case 3:
-                    return i = e.sent(), o = te.Is(t, "current" === n), [ 4 /*yield*/ , this.El(i, o) ];
+                    return i = e.sent(), o = te.Is(t, "current" === n), [ 4 /*yield*/ , this.wl(i, o) ];
 
                   case 4:
                     return e.sent(), [ 3 /*break*/ , 8 ];
@@ -9518,7 +9518,7 @@ n) {
         // Remove all listeners. NOTE: We don't need to call syncEngine.unlisten()
         // after an error.
                 this.Fl.delete(t);
-    }, t.prototype.wl = function(t) {
+    }, t.prototype.El = function(t) {
         this.onlineState = t;
         var e = !1;
         this.Fl.forEach((function(n, r) {
@@ -9606,7 +9606,7 @@ n) {
     function t() {}
     return t.prototype.ih = function(t) {
         this.Gl = t;
-    }, t.prototype.wr = function(t, e, n, i) {
+    }, t.prototype.Er = function(t, e, n, i) {
         var o = this;
         // Queries that match all documents don't benefit from using
         // IndexFreeQueries. It is more efficient to scan all documents in a
@@ -9614,7 +9614,7 @@ n) {
                 return e.Oe() || n.isEqual(v.MIN) ? this.zl(t, e) : this.Gl.Tr(t, i).next((function(s) {
             var u = o.Hl(e, s);
             return (e.je() || e.Ke()) && o.M_(e.ge, u, i, n) ? o.zl(t, e) : (ye() <= r.LogLevel.DEBUG && ve("IndexFreeQueryEngine", "Re-using previous result from %s to execute query: %s", n.toString(), e.toString()), 
-            o.Gl.wr(t, e, n).next((function(t) {
+            o.Gl.Er(t, e, n).next((function(t) {
                 // We merge `previousResults` into `updateResults`, since
                 // `updateResults` is already a DocumentMap. If a document is
                 // contained in both lists, then its contents are the same.
@@ -9663,7 +9663,7 @@ n) {
         return !!i && (i.hasPendingWrites || i.version.D(r) > 0);
     }, t.prototype.zl = function(t, e) {
         return ye() <= r.LogLevel.DEBUG && ve("IndexFreeQueryEngine", "Using full collection scan to execute query: %s", e.toString()), 
-        this.Gl.wr(t, e, v.MIN);
+        this.Gl.Er(t, e, v.MIN);
     }, t;
 }();
 
@@ -9784,7 +9784,7 @@ function wr(t) {
  * since .then() continuations are executed asynchronously (e.g. via
  * .setImmediate), which would cause IndexedDB to end the transaction.
  * See PersistencePromise for more details.
- */ var Ir = /** @class */ function() {
+ */ var Er = /** @class */ function() {
     function t(e) {
         this.db = e, 
         // NOTE: According to https://bugs.webkit.org/show_bug.cgi?id=197050, the
@@ -9802,7 +9802,7 @@ function wr(t) {
      */;
     }
     return t.Yl = function(e, n, r) {
-        return ve("SimpleDb", "Opening database:", e), new Le((function(i, o) {
+        return ve("SimpleDb", "Opening database:", e), new Ue((function(i, o) {
             // TODO(mikelehen): Investigate browser compatibility.
             // https://developer.mozilla.org/en-US/docs/Web/API/IndexedDB_API/Using_IndexedDB
             // suggests IE9 and older WebKit browsers handle upgrade
@@ -9899,7 +9899,7 @@ function wr(t) {
                                 // caller.
                                 return e.trys.push([ 1, 3, , 4 ]), s = r(t).catch((function(e) {
                                     // Abort the transaction if there was an error.
-                                    return t.abort(e), Le.reject(e);
+                                    return t.abort(e), Ue.reject(e);
                                 })).Wi(), a = {}, s.catch((function() {})), [ 4 /*yield*/ , t.nd ];
 
                               case 2:
@@ -9939,7 +9939,7 @@ function wr(t) {
     }, t.prototype.close = function() {
         this.db.close();
     }, t;
-}(), Er = /** @class */ function() {
+}(), Ir = /** @class */ function() {
     function t(t) {
         this.rd = t, this.od = !1, this.hd = null;
     }
@@ -10098,9 +10098,9 @@ function wr(t) {
      * The provided callback should return `true` to continue iteration, and
      * `false` otherwise.
      */
-    t.prototype.Ed = function(t) {
+    t.prototype.wd = function(t) {
         var e = this.cursor({});
-        return new Le((function(n, r) {
+        return new Ue((function(n, r) {
             e.onerror = function(t) {
                 var e = kr(t.target.error);
                 r(e);
@@ -10113,16 +10113,16 @@ function wr(t) {
         }));
     }, t.prototype.dd = function(t, e) {
         var n = [];
-        return new Le((function(r, i) {
+        return new Ue((function(r, i) {
             t.onerror = function(t) {
                 i(t.target.error);
             }, t.onsuccess = function(t) {
                 var i = t.target.result;
                 if (i) {
-                    var o = new Er(i), s = e(i.primaryKey, i.value, o);
-                    if (s instanceof Le) {
+                    var o = new Ir(i), s = e(i.primaryKey, i.value, o);
+                    if (s instanceof Ue) {
                         var u = s.catch((function(t) {
-                            return o.done(), Le.reject(t);
+                            return o.done(), Ue.reject(t);
                         }));
                         n.push(u);
                     }
@@ -10130,7 +10130,7 @@ function wr(t) {
                 } else r();
             };
         })).next((function() {
-            return Le.Ki(n);
+            return Ue.Ki(n);
         }));
     }, t.prototype.options = function(t, e) {
         var n = void 0;
@@ -10158,7 +10158,7 @@ function wr(t) {
  * handlers to resolve / reject the PersistencePromise as appropriate.
  */
 function Sr(t) {
-    return new Le((function(e, n) {
+    return new Ue((function(e, n) {
         t.onsuccess = function(t) {
             var n = t.target.result;
             e(n);
@@ -10173,7 +10173,7 @@ function Sr(t) {
 var Dr = !1;
 
 function kr(t) {
-    var e = Ir.Jl(i.getUA());
+    var e = Er.Jl(i.getUA());
     if (e >= 12.2 && e < 13) {
         var n = "An internal error was encountered in the Indexed Database server";
         if (t.message.indexOf(n) >= 0) {
@@ -10226,7 +10226,7 @@ function kr(t) {
              * view of the documents that were previously affected by the mutation.
              */
         // PORTING NOTE: Multi-tab only.
-        this.wd = {}
+        this.Ed = {}
         /**
      * Creates a new mutation queue for the given user.
      * @param user The user for which to create a mutation queue.
@@ -10241,7 +10241,7 @@ function kr(t) {
         return be("" !== e.uid, "UserID must not be an empty string."), new t(e.t() ? e.uid : "", n, r, i);
     }, t.prototype.Rd = function(t) {
         var e = !0, n = IDBKeyRange.bound([ this.userId, Number.NEGATIVE_INFINITY ], [ this.userId, Number.POSITIVE_INFINITY ]);
-        return Lr(t).md({
+        return Ur(t).md({
             index: $r.userMutationsIndex,
             range: n
         }, (function(t, n, r) {
@@ -10266,7 +10266,7 @@ function kr(t) {
             return n.lastStreamToken = e.toBase64(), Or(t).put(n);
         }));
     }, t.prototype.dh = function(t, e, n, r) {
-        var i = this, o = Ur(t), s = Lr(t);
+        var i = this, o = Vr(t), s = Ur(t);
         // The IndexedDb implementation in Chrome (and Firefox) does not handle
         // compound indices that include auto-generated keys correctly. To ensure
         // that the index entry is added correctly in all browsers, we perform two
@@ -10279,7 +10279,7 @@ function kr(t) {
         return s.add({}).next((function(u) {
             be("number" == typeof u, "Auto-generated key is not a number");
             for (var a = new ke(u, e, n, r), h = i.serializer.Pd(i.userId, a), c = [], f = new A((function(t, e) {
-                return Ie(t.K(), e.K());
+                return Ee(t.K(), e.K());
             })), l = 0, p = r; l < p.length; l++) {
                 var d = p[l], y = ti.key(i.userId, d.key.path, u);
                 f = f.add(d.key.path.L()), c.push(s.put(h)), c.push(o.put(y, ti.PLACEHOLDER));
@@ -10287,29 +10287,29 @@ function kr(t) {
             return f.forEach((function(e) {
                 c.push(i.ur.Vd(t, e));
             })), t.rr((function() {
-                i.wd[u] = a.keys();
-            })), Le.Ki(c).next((function() {
+                i.Ed[u] = a.keys();
+            })), Ue.Ki(c).next((function() {
                 return a;
             }));
         }));
     }, t.prototype.Ph = function(t, e) {
         var n = this;
-        return Lr(t).get(e).next((function(t) {
+        return Ur(t).get(e).next((function(t) {
             return t ? (be(t.userId === n.userId, "Unexpected user '" + t.userId + "' for mutation batch " + e), 
             n.serializer.gd(t)) : null;
         }));
     }, t.prototype.Th = function(t, e) {
         var n = this;
-        return this.wd[e] ? Le.resolve(this.wd[e]) : this.Ph(t, e).next((function(t) {
+        return this.Ed[e] ? Ue.resolve(this.Ed[e]) : this.Ph(t, e).next((function(t) {
             if (t) {
                 var r = t.keys();
-                return n.wd[e] = r, r;
+                return n.Ed[e] = r, r;
             }
             return null;
         }));
     }, t.prototype.xh = function(t, e) {
         var n = this, r = e + 1, i = IDBKeyRange.lowerBound([ this.userId, r ]), o = null;
-        return Lr(t).md({
+        return Ur(t).md({
             index: $r.userMutationsIndex,
             range: i
         }, (function(t, e, i) {
@@ -10320,7 +10320,7 @@ function kr(t) {
         }));
     }, t.prototype.gh = function(t) {
         var e = IDBKeyRange.upperBound([ this.userId, Number.POSITIVE_INFINITY ]), n = -1;
-        return Lr(t).md({
+        return Ur(t).md({
             index: $r.userMutationsIndex,
             range: e,
             reverse: !0
@@ -10331,7 +10331,7 @@ function kr(t) {
         }));
     }, t.prototype.hh = function(t) {
         var e = this, n = IDBKeyRange.bound([ this.userId, -1 ], [ this.userId, Number.POSITIVE_INFINITY ]);
-        return Lr(t).ld($r.userMutationsIndex, n).next((function(t) {
+        return Ur(t).ld($r.userMutationsIndex, n).next((function(t) {
             return t.map((function(t) {
                 return e.serializer.gd(t);
             }));
@@ -10340,7 +10340,7 @@ function kr(t) {
         var n = this, r = ti.prefixForPath(this.userId, e.path), i = IDBKeyRange.lowerBound(r), o = [];
         // Scan the document-mutation index starting with a prefix starting with
         // the given documentKey.
-                return Ur(t).md({
+                return Vr(t).md({
             range: i
         }, (function(r, i, s) {
             var u = r[0], a = r[1], h = r[2], c = Tr(a);
@@ -10353,7 +10353,7 @@ function kr(t) {
             // can stop as soon as we hit any such row.
                         if (u === n.userId && e.path.isEqual(c)) 
             // Look up the mutation batch in the store.
-            return Lr(t).get(h).next((function(t) {
+            return Ur(t).get(h).next((function(t) {
                 if (!t) throw _e("Dangling document-mutation reference found: " + r + " which points to " + h);
                 be(t.userId === n.userId, "Unexpected user '" + t.userId + "' for mutation batch " + h), 
                 o.push(n.serializer.gd(t));
@@ -10362,10 +10362,10 @@ function kr(t) {
         })).next((function() {
             return o;
         }));
-    }, t.prototype.Er = function(t, e) {
-        var n = this, r = new A(Ie), i = [];
+    }, t.prototype.wr = function(t, e) {
+        var n = this, r = new A(Ee), i = [];
         return e.forEach((function(e) {
-            var o = ti.prefixForPath(n.userId, e.path), s = IDBKeyRange.lowerBound(o), u = Ur(t).md({
+            var o = ti.prefixForPath(n.userId, e.path), s = IDBKeyRange.lowerBound(o), u = Vr(t).md({
                 range: s
             }, (function(t, i, o) {
                 var s = t[0], u = t[1], a = t[2], h = Tr(u);
@@ -10379,12 +10379,12 @@ function kr(t) {
                                 s === n.userId && e.path.isEqual(h) ? r = r.add(a) : o.done();
             }));
             i.push(u);
-        })), Le.Ki(i).next((function() {
+        })), Ue.Ki(i).next((function() {
             return n.pd(t, r);
         }));
     }, t.prototype.Vr = function(t, e) {
-        var n = this, r = e.path, i = r.length + 1, o = ti.prefixForPath(this.userId, r), s = IDBKeyRange.lowerBound(o), u = new A(Ie);
-        return Ur(t).md({
+        var n = this, r = e.path, i = r.length + 1, o = ti.prefixForPath(this.userId, r), s = IDBKeyRange.lowerBound(o), u = new A(Ee);
+        return Vr(t).md({
             range: s
         }, (function(t, e, o) {
             var s = t[0], a = t[1], h = t[2], c = Tr(a);
@@ -10402,33 +10402,33 @@ function kr(t) {
         var n = this, r = [], i = [];
         // TODO(rockwood): Implement this using iterate.
         return e.forEach((function(e) {
-            i.push(Lr(t).get(e).next((function(t) {
+            i.push(Ur(t).get(e).next((function(t) {
                 if (null === t) throw _e("Dangling document-mutation reference found, which points to " + e);
                 be(t.userId === n.userId, "Unexpected user '" + t.userId + "' for mutation batch " + e), 
                 r.push(n.serializer.gd(t));
             })));
-        })), Le.Ki(i).next((function() {
+        })), Ue.Ki(i).next((function() {
             return r;
         }));
     }, t.prototype.Vh = function(t, e) {
         var n = this;
-        return Vr(t.yd, this.userId, e).next((function(r) {
+        return Lr(t.yd, this.userId, e).next((function(r) {
             return t.rr((function() {
                 n.Xh(e.batchId);
-            })), Le.forEach(r, (function(e) {
+            })), Ue.forEach(r, (function(e) {
                 return n.Jo.bd(t, e);
             }));
         }));
     }, t.prototype.Xh = function(t) {
-        delete this.wd[t];
+        delete this.Ed[t];
     }, t.prototype.Rh = function(t) {
         var e = this;
         return this.Rd(t).next((function(n) {
-            if (!n) return Le.resolve();
+            if (!n) return Ue.resolve();
             // Verify that there are no entries in the documentMutations index if
             // the queue is empty.
                         var r = IDBKeyRange.lowerBound(ti.prefixForUser(e.userId)), i = [];
-            return Ur(t).md({
+            return Vr(t).md({
                 range: r
             }, (function(t, n, r) {
                 if (t[0] === e.userId) {
@@ -10460,7 +10460,7 @@ function kr(t) {
  *         mutation for the given key.
  */ function Rr(t, e, n) {
     var r = ti.prefixForPath(e, n.path), i = r[1], o = IDBKeyRange.lowerBound(r), s = !1;
-    return Ur(t).md({
+    return Vr(t).md({
         range: o,
         Td: !0
     }, (function(t, n, r) {
@@ -10476,7 +10476,7 @@ function kr(t) {
 /**
  * Delete a mutation batch and the associated document mutations.
  * @return A PersistencePromise of the document mutations that were removed.
- */ function Vr(t, e, n) {
+ */ function Lr(t, e, n) {
     var r = t.store($r.store), i = t.store(ti.store), o = [], s = IDBKeyRange.only(n.batchId), u = 0, a = r.md({
         range: s
     }, (function(t, e, n) {
@@ -10489,20 +10489,20 @@ function kr(t) {
         var l = f[c], p = ti.key(e, l.key.path, n.batchId);
         o.push(i.delete(p)), h.push(l.key);
     }
-    return Le.Ki(o).next((function() {
+    return Ue.Ki(o).next((function() {
         return h;
     }));
 }
 
 /**
  * Helper to get a typed SimpleDbStore for the mutations object store.
- */ function Lr(t) {
+ */ function Ur(t) {
     return vi.ed(t, $r.store);
 }
 
 /**
  * Helper to get a typed SimpleDbStore for the mutationQueues object store.
- */ function Ur(t) {
+ */ function Vr(t) {
     return vi.ed(t, ti.store);
 }
 
@@ -10588,7 +10588,7 @@ function kr(t) {
             var a = r.serializer.$d(u);
             a.sequenceNumber <= e && null === n.get(a.targetId) && (i++, o.push(r.Nd(t, a)));
         })).next((function() {
-            return Le.Ki(o);
+            return Ue.Ki(o);
         })).next((function() {
             return i;
         }));
@@ -10649,14 +10649,14 @@ function kr(t) {
                 return e.forEach((function(e) {
             var s = wr(e.path);
             i.push(o.put(new si(n, s))), i.push(r.Jo.vi(t, e));
-        })), Le.Ki(i);
+        })), Ue.Ki(i);
     }, t.prototype.Sh = function(t, e, n) {
         var r = this, i = Fr(t);
         // PORTING NOTE: The reverse index (documentsTargets) is maintained by
         // IndexedDb.
-                return Le.forEach(e, (function(e) {
+                return Ue.forEach(e, (function(e) {
             var o = wr(e.path);
-            return Le.Ki([ i.delete([ n, o ]), r.Jo.Di(t, e) ]);
+            return Ue.Ki([ i.delete([ n, o ]), r.Jo.Di(t, e) ]);
         }));
     }, t.prototype.Fd = function(t, e) {
         var n = Fr(t), r = IDBKeyRange.bound([ e ], [ e + 1 ], 
@@ -10709,7 +10709,7 @@ function kr(t) {
 }
 
 function Mr(t) {
-    return Ir.ed(t, ui.store).get(ui.key).next((function(t) {
+    return Er.ed(t, ui.store).get(ui.key).next((function(t) {
         return be(null !== t, "Missing metadata row."), t;
     }));
 }
@@ -10818,7 +10818,7 @@ function qr(t) {
      *     key (zero if the key cannot be found).
      */
     t.prototype.Qd = function(t, e) {
-        var n = this, r = Gt(), i = new I(T.F);
+        var n = this, r = Gt(), i = new E(T.F);
         return this.qd(t, e, (function(t, e) {
             var o = n.xd(e);
             o ? (r = r.it(t, o), i = i.it(t, Kr(e))) : (r = r.it(t, null), i = i.it(t, 0));
@@ -10829,24 +10829,24 @@ function qr(t) {
             };
         }));
     }, t.prototype.qd = function(t, e, n) {
-        if (e.U()) return Le.resolve();
-        var r = IDBKeyRange.bound(e.first().path.j(), e.last().path.j()), i = e._t(), o = i.wt();
+        if (e.U()) return Ue.resolve();
+        var r = IDBKeyRange.bound(e.first().path.j(), e.last().path.j()), i = e._t(), o = i.Et();
         return Br(t).md({
             range: r
         }, (function(t, e, r) {
             // Go through keys not found in cache.
-            for (var s = T.nt(t); o && T.F(o, s) < 0; ) n(o, null), o = i.wt();
+            for (var s = T.nt(t); o && T.F(o, s) < 0; ) n(o, null), o = i.Et();
             o && o.isEqual(s) && (
             // Key found in cache.
-            n(o, e), o = i.It() ? i.wt() : null), 
+            n(o, e), o = i.It() ? i.Et() : null), 
             // Skip to the next key (if there is one).
             o ? r.ud(o.path.j()) : r.done();
         })).next((function() {
             // The rest of the keys are not in the cache. One case where `iterate`
             // above won't go through them is when the cache is empty.
-            for (;o; ) n(o, null), o = i.It() ? i.wt() : null;
+            for (;o; ) n(o, null), o = i.It() ? i.Et() : null;
         }));
-    }, t.prototype.wr = function(t, e, n) {
+    }, t.prototype.Er = function(t, e, n) {
         var r = this, i = zt(), o = e.path.length + 1, s = {};
         if (n.isEqual(v.MIN)) {
             // Documents are ordered by key, so we can use a prefix scan to narrow
@@ -10900,8 +10900,8 @@ function qr(t) {
         })).next((function() {
             return r;
         }));
-    }, t.prototype.Eh = function(e) {
-        return new t.Hd(this, !!e && e.wh);
+    }, t.prototype.wh = function(e) {
+        return new t.Hd(this, !!e && e.Eh);
     }, t.prototype.Jd = function(t) {
         return this.getMetadata(t).next((function(t) {
             return t.byteSize;
@@ -10983,7 +10983,7 @@ function zr(t) {
      */
     function n(e, n) {
         var r = this;
-        return (r = t.call(this) || this).Yd = e, r.wh = n, 
+        return (r = t.call(this) || this).Yd = e, r.Eh = n, 
         // A map of document sizes prior to applying the changes in this buffer.
         r.Xd = new De((function(t) {
             return t.toString();
@@ -10991,7 +10991,7 @@ function zr(t) {
     }
     return e.__extends(n, t), n.prototype.nr = function(t) {
         var e = this, n = [], r = 0, i = new A((function(t, e) {
-            return Ie(t.K(), e.K());
+            return Ee(t.K(), e.K());
         }));
         return this.zi.forEach((function(o, s) {
             var u = e.Xd.get(o);
@@ -11000,7 +11000,7 @@ function zr(t) {
                 i = i.add(o.path.L());
                 var h = Kr(a);
                 r += h - u, n.push(e.Yd.Yi(t, o, a));
-            } else if (r -= u, e.wh) {
+            } else if (r -= u, e.Eh) {
                 // In order to track removals, we store a "sentinel delete" in the
                 // RemoteDocumentCache. This entry is represented by a NoDocument
                 // with a version of 0 and ignored by `maybeDecodeDocument()` but
@@ -11010,7 +11010,7 @@ function zr(t) {
             } else n.push(e.Yd.Zi(t, o));
         })), i.forEach((function(r) {
             n.push(e.Yd.ur.Vd(t, r));
-        })), n.push(this.Yd.updateMetadata(t, r)), Le.Ki(n);
+        })), n.push(this.Yd.updateMetadata(t, r)), Ue.Ki(n);
     }, n.prototype.er = function(t, e) {
         var n = this;
         // Record the size of everything we load from the cache so we can compute a delta later.
@@ -11031,16 +11031,16 @@ function zr(t) {
             })), e;
         }));
     }, n;
-}(Ue);
+}(Ve);
 
 var Wr = /** @class */ function() {
     function t() {
         this.tf = new Yr;
     }
     return t.prototype.Vd = function(t, e) {
-        return this.tf.add(e), Le.resolve();
+        return this.tf.add(e), Ue.resolve();
     }, t.prototype.Pr = function(t, e) {
-        return Le.resolve(this.tf.getEntries(e));
+        return Ue.resolve(this.tf.getEntries(e));
     }, t;
 }(), Yr = /** @class */ function() {
     function t() {
@@ -11056,7 +11056,7 @@ var Wr = /** @class */ function() {
     }, t.prototype.getEntries = function(t) {
         return (this.index[t] || new A(w.F)).j();
     }, t;
-}(), Qr = 10, Jr = /** @class */ function() {
+}(), Qr = 10, Xr = /** @class */ function() {
     function t(t) {
         this.serializer = t;
     }
@@ -11071,7 +11071,7 @@ var Wr = /** @class */ function() {
         be(n < r && n >= 0 && r <= Qr, "Unexpected schema upgrade from v" + n + " to v" + r + ".");
         var o = new Nr(e);
         n < 1 && r >= 1 && (function(t) {
-            t.createObjectStore(Xr.store);
+            t.createObjectStore(Jr.store);
         }(t), function(t) {
             t.createObjectStore(Zr.store, {
                 keyPath: Zr.keyPath
@@ -11086,7 +11086,7 @@ var Wr = /** @class */ function() {
         }(t));
         // Migration 2 to populate the targetGlobal object no longer needed since
         // migration 3 unconditionally clears it.
-        var s = Le.resolve();
+        var s = Ue.resolve();
         return n < 3 && r >= 3 && (
         // Brand new clients don't need to drop and recreate--only clients that
         // potentially have corrupt data.
@@ -11124,7 +11124,7 @@ var Wr = /** @class */ function() {
                     var r = e.store($r.store), i = n.map((function(t) {
                         return r.put(t);
                     }));
-                    return Le.Ki(i);
+                    return Ue.Ki(i);
                 }));
             }(t, o);
         }))), s = s.next((function() {
@@ -11171,13 +11171,13 @@ var Wr = /** @class */ function() {
     }, t.prototype.removeAcknowledgedMutations = function(t) {
         var e = this, n = t.store(Zr.store), r = t.store($r.store);
         return n.ld().next((function(n) {
-            return Le.forEach(n, (function(n) {
+            return Ue.forEach(n, (function(n) {
                 var i = IDBKeyRange.bound([ n.userId, -1 ], [ n.userId, n.lastAcknowledgedBatchId ]);
                 return r.ld($r.userMutationsIndex, i).next((function(r) {
-                    return Le.forEach(r, (function(r) {
+                    return Ue.forEach(r, (function(r) {
                         be(r.userId === n.userId, "Cannot process batch " + r.batchId + " from unexpected user");
                         var i = e.serializer.gd(r);
-                        return Vr(t, n.userId, i).next((function() {}));
+                        return Lr(t, n.userId, i).next((function() {}));
                     }));
                 }));
             }));
@@ -11196,12 +11196,12 @@ var Wr = /** @class */ function() {
                     return [ 0, wr(t) ];
                 }(o);
                 r.push(e.get(s).next((function(n) {
-                    return n ? Le.resolve() : function(n) {
+                    return n ? Ue.resolve() : function(n) {
                         return e.put(new si(0, wr(n), t));
                     }(o);
                 })));
             })).next((function() {
-                return Le.Ki(r);
+                return Ue.Ki(r);
             }));
         }));
     }, t.prototype.createCollectionParentIndex = function(t, e) {
@@ -11243,7 +11243,7 @@ var Wr = /** @class */ function() {
     }, t;
 }(), Hr = function(t, e) {
     this.seconds = t, this.nanoseconds = e;
-}, Xr = function(t, 
+}, Jr = function(t, 
 /** Whether to allow shared access from multiple tabs. */
 e, n) {
     this.ownerId = t, this.allowTabSynchronization = e, this.leaseTimestampMs = n;
@@ -11261,12 +11261,12 @@ e, n) {
  * older clients that only supported single locked access to the persistence
  * layer.
  */
-Xr.store = "owner", 
+Jr.store = "owner", 
 /**
      * The key string used for the single object that exists in the
      * DbPrimaryClient store.
      */
-Xr.key = "owner";
+Jr.key = "owner";
 
 var Zr = function(
 /**
@@ -11681,7 +11681,7 @@ r) {
 /** Keys are automatically assigned via the clientId properties. */
 ci.keyPath = "clientId";
 
-var fi = e.__spreadArrays(e.__spreadArrays(e.__spreadArrays([ Zr.store, $r.store, ti.store, ri.store, oi.store, Xr.store, ui.store, si.store ], [ ci.store ]), [ ii.store ]), [ ai.store ]), li = /** @class */ function() {
+var fi = e.__spreadArrays(e.__spreadArrays(e.__spreadArrays([ Zr.store, $r.store, ti.store, ri.store, oi.store, Jr.store, ui.store, si.store ], [ ci.store ]), [ ii.store ]), [ ai.store ]), li = /** @class */ function() {
     function t() {
         /**
          * An in-memory copy of the index entries we've already written since the SDK
@@ -11713,7 +11713,7 @@ var fi = e.__spreadArrays(e.__spreadArrays(e.__spreadArrays([ Zr.store, $r.store
             };
             return pi(t).put(o);
         }
-        return Le.resolve();
+        return Ue.resolve();
     }, t.prototype.Pr = function(t, e) {
         var n = [], r = IDBKeyRange.bound([ e, "" ], [ Ne(e), "" ], 
         /*lowerOpen=*/ !1, 
@@ -11888,11 +11888,22 @@ function pi(t) {
         this.window = i.window, this.Tf = this.window.localStorage;
     }
     return t.ed = function(t, e) {
-        if (t instanceof mi) return Ir.ed(t.yd, e);
+        if (t instanceof mi) return Er.ed(t.yd, e);
         throw _e("IndexedDbPersistence must use instances of IndexedDbTransaction");
-    }, t.mf = function(e) {
-        if (!t.Uc()) throw new c(h.UNIMPLEMENTED, "This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.");
-        return new t(e.allowTabSynchronization, e.persistenceKey, e.clientId, e.platform, e.Ef, e.$a, e.serializer, e.rf);
+    }, t.mf = function(n) {
+        return e.__awaiter(this, void 0, void 0, (function() {
+            var r;
+            return e.__generator(this, (function(e) {
+                switch (e.label) {
+                  case 0:
+                    if (!t.Uc()) throw new c(h.UNIMPLEMENTED, "This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.");
+                    return [ 4 /*yield*/ , (r = new t(n.allowTabSynchronization, n.persistenceKey, n.clientId, n.platform, n.wf, n.$a, n.serializer, n.rf)).start() ];
+
+                  case 1:
+                    return [ 2 /*return*/ , (e.sent(), r) ];
+                }
+            }));
+        }));
     }, 
     /**
      * Attempt to start IndexedDb persistence.
@@ -11901,10 +11912,10 @@ function pi(t) {
      */
     t.prototype.start = function() {
         var t = this;
-        return Ir.Yl(this.df, Qr, new Jr(this.serializer)).then((function(e) {
-            return t.wf = e, t.If();
+        return Er.Yl(this.df, Qr, new Xr(this.serializer)).then((function(e) {
+            return t.Ef = e, t.If();
         })).then((function() {
-            return t.Rf(), t.Af(), t.Pf(), t.wf.runTransaction("readonly", [ ui.store ], (function(t) {
+            return t.Rf(), t.Af(), t.Pf(), t.Ef.runTransaction("readonly", [ ui.store ], (function(t) {
                 return qr(t);
             }));
         })).then((function(e) {
@@ -11912,7 +11923,7 @@ function pi(t) {
         })).then((function() {
             t.hf = !0;
         })).catch((function(e) {
-            return t.wf && t.wf.close(), Promise.reject(e);
+            return t.Ef && t.Ef.close(), Promise.reject(e);
         }));
     }, t.prototype.gf = function(t) {
         var n = this;
@@ -11925,7 +11936,7 @@ function pi(t) {
         }, t(this.isPrimary);
     }, t.prototype.pf = function(t) {
         var n = this;
-        this.wf.sd((function(r) {
+        this.Ef.sd((function(r) {
             return e.__awaiter(n, void 0, void 0, (function() {
                 return e.__generator(this, (function(e) {
                     switch (e.label) {
@@ -11971,7 +11982,7 @@ function pi(t) {
      */
     t.prototype.If = function() {
         var t = this;
-        return this.wf.runTransaction("readwrite", fi, (function(e) {
+        return this.Ef.runTransaction("readwrite", fi, (function(e) {
             return wi(e).put(new ci(t.clientId, Date.now(), t.networkEnabled, t.inForeground)).next((function() {
                 if (t.isPrimary) return t.yf(e).next((function(e) {
                     e || (t.isPrimary = !1, t.$a.qr((function() {
@@ -11998,8 +12009,8 @@ function pi(t) {
         }));
     }, t.prototype.yf = function(t) {
         var e = this;
-        return gi(t).get(Xr.key).next((function(t) {
-            return Le.resolve(e.Df(t));
+        return gi(t).get(Jr.key).next((function(t) {
+            return Ue.resolve(e.Df(t));
         }));
     }, t.prototype.Cf = function(t) {
         return wi(t).delete(this.clientId);
@@ -12023,7 +12034,7 @@ function pi(t) {
                                 return -1 === e.indexOf(t);
                             }));
                             // Delete metadata for clients that are no longer considered active.
-                                                        return Le.forEach(i, (function(t) {
+                                                        return Ue.forEach(i, (function(t) {
                                 return r.delete(t.clientId);
                             })).next((function() {
                                 return i;
@@ -12075,7 +12086,7 @@ function pi(t) {
      */
     t.prototype.bf = function(t) {
         var e = this;
-        return gi(t).get(Xr.key).next((function(n) {
+        return gi(t).get(Jr.key).next((function(n) {
             // A client is eligible for the primary lease if:
             // - its network is enabled and the client's tab is in the foreground.
             // - its network is enabled and no other client's tab is in the
@@ -12125,7 +12136,7 @@ function pi(t) {
                     // The shutdown() operations are idempotent and can be called even when
                     // start() aborted (e.g. because it couldn't acquire the persistence lease).
                     return this.hf = !1, this.Lf(), this.cf && (this.cf.cancel(), this.cf = null), this.Of(), 
-                    this.xf(), [ 4 /*yield*/ , this.wf.runTransaction("readwrite", [ Xr.store, ci.store ], (function(e) {
+                    this.xf(), [ 4 /*yield*/ , this.Ef.runTransaction("readwrite", [ Jr.store, ci.store ], (function(e) {
                         return t.vf(e).next((function() {
                             return t.Cf(e);
                         }));
@@ -12134,7 +12145,7 @@ function pi(t) {
                   case 1:
                     // The shutdown() operations are idempotent and can be called even when
                     // start() aborted (e.g. because it couldn't acquire the persistence lease).
-                    return e.sent(), this.wf.close(), 
+                    return e.sent(), this.Ef.close(), 
                     // Remove the entry marking the client as zombied from LocalStorage since
                     // we successfully deleted its metadata from IndexedDb.
                     this.Bf(), [ 2 /*return*/ ];
@@ -12153,7 +12164,7 @@ function pi(t) {
         }));
     }, t.prototype.Jh = function() {
         var t = this;
-        return this.wf.runTransaction("readonly", [ ci.store ], (function(e) {
+        return this.Ef.runTransaction("readonly", [ ci.store ], (function(e) {
             return wi(e).ld().next((function(e) {
                 return t.Ff(e, 18e5).map((function(t) {
                     return t.clientId;
@@ -12166,7 +12177,7 @@ function pi(t) {
             return e.__generator(this, (function(e) {
                 switch (e.label) {
                   case 0:
-                    return t.Uc() ? (r = n + t.ff, [ 4 /*yield*/ , Ir.delete(r) ]) : [ 2 /*return*/ , Promise.resolve() ];
+                    return t.Uc() ? (r = n + t.ff, [ 4 /*yield*/ , Er.delete(r) ]) : [ 2 /*return*/ , Promise.resolve() ];
 
                   case 1:
                     return e.sent(), [ 2 /*return*/ ];
@@ -12193,7 +12204,7 @@ function pi(t) {
         var i, o = "readonly" === e ? "readonly" : "readwrite";
         // Do all transactions as readwrite against all object stores, since we
         // are the only reader/writer.
-        return this.wf.runTransaction(o, fi, (function(o) {
+        return this.Ef.runTransaction(o, fi, (function(o) {
             return i = new mi(o, r.Vf.next()), "readwrite-primary" === e ? r.yf(o).next((function(t) {
                 return !!t || r.bf(o);
             })).next((function(e) {
@@ -12221,7 +12232,7 @@ function pi(t) {
     // be turned off.
     t.prototype.Uf = function(t) {
         var e = this;
-        return gi(t).get(Xr.key).next((function(t) {
+        return gi(t).get(Jr.key).next((function(t) {
             if (null !== t && e.Nf(t.leaseTimestampMs, 5e3) && !e.Mf(t.ownerId) && !e.Df(t) && !t.allowTabSynchronization) throw new c(h.FAILED_PRECONDITION, yi);
         }));
     }, 
@@ -12230,10 +12241,10 @@ function pi(t) {
      * method does not verify that the client is eligible for this lease.
      */
     t.prototype.Sf = function(t) {
-        var e = new Xr(this.clientId, this.allowTabSynchronization, Date.now());
-        return gi(t).put(Xr.key, e);
+        var e = new Jr(this.clientId, this.allowTabSynchronization, Date.now());
+        return gi(t).put(Jr.key, e);
     }, t.Uc = function() {
-        return Ir.Uc();
+        return Er.Uc();
     }, 
     /**
      * Generates a string used as a prefix when storing data in IndexedDB and
@@ -12246,12 +12257,12 @@ function pi(t) {
         // projectIDs are DNS-compatible names and cannot contain dots
         // so there's no danger of collisions.
         var e = t.cn.projectId;
-        return t.cn.Ei || (e += "." + t.cn.database), "firestore/" + t.persistenceKey + "/" + e + "/";
+        return t.cn.wi || (e += "." + t.cn.database), "firestore/" + t.persistenceKey + "/" + e + "/";
     }, 
     /** Checks the primary lease and removes it if we are the current primary. */ t.prototype.vf = function(t) {
         var e = this, n = gi(t);
-        return n.get(Xr.key).next((function(t) {
-            return e.Df(t) ? (ve("IndexedDbPersistence", "Releasing primary lease."), n.delete(Xr.key)) : Le.resolve();
+        return n.get(Jr.key).next((function(t) {
+            return e.Df(t) ? (ve("IndexedDbPersistence", "Releasing primary lease."), n.delete(Jr.key)) : Ue.resolve();
         }));
     }, 
     /** Verifies that `updateTimeMs` is within `maxAgeMs`. */ t.prototype.Nf = function(t, e) {
@@ -12356,7 +12367,7 @@ function pi(t) {
  * Helper to get a typed SimpleDbStore for the primary client object store.
  */
 function gi(t) {
-    return t.store(Xr.store);
+    return t.store(Jr.store);
 }
 
 /**
@@ -12409,18 +12420,18 @@ var _i = /** @class */ function() {
      * the collection run.
      */
     t.prototype.Kf = function(t, e) {
-        return this.Qf.Mi(e) ? Le.resolve(!0) : function(t, e) {
+        return this.Qf.Mi(e) ? Ue.resolve(!0) : function(t, e) {
             var n = !1;
-            return Or(t).Ed((function(r) {
+            return Or(t).wd((function(r) {
                 return Rr(t, r, e).next((function(t) {
-                    return t && (n = !0), Le.resolve(!t);
+                    return t && (n = !0), Ue.resolve(!t);
                 }));
             })).next((function() {
                 return n;
             }));
         }(t, e);
     }, t.prototype.Bo = function(t, e) {
-        var n = this, r = this.db.Zo().Eh(), i = [], o = 0;
+        var n = this, r = this.db.Zo().wh(), i = [], o = 0;
         return this.jf(t, (function(s, u) {
             if (u <= e) {
                 var a = n.Kf(t, s).next((function(e) {
@@ -12434,7 +12445,7 @@ var _i = /** @class */ function() {
                 i.push(a);
             }
         })).next((function() {
-            return Le.Ki(i);
+            return Ue.Ki(i);
         })).next((function() {
             return r.apply(t);
         })).next((function() {
@@ -12523,19 +12534,19 @@ function bi(t, e) {
              */
         this.lastStreamToken = R.xt, 
         /** An ordered mapping between documents and the mutations batch IDs. */
-        this.zf = new A(Ve.Ee);
+        this.zf = new A(Le.we);
     }
     return t.prototype.Rd = function(t) {
-        return Le.resolve(0 === this.ar.length);
+        return Ue.resolve(0 === this.ar.length);
     }, t.prototype.mh = function(t, e, n) {
         var r = e.batchId, i = this.Hf(r, "acknowledged");
         return be(0 === i, "Can only acknowledge the first batch in the mutation queue"), 
         // Verify that the batch in the queue is the one to be acknowledged.
-        this.ar[i], this.lastStreamToken = n, Le.resolve();
+        this.ar[i], this.lastStreamToken = n, Ue.resolve();
     }, t.prototype.ph = function(t) {
-        return Le.resolve(this.lastStreamToken);
+        return Ue.resolve(this.lastStreamToken);
     }, t.prototype.yh = function(t, e) {
-        return this.lastStreamToken = e, Le.resolve();
+        return this.lastStreamToken = e, Ue.resolve();
     }, t.prototype.dh = function(t, e, n, r) {
         var i = this.Gf;
         this.Gf++, this.ar.length > 0 && this.ar[this.ar.length - 1];
@@ -12544,37 +12555,37 @@ function bi(t, e) {
         // Track references by document key and index collection parents.
         for (var s = 0, u = r; s < u.length; s++) {
             var a = u[s];
-            this.zf = this.zf.add(new Ve(a.key, i)), this.ur.Vd(t, a.key.path.L());
+            this.zf = this.zf.add(new Le(a.key, i)), this.ur.Vd(t, a.key.path.L());
         }
-        return Le.resolve(o);
+        return Ue.resolve(o);
     }, t.prototype.Ph = function(t, e) {
-        return Le.resolve(this.Jf(e));
+        return Ue.resolve(this.Jf(e));
     }, t.prototype.Th = function(t, e) {
         var n = this.Jf(e);
-        return Le.resolve(n.keys());
+        return Ue.resolve(n.keys());
     }, t.prototype.xh = function(t, e) {
         var n = e + 1, r = this.Yf(n), i = r < 0 ? 0 : r;
         // The requested batchId may still be out of range so normalize it to the
         // start of the queue.
-                return Le.resolve(this.ar.length > i ? this.ar[i] : null);
+                return Ue.resolve(this.ar.length > i ? this.ar[i] : null);
     }, t.prototype.gh = function() {
-        return Le.resolve(0 === this.ar.length ? -1 : this.Gf - 1);
+        return Ue.resolve(0 === this.ar.length ? -1 : this.Gf - 1);
     }, t.prototype.hh = function(t) {
-        return Le.resolve(this.ar.slice());
+        return Ue.resolve(this.ar.slice());
     }, t.prototype._r = function(t, e) {
-        var n = this, r = new Ve(e, 0), i = new Ve(e, Number.POSITIVE_INFINITY), o = [];
+        var n = this, r = new Le(e, 0), i = new Le(e, Number.POSITIVE_INFINITY), o = [];
         return this.zf.Ct([ r, i ], (function(t) {
             var e = n.Jf(t.Li);
             o.push(e);
-        })), Le.resolve(o);
-    }, t.prototype.Er = function(t, e) {
-        var n = this, r = new A(Ie);
+        })), Ue.resolve(o);
+    }, t.prototype.wr = function(t, e) {
+        var n = this, r = new A(Ee);
         return e.forEach((function(t) {
-            var e = new Ve(t, 0), i = new Ve(t, Number.POSITIVE_INFINITY);
+            var e = new Le(t, 0), i = new Le(t, Number.POSITIVE_INFINITY);
             n.zf.Ct([ e, i ], (function(t) {
                 r = r.add(t.Li);
             }));
-        })), Le.resolve(this.Xf(r));
+        })), Ue.resolve(this.Xf(r));
     }, t.prototype.Vr = function(t, e) {
         // Use the query path as a prefix for testing if a document matches the
         // query.
@@ -12584,7 +12595,7 @@ function bi(t, e) {
         // segments. The empty segment can be used a suffix of the query path
         // because it precedes all other segments in an ordered traversal.
                 T.st(i) || (i = i.child(""));
-        var o = new Ve(new T(i), 0), s = new A(Ie);
+        var o = new Le(new T(i), 0), s = new A(Ee);
         // Find unique batchIDs referenced by all documents potentially matching the
         // query.
                 return this.zf.kt((function(t) {
@@ -12596,7 +12607,7 @@ function bi(t, e) {
             // TODO(mcg): we'll need a different scanner when we implement
             // ancestor queries.
             e.length === r && (s = s.add(t.Li)), !0);
-        }), o), Le.resolve(this.Xf(s));
+        }), o), Ue.resolve(this.Xf(s));
     }, t.prototype.Xf = function(t) {
         var e = this, n = [];
         // Construct an array of matching batches, sorted by batchID to ensure that
@@ -12610,8 +12621,8 @@ function bi(t, e) {
         be(0 === this.Hf(e.batchId, "removed"), "Can only remove the first entry of the mutation queue"), 
         this.ar.shift();
         var r = this.zf;
-        return Le.forEach(e.mutations, (function(i) {
-            var o = new Ve(i.key, e.batchId);
+        return Ue.forEach(e.mutations, (function(i) {
+            var o = new Le(i.key, e.batchId);
             return r = r.delete(o), n.Jo.bd(t, i.key);
         })).next((function() {
             n.zf = r;
@@ -12619,10 +12630,10 @@ function bi(t, e) {
     }, t.prototype.Xh = function(t) {
         // No-op since the memory mutation queue does not maintain a separate cache.
     }, t.prototype.Mi = function(t, e) {
-        var n = new Ve(e, 0), r = this.zf.Nt(n);
-        return Le.resolve(e.isEqual(r && r.key));
+        var n = new Le(e, 0), r = this.zf.Nt(n);
+        return Ue.resolve(e.isEqual(r && r.key));
     }, t.prototype.Rh = function(t) {
-        return this.ar.length, Le.resolve();
+        return this.ar.length, Ue.resolve();
     }, 
     /**
      * Finds the index of the given batchId in the mutation queue and asserts that
@@ -12659,7 +12670,7 @@ function bi(t, e) {
         var e = this.Yf(t);
         return e < 0 || e >= this.ar.length ? null : this.ar[e];
     }, t;
-}(), Ii = /** @class */ function() {
+}(), Ei = /** @class */ function() {
     /**
      * @param sizer Used to assess the size of a document. For eager GC, this is expected to just
      * return 0 to avoid unnecessarily doing the work of calculating the size.
@@ -12667,7 +12678,7 @@ function bi(t, e) {
     function t(t, e) {
         this.ur = t, this.Zf = e, 
         /** Underlying cache of documents and their read times. */
-        this.docs = new I(T.F), 
+        this.docs = new E(T.F), 
         /** Size of all cached documents. */
         this.size = 0
         /**
@@ -12696,37 +12707,37 @@ function bi(t, e) {
         e && (this.docs = this.docs.remove(t), this.size -= e.size);
     }, t.prototype.tr = function(t, e) {
         var n = this.docs.get(e);
-        return Le.resolve(n ? n.Ud : null);
+        return Ue.resolve(n ? n.Ud : null);
     }, t.prototype.getEntries = function(t, e) {
         var n = this, r = Gt();
         return e.forEach((function(t) {
             var e = n.docs.get(t);
             r = r.it(t, e ? e.Ud : null);
-        })), Le.resolve(r);
-    }, t.prototype.wr = function(t, e, n) {
+        })), Ue.resolve(r);
+    }, t.prototype.Er = function(t, e, n) {
         for (var r = zt(), i = new T(e.path.child("")), o = this.docs.lt(i)
         // Documents are ordered by key, so we can use a prefix scan to narrow down
         // the documents we need to match the query against.
         ; o.It(); ) {
-            var s = o.wt(), u = s.key, a = s.value, h = a.Ud, c = a.readTime;
+            var s = o.Et(), u = s.key, a = s.value, h = a.Ud, c = a.readTime;
             if (!e.path.q(u.path)) break;
             c.D(n) <= 0 || h instanceof vt && e.matches(h) && (r = r.it(h.key, h));
         }
-        return Le.resolve(r);
+        return Ue.resolve(r);
     }, t.prototype.tT = function(t, e) {
-        return Le.forEach(this.docs, (function(t) {
+        return Ue.forEach(this.docs, (function(t) {
             return e(t);
         }));
     }, t.prototype.ea = function(t, e) {
         throw new Error("getNewDocumentChanges() is not supported with MemoryPersistence");
     }, t.prototype.na = function(t) {
-        return Le.resolve(v.MIN);
-    }, t.prototype.Eh = function(e) {
+        return Ue.resolve(v.MIN);
+    }, t.prototype.wh = function(e) {
         // `trackRemovals` is ignores since the MemoryRemoteDocumentCache keeps
         // a separate changelog and does not need special handling for removals.
         return new t.Hd(this);
     }, t.prototype.Jd = function(t) {
-        return Le.resolve(this.size);
+        return Ue.resolve(this.size);
     }, t;
 }();
 
@@ -12749,7 +12760,7 @@ function bi(t, e) {
 /**
  * Handles the details of adding and updating documents in the MemoryRemoteDocumentCache.
  */
-Ii.Hd = /** @class */ function(t) {
+Ei.Hd = /** @class */ function(t) {
     function n(e) {
         var n = this;
         return (n = t.call(this) || this).Yd = e, n;
@@ -12758,13 +12769,13 @@ Ii.Hd = /** @class */ function(t) {
         var e = this, n = [];
         return this.zi.forEach((function(r, i) {
             i ? n.push(e.Yd.Yi(t, i, e.readTime)) : e.Yd.Zi(r);
-        })), Le.Ki(n);
+        })), Ue.Ki(n);
     }, n.prototype.er = function(t, e) {
         return this.Yd.tr(t, e);
     }, n.prototype.sr = function(t, e) {
         return this.Yd.getEntries(t, e);
     }, n;
-}(Ue);
+}(Ve);
 
 /**
  * @license
@@ -12782,7 +12793,7 @@ Ii.Hd = /** @class */ function(t) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var Ei = /** @class */ function() {
+var Ii = /** @class */ function() {
     function t(t) {
         this.persistence = t, 
         /**
@@ -12806,40 +12817,40 @@ var Ei = /** @class */ function() {
     return t.prototype.Xs = function(t, e) {
         return this.eT.forEach((function(t, n) {
             return e(n);
-        })), Le.resolve();
+        })), Ue.resolve();
     }, t.prototype.bh = function(t) {
-        return Le.resolve(this.lastRemoteSnapshotVersion);
+        return Ue.resolve(this.lastRemoteSnapshotVersion);
     }, t.prototype.Dd = function(t) {
-        return Le.resolve(this.sT);
+        return Ue.resolve(this.sT);
     }, t.prototype.Qh = function(t) {
-        return this.highestTargetId = this.iT.next(), Le.resolve(this.highestTargetId);
+        return this.highestTargetId = this.iT.next(), Ue.resolve(this.highestTargetId);
     }, t.prototype.$h = function(t, e, n) {
         return n && (this.lastRemoteSnapshotVersion = n), e > this.sT && (this.sT = e), 
-        Le.resolve();
+        Ue.resolve();
     }, t.prototype.Cd = function(t) {
         this.eT.set(t.target, t);
         var e = t.targetId;
         e > this.highestTargetId && (this.iT = new ur(e), this.highestTargetId = e), t.sequenceNumber > this.sT && (this.sT = t.sequenceNumber);
     }, t.prototype.Wh = function(t, e) {
-        return this.Cd(e), this.targetCount += 1, Le.resolve();
+        return this.Cd(e), this.targetCount += 1, Ue.resolve();
     }, t.prototype.Nh = function(t, e) {
-        return this.Cd(e), Le.resolve();
+        return this.Cd(e), Ue.resolve();
     }, t.prototype.Nd = function(t, e) {
         return this.eT.delete(e.target), this.nT.Ni(e.targetId), this.targetCount -= 1, 
-        Le.resolve();
+        Ue.resolve();
     }, t.prototype.xo = function(t, e, n) {
         var r = this, i = 0, o = [];
         return this.eT.forEach((function(s, u) {
             u.sequenceNumber <= e && null === n.get(u.targetId) && (r.eT.delete(s), o.push(r.Fd(t, u.targetId)), 
             i++);
-        })), Le.Ki(o).next((function() {
+        })), Ue.Ki(o).next((function() {
             return i;
         }));
     }, t.prototype.Ld = function(t) {
-        return Le.resolve(this.targetCount);
+        return Ue.resolve(this.targetCount);
     }, t.prototype.qh = function(t, e) {
         var n = this.eT.get(e) || null;
-        return Le.resolve(n);
+        return Ue.resolve(n);
     }, t.prototype.un = function(t, e) {
         // This method is only needed for multi-tab and we can't implement it
         // efficiently without additional data structures.
@@ -12849,20 +12860,20 @@ var Ei = /** @class */ function() {
         var r = this.persistence.Jo, i = [];
         return r && e.forEach((function(e) {
             i.push(r.vi(t, e));
-        })), Le.Ki(i);
+        })), Ue.Ki(i);
     }, t.prototype.Sh = function(t, e, n) {
         this.nT.ki(e, n);
         var r = this.persistence.Jo, i = [];
         return r && e.forEach((function(e) {
             i.push(r.Di(t, e));
-        })), Le.Ki(i);
+        })), Ue.Ki(i);
     }, t.prototype.Fd = function(t, e) {
-        return this.nT.Ni(e), Le.resolve();
+        return this.nT.Ni(e), Ue.resolve();
     }, t.prototype.Gh = function(t, e) {
         var n = this.nT.$i(e);
-        return Le.resolve(n);
+        return Ue.resolve(n);
     }, t.prototype.Mi = function(t, e) {
-        return Le.resolve(this.nT.Mi(e));
+        return Ue.resolve(this.nT.Mi(e));
     }, t;
 }(), Ni = /** @class */ function() {
     /**
@@ -12874,13 +12885,11 @@ var Ei = /** @class */ function() {
     function t(t, e) {
         var n = this;
         this.clientId = t, this.rT = {}, this.Vf = new qe(0), this.hf = !1, this.hf = !0, 
-        this.Jo = e(this), this.th = new Ei(this), this.ur = new Wr, this.hr = new Ii(this.ur, (function(t) {
+        this.Jo = e(this), this.th = new Ii(this), this.ur = new Wr, this.hr = new Ei(this.ur, (function(t) {
             return n.Jo.oT(t);
         }));
     }
-    return t.prototype.start = function() {
-        return Promise.resolve();
-    }, t.prototype.lc = function() {
+    return t.prototype.lc = function() {
         // No durable state to ensure is closed on shutdown.
         return this.hf = !1, Promise.resolve();
     }, Object.defineProperty(t.prototype, "ko", {
@@ -12923,7 +12932,7 @@ var Ei = /** @class */ function() {
             return i.or(), t;
         }));
     }, t.prototype.uT = function(t, e) {
-        return Le.Gi(Object.values(this.rT).map((function(n) {
+        return Ue.Gi(Object.values(this.rT).map((function(n) {
             return function() {
                 return n.Mi(t, e);
             };
@@ -12951,11 +12960,11 @@ var Ei = /** @class */ function() {
     }), t.prototype.Ho = function(t) {
         this.Qf = t;
     }, t.prototype.vi = function(t, e) {
-        return this.lT.delete(e), Le.resolve();
+        return this.lT.delete(e), Ue.resolve();
     }, t.prototype.Di = function(t, e) {
-        return this.lT.add(e), Le.resolve();
+        return this.lT.add(e), Ue.resolve();
     }, t.prototype.bd = function(t, e) {
-        return this.lT.add(e), Le.resolve();
+        return this.lT.add(e), Ue.resolve();
     }, t.prototype.removeTarget = function(t, e) {
         var n = this, r = this.persistence.eh();
         return r.Gh(t, e.targetId).next((function(t) {
@@ -12968,9 +12977,9 @@ var Ei = /** @class */ function() {
     }, t.prototype.hT = function() {
         this.cT = new Set;
     }, t.prototype.aT = function(t) {
-        var e = this, n = this.persistence.Zo().Eh();
+        var e = this, n = this.persistence.Zo().wh();
         // Remove newly orphaned documents.
-                return Le.forEach(this.lT, (function(r) {
+                return Ue.forEach(this.lT, (function(r) {
             return e.dT(t, r).next((function(t) {
                 t || n.Zi(r);
             }));
@@ -12987,48 +12996,61 @@ var Ei = /** @class */ function() {
         return 0;
     }, t.prototype.dT = function(t, e) {
         var n = this;
-        return Le.Gi([ function() {
+        return Ue.Gi([ function() {
             return n.persistence.eh().Mi(t, e);
         }, function() {
             return n.persistence.uT(t, e);
         }, function() {
-            return Le.resolve(n.Qf.Mi(e));
+            return Ue.resolve(n.Qf.Mi(e));
         } ]);
     }, t;
 }(), Di = /** @class */ function() {
     function t() {}
-    return t.prototype.initialize = function(t) {
+    return t.prototype.initialize = function(t, n, r, i, o, s, u, a) {
         return e.__awaiter(this, void 0, void 0, (function() {
-            var n = this;
-            return e.__generator(this, (function(r) {
-                switch (r.label) {
+            var f, l, p, d, y = this;
+            return e.__generator(this, (function(m) {
+                switch (m.label) {
                   case 0:
-                    return this.X_ = this.fT(t), this.persistence = this.TT(t), [ 4 /*yield*/ , this.persistence.start() ];
+                    if (f = vi.qf(n), l = r.fT(n.cn), !or.Uc(r)) throw new c(h.UNIMPLEMENTED, "IndexedDB persistence is only available on platforms that support LocalStorage.");
+                    return this.X_ = a.synchronizeTabs ? new or(t, r, f, o, s) : new sr, this.X_.$u = function(t) {
+                        return y.mc.B_(t, 1 /* SharedClientState */);
+                    }, p = this, [ 4 /*yield*/ , vi.mf({
+                        allowTabSynchronization: a.synchronizeTabs,
+                        persistenceKey: f,
+                        clientId: o,
+                        platform: r,
+                        $a: t,
+                        serializer: l,
+                        wf: We.Io(a.cacheSizeBytes),
+                        rf: this.X_
+                    }) ];
 
                   case 1:
-                    return r.sent(), this.mT = this.ET(t), this.Wu = this.wT(t), this.W_ = this.IT(t), 
-                    this.mc = this.RT(t), this.AT = this.PT(t), this.X_.$u = function(t) {
-                        return n.mc.B_(t, 1 /* SharedClientState */);
-                    }, this.W_.mc = this.mc, this.X_.mc = this.mc, [ 4 /*yield*/ , this.X_.start() ];
+                    return p.persistence = m.sent(), d = this.persistence.Jo.bo, this.TT = new Ye(d, t), 
+                    this.Wu = new Xe(this.persistence, new gr, s), this.W_ = new Hn(this.Wu, i, t, (function(t) {
+                        return y.mc.B_(t, 0 /* RemoteStore */);
+                    }), r.mT()), this.mc = new dr(this.Wu, this.W_, this.X_, s, u), this.wT = new mr(this.mc), 
+                    this.W_.mc = this.mc, this.X_.mc = this.mc, [ 4 /*yield*/ , this.X_.start() ];
 
                   case 2:
-                    return r.sent(), [ 4 /*yield*/ , this.W_.start() ];
+                    return m.sent(), [ 4 /*yield*/ , this.W_.start() ];
 
                   case 3:
-                    return r.sent(), [ 4 /*yield*/ , this.Wu.start() ];
+                    return m.sent(), [ 4 /*yield*/ , this.Wu.start() ];
 
                   case 4:
                     // NOTE: This will immediately call the listener, so we make sure to
                     // set it after localStore / remoteStore are started.
-                    return r.sent(), [ 4 /*yield*/ , this.persistence.gf((function(t) {
-                        return e.__awaiter(n, void 0, void 0, (function() {
+                    return m.sent(), [ 4 /*yield*/ , this.persistence.gf((function(t) {
+                        return e.__awaiter(y, void 0, void 0, (function() {
                             return e.__generator(this, (function(e) {
                                 switch (e.label) {
                                   case 0:
                                     return [ 4 /*yield*/ , this.mc.Cc(t) ];
 
                                   case 1:
-                                    return e.sent(), this.mT && (t && !this.mT.ko ? this.mT.start(this.Wu) : t || this.mT.stop()), 
+                                    return e.sent(), t && !this.TT.ko ? this.TT.start(this.Wu) : t || this.TT.stop(), 
                                     [ 2 /*return*/ ];
                                 }
                             }));
@@ -13038,61 +13060,46 @@ var Ei = /** @class */ function() {
                   case 5:
                     // NOTE: This will immediately call the listener, so we make sure to
                     // set it after localStore / remoteStore are started.
-                    return r.sent(), [ 2 /*return*/ ];
+                    return m.sent(), [ 2 /*return*/ ];
                 }
             }));
         }));
-    }, t.prototype.PT = function(t) {
-        return new mr(this.mc);
-    }, t.prototype.ET = function(t) {
-        return null;
-    }, t.prototype.wT = function(t) {
-        return new Je(this.persistence, new gr, t.VT);
-    }, t.prototype.TT = function(t) {
-        return new Ni(t.clientId, Si._T);
-    }, t.prototype.IT = function(t) {
-        var e = this;
-        return new Hn(this.Wu, t.bu, t.Nr, (function(t) {
-            return e.mc.B_(t, 0 /* RemoteStore */);
-        }), t.platform.gT());
-    }, t.prototype.fT = function(t) {
-        return new sr;
-    }, t.prototype.RT = function(t) {
-        return new dr(this.Wu, this.W_, this.X_, t.VT, t.Z_);
     }, t.prototype.clearPersistence = function(t) {
-        throw new c(h.FAILED_PRECONDITION, "You are using the memory-only build of Firestore. Persistence support is only available via the @firebase/firestore bundle or the firebase-firestore.js build.");
-    }, t;
-}(), ki = /** @class */ function(t) {
-    function n() {
-        return null !== t && t.apply(this, arguments) || this;
-    }
-    return e.__extends(n, t), n.prototype.ET = function(t) {
-        var e = this.persistence.Jo.bo;
-        return new Ye(e, t.Nr);
-    }, n.prototype.TT = function(t) {
-        var e = vi.qf(t.pT), n = t.platform.yT(t.pT.cn);
-        return vi.mf({
-            allowTabSynchronization: t.bT.synchronizeTabs,
-            persistenceKey: e,
-            clientId: t.clientId,
-            platform: t.platform,
-            $a: t.Nr,
-            serializer: n,
-            Ef: We.Io(t.bT.cacheSizeBytes),
-            rf: this.X_
-        });
-    }, n.prototype.fT = function(t) {
-        if (t.bT.synchronizeTabs) {
-            if (!or.Uc(t.platform)) throw new c(h.UNIMPLEMENTED, "IndexedDB persistence is only available on platforms that support LocalStorage.");
-            var e = vi.qf(t.pT);
-            return new or(t.Nr, t.platform, e, t.clientId, t.VT);
-        }
-        return new sr;
-    }, n.prototype.clearPersistence = function(t) {
         var e = vi.qf(t);
         return vi.clearPersistence(e);
-    }, n;
-}(Di), xi = /** @class */ function() {
+    }, t;
+}(), ki = "You are using the memory-only build of Firestore. Persistence support is only available via the @firebase/firestore bundle or the firebase-firestore.js build.", xi = /** @class */ function() {
+    function t(t) {
+        void 0 === t && (t = Si._T), this.ET = t;
+    }
+    return t.prototype.initialize = function(t, n, r, i, o, s, u, a) {
+        return e.__awaiter(this, void 0, void 0, (function() {
+            var n = this;
+            return e.__generator(this, (function(e) {
+                switch (e.label) {
+                  case 0:
+                    if (a.IT) throw new c(h.FAILED_PRECONDITION, ki);
+                    return this.persistence = new Ni(o, this.ET), this.TT = null, this.X_ = new sr, 
+                    this.Wu = new Xe(this.persistence, new gr, s), this.W_ = new Hn(this.Wu, i, t, (function(t) {
+                        return n.mc.B_(t, 0 /* RemoteStore */);
+                    }), r.mT()), this.mc = new dr(this.Wu, this.W_, this.X_, s, u), this.wT = new mr(this.mc), 
+                    this.W_.mc = this.mc, [ 4 /*yield*/ , this.W_.start() ];
+
+                  case 1:
+                    return e.sent(), [ 4 /*yield*/ , this.W_.Cc(!0) ];
+
+                  case 2:
+                    return e.sent(), [ 4 /*yield*/ , this.mc.Cc(!0) ];
+
+                  case 3:
+                    return e.sent(), [ 2 /*return*/ ];
+                }
+            }));
+        }));
+    }, t.prototype.clearPersistence = function() {
+        throw new c(h.FAILED_PRECONDITION, ki);
+    }, t;
+}(), Ri = /** @class */ function() {
     function t(t, e, n, 
     /**
      * Asynchronous queue responsible for all of our internal processing. When
@@ -13103,7 +13110,7 @@ var Ei = /** @class */ function() {
      * an async I/O to complete).
      */
     r) {
-        this.platform = t, this.pT = e, this.credentials = n, this.Nr = r, this.clientId = Te.mi()
+        this.platform = t, this.RT = e, this.credentials = n, this.Nr = r, this.clientId = Te.mi()
         /**
      * Starts up the FirestoreClient, returning only whether or not enabling
      * persistence succeeded.
@@ -13143,7 +13150,7 @@ var Ei = /** @class */ function() {
     }
     return t.prototype.start = function(t, e) {
         var n = this;
-        this.vT();
+        this.AT();
         // We defer our initialization until we get the current user from
         // setChangeListener(). We block the async queue until we got the initial
         // user and the initialization is completed. This will prevent any scheduled
@@ -13160,7 +13167,7 @@ var Ei = /** @class */ function() {
         // need to await the completion of initializationDone because the result of
         // this method should not reflect any other kind of failure to start.
         return this.credentials.l((function(s) {
-            if (!o) return o = !0, ve("FirestoreClient", "Initializing. user=", s.uid), n.ST(t, e, s, i).then(r.resolve, r.reject);
+            if (!o) return o = !0, ve("FirestoreClient", "Initializing. user=", s.uid), n.PT(t, e, s, i).then(r.resolve, r.reject);
             n.Nr.qr((function() {
                 return n.Dc(s);
             }));
@@ -13172,7 +13179,7 @@ var Ei = /** @class */ function() {
     }, 
     /** Enables the network connection and requeues all pending operations. */ t.prototype.enableNetwork = function() {
         var t = this;
-        return this.vT(), this.Nr.enqueue((function() {
+        return this.AT(), this.Nr.enqueue((function() {
             return t.mc.enableNetwork();
         }));
     }, 
@@ -13196,30 +13203,21 @@ var Ei = /** @class */ function() {
      *     continue, i.e. that one of the persistence implementations actually
      *     succeeded.
      */
-    t.prototype.ST = function(t, n, r, i) {
+    t.prototype.PT = function(t, n, r, i) {
         return e.__awaiter(this, void 0, void 0, (function() {
             var o, s, u, a, h = this;
             return e.__generator(this, (function(c) {
                 switch (c.label) {
                   case 0:
-                    return c.trys.push([ 0, 3, , 4 ]), [ 4 /*yield*/ , this.platform.DT(this.pT) ];
+                    return c.trys.push([ 0, 3, , 4 ]), [ 4 /*yield*/ , this.platform.VT(this.RT) ];
 
                   case 1:
-                    return o = c.sent(), s = this.platform.yT(this.pT.cn), u = new Yn(this.Nr, o, this.credentials, s), 
-                    [ 4 /*yield*/ , t.initialize({
-                        Nr: this.Nr,
-                        pT: this.pT,
-                        platform: this.platform,
-                        bu: u,
-                        clientId: this.clientId,
-                        VT: r,
-                        Z_: 100,
-                        bT: n
-                    }) ];
+                    return o = c.sent(), s = this.platform.fT(this.RT.cn), u = new Yn(this.Nr, o, this.credentials, s), 
+                    [ 4 /*yield*/ , t.initialize(this.Nr, this.RT, this.platform, u, this.clientId, r, 100, n) ];
 
                   case 2:
                     return c.sent(), this.persistence = t.persistence, this.X_ = t.X_, this.Wu = t.Wu, 
-                    this.W_ = t.W_, this.mc = t.mc, this.mT = t.mT, this.CT = t.AT, 
+                    this.W_ = t.W_, this.mc = t.mc, this.TT = t.TT, this.gT = t.wT, 
                     // When a user calls clearPersistence() in one client, all other clients
                     // need to be terminated to allow the delete to succeed.
                     this.persistence.pf((function() {
@@ -13241,10 +13239,10 @@ var Ei = /** @class */ function() {
                     if (a = c.sent(), 
                     // Regardless of whether or not the retry succeeds, from an user
                     // perspective, offline persistence has failed.
-                    i.reject(a), !this.kT(a)) throw a;
+                    i.reject(a), !this.pT(a)) throw a;
                     return [ 2 /*return*/ , (console.warn("Error enabling offline persistence. Falling back to persistence disabled: " + a), 
-                    this.ST(new Di, {
-                        NT: !1
+                    this.PT(new xi, {
+                        IT: !1
                     }, r, i)) ];
 
                   case 4:
@@ -13257,7 +13255,7 @@ var Ei = /** @class */ function() {
      * Decides whether the provided error allows us to gracefully disable
      * persistence (as opposed to crashing the client).
      */
-    t.prototype.kT = function(t) {
+    t.prototype.pT = function(t) {
         return "FirebaseError" === t.name ? t.code === h.FAILED_PRECONDITION || t.code === h.UNIMPLEMENTED : !("undefined" != typeof DOMException && t instanceof DOMException) || 
         // When the browser is out of quota we could get either quota exceeded
         // or an aborted error depending on whether the error happened during
@@ -13271,7 +13269,7 @@ var Ei = /** @class */ function() {
      * Checks that the client has not been terminated. Ensures that other methods on
      * this class cannot be called after the client is terminated.
      */
-    t.prototype.vT = function() {
+    t.prototype.AT = function() {
         if (this.Nr.Hr) throw new c(h.FAILED_PRECONDITION, "The client has already been terminated.");
     }, t.prototype.Dc = function(t) {
         return this.Nr.no(), ve("FirestoreClient", "Credential Changed. Current user: " + t.uid), 
@@ -13279,7 +13277,7 @@ var Ei = /** @class */ function() {
     }, 
     /** Disables the network connection. Pending operations will not complete. */ t.prototype.disableNetwork = function() {
         var t = this;
-        return this.vT(), this.Nr.enqueue((function() {
+        return this.AT(), this.Nr.enqueue((function() {
             return t.mc.disableNetwork();
         }));
     }, t.prototype.terminate = function() {
@@ -13290,7 +13288,7 @@ var Ei = /** @class */ function() {
                     switch (t.label) {
                       case 0:
                         // PORTING NOTE: LocalStore does not need an explicit shutdown on web.
-                        return this.mT && this.mT.stop(), [ 4 /*yield*/ , this.W_.lc() ];
+                        return this.TT && this.TT.stop(), [ 4 /*yield*/ , this.W_.lc() ];
 
                       case 1:
                         return t.sent(), [ 4 /*yield*/ , this.X_.lc() ];
@@ -13317,37 +13315,37 @@ var Ei = /** @class */ function() {
      */
     t.prototype.waitForPendingWrites = function() {
         var t = this;
-        this.vT();
+        this.AT();
         var e = new Fe;
         return this.Nr.qr((function() {
             return t.mc.Pl(e);
         })), e.promise;
     }, t.prototype.listen = function(t, e, n) {
         var r = this;
-        this.vT();
+        this.AT();
         var i = new vr(t, e, n);
         return this.Nr.qr((function() {
-            return r.CT.listen(i);
+            return r.gT.listen(i);
         })), i;
     }, t.prototype.fc = function(t) {
         var e = this;
         // Checks for termination but does not raise error, allowing unlisten after
         // termination to be a no-op.
-                this.FT || this.Nr.qr((function() {
-            return e.CT.fc(t);
+                this.yT || this.Nr.qr((function() {
+            return e.gT.fc(t);
         }));
-    }, t.prototype.$T = function(t) {
+    }, t.prototype.bT = function(t) {
         var e = this;
-        return this.vT(), this.Nr.enqueue((function() {
+        return this.AT(), this.Nr.enqueue((function() {
             return e.Wu.Bh(t);
         })).then((function(t) {
             if (t instanceof vt) return t;
             if (t instanceof gt) return null;
             throw new c(h.UNAVAILABLE, "Failed to get document from cache. (However, this document may exist on the server. Run again without setting 'source' in the GetOptions to attempt to retrieve the document from the server.)");
         }));
-    }, t.prototype.MT = function(t) {
+    }, t.prototype.vT = function(t) {
         var n = this;
-        return this.vT(), this.Nr.enqueue((function() {
+        return this.AT(), this.Nr.enqueue((function() {
             return e.__awaiter(n, void 0, void 0, (function() {
                 var n, r, i;
                 return e.__generator(this, (function(e) {
@@ -13365,23 +13363,23 @@ var Ei = /** @class */ function() {
         }));
     }, t.prototype.write = function(t) {
         var e = this;
-        this.vT();
+        this.AT();
         var n = new Fe;
         return this.Nr.qr((function() {
             return e.mc.write(t, n);
         })), n.promise;
     }, t.prototype.cn = function() {
-        return this.pT.cn;
+        return this.RT.cn;
     }, t.prototype.Ol = function(t) {
         var e = this;
-        this.vT(), this.Nr.qr((function() {
-            return e.CT.Ol(t), Promise.resolve();
+        this.AT(), this.Nr.qr((function() {
+            return e.gT.Ol(t), Promise.resolve();
         }));
     }, t.prototype.xl = function(t) {
         // Checks for shutdown but does not raise error, allowing remove after
         // shutdown to be a no-op.
-        this.FT || this.CT.xl(t);
-    }, Object.defineProperty(t.prototype, "FT", {
+        this.yT || this.gT.xl(t);
+    }, Object.defineProperty(t.prototype, "yT", {
         get: function() {
             // Technically, the asyncQueue is still running, but only accepting operations
             // related to termination or supposed to be run after termination. It is effectively
@@ -13392,13 +13390,13 @@ var Ei = /** @class */ function() {
         configurable: !0
     }), t.prototype.transaction = function(t) {
         var e = this;
-        this.vT();
+        this.AT();
         var n = new Fe;
         return this.Nr.qr((function() {
             return e.mc.runTransaction(e.Nr, t, n), Promise.resolve();
         })), n.promise;
     }, t;
-}(), Ri = /** @class */ function() {
+}(), Li = /** @class */ function() {
     function t(t) {
         this.observer = t, 
         /**
@@ -13408,12 +13406,12 @@ var Ei = /** @class */ function() {
         this.muted = !1;
     }
     return t.prototype.next = function(t) {
-        this.LT(this.observer.next, t);
+        this.ST(this.observer.next, t);
     }, t.prototype.error = function(t) {
-        this.LT(this.observer.error, t);
-    }, t.prototype.OT = function() {
+        this.ST(this.observer.error, t);
+    }, t.prototype.DT = function() {
         this.muted = !0;
-    }, t.prototype.LT = function(t, e) {
+    }, t.prototype.ST = function(t, e) {
         var n = this;
         this.muted || setTimeout((function() {
             n.muted || t(e);
@@ -13457,7 +13455,7 @@ var Ei = /** @class */ function() {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function Vi(t) {
+function Ui(t) {
     /**
  * Returns true if obj is an object and contains at least one of the specified
  * methods.
@@ -13472,11 +13470,11 @@ function Vi(t) {
     }(t);
 }
 
-var Li = /** @class */ function() {
+var Vi = /** @class */ function() {
     function t(t, e, n, r) {
-        this.firestore = t, this.timestampsInSnapshots = e, this.xT = n, this.converter = r;
+        this.firestore = t, this.timestampsInSnapshots = e, this.CT = n, this.converter = r;
     }
-    return t.prototype.BT = function(t) {
+    return t.prototype.kT = function(t) {
         switch (M(t)) {
           case 0 /* NullValue */ :
             return null;
@@ -13488,10 +13486,10 @@ var Li = /** @class */ function() {
             return K(t.integerValue || t.doubleValue);
 
           case 3 /* TimestampValue */ :
-            return this.UT(t.timestampValue);
+            return this.NT(t.timestampValue);
 
           case 4 /* ServerTimestampValue */ :
-            return this.qT(t);
+            return this.FT(t);
 
           case 5 /* StringValue */ :
             return t.stringValue;
@@ -13500,58 +13498,58 @@ var Li = /** @class */ function() {
             return new wn(W(t.bytesValue));
 
           case 7 /* RefValue */ :
-            return this.QT(t.referenceValue);
+            return this.$T(t.referenceValue);
 
           case 8 /* GeoPointValue */ :
             return new xn(t.geoPointValue.latitude, t.geoPointValue.longitude);
 
           case 9 /* ArrayValue */ :
-            return this.WT(t.arrayValue);
+            return this.MT(t.arrayValue);
 
           case 10 /* ObjectValue */ :
-            return this.jT(t.mapValue);
+            return this.LT(t.mapValue);
 
           default:
             throw _e("Invalid value type: " + JSON.stringify(t));
         }
-    }, t.prototype.jT = function(t) {
+    }, t.prototype.LT = function(t) {
         var e = this, n = {};
         return k(t.fields || {}, (function(t, r) {
-            n[t] = e.BT(r);
+            n[t] = e.kT(r);
         })), n;
-    }, t.prototype.WT = function(t) {
+    }, t.prototype.MT = function(t) {
         var e = this;
         return (t.values || []).map((function(t) {
-            return e.BT(t);
+            return e.kT(t);
         }));
-    }, t.prototype.qT = function(t) {
-        switch (this.xT) {
+    }, t.prototype.FT = function(t) {
+        switch (this.CT) {
           case "previous":
             var e = function t(e) {
                 var n = e.mapValue.fields.__previous_value__;
                 return O(n) ? t(n) : n;
             }(t);
-            return null == e ? null : this.BT(e);
+            return null == e ? null : this.kT(e);
 
           case "estimate":
-            return this.UT(P(t));
+            return this.NT(P(t));
 
           default:
             return null;
         }
-    }, t.prototype.UT = function(t) {
+    }, t.prototype.NT = function(t) {
         var e = z(t), n = new m(e.seconds, e.nanos);
         return this.timestampsInSnapshots ? n : n.toDate();
-    }, t.prototype.QT = function(t) {
+    }, t.prototype.$T = function(t) {
         var e = w.G(t);
         be(le(e), "ReferenceValue is not valid " + t);
         var n = new Se(e.get(1), e.get(3)), r = new T(e.M(5));
-        return n.isEqual(this.firestore.KT) || 
+        return n.isEqual(this.firestore.OT) || 
         // TODO(b/64130202): Somehow support foreign references.
-        ge("Document " + r + " contains a document reference within a different database (" + n.projectId + "/" + n.database + ") which is not supported. It will be treated as a reference in the current database (" + this.firestore.KT.projectId + "/" + this.firestore.KT.database + ") instead."), 
-        new qi(r, this.firestore, this.converter);
+        ge("Document " + r + " contains a document reference within a different database (" + n.projectId + "/" + n.database + ") which is not supported. It will be treated as a reference in the current database (" + this.firestore.OT.projectId + "/" + this.firestore.OT.database + ") instead."), 
+        new Fi(r, this.firestore, this.converter);
     }, t;
-}(), Ui = We.Po, Oi = /** @class */ function() {
+}(), Oi = We.Po, Pi = /** @class */ function() {
     function t(t) {
         var e, n;
         if (void 0 === t.host) {
@@ -13567,7 +13565,7 @@ var Li = /** @class */ function() {
         !0 === t.timestampsInSnapshots ? ge("The setting 'timestampsInSnapshots: true' is no longer required and should be removed.") : !1 === t.timestampsInSnapshots && ge("Support for 'timestampsInSnapshots: false' will be removed soon. You must update your code to handle Timestamp objects."), 
         this.timestampsInSnapshots = null === (n = t.timestampsInSnapshots) || void 0 === n || n, 
         on("settings", "number", "cacheSizeBytes", t.cacheSizeBytes), void 0 === t.cacheSizeBytes) this.cacheSizeBytes = We.po; else {
-            if (t.cacheSizeBytes !== Ui && t.cacheSizeBytes < We.Vo) throw new c(h.INVALID_ARGUMENT, "cacheSizeBytes must be at least " + We.Vo);
+            if (t.cacheSizeBytes !== Oi && t.cacheSizeBytes < We.Vo) throw new c(h.INVALID_ARGUMENT, "cacheSizeBytes must be at least " + We.Vo);
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         on("settings", "boolean", "experimentalForceLongPolling", t.experimentalForceLongPolling), 
@@ -13576,16 +13574,16 @@ var Li = /** @class */ function() {
     return t.prototype.isEqual = function(t) {
         return this.host === t.host && this.ssl === t.ssl && this.timestampsInSnapshots === t.timestampsInSnapshots && this.credentials === t.credentials && this.cacheSizeBytes === t.cacheSizeBytes && this.forceLongPolling === t.forceLongPolling;
     }, t;
-}(), Pi = /** @class */ function() {
+}(), Ci = /** @class */ function() {
     // Note: We are using `MemoryComponentProvider` as a default
     // ComponentProvider to ensure backwards compatibility with the format
     // expected by the console build.
     function t(n, r, i) {
         var o = this;
-        if (void 0 === i && (i = new Di), this.GT = null, 
+        if (void 0 === i && (i = new xi), this.xT = null, 
         // Public for use in tests.
         // TODO(mikelehen): Use modularized initialization instead.
-        this.zT = new Ge, this.INTERNAL = {
+        this.BT = new Ge, this.INTERNAL = {
             delete: function() {
                 return e.__awaiter(o, void 0, void 0, (function() {
                     return e.__generator(this, (function(t) {
@@ -13593,7 +13591,7 @@ var Li = /** @class */ function() {
                           case 0:
                             // The client must be initalized to ensure that all subsequent API usage
                             // throws an exception.
-                            return this.HT(), [ 4 /*yield*/ , this.JT.terminate() ];
+                            return this.UT(), [ 4 /*yield*/ , this.qT.terminate() ];
 
                           case 1:
                             // The client must be initalized to ensure that all subsequent API usage
@@ -13607,63 +13605,63 @@ var Li = /** @class */ function() {
             // This is very likely a Firebase app object
             // TODO(b/34177605): Can we somehow use instanceof?
             var s = n;
-            this.GT = s, this.KT = t.YT(s), this.XT = s.name, this.ZT = new p(r);
+            this.xT = s, this.OT = t.QT(s), this.WT = s.name, this.jT = new p(r);
         } else {
             var u = n;
             if (!u.projectId) throw new c(h.INVALID_ARGUMENT, "Must provide projectId");
-            this.KT = new Se(u.projectId, u.database), 
+            this.OT = new Se(u.projectId, u.database), 
             // Use a default persistenceKey that lines up with FirebaseApp.
-            this.XT = "[DEFAULT]", this.ZT = new l;
+            this.WT = "[DEFAULT]", this.jT = new l;
         }
-        this.tm = i, this.em = new Oi({}), this.sm = this.nm(this.KT);
+        this.KT = i, this.GT = new Pi({}), this.zT = this.HT(this.OT);
     }
     return t.prototype.settings = function(t) {
         Ze("Firestore.settings", arguments, 1), en("Firestore.settings", "object", 1, t);
-        var e = new Oi(t);
-        if (this.JT && !this.em.isEqual(e)) throw new c(h.FAILED_PRECONDITION, "Firestore has already been started and its settings can no longer be changed. You can only call settings() before calling any other methods on a Firestore object.");
-        this.em = e, void 0 !== e.credentials && (this.ZT = function(t) {
+        var e = new Pi(t);
+        if (this.qT && !this.GT.isEqual(e)) throw new c(h.FAILED_PRECONDITION, "Firestore has already been started and its settings can no longer be changed. You can only call settings() before calling any other methods on a Firestore object.");
+        this.GT = e, void 0 !== e.credentials && (this.jT = function(t) {
             if (!t) return new l;
             switch (t.type) {
               case "gapi":
-                var e = t.im;
+                var e = t.JT;
                 // Make sure this really is a Gapi client.
                                 return be(!("object" != typeof e || null === e || !e.auth || !e.auth.getAuthHeaderValueForFirstParty), "unexpected gapi interface"), 
                 new y(e, t.V || "0");
 
               case "provider":
-                return t.im;
+                return t.JT;
 
               default:
                 throw new c(h.INVALID_ARGUMENT, "makeCredentialsProvider failed due to invalid credential type");
             }
         }(e.credentials));
     }, t.prototype.enableNetwork = function() {
-        return this.HT(), this.JT.enableNetwork();
+        return this.UT(), this.qT.enableNetwork();
     }, t.prototype.disableNetwork = function() {
-        return this.HT(), this.JT.disableNetwork();
+        return this.UT(), this.qT.disableNetwork();
     }, t.prototype.enablePersistence = function(t) {
         var e, n;
-        if (this.JT) throw new c(h.FAILED_PRECONDITION, "Firestore has already been started and persistence can no longer be enabled. You can only call enablePersistence() before calling any other methods on a Firestore object.");
+        if (this.qT) throw new c(h.FAILED_PRECONDITION, "Firestore has already been started and persistence can no longer be enabled. You can only call enablePersistence() before calling any other methods on a Firestore object.");
         var r = !1;
         return t && (void 0 !== t.experimentalTabSynchronization && ge("The 'experimentalTabSynchronization' setting will be removed. Use 'synchronizeTabs' instead."), 
         r = null !== (n = null !== (e = t.synchronizeTabs) && void 0 !== e ? e : t.experimentalTabSynchronization) && void 0 !== n && n), 
-        this.rm(this.tm, {
-            NT: !0,
-            cacheSizeBytes: this.em.cacheSizeBytes,
+        this.YT(this.KT, {
+            IT: !0,
+            cacheSizeBytes: this.GT.cacheSizeBytes,
             synchronizeTabs: r
         });
     }, t.prototype.clearPersistence = function() {
         return e.__awaiter(this, void 0, void 0, (function() {
             var t, n = this;
             return e.__generator(this, (function(r) {
-                if (void 0 !== this.JT && !this.JT.FT) throw new c(h.FAILED_PRECONDITION, "Persistence cannot be cleared after this Firestore instance is initialized.");
-                return t = new Fe, [ 2 /*return*/ , (this.zT.Jr((function() {
+                if (void 0 !== this.qT && !this.qT.yT) throw new c(h.FAILED_PRECONDITION, "Persistence cannot be cleared after this Firestore instance is initialized.");
+                return t = new Fe, [ 2 /*return*/ , (this.BT.Jr((function() {
                     return e.__awaiter(n, void 0, void 0, (function() {
                         var n, r;
                         return e.__generator(this, (function(e) {
                             switch (e.label) {
                               case 0:
-                                return e.trys.push([ 0, 2, , 3 ]), n = this.om(), [ 4 /*yield*/ , this.tm.clearPersistence(n) ];
+                                return e.trys.push([ 0, 2, , 3 ]), n = this.XT(), [ 4 /*yield*/ , this.KT.clearPersistence(n) ];
 
                               case 1:
                                 return e.sent(), t.resolve(), [ 3 /*break*/ , 3 ];
@@ -13681,23 +13679,23 @@ var Li = /** @class */ function() {
         }));
     }, t.prototype.terminate = function() {
         return this.app._removeServiceInstance("firestore"), this.INTERNAL.delete();
-    }, Object.defineProperty(t.prototype, "hm", {
+    }, Object.defineProperty(t.prototype, "ZT", {
         get: function() {
-            return this.HT(), this.JT.FT;
+            return this.UT(), this.qT.yT;
         },
         enumerable: !0,
         configurable: !0
     }), t.prototype.waitForPendingWrites = function() {
-        return this.HT(), this.JT.waitForPendingWrites();
+        return this.UT(), this.qT.waitForPendingWrites();
     }, t.prototype.onSnapshotsInSync = function(t) {
-        if (this.HT(), Vi(t)) return this.am(t);
+        if (this.UT(), Ui(t)) return this.tm(t);
         en("Firestore.onSnapshotsInSync", "function", 1, t);
         var e = {
             next: t
         };
-        return this.am(e);
-    }, t.prototype.am = function(t) {
-        var e = this, n = new Ri({
+        return this.tm(e);
+    }, t.prototype.tm = function(t) {
+        var e = this, n = new Li({
             next: function() {
                 t.next && t.next();
             },
@@ -13705,34 +13703,34 @@ var Li = /** @class */ function() {
                 throw _e("Uncaught Error in onSnapshotsInSync");
             }
         });
-        return this.JT.Ol(n), function() {
-            n.OT(), e.JT.xl(n);
+        return this.qT.Ol(n), function() {
+            n.DT(), e.qT.xl(n);
         };
-    }, t.prototype.HT = function() {
-        return this.JT || 
+    }, t.prototype.UT = function() {
+        return this.qT || 
         // Kick off starting the client but don't actually wait for it.
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.rm(new Di, {
-            NT: !1
-        }), this.JT;
-    }, t.prototype.om = function() {
-        return new Ae(this.KT, this.XT, this.em.host, this.em.ssl, this.em.forceLongPolling);
-    }, t.prototype.rm = function(t, e) {
-        var n = this.om();
-        return this.JT = new xi(pe.Lt(), n, this.ZT, this.zT), this.JT.start(t, e);
-    }, t.prototype.nm = function(t) {
+        this.YT(new xi, {
+            IT: !1
+        }), this.qT;
+    }, t.prototype.XT = function() {
+        return new Ae(this.OT, this.WT, this.GT.host, this.GT.ssl, this.GT.forceLongPolling);
+    }, t.prototype.YT = function(t, e) {
+        var n = this.XT();
+        return this.qT = new Ri(pe.Lt(), n, this.jT, this.BT), this.qT.start(t, e);
+    }, t.prototype.HT = function(t) {
         var e = new fe(t, {
             dn: pe.Lt().dn
         });
         return new Cn(e, (function(e) {
-            if (e instanceof qi) {
-                var n = t, r = e.firestore.KT;
+            if (e instanceof Fi) {
+                var n = t, r = e.firestore.OT;
                 if (!r.isEqual(n)) throw new c(h.INVALID_ARGUMENT, "Document reference is for database " + r.projectId + "/" + r.database + " but should be for database " + n.projectId + "/" + n.database);
-                return new Pn(t, e.um);
+                return new Pn(t, e.em);
             }
             return e;
         }));
-    }, t.YT = function(t) {
+    }, t.QT = function(t) {
         if (e = t.options, "projectId", !Object.prototype.hasOwnProperty.call(e, "projectId")) throw new c(h.INVALID_ARGUMENT, '"projectId" not provided in firebase.initializeApp.');
         var e, n = t.options.projectId;
         // Export the classes with a private constructor (it will fail if invoked
@@ -13743,29 +13741,29 @@ var Li = /** @class */ function() {
         return new Se(n);
     }, Object.defineProperty(t.prototype, "app", {
         get: function() {
-            if (!this.GT) throw new c(h.FAILED_PRECONDITION, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
-            return this.GT;
+            if (!this.xT) throw new c(h.FAILED_PRECONDITION, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+            return this.xT;
         },
         enumerable: !0,
         configurable: !0
     }), t.prototype.collection = function(t) {
         return Ze("Firestore.collection", arguments, 1), en("Firestore.collection", "non-empty string", 1, t), 
-        this.HT(), new Ki(w.G(t), this);
+        this.UT(), new Wi(w.G(t), this);
     }, t.prototype.doc = function(t) {
         return Ze("Firestore.doc", arguments, 1), en("Firestore.doc", "non-empty string", 1, t), 
-        this.HT(), qi.cm(w.G(t), this);
+        this.UT(), Fi.sm(w.G(t), this);
     }, t.prototype.collectionGroup = function(t) {
         if (Ze("Firestore.collectionGroup", arguments, 1), en("Firestore.collectionGroup", "non-empty string", 1, t), 
         t.indexOf("/") >= 0) throw new c(h.INVALID_ARGUMENT, "Invalid collection ID '" + t + "' passed to function Firestore.collectionGroup(). Collection IDs must not contain '/'.");
-        return this.HT(), new Bi(new bt(w.H, t), this);
+        return this.UT(), new zi(new bt(w.H, t), this);
     }, t.prototype.runTransaction = function(t) {
         var e = this;
         return Ze("Firestore.runTransaction", arguments, 1), en("Firestore.runTransaction", "function", 1, t), 
-        this.HT().transaction((function(n) {
-            return t(new Ci(e, n));
+        this.UT().transaction((function(n) {
+            return t(new Mi(e, n));
         }));
     }, t.prototype.batch = function() {
-        return this.HT(), new Mi(this);
+        return this.UT(), new qi(this);
     }, Object.defineProperty(t, "logLevel", {
         get: function() {
             switch (ye()) {
@@ -13803,92 +13801,92 @@ var Li = /** @class */ function() {
     }, 
     // Note: this is not a property because the minifier can't work correctly with
     // the way TypeScript compiler outputs properties.
-    t.prototype._m = function() {
-        return this.em.timestampsInSnapshots;
+    t.prototype.nm = function() {
+        return this.GT.timestampsInSnapshots;
     }, t;
-}(), Ci = /** @class */ function() {
+}(), Mi = /** @class */ function() {
     function t(t, e) {
-        this.lm = t, this.dm = e;
+        this.im = t, this.rm = e;
     }
     return t.prototype.get = function(t) {
         var e = this;
         Ze("Transaction.get", arguments, 1);
-        var n = Ji("Transaction.get", t, this.lm);
-        return this.dm.pu([ n.um ]).then((function(t) {
+        var n = Hi("Transaction.get", t, this.im);
+        return this.rm.pu([ n.em ]).then((function(t) {
             if (!t || 1 !== t.length) return _e("Mismatch in docs returned from document lookup.");
             var r = t[0];
-            if (r instanceof gt) return new ji(e.lm, n.um, null, 
+            if (r instanceof gt) return new Gi(e.im, n.em, null, 
             /* fromCache= */ !1, 
-            /* hasPendingWrites= */ !1, n.fm);
-            if (r instanceof vt) return new ji(e.lm, n.um, r, 
+            /* hasPendingWrites= */ !1, n.om);
+            if (r instanceof vt) return new Gi(e.im, n.em, r, 
             /* fromCache= */ !1, 
-            /* hasPendingWrites= */ !1, n.fm);
+            /* hasPendingWrites= */ !1, n.om);
             throw _e("BatchGetDocumentsRequest returned unexpected document type: " + r.constructor.name);
         }));
     }, t.prototype.set = function(t, e, n) {
         tn("Transaction.set", arguments, 2, 3);
-        var r = Ji("Transaction.set", t, this.lm);
-        n = Wi("Transaction.set", n);
-        var i = Xi(r.fm, e, "Transaction.set"), o = i[0], s = i[1], u = n.merge || n.mergeFields ? this.lm.sm.pa(s, o, n.mergeFields) : this.lm.sm.Va(s, o);
-        return this.dm.set(r.um, u), this;
+        var r = Hi("Transaction.set", t, this.im);
+        n = Yi("Transaction.set", n);
+        var i = Zi(r.om, e, "Transaction.set"), o = i[0], s = i[1], u = n.merge || n.mergeFields ? this.im.zT.pa(s, o, n.mergeFields) : this.im.zT.Va(s, o);
+        return this.rm.set(r.em, u), this;
     }, t.prototype.update = function(t, e, n) {
         for (var r, i, o = [], s = 3; s < arguments.length; s++) o[s - 3] = arguments[s];
         return "string" == typeof e || e instanceof bn ? ($e("Transaction.update", arguments, 3), 
-        r = Ji("Transaction.update", t, this.lm), i = this.lm.sm.Sa("Transaction.update", e, n, o)) : (Ze("Transaction.update", arguments, 2), 
-        r = Ji("Transaction.update", t, this.lm), i = this.lm.sm.ya("Transaction.update", e)), 
-        this.dm.update(r.um, i), this;
+        r = Hi("Transaction.update", t, this.im), i = this.im.zT.Sa("Transaction.update", e, n, o)) : (Ze("Transaction.update", arguments, 2), 
+        r = Hi("Transaction.update", t, this.im), i = this.im.zT.ya("Transaction.update", e)), 
+        this.rm.update(r.em, i), this;
     }, t.prototype.delete = function(t) {
         Ze("Transaction.delete", arguments, 1);
-        var e = Ji("Transaction.delete", t, this.lm);
-        return this.dm.delete(e.um), this;
+        var e = Hi("Transaction.delete", t, this.im);
+        return this.rm.delete(e.em), this;
     }, t;
-}(), Mi = /** @class */ function() {
+}(), qi = /** @class */ function() {
     function t(t) {
-        this.lm = t, this.Tm = [], this.mm = !1;
+        this.im = t, this.hm = [], this.am = !1;
     }
     return t.prototype.set = function(t, e, n) {
-        tn("WriteBatch.set", arguments, 2, 3), this.Em();
-        var r = Ji("WriteBatch.set", t, this.lm);
-        n = Wi("WriteBatch.set", n);
-        var i = Xi(r.fm, e, "WriteBatch.set"), o = i[0], s = i[1], u = n.merge || n.mergeFields ? this.lm.sm.pa(s, o, n.mergeFields) : this.lm.sm.Va(s, o);
-        return this.Tm = this.Tm.concat(u.da(r.um, ut.NONE)), this;
+        tn("WriteBatch.set", arguments, 2, 3), this.um();
+        var r = Hi("WriteBatch.set", t, this.im);
+        n = Yi("WriteBatch.set", n);
+        var i = Zi(r.om, e, "WriteBatch.set"), o = i[0], s = i[1], u = n.merge || n.mergeFields ? this.im.zT.pa(s, o, n.mergeFields) : this.im.zT.Va(s, o);
+        return this.hm = this.hm.concat(u.da(r.em, ut.NONE)), this;
     }, t.prototype.update = function(t, e, n) {
         for (var r, i, o = [], s = 3; s < arguments.length; s++) o[s - 3] = arguments[s];
-        return this.Em(), "string" == typeof e || e instanceof bn ? ($e("WriteBatch.update", arguments, 3), 
-        r = Ji("WriteBatch.update", t, this.lm), i = this.lm.sm.Sa("WriteBatch.update", e, n, o)) : (Ze("WriteBatch.update", arguments, 2), 
-        r = Ji("WriteBatch.update", t, this.lm), i = this.lm.sm.ya("WriteBatch.update", e)), 
-        this.Tm = this.Tm.concat(i.da(r.um, ut.exists(!0))), this;
+        return this.um(), "string" == typeof e || e instanceof bn ? ($e("WriteBatch.update", arguments, 3), 
+        r = Hi("WriteBatch.update", t, this.im), i = this.im.zT.Sa("WriteBatch.update", e, n, o)) : (Ze("WriteBatch.update", arguments, 2), 
+        r = Hi("WriteBatch.update", t, this.im), i = this.im.zT.ya("WriteBatch.update", e)), 
+        this.hm = this.hm.concat(i.da(r.em, ut.exists(!0))), this;
     }, t.prototype.delete = function(t) {
-        Ze("WriteBatch.delete", arguments, 1), this.Em();
-        var e = Ji("WriteBatch.delete", t, this.lm);
-        return this.Tm = this.Tm.concat(new lt(e.um, ut.NONE)), this;
+        Ze("WriteBatch.delete", arguments, 1), this.um();
+        var e = Hi("WriteBatch.delete", t, this.im);
+        return this.hm = this.hm.concat(new lt(e.em, ut.NONE)), this;
     }, t.prototype.commit = function() {
-        return this.Em(), this.mm = !0, this.Tm.length > 0 ? this.lm.HT().write(this.Tm) : Promise.resolve();
-    }, t.prototype.Em = function() {
-        if (this.mm) throw new c(h.FAILED_PRECONDITION, "A write batch can no longer be used after commit() has been called.");
+        return this.um(), this.am = !0, this.hm.length > 0 ? this.im.UT().write(this.hm) : Promise.resolve();
+    }, t.prototype.um = function() {
+        if (this.am) throw new c(h.FAILED_PRECONDITION, "A write batch can no longer be used after commit() has been called.");
     }, t;
-}(), qi = /** @class */ function() {
+}(), Fi = /** @class */ function() {
     function t(t, e, n) {
-        this.um = t, this.firestore = e, this.fm = n, this.JT = this.firestore.HT();
+        this.em = t, this.firestore = e, this.om = n, this.qT = this.firestore.UT();
     }
-    return t.cm = function(e, n, r) {
+    return t.sm = function(e, n, r) {
         if (e.length % 2 != 0) throw new c(h.INVALID_ARGUMENT, "Invalid document reference. Document references must have an even number of segments, but " + e.K() + " has " + e.length);
         return new t(new T(e), n, r);
     }, Object.defineProperty(t.prototype, "id", {
         get: function() {
-            return this.um.path.B();
+            return this.em.path.B();
         },
         enumerable: !0,
         configurable: !0
     }), Object.defineProperty(t.prototype, "parent", {
         get: function() {
-            return new Ki(this.um.path.L(), this.firestore, this.fm);
+            return new Wi(this.em.path.L(), this.firestore, this.om);
         },
         enumerable: !0,
         configurable: !0
     }), Object.defineProperty(t.prototype, "path", {
         get: function() {
-            return this.um.path.K();
+            return this.em.path.K();
         },
         enumerable: !0,
         configurable: !0
@@ -13896,68 +13894,68 @@ var Li = /** @class */ function() {
         if (Ze("DocumentReference.collection", arguments, 1), en("DocumentReference.collection", "non-empty string", 1, t), 
         !t) throw new c(h.INVALID_ARGUMENT, "Must provide a non-empty collection name to collection()");
         var e = w.G(t);
-        return new Ki(this.um.path.child(e), this.firestore);
+        return new Wi(this.em.path.child(e), this.firestore);
     }, t.prototype.isEqual = function(e) {
         if (!(e instanceof t)) throw ln("isEqual", "DocumentReference", 1, e);
-        return this.firestore === e.firestore && this.um.isEqual(e.um) && this.fm === e.fm;
+        return this.firestore === e.firestore && this.em.isEqual(e.em) && this.om === e.om;
     }, t.prototype.set = function(t, e) {
-        tn("DocumentReference.set", arguments, 1, 2), e = Wi("DocumentReference.set", e);
-        var n = Xi(this.fm, t, "DocumentReference.set"), r = n[0], i = n[1], o = e.merge || e.mergeFields ? this.firestore.sm.pa(i, r, e.mergeFields) : this.firestore.sm.Va(i, r);
-        return this.JT.write(o.da(this.um, ut.NONE));
+        tn("DocumentReference.set", arguments, 1, 2), e = Yi("DocumentReference.set", e);
+        var n = Zi(this.om, t, "DocumentReference.set"), r = n[0], i = n[1], o = e.merge || e.mergeFields ? this.firestore.zT.pa(i, r, e.mergeFields) : this.firestore.zT.Va(i, r);
+        return this.qT.write(o.da(this.em, ut.NONE));
     }, t.prototype.update = function(t, e) {
         for (var n, r = [], i = 2; i < arguments.length; i++) r[i - 2] = arguments[i];
         return "string" == typeof t || t instanceof bn ? ($e("DocumentReference.update", arguments, 2), 
-        n = this.firestore.sm.Sa("DocumentReference.update", t, e, r)) : (Ze("DocumentReference.update", arguments, 1), 
-        n = this.firestore.sm.ya("DocumentReference.update", t)), this.JT.write(n.da(this.um, ut.exists(!0)));
+        n = this.firestore.zT.Sa("DocumentReference.update", t, e, r)) : (Ze("DocumentReference.update", arguments, 1), 
+        n = this.firestore.zT.ya("DocumentReference.update", t)), this.qT.write(n.da(this.em, ut.exists(!0)));
     }, t.prototype.delete = function() {
-        return Ze("DocumentReference.delete", arguments, 0), this.JT.write([ new lt(this.um, ut.NONE) ]);
+        return Ze("DocumentReference.delete", arguments, 0), this.qT.write([ new lt(this.em, ut.NONE) ]);
     }, t.prototype.onSnapshot = function() {
         for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
         tn("DocumentReference.onSnapshot", arguments, 1, 4);
         var n, r = {
             includeMetadataChanges: !1
         }, i = 0;
-        "object" != typeof t[i] || Vi(t[i]) || (fn("DocumentReference.onSnapshot", r = t[i], [ "includeMetadataChanges" ]), 
+        "object" != typeof t[i] || Ui(t[i]) || (fn("DocumentReference.onSnapshot", r = t[i], [ "includeMetadataChanges" ]), 
         on("DocumentReference.onSnapshot", "boolean", "includeMetadataChanges", r.includeMetadataChanges), 
         i++);
         var o = {
             includeMetadataChanges: r.includeMetadataChanges
         };
-        return Vi(t[i]) ? n = t[i] : (en("DocumentReference.onSnapshot", "function", i, t[i]), 
+        return Ui(t[i]) ? n = t[i] : (en("DocumentReference.onSnapshot", "function", i, t[i]), 
         nn("DocumentReference.onSnapshot", "function", i + 1, t[i + 1]), nn("DocumentReference.onSnapshot", "function", i + 2, t[i + 2]), 
         n = {
             next: t[i],
             error: t[i + 1],
             complete: t[i + 2]
-        }), this.wm(o, n);
-    }, t.prototype.wm = function(t, e) {
+        }), this.cm(o, n);
+    }, t.prototype.cm = function(t, e) {
         var n = this, r = function(t) {
             console.error("Uncaught Error in onSnapshot:", t);
         };
         e.error && (r = e.error.bind(e));
-        var i = new Ri({
+        var i = new Li({
             next: function(t) {
                 if (e.next) {
-                    var r = t.docs.get(n.um);
-                    e.next(new ji(n.firestore, n.um, r, t.fromCache, t.hasPendingWrites, n.fm));
+                    var r = t.docs.get(n.em);
+                    e.next(new Gi(n.firestore, n.em, r, t.fromCache, t.hasPendingWrites, n.om));
                 }
             },
             error: r
-        }), o = this.JT.listen(bt.ve(this.um.path), i, t);
+        }), o = this.qT.listen(bt.ve(this.em.path), i, t);
         return function() {
-            i.OT(), n.JT.fc(o);
+            i.DT(), n.qT.fc(o);
         };
     }, t.prototype.get = function(t) {
         var e = this;
-        return tn("DocumentReference.get", arguments, 0, 1), Qi("DocumentReference.get", t), 
+        return tn("DocumentReference.get", arguments, 0, 1), Xi("DocumentReference.get", t), 
         new Promise((function(n, r) {
-            t && "cache" === t.source ? e.firestore.HT().$T(e.um).then((function(t) {
-                n(new ji(e.firestore, e.um, t, 
-                /*fromCache=*/ !0, t instanceof vt && t.te, e.fm));
-            }), r) : e.Im(n, r, t);
+            t && "cache" === t.source ? e.firestore.UT().bT(e.em).then((function(t) {
+                n(new Gi(e.firestore, e.em, t, 
+                /*fromCache=*/ !0, t instanceof vt && t.te, e.om));
+            }), r) : e._m(n, r, t);
         }));
-    }, t.prototype.Im = function(t, e, n) {
-        var r = this.wm({
+    }, t.prototype._m = function(t, e, n) {
+        var r = this.cm({
             includeMetadataChanges: !0,
             Kl: !0
         }, {
@@ -13977,75 +13975,75 @@ var Li = /** @class */ function() {
             error: e
         });
     }, t.prototype.withConverter = function(e) {
-        return new t(this.um, this.firestore, e);
+        return new t(this.em, this.firestore, e);
     }, t;
-}(), Fi = /** @class */ function() {
+}(), ji = /** @class */ function() {
     function t(t, e) {
         this.hasPendingWrites = t, this.fromCache = e;
     }
     return t.prototype.isEqual = function(t) {
         return this.hasPendingWrites === t.hasPendingWrites && this.fromCache === t.fromCache;
     }, t;
-}(), ji = /** @class */ function() {
+}(), Gi = /** @class */ function() {
     function t(t, e, n, r, i, o) {
-        this.lm = t, this.um = e, this.Rm = n, this.Am = r, this.Pm = i, this.fm = o;
+        this.im = t, this.em = e, this.lm = n, this.dm = r, this.fm = i, this.om = o;
     }
     return t.prototype.data = function(t) {
-        if (tn("DocumentSnapshot.data", arguments, 0, 1), t = Yi("DocumentSnapshot.data", t), 
-        this.Rm) {
+        if (tn("DocumentSnapshot.data", arguments, 0, 1), t = Qi("DocumentSnapshot.data", t), 
+        this.lm) {
             // We only want to use the converter and create a new DocumentSnapshot
             // if a converter has been provided.
-            if (this.fm) {
-                var e = new Gi(this.lm, this.um, this.Rm, this.Am, this.Pm);
-                return this.fm.fromFirestore(e, t);
+            if (this.om) {
+                var e = new Bi(this.im, this.em, this.lm, this.dm, this.fm);
+                return this.om.fromFirestore(e, t);
             }
-            return new Li(this.lm, this.lm._m(), t.serverTimestamps, 
-            /* converter= */ void 0).BT(this.Rm.Ie());
+            return new Vi(this.im, this.im.nm(), t.serverTimestamps, 
+            /* converter= */ void 0).kT(this.lm.Ie());
         }
     }, t.prototype.get = function(t, e) {
-        if (tn("DocumentSnapshot.get", arguments, 1, 2), e = Yi("DocumentSnapshot.get", e), 
-        this.Rm) {
-            var n = this.Rm.data().field(Fn("DocumentSnapshot.get", t));
-            if (null !== n) return new Li(this.lm, this.lm._m(), e.serverTimestamps, this.fm).BT(n);
+        if (tn("DocumentSnapshot.get", arguments, 1, 2), e = Qi("DocumentSnapshot.get", e), 
+        this.lm) {
+            var n = this.lm.data().field(Fn("DocumentSnapshot.get", t));
+            if (null !== n) return new Vi(this.im, this.im.nm(), e.serverTimestamps, this.om).kT(n);
         }
     }, Object.defineProperty(t.prototype, "id", {
         get: function() {
-            return this.um.path.B();
+            return this.em.path.B();
         },
         enumerable: !0,
         configurable: !0
     }), Object.defineProperty(t.prototype, "ref", {
         get: function() {
-            return new qi(this.um, this.lm, this.fm);
+            return new Fi(this.em, this.im, this.om);
         },
         enumerable: !0,
         configurable: !0
     }), Object.defineProperty(t.prototype, "exists", {
         get: function() {
-            return null !== this.Rm;
+            return null !== this.lm;
         },
         enumerable: !0,
         configurable: !0
     }), Object.defineProperty(t.prototype, "metadata", {
         get: function() {
-            return new Fi(this.Pm, this.Am);
+            return new ji(this.fm, this.dm);
         },
         enumerable: !0,
         configurable: !0
     }), t.prototype.isEqual = function(e) {
         if (!(e instanceof t)) throw ln("isEqual", "DocumentSnapshot", 1, e);
-        return this.lm === e.lm && this.Am === e.Am && this.um.isEqual(e.um) && (null === this.Rm ? null === e.Rm : this.Rm.isEqual(e.Rm)) && this.fm === e.fm;
+        return this.im === e.im && this.dm === e.dm && this.em.isEqual(e.em) && (null === this.lm ? null === e.lm : this.lm.isEqual(e.lm)) && this.om === e.om;
     }, t;
-}(), Gi = /** @class */ function(t) {
+}(), Bi = /** @class */ function(t) {
     function n() {
         return null !== t && t.apply(this, arguments) || this;
     }
     return e.__extends(n, t), n.prototype.data = function(e) {
         return t.prototype.data.call(this, e);
     }, n;
-}(ji), Bi = /** @class */ function() {
+}(Gi), zi = /** @class */ function() {
     function t(t, e, n) {
-        this.Vm = t, this.firestore = e, this.fm = n;
+        this.Tm = t, this.firestore = e, this.om = n;
     }
     return t.prototype.where = function(e, n, r) {
         var i;
@@ -14058,22 +14056,22 @@ var Li = /** @class */ function() {
         if (o.Y()) {
             if (s === Tt.ARRAY_CONTAINS || s === Tt.ARRAY_CONTAINS_ANY) throw new c(h.INVALID_ARGUMENT, "Invalid Query. You can't perform '" + s.toString() + "' queries on FieldPath.documentId().");
             if (s === Tt.IN) {
-                this.gm(r, s);
+                this.mm(r, s);
                 for (var u = [], a = 0, f = r; a < f.length; a++) {
                     var l = f[a];
-                    u.push(this.pm(l));
+                    u.push(this.wm(l));
                 }
                 i = {
                     arrayValue: {
                         values: u
                     }
                 };
-            } else i = this.pm(r);
-        } else s !== Tt.IN && s !== Tt.ARRAY_CONTAINS_ANY || this.gm(r, s), i = this.firestore.sm.Da("Query.where", r, 
+            } else i = this.wm(r);
+        } else s !== Tt.IN && s !== Tt.ARRAY_CONTAINS_ANY || this.mm(r, s), i = this.firestore.zT.Da("Query.where", r, 
         // We only allow nested arrays for IN queries.
         /** allowArrays = */ s === Tt.IN);
-        var p = It.create(o, s, i);
-        return this.ym(p), new t(this.Vm.Ce(p), this.firestore, this.fm);
+        var p = Et.create(o, s, i);
+        return this.Em(p), new t(this.Tm.Ce(p), this.firestore, this.om);
     }, t.prototype.orderBy = function(e, n) {
         var r;
         if (tn("Query.orderBy", arguments, 1, 2), nn("Query.orderBy", "non-empty string", 2, n), 
@@ -14081,55 +14079,55 @@ var Li = /** @class */ function() {
             if ("desc" !== n) throw new c(h.INVALID_ARGUMENT, "Function Query.orderBy() has unknown direction '" + n + "', expected 'asc' or 'desc'.");
             r = kt.DESCENDING;
         }
-        if (null !== this.Vm.startAt) throw new c(h.INVALID_ARGUMENT, "Invalid query. You must not call Query.startAt() or Query.startAfter() before calling Query.orderBy().");
-        if (null !== this.Vm.endAt) throw new c(h.INVALID_ARGUMENT, "Invalid query. You must not call Query.endAt() or Query.endBefore() before calling Query.orderBy().");
-        var i = Fn("Query.orderBy", e), o = new Lt(i, r);
-        return this.bm(o), new t(this.Vm.ke(o), this.firestore, this.fm);
+        if (null !== this.Tm.startAt) throw new c(h.INVALID_ARGUMENT, "Invalid query. You must not call Query.startAt() or Query.startAfter() before calling Query.orderBy().");
+        if (null !== this.Tm.endAt) throw new c(h.INVALID_ARGUMENT, "Invalid query. You must not call Query.endAt() or Query.endBefore() before calling Query.orderBy().");
+        var i = Fn("Query.orderBy", e), o = new Ut(i, r);
+        return this.Im(o), new t(this.Tm.ke(o), this.firestore, this.om);
     }, t.prototype.limit = function(e) {
         return Ze("Query.limit", arguments, 1), en("Query.limit", "number", 1, e), pn("Query.limit", 1, e), 
-        new t(this.Vm.Ne(e), this.firestore, this.fm);
+        new t(this.Tm.Ne(e), this.firestore, this.om);
     }, t.prototype.limitToLast = function(e) {
         return Ze("Query.limitToLast", arguments, 1), en("Query.limitToLast", "number", 1, e), 
-        pn("Query.limitToLast", 1, e), new t(this.Vm.Fe(e), this.firestore, this.fm);
+        pn("Query.limitToLast", 1, e), new t(this.Tm.Fe(e), this.firestore, this.om);
     }, t.prototype.startAt = function(e) {
         for (var n = [], r = 1; r < arguments.length; r++) n[r - 1] = arguments[r];
         $e("Query.startAt", arguments, 1);
-        var i = this.vm("Query.startAt", e, n, 
+        var i = this.Rm("Query.startAt", e, n, 
         /*before=*/ !0);
-        return new t(this.Vm.$e(i), this.firestore, this.fm);
+        return new t(this.Tm.$e(i), this.firestore, this.om);
     }, t.prototype.startAfter = function(e) {
         for (var n = [], r = 1; r < arguments.length; r++) n[r - 1] = arguments[r];
         $e("Query.startAfter", arguments, 1);
-        var i = this.vm("Query.startAfter", e, n, 
+        var i = this.Rm("Query.startAfter", e, n, 
         /*before=*/ !1);
-        return new t(this.Vm.$e(i), this.firestore, this.fm);
+        return new t(this.Tm.$e(i), this.firestore, this.om);
     }, t.prototype.endBefore = function(e) {
         for (var n = [], r = 1; r < arguments.length; r++) n[r - 1] = arguments[r];
         $e("Query.endBefore", arguments, 1);
-        var i = this.vm("Query.endBefore", e, n, 
+        var i = this.Rm("Query.endBefore", e, n, 
         /*before=*/ !0);
-        return new t(this.Vm.Me(i), this.firestore, this.fm);
+        return new t(this.Tm.Me(i), this.firestore, this.om);
     }, t.prototype.endAt = function(e) {
         for (var n = [], r = 1; r < arguments.length; r++) n[r - 1] = arguments[r];
         $e("Query.endAt", arguments, 1);
-        var i = this.vm("Query.endAt", e, n, 
+        var i = this.Rm("Query.endAt", e, n, 
         /*before=*/ !1);
-        return new t(this.Vm.Me(i), this.firestore, this.fm);
+        return new t(this.Tm.Me(i), this.firestore, this.om);
     }, t.prototype.isEqual = function(e) {
         if (!(e instanceof t)) throw ln("isEqual", "Query", 1, e);
-        return this.firestore === e.firestore && this.Vm.isEqual(e.Vm);
+        return this.firestore === e.firestore && this.Tm.isEqual(e.Tm);
     }, t.prototype.withConverter = function(e) {
-        return new t(this.Vm, this.firestore, e);
+        return new t(this.Tm, this.firestore, e);
     }, 
-    /** Helper function to create a bound from a document or fields */ t.prototype.vm = function(t, e, n, r) {
-        if (cn(t, 1, e), e instanceof ji) {
+    /** Helper function to create a bound from a document or fields */ t.prototype.Rm = function(t, e, n, r) {
+        if (cn(t, 1, e), e instanceof Gi) {
             if (n.length > 0) throw new c(h.INVALID_ARGUMENT, "Too many arguments provided to " + t + "().");
             var i = e;
             if (!i.exists) throw new c(h.NOT_FOUND, "Can't use a DocumentSnapshot that doesn't exist for " + t + "().");
-            return this.Sm(i.Rm, r);
+            return this.Am(i.lm, r);
         }
         var o = [ e ].concat(n);
-        return this.Dm(t, o, r);
+        return this.Pm(t, o, r);
     }, 
     /**
      * Create a Bound from a query and a document.
@@ -14142,7 +14140,7 @@ var Li = /** @class */ function() {
      * of the query or if any of the fields in the order by are an uncommitted
      * server timestamp.
      */
-    t.prototype.Sm = function(t, e) {
+    t.prototype.Am = function(t, e) {
         // 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
@@ -14150,9 +14148,9 @@ var Li = /** @class */ function() {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-        for (var n = [], r = 0, i = this.Vm.orderBy; r < i.length; r++) {
+        for (var n = [], r = 0, i = this.Tm.orderBy; r < i.length; r++) {
             var o = i[r];
-            if (o.field.Y()) n.push(Y(this.firestore.KT, t.key)); else {
+            if (o.field.Y()) n.push(Y(this.firestore.OT, t.key)); else {
                 var s = t.field(o.field);
                 if (O(s)) throw new c(h.INVALID_ARGUMENT, 'Invalid query. You are trying to start or end a query using a document for which the field "' + o.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
                 if (null === s) {
@@ -14162,67 +14160,67 @@ var Li = /** @class */ function() {
                 n.push(s);
             }
         }
-        return new Vt(n, e);
+        return new Lt(n, e);
     }, 
     /**
      * Converts a list of field values to a Bound for the given query.
      */
-    t.prototype.Dm = function(t, e, n) {
+    t.prototype.Pm = function(t, e, n) {
         // Use explicit order by's because it has to match the query the user made
-        var r = this.Vm.Ve;
+        var r = this.Tm.Ve;
         if (e.length > r.length) throw new c(h.INVALID_ARGUMENT, "Too many arguments provided to " + t + "(). The number of arguments must be less than or equal to the number of Query.orderBy() clauses");
         for (var i = [], o = 0; o < e.length; o++) {
             var s = e[o];
             if (r[o].field.Y()) {
                 if ("string" != typeof s) throw new c(h.INVALID_ARGUMENT, "Invalid query. Expected a string for document ID in " + t + "(), but got a " + typeof s);
-                if (!this.Vm.He() && -1 !== s.indexOf("/")) throw new c(h.INVALID_ARGUMENT, "Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to " + t + "() must be a plain document ID, but '" + s + "' contains a slash.");
-                var u = this.Vm.path.child(w.G(s));
+                if (!this.Tm.He() && -1 !== s.indexOf("/")) throw new c(h.INVALID_ARGUMENT, "Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to " + t + "() must be a plain document ID, but '" + s + "' contains a slash.");
+                var u = this.Tm.path.child(w.G(s));
                 if (!T.st(u)) throw new c(h.INVALID_ARGUMENT, "Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to " + t + "() must result in a valid document path, but '" + u + "' is not because it contains an odd number of segments.");
                 var a = new T(u);
-                i.push(Y(this.firestore.KT, a));
+                i.push(Y(this.firestore.OT, a));
             } else {
-                var f = this.firestore.sm.Da(t, s);
+                var f = this.firestore.zT.Da(t, s);
                 i.push(f);
             }
         }
-        return new Vt(i, n);
+        return new Lt(i, n);
     }, t.prototype.onSnapshot = function() {
         for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
         tn("Query.onSnapshot", arguments, 1, 4);
         var n, r = {}, i = 0;
-        return "object" != typeof t[i] || Vi(t[i]) || (fn("Query.onSnapshot", r = t[i], [ "includeMetadataChanges" ]), 
+        return "object" != typeof t[i] || Ui(t[i]) || (fn("Query.onSnapshot", r = t[i], [ "includeMetadataChanges" ]), 
         on("Query.onSnapshot", "boolean", "includeMetadataChanges", r.includeMetadataChanges), 
-        i++), Vi(t[i]) ? n = t[i] : (en("Query.onSnapshot", "function", i, t[i]), nn("Query.onSnapshot", "function", i + 1, t[i + 1]), 
+        i++), Ui(t[i]) ? n = t[i] : (en("Query.onSnapshot", "function", i, t[i]), nn("Query.onSnapshot", "function", i + 1, t[i + 1]), 
         nn("Query.onSnapshot", "function", i + 2, t[i + 2]), n = {
             next: t[i],
             error: t[i + 1],
             complete: t[i + 2]
-        }), this.Cm(this.Vm), this.wm(r, n);
-    }, t.prototype.wm = function(t, e) {
+        }), this.Vm(this.Tm), this.cm(r, n);
+    }, t.prototype.cm = function(t, e) {
         var n = this, r = function(t) {
             console.error("Uncaught Error in onSnapshot:", t);
         };
         e.error && (r = e.error.bind(e));
-        var i = new Ri({
+        var i = new Li({
             next: function(t) {
-                e.next && e.next(new zi(n.firestore, n.Vm, t, n.fm));
+                e.next && e.next(new Ki(n.firestore, n.Tm, t, n.om));
             },
             error: r
-        }), o = this.firestore.HT(), s = o.listen(this.Vm, i, t);
+        }), o = this.firestore.UT(), s = o.listen(this.Tm, i, t);
         return function() {
-            i.OT(), o.fc(s);
+            i.DT(), o.fc(s);
         };
-    }, t.prototype.Cm = function(t) {
+    }, t.prototype.Vm = function(t) {
         if (t.Ke() && 0 === t.Ve.length) throw new c(h.UNIMPLEMENTED, "limitToLast() queries require specifying at least one orderBy() clause");
     }, t.prototype.get = function(t) {
         var e = this;
-        return tn("Query.get", arguments, 0, 1), Qi("Query.get", t), this.Cm(this.Vm), new Promise((function(n, r) {
-            t && "cache" === t.source ? e.firestore.HT().MT(e.Vm).then((function(t) {
-                n(new zi(e.firestore, e.Vm, t, e.fm));
-            }), r) : e.Im(n, r, t);
+        return tn("Query.get", arguments, 0, 1), Xi("Query.get", t), this.Vm(this.Tm), new Promise((function(n, r) {
+            t && "cache" === t.source ? e.firestore.UT().vT(e.Tm).then((function(t) {
+                n(new Ki(e.firestore, e.Tm, t, e.om));
+            }), r) : e._m(n, r, t);
         }));
-    }, t.prototype.Im = function(t, e, n) {
-        var r = this.wm({
+    }, t.prototype._m = function(t, e, n) {
+        var r = this.cm({
             includeMetadataChanges: !0,
             Kl: !0
         }, {
@@ -14239,17 +14237,17 @@ var Li = /** @class */ function() {
      * appropriate errors if the value is anything other than a DocumentReference
      * or String, or if the string is malformed.
      */
-    t.prototype.pm = function(t) {
+    t.prototype.wm = function(t) {
         if ("string" == typeof t) {
             if ("" === t) throw new c(h.INVALID_ARGUMENT, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
-            if (!this.Vm.He() && -1 !== t.indexOf("/")) throw new c(h.INVALID_ARGUMENT, "Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '" + t + "' contains a '/' character.");
-            var e = this.Vm.path.child(w.G(t));
+            if (!this.Tm.He() && -1 !== t.indexOf("/")) throw new c(h.INVALID_ARGUMENT, "Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '" + t + "' contains a '/' character.");
+            var e = this.Tm.path.child(w.G(t));
             if (!T.st(e)) throw new c(h.INVALID_ARGUMENT, "Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '" + e + "' is not because it has an odd number of segments (" + e.length + ").");
-            return Y(this.firestore.KT, new T(e));
+            return Y(this.firestore.OT, new T(e));
         }
-        if (t instanceof qi) {
+        if (t instanceof Fi) {
             var n = t;
-            return Y(this.firestore.KT, n.um);
+            return Y(this.firestore.OT, n.em);
         }
         throw new c(h.INVALID_ARGUMENT, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: " + hn(t) + ".");
     }, 
@@ -14257,43 +14255,43 @@ var Li = /** @class */ function() {
      * Validates that the value passed into a disjunctrive filter satisfies all
      * array requirements.
      */
-    t.prototype.gm = function(t, e) {
+    t.prototype.mm = function(t, e) {
         if (!Array.isArray(t) || 0 === t.length) throw new c(h.INVALID_ARGUMENT, "Invalid Query. A non-empty array is required for '" + e.toString() + "' filters.");
         if (t.length > 10) throw new c(h.INVALID_ARGUMENT, "Invalid Query. '" + e.toString() + "' filters support a maximum of 10 elements in the value array.");
         if (t.indexOf(null) >= 0) throw new c(h.INVALID_ARGUMENT, "Invalid Query. '" + e.toString() + "' filters cannot contain 'null' in the value array.");
         if (t.filter((function(t) {
             return Number.isNaN(t);
         })).length > 0) throw new c(h.INVALID_ARGUMENT, "Invalid Query. '" + e.toString() + "' filters cannot contain 'NaN' in the value array.");
-    }, t.prototype.ym = function(t) {
-        if (t instanceof It) {
+    }, t.prototype.Em = function(t) {
+        if (t instanceof Et) {
             var e = [ Tt.ARRAY_CONTAINS, Tt.ARRAY_CONTAINS_ANY ], n = [ Tt.IN, Tt.ARRAY_CONTAINS_ANY ], r = e.indexOf(t.op) >= 0, i = n.indexOf(t.op) >= 0;
             if (t.Ge()) {
-                var o = this.Vm.Se();
+                var o = this.Tm.Se();
                 if (null !== o && !o.isEqual(t.field)) throw new c(h.INVALID_ARGUMENT, "Invalid query. All where filters with an inequality (<, <=, >, or >=) must be on the same field. But you have inequality filters on '" + o.toString() + "' and '" + t.field.toString() + "'");
-                var s = this.Vm.De();
-                null !== s && this.km(t.field, s);
+                var s = this.Tm.De();
+                null !== s && this.gm(t.field, s);
             } else if (i || r) {
                 // You can have at most 1 disjunctive filter and 1 array filter. Check if
                 // the new filter conflicts with an existing one.
                 var u = null;
-                if (i && (u = this.Vm.ze(n)), null === u && r && (u = this.Vm.ze(e)), null != u) 
+                if (i && (u = this.Tm.ze(n)), null === u && r && (u = this.Tm.ze(e)), null != u) 
                 // We special case when it's a duplicate op to give a slightly clearer error message.
                 throw u === t.op ? new c(h.INVALID_ARGUMENT, "Invalid query. You cannot use more than one '" + t.op.toString() + "' filter.") : new c(h.INVALID_ARGUMENT, "Invalid query. You cannot use '" + t.op.toString() + "' filters with '" + u.toString() + "' filters.");
             }
         }
-    }, t.prototype.bm = function(t) {
-        if (null === this.Vm.De()) {
+    }, t.prototype.Im = function(t) {
+        if (null === this.Tm.De()) {
             // This is the first order by. It must match any inequality.
-            var e = this.Vm.Se();
-            null !== e && this.km(e, t.field);
+            var e = this.Tm.Se();
+            null !== e && this.gm(e, t.field);
         }
-    }, t.prototype.km = function(t, e) {
+    }, t.prototype.gm = function(t, e) {
         if (!e.isEqual(t)) throw new c(h.INVALID_ARGUMENT, "Invalid query. You have a where filter with an inequality (<, <=, >, or >=) on field '" + t.toString() + "' and so you must also use '" + t.toString() + "' as your first Query.orderBy(), but your first Query.orderBy() is on field '" + e.toString() + "' instead.");
     }, t;
-}(), zi = /** @class */ function() {
+}(), Ki = /** @class */ function() {
     function t(t, e, n, r) {
-        this.lm = t, this.Nm = e, this.Fm = n, this.fm = r, this.$m = null, this.Mm = null, 
-        this.metadata = new Fi(n.hasPendingWrites, n.fromCache);
+        this.im = t, this.pm = e, this.ym = n, this.om = r, this.bm = null, this.vm = null, 
+        this.metadata = new ji(n.hasPendingWrites, n.fromCache);
     }
     return Object.defineProperty(t.prototype, "docs", {
         get: function() {
@@ -14306,33 +14304,33 @@ var Li = /** @class */ function() {
         configurable: !0
     }), Object.defineProperty(t.prototype, "empty", {
         get: function() {
-            return this.Fm.docs.U();
+            return this.ym.docs.U();
         },
         enumerable: !0,
         configurable: !0
     }), Object.defineProperty(t.prototype, "size", {
         get: function() {
-            return this.Fm.docs.size;
+            return this.ym.docs.size;
         },
         enumerable: !0,
         configurable: !0
     }), t.prototype.forEach = function(t, e) {
         var n = this;
         tn("QuerySnapshot.forEach", arguments, 1, 2), en("QuerySnapshot.forEach", "function", 1, t), 
-        this.Fm.docs.forEach((function(r) {
-            t.call(e, n.Lm(r));
+        this.ym.docs.forEach((function(r) {
+            t.call(e, n.Sm(r));
         }));
     }, Object.defineProperty(t.prototype, "query", {
         get: function() {
-            return new Bi(this.Nm, this.lm, this.fm);
+            return new zi(this.pm, this.im, this.om);
         },
         enumerable: !0,
         configurable: !0
     }), t.prototype.docChanges = function(t) {
         t && (fn("QuerySnapshot.docChanges", t, [ "includeMetadataChanges" ]), on("QuerySnapshot.docChanges", "boolean", "includeMetadataChanges", t.includeMetadataChanges));
         var e = !(!t || !t.includeMetadataChanges);
-        if (e && this.Fm.ds) throw new c(h.INVALID_ARGUMENT, "To include metadata changes with your document changes, you must also pass { includeMetadataChanges:true } to onSnapshot().");
-        return this.$m && this.Mm === e || (this.$m = 
+        if (e && this.ym.ds) throw new c(h.INVALID_ARGUMENT, "To include metadata changes with your document changes, you must also pass { includeMetadataChanges:true } to onSnapshot().");
+        return this.bm && this.vm === e || (this.bm = 
         /**
      * Calculates the array of firestore.DocumentChange's for a given ViewSnapshot.
      *
@@ -14344,7 +14342,7 @@ var Li = /** @class */ function() {
                 // fast
                 var i = 0;
                 return n.docChanges.map((function(e) {
-                    var o = new Gi(t, e.doc.key, e.doc, n.fromCache, n._s.has(e.doc.key), r);
+                    var o = new Bi(t, e.doc.key, e.doc, n.fromCache, n._s.has(e.doc.key), r);
                     return e.doc, {
                         type: "added",
                         doc: o,
@@ -14359,45 +14357,45 @@ var Li = /** @class */ function() {
             return n.docChanges.filter((function(t) {
                 return e || 3 /* Metadata */ !== t.type;
             })).map((function(e) {
-                var i = new Gi(t, e.doc.key, e.doc, n.fromCache, n._s.has(e.doc.key), r), s = -1, u = -1;
+                var i = new Bi(t, e.doc.key, e.doc, n.fromCache, n._s.has(e.doc.key), r), s = -1, u = -1;
                 return 0 /* Added */ !== e.type && (s = o.indexOf(e.doc.key), o = o.delete(e.doc.key)), 
                 1 /* Removed */ !== e.type && (u = (o = o.add(e.doc)).indexOf(e.doc.key)), {
-                    type: Hi(e.type),
+                    type: Ji(e.type),
                     doc: i,
                     oldIndex: s,
                     newIndex: u
                 };
             }));
-        }(this.lm, e, this.Fm, this.fm), this.Mm = e), this.$m;
+        }(this.im, e, this.ym, this.om), this.vm = e), this.bm;
     }, 
     /** Check the equality. The call can be very expensive. */ t.prototype.isEqual = function(e) {
         if (!(e instanceof t)) throw ln("isEqual", "QuerySnapshot", 1, e);
-        return this.lm === e.lm && this.Nm.isEqual(e.Nm) && this.Fm.isEqual(e.Fm) && this.fm === e.fm;
-    }, t.prototype.Lm = function(t) {
-        return new Gi(this.lm, t.key, t, this.metadata.fromCache, this.Fm._s.has(t.key), this.fm);
+        return this.im === e.im && this.pm.isEqual(e.pm) && this.ym.isEqual(e.ym) && this.om === e.om;
+    }, t.prototype.Sm = function(t) {
+        return new Bi(this.im, t.key, t, this.metadata.fromCache, this.ym._s.has(t.key), this.om);
     }, t;
-}(), Ki = /** @class */ function(t) {
+}(), Wi = /** @class */ function(t) {
     function n(e, n, r) {
         var i = this;
-        if ((i = t.call(this, bt.ve(e), n, r) || this).Om = e, e.length % 2 != 1) throw new c(h.INVALID_ARGUMENT, "Invalid collection reference. Collection references must have an odd number of segments, but " + e.K() + " has " + e.length);
+        if ((i = t.call(this, bt.ve(e), n, r) || this).Dm = e, e.length % 2 != 1) throw new c(h.INVALID_ARGUMENT, "Invalid collection reference. Collection references must have an odd number of segments, but " + e.K() + " has " + e.length);
         return i;
     }
     return e.__extends(n, t), Object.defineProperty(n.prototype, "id", {
         get: function() {
-            return this.Vm.path.B();
+            return this.Tm.path.B();
         },
         enumerable: !0,
         configurable: !0
     }), Object.defineProperty(n.prototype, "parent", {
         get: function() {
-            var t = this.Vm.path.L();
-            return t.U() ? null : new qi(new T(t), this.firestore);
+            var t = this.Tm.path.L();
+            return t.U() ? null : new Fi(new T(t), this.firestore);
         },
         enumerable: !0,
         configurable: !0
     }), Object.defineProperty(n.prototype, "path", {
         get: function() {
-            return this.Vm.path.K();
+            return this.Tm.path.K();
         },
         enumerable: !0,
         configurable: !0
@@ -14408,17 +14406,17 @@ var Li = /** @class */ function() {
         0 === arguments.length && (t = Te.mi()), en("CollectionReference.doc", "non-empty string", 1, t), 
         "" === t) throw new c(h.INVALID_ARGUMENT, "Document path must be a non-empty string");
         var e = w.G(t);
-        return qi.cm(this.Vm.path.child(e), this.firestore, this.fm);
+        return Fi.sm(this.Tm.path.child(e), this.firestore, this.om);
     }, n.prototype.add = function(t) {
-        Ze("CollectionReference.add", arguments, 1), en("CollectionReference.add", "object", 1, this.fm ? this.fm.toFirestore(t) : t);
+        Ze("CollectionReference.add", arguments, 1), en("CollectionReference.add", "object", 1, this.om ? this.om.toFirestore(t) : t);
         var e = this.doc();
         return e.set(t).then((function() {
             return e;
         }));
     }, n.prototype.withConverter = function(t) {
-        return new n(this.Om, this.firestore, t);
+        return new n(this.Dm, this.firestore, t);
     }, n;
-}(Bi);
+}(zi);
 
 /**
  * @license
@@ -14437,7 +14435,7 @@ var Li = /** @class */ function() {
  * limitations under the License.
  */
 // settings() defaults:
-function Wi(t, e) {
+function Yi(t, e) {
     if (void 0 === e) return {
         merge: !1
     };
@@ -14452,24 +14450,24 @@ function Wi(t, e) {
     return e;
 }
 
-function Yi(t, e) {
+function Qi(t, e) {
     return void 0 === e ? {} : (fn(t, e, [ "serverTimestamps" ]), sn(t, 0, "serverTimestamps", e.serverTimestamps, [ "estimate", "previous", "none" ]), 
     e);
 }
 
-function Qi(t, e) {
+function Xi(t, e) {
     nn(t, "object", 1, e), e && (fn(t, e, [ "source" ]), sn(t, 0, "source", e.source, [ "default", "server", "cache" ]));
 }
 
-function Ji(t, e, n) {
-    if (e instanceof qi) {
+function Hi(t, e, n) {
+    if (e instanceof Fi) {
         if (e.firestore !== n) throw new c(h.INVALID_ARGUMENT, "Provided document reference is from a different Firestore instance.");
         return e;
     }
     throw ln(t, "DocumentReference", 1, e);
 }
 
-function Hi(t) {
+function Ji(t) {
     switch (t) {
       case 0 /* Added */ :
         return "added";
@@ -14494,58 +14492,58 @@ function Hi(t) {
  * because we want to provide the user with a more specific error message if
  * their set() or fails due to invalid data originating from a toFirestore()
  * call.
- */ function Xi(t, e, n) {
+ */ function Zi(t, e, n) {
     var r;
     return t ? (r = t.toFirestore(e), n = "toFirestore() in " + n) : r = e, [ r, n ];
 }
 
-var Zi = mn(Pi, "Use firebase.firestore() instead."), $i = mn(Ci, "Use firebase.firestore().runTransaction() instead."), to = mn(Mi, "Use firebase.firestore().batch() instead."), eo = mn(qi, "Use firebase.firestore().doc() instead."), no = mn(ji), ro = mn(Gi), io = mn(Bi), oo = mn(zi), so = mn(Ki, "Use firebase.firestore().collection() instead."), uo = {
-    Firestore: Zi,
+var $i = mn(Ci, "Use firebase.firestore() instead."), to = mn(Mi, "Use firebase.firestore().runTransaction() instead."), eo = mn(qi, "Use firebase.firestore().batch() instead."), no = mn(Fi, "Use firebase.firestore().doc() instead."), ro = mn(Gi), io = mn(Bi), oo = mn(zi), so = mn(Ki), uo = mn(Wi, "Use firebase.firestore().collection() instead."), ao = {
+    Firestore: $i,
     GeoPoint: xn,
     Timestamp: m,
     Blob: _n,
-    Transaction: $i,
-    WriteBatch: to,
-    DocumentReference: eo,
-    DocumentSnapshot: no,
-    Query: io,
-    QueryDocumentSnapshot: ro,
-    QuerySnapshot: oo,
-    CollectionReference: so,
+    Transaction: to,
+    WriteBatch: eo,
+    DocumentReference: no,
+    DocumentSnapshot: ro,
+    Query: oo,
+    QueryDocumentSnapshot: io,
+    QuerySnapshot: so,
+    CollectionReference: uo,
     FieldPath: bn,
     FieldValue: kn,
-    setLogLevel: Pi.setLogLevel,
-    CACHE_SIZE_UNLIMITED: Ui
-}, ao = /** @class */ function() {
+    setLogLevel: Ci.setLogLevel,
+    CACHE_SIZE_UNLIMITED: Oi
+}, ho = /** @class */ function() {
     function t() {}
     return t.prototype.Hu = function(t) {
         // No-op.
     }, t.prototype.lc = function() {
         // No-op.
     }, t;
-}(), ho = /** @class */ function() {
+}(), co = /** @class */ function() {
     function t() {
         var t = this;
-        this.xm = function() {
-            return t.Bm();
-        }, this.Um = function() {
-            return t.qm();
-        }, this.Qm = [], this.Wm();
+        this.Cm = function() {
+            return t.km();
+        }, this.Nm = function() {
+            return t.Fm();
+        }, this.$m = [], this.Mm();
     }
     return t.prototype.Hu = function(t) {
-        this.Qm.push(t);
+        this.$m.push(t);
     }, t.prototype.lc = function() {
-        window.removeEventListener("online", this.xm), window.removeEventListener("offline", this.Um);
-    }, t.prototype.Wm = function() {
-        window.addEventListener("online", this.xm), window.addEventListener("offline", this.Um);
-    }, t.prototype.Bm = function() {
+        window.removeEventListener("online", this.Cm), window.removeEventListener("offline", this.Nm);
+    }, t.prototype.Mm = function() {
+        window.addEventListener("online", this.Cm), window.addEventListener("offline", this.Nm);
+    }, t.prototype.km = function() {
         ve("ConnectivityMonitor", "Network connectivity changed: AVAILABLE");
-        for (var t = 0, e = this.Qm; t < e.length; t++) {
+        for (var t = 0, e = this.$m; t < e.length; t++) {
             (0, e[t])(0 /* AVAILABLE */);
         }
-    }, t.prototype.qm = function() {
+    }, t.prototype.Fm = function() {
         ve("ConnectivityMonitor", "Network connectivity changed: UNAVAILABLE");
-        for (var t = 0, e = this.Qm; t < e.length; t++) {
+        for (var t = 0, e = this.$m; t < e.length; t++) {
             (0, e[t])(1 /* UNAVAILABLE */);
         }
     }, 
@@ -14555,44 +14553,44 @@ var Zi = mn(Pi, "Use firebase.firestore() instead."), $i = mn(Ci, "Use firebase.
     t.Uc = function() {
         return "undefined" != typeof window && void 0 !== window.addEventListener && void 0 !== window.removeEventListener;
     }, t;
-}(), co = /** @class */ function() {
+}(), fo = /** @class */ function() {
     function t(t) {
-        this.jm = t.jm, this.Km = t.Km;
+        this.Lm = t.Lm, this.Om = t.Om;
     }
     return t.prototype._u = function(t) {
-        this.Gm = t;
+        this.xm = t;
     }, t.prototype.ou = function(t) {
-        this.zm = t;
+        this.Bm = t;
     }, t.prototype.onMessage = function(t) {
-        this.Hm = t;
+        this.Um = t;
     }, t.prototype.close = function() {
-        this.Km();
+        this.Om();
     }, t.prototype.send = function(t) {
-        this.jm(t);
-    }, t.prototype.Jm = function() {
-        this.Gm();
-    }, t.prototype.Ym = function(t) {
-        this.zm(t);
-    }, t.prototype.Xm = function(t) {
-        this.Hm(t);
+        this.Lm(t);
+    }, t.prototype.qm = function() {
+        this.xm();
+    }, t.prototype.Qm = function(t) {
+        this.Bm(t);
+    }, t.prototype.Wm = function(t) {
+        this.Um(t);
     }, t;
-}(), fo = {
+}(), lo = {
     BatchGetDocuments: "batchGet",
     Commit: "commit"
-}, lo = "gl-js/ fire/" + u, po = /** @class */ function() {
+}, po = "gl-js/ fire/" + u, yo = /** @class */ function() {
     function t(t) {
         this.cn = t.cn;
         var e = t.ssl ? "https" : "http";
-        this.Zm = e + "://" + t.host, this.forceLongPolling = t.forceLongPolling;
+        this.jm = e + "://" + t.host, this.forceLongPolling = t.forceLongPolling;
     }
     /**
      * Modifies the headers for a request, adding any authorization token if
      * present and any additional headers for the request.
-     */    return t.prototype.tE = function(t, e) {
+     */    return t.prototype.Km = function(t, e) {
         if (e) for (var n in e.h) e.h.hasOwnProperty(n) && (t[n] = e.h[n]);
-        t["X-Goog-Api-Client"] = lo;
+        t["X-Goog-Api-Client"] = po;
     }, t.prototype.gu = function(t, e, n) {
-        var r = this, i = this.eE(t);
+        var r = this, i = this.Gm(t);
         return new Promise((function(o, u) {
             var a = new s.XhrIo;
             a.listenOnce(s.EventType.COMPLETE, (function() {
@@ -14647,14 +14645,14 @@ var Zi = mn(Pi, "Use firebase.firestore() instead."), $i = mn(Ci, "Use firebase.
             var p = {
                 "Content-Type": "text/plain"
             };
-            r.tE(p, n), a.send(i, "POST", l, p, 15);
+            r.Km(p, n), a.send(i, "POST", l, p, 15);
         }));
     }, t.prototype.yu = function(t, e, n) {
         // The REST API automatically aggregates all of the streamed results, so we
         // can just use the normal invoke() method.
         return this.gu(t, e, n);
     }, t.prototype.lu = function(t, e) {
-        var n = [ this.Zm, "/", "google.firestore.v1.Firestore", "/", t, "/channel" ], r = s.createWebChannelTransport(), o = {
+        var n = [ this.jm, "/", "google.firestore.v1.Firestore", "/", t, "/channel" ], r = s.createWebChannelTransport(), o = {
             // Required for backend stickiness, routing behavior is based on this
             // parameter.
             httpSessionIdParam: "gsessionid",
@@ -14677,7 +14675,7 @@ var Zi = mn(Pi, "Use firebase.firestore() instead."), $i = mn(Ci, "Use firebase.
             },
             forceLongPolling: this.forceLongPolling
         };
-        this.tE(o.initMessageHeaders, e), 
+        this.Km(o.initMessageHeaders, e), 
         // Sending the custom headers we just added to request.initMessageHeaders
         // (Authorization, etc.) will trigger the browser to make a CORS preflight
         // request because the XHR will no longer meet the criteria for a "simple"
@@ -14696,12 +14694,12 @@ var Zi = mn(Pi, "Use firebase.firestore() instead."), $i = mn(Ci, "Use firebase.
         i.isMobileCordova() || i.isReactNative() || i.isElectron() || i.isIE() || i.isUWP() || i.isBrowserExtension() || (o.httpHeadersOverwriteParam = "$httpHeaders");
         var u = n.join("");
         ve("Connection", "Creating WebChannel: " + u + " " + o);
-        var a = r.createWebChannel(u, o), f = !1, l = !1, p = new co({
-            jm: function(t) {
+        var a = r.createWebChannel(u, o), f = !1, l = !1, p = new fo({
+            Lm: function(t) {
                 l ? ve("Connection", "Not sending because WebChannel is closed:", t) : (f || (ve("Connection", "Opening WebChannel transport."), 
                 a.open(), f = !0), ve("Connection", "WebChannel sending:", t), a.send(t));
             },
-            Km: function() {
+            Om: function() {
                 return a.close();
             }
         }), d = function(t, e) {
@@ -14729,9 +14727,9 @@ var Zi = mn(Pi, "Use firebase.firestore() instead."), $i = mn(Ci, "Use firebase.
         return d(s.WebChannel.EventType.OPEN, (function() {
             l || ve("Connection", "WebChannel transport opened.");
         })), d(s.WebChannel.EventType.CLOSE, (function() {
-            l || (l = !0, ve("Connection", "WebChannel transport closed"), p.Ym());
+            l || (l = !0, ve("Connection", "WebChannel transport closed"), p.Qm());
         })), d(s.WebChannel.EventType.ERROR, (function(t) {
-            l || (l = !0, ve("Connection", "WebChannel transport errored:", t), p.Ym(new c(h.UNAVAILABLE, "The operation could not be completed")));
+            l || (l = !0, ve("Connection", "WebChannel transport errored:", t), p.Qm(new c(h.UNAVAILABLE, "The operation could not be completed")));
         })), d(s.WebChannel.EventType.MESSAGE, (function(t) {
             var e;
             if (!l) {
@@ -14754,21 +14752,21 @@ var Zi = mn(Pi, "Use firebase.firestore() instead."), $i = mn(Ci, "Use firebase.
                     }(o), u = i.message;
                     void 0 === s && (s = h.INTERNAL, u = "Unknown error status: " + o + " with message " + i.message), 
                     // Mark closed so no further events are propagated
-                    l = !0, p.Ym(new c(s, u)), a.close();
-                } else ve("Connection", "WebChannel received:", n), p.Xm(n);
+                    l = !0, p.Qm(new c(s, u)), a.close();
+                } else ve("Connection", "WebChannel received:", n), p.Wm(n);
             }
         })), setTimeout((function() {
             // Technically we could/should wait for the WebChannel opened event,
             // but because we want to send the first message with the WebChannel
             // handshake we pretend the channel opened here (asynchronously), and
             // then delay the actual open until the first message is sent.
-            p.Jm();
+            p.qm();
         }), 0), p;
     }, 
     // visible for testing
-    t.prototype.eE = function(t) {
-        var e = fo[t];
-        return this.Zm + "/v1/projects/" + this.cn.projectId + "/databases/" + this.cn.database + "/documents:" + e;
+    t.prototype.Gm = function(t) {
+        var e = lo[t];
+        return this.jm + "/v1/projects/" + this.cn.projectId + "/databases/" + this.cn.database + "/documents:" + e;
     }, t;
 }();
 
@@ -14824,7 +14822,7 @@ var Zi = mn(Pi, "Use firebase.firestore() instead."), $i = mn(Ci, "Use firebase.
  * Registers the main Firestore build with the components framework.
  * Persistence can be enabled via `firebase.firestore().enablePersistence()`.
  */
-function yo(t) {
+function mo(t) {
     /**
  * Configures Firestore as part of the Firebase SDK by calling registerService.
  *
@@ -14835,10 +14833,10 @@ function yo(t) {
     !function(t, e) {
         t.INTERNAL.registerComponent(new o.Component("firestore", (function(t) {
             return function(t, e) {
-                return new Pi(t, e, new ki);
+                return new Ci(t, e, new Di);
             }(t.getProvider("app").getImmediate(), t.getProvider("auth-internal"));
-        }), "PUBLIC" /* PUBLIC */).setServiceProps(Object.assign({}, uo)));
-    }(t), t.registerVersion("@firebase/firestore", "1.14.0-canary.daf63c2c")
+        }), "PUBLIC" /* PUBLIC */).setServiceProps(Object.assign({}, ao)));
+    }(t), t.registerVersion("@firebase/firestore", "1.14.0")
     /**
  * @license
  * Copyright 2017 Google Inc.
@@ -14880,11 +14878,11 @@ pe.fi(new (/** @class */ function() {
         },
         enumerable: !0,
         configurable: !0
-    }), t.prototype.DT = function(t) {
-        return Promise.resolve(new po(t));
-    }, t.prototype.gT = function() {
-        return ho.Uc() ? new ho : new ao;
-    }, t.prototype.yT = function(t) {
+    }), t.prototype.VT = function(t) {
+        return Promise.resolve(new yo(t));
+    }, t.prototype.mT = function() {
+        return co.Uc() ? new co : new ho;
+    }, t.prototype.fT = function(t) {
         return new fe(t, {
             dn: !0
         });
@@ -14895,5 +14893,5 @@ pe.fi(new (/** @class */ function() {
     }, t.prototype.btoa = function(t) {
         return btoa(t);
     }, t;
-}())), yo(n), exports.__PRIVATE_registerFirestore = yo;
+}())), mo(n), exports.__PRIVATE_registerFirestore = mo;
 //# sourceMappingURL=index.cjs.js.map