@firebase/firestore 3.7.3-canary.3bd031691 → 3.7.3-canary.734fdcd91

package/dist/index.esm5.js

@@ -8,9 +8,9 @@ import { Logger as l, LogLevel as h } from "@firebase/logger";
 
 import { FirebaseError as f, getUA as d, isSafari as p, getModularInstance as y, isIndexedDBAvailable as v, createMockUserToken as m, deepEqual as g, getDefaultEmulatorHostnameAndPort as w } from "@firebase/util";
 
-import { XhrIo as b, EventType as I, ErrorCode as E, createWebChannelTransport as T, getStatEventTarget as S, FetchXmlHttpFactory as _, WebChannel as D, Event as x, Stat as A } from "@firebase/webchannel-wrapper";
+import { XhrIo as b, EventType as I, ErrorCode as T, createWebChannelTransport as E, getStatEventTarget as S, FetchXmlHttpFactory as _, WebChannel as D, Event as x, Stat as A } from "@firebase/webchannel-wrapper";
 
-var N = "@firebase/firestore", C = /** @class */ function() {
+var C = "@firebase/firestore", N = /** @class */ function() {
     function t(t) {
         this.uid = t;
     }
@@ -48,11 +48,11 @@ var N = "@firebase/firestore", C = /** @class */ function() {
  * Simple wrapper around a nullable UID. Mostly exists to make code more
  * readable.
  */
-/** A user with a null UID. */ C.UNAUTHENTICATED = new C(null), 
+/** A user with a null UID. */ N.UNAUTHENTICATED = new N(null), 
 // TODO(mikelehen): Look into getting a proper uid-equivalent for
 // non-FirebaseAuth providers.
-C.GOOGLE_CREDENTIALS = new C("google-credentials-uid"), C.FIRST_PARTY = new C("first-party-uid"), 
-C.MOCK_USER = new C("mock-user");
+N.GOOGLE_CREDENTIALS = new N("google-credentials-uid"), N.FIRST_PARTY = new N("first-party-uid"), 
+N.MOCK_USER = new N("mock-user");
 
 /**
  * @license
@@ -70,7 +70,7 @@ C.MOCK_USER = new C("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var k = "9.14.0-canary.3bd031691", F = new l("@firebase/firestore");
+var k = "9.14.0-canary.734fdcd91", F = new l("@firebase/firestore");
 
 /**
  * @license
@@ -391,7 +391,7 @@ e) {
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {
         // Fire with initial user.
         t.enqueueRetryable((function() {
-            return e(C.UNAUTHENTICATED);
+            return e(N.UNAUTHENTICATED);
         }));
     }, t.prototype.shutdown = function() {}, t;
 }(), H = /** @class */ function() {
@@ -420,7 +420,7 @@ e) {
     function t(t) {
         this.t = t, 
         /** Tracks the current User. */
-        this.currentUser = C.UNAUTHENTICATED, 
+        this.currentUser = N.UNAUTHENTICATED, 
         /**
              * Counter used to detect if the token changed while a getToken request was
              * outstanding.
@@ -497,11 +497,11 @@ e) {
     // to guarantee to get the actual user.
     t.prototype.u = function() {
         var t = this.auth && this.auth.getUid();
-        return U(null === t || "string" == typeof t), new C(t);
+        return U(null === t || "string" == typeof t), new N(t);
     }, t;
 }(), X = /** @class */ function() {
     function t(t, e, n, r) {
-        this.h = t, this.l = e, this.m = n, this.g = r, this.type = "FirstParty", this.user = C.FIRST_PARTY, 
+        this.h = t, this.l = e, this.m = n, this.g = r, this.type = "FirstParty", this.user = N.FIRST_PARTY, 
         this.p = new Map
         /** Gets an authorization token, using a provided factory function, or falling back to First Party GAPI. */;
     }
@@ -530,7 +530,7 @@ e) {
     }, t.prototype.start = function(t, e) {
         // Fire with initial uid.
         t.enqueueRetryable((function() {
-            return e(C.FIRST_PARTY);
+            return e(N.FIRST_PARTY);
         }));
     }, t.prototype.shutdown = function() {}, t.prototype.invalidateToken = function() {}, 
     t;
@@ -1128,7 +1128,7 @@ function gt(t, e) {
         /** The state of an index that has not yet been backfilled. */;
     }
     return t.empty = function() {
-        return new t(0, Et.min());
+        return new t(0, Tt.min());
     }, t;
 }();
 
@@ -1143,17 +1143,17 @@ function gt(t, e) {
     // `(readTime + 1, DocumentKey.empty())` since `> DocumentKey.empty()` matches
     // all valid document IDs.
     var n = t.toTimestamp().seconds, r = t.toTimestamp().nanoseconds + 1, i = at.fromTimestamp(1e9 === r ? new ut(n + 1, 0) : new ut(n, r));
-    return new Et(i, ft.empty(), e);
+    return new Tt(i, ft.empty(), e);
 }
 
 /** Creates a new offset based on the provided document. */ function It(t) {
-    return new Et(t.readTime, t.key, -1);
+    return new Tt(t.readTime, t.key, -1);
 }
 
 /**
  * Stores the latest read time, document and batch ID that were processed for an
  * index.
- */ var Et = /** @class */ function() {
+ */ var Tt = /** @class */ function() {
     function t(
     /**
      * The latest read time version that has been indexed by Firestore for this
@@ -1180,7 +1180,7 @@ function gt(t, e) {
     }, t;
 }();
 
-function Tt(t, e) {
+function Et(t, e) {
     var n = t.readTime.compareTo(e.readTime);
     return 0 !== n ? n : 0 !== (n = ft.comparator(t.documentKey, e.documentKey)) ? n : rt(t.largestBatchId, e.largestBatchId);
 }
@@ -1460,7 +1460,7 @@ function Dt(t) {
         var e = this.transaction.objectStore(t);
         return new Ot(e);
     }, t;
-}(), Nt = /** @class */ function() {
+}(), Ct = /** @class */ function() {
     /*
      * Creates a new SimpleDb wrapper for IndexedDb database `name`.
      *
@@ -1642,7 +1642,7 @@ function Dt(t) {
     }, t.prototype.close = function() {
         this.db && this.db.close(), this.db = void 0;
     }, t;
-}(), Ct = /** @class */ function() {
+}(), Nt = /** @class */ function() {
     function t(t) {
         this.q = t, this.U = !1, this.K = null;
     }
@@ -1854,7 +1854,7 @@ function Dt(t) {
             }, t.onsuccess = function(t) {
                 var i = t.target.result;
                 if (i) {
-                    var o = new Ct(i), u = e(i.primaryKey, i.value, o);
+                    var o = new Nt(i), u = e(i.primaryKey, i.value, o);
                     if (u instanceof xt) {
                         var a = u.catch((function(t) {
                             return o.done(), xt.reject(t);
@@ -1902,7 +1902,7 @@ function Dt(t) {
 var Vt = !1;
 
 function Mt(t) {
-    var e = Nt.D(d());
+    var e = Ct.D(d());
     if (e >= 12.2 && e < 13) {
         var n = "An internal error was encountered in the Indexed Database server";
         if (t.message.indexOf(n) >= 0) {
@@ -2035,8 +2035,8 @@ function Mt(t) {
         var n = t;
         return e.changes.forEach((function(t, e) {
             var r = It(e);
-            Tt(r, n) > 0 && (n = r);
-        })), new Et(n.readTime, n.documentKey, Math.max(e.batchId, t.largestBatchId));
+            Et(r, n) > 0 && (n = r);
+        })), new Tt(n.readTime, n.documentKey, Math.max(e.batchId, t.largestBatchId));
     }, t;
 }(), qt = /** @class */ function() {
     function t(t, e) {
@@ -2709,12 +2709,12 @@ function fe(t, e) {
     } : "mapValue" in t ? re : q();
 }
 
-function Ee(t, e) {
+function Te(t, e) {
     var n = se(t.value, e.value);
     return 0 !== n ? n : t.inclusive && !e.inclusive ? -1 : !t.inclusive && e.inclusive ? 1 : 0;
 }
 
-function Te(t, e) {
+function Ee(t, e) {
     var n = se(t.value, e.value);
     return 0 !== n ? n : t.inclusive && !e.inclusive ? 1 : !t.inclusive && e.inclusive ? -1 : 0;
 }
@@ -2835,7 +2835,7 @@ function _e(t, e, n) {
     }, n.prototype.getFirstInequalityField = function() {
         return this.isInequality() ? this.field : null;
     }, n;
-}(xe), Ne = /** @class */ function(e) {
+}(xe), Ce = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).filters = t, r.op = n, r.ht = null, r;
@@ -2845,7 +2845,7 @@ function _e(t, e, n) {
      */    return t(n, e), n.create = function(t, e) {
         return new n(t, e);
     }, n.prototype.matches = function(t) {
-        return Ce(this) ? void 0 === this.filters.find((function(e) {
+        return Ne(this) ? void 0 === this.filters.find((function(e) {
             return !e.matches(t);
         })) : void 0 !== this.filters.find((function(e) {
             return e.matches(t);
@@ -2876,7 +2876,7 @@ function _e(t, e, n) {
     }, n;
 }(xe);
 
-function Ce(t) {
+function Ne(t) {
     return "and" /* CompositeOperator.AND */ === t.op;
 }
 
@@ -2887,14 +2887,14 @@ function ke(t) {
 /**
  * Returns true if this filter is a conjunction of field filters only. Returns false otherwise.
  */ function Fe(t) {
-    return Oe(t) && Ce(t);
+    return Oe(t) && Ne(t);
 }
 
 /**
  * Returns true if this filter does not contain any composite filters. Returns false otherwise.
  */ function Oe(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
-        if (n[e] instanceof Ne) return !1;
+        if (n[e] instanceof Ce) return !1;
     }
     return !0;
 }
@@ -2915,8 +2915,8 @@ function Re(t) {
 function Ve(t, e) {
     return t instanceof Ae ? function(t, e) {
         return e instanceof Ae && t.op === e.op && t.field.isEqual(e.field) && ue(t.value, e.value);
-    }(t, e) : t instanceof Ne ? function(t, e) {
-        return e instanceof Ne && t.op === e.op && t.filters.length === e.filters.length && t.filters.reduce((function(t, n, r) {
+    }(t, e) : t instanceof Ce ? function(t, e) {
+        return e instanceof Ce && t.op === e.op && t.filters.length === e.filters.length && t.filters.reduce((function(t, n, r) {
             return t && Ve(n, e.filters[r]);
         }), !0);
     }(t, e) : void q();
@@ -2924,13 +2924,13 @@ function Ve(t, e) {
 
 function Me(t, e) {
     var n = t.filters.concat(e);
-    return Ne.create(n, t.op);
+    return Ce.create(n, t.op);
 }
 
 /** Returns a debug description for `filter`. */ function Le(t) {
     return t instanceof Ae ? function(t) {
         return "".concat(t.field.canonicalString(), " ").concat(t.op, " ").concat(le(t.value));
-    }(t) : t instanceof Ne ? function(t) {
+    }(t) : t instanceof Ce ? function(t) {
         return t.op.toString() + " {" + t.getFilters().map(Le).join(" ,") + "}";
     }(t) : "Filter";
 }
@@ -3709,26 +3709,35 @@ function nn(t) {
 }
 
 var rn = /** @class */ function() {
-    function t(t, e, n, r, i, o) {
-        this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.data = i, 
-        this.documentState = o
+    function t(t, e, n, r, i, o, u) {
+        this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.createTime = i, 
+        this.data = o, this.documentState = u
         /**
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */;
     }
     return t.newInvalidDocument = function(e) {
-        return new t(e, 0 /* DocumentType.INVALID */ , at.min(), at.min(), en.empty(), 0 /* DocumentState.SYNCED */);
+        return new t(e, 0 /* DocumentType.INVALID */ , 
+        /* version */ at.min(), 
+        /* readTime */ at.min(), 
+        /* createTime */ at.min(), en.empty(), 0 /* DocumentState.SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist with the given data at the
      * given version.
      */
-    t.newFoundDocument = function(e, n, r) {
-        return new t(e, 1 /* DocumentType.FOUND_DOCUMENT */ , n, at.min(), r, 0 /* DocumentState.SYNCED */);
+    t.newFoundDocument = function(e, n, r, i) {
+        return new t(e, 1 /* DocumentType.FOUND_DOCUMENT */ , 
+        /* version */ n, 
+        /* readTime */ at.min(), 
+        /* createTime */ r, i, 0 /* DocumentState.SYNCED */);
     }, 
     /** Creates a new document that is known to not exist at the given version. */ t.newNoDocument = function(e, n) {
-        return new t(e, 2 /* DocumentType.NO_DOCUMENT */ , n, at.min(), en.empty(), 0 /* DocumentState.SYNCED */);
+        return new t(e, 2 /* DocumentType.NO_DOCUMENT */ , 
+        /* version */ n, 
+        /* readTime */ at.min(), 
+        /* createTime */ at.min(), en.empty(), 0 /* DocumentState.SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist at the given version but
@@ -3736,15 +3745,24 @@ var rn = /** @class */ function() {
      * base document).
      */
     t.newUnknownDocument = function(e, n) {
-        return new t(e, 3 /* DocumentType.UNKNOWN_DOCUMENT */ , n, at.min(), en.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
+        return new t(e, 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
+        /* version */ n, 
+        /* readTime */ at.min(), 
+        /* createTime */ at.min(), en.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
     }, 
     /**
      * Changes the document type to indicate that it exists and that its version
      * and data are known.
      */
     t.prototype.convertToFoundDocument = function(t, e) {
-        return this.version = t, this.documentType = 1 /* DocumentType.FOUND_DOCUMENT */ , 
-        this.data = e, this.documentState = 0 /* DocumentState.SYNCED */ , this;
+        // If a document is switching state from being an invalid or deleted
+        // document to a valid (FOUND_DOCUMENT) document, either due to receiving an
+        // update from Watch or due to applying a local set mutation on top
+        // of a deleted document, our best guess about its createTime would be the
+        // version at which the document transitioned to a FOUND_DOCUMENT.
+        return !this.createTime.isEqual(at.min()) || 2 /* DocumentType.NO_DOCUMENT */ !== this.documentType && 0 /* DocumentType.INVALID */ !== this.documentType || (this.createTime = t), 
+        this.version = t, this.documentType = 1 /* DocumentType.FOUND_DOCUMENT */ , this.data = e, 
+        this.documentState = 0 /* DocumentState.SYNCED */ , this;
     }, 
     /**
      * Changes the document type to indicate that it doesn't exist at the given
@@ -3799,9 +3817,9 @@ var rn = /** @class */ function() {
     }, t.prototype.isEqual = function(e) {
         return e instanceof t && this.key.isEqual(e.key) && this.version.isEqual(e.version) && this.documentType === e.documentType && this.documentState === e.documentState && this.data.isEqual(e.data);
     }, t.prototype.mutableCopy = function() {
-        return new t(this.key, this.documentType, this.version, this.readTime, this.data.clone(), this.documentState);
+        return new t(this.key, this.documentType, this.version, this.readTime, this.createTime, this.data.clone(), this.documentState);
     }, t.prototype.toString = function() {
-        return "Document(".concat(this.key, ", ").concat(this.version, ", ").concat(JSON.stringify(this.data.value), ", {documentType: ").concat(this.documentType, "}), {documentState: ").concat(this.documentState, "})");
+        return "Document(".concat(this.key, ", ").concat(this.version, ", ").concat(JSON.stringify(this.data.value), ", {createTime: ").concat(this.createTime, "}), {documentType: ").concat(this.documentType, "}), {documentState: ").concat(this.documentState, "})");
     }, t;
 }(), on = function(t, e, n, r, i, o, u) {
     void 0 === e && (e = null), void 0 === n && (n = []), void 0 === r && (r = []), 
@@ -3917,7 +3935,7 @@ function cn(t) {
             s = ie;
             // Remaining filters cannot be used as lower bounds.
                 }
-        Ee({
+        Te({
             value: r,
             inclusive: i
         }, {
@@ -3929,7 +3947,7 @@ function cn(t) {
     // range to see if we can narrow the scope.
         if (null !== n) for (var l = 0; l < t.orderBy.length; ++l) if (t.orderBy[l].field.isEqual(e)) {
         var h = n.position[l];
-        Ee({
+        Te({
             value: r,
             inclusive: i
         }, {
@@ -3972,7 +3990,7 @@ function cn(t) {
             s = re;
             // Remaining filters cannot be used as upper bounds.
                 }
-        Te({
+        Ee({
             value: r,
             inclusive: i
         }, {
@@ -3984,7 +4002,7 @@ function cn(t) {
     // range to see if we can narrow the scope.
         if (null !== n) for (var l = 0; l < t.orderBy.length; ++l) if (t.orderBy[l].field.isEqual(e)) {
         var h = n.position[l];
-        Te({
+        Ee({
             value: r,
             inclusive: i
         }, {
@@ -4129,13 +4147,13 @@ function gn(t) {
     return e._t;
 }
 
-function En(t, e) {
+function Tn(t, e) {
     e.getFirstInequalityField(), gn(t);
     var n = t.filters.concat([ e ]);
     return new dn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
 }
 
-function Tn(t, e, n) {
+function En(t, e, n) {
     return new dn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
 }
 
@@ -4215,10 +4233,10 @@ function An(t) {
 /**
  * Returns a new comparator function that can be used to compare two documents
  * based on the Query's ordering constraint.
- */ function Nn(t) {
+ */ function Cn(t) {
     return function(e, n) {
         for (var r = !1, i = 0, o = bn(t); i < o.length; i++) {
-            var u = o[i], a = Cn(u, e, n);
+            var u = o[i], a = Nn(u, e, n);
             if (0 !== a) return a;
             r = r || u.field.isKeyField();
         }
@@ -4226,7 +4244,7 @@ function An(t) {
     };
 }
 
-function Cn(t, e, n) {
+function Nn(t, e, n) {
     var r = t.field.isKeyField() ? ft.comparator(e.key, n.key) : function(t, e, n) {
         var r = e.data.field(t), i = n.data.field(t);
         return null !== r && null !== i ? se(r, i) : q();
@@ -5048,14 +5066,14 @@ function wr(t) {
 }
 
 function br() {
-    return Er();
+    return Tr();
 }
 
 function Ir() {
-    return Er();
+    return Tr();
 }
 
-function Er() {
+function Tr() {
     return new pr((function(t) {
         return t.toString();
     }), (function(t, e) {
@@ -5063,7 +5081,7 @@ function Er() {
     }));
 }
 
-var Tr = new He(ft.comparator), Sr = new Ze(ft.comparator);
+var Er = new He(ft.comparator), Sr = new Ze(ft.comparator);
 
 function _r() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
@@ -5136,9 +5154,9 @@ function xr() {
     // PORTING NOTE: Multi-tab only
         return t.createSynthesizedRemoteEventForCurrentChange = function(e, n, r) {
         var i = new Map;
-        return i.set(e, Nr.createSynthesizedTargetChangeForCurrentChange(e, n, r)), new t(at.min(), i, xr(), vr(), _r());
+        return i.set(e, Cr.createSynthesizedTargetChangeForCurrentChange(e, n, r)), new t(at.min(), i, xr(), vr(), _r());
     }, t;
-}(), Nr = /** @class */ function() {
+}(), Cr = /** @class */ function() {
     function t(
     /**
      * An opaque, server-assigned token that allows watching a query to be resumed
@@ -5179,7 +5197,7 @@ function xr() {
     return t.createSynthesizedTargetChangeForCurrentChange = function(e, n, r) {
         return new t(r, n, _r(), _r(), _r());
     }, t;
-}(), Cr = function(
+}(), Nr = function(
 /** The new document applies to all of these targets. */
 t, 
 /** The new document is removed from all of these targets. */
@@ -5297,7 +5315,7 @@ n
               default:
                 q();
             }
-        })), new Nr(this.bt, this.Pt, t, e, n);
+        })), new Cr(this.bt, this.Pt, t, e, n);
     }, 
     /**
      * Resets the document changes and sets `hasPendingChanges` to false.
@@ -5701,12 +5719,12 @@ function $r(t, e, n) {
 }
 
 function ti(t, e, n) {
-    var r = Hr(t, e.name), i = jr(e.updateTime), o = new en({
+    var r = Hr(t, e.name), i = jr(e.updateTime), o = e.createTime ? jr(e.createTime) : at.min(), u = new en({
         mapValue: {
             fields: e.fields
         }
-    }), u = rn.newFoundDocument(r, i, o);
-    return n && u.setHasCommittedMutations(), n ? u.setHasCommittedMutations() : u;
+    }), a = rn.newFoundDocument(r, i, o, u);
+    return n && a.setHasCommittedMutations(), n ? a.setHasCommittedMutations() : a;
 }
 
 function ei(t, e) {
@@ -5822,7 +5840,7 @@ function ii(t, e) {
         collectionId: r.lastSegment()
     } ]);
     var i = function(t) {
-        if (0 !== t.length) return fi(Ne.create(t, "and" /* CompositeOperator.AND */));
+        if (0 !== t.length) return fi(Ce.create(t, "and" /* CompositeOperator.AND */));
     }(e.filters);
     i && (n.structuredQuery.where = i);
     var o = function(t) {
@@ -5863,7 +5881,7 @@ function oi(t) {
     var u = [];
     n.where && (u = function(t) {
         var e = ui(t);
-        return e instanceof Ne && Fe(e) ? e.getFilters() : [ e ];
+        return e instanceof Ce && Fe(e) ? e.getFilters() : [ e ];
     }(n.where));
     var a = [];
     n.orderBy && (a = n.orderBy.map((function(t) {
@@ -5969,7 +5987,7 @@ function ui(t) {
             }
         }(t.fieldFilter.op), t.fieldFilter.value);
     }(t) : void 0 !== t.compositeFilter ? function(t) {
-        return Ne.create(t.compositeFilter.filters.map((function(t) {
+        return Ce.create(t.compositeFilter.filters.map((function(t) {
             return ui(t);
         })), function(t) {
             switch (t) {
@@ -6044,7 +6062,7 @@ function fi(t) {
                 value: t.value
             }
         };
-    }(t) : t instanceof Ne ? function(t) {
+    }(t) : t instanceof Ce ? function(t) {
         var e = t.getFilters().map((function(t) {
             return fi(t);
         }));
@@ -6218,7 +6236,7 @@ function pi(t) {
  * there is no useful information to store as the value. The raw (unencoded)
  * path cannot be stored because IndexedDb doesn't store prototype
  * information.
- */ var Ei = {}, Ti = [ "prefixPath", "collectionGroup", "readTime", "documentId" ], Si = [ "prefixPath", "collectionGroup", "documentId" ], _i = [ "collectionGroup", "readTime", "prefixPath", "documentId" ], Di = [ "canonicalId", "targetId" ], xi = [ "targetId", "path" ], Ai = [ "path", "targetId" ], Ni = [ "collectionId", "parent" ], Ci = [ "indexId", "uid" ], ki = [ "uid", "sequenceNumber" ], Fi = [ "indexId", "uid", "arrayValue", "directionalValue", "orderedDocumentKey", "documentKey" ], Oi = [ "indexId", "uid", "orderedDocumentKey" ], Ri = [ "userId", "collectionPath", "documentId" ], Vi = [ "userId", "collectionPath", "largestBatchId" ], Mi = [ "userId", "collectionGroup", "largestBatchId" ], Li = r(r([], r(r([], r(r([], r(r([], [ "mutationQueues", "mutations", "documentMutations", "remoteDocuments", "targets", "owner", "targetGlobal", "targetDocuments" ], !1), [ "clientMetadata" ], !1), !0), [ "remoteDocumentGlobal" ], !1), !0), [ "collectionParents" ], !1), !0), [ "bundles", "namedQueries" ], !1), Pi = r(r([], Li, !0), [ "documentOverlays" ], !1), qi = [ "mutationQueues", "mutations", "documentMutations", "remoteDocumentsV14", "targets", "owner", "targetGlobal", "targetDocuments", "clientMetadata", "remoteDocumentGlobal", "collectionParents", "bundles", "namedQueries", "documentOverlays" ], Ui = qi, Bi = r(r([], Ui, !0), [ "indexConfiguration", "indexState", "indexEntries" ], !1), Gi = /** @class */ function(e) {
+ */ var Ti = {}, Ei = [ "prefixPath", "collectionGroup", "readTime", "documentId" ], Si = [ "prefixPath", "collectionGroup", "documentId" ], _i = [ "collectionGroup", "readTime", "prefixPath", "documentId" ], Di = [ "canonicalId", "targetId" ], xi = [ "targetId", "path" ], Ai = [ "path", "targetId" ], Ci = [ "collectionId", "parent" ], Ni = [ "indexId", "uid" ], ki = [ "uid", "sequenceNumber" ], Fi = [ "indexId", "uid", "arrayValue", "directionalValue", "orderedDocumentKey", "documentKey" ], Oi = [ "indexId", "uid", "orderedDocumentKey" ], Ri = [ "userId", "collectionPath", "documentId" ], Vi = [ "userId", "collectionPath", "largestBatchId" ], Mi = [ "userId", "collectionGroup", "largestBatchId" ], Li = r(r([], r(r([], r(r([], r(r([], [ "mutationQueues", "mutations", "documentMutations", "remoteDocuments", "targets", "owner", "targetGlobal", "targetDocuments" ], !1), [ "clientMetadata" ], !1), !0), [ "remoteDocumentGlobal" ], !1), !0), [ "collectionParents" ], !1), !0), [ "bundles", "namedQueries" ], !1), Pi = r(r([], Li, !0), [ "documentOverlays" ], !1), qi = [ "mutationQueues", "mutations", "documentMutations", "remoteDocumentsV14", "targets", "owner", "targetGlobal", "targetDocuments", "clientMetadata", "remoteDocumentGlobal", "collectionParents", "bundles", "namedQueries", "documentOverlays" ], Ui = qi, Bi = r(r([], Ui, !0), [ "indexConfiguration", "indexState", "indexEntries" ], !1), Gi = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).se = t, r.currentSequenceNumber = n, r;
@@ -6243,7 +6261,7 @@ function pi(t) {
  * limitations under the License.
  */ function Ki(t, e) {
     var n = G(t);
-    return Nt.M(n.se, e);
+    return Ct.M(n.se, e);
 }
 
 /**
@@ -6362,7 +6380,7 @@ function pi(t) {
     }
     return t.from = function(e, n, r) {
         U(e.mutations.length === r.length);
-        for (var i = Tr, o = e.mutations, u = 0; u < o.length; u++) i = i.insert(o[u].key, r[u].version);
+        for (var i = Er, o = e.mutations, u = 0; u < o.length; u++) i = i.insert(o[u].key, r[u].version);
         return new t(e, n, r, i);
     }, t;
 }(), zi = /** @class */ function() {
@@ -6442,7 +6460,8 @@ function pi(t) {
         return {
             name: Wr(t, e.key),
             fields: e.data.value.mapValue.fields,
-            updateTime: Br(t, e.version.toTimestamp())
+            updateTime: Br(t, e.version.toTimestamp()),
+            createTime: Br(t, e.createTime.toTimestamp())
         };
     }(t.ie, e); else if (e.isNoDocument()) r.noDocument = {
         path: n.path.toArray(),
@@ -6538,7 +6557,7 @@ function eo(t, e) {
         parent: t.parent,
         structuredQuery: t.structuredQuery
     });
-    return "LAST" === t.limitType ? Tn(e, e.limit, "L" /* LimitType.Last */) : e;
+    return "LAST" === t.limitType ? En(e, e.limit, "L" /* LimitType.Last */) : e;
 }
 
 /** Encodes a NamedQuery proto object to a NamedQuery model object. */
@@ -7087,7 +7106,7 @@ function Io(t, e) {
  * where('a', '>=', 'a').orderBy('a').orderBy('b')     | a ASC
  * where('a', 'array-contains', 'a').orderBy('b')      | a CONTAINS, b ASCENDING
  * where('a', 'array-contains', 'a').orderBy('b')      | a CONTAINS
- */ var Eo = /** @class */ function() {
+ */ var To = /** @class */ function() {
     function t(t) {
         this.collectionId = null != t.collectionGroup ? t.collectionGroup : t.path.lastSegment(), 
         this.Ke = t.orderBy, this.Ge = [];
@@ -7180,23 +7199,23 @@ function Io(t, e) {
  * The `in` filter is only a syntactic sugar over a disjunction of equalities. For instance: `a in
  * [1,2,3]` is in fact `a==1 || a==2 || a==3`. This method expands any `in` filter in the given
  * input into a disjunction of equality filters and returns the expanded filter.
- */ function To(t) {
+ */ function Eo(t) {
     var e, n;
-    if (U(t instanceof Ae || t instanceof Ne), t instanceof Ae) {
+    if (U(t instanceof Ae || t instanceof Ce), t instanceof Ae) {
         if (t instanceof Ke) {
             var r = (null === (n = null === (e = t.value.arrayValue) || void 0 === e ? void 0 : e.values) || void 0 === n ? void 0 : n.map((function(e) {
                 return Ae.create(t.field, "==" /* Operator.EQUAL */ , e);
             }))) || [];
-            return Ne.create(r, "or" /* CompositeOperator.OR */);
+            return Ce.create(r, "or" /* CompositeOperator.OR */);
         }
         // We have reached other kinds of field filters.
                 return t;
     }
     // We have a composite filter.
         var i = t.filters.map((function(t) {
-        return To(t);
+        return Eo(t);
     }));
-    return Ne.create(i, t.op);
+    return Ce.create(i, t.op);
 }
 
 /**
@@ -7211,7 +7230,7 @@ function Io(t, e) {
  * @return the terms in the DNF transform.
  */ function So(t) {
     if (0 === t.getFilters().length) return [];
-    var e = Ao(To(t));
+    var e = Ao(Eo(t));
     return U(xo(e)), _o(e) || Do(e) ? [ e ] : e.getFilters()
     /** Returns true if the given filter is a single field filter. e.g. (a == 10). */;
 }
@@ -7224,7 +7243,7 @@ function _o(t) {
  * Returns true if the given filter is the conjunction of one or more field filters. e.g. (a == 10
  * && b == 20)
  */ function Do(t) {
-    return t instanceof Ne && Fe(t);
+    return t instanceof Ce && Fe(t);
 }
 
 /**
@@ -7241,7 +7260,7 @@ function _o(t) {
      * field filters. e.g. (a == 10) || (b==20 && c==30)
      */
     function(t) {
-        if (t instanceof Ne && ke(t)) {
+        if (t instanceof Ce && ke(t)) {
             for (var e = 0, n = t.getFilters(); e < n.length; e++) {
                 var r = n[e];
                 if (!_o(r) && !Do(r)) return !1;
@@ -7253,55 +7272,55 @@ function _o(t) {
 }
 
 function Ao(t) {
-    if (U(t instanceof Ae || t instanceof Ne), t instanceof Ae) return t;
+    if (U(t instanceof Ae || t instanceof Ce), t instanceof Ae) return t;
     if (1 === t.filters.length) return Ao(t.filters[0]);
     // Compute DNF for each of the subfilters first
         var e = t.filters.map((function(t) {
         return Ao(t);
-    })), n = Ne.create(e, t.op);
-    return xo(n = ko(n)) ? n : (U(n instanceof Ne), U(Ce(n)), U(n.filters.length > 1), 
+    })), n = Ce.create(e, t.op);
+    return xo(n = ko(n)) ? n : (U(n instanceof Ce), U(Ne(n)), U(n.filters.length > 1), 
     n.filters.reduce((function(t, e) {
-        return No(t, e);
+        return Co(t, e);
     })));
 }
 
-function No(t, e) {
+function Co(t, e) {
     var n;
-    return U(t instanceof Ae || t instanceof Ne), U(e instanceof Ae || e instanceof Ne), 
+    return U(t instanceof Ae || t instanceof Ce), U(e instanceof Ae || e instanceof Ce), 
     // FieldFilter FieldFilter
     n = t instanceof Ae ? e instanceof Ae ? function(t, e) {
         // Conjunction distribution for two field filters is the conjunction of them.
-        return Ne.create([ t, e ], "and" /* CompositeOperator.AND */);
-    }(t, e) : Co(t, e) : e instanceof Ae ? Co(e, t) : function(t, e) {
+        return Ce.create([ t, e ], "and" /* CompositeOperator.AND */);
+    }(t, e) : No(t, e) : e instanceof Ae ? No(e, t) : function(t, e) {
         // There are four cases:
         // (A & B) & (C & D) --> (A & B & C & D)
         // (A & B) & (C | D) --> (A & B & C) | (A & B & D)
         // (A | B) & (C & D) --> (C & D & A) | (C & D & B)
         // (A | B) & (C | D) --> (A & C) | (A & D) | (B & C) | (B & D)
         // Case 1 is a merge.
-        if (U(t.filters.length > 0 && e.filters.length > 0), Ce(t) && Ce(e)) return Me(t, e.getFilters());
+        if (U(t.filters.length > 0 && e.filters.length > 0), Ne(t) && Ne(e)) return Me(t, e.getFilters());
         // Case 2,3,4 all have at least one side (lhs or rhs) that is a disjunction. In all three cases
         // we should take each element of the disjunction and distribute it over the other side, and
         // return the disjunction of the distribution results.
                 var n = ke(t) ? t : e, r = ke(t) ? e : t, i = n.filters.map((function(t) {
-            return No(t, r);
+            return Co(t, r);
         }));
-        return Ne.create(i, "or" /* CompositeOperator.OR */);
+        return Ce.create(i, "or" /* CompositeOperator.OR */);
     }(t, e), ko(n);
 }
 
-function Co(t, e) {
+function No(t, e) {
     // There are two cases:
     // A & (B & C) --> (A & B & C)
     // A & (B | C) --> (A & B) | (A & C)
-    if (Ce(e)) 
+    if (Ne(e)) 
     // Case 1
     return Me(e, t.getFilters());
     // Case 2
     var n = e.filters.map((function(e) {
-        return No(t, e);
+        return Co(t, e);
     }));
-    return Ne.create(n, "or" /* CompositeOperator.OR */);
+    return Ce.create(n, "or" /* CompositeOperator.OR */);
 }
 
 /**
@@ -7314,7 +7333,7 @@ function Co(t, e) {
  *
  * <p>For more info, visit: https://en.wikipedia.org/wiki/Associative_property#Propositional_logic
  */ function ko(t) {
-    if (U(t instanceof Ae || t instanceof Ne), t instanceof Ae) return t;
+    if (U(t instanceof Ae || t instanceof Ce), t instanceof Ae) return t;
     var e = t.getFilters();
     // If the composite filter only contains 1 filter, apply associativity to it.
         if (1 === e.length) return ko(e[0]);
@@ -7333,7 +7352,7 @@ function Co(t, e) {
     // Note that the `compositeSubfilter` has been eliminated, and its filters (B, C, D) have been
     // added to the top-level "compositeFilter".
         return n.forEach((function(e) {
-        e instanceof Ae ? r.push(e) : e instanceof Ne && (e.op === t.op ? 
+        e instanceof Ae ? r.push(e) : e instanceof Ce && (e.op === t.op ? 
         // compositeFilter: (A | (B | C))
         // compositeSubfilter: (B | C)
         // Result: (A | B | C)
@@ -7346,7 +7365,7 @@ function Co(t, e) {
         // compositeSubfilter: (B & C)
         // Result: (A | (B & C))
         r.push(e));
-    })), 1 === r.length ? r[0] : Ne.create(r, t.op)
+    })), 1 === r.length ? r[0] : Ce.create(r, t.op)
     /**
  * @license
  * Copyright 2019 Google LLC
@@ -7395,9 +7414,9 @@ var Fo = /** @class */ function() {
         // Field indices are not supported with memory persistence.
         return xt.resolve(null);
     }, t.prototype.getMinOffset = function(t, e) {
-        return xt.resolve(Et.min());
+        return xt.resolve(Tt.min());
     }, t.prototype.getMinOffsetFromCollectionGroup = function(t, e) {
-        return xt.resolve(Et.min());
+        return xt.resolve(Tt.min());
     }, t.prototype.updateCollectionGroup = function(t, e, n) {
         // Field indices are not supported with memory persistence.
         return xt.resolve();
@@ -7595,7 +7614,7 @@ var Fo = /** @class */ function() {
         }));
     }, t.prototype.Ze = function(t) {
         var e = this.Xe.get(t);
-        return e || (e = 0 === t.filters.length ? [ t ] : So(Ne.create(t.filters, "and" /* CompositeOperator.AND */)).map((function(e) {
+        return e || (e = 0 === t.filters.length ? [ t ] : So(Ce.create(t.filters, "and" /* CompositeOperator.AND */)).map((function(e) {
             return un(t.path, t.collectionGroup, t.orderBy, e.getFilters(), t.limit, t.startAt, t.endAt);
         })), this.Xe.set(t, e), e);
     }, 
@@ -7626,7 +7645,7 @@ var Fo = /** @class */ function() {
         var i = new wo(t, ft.empty(), e, n);
         return r ? i.Ue() : i;
     }, t.prototype.tn = function(t, e) {
-        var n = new Eo(e), r = null != e.collectionGroup ? e.collectionGroup : e.path.lastSegment();
+        var n = new To(e), r = null != e.collectionGroup ? e.collectionGroup : e.path.lastSegment();
         return this.getFieldIndexes(t, r).next((function(t) {
             for (
             // Return the index with the most number of segments.
@@ -7751,7 +7770,7 @@ var Fo = /** @class */ function() {
             return xt.forEach(t, (function(t) {
                 return i.get([ t.indexId, n.uid ]).next((function(n) {
                     e.push(function(t, e) {
-                        var n = e ? new wt(e.sequenceNumber, new Et(Ji(e.readTime), new ft(gi(e.documentKey)), e.largestBatchId)) : wt.empty(), r = t.fields.map((function(t) {
+                        var n = e ? new wt(e.sequenceNumber, new Tt(Ji(e.readTime), new ft(gi(e.documentKey)), e.largestBatchId)) : wt.empty(), r = t.fields.map((function(t) {
                             var e = t[0], n = t[1];
                             return new mt(ht.fromServerFormat(e), n);
                         }));
@@ -7962,9 +7981,9 @@ function Uo(t) {
     U(0 !== t.length);
     for (var e = t[0].indexState.offset, n = e.largestBatchId, r = 1; r < t.length; r++) {
         var i = t[r].indexState.offset;
-        Tt(i, e) < 0 && (e = i), n < i.largestBatchId && (n = i.largestBatchId);
+        Et(i, e) < 0 && (e = i), n < i.largestBatchId && (n = i.largestBatchId);
     }
-    return new Et(e.readTime, e.documentKey, n);
+    return new Tt(e.readTime, e.documentKey, n);
 }
 
 /**
@@ -8147,7 +8166,7 @@ var Qo = /** @class */ function() {
                 return rt(t.canonicalString(), e.canonicalString());
             })), f = 0, d = r; f < d.length; f++) {
                 var p = d[f], y = Ii(i.userId, p.key.path, a);
-                h = h.add(p.key.path.popLast()), l.push(u.put(c)), l.push(o.put(y, Ei));
+                h = h.add(p.key.path.popLast()), l.push(u.put(c)), l.push(o.put(y, Ti));
             }
             return h.forEach((function(e) {
                 l.push(i.indexManager.addToCollectionParentIndex(t, e));
@@ -9162,7 +9181,7 @@ function Jo(t) {
             return e;
         }));
     }, t.prototype.getAllFromCollectionGroup = function(t, e, n, r) {
-        var i = this, o = vr(), u = pu(e, n), a = pu(e, Et.max());
+        var i = this, o = vr(), u = pu(e, n), a = pu(e, Tt.max());
         return fu(t).Z({
             index: "collectionGroupIndex",
             range: IDBKeyRange.bound(u, a, !0)
@@ -9434,7 +9453,7 @@ e) {
     return t.prototype.getDocument = function(t, e) {
         var n = this, r = null;
         return this.documentOverlayCache.getOverlay(t, e).next((function(i) {
-            return r = i, n.getBaseDocument(t, e, r);
+            return r = i, n.remoteDocumentCache.getEntry(t, e);
         })).next((function(t) {
             return null !== r && $n(r.mutation, t, tn.empty(), ut.now()), t;
         }));
@@ -9514,7 +9533,7 @@ e) {
      * @return A map represents the local documents view.
      */
     t.prototype.computeViews = function(t, e, n, r) {
-        var i = vr(), o = Er(), u = Er();
+        var i = vr(), o = Tr(), u = Tr();
         return e.forEach((function(t, e) {
             var u = n.get(e.key);
             // Recalculate an overlay if the document's existence state changed due to
@@ -9535,7 +9554,7 @@ e) {
             })), u;
         }));
     }, t.prototype.recalculateAndSaveOverlays = function(t, e) {
-        var n = this, r = Er(), i = new He((function(t, e) {
+        var n = this, r = Tr(), i = new He((function(t, e) {
             return t - e;
         })), o = _r();
         return this.mutationQueue.getAllMutationBatchesAffectingDocumentKeys(t, e).next((function(t) {
@@ -9620,7 +9639,7 @@ e) {
             // the batch id.
                         return u.next((function(e) {
                 return xt.forEach(e, (function(e, n) {
-                    return a < n.largestBatchId && (a = n.largestBatchId), o.get(e) ? xt.resolve() : i.getBaseDocument(t, e, n).next((function(t) {
+                    return a < n.largestBatchId && (a = n.largestBatchId), o.get(e) ? xt.resolve() : i.remoteDocumentCache.getEntry(t, e).next((function(t) {
                         s = s.insert(e, t);
                     }));
                 })).next((function() {
@@ -9679,9 +9698,6 @@ e) {
                 xn(e, i) && (n = n.insert(r, i));
             })), n;
         }));
-    }, 
-    /** Returns a base document that can be used to apply `overlay`. */ t.prototype.getBaseDocument = function(t, e, n) {
-        return null === n || 1 /* MutationType.Patch */ === n.mutation.type ? this.remoteDocumentCache.getEntry(t, e) : xt.resolve(rn.newInvalidDocument(e));
     }, t;
 }(), gu = /** @class */ function() {
     function t(t) {
@@ -9838,7 +9854,7 @@ e) {
     /** Compare by ID then by key */ t.os = function(t, e) {
         return rt(t._s, e._s) || ft.comparator(t.key, e.key);
     }, t;
-}(), Eu = /** @class */ function() {
+}(), Tu = /** @class */ function() {
     function t(t, e) {
         this.indexManager = t, this.referenceDelegate = e, 
         /**
@@ -9972,7 +9988,7 @@ e) {
         var e = this.ps(t);
         return e < 0 || e >= this.mutationQueue.length ? null : this.mutationQueue[e];
     }, t;
-}(), Tu = /** @class */ function() {
+}(), Eu = /** @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
@@ -10026,7 +10042,7 @@ e) {
         ; o.hasNext(); ) {
             var u = o.getNext(), a = u.key, s = u.value.document;
             if (!e.isPrefixOf(a.path)) break;
-            a.path.length > e.length + 1 || Tt(It(s), n) <= 0 || (r = r.insert(s.key, s.mutableCopy()));
+            a.path.length > e.length + 1 || Et(It(s), n) <= 0 || (r = r.insert(s.key, s.mutableCopy()));
         }
         return xt.resolve(r);
     }, t.prototype.getAllFromCollectionGroup = function(t, e, n, r) {
@@ -10144,7 +10160,7 @@ e) {
         var n = this;
         this.Vs = {}, this.overlays = {}, this.Ss = new qt(0), this.Ds = !1, this.Ds = !0, 
         this.referenceDelegate = t(this), this.Cs = new _u(this), this.indexManager = new Fo, 
-        this.remoteDocumentCache = new Tu((function(t) {
+        this.remoteDocumentCache = new Eu((function(t) {
             return n.referenceDelegate.xs(t);
         })), this.yt = new Hi(e), this.Ns = new gu(this.yt);
     }
@@ -10172,7 +10188,7 @@ e) {
         return e || (e = new wu, this.overlays[t.toKey()] = e), e;
     }, t.prototype.getMutationQueue = function(t, e) {
         var n = this.Vs[t.toKey()];
-        return n || (n = new Eu(e, this.referenceDelegate), this.Vs[t.toKey()] = n), n;
+        return n || (n = new Tu(e, this.referenceDelegate), this.Vs[t.toKey()] = n), n;
     }, t.prototype.getTargetCache = function() {
         return this.Cs;
     }, t.prototype.getRemoteDocumentCache = function() {
@@ -10270,7 +10286,7 @@ e) {
             return n.persistence.Ms(t, e);
         } ]);
     }, t;
-}(), Nu = /** @class */ function() {
+}(), Cu = /** @class */ function() {
     function t(t) {
         this.yt = t;
     }
@@ -10293,7 +10309,7 @@ e) {
             }).createIndex("userMutationsIndex", wi, {
                 unique: !0
             }), t.createObjectStore("documentMutations");
-        }(t), Cu(t), function(t) {
+        }(t), Nu(t), function(t) {
             t.createObjectStore("remoteDocuments");
         }(t));
         // Migration 2 to populate the targetGlobal object no longer needed since
@@ -10304,7 +10320,7 @@ e) {
         // potentially have corrupt data.
         0 !== n && (function(t) {
             t.deleteObjectStore("targetDocuments"), t.deleteObjectStore("targets"), t.deleteObjectStore("targetGlobal");
-        }(t), Cu(t)), u = u.next((function() {
+        }(t), Nu(t)), u = u.next((function() {
             /**
      * Creates the target global singleton row.
      *
@@ -10392,7 +10408,7 @@ e) {
         }))), n < 13 && r >= 13 && (u = u.next((function() {
             return function(t) {
                 var e = t.createObjectStore("remoteDocumentsV14", {
-                    keyPath: Ti
+                    keyPath: Ei
                 });
                 e.createIndex("documentKeyIndex", Si), e.createIndex("collectionGroupIndex", _i);
             }(t);
@@ -10410,7 +10426,7 @@ e) {
                 }).createIndex("collectionGroupIndex", "collectionGroup", {
                     unique: !1
                 }), t.createObjectStore("indexState", {
-                    keyPath: Ci
+                    keyPath: Ni
                 }).createIndex("sequenceNumberIndex", ki, {
                     unique: !1
                 }), t.createObjectStore("indexEntries", {
@@ -10473,7 +10489,7 @@ e) {
     }, t.prototype.Qs = function(t, e) {
         // Create the index.
         t.createObjectStore("collectionParents", {
-            keyPath: Ni
+            keyPath: Ci
         });
         var n = e.store("collectionParents"), r = new Oo, i = function(t) {
             if (r.add(t)) {
@@ -10535,7 +10551,7 @@ e) {
                     return i = i.add(t);
                 })), r.set(t.userId, i);
             })), xt.forEach(r, (function(t, r) {
-                var u = new C(r), a = co.re(n.yt, u), s = o.getIndexManager(u), c = Qo.re(u, n.yt, s, o.referenceDelegate);
+                var u = new N(r), a = co.re(n.yt, u), s = o.getIndexManager(u), c = Qo.re(u, n.yt, s, o.referenceDelegate);
                 return new mu(i, c, a, s).recalculateAndSaveOverlaysForDocumentKeys(new Gi(e, qt.at), t).next();
             }));
         }));
@@ -10563,7 +10579,7 @@ e) {
  * have a cached version in remoteDocumentCache or local mutations for the
  * document). The view is computed by applying the mutations in the
  * MutationQueue to the RemoteDocumentCache.
- */ function Cu(t) {
+ */ function Nu(t) {
     t.createObjectStore("targetDocuments", {
         keyPath: xi
     }).createIndex("documentTargetsIndex", Ai, {
@@ -10605,7 +10621,7 @@ var ku = "Failed to obtain exclusive access to the persistence layer. To allow s
             return Promise.resolve();
         }, !t.C()) throw new j(K.UNIMPLEMENTED, "This platform is either missing IndexedDB or is known to have an incomplete implementation. Offline persistence has been disabled.");
         this.referenceDelegate = new ou(this, i), this.ii = n + "main", this.yt = new Hi(s), 
-        this.ri = new Nt(this.ii, this.Xs, new Nu(this.yt)), this.Cs = new Zo(this.referenceDelegate, this.yt), 
+        this.ri = new Ct(this.ii, this.Xs, new Cu(this.yt)), this.Cs = new Zo(this.referenceDelegate, this.yt), 
         this.remoteDocumentCache = cu(this.yt), this.Ns = new uo, this.window && this.window.localStorage ? this.oi = this.window.localStorage : (this.oi = null, 
         !1 === l && M("IndexedDbPersistence", "LocalStorage is unavailable. As a result, persistence may not work reliably. In particular enablePersistence() could fail immediately after refreshing the page."));
     }
@@ -10992,7 +11008,7 @@ var ku = "Failed to obtain exclusive access to the persistence layer. To allow s
         };
         return Ou(t).put("owner", e);
     }, t.C = function() {
-        return Nt.C();
+        return Ct.C();
     }, 
     /** Checks the primary lease and removes it if we are the current primary. */ t.prototype._i = function(t) {
         var e = this, n = Ou(t);
@@ -11233,12 +11249,12 @@ var Mu = /** @class */ function() {
             // may return the correct set of documents in the wrong order (e.g. if
             // the index doesn't include a segment for one of the orderBys).
             // Therefore, a limit should not be applied in such cases.
-            e = Tn(e, null, "F" /* LimitType.First */), r = In(e)), n.indexManager.getDocumentsMatchingTarget(t, r).next((function(i) {
+            e = En(e, null, "F" /* LimitType.First */), r = In(e)), n.indexManager.getDocumentsMatchingTarget(t, r).next((function(i) {
                 var o = _r.apply(void 0, i);
                 return n.Ni.getDocuments(t, o).next((function(i) {
                     return n.indexManager.getMinOffset(t, r).next((function(r) {
                         var u = n.Fi(e, i);
-                        return n.$i(e, u, o, r.readTime) ? n.ki(t, Tn(e, null, "F" /* LimitType.First */)) : n.Bi(t, u, e, r);
+                        return n.$i(e, u, o, r.readTime) ? n.ki(t, En(e, null, "F" /* LimitType.First */)) : n.Bi(t, u, e, r);
                     }));
                 }));
             })));
@@ -11261,7 +11277,7 @@ var Mu = /** @class */ function() {
     /** Applies the query filter and sorting to the provided documents.  */ t.prototype.Fi = function(t, e) {
         // Sort the documents and re-apply the query filter since previously
         // matching documents do not necessarily still match the query.
-        var n = new Ze(Nn(t));
+        var n = new Ze(Cn(t));
         return e.forEach((function(e, r) {
             xn(t, r) && (n = n.add(r));
         })), n;
@@ -11298,7 +11314,7 @@ var Mu = /** @class */ function() {
         return !!i && (i.hasPendingWrites || i.version.compareTo(r) > 0);
     }, t.prototype.Mi = function(t, e) {
         return O() <= h.DEBUG && V("QueryEngine", "Using full collection scan to execute query:", Dn(e)), 
-        this.Ni.getDocumentsMatchingQuery(t, e, Et.min());
+        this.Ni.getDocumentsMatchingQuery(t, e, Tt.min());
     }, 
     /**
      * Combines the results from an indexed execution with the remaining documents
@@ -12247,7 +12263,7 @@ var ra = /** @class */ function() {
      */
     t.prototype.Dr = function(t, e) {
         var n = this.dr.exec(t), r = Number(n[1]), i = void 0 !== n[2] ? n[2] : null;
-        return ra.Zi(new C(i), r, e);
+        return ra.Zi(new N(i), r, e);
     }, 
     /**
      * Parses a query target state from WebStorage. Returns 'null' if the value
@@ -12409,16 +12425,16 @@ var ra = /** @class */ function() {
             u.setWithCredentials(!0), u.listenOnce(I.COMPLETE, (function() {
                 try {
                     switch (u.getLastErrorCode()) {
-                      case E.NO_ERROR:
+                      case T.NO_ERROR:
                         var e = u.getResponseJson();
                         V("Connection", "XHR received:", JSON.stringify(e)), i(e);
                         break;
 
-                      case E.TIMEOUT:
+                      case T.TIMEOUT:
                         V("Connection", 'RPC "' + t + '" timed out'), o(new j(K.DEADLINE_EXCEEDED, "Request time out"));
                         break;
 
-                      case E.HTTP_ERROR:
+                      case T.HTTP_ERROR:
                         var n = u.getStatus();
                         if (V("Connection", 'RPC "' + t + '" failed with status:', n, "response text:", u.getResponseText()), 
                         n > 0) {
@@ -12449,7 +12465,7 @@ var ra = /** @class */ function() {
             u.send(e, "POST", a, n, 15);
         }));
     }, n.prototype.wo = function(t, e, n) {
-        var r = [ this.oo, "/", "google.firestore.v1.Firestore", "/", t, "/channel" ], i = T(), o = S(), u = {
+        var r = [ this.oo, "/", "google.firestore.v1.Firestore", "/", t, "/channel" ], i = E(), o = S(), u = {
             // Required for backend stickiness, routing behavior is based on this
             // parameter.
             httpSessionIdParam: "gsessionid",
@@ -13034,31 +13050,31 @@ function ya() {
                 e.documentChange;
                 var s = e.documentChange;
                 s.document, s.document.name, s.document.updateTime;
-                var c = Hr(t, s.document.name), l = jr(s.document.updateTime), h = new en({
+                var c = Hr(t, s.document.name), l = jr(s.document.updateTime), h = s.document.createTime ? jr(s.document.createTime) : at.min(), f = new en({
                     mapValue: {
                         fields: s.document.fields
                     }
-                }), f = rn.newFoundDocument(c, l, h), d = s.targetIds || [], p = s.removedTargetIds || [];
-                n = new Cr(d, p, f.key, f);
+                }), d = rn.newFoundDocument(c, l, h, f), p = s.targetIds || [], y = s.removedTargetIds || [];
+                n = new Nr(p, y, d.key, d);
             } else if ("documentDelete" in e) {
                 e.documentDelete;
-                var y = e.documentDelete;
-                y.document;
-                var v = Hr(t, y.document), m = y.readTime ? jr(y.readTime) : at.min(), g = rn.newNoDocument(v, m), w = y.removedTargetIds || [];
-                n = new Cr([], w, g.key, g);
+                var v = e.documentDelete;
+                v.document;
+                var m = Hr(t, v.document), g = v.readTime ? jr(v.readTime) : at.min(), w = rn.newNoDocument(m, g), b = v.removedTargetIds || [];
+                n = new Nr([], b, w.key, w);
             } else if ("documentRemove" in e) {
                 e.documentRemove;
-                var b = e.documentRemove;
-                b.document;
-                var I = Hr(t, b.document), E = b.removedTargetIds || [];
-                n = new Cr([], E, I, null);
+                var I = e.documentRemove;
+                I.document;
+                var T = Hr(t, I.document), E = I.removedTargetIds || [];
+                n = new Nr([], E, T, null);
             } else {
                 if (!("filter" in e)) return q();
                 e.filter;
-                var T = e.filter;
-                T.targetId;
-                var S = T.count || 0, _ = new hr(S), D = T.targetId;
-                n = new kr(D, _);
+                var S = e.filter;
+                S.targetId;
+                var _ = S.count || 0, D = new hr(_), x = S.targetId;
+                n = new kr(x, D);
             }
             return n;
         }(this.yt, t), n = function(t) {
@@ -13194,7 +13210,7 @@ function ya() {
         };
         this.Bo(n);
     }, n;
-}(wa), Ea = /** @class */ function(e) {
+}(wa), Ta = /** @class */ function(e) {
     function n(t, n, r, i) {
         var o = this;
         return (o = e.call(this) || this).authCredentials = t, o.appCheckCredentials = n, 
@@ -13286,7 +13302,7 @@ function ya() {
  * then we set the OnlineState to Offline, and the client will behave as if
  * it is offline (get()s will return cached data, etc.).
  */
-var Ta = /** @class */ function() {
+var Ea = /** @class */ function() {
     function t(t, e) {
         this.asyncQueue = t, this.onlineStateHandler = e, 
         /** The current OnlineState. */
@@ -13439,7 +13455,7 @@ r, i, o, u) {
                 }));
             }));
         }));
-    })), this.gu = new Ta(i, o);
+    })), this.gu = new Ea(i, o);
 };
 
 /**
@@ -13518,7 +13534,7 @@ r, i, o, u) {
     // Mark this as something the client is currently listening for.
     n.du.set(e.targetId, e), Fa(n) ? 
     // The listen will be sent in onWatchStreamOpen
-    ka(n) : Ya(n).ko() && Na(n, e));
+    ka(n) : Ya(n).ko() && Ca(n, e));
 }
 
 /**
@@ -13526,7 +13542,7 @@ r, i, o, u) {
  * not being listened to.
  */ function Aa(t, e) {
     var n = G(t), r = Ya(n);
-    n.du.delete(e), r.ko() && Ca(n, e), 0 === n.du.size && (r.ko() ? r.Fo() : Oa(n) && 
+    n.du.delete(e), r.ko() && Na(n, e), 0 === n.du.size && (r.ko() ? r.Fo() : Oa(n) && 
     // Revert to OnlineState.Unknown if the watch stream is not open and we
     // have no listeners, since without any listens to send we cannot
     // confirm if the stream is healthy and upgrade to OnlineState.Online.
@@ -13536,7 +13552,7 @@ r, i, o, u) {
 /**
  * We need to increment the the expected number of pending responses we're due
  * from watch so we wait for the ack to process any messages from this target.
- */ function Na(t, e) {
+ */ function Ca(t, e) {
     t.yu.Ot(e.targetId), Ya(t).zo(e)
     /**
  * We need to increment the expected number of pending responses we're due
@@ -13545,7 +13561,7 @@ r, i, o, u) {
  */;
 }
 
-function Ca(t, e) {
+function Na(t, e) {
     t.yu.Ot(e), Ya(t).Ho(e);
 }
 
@@ -13580,7 +13596,7 @@ function Va(t) {
     return e(this, void 0, void 0, (function() {
         return n(this, (function(e) {
             return t.du.forEach((function(e, n) {
-                Na(t, e);
+                Ca(t, e);
             })), [ 2 /*return*/ ];
         }));
     }));
@@ -13655,7 +13671,7 @@ function La(t, r, i) {
                 return [ 3 /*break*/ , 13 ];
 
               case 6:
-                if (r instanceof Cr ? t.yu.Kt(r) : r instanceof kr ? t.yu.Jt(r) : t.yu.jt(r), i.isEqual(at.min())) return [ 3 /*break*/ , 13 ];
+                if (r instanceof Nr ? t.yu.Kt(r) : r instanceof kr ? t.yu.Jt(r) : t.yu.jt(r), i.isEqual(at.min())) return [ 3 /*break*/ , 13 ];
                 s.label = 7;
 
               case 7:
@@ -13689,13 +13705,13 @@ function La(t, r, i) {
                             t.du.set(e, n.withResumeToken(Yt.EMPTY_BYTE_STRING, n.snapshotVersion)), 
                             // Cause a hard reset by unwatching and rewatching immediately, but
                             // deliberately don't send a resume token so that we get a full update.
-                            Ca(t, e);
+                            Na(t, e);
                             // Mark the target we send as being on behalf of an existence filter
                             // mismatch, but don't actually retain that in listenTargets. This ensures
                             // that we flag the first re-listen this way without impacting future
                             // listens of this target (that might happen e.g. on reconnect).
                             var r = new Wi(n.target, e, 1 /* TargetPurpose.ExistenceFilterMismatch */ , n.sequenceNumber);
-                            Na(t, r);
+                            Ca(t, r);
                         }
                     })), t.remoteSyncer.applyRemoteEvent(n);
                 }(t, i) ] : [ 3 /*break*/ , 10 ];
@@ -14680,7 +14696,7 @@ function ds(t) {
         /** Documents in the view but not in the remote target */
         this.Ku = _r(), 
         /** Document Keys that have local changes */
-        this.mutatedKeys = _r(), this.Gu = Nn(t), this.Qu = new $a(this.Gu);
+        this.mutatedKeys = _r(), this.Gu = Cn(t), this.Qu = new $a(this.Gu);
     }
     return Object.defineProperty(t.prototype, "ju", {
         /**
@@ -15052,7 +15068,7 @@ function bs(t, r) {
                 /* usePreviousResults= */ !0) ];
 
               case 1:
-                return a = d.sent(), s = new vs(r, a.Hi), c = s.Wu(a.documents), l = Nr.createSynthesizedTargetChangeForCurrentChange(i, o && "Offline" /* OnlineState.Offline */ !== t.onlineState, u), 
+                return a = d.sent(), s = new vs(r, a.Hi), c = s.Wu(a.documents), l = Cr.createSynthesizedTargetChangeForCurrentChange(i, o && "Offline" /* OnlineState.Offline */ !== t.onlineState, u), 
                 h = s.applyChanges(c, 
                 /* updateLimboDocuments= */ t.isPrimaryClient, l), Rs(t, i, h.Xu), f = new ms(r, i, s), 
                 [ 2 /*return*/ , (t.ic.set(r, f), t.rc.has(i) ? t.rc.get(i).push(r) : t.rc.set(i, [ r ]), 
@@ -15062,7 +15078,7 @@ function bs(t, r) {
     }));
 }
 
-/** Stops listening to the query. */ function Es(t, r) {
+/** Stops listening to the query. */ function Ts(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o;
         return n(this, (function(n) {
@@ -15108,7 +15124,7 @@ function bs(t, r) {
  * have completed, *not* when the write was acked by the backend. The
  * userCallback is resolved once the write was acked/rejected by the
  * backend (or failed locally for any other reason).
- */ function Ts(t, r, i) {
+ */ function Es(t, r, i) {
     return e(this, void 0, void 0, (function() {
         var e, o, u, a;
         return n(this, (function(n) {
@@ -15329,7 +15345,7 @@ function xs(t, r) {
                 // raise events immediately (depending on whether the watcher is caught
                 // up), so we raise user callbacks first so that they consistently happen
                 // before listen events.
-                ks(e, i, /*error=*/ null), Cs(e, i), e.sharedClientState.updateMutationState(i, "acknowledged"), 
+                ks(e, i, /*error=*/ null), Ns(e, i), e.sharedClientState.updateMutationState(i, "acknowledged"), 
                 [ 4 /*yield*/ , Ls(e, o) ];
 
               case 3:
@@ -15385,7 +15401,7 @@ function As(t, r, i) {
                 // raise events immediately (depending on whether the watcher is caught up),
                 // so we raise user callbacks first so that they consistently happen before
                 // listen events.
-                ks(e, r, i), Cs(e, r), e.sharedClientState.updateMutationState(r, "rejected", i), 
+                ks(e, r, i), Ns(e, r), e.sharedClientState.updateMutationState(r, "rejected", i), 
                 [ 4 /*yield*/ , Ls(e, o) ];
 
               case 3:
@@ -15411,7 +15427,7 @@ function As(t, r, i) {
 /**
  * Registers a user callback that resolves when all pending mutations at the moment of calling
  * are acknowledged .
- */ function Ns(t, r) {
+ */ function Cs(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o, u, a;
         return n(this, (function(n) {
@@ -15446,7 +15462,7 @@ function As(t, r, i) {
 /**
  * Triggers the callbacks that are waiting for this batch id to get acknowledged by server,
  * if there are any.
- */ function Cs(t, e) {
+ */ function Ns(t, e) {
     (t.lc.get(e) || []).forEach((function(t) {
         t.resolve();
     })), t.lc.delete(e)
@@ -15702,7 +15718,7 @@ function Gs(t, r, i, o) {
                 "acknowledged" === i || "rejected" === i ? (
                 // NOTE: Both these methods are no-ops for batches that originated from
                 // other clients.
-                ks(e, r, o || null), Cs(e, r), function(t, e) {
+                ks(e, r, o || null), Ns(e, r), function(t, e) {
                     G(G(t).mutationQueue).An(e);
                 }(e.localStore, r)) : q(), n.label = 4;
 
@@ -16287,7 +16303,7 @@ var Js = /** @class */ function() {
     }, t.prototype.createDatastore = function(t) {
         var e, n = ma(t.databaseInfo.databaseId), r = (e = t.databaseInfo, new pa(e));
         /** Return the Platform-specific connectivity monitor. */ return function(t, e, n, r) {
-            return new Ea(t, e, n, r);
+            return new Ta(t, e, n, r);
         }(t.authCredentials, t.appCheckCredentials, r, n);
     }, t.prototype.createRemoteStore = function(t) {
         var e, n, r, i, o, u = this;
@@ -16554,13 +16570,13 @@ function fc(t, e, n, r) {
         ssl: !1
     })), r.mockUserToken) {
         var u, a;
-        if ("string" == typeof r.mockUserToken) u = r.mockUserToken, a = C.MOCK_USER; else {
+        if ("string" == typeof r.mockUserToken) u = r.mockUserToken, a = N.MOCK_USER; else {
             // Let createMockUserToken validate first (catches common mistakes like
             // invalid field "uid" and missing field "sub" / "user_id".)
             u = m(r.mockUserToken, null === (i = t._app) || void 0 === i ? void 0 : i.options.projectId);
             var s = r.mockUserToken.sub || r.mockUserToken.user_id;
             if (!s) throw new j(K.INVALID_ARGUMENT, "mockUserToken must contain 'sub' or 'user_id' field!");
-            a = new C(s);
+            a = new N(s);
         }
         t._authCredentials = new H(new z(u, a));
     }
@@ -16864,7 +16880,7 @@ function Ic(t, r) {
  * A wrapper implementation of Observer<T> that will dispatch events
  * asynchronously. To allow immediate silencing, a mute call is added which
  * causes events scheduled to no longer be raised.
- */ var Ec = /** @class */ function() {
+ */ var Tc = /** @class */ function() {
     function t(t) {
         this.observer = t, 
         /**
@@ -16885,7 +16901,7 @@ function Ic(t, r) {
             n.muted || t(e);
         }), 0);
     }, t;
-}(), Tc = /** @class */ function() {
+}(), Ec = /** @class */ function() {
     function t(
     /** The reader to read from underlying binary bundle data source. */
     t, e) {
@@ -17163,12 +17179,12 @@ function Ic(t, r) {
                                         var n = function(t, e) {
                                             return "found" in e ? function(t, e) {
                                                 U(!!e.found), e.found.name, e.found.updateTime;
-                                                var n = Hr(t, e.found.name), r = jr(e.found.updateTime), i = new en({
+                                                var n = Hr(t, e.found.name), r = jr(e.found.updateTime), i = e.found.createTime ? jr(e.found.createTime) : at.min(), o = new en({
                                                     mapValue: {
                                                         fields: e.found.fields
                                                     }
                                                 });
-                                                return rn.newFoundDocument(n, r, i);
+                                                return rn.newFoundDocument(n, r, i, o);
                                             }(t, e) : "missing" in e ? function(t, e) {
                                                 U(!!e.missing), U(!!e.readTime);
                                                 var n = Hr(t, e.missing), r = jr(e.readTime);
@@ -17346,7 +17362,7 @@ function Ic(t, r) {
         }
         return !1;
     }, t;
-}(), Nc = /** @class */ function() {
+}(), Cc = /** @class */ function() {
     function t(t, r, 
     /**
      * Asynchronous queue responsible for all of our internal processing. When
@@ -17359,7 +17375,7 @@ function Ic(t, r) {
     i, o) {
         var u = this;
         this.authCredentials = t, this.appCheckCredentials = r, this.asyncQueue = i, this.databaseInfo = o, 
-        this.user = C.UNAUTHENTICATED, this.clientId = nt.R(), this.authCredentialListener = function() {
+        this.user = N.UNAUTHENTICATED, this.clientId = nt.R(), this.authCredentialListener = function() {
             return Promise.resolve();
         }, this.appCheckCredentialListener = function() {
             return Promise.resolve();
@@ -17465,7 +17481,7 @@ function Ic(t, r) {
  *
  * Takes a bundle stream or buffer, and presents abstractions to read bundled
  * elements out of the underlying content.
- */ function Cc(t, r) {
+ */ function Nc(t, r) {
     return e(this, void 0, void 0, (function() {
         var i, o, u = this;
         return n(this, (function(a) {
@@ -17539,7 +17555,7 @@ function Fc(t) {
             switch (e.label) {
               case 0:
                 return t.offlineComponents ? [ 3 /*break*/ , 2 ] : (V("FirestoreClient", "Using default OfflineComponentProvider"), 
-                [ 4 /*yield*/ , Cc(t, new Js) ]);
+                [ 4 /*yield*/ , Nc(t, new Js) ]);
 
               case 1:
                 e.sent(), e.label = 2;
@@ -17609,7 +17625,7 @@ function qc(t) {
 
               case 1:
                 return e = n.sent(), [ 2 /*return*/ , ((r = e.eventManager).onListen = bs.bind(null, e.syncEngine), 
-                r.onUnlisten = Es.bind(null, e.syncEngine), r) ];
+                r.onUnlisten = Ts.bind(null, e.syncEngine), r) ];
             }
         }));
     }));
@@ -17626,7 +17642,7 @@ function qc(t) {
                 switch (n.label) {
                   case 0:
                     return e = function(t, e, n, r, i) {
-                        var o = new Ec({
+                        var o = new Tc({
                             next: function(o) {
                                 // Remove query first before passing event to user to avoid
                                 // user actions affecting the now stale query.
@@ -17673,7 +17689,7 @@ function Bc(t, r, i) {
                 switch (n.label) {
                   case 0:
                     return e = function(t, e, n, r, i) {
-                        var o = new Ec({
+                        var o = new Tc({
                             next: function(n) {
                                 // Remove query first before passing event to user to avoid
                                 // user actions affecting the now stale query.
@@ -18102,7 +18118,7 @@ function Xc(t) {
     var e, n = t._freezeSettings(), r = function(t, e, n, r) {
         return new Ut(t, e, n, r.host, r.ssl, r.experimentalForceLongPolling, r.experimentalAutoDetectLongPolling, r.useFetchStreams);
     }(t._databaseId, (null === (e = t._app) || void 0 === e ? void 0 : e.options.appId) || "", t._persistenceKey, n);
-    t._firestoreClient = new Nc(t._authCredentials, t._appCheckCredentials, t._queue, r);
+    t._firestoreClient = new Cc(t._authCredentials, t._appCheckCredentials, t._queue, r);
 }
 
 /**
@@ -18173,7 +18189,7 @@ function Xc(t) {
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    return n.trys.push([ 0, 3, , 4 ]), [ 4 /*yield*/ , Cc(t, i) ];
+                    return n.trys.push([ 0, 3, , 4 ]), [ 4 /*yield*/ , Nc(t, i) ];
 
                   case 1:
                     return n.sent(), [ 4 /*yield*/ , kc(t, r) ];
@@ -18222,7 +18238,7 @@ function tl(t) {
                             return n(this, (function(n) {
                                 switch (n.label) {
                                   case 0:
-                                    return Nt.C() ? (e = t + "main", [ 4 /*yield*/ , Nt.delete(e) ]) : [ 2 /*return*/ , Promise.resolve() ];
+                                    return Ct.C() ? (e = t + "main", [ 4 /*yield*/ , Ct.delete(e) ]) : [ 2 /*return*/ , Promise.resolve() ];
 
                                   case 1:
                                     return n.sent(), [ 2 /*return*/ ];
@@ -18270,7 +18286,7 @@ function el(t) {
                 return n(this, (function(n) {
                     switch (n.label) {
                       case 0:
-                        return e = Ns, [ 4 /*yield*/ , Lc(t) ];
+                        return e = Cs, [ 4 /*yield*/ , Lc(t) ];
 
                       case 1:
                         return [ 2 /*return*/ , e.apply(void 0, [ n.sent(), i ]) ];
@@ -18419,7 +18435,7 @@ function ol(t, r) {
     return function(t, r, i, o) {
         var u = this, a = function(t, e) {
             return function(t, e) {
-                return new Tc(t, e);
+                return new Ec(t, e);
             }(function(t, e) {
                 if (t instanceof Uint8Array) return Ic(t, e);
                 if (t instanceof ArrayBuffer) return Ic(new Uint8Array(t), e);
@@ -18918,7 +18934,7 @@ var Il = /** @class */ function(e) {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function El(t, e, n) {
+ */ function Tl(t, e, n) {
     return new ml({
         sa: 3 /* UserDataSource.Argument */ ,
         fa: e.settings.fa,
@@ -18927,7 +18943,7 @@ var Il = /** @class */ function(e) {
     }, e.databaseId, e.yt, e.ignoreUndefinedProperties);
 }
 
-var Tl = /** @class */ function(e) {
+var El = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -18942,9 +18958,9 @@ var Tl = /** @class */ function(e) {
         return (r = e.call(this, t) || this)._a = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = El(this, t, 
+        var e = Tl(this, t, 
         /*array=*/ !0), n = this._a.map((function(t) {
-            return Cl(t, e);
+            return Nl(t, e);
         })), r = new qn(n);
         return new zn(t.path, r);
     }, n.prototype.isEqual = function(t) {
@@ -18957,9 +18973,9 @@ var Tl = /** @class */ function(e) {
         return (r = e.call(this, t) || this)._a = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = El(this, t, 
+        var e = Tl(this, t, 
         /*array=*/ !0), n = this._a.map((function(t) {
-            return Cl(t, e);
+            return Nl(t, e);
         })), r = new Bn(n);
         return new zn(t.path, r);
     }, n.prototype.isEqual = function(t) {
@@ -18993,7 +19009,7 @@ var Tl = /** @class */ function(e) {
         if (r instanceof Il) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(a); else {
-            var c = Cl(r, s);
+            var c = Nl(r, s);
             null != c && (o.push(a), u.set(a, c));
         }
     }));
@@ -19016,7 +19032,7 @@ var Tl = /** @class */ function(e) {
         if (p instanceof Il) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(d); else {
-            var m = Cl(p, v);
+            var m = Nl(p, v);
             null != m && (l.push(d), h.set(d, m));
         }
     }
@@ -19030,8 +19046,8 @@ var Tl = /** @class */ function(e) {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function Nl(t, e, n, r) {
-    return void 0 === r && (r = !1), Cl(n, t.da(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
+ */ function Cl(t, e, n, r) {
+    return void 0 === r && (r = !1), Nl(n, t.da(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
 }
 
 /**
@@ -19042,7 +19058,7 @@ var Tl = /** @class */ function(e) {
  * the source of the data being parsed, etc.
  * @returns The parsed value, or null if the value was a FieldValue sentinel
  * that should not be included in the resulting parsed data.
- */ function Cl(t, e) {
+ */ function Nl(t, e) {
     if (Fl(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
@@ -19082,7 +19098,7 @@ var Tl = /** @class */ function(e) {
         if (e.settings.oa && 4 /* UserDataSource.ArrayArgument */ !== e.sa) throw e.ha("Nested arrays are not supported");
         return function(t, e) {
             for (var n = [], r = 0, i = 0, o = t; i < o.length; i++) {
-                var u = Cl(o[i], e.aa(r));
+                var u = Nl(o[i], e.aa(r));
                 null == u && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -19149,7 +19165,7 @@ function kl(t, e) {
     // If we encounter an empty object, we explicitly add it to the update
     // mask to ensure that the server creates a map entry.
     e.path && e.path.length > 0 && e.fieldMask.push(e.path) : Kt(t, (function(t, r) {
-        var i = Cl(r, e.ra(t));
+        var i = Nl(r, e.ra(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -19424,7 +19440,7 @@ function Bl(t, e) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
         var e = this._parse(t);
-        return hh(t._query, e), new pc(t.firestore, t.converter, En(t._query, e));
+        return hh(t._query, e), new pc(t.firestore, t.converter, Tn(t._query, e));
     }, n.prototype._parse = function(t) {
         var e = wl(t.firestore), n = function(t, e, n, r, i, o, u) {
             var a;
@@ -19443,7 +19459,7 @@ function Bl(t, e) {
                     };
                 } else a = ch(r, t, u);
             } else "in" /* Operator.IN */ !== o && "not-in" /* Operator.NOT_IN */ !== o && "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ !== o || lh(u, o), 
-            a = Nl(n, "where", u, 
+            a = Cl(n, "where", u, 
             /* allowArrays= */ "in" /* Operator.IN */ === o || "not-in" /* Operator.NOT_IN */ === o);
             return Ae.create(i, o, a);
         }(t._query, 0, e, t.firestore._databaseId, this._field, this._op, this._value);
@@ -19492,15 +19508,15 @@ function Bl(t, e) {
         })).filter((function(t) {
             return t.getFilters().length > 0;
         }));
-        return 1 === e.length ? e[0] : Ne.create(e, this._getOperator());
+        return 1 === e.length ? e[0] : Ce.create(e, this._getOperator());
     }, n.prototype._apply = function(t) {
         var e = this._parse(t);
         return 0 === e.getFilters().length ? t : (function(t, e) {
             for (var n = t, r = 0, i = e.getFlattenedFilters(); r < i.length; r++) {
                 var o = i[r];
-                hh(n, o), n = En(n, o);
+                hh(n, o), n = Tn(n, o);
             }
-        }(t._query, e), new pc(t.firestore, t.converter, En(t._query, e)));
+        }(t._query, e), new pc(t.firestore, t.converter, Tn(t._query, e)));
     }, n.prototype._getQueryConstraints = function() {
         return this._queryConstraints;
     }, n.prototype._getOperator = function() {
@@ -19621,7 +19637,7 @@ var Zl = /** @class */ function(e) {
     return t(n, e), n._create = function(t, e, r) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
-        return new pc(t.firestore, t.converter, Tn(t._query, this._limit, this._limitType));
+        return new pc(t.firestore, t.converter, En(t._query, this._limit, this._limitType));
     }, n;
 }(jl);
 
@@ -19767,7 +19783,7 @@ function ah() {
                 var h = new ft(l);
                 a.push(fe(e, h));
             } else {
-                var f = Nl(n, r, c);
+                var f = Cl(n, r, c);
                 a.push(f);
             }
         }
@@ -20200,7 +20216,7 @@ var vh = /** @class */ function(e) {
  * @param left - A snapshot to compare.
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
- */ function Eh(t, e) {
+ */ function Th(t, e) {
     return t instanceof gh && e instanceof gh ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof bh && e instanceof bh && t._firestore === e._firestore && bc(t.query, e.query) && t.metadata.isEqual(e.metadata) && t._snapshot.isEqual(e._snapshot);
 }
 
@@ -20231,7 +20247,7 @@ var vh = /** @class */ function(e) {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the
  * current document contents.
- */ function Th(t) {
+ */ function Eh(t) {
     t = ac(t, dc);
     var e = ac(t.firestore, zc);
     return Uc(Yc(e), t._key).then((function(n) {
@@ -20399,7 +20415,7 @@ function Ah(t) {
  * server. Returns an error if the network is not available.
  *
  * @returns A `Promise` that will be resolved with the results of the query.
- */ function Nh(t) {
+ */ function Ch(t) {
     t = ac(t, pc);
     var e = ac(t.firestore, zc), n = Yc(e), r = new Sh(e);
     return Bc(n, t._query, {
@@ -20409,7 +20425,7 @@ function Ah(t) {
     }));
 }
 
-function Ch(t, e, n) {
+function Nh(t, e, n) {
     t = ac(t, dc);
     var r = ac(t.firestore, zc), i = yh(t.converter, e, n);
     return Mh(r, [ bl(wl(r), "setDoc", t._key, i, null !== t.converter, n).toMutation(t._key, Hn.none()) ]);
@@ -20485,7 +20501,7 @@ function Rh(t) {
         }, Gl(t._query);
     }
     return function(t, r, i, o) {
-        var u = this, a = new Ec(o), s = new cs(r, a, i);
+        var u = this, a = new Tc(o), s = new cs(r, a, i);
         return t.asyncQueue.enqueueAndForget((function() {
             return e(u, void 0, void 0, (function() {
                 var e;
@@ -20520,7 +20536,7 @@ function Rh(t) {
 
 function Vh(t, r) {
     return function(t, r) {
-        var i = this, o = new Ec(r);
+        var i = this, o = new Tc(r);
         return t.asyncQueue.enqueueAndForget((function() {
             return e(i, void 0, void 0, (function() {
                 var e;
@@ -20574,7 +20590,7 @@ function Vh(t, r) {
                 return n(this, (function(n) {
                     switch (n.label) {
                       case 0:
-                        return e = Ts, [ 4 /*yield*/ , Lc(t) ];
+                        return e = Es, [ 4 /*yield*/ , Lc(t) ];
 
                       case 1:
                         return [ 2 /*return*/ , e.apply(void 0, [ n.sent(), r, o ]) ];
@@ -20973,7 +20989,7 @@ function Vh(t, r) {
  * Returns a sentinel used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link @firebase/firestore/lite#(updateDoc:1)} to
  * include a server-generated timestamp in the written data.
  */ function Wh() {
-    return new Tl("serverTimestamp");
+    return new El("serverTimestamp");
 }
 
 /**
@@ -21158,9 +21174,9 @@ function $h(t, e) {
     return r = Object.assign({
         useFetchStreams: Kh
     }, r), o._setSettings(r), o;
-}), "PUBLIC").setMultipleInstances(!0)), u(N, "3.7.3-canary.3bd031691", void 0), 
+}), "PUBLIC").setMultipleInstances(!0)), u(C, "3.7.3-canary.734fdcd91", void 0), 
 // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation
-u(N, "3.7.3-canary.3bd031691", "esm5");
+u(C, "3.7.3-canary.734fdcd91", "esm5");
 
-export { ph as AbstractUserDataWriter, Sc as AggregateField, _c as AggregateQuerySnapshot, sl as Bytes, Qc as CACHE_SIZE_UNLIMITED, yc as CollectionReference, dc as DocumentReference, gh as DocumentSnapshot, cl as FieldPath, hl as FieldValue, zc as Firestore, j as FirestoreError, fl as GeoPoint, jc as LoadBundleTask, pc as Query, Hl as QueryCompositeFilterConstraint, jl as QueryConstraint, wh as QueryDocumentSnapshot, oh as QueryEndAtConstraint, zl as QueryFieldFilterConstraint, $l as QueryLimitConstraint, Zl as QueryOrderByConstraint, bh as QuerySnapshot, nh as QueryStartAtConstraint, mh as SnapshotMetadata, ut as Timestamp, jh as Transaction, Bh as WriteBatch, Bt as _DatabaseId, ft as _DocumentKey, tt as _EmptyAppCheckTokenProvider, W as _EmptyAuthCredentialsProvider, ht as _FieldPath, ac as _cast, B as _debugAssert, Ht as _isBase64Available, L as _logWarn, rc as _validateIsNotUsedTogether, Oh as addDoc, Ph as aggregateQuerySnapshotEqual, Xl as and, Yh as arrayRemove, Hh as arrayUnion, tl as clearIndexedDbPersistence, vc as collection, mc as collectionGroup, fc as connectFirestoreEmulator, Fh as deleteDoc, zh as deleteField, rl as disableNetwork, gc as doc, ll as documentId, Zc as enableIndexedDbPersistence, Jc as enableMultiTabIndexedDbPersistence, nl as enableNetwork, ah as endAt, uh as endBefore, Yc as ensureFirestoreConfigured, Mh as executeWrite, qh as getCountFromServer, Th as getDoc, _h as getDocFromCache, Dh as getDocFromServer, xh as getDocs, Ah as getDocsFromCache, Nh as getDocsFromServer, Hc as getFirestore, Xh as increment, Wc as initializeFirestore, th as limit, eh as limitToLast, ol as loadBundle, ul as namedQuery, Rh as onSnapshot, Vh as onSnapshotsInSync, Yl as or, Jl as orderBy, Ql as query, bc as queryEqual, wc as refEqual, Qh as runTransaction, Wh as serverTimestamp, Ch as setDoc, Jh as setIndexConfiguration, R as setLogLevel, Eh as snapshotEqual, ih as startAfter, rh as startAt, il as terminate, kh as updateDoc, el as waitForPendingWrites, Wl as where, Zh as writeBatch };
+export { ph as AbstractUserDataWriter, Sc as AggregateField, _c as AggregateQuerySnapshot, sl as Bytes, Qc as CACHE_SIZE_UNLIMITED, yc as CollectionReference, dc as DocumentReference, gh as DocumentSnapshot, cl as FieldPath, hl as FieldValue, zc as Firestore, j as FirestoreError, fl as GeoPoint, jc as LoadBundleTask, pc as Query, Hl as QueryCompositeFilterConstraint, jl as QueryConstraint, wh as QueryDocumentSnapshot, oh as QueryEndAtConstraint, zl as QueryFieldFilterConstraint, $l as QueryLimitConstraint, Zl as QueryOrderByConstraint, bh as QuerySnapshot, nh as QueryStartAtConstraint, mh as SnapshotMetadata, ut as Timestamp, jh as Transaction, Bh as WriteBatch, Bt as _DatabaseId, ft as _DocumentKey, tt as _EmptyAppCheckTokenProvider, W as _EmptyAuthCredentialsProvider, ht as _FieldPath, ac as _cast, B as _debugAssert, Ht as _isBase64Available, L as _logWarn, rc as _validateIsNotUsedTogether, Oh as addDoc, Ph as aggregateQuerySnapshotEqual, Xl as and, Yh as arrayRemove, Hh as arrayUnion, tl as clearIndexedDbPersistence, vc as collection, mc as collectionGroup, fc as connectFirestoreEmulator, Fh as deleteDoc, zh as deleteField, rl as disableNetwork, gc as doc, ll as documentId, Zc as enableIndexedDbPersistence, Jc as enableMultiTabIndexedDbPersistence, nl as enableNetwork, ah as endAt, uh as endBefore, Yc as ensureFirestoreConfigured, Mh as executeWrite, qh as getCountFromServer, Eh as getDoc, _h as getDocFromCache, Dh as getDocFromServer, xh as getDocs, Ah as getDocsFromCache, Ch as getDocsFromServer, Hc as getFirestore, Xh as increment, Wc as initializeFirestore, th as limit, eh as limitToLast, ol as loadBundle, ul as namedQuery, Rh as onSnapshot, Vh as onSnapshotsInSync, Yl as or, Jl as orderBy, Ql as query, bc as queryEqual, wc as refEqual, Qh as runTransaction, Wh as serverTimestamp, Nh as setDoc, Jh as setIndexConfiguration, R as setLogLevel, Th as snapshotEqual, ih as startAfter, rh as startAt, il as terminate, kh as updateDoc, el as waitForPendingWrites, Wl as where, Zh as writeBatch };
 //# sourceMappingURL=index.esm5.js.map