@firebase/firestore 3.4.3 → 3.4.4-canary.0482aa5b7

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

@@ -63,7 +63,7 @@ l.MOCK_USER = new l("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let f = "9.6.3";
+let f = "9.6.5-canary.0482aa5b7";
 
 /**
  * @license
@@ -190,14 +190,14 @@ function p(t, ...n) {
  * given message if it did.
  *
  * Messages are stripped in production builds.
- */ function v(t, n) {
+ */ function b(t, n) {
     t || g();
 }
 
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function b(t, 
+ */ function v(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 n) {
     return t;
@@ -332,7 +332,7 @@ n) {
         }));
     }
     getToken() {
-        return this.auth ? this.auth.getToken().then((t => t ? (v("string" == typeof t.accessToken), 
+        return this.auth ? this.auth.getToken().then((t => t ? (b("string" == typeof t.accessToken), 
         new j(t.accessToken, new l(this.auth.getUid()))) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
@@ -386,7 +386,7 @@ class W {
         }));
     }
     getToken() {
-        return this.appCheck ? this.appCheck.getToken().then((t => t ? (v("string" == typeof t.token), 
+        return this.appCheck ? this.appCheck.getToken().then((t => t ? (b("string" == typeof t.token), 
         new W(t.token)) : null)) : Promise.resolve(null);
     }
     invalidateToken() {}
@@ -447,6 +447,9 @@ class K {
     constructor(t, n) {
         this.projectId = t, this.database = n || "(default)";
     }
+    static empty() {
+        return new K("", "");
+    }
     get isDefaultDatabase() {
         return "(default)" === this.database;
     }
@@ -672,6 +675,9 @@ const Z = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
     static fromName(t) {
         return new nt(X.fromString(t).popFirst(5));
     }
+    static empty() {
+        return new nt(X.emptyPath());
+    }
     /** Returns true if the document is in the specified collectionId. */    hasCollectionId(t) {
         return this.path.length >= 2 && this.path.get(this.path.length - 2) === t;
     }
@@ -1305,15 +1311,15 @@ class gt {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ class vt {
+ */ class bt {
     constructor(t) {
         this.timestamp = t;
     }
     static fromTimestamp(t) {
-        return new vt(t);
+        return new bt(t);
     }
     static min() {
-        return new vt(new gt(0, 0));
+        return new bt(new gt(0, 0));
     }
     compareTo(t) {
         return this.timestamp._compareTo(t.timestamp);
@@ -1348,7 +1354,7 @@ class gt {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function bt(t) {
+ */ function vt(t) {
     let n = 0;
     for (const e in t) Object.prototype.hasOwnProperty.call(t, e) && n++;
     return n;
@@ -1534,13 +1540,13 @@ const At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     // The json interface (for the browser) will return an iso timestamp string,
     // while the proto js library (for node) will return a
     // google.protobuf.Timestamp instance.
-    if (v(!!t), "string" == typeof t) {
+    if (b(!!t), "string" == typeof t) {
         // The date string can have higher precision (nanos) than the Date class
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
         let n = 0;
         const e = At.exec(t);
-        if (v(!!e), e[1]) {
+        if (b(!!e), e[1]) {
             // Pad the fraction out to 9 digits (nanos).
             let t = e[1];
             t = (t + "000000000").substr(0, 9), n = Number(t);
@@ -1700,7 +1706,7 @@ const At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
       case 10 /* ObjectValue */ :
         return function(t, n) {
             const e = t.mapValue.fields || {}, r = n.mapValue.fields || {};
-            if (bt(e) !== bt(r)) return !1;
+            if (vt(e) !== vt(r)) return !1;
             for (const t in e) if (e.hasOwnProperty(t) && (void 0 === r[t] || !Ft(e[t], r[t]))) return !1;
             return !0;
         }
@@ -1989,30 +1995,31 @@ function Ct(t, n) {
  * applied, `isValidDocument()` returns false and the document should be removed
  * from all views.
  */ class zt {
-    constructor(t, n, e, r, s) {
-        this.key = t, this.documentType = n, this.version = e, this.data = r, this.documentState = s;
+    constructor(t, n, e, r, s, i) {
+        this.key = t, this.documentType = n, this.version = e, this.readTime = r, this.data = s, 
+        this.documentState = i;
     }
     /**
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new zt(t, 0 /* INVALID */ , vt.min(), Bt.empty(), 0 /* SYNCED */);
+        return new zt(t, 0 /* INVALID */ , bt.min(), bt.min(), Bt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist with the given data at the
      * given version.
      */    static newFoundDocument(t, n, e) {
-        return new zt(t, 1 /* FOUND_DOCUMENT */ , n, e, 0 /* SYNCED */);
+        return new zt(t, 1 /* FOUND_DOCUMENT */ , n, bt.min(), e, 0 /* SYNCED */);
     }
     /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, n) {
-        return new zt(t, 2 /* NO_DOCUMENT */ , n, Bt.empty(), 0 /* SYNCED */);
+        return new zt(t, 2 /* NO_DOCUMENT */ , n, bt.min(), Bt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist at the given version but
      * whose data is not known (e.g. a document that was updated without a known
      * base document).
      */    static newUnknownDocument(t, n) {
-        return new zt(t, 3 /* UNKNOWN_DOCUMENT */ , n, Bt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new zt(t, 3 /* UNKNOWN_DOCUMENT */ , n, bt.min(), Bt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2042,6 +2049,9 @@ function Ct(t, n) {
     setHasLocalMutations() {
         return this.documentState = 1 /* HAS_LOCAL_MUTATIONS */ , this;
     }
+    setReadTime(t) {
+        return this.readTime = t, this;
+    }
     get hasLocalMutations() {
         return 1 /* HAS_LOCAL_MUTATIONS */ === this.documentState;
     }
@@ -2067,7 +2077,7 @@ function Ct(t, n) {
         return t instanceof zt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
     }
     mutableCopy() {
-        return new zt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
+        return new zt(this.key, this.documentType, this.version, this.readTime, this.data.clone(), this.documentState);
     }
     toString() {
         return `Document(${this.key}, ${this.version}, ${JSON.stringify(this.data.value)}, {documentType: ${this.documentType}}), {documentState: ${this.documentState}})`;
@@ -2248,7 +2258,7 @@ function Jt(t, n) {
  * just after the provided values.
  */ class en {
     constructor(t, n) {
-        this.position = t, this.before = n;
+        this.position = t, this.inclusive = n;
     }
 }
 
@@ -2267,7 +2277,7 @@ function sn(t, n) {
 function on(t, n) {
     if (null === t) return null === n;
     if (null === n) return !1;
-    if (t.before !== n.before || t.position.length !== n.position.length) return !1;
+    if (t.inclusive !== n.inclusive || t.position.length !== n.position.length) return !1;
     for (let e = 0; e < t.position.length; e++) {
         if (!Ft(t.position[e], n.position[e])) return !1;
     }
@@ -2339,7 +2349,7 @@ function ln(t) {
  * which can be different from the order by constraints the user provided (e.g.
  * the SDK and backend always orders by `__name__`).
  */ function fn(t) {
-    const n = b(t);
+    const n = v(t);
     if (null === n.$) {
         n.$ = [];
         const t = hn(n), e = an(n);
@@ -2364,7 +2374,7 @@ function ln(t) {
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
  */ function dn(t) {
-    const n = b(t);
+    const n = v(t);
     if (!n.S) if ("F" /* First */ === n.limitType) n.S = Qt(n.path, n.collectionGroup, fn(n), n.filters, n.limit, n.startAt, n.endAt); else {
         // Flip the orderBy directions since we want the last results
         const t = [];
@@ -2373,7 +2383,7 @@ function ln(t) {
             t.push(new rn(e.field, n));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                const e = n.endAt ? new en(n.endAt.position, !n.endAt.before) : null, r = n.startAt ? new en(n.startAt.position, !n.startAt.before) : null;
+                const e = n.endAt ? new en(n.endAt.position, !n.endAt.inclusive) : null, r = n.startAt ? new en(n.startAt.position, !n.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
         n.S = Qt(n.path, n.collectionGroup, t, n.filters, n.limit, e, r);
     }
@@ -2490,7 +2500,7 @@ function mn(t, n) {
  * transforms. Converts all field values to integers or doubles, but unlike the
  * backend does not cap integer values at 2^63. Instead, JavaScript number
  * arithmetic is used and precision loss can occur for values greater than 2^53.
- */ class vn extends pn {
+ */ class bn extends pn {
     constructor(t, n) {
         super(), this.q = t, this.O = n;
     }
@@ -2512,7 +2522,7 @@ function mn(t, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** A field path and the TransformOperation to perform upon it. */ class bn {
+/** A field path and the TransformOperation to perform upon it. */ class vn {
     constructor(t, n) {
         this.field = t, this.transform = n;
     }
@@ -2727,7 +2737,7 @@ function Fn(t, n) {
 }
 
 function xn(t) {
-    return v(!!t), vt.fromTimestamp(function(t) {
+    return b(!!t), bt.fromTimestamp(function(t) {
         const n = Rt(t);
         return new gt(n.seconds, n.nanos);
     }(t));
@@ -2746,11 +2756,11 @@ function On(t, n) {
 function Cn(t, n) {
     const e = function(t) {
         const n = X.fromString(t);
-        return v(Hn(n)), n;
+        return b(Yn(n)), n;
     }(n);
     if (e.get(1) !== t.databaseId.projectId) throw new U(A, "Tried to deserialize key from different project: " + e.get(1) + " vs " + t.databaseId.projectId);
     if (e.get(3) !== t.databaseId.database) throw new U(A, "Tried to deserialize key from different database: " + e.get(3) + " vs " + t.databaseId.database);
-    return new nt((v((r = e).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
+    return new nt((b((r = e).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
     var r;
     /** Creates a Document proto from key and fields (but no create/update time) */}
 
@@ -2771,7 +2781,7 @@ function kn(t, n, e) {
 
 function jn(t, n) {
     return "found" in n ? function(t, n) {
-        v(!!n.found), n.found.name, n.found.updateTime;
+        b(!!n.found), n.found.name, n.found.updateTime;
         const e = Cn(t, n.found.name), r = xn(n.found.updateTime), s = new Bt({
             mapValue: {
                 fields: n.found.fields
@@ -2779,7 +2789,7 @@ function jn(t, n) {
         });
         return zt.newFoundDocument(e, r, s);
     }(t, n) : "missing" in n ? function(t, n) {
-        v(!!n.missing), v(!!n.readTime);
+        b(!!n.missing), b(!!n.readTime);
         const e = Cn(t, n.missing), r = xn(n.readTime);
         return zt.newNoDocument(e, r);
     }(t, n) : g();
@@ -2793,7 +2803,7 @@ function Mn(t, n) {
         delete: On(t, n.key)
     }; else if (n instanceof An) e = {
         update: kn(t, n.key, n.data),
-        updateMask: Yn(n.fieldMask)
+        updateMask: Wn(n.fieldMask)
     }; else {
         if (!(n instanceof Pn)) return g();
         e = {
@@ -2818,7 +2828,7 @@ function Mn(t, n) {
                 values: e.elements
             }
         };
-        if (e instanceof vn) return {
+        if (e instanceof bn) return {
             fieldPath: n.field.canonicalString(),
             increment: e.O
         };
@@ -2851,34 +2861,34 @@ function Bn(t, n) {
             if ("==" /* EQUAL */ === t.op) {
                 if (kt(t.value)) return {
                     unaryFilter: {
-                        field: Wn(t.field),
+                        field: Qn(t.field),
                         op: "IS_NAN"
                     }
                 };
                 if (Ut(t.value)) return {
                     unaryFilter: {
-                        field: Wn(t.field),
+                        field: Qn(t.field),
                         op: "IS_NULL"
                     }
                 };
             } else if ("!=" /* NOT_EQUAL */ === t.op) {
                 if (kt(t.value)) return {
                     unaryFilter: {
-                        field: Wn(t.field),
+                        field: Qn(t.field),
                         op: "IS_NOT_NAN"
                     }
                 };
                 if (Ut(t.value)) return {
                     unaryFilter: {
-                        field: Wn(t.field),
+                        field: Qn(t.field),
                         op: "IS_NOT_NULL"
                     }
                 };
             }
             return {
                 fieldFilter: {
-                    field: Wn(t.field),
-                    op: Qn(t.op),
+                    field: Qn(t.field),
+                    op: Gn(t.op),
                     value: t.value
                 }
             };
@@ -2898,8 +2908,8 @@ function Bn(t, n) {
         // visible for testing
         function(t) {
             return {
-                field: Wn(t.field),
-                direction: Gn(t.dir)
+                field: Qn(t.field),
+                direction: zn(t.dir)
             };
         }(t)));
     }(n.orderBy);
@@ -2909,41 +2919,43 @@ function Bn(t, n) {
             value: n
         };
     }(t, n.limit);
-    return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = zn(n.startAt)), 
-    n.endAt && (e.structuredQuery.endAt = zn(n.endAt)), e;
+    var u;
+    return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = {
+        before: (u = n.startAt).inclusive,
+        values: u.position
+    }), n.endAt && (e.structuredQuery.endAt = function(t) {
+        return {
+            before: !t.inclusive,
+            values: t.position
+        };
+    }
+    // visible for testing
+    (n.endAt)), e;
 }
 
 function zn(t) {
-    return {
-        before: t.before,
-        values: t.position
-    };
-}
-
-// visible for testing
-function Gn(t) {
     return Vn[t];
 }
 
 // visible for testing
-function Qn(t) {
+function Gn(t) {
     return Dn[t];
 }
 
-function Wn(t) {
+function Qn(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Yn(t) {
+function Wn(t) {
     const n = [];
     return t.fields.forEach((t => n.push(t.canonicalString()))), {
         fieldPaths: n
     };
 }
 
-function Hn(t) {
+function Yn(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2963,7 +2975,7 @@ function Hn(t) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ function Kn(t) {
+ */ function Hn(t) {
     return new Nn(t, /* useProto3Json= */ !0);
 }
 
@@ -2992,7 +3004,7 @@ function Hn(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class Jn {
+class Kn {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3090,7 +3102,7 @@ class Jn {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class Xn extends class {} {
+class Jn extends class {} {
     constructor(t, n, e, r) {
         super(), this.authCredentials = t, this.appCheckCredentials = n, this.K = e, this.q = r, 
         this.J = !1;
@@ -3117,15 +3129,15 @@ class Xn extends class {} {
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function Zn(t, n) {
-    const e = b(t), r = Un(e.q) + "/documents", s = {
+async function Xn(t, n) {
+    const e = v(t), r = Un(e.q) + "/documents", s = {
         writes: n.map((t => Mn(e.q, t)))
     };
     await e.m("Commit", r, s);
 }
 
-async function te(t, n) {
-    const e = b(t), r = Un(e.q) + "/documents", s = {
+async function Zn(t, n) {
+    const e = v(t), r = Un(e.q) + "/documents", s = {
         documents: n.map((t => On(e.q, t)))
     }, i = await e.T("BatchGetDocuments", r, s), o = new Map;
     i.forEach((t => {
@@ -3135,12 +3147,12 @@ async function te(t, n) {
     const u = [];
     return n.forEach((t => {
         const n = o.get(t.toString());
-        v(!!n), u.push(n);
+        b(!!n), u.push(n);
     })), u;
 }
 
-async function ne(t, n) {
-    const e = b(t), r = Bn(e.q, dn(n));
+async function te(t, n) {
+    const e = v(t), r = Bn(e.q, dn(n));
     return (await e.T("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, n, e) {
@@ -3168,7 +3180,7 @@ async function ne(t, n) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const ee = new Map;
+ */ const ne = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3179,17 +3191,17 @@ async function ne(t, n) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function re(t) {
+function ee(t) {
     if (t._terminated) throw new U(S, "The client has already been terminated.");
-    if (!ee.has(t)) {
+    if (!ne.has(t)) {
         m("ComponentProvider", "Initializing Datastore");
         const i = function(t) {
             return new wt(t, fetch.bind(null));
         }((n = t._databaseId, e = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
-        new H(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Kn(t._databaseId), u = function(t, n, e, r) {
-            return new Xn(t, n, e, r);
+        new H(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Hn(t._databaseId), u = function(t, n, e, r) {
+            return new Jn(t, n, e, r);
         }(t._authCredentials, t._appCheckCredentials, i, o);
-        ee.set(t, u);
+        ne.set(t, u);
     }
     var n, e, r, s;
     /**
@@ -3207,7 +3219,7 @@ function re(t) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */    return ee.get(t);
+ */    return ne.get(t);
 }
 
 /**
@@ -3219,7 +3231,7 @@ function re(t) {
  * user-supplied `FirestoreSettings` object. This is a separate type so that
  * defaults can be supplied and the value can be checked for equality.
  */
-class se {
+class re {
     constructor(t) {
         var n;
         if (void 0 === t.host) {
@@ -3261,14 +3273,14 @@ class se {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class ie {
+ */ class se {
     /** @hideconstructor */
     constructor(t, n, e) {
         this._authCredentials = n, this._appCheckCredentials = e, 
         /**
          * Whether it's a Firestore or Firestore Lite instance.
          */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new se({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new re({}), 
         this._settingsFrozen = !1, t instanceof K ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
             if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(A, '"projectId" not provided in firebase.initializeApp.');
@@ -3301,13 +3313,13 @@ class se {
     }
     _setSettings(t) {
         if (this._settingsFrozen) throw new U(S, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
-        this._settings = new se(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new re(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new M;
             switch (t.type) {
               case "gapi":
                 const n = t.client;
                 // Make sure this really is a Gapi client.
-                                return v(!("object" != typeof n || null === n || !n.auth || !n.auth.getAuthHeaderValueForFirstParty)), 
+                                return b(!("object" != typeof n || null === n || !n.auth || !n.auth.getAuthHeaderValueForFirstParty)), 
                 new Q(n, t.sessionIndex || "0", t.iamToken || null);
 
               case "provider":
@@ -3342,13 +3354,13 @@ class se {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const n = ee.get(t);
-            n && (m("ComponentProvider", "Removing Datastore"), ee.delete(t), n.terminate());
+            const n = ne.get(t);
+            n && (m("ComponentProvider", "Removing Datastore"), ne.delete(t), n.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function oe(t, n) {
+function ie(t, n) {
     const e = _getProvider(t, "firestore/lite");
     if (e.isInitialized()) throw new U(S, "Firestore can only be initialized once per app.");
     return e.initialize({
@@ -3364,7 +3376,7 @@ function oe(t, n) {
  * @param app - The {@link @firebase/app#FirebaseApp} instance that the returned `Firestore`
  * instance is associated with.
  * @returns The `Firestore` instance of the provided app.
- */ function ue(n = getApp()) {
+ */ function oe(n = getApp()) {
     return _getProvider(n, "firestore/lite").getImmediate();
 }
 
@@ -3380,9 +3392,9 @@ function oe(t, n) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function ce(t, n, e, r = {}) {
+ */ function ue(t, n, e, r = {}) {
     var s;
-    const i = (t = ot(t, ie))._getSettings();
+    const i = (t = ot(t, se))._getSettings();
     if ("firestore.googleapis.com" !== i.host && i.host !== n && y("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, i), {
         host: `${n}:${e}`,
@@ -3420,8 +3432,8 @@ function oe(t, n) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function ae(t) {
-    return t = ot(t, ie), _removeServiceInstance(t.app, "firestore/lite"), t._delete();
+ */ function ce(t) {
+    return t = ot(t, se), _removeServiceInstance(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3461,7 +3473,7 @@ function oe(t, n) {
  * and can be used to write, read, or listen to the location. The document at
  * the referenced location may or may not exist.
  */
-class he {
+class ae {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -3489,17 +3501,17 @@ class he {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new fe(this.firestore, this.converter, this._key.path.popLast());
+        return new le(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new he(this.firestore, t, this._key);
+        return new ae(this.firestore, t, this._key);
     }
 }
 
 /**
  * A `Query` refers to a query which you can read or listen to. You can also
  * construct refined `Query` objects by adding filters and ordering.
- */ class le {
+ */ class he {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -3512,14 +3524,14 @@ class he {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new le(this.firestore, t, this._query);
+        return new he(this.firestore, t, this._query);
     }
 }
 
 /**
  * A `CollectionReference` object can be used for adding documents, getting
  * document references, and querying for documents (using {@link query}).
- */ class fe extends le {
+ */ class le extends he {
     /** @hideconstructor */
     constructor(t, n, e) {
         super(t, n, new un(e)), this._path = e, 
@@ -3540,23 +3552,23 @@ class he {
      * subcollection. If this isn't a subcollection, the reference is null.
      */    get parent() {
         const t = this._path.popLast();
-        return t.isEmpty() ? null : new he(this.firestore, 
+        return t.isEmpty() ? null : new ae(this.firestore, 
         /* converter= */ null, new nt(t));
     }
     withConverter(t) {
-        return new fe(this.firestore, t, this._path);
+        return new le(this.firestore, t, this._path);
     }
 }
 
-function de(t, n, ...e) {
-    if (t = getModularInstance(t), et("collection", "path", n), t instanceof ie) {
+function fe(t, n, ...e) {
+    if (t = getModularInstance(t), et("collection", "path", n), t instanceof se) {
         const r = X.fromString(n, ...e);
-        return st(r), new fe(t, /* converter= */ null, r);
+        return st(r), new le(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof he || t instanceof fe)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof ae || t instanceof le)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(X.fromString(n, ...e));
-        return st(r), new fe(t.firestore, 
+        return st(r), new le(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -3573,9 +3585,9 @@ function de(t, n, ...e) {
  * collection or subcollection with this ID as the last segment of its path
  * will be included. Cannot contain a slash.
  * @returns The created `Query`.
- */ function we(t, n) {
-    if (t = ot(t, ie), et("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new U(A, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new le(t, 
+ */ function de(t, n) {
+    if (t = ot(t, se), et("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new U(A, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new he(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
@@ -3586,19 +3598,19 @@ function de(t, n, ...e) {
     }(n));
 }
 
-function me(t, n, ...e) {
+function we(t, n, ...e) {
     if (t = getModularInstance(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (n = pt.R()), et("doc", "path", n), t instanceof ie) {
+    1 === arguments.length && (n = pt.R()), et("doc", "path", n), t instanceof se) {
         const r = X.fromString(n, ...e);
-        return rt(r), new he(t, 
+        return rt(r), new ae(t, 
         /* converter= */ null, new nt(r));
     }
     {
-        if (!(t instanceof he || t instanceof fe)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof ae || t instanceof le)) throw new U(A, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(X.fromString(n, ...e));
-        return rt(r), new he(t.firestore, t instanceof fe ? t.converter : null, new nt(r));
+        return rt(r), new ae(t.firestore, t instanceof le ? t.converter : null, new nt(r));
     }
 }
 
@@ -3609,8 +3621,8 @@ function me(t, n, ...e) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function pe(t, n) {
-    return t = getModularInstance(t), n = getModularInstance(n), (t instanceof he || t instanceof fe) && (n instanceof he || n instanceof fe) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
+ */ function me(t, n) {
+    return t = getModularInstance(t), n = getModularInstance(n), (t instanceof ae || t instanceof le) && (n instanceof ae || n instanceof le) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
 }
 
 /**
@@ -3621,8 +3633,8 @@ function me(t, n, ...e) {
  * @param right - A `Query` to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function ye(t, n) {
-    return t = getModularInstance(t), n = getModularInstance(n), t instanceof le && n instanceof le && (t.firestore === n.firestore && wn(t._query, n._query) && t.converter === n.converter);
+ */ function pe(t, n) {
+    return t = getModularInstance(t), n = getModularInstance(n), t instanceof he && n instanceof he && (t.firestore === n.firestore && wn(t._query, n._query) && t.converter === n.converter);
 }
 
 /**
@@ -3648,7 +3660,7 @@ function me(t, n, ...e) {
  *
  * Create a `FieldPath` by providing field names. If more than one field
  * name is provided, the path will point to a nested field in a document.
- */ class _e {
+ */ class ye {
     /**
      * Creates a `FieldPath` from the provided field names. If more than one field
      * name is provided, the path will point to a nested field in a document.
@@ -3672,8 +3684,8 @@ function me(t, n, ...e) {
 /**
  * Returns a special sentinel `FieldPath` to refer to the ID of a document.
  * It can be used in queries to sort or filter by the document ID.
- */ function ge() {
-    return new _e("__name__");
+ */ function _e() {
+    return new ye("__name__");
 }
 
 /**
@@ -3694,7 +3706,7 @@ function me(t, n, ...e) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class ve {
+ */ class ge {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -3706,7 +3718,7 @@ function me(t, n, ...e) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new ve(It.fromBase64String(t));
+            return new ge(It.fromBase64String(t));
         } catch (t) {
             throw new U(A, "Failed to construct data from Base64 string: " + t);
         }
@@ -3716,7 +3728,7 @@ function me(t, n, ...e) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new ve(It.fromUint8Array(t));
+        return new ge(It.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3800,7 +3812,7 @@ function me(t, n, ...e) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ class Ee {
+ */ class ve {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3859,9 +3871,9 @@ function me(t, n, ...e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ const Te = /^__.*__$/;
+ */ const Ee = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class Ie {
+/** The result of parsing document data (e.g. for a setData call). */ class Te {
     constructor(t, n, e) {
         this.data = t, this.fieldMask = n, this.fieldTransforms = e;
     }
@@ -3870,7 +3882,7 @@ function me(t, n, ...e) {
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class Ae {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class Ie {
     constructor(t, 
     // The fieldMask does not include document transforms.
     n, e) {
@@ -3881,7 +3893,7 @@ function me(t, n, ...e) {
     }
 }
 
-function Re(t) {
+function Ae(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3899,7 +3911,7 @@ function Re(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class Pe {
+/** A "context" object passed around while parsing user data. */ class Re {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3931,7 +3943,7 @@ function Re(t) {
         return this.settings.tt;
     }
     /** Returns a new context with the specified settings overwritten. */    nt(t) {
-        return new Pe(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+        return new Re(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
     et(t) {
         var n;
@@ -3958,7 +3970,7 @@ function Re(t) {
         });
     }
     ut(t) {
-        return We(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
+        return Qe(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
     }
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */    contains(t) {
         return void 0 !== this.fieldMask.find((n => t.isPrefixOf(n))) || void 0 !== this.fieldTransforms.find((n => t.isPrefixOf(n.field)));
@@ -3970,19 +3982,19 @@ function Re(t) {
     }
     st(t) {
         if (0 === t.length) throw this.ut("Document fields must not be empty");
-        if (Re(this.tt) && Te.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
+        if (Ae(this.tt) && Ee.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
     }
 }
 
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ class Ve {
+ */ class Pe {
     constructor(t, n, e) {
-        this.databaseId = t, this.ignoreUndefinedProperties = n, this.q = e || Kn(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = n, this.q = e || Hn(t);
     }
     /** Creates a new top-level parse context. */    ht(t, n, e, r = !1) {
-        return new Pe({
+        return new Re({
             tt: t,
             methodName: n,
             at: e,
@@ -3993,29 +4005,29 @@ function Re(t) {
     }
 }
 
-function De(t) {
-    const n = t._freezeSettings(), e = Kn(t._databaseId);
-    return new Ve(t._databaseId, !!n.ignoreUndefinedProperties, e);
+function Ve(t) {
+    const n = t._freezeSettings(), e = Hn(t._databaseId);
+    return new Pe(t._databaseId, !!n.ignoreUndefinedProperties, e);
 }
 
-/** Parse document data from a set() call. */ function Ne(t, n, e, r, s, i = {}) {
+/** Parse document data from a set() call. */ function De(t, n, e, r, s, i = {}) {
     const o = t.ht(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , n, e, s);
-    Be("Data must be an object, but it was:", o, r);
-    const u = je(r, o);
+    Me("Data must be an object, but it was:", o, r);
+    const u = ke(r, o);
     let c, a;
     if (i.merge) c = new Tt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
         const t = [];
         for (const r of i.mergeFields) {
-            const s = ze(n, r, e);
+            const s = Be(n, r, e);
             if (!o.contains(s)) throw new U(A, `Field '${s}' is specified in your field mask but missing from your input data.`);
-            Ye(t, s) || t.push(s);
+            We(t, s) || t.push(s);
         }
         c = new Tt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
     } else c = null, a = o.fieldTransforms;
-    return new Ie(new Bt(u), c, a);
+    return new Te(new Bt(u), c, a);
 }
 
-class $e extends be {
+class Ne extends be {
     _toFieldTransform(t) {
         if (2 /* MergeSet */ !== t.tt) throw 1 /* Update */ === t.tt ? t.ut(`${this._methodName}() can only appear at the top level of your update data`) : t.ut(`${this._methodName}() 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
@@ -4023,7 +4035,7 @@ class $e extends be {
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof $e;
+        return t instanceof Ne;
     }
 }
 
@@ -4042,8 +4054,8 @@ class $e extends be {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function Se(t, n, e) {
-    return new Pe({
+ */ function $e(t, n, e) {
+    return new Re({
         tt: 3 /* Argument */ ,
         at: n.settings.at,
         methodName: t._methodName,
@@ -4051,23 +4063,23 @@ class $e extends be {
     }, n.databaseId, n.q, n.ignoreUndefinedProperties);
 }
 
-class Fe extends be {
+class Se extends be {
     _toFieldTransform(t) {
-        return new bn(t.path, new yn);
+        return new vn(t.path, new yn);
     }
     isEqual(t) {
-        return t instanceof Fe;
+        return t instanceof Se;
     }
 }
 
-class xe extends be {
+class Fe extends be {
     constructor(t, n) {
         super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        const n = Se(this, t, 
-        /*array=*/ !0), e = this.lt.map((t => ke(t, n))), r = new _n(e);
-        return new bn(t.path, r);
+        const n = $e(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => Ue(t, n))), r = new _n(e);
+        return new vn(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4075,14 +4087,14 @@ class xe extends be {
     }
 }
 
-class qe extends be {
+class xe extends be {
     constructor(t, n) {
         super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        const n = Se(this, t, 
-        /*array=*/ !0), e = this.lt.map((t => ke(t, n))), r = new gn(e);
-        return new bn(t.path, r);
+        const n = $e(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => Ue(t, n))), r = new gn(e);
+        return new vn(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4090,13 +4102,13 @@ class qe extends be {
     }
 }
 
-class Oe extends be {
+class qe extends be {
     constructor(t, n) {
         super(t), this.ft = n;
     }
     _toFieldTransform(t) {
-        const n = new vn(t.q, mn(t.q, this.ft));
-        return new bn(t.path, n);
+        const n = new bn(t.q, mn(t.q, this.ft));
+        return new vn(t.path, n);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4104,50 +4116,50 @@ class Oe extends be {
     }
 }
 
-/** Parse update data from an update() call. */ function Ce(t, n, e, r) {
+/** Parse update data from an update() call. */ function Oe(t, n, e, r) {
     const s = t.ht(1 /* Update */ , n, e);
-    Be("Data must be an object, but it was:", s, r);
+    Me("Data must be an object, but it was:", s, r);
     const i = [], o = Bt.empty();
     Et(r, ((t, r) => {
-        const u = Qe(n, t, e);
+        const u = Ge(n, t, e);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = getModularInstance(r);
         const c = s.it(u);
-        if (r instanceof $e) 
+        if (r instanceof Ne) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = ke(r, c);
+            const t = Ue(r, c);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
     const u = new Tt(i);
-    return new Ae(o, u, s.fieldTransforms);
+    return new Ie(o, u, s.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function Le(t, n, e, r, s, i) {
-    const o = t.ht(1 /* Update */ , n, e), u = [ ze(n, r, e) ], c = [ s ];
+/** Parse update data from a list of field/value arguments. */ function Ce(t, n, e, r, s, i) {
+    const o = t.ht(1 /* Update */ , n, e), u = [ Be(n, r, e) ], c = [ s ];
     if (i.length % 2 != 0) throw new U(A, `Function ${n}() needs to be called with an even number of arguments that alternate between field names and values.`);
-    for (let t = 0; t < i.length; t += 2) u.push(ze(n, i[t])), c.push(i[t + 1]);
+    for (let t = 0; t < i.length; t += 2) u.push(Be(n, i[t])), c.push(i[t + 1]);
     const a = [], l = Bt.empty();
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
-    for (let t = u.length - 1; t >= 0; --t) if (!Ye(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!We(a, u[t])) {
         const n = u[t];
         let e = c[t];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 e = getModularInstance(e);
         const r = o.it(n);
-        if (e instanceof $e) 
+        if (e instanceof Ne) 
         // Add it to the field mask, but don't add anything to updateData.
         a.push(n); else {
-            const t = ke(e, r);
+            const t = Ue(e, r);
             null != t && (a.push(n), l.set(n, t));
         }
     }
     const f = new Tt(a);
-    return new Ae(l, f, o.fieldTransforms);
+    return new Ie(l, f, o.fieldTransforms);
 }
 
 /**
@@ -4156,8 +4168,8 @@ class Oe extends be {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function Ue(t, n, e, r = !1) {
-    return ke(e, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
+ */ function Le(t, n, e, r = !1) {
+    return Ue(e, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
 }
 
 /**
@@ -4168,11 +4180,11 @@ class Oe extends be {
  * 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 ke(t, n) {
-    if (Me(
+ */ function Ue(t, n) {
+    if (je(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = getModularInstance(t))) return Be("Unsupported field value:", n, t), je(t, n);
+    t = getModularInstance(t))) return Me("Unsupported field value:", n, t), ke(t, n);
     if (t instanceof be) 
     // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
@@ -4185,7 +4197,7 @@ class Oe extends be {
  */
     return function(t, n) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Re(n.tt)) throw n.ut(`${t._methodName}() can only be used with update() and set()`);
+        if (!Ae(n.tt)) throw n.ut(`${t._methodName}() can only be used with update() and set()`);
         if (!n.path) throw n.ut(`${t._methodName}() is not currently supported inside arrays`);
         const e = t._toFieldTransform(n);
         e && n.fieldTransforms.push(e);
@@ -4215,7 +4227,7 @@ class Oe extends be {
             const e = [];
             let r = 0;
             for (const s of t) {
-                let t = ke(s, n.ot(r));
+                let t = Ue(s, n.ot(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4256,16 +4268,16 @@ class Oe extends be {
                 timestampValue: $n(n.q, e)
             };
         }
-        if (t instanceof Ee) return {
+        if (t instanceof ve) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof ve) return {
+        if (t instanceof ge) return {
             bytesValue: Sn(n.q, t._byteString)
         };
-        if (t instanceof he) {
+        if (t instanceof ae) {
             const e = n.databaseId, r = t.firestore._databaseId;
             if (!r.isEqual(e)) throw n.ut(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${e.projectId}/${e.database}`);
             return {
@@ -4283,13 +4295,13 @@ class Oe extends be {
  */ (t, n);
 }
 
-function je(t, n) {
+function ke(t, n) {
     const e = {};
     return !function(t) {
         for (const n in t) if (Object.prototype.hasOwnProperty.call(t, n)) return !1;
         return !0;
     }(t) ? Et(t, ((t, r) => {
-        const s = ke(r, n.et(t));
+        const s = Ue(r, n.et(t));
         null != s && (e[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -4301,12 +4313,12 @@ function je(t, n) {
     };
 }
 
-function Me(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof gt || t instanceof Ee || t instanceof ve || t instanceof he || t instanceof be);
+function je(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof gt || t instanceof ve || t instanceof ge || t instanceof ae || t instanceof be);
 }
 
-function Be(t, n, e) {
-    if (!Me(e) || !function(t) {
+function Me(t, n, e) {
+    if (!je(e) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(e)) {
         const r = it(e);
@@ -4316,20 +4328,20 @@ function Be(t, n, e) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function ze(t, n, e) {
+ */ function Be(t, n, e) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    n = getModularInstance(n)) instanceof _e) return n._internalPath;
-    if ("string" == typeof n) return Qe(t, n);
-    throw We("Field path arguments must be of type string or ", t, 
+    n = getModularInstance(n)) instanceof ye) return n._internalPath;
+    if ("string" == typeof n) return Ge(t, n);
+    throw Qe("Field path arguments must be of type string or ", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, e);
 }
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ const Ge = new RegExp("[~\\*/\\[\\]]");
+ */ const ze = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4339,20 +4351,20 @@ function Be(t, n, e) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function Qe(t, n, e) {
-    if (n.search(Ge) >= 0) throw We(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function Ge(t, n, e) {
+    if (n.search(ze) >= 0) throw Qe(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, e);
     try {
-        return new _e(...n.split("."))._internalPath;
+        return new ye(...n.split("."))._internalPath;
     } catch (r) {
-        throw We(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw Qe(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, e);
     }
 }
 
-function We(t, n, e, r, s) {
+function Qe(t, n, e, r, s) {
     const i = r && !r.isEmpty(), o = void 0 !== s;
     let u = `Function ${n}() called with invalid data`;
     e && (u += " (via `toFirestore()`)"), u += ". ";
@@ -4361,7 +4373,7 @@ function We(t, n, e, r, s) {
     c += ")"), new U(A, u + t + c);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Ye(t, n) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function We(t, n) {
     return t.some((t => t.isEqual(n)));
 }
 
@@ -4389,7 +4401,7 @@ function We(t, n, e, r, s) {
  * For a `DocumentSnapshot` that points to a non-existing document, any data
  * access will return 'undefined'. You can use the `exists()` method to
  * explicitly verify a document's existence.
- */ class He {
+ */ class Ye {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4405,7 +4417,7 @@ function We(t, n, e, r, s) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new he(this._firestore, this._converter, this._key);
+        return new ae(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -4425,7 +4437,7 @@ function We(t, n, e, r, s) {
             if (this._converter) {
                 // We only want to use the converter and create a new DocumentSnapshot
                 // if a converter has been provided.
-                const t = new Ke(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new He(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4445,7 +4457,7 @@ function We(t, n, e, r, s) {
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     get(t) {
         if (this._document) {
-            const n = this._document.data.field(Ze("DocumentSnapshot.get", t));
+            const n = this._document.data.field(Xe("DocumentSnapshot.get", t));
             if (null !== n) return this._userDataWriter.convertValue(n);
         }
     }
@@ -4461,7 +4473,7 @@ function We(t, n, e, r, s) {
  * `DocumentSnapshot`. Since query results contain only existing documents, the
  * `exists` property will always be true and `data()` will never return
  * 'undefined'.
- */ class Ke extends He {
+ */ class He extends Ye {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -4479,7 +4491,7 @@ function We(t, n, e, r, s) {
  * array via the `docs` property or enumerated using the `forEach` method. The
  * number of documents can be determined via the `empty` and `size`
  * properties.
- */ class Je {
+ */ class Ke {
     /** @hideconstructor */
     constructor(t, n) {
         this._docs = n, this.query = t;
@@ -4510,14 +4522,14 @@ function We(t, n, e, r, s) {
  * @param left - A snapshot to compare.
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
- */ function Xe(t, n) {
-    return t = getModularInstance(t), n = getModularInstance(n), t instanceof He && n instanceof He ? t._firestore === n._firestore && t._key.isEqual(n._key) && (null === t._document ? null === n._document : t._document.isEqual(n._document)) && t._converter === n._converter : t instanceof Je && n instanceof Je && (ye(t.query, n.query) && _t(t.docs, n.docs, Xe));
+ */ function Je(t, n) {
+    return t = getModularInstance(t), n = getModularInstance(n), t instanceof Ye && n instanceof Ye ? t._firestore === n._firestore && t._key.isEqual(n._key) && (null === t._document ? null === n._document : t._document.isEqual(n._document)) && t._converter === n._converter : t instanceof Ke && n instanceof Ke && (pe(t.query, n.query) && _t(t.docs, n.docs, Je));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function Ze(t, n) {
-    return "string" == typeof n ? Qe(t, n) : n instanceof _e ? n._internalPath : n._delegate._internalPath;
+ */ function Xe(t, n) {
+    return "string" == typeof n ? Ge(t, n) : n instanceof ye ? n._internalPath : n._delegate._internalPath;
 }
 
 /**
@@ -4544,7 +4556,7 @@ function We(t, n, e, r, s) {
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
  */
-class tr {}
+class Ze {}
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4554,32 +4566,32 @@ class tr {}
  * @param queryConstraints - The list of {@link QueryConstraint}s to apply.
  * @throws if any of the provided query constraints cannot be combined with the
  * existing or new constraints.
- */ function nr(t, ...n) {
+ */ function tr(t, ...n) {
     for (const e of n) t = e._apply(t);
     return t;
 }
 
-class er extends tr {
+class nr extends Ze {
     constructor(t, n, e) {
         super(), this.dt = t, this.wt = n, this.yt = e, this.type = "where";
     }
     _apply(t) {
-        const n = De(t.firestore), e = function(t, n, e, r, s, i, o) {
+        const n = Ve(t.firestore), e = function(t, n, e, r, s, i, o) {
             let u;
             if (s.isKeyField()) {
                 if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new U(A, `Invalid Query. You can't perform '${i}' queries on documentId().`);
                 if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
-                    yr(o, i);
+                    pr(o, i);
                     const n = [];
-                    for (const e of o) n.push(pr(r, t, e));
+                    for (const e of o) n.push(mr(r, t, e));
                     u = {
                         arrayValue: {
                             values: n
                         }
                     };
-                } else u = pr(r, t, o);
-            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || yr(o, i), 
-            u = Ue(e, n, o, 
+                } else u = mr(r, t, o);
+            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || pr(o, i), 
+            u = Le(e, n, o, 
             /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
             const c = Wt.create(s, i, u);
             return function(t, n) {
@@ -4587,7 +4599,7 @@ class er extends tr {
                     const e = hn(t);
                     if (null !== e && !e.isEqual(n.field)) throw new U(A, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${e.toString()}' and '${n.field.toString()}'`);
                     const r = an(t);
-                    null !== r && _r(t, n.field, r);
+                    null !== r && yr(t, n.field, r);
                 }
                 const e = function(t, n) {
                     for (const e of t.filters) if (n.indexOf(e.op) >= 0) return e.op;
@@ -4631,7 +4643,7 @@ class er extends tr {
                 throw e === n.op ? new U(A, `Invalid query. You cannot use more than one '${n.op.toString()}' filter.`) : new U(A, `Invalid query. You cannot use '${n.op.toString()}' filters with '${e.toString()}' filters.`);
             }(t, c), c;
         }(t._query, "where", n, t.firestore._databaseId, this.dt, this.wt, this.yt);
-        return new le(t.firestore, t.converter, function(t, n) {
+        return new he(t.firestore, t.converter, function(t, n) {
             const e = t.filters.concat([ n ]);
             return new un(t.path, t.collectionGroup, t.explicitOrderBy.slice(), e, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
@@ -4648,12 +4660,12 @@ class er extends tr {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function rr(t, n, e) {
-    const r = n, s = Ze("where", t);
-    return new er(s, r, e);
+ */ function er(t, n, e) {
+    const r = n, s = Xe("where", t);
+    return new nr(s, r, e);
 }
 
-class sr extends tr {
+class rr extends Ze {
     constructor(t, n) {
         super(), this.dt = t, this._t = n, this.type = "orderBy";
     }
@@ -4666,7 +4678,7 @@ class sr extends tr {
                 if (null === an(t)) {
                     // This is the first order by. It must match any inequality.
                     const e = hn(t);
-                    null !== e && _r(t, e, n.field);
+                    null !== e && yr(t, e, n.field);
                 }
             }(t, r), r;
         }
@@ -4681,7 +4693,7 @@ class sr extends tr {
  * of the query or if any of the fields in the order by are an uncommitted
  * server timestamp.
  */ (t._query, this.dt, this._t);
-        return new le(t.firestore, t.converter, function(t, n) {
+        return new he(t.firestore, t.converter, function(t, n) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             const e = t.explicitOrderBy.concat([ n ]);
             return new un(t.path, t.collectionGroup, e, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
@@ -4697,19 +4709,19 @@ class sr extends tr {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function ir(t, n = "asc") {
-    const e = n, r = Ze("orderBy", t);
-    return new sr(r, e);
+ */ function sr(t, n = "asc") {
+    const e = n, r = Xe("orderBy", t);
+    return new rr(r, e);
 }
 
-class or extends tr {
+class ir extends Ze {
     constructor(t, n, e) {
-        super(), this.type = t, this.gt = n, this.vt = e;
+        super(), this.type = t, this.gt = n, this.bt = e;
     }
     _apply(t) {
-        return new le(t.firestore, t.converter, function(t, n, e) {
+        return new he(t.firestore, t.converter, function(t, n, e) {
             return new un(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), n, e, t.startAt, t.endAt);
-        }(t._query, this.gt, this.vt));
+        }(t._query, this.gt, this.bt));
     }
 }
 
@@ -4718,8 +4730,8 @@ class or extends tr {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function ur(t) {
-    return ut("limit", t), new or("limit", t, "F" /* First */);
+ */ function or(t) {
+    return ut("limit", t), new ir("limit", t, "F" /* First */);
 }
 
 /**
@@ -4730,53 +4742,55 @@ class or extends tr {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function cr(t) {
-    return ut("limitToLast", t), new or("limitToLast", t, "L" /* Last */);
+ */ function ur(t) {
+    return ut("limitToLast", t), new ir("limitToLast", t, "L" /* Last */);
 }
 
-class ar extends tr {
+class cr extends Ze {
     constructor(t, n, e) {
-        super(), this.type = t, this.bt = n, this.Et = e;
+        super(), this.type = t, this.vt = n, this.Et = e;
     }
     _apply(t) {
-        const n = mr(t, this.type, this.bt, this.Et);
-        return new le(t.firestore, t.converter, function(t, n) {
+        const n = wr(t, this.type, this.vt, this.Et);
+        return new he(t.firestore, t.converter, function(t, n) {
             return new un(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, n, t.endAt);
         }(t._query, n));
     }
 }
 
-function hr(...t) {
-    return new ar("startAt", t, /*before=*/ !0);
+function ar(...t) {
+    return new cr("startAt", t, 
+    /*inclusive=*/ !0);
 }
 
-function lr(...t) {
-    return new ar("startAfter", t, 
-    /*before=*/ !1);
+function hr(...t) {
+    return new cr("startAfter", t, 
+    /*inclusive=*/ !1);
 }
 
-class fr extends tr {
+class lr extends Ze {
     constructor(t, n, e) {
-        super(), this.type = t, this.bt = n, this.Et = e;
+        super(), this.type = t, this.vt = n, this.Et = e;
     }
     _apply(t) {
-        const n = mr(t, this.type, this.bt, this.Et);
-        return new le(t.firestore, t.converter, function(t, n) {
+        const n = wr(t, this.type, this.vt, this.Et);
+        return new he(t.firestore, t.converter, function(t, n) {
             return new un(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, n);
         }(t._query, n));
     }
 }
 
-function dr(...t) {
-    return new fr("endBefore", t, /*before=*/ !0);
+function fr(...t) {
+    return new lr("endBefore", t, 
+    /*inclusive=*/ !1);
 }
 
-function wr(...t) {
-    return new fr("endAt", t, /*before=*/ !1);
+function dr(...t) {
+    return new lr("endAt", t, /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function mr(t, n, e, r) {
-    if (e[0] = getModularInstance(e[0]), e[0] instanceof He) return function(t, n, e, r, s) {
+/** Helper function to create a bound from a document or fields */ function wr(t, n, e, r) {
+    if (e[0] = getModularInstance(e[0]), e[0] instanceof Ye) return function(t, n, e, r, s) {
         if (!r) throw new U(P, `Can't use a DocumentSnapshot that doesn't exist for ${e}().`);
         const i = [];
         // Because people expect to continue/end a query at the exact document
@@ -4801,7 +4815,7 @@ function wr(...t) {
  * Converts a list of field values to a `Bound` for the given query.
  */ (t._query, t.firestore._databaseId, n, e[0]._document, r);
     {
-        const s = De(t.firestore);
+        const s = Ve(t.firestore);
         return function(t, n, e, r, s, i) {
             // Use explicit order by's because it has to match the query the user made
             const o = t.explicitOrderBy;
@@ -4817,7 +4831,7 @@ function wr(...t) {
                     const s = new nt(e);
                     u.push(Ct(n, s));
                 } else {
-                    const t = Ue(e, r, c);
+                    const t = Le(e, r, c);
                     u.push(t);
                 }
             }
@@ -4831,7 +4845,7 @@ function wr(...t) {
     }
 }
 
-function pr(t, n, e) {
+function mr(t, n, e) {
     if ("string" == typeof (e = getModularInstance(e))) {
         if ("" === e) throw new U(A, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
         if (!ln(n) && -1 !== e.indexOf("/")) throw new U(A, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${e}' contains a '/' character.`);
@@ -4839,19 +4853,19 @@ function pr(t, n, e) {
         if (!nt.isDocumentKey(r)) throw new U(A, `Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
         return Ct(t, new nt(r));
     }
-    if (e instanceof he) return Ct(t, e._key);
+    if (e instanceof ae) return Ct(t, e._key);
     throw new U(A, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${it(e)}.`);
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function yr(t, n) {
+ */ function pr(t, n) {
     if (!Array.isArray(t) || 0 === t.length) throw new U(A, `Invalid Query. A non-empty array is required for '${n.toString()}' filters.`);
     if (t.length > 10) throw new U(A, `Invalid Query. '${n.toString()}' filters support a maximum of 10 elements in the value array.`);
 }
 
-function _r(t, n, e) {
+function yr(t, n, e) {
     if (!e.isEqual(n)) throw new U(A, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${n.toString()}' and so you must also use '${n.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${e.toString()}' instead.`);
 }
 
@@ -4902,7 +4916,7 @@ function _r(t, n, e) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function gr(t, n, e) {
+function _r(t, n, e) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -4911,7 +4925,7 @@ function gr(t, n, e) {
     r;
 }
 
-class vr extends class {
+class gr extends class {
     convertValue(t, n = "none") {
         switch (St(t)) {
           case 0 /* NullValue */ :
@@ -4958,7 +4972,7 @@ class vr extends class {
         })), e;
     }
     convertGeoPoint(t) {
-        return new Ee(Pt(t.latitude), Pt(t.longitude));
+        return new ve(Pt(t.latitude), Pt(t.longitude));
     }
     convertArray(t, n) {
         return (t.values || []).map((t => this.convertValue(t, n)));
@@ -4982,7 +4996,7 @@ class vr extends class {
     }
     convertDocumentKey(t, n) {
         const e = X.fromString(t);
-        v(Hn(e));
+        b(Yn(e));
         const r = new K(e.get(1), e.get(3)), s = new nt(e.popFirst(5));
         return r.isEqual(n) || 
         // TODO(b/64130202): Somehow support foreign references.
@@ -4994,11 +5008,11 @@ class vr extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new ve(t);
+        return new ge(t);
     }
     convertReference(t) {
         const n = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new he(this.firestore, /* converter= */ null, n);
+        return new ae(this.firestore, /* converter= */ null, n);
     }
 }
 
@@ -5015,11 +5029,11 @@ class vr extends class {
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
  */ function br(t) {
-    const n = re((t = ot(t, he)).firestore), e = new vr(t.firestore);
-    return te(n, [ t._key ]).then((n => {
-        v(1 === n.length);
+    const n = ee((t = ot(t, ae)).firestore), e = new gr(t.firestore);
+    return Zn(n, [ t._key ]).then((n => {
+        b(1 === n.length);
         const r = n[0];
-        return new He(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new Ye(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5034,33 +5048,33 @@ class vr extends class {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function Er(t) {
+ */ function vr(t) {
     !function(t) {
         if (cn(t) && 0 === t.explicitOrderBy.length) throw new U(q, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = ot(t, le))._query);
-    const n = re(t.firestore), e = new vr(t.firestore);
-    return ne(n, t._query).then((n => {
-        const r = n.map((n => new Ke(t.firestore, e, n.key, n, t.converter)));
+    }((t = ot(t, he))._query);
+    const n = ee(t.firestore), e = new gr(t.firestore);
+    return te(n, t._query).then((n => {
+        const r = n.map((n => new He(t.firestore, e, n.key, n, t.converter)));
         return cn(t._query) && 
         // Limit to last queries reverse the orderBy constraint that was
         // specified by the user. As such, we need to reverse the order of the
         // results to return the documents in the expected order.
-        r.reverse(), new Je(t, r);
+        r.reverse(), new Ke(t, r);
     }));
 }
 
-function Tr(t, n, e) {
-    const r = gr((t = ot(t, he)).converter, n, e), s = Ne(De(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
-    return Zn(re(t.firestore), [ s.toMutation(t._key, En.none()) ]);
+function Er(t, n, e) {
+    const r = _r((t = ot(t, ae)).converter, n, e), s = De(Ve(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
+    return Xn(ee(t.firestore), [ s.toMutation(t._key, En.none()) ]);
 }
 
-function Ir(t, n, e, ...r) {
-    const s = De((t = ot(t, he)).firestore);
+function Tr(t, n, e, ...r) {
+    const s = Ve((t = ot(t, ae)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    i = "string" == typeof (n = getModularInstance(n)) || n instanceof _e ? Le(s, "updateDoc", t._key, n, e, r) : Ce(s, "updateDoc", t._key, n);
-    return Zn(re(t.firestore), [ i.toMutation(t._key, En.exists(!0)) ]);
+    i = "string" == typeof (n = getModularInstance(n)) || n instanceof ye ? Ce(s, "updateDoc", t._key, n, e, r) : Oe(s, "updateDoc", t._key, n);
+    return Xn(ee(t.firestore), [ i.toMutation(t._key, En.exists(!0)) ]);
 }
 
 /**
@@ -5074,8 +5088,8 @@ function Ir(t, n, e, ...r) {
  * @param reference - A reference to the document to delete.
  * @returns A `Promise` resolved once the document has been successfully
  * deleted from the backend.
- */ function Ar(t) {
-    return Zn(re((t = ot(t, he)).firestore), [ new Rn(t._key, En.none()) ]);
+ */ function Ir(t) {
+    return Xn(ee((t = ot(t, ae)).firestore), [ new Rn(t._key, En.none()) ]);
 }
 
 /**
@@ -5092,9 +5106,9 @@ function Ir(t, n, e, ...r) {
  * @throws Error - If the provided input is not a valid Firestore document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function Rr(t, n) {
-    const e = me(t = ot(t, fe)), r = gr(t.converter, n), s = Ne(De(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
-    return Zn(re(t.firestore), [ s.toMutation(e._key, En.exists(!1)) ]).then((() => e));
+ */ function Ar(t, n) {
+    const e = we(t = ot(t, le)), r = _r(t.converter, n), s = De(Ve(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
+    return Xn(ee(t.firestore), [ s.toMutation(e._key, En.exists(!1)) ]).then((() => e));
 }
 
 /**
@@ -5116,15 +5130,15 @@ function Ir(t, n, e, ...r) {
 /**
  * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or
  * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.
- */ function Pr() {
-    return new $e("deleteField");
+ */ function Rr() {
+    return new Ne("deleteField");
 }
 
 /**
  * Returns a sentinel used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link @firebase/firestore/lite#(updateDoc:1)} to
  * include a server-generated timestamp in the written data.
- */ function Vr() {
-    return new Fe("serverTimestamp");
+ */ function Pr() {
+    return new Se("serverTimestamp");
 }
 
 /**
@@ -5138,10 +5152,10 @@ function Ir(t, n, e, ...r) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function Dr(...t) {
+ */ function Vr(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-    return new xe("arrayUnion", t);
+    return new Fe("arrayUnion", t);
 }
 
 /**
@@ -5154,10 +5168,10 @@ function Ir(t, n, e, ...r) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function Nr(...t) {
+ */ function Dr(...t) {
     // NOTE: We don't actually parse the data until it's used in set() or
     // update() since we'd need the Firestore instance to do this.
-    return new qe("arrayRemove", t);
+    return new xe("arrayRemove", t);
 }
 
 /**
@@ -5178,8 +5192,8 @@ function Ir(t, n, e, ...r) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function $r(t) {
-    return new Oe("increment", t);
+ */ function Nr(t) {
+    return new qe("increment", t);
 }
 
 /**
@@ -5205,24 +5219,24 @@ function Ir(t, n, e, ...r) {
  * provides methods for adding writes to the write batch. None of the writes
  * will be committed (or visible locally) until {@link WriteBatch.commit} is
  * called.
- */ class Sr {
+ */ class $r {
     /** @hideconstructor */
     constructor(t, n) {
         this._firestore = t, this._commitHandler = n, this._mutations = [], this._committed = !1, 
-        this._dataReader = De(t);
+        this._dataReader = Ve(t);
     }
     set(t, n, e) {
         this._verifyNotCommitted();
-        const r = Fr(t, this._firestore), s = gr(r.converter, n, e), i = Ne(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
+        const r = Sr(t, this._firestore), s = _r(r.converter, n, e), i = De(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
         return this._mutations.push(i.toMutation(r._key, En.none())), this;
     }
     update(t, n, e, ...r) {
         this._verifyNotCommitted();
-        const s = Fr(t, this._firestore);
+        const s = Sr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (n = getModularInstance(n)) || n instanceof _e ? Le(this._dataReader, "WriteBatch.update", s._key, n, e, r) : Ce(this._dataReader, "WriteBatch.update", s._key, n), 
+        return i = "string" == typeof (n = getModularInstance(n)) || n instanceof ye ? Ce(this._dataReader, "WriteBatch.update", s._key, n, e, r) : Oe(this._dataReader, "WriteBatch.update", s._key, n), 
         this._mutations.push(i.toMutation(s._key, En.exists(!0))), this;
     }
     /**
@@ -5232,7 +5246,7 @@ function Ir(t, n, e, ...r) {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const n = Fr(t, this._firestore);
+        const n = Sr(t, this._firestore);
         return this._mutations = this._mutations.concat(new Rn(n._key, En.none())), this;
     }
     /**
@@ -5254,7 +5268,7 @@ function Ir(t, n, e, ...r) {
     }
 }
 
-function Fr(t, n) {
+function Sr(t, n) {
     if ((t = getModularInstance(t)).firestore !== n) throw new U(A, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -5271,9 +5285,9 @@ function Fr(t, n) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function xr(t) {
-    const n = re(t = ot(t, ie));
-    return new Sr(t, (t => Zn(n, t)));
+ */ function Fr(t) {
+    const n = ee(t = ot(t, se));
+    return new $r(t, (t => Xn(n, t)));
 }
 
 /**
@@ -5295,7 +5309,7 @@ function Fr(t, n) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ class qr {
+ */ class xr {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5315,7 +5329,7 @@ function Fr(t, n) {
     }
     async lookup(t) {
         if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(A, "Firestore transactions require all reads to be executed before all writes.");
-        const n = await te(this.datastore, t);
+        const n = await Zn(this.datastore, t);
         return n.forEach((t => this.recordVersion(t))), n;
     }
     set(t, n) {
@@ -5344,14 +5358,14 @@ function Fr(t, n) {
         t.forEach(((t, n) => {
             const e = nt.fromPath(n);
             this.mutations.push(new Pn(e, this.precondition(e)));
-        })), await Zn(this.datastore, this.mutations), this.committed = !0;
+        })), await Xn(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let n;
         if (t.isFoundDocument()) n = t.version; else {
             if (!t.isNoDocument()) throw g();
             // For deleted docs, we must use baseVersion 0 when we overwrite them.
-            n = vt.min();
+            n = bt.min();
         }
         const e = this.readVersions.get(t.key.toString());
         if (e) {
@@ -5374,7 +5388,7 @@ function Fr(t, n) {
         // The first time a document is written, we want to take into account the
         // read time and existence
                 if (!this.writtenDocs.has(t.toString()) && n) {
-            if (n.isEqual(vt.min())) 
+            if (n.isEqual(bt.min())) 
             // The document doesn't exist, so fail the transaction.
             // This has to be validated locally because you can't send a
             // precondition that a document does not exist without changing the
@@ -5418,17 +5432,17 @@ function Fr(t, n) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class Or {
+class qr {
     constructor(t, n, e, r) {
         this.asyncQueue = t, this.datastore = n, this.updateFunction = e, this.deferred = r, 
-        this.Tt = 5, this.It = new Jn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.Tt = 5, this.It = new Kn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
         this.Tt -= 1, this.At();
     }
     At() {
         this.It.W((async () => {
-            const t = new qr(this.datastore), n = this.Rt(t);
+            const t = new xr(this.datastore), n = this.Rt(t);
             n && n.then((n => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(n);
@@ -5518,7 +5532,7 @@ class Or {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** The Platform's 'document' implementation or null if not available. */ function Cr() {
+/** The Platform's 'document' implementation or null if not available. */ function Or() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5550,7 +5564,7 @@ class Or {
  * Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type
  * in newer versions of TypeScript defines `finally`, which is not available in
  * IE.
- */ class Lr {
+ */ class Cr {
     constructor(t, n, e, r, s) {
         this.asyncQueue = t, this.timerId = n, this.targetTimeMs = e, this.op = r, this.removalCallback = s, 
         this.deferred = new k, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
@@ -5573,7 +5587,7 @@ class Or {
      *   PORTING NOTE: This exists to prevent making removeDelayedOperation() and
      *   the DelayedOperation class public.
      */    static createAndSchedule(t, n, e, r, s) {
-        const i = Date.now() + e, o = new Lr(t, n, i, r, s);
+        const i = Date.now() + e, o = new Cr(t, n, i, r, s);
         return o.start(e), o;
     }
     /**
@@ -5622,7 +5636,7 @@ class Or {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ class Ur {
+ */ class Lr {
     constructor() {
         // The last promise in the queue.
         this.Dt = Promise.resolve(), 
@@ -5645,15 +5659,15 @@ class Or {
         // List of TimerIds to fast-forward delays for.
         this.Ot = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new Jn(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new Kn(this, "async_queue_retry" /* AsyncQueueRetry */), 
         // Visibility handler that triggers an immediate retry of all retryable
         // operations. Meant to speed up recovery when we regain file system access
         // after page comes into foreground.
         this.Ct = () => {
-            const t = Cr();
+            const t = Or();
             t && m("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
         };
-        const t = Cr();
+        const t = Or();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ct);
     }
     get isShuttingDown() {
@@ -5674,7 +5688,7 @@ class Or {
     enterRestrictedMode(t) {
         if (!this.$t) {
             this.$t = !0, this.qt = t || !1;
-            const n = Cr();
+            const n = Or();
             n && "function" == typeof n.removeEventListener && n.removeEventListener("visibilitychange", this.Ct);
         }
     }
@@ -5806,7 +5820,7 @@ class Or {
         this.Lt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ot.indexOf(t) > -1 && (n = 0);
-        const r = Lr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
+        const r = Cr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
         return this.St.push(r), r;
     }
     Lt() {
@@ -5860,10 +5874,10 @@ class Or {
     }
 }
 
-class kr {
+class Ur {
     /** @hideconstructor */
     constructor(t, n) {
-        this._firestore = t, this._transaction = n, this._dataReader = De(t);
+        this._firestore = t, this._transaction = n, this._dataReader = Ve(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -5871,25 +5885,25 @@ class kr {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const n = Fr(t, this._firestore), e = new vr(this._firestore);
+        const n = Sr(t, this._firestore), e = new gr(this._firestore);
         return this._transaction.lookup([ n._key ]).then((t => {
             if (!t || 1 !== t.length) return g();
             const r = t[0];
-            if (r.isFoundDocument()) return new He(this._firestore, e, r.key, r, n.converter);
-            if (r.isNoDocument()) return new He(this._firestore, e, n._key, null, n.converter);
+            if (r.isFoundDocument()) return new Ye(this._firestore, e, r.key, r, n.converter);
+            if (r.isNoDocument()) return new Ye(this._firestore, e, n._key, null, n.converter);
             throw g();
         }));
     }
     set(t, n, e) {
-        const r = Fr(t, this._firestore), s = gr(r.converter, n, e), i = Ne(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, e);
+        const r = Sr(t, this._firestore), s = _r(r.converter, n, e), i = De(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, e);
         return this._transaction.set(r._key, i), this;
     }
     update(t, n, e, ...r) {
-        const s = Fr(t, this._firestore);
+        const s = Sr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (n = getModularInstance(n)) || n instanceof _e ? Le(this._dataReader, "Transaction.update", s._key, n, e, r) : Ce(this._dataReader, "Transaction.update", s._key, n), 
+        return i = "string" == typeof (n = getModularInstance(n)) || n instanceof ye ? Ce(this._dataReader, "Transaction.update", s._key, n, e, r) : Oe(this._dataReader, "Transaction.update", s._key, n), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -5898,7 +5912,7 @@ class kr {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const n = Fr(t, this._firestore);
+        const n = Sr(t, this._firestore);
         return this._transaction.delete(n._key), this;
     }
 }
@@ -5919,9 +5933,9 @@ class kr {
  * (the `updateFunction` returned a failed promise), the promise returned by the
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
- */ function jr(t, n) {
-    const e = re(t = ot(t, ie)), r = new k;
-    return new Or(new Ur, e, (e => n(new kr(t, e))), r).run(), r.promise;
+ */ function kr(t, n) {
+    const e = ee(t = ot(t, se)), r = new k;
+    return new qr(new Lr, e, (e => n(new Ur(t, e))), r).run(), r.promise;
 }
 
 /**
@@ -5934,11 +5948,11 @@ class kr {
  */ !function(t) {
     f = t;
 }(`${SDK_VERSION}_lite`), _registerComponent(new Component("firestore/lite", ((t, {options: n}) => {
-    const e = t.getProvider("app").getImmediate(), r = new ie(e, new z(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
+    const e = t.getProvider("app").getImmediate(), r = new se(e, new z(t.getProvider("auth-internal")), new Y(t.getProvider("app-check-internal")));
     return n && r._setSettings(n), r;
 }), "PUBLIC")), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-registerVersion("firestore-lite", "3.4.3", ""), registerVersion("firestore-lite", "3.4.3", "esm2017");
+registerVersion("firestore-lite", "3.4.4-canary.0482aa5b7", ""), registerVersion("firestore-lite", "3.4.4-canary.0482aa5b7", "esm2017");
 
-export { ve as Bytes, fe as CollectionReference, he as DocumentReference, He as DocumentSnapshot, _e as FieldPath, be as FieldValue, ie as Firestore, U as FirestoreError, Ee as GeoPoint, le as Query, tr as QueryConstraint, Ke as QueryDocumentSnapshot, Je as QuerySnapshot, gt as Timestamp, kr as Transaction, Sr as WriteBatch, Rr as addDoc, Nr as arrayRemove, Dr as arrayUnion, de as collection, we as collectionGroup, ce as connectFirestoreEmulator, Ar as deleteDoc, Pr as deleteField, me as doc, ge as documentId, wr as endAt, dr as endBefore, br as getDoc, Er as getDocs, ue as getFirestore, $r as increment, oe as initializeFirestore, ur as limit, cr as limitToLast, ir as orderBy, nr as query, ye as queryEqual, pe as refEqual, jr as runTransaction, Vr as serverTimestamp, Tr as setDoc, w as setLogLevel, Xe as snapshotEqual, lr as startAfter, hr as startAt, ae as terminate, Ir as updateDoc, rr as where, xr as writeBatch };
+export { ge as Bytes, le as CollectionReference, ae as DocumentReference, Ye as DocumentSnapshot, ye as FieldPath, be as FieldValue, se as Firestore, U as FirestoreError, ve as GeoPoint, he as Query, Ze as QueryConstraint, He as QueryDocumentSnapshot, Ke as QuerySnapshot, gt as Timestamp, Ur as Transaction, $r as WriteBatch, Ar as addDoc, Dr as arrayRemove, Vr as arrayUnion, fe as collection, de as collectionGroup, ue as connectFirestoreEmulator, Ir as deleteDoc, Rr as deleteField, we as doc, _e as documentId, dr as endAt, fr as endBefore, br as getDoc, vr as getDocs, oe as getFirestore, Nr as increment, ie as initializeFirestore, or as limit, ur as limitToLast, sr as orderBy, tr as query, pe as queryEqual, me as refEqual, kr as runTransaction, Pr as serverTimestamp, Er as setDoc, w as setLogLevel, Je as snapshotEqual, hr as startAfter, ar as startAt, ce as terminate, Tr as updateDoc, er as where, Fr as writeBatch };
 //# sourceMappingURL=index.browser.esm2017.js.map