@firebase/firestore 3.4.4 → 3.4.5-2022116201138

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

@@ -66,7 +66,7 @@ f.MOCK_USER = new f("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let d = "9.6.5";
+let d = "9.6.7-2022116201138";
 
 /**
  * @license
@@ -328,7 +328,7 @@ n) {
     }
 }
 
-/** Credential provider for the Lite SDK. */ class Q {
+/** Credential provider for the Lite SDK. */ class G {
     constructor(t) {
         this.auth = null, t.onInit((t => {
             this.auth = t;
@@ -349,7 +349,7 @@ n) {
  * Technically this may no longer be necessary since the SDK should gracefully
  * recover from unauthenticated errors (see b/33147818 for context), but it's
  * safer to keep the implementation as-is.
- */ class G {
+ */ class Q {
     constructor(t, n, e) {
         this.type = "FirstParty", this.user = f.FIRST_PARTY, this.headers = new Map, this.headers.set("X-Goog-AuthUser", n);
         const r = t.auth.getAuthHeaderValueForFirstParty([]);
@@ -366,7 +366,7 @@ n) {
         this.t = t, this.i = n, this.o = e;
     }
     getToken() {
-        return Promise.resolve(new G(this.t, this.i, this.o));
+        return Promise.resolve(new Q(this.t, this.i, this.o));
     }
     start(t, n) {
         // Fire with initial uid.
@@ -450,6 +450,9 @@ class J {
     constructor(t, n) {
         this.projectId = t, this.database = n || "(default)";
     }
+    static empty() {
+        return new J("", "");
+    }
     get isDefaultDatabase() {
         return "(default)" === this.database;
     }
@@ -675,9 +678,21 @@ const tt = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
     static fromName(t) {
         return new et(Z.fromString(t).popFirst(5));
     }
+    static empty() {
+        return new et(Z.emptyPath());
+    }
+    get collectionGroup() {
+        return this.path.popLast().lastSegment();
+    }
     /** 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;
     }
+    /** Returns the collection group (i.e. the name of the parent collection) for this key. */    getCollectionGroup() {
+        return this.path.get(this.path.length - 2);
+    }
+    /** Returns the fully qualified path to the parent collection. */    getCollectionPath() {
+        return this.path.popLast();
+    }
     isEqual(t) {
         return null !== t && 0 === Z.comparator(this.path, t.path);
     }
@@ -1889,12 +1904,12 @@ function kt(t, n) {
 /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ class Qt {
+ */ class Gt {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new Qt({
+        return new Gt({
             mapValue: {}
         });
     }
@@ -1975,7 +1990,7 @@ function kt(t, n) {
         for (const n of e) delete t[n];
     }
     clone() {
-        return new Qt(zt(this.value));
+        return new Gt(zt(this.value));
     }
 }
 
@@ -2004,31 +2019,32 @@ function kt(t, n) {
  * not transition to one of these states even after all mutations have been
  * applied, `isValidDocument()` returns false and the document should be removed
  * from all views.
- */ class Gt {
-    constructor(t, n, e, r, s) {
-        this.key = t, this.documentType = n, this.version = e, this.data = r, this.documentState = s;
+ */ class Qt {
+    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 Gt(t, 0 /* INVALID */ , bt.min(), Qt.empty(), 0 /* SYNCED */);
+        return new Qt(t, 0 /* INVALID */ , bt.min(), bt.min(), Gt.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 Gt(t, 1 /* FOUND_DOCUMENT */ , n, e, 0 /* SYNCED */);
+        return new Qt(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 Gt(t, 2 /* NO_DOCUMENT */ , n, Qt.empty(), 0 /* SYNCED */);
+        return new Qt(t, 2 /* NO_DOCUMENT */ , n, bt.min(), Gt.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 Gt(t, 3 /* UNKNOWN_DOCUMENT */ , n, Qt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new Qt(t, 3 /* UNKNOWN_DOCUMENT */ , n, bt.min(), Gt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2041,7 +2057,7 @@ function kt(t, n) {
      * Changes the document type to indicate that it doesn't exist at the given
      * version.
      */    convertToNoDocument(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Qt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Gt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }
     /**
@@ -2049,7 +2065,7 @@ function kt(t, n) {
      * that its data is not known (e.g. a document that was updated without a known
      * base document).
      */    convertToUnknownDocument(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Qt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Gt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasCommittedMutations() {
@@ -2058,6 +2074,9 @@ function kt(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;
     }
@@ -2080,10 +2099,10 @@ function kt(t, n) {
         return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
     }
     isEqual(t) {
-        return t instanceof Gt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
+        return t instanceof Qt && 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 Gt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
+        return new Qt(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}})`;
@@ -2264,7 +2283,7 @@ function Zt(t, n) {
  * just after the provided values.
  */ class sn {
     constructor(t, n) {
-        this.position = t, this.before = n;
+        this.position = t, this.inclusive = n;
     }
 }
 
@@ -2283,7 +2302,7 @@ function un(t, n) {
 function cn(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 (!qt(t.position[e], n.position[e])) return !1;
     }
@@ -2389,7 +2408,7 @@ function dn(t) {
             t.push(new on(e.field, n));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                const e = n.endAt ? new sn(n.endAt.position, !n.endAt.before) : null, r = n.startAt ? new sn(n.startAt.position, !n.startAt.before) : null;
+                const e = n.endAt ? new sn(n.endAt.position, !n.endAt.inclusive) : null, r = n.startAt ? new sn(n.startAt.position, !n.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
         n.S = Yt(n.path, n.collectionGroup, t, n.filters, n.limit, e, r);
     }
@@ -2762,7 +2781,7 @@ function Ln(t, n) {
 function kn(t, n) {
     const e = function(t) {
         const n = Z.fromString(t);
-        return b(Jn(n)), n;
+        return b(Kn(n)), n;
     }(n);
     if (e.get(1) !== t.databaseId.projectId) throw new U(R, "Tried to deserialize key from different project: " + e.get(1) + " vs " + t.databaseId.projectId);
     if (e.get(3) !== t.databaseId.database) throw new U(R, "Tried to deserialize key from different database: " + e.get(3) + " vs " + t.databaseId.database);
@@ -2788,16 +2807,16 @@ function Mn(t, n, e) {
 function Bn(t, n) {
     return "found" in n ? function(t, n) {
         b(!!n.found), n.found.name, n.found.updateTime;
-        const e = kn(t, n.found.name), r = On(n.found.updateTime), s = new Qt({
+        const e = kn(t, n.found.name), r = On(n.found.updateTime), s = new Gt({
             mapValue: {
                 fields: n.found.fields
             }
         });
-        return Gt.newFoundDocument(e, r, s);
+        return Qt.newFoundDocument(e, r, s);
     }(t, n) : "missing" in n ? function(t, n) {
         b(!!n.missing), b(!!n.readTime);
         const e = kn(t, n.missing), r = On(n.readTime);
-        return Gt.newNoDocument(e, r);
+        return Qt.newNoDocument(e, r);
     }(t, n) : v();
 }
 
@@ -2809,7 +2828,7 @@ function zn(t, n) {
         delete: Ln(t, n.key)
     }; else if (n instanceof Pn) e = {
         update: Mn(t, n.key, n.data),
-        updateMask: Kn(n.fieldMask)
+        updateMask: Hn(n.fieldMask)
     }; else {
         if (!(n instanceof Nn)) return v();
         e = {
@@ -2848,7 +2867,7 @@ function zn(t, n) {
     }(t, n.precondition)), e;
 }
 
-function Qn(t, n) {
+function Gn(t, n) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const e = {
         structuredQuery: {}
@@ -2867,34 +2886,34 @@ function Qn(t, n) {
             if ("==" /* EQUAL */ === t.op) {
                 if (Mt(t.value)) return {
                     unaryFilter: {
-                        field: Hn(t.field),
+                        field: Yn(t.field),
                         op: "IS_NAN"
                     }
                 };
                 if (jt(t.value)) return {
                     unaryFilter: {
-                        field: Hn(t.field),
+                        field: Yn(t.field),
                         op: "IS_NULL"
                     }
                 };
             } else if ("!=" /* NOT_EQUAL */ === t.op) {
                 if (Mt(t.value)) return {
                     unaryFilter: {
-                        field: Hn(t.field),
+                        field: Yn(t.field),
                         op: "IS_NOT_NAN"
                     }
                 };
                 if (jt(t.value)) return {
                     unaryFilter: {
-                        field: Hn(t.field),
+                        field: Yn(t.field),
                         op: "IS_NOT_NULL"
                     }
                 };
             }
             return {
                 fieldFilter: {
-                    field: Hn(t.field),
-                    op: Yn(t.op),
+                    field: Yn(t.field),
+                    op: Wn(t.op),
                     value: t.value
                 }
             };
@@ -2914,8 +2933,8 @@ function Qn(t, n) {
         // visible for testing
         function(t) {
             return {
-                field: Hn(t.field),
-                direction: Wn(t.dir)
+                field: Yn(t.field),
+                direction: Qn(t.dir)
             };
         }(t)));
     }(n.orderBy);
@@ -2925,41 +2944,43 @@ function Qn(t, n) {
             value: n
         };
     }(t, n.limit);
-    return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = Gn(n.startAt)), 
-    n.endAt && (e.structuredQuery.endAt = Gn(n.endAt)), e;
-}
-
-function Gn(t) {
-    return {
-        before: t.before,
-        values: t.position
-    };
+    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;
 }
 
-// visible for testing
-function Wn(t) {
+function Qn(t) {
     return Dn[t];
 }
 
 // visible for testing
-function Yn(t) {
+function Wn(t) {
     return $n[t];
 }
 
-function Hn(t) {
+function Yn(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Kn(t) {
+function Hn(t) {
     const n = [];
     return t.fields.forEach((t => n.push(t.canonicalString()))), {
         fieldPaths: n
     };
 }
 
-function Jn(t) {
+function Kn(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -2979,7 +3000,7 @@ function Jn(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 Xn(t) {
+ */ function Jn(t) {
     return new Sn(t, /* useProto3Json= */ !0);
 }
 
@@ -3008,7 +3029,7 @@ function Jn(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class Zn {
+class Xn {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3106,7 +3127,7 @@ class Zn {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class te extends class {} {
+class Zn extends class {} {
     constructor(t, n, e, r) {
         super(), this.authCredentials = t, this.appCheckCredentials = n, this.K = e, this.q = r, 
         this.J = !1;
@@ -3133,14 +3154,14 @@ class te extends class {} {
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function ne(t, n) {
+async function te(t, n) {
     const e = E(t), r = jn(e.q) + "/documents", s = {
         writes: n.map((t => zn(e.q, t)))
     };
     await e.m("Commit", r, s);
 }
 
-async function ee(t, n) {
+async function ne(t, n) {
     const e = E(t), r = jn(e.q) + "/documents", s = {
         documents: n.map((t => Ln(e.q, t)))
     }, i = await e.T("BatchGetDocuments", r, s), o = new Map;
@@ -3155,16 +3176,16 @@ async function ee(t, n) {
     })), u;
 }
 
-async function re(t, n) {
-    const e = E(t), r = Qn(e.q, mn(n));
+async function ee(t, n) {
+    const e = E(t), r = Gn(e.q, mn(n));
     return (await e.T("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, n, e) {
-        const r = kn(t, n.name), s = On(n.updateTime), i = new Qt({
+        const r = kn(t, n.name), s = On(n.updateTime), i = new Gt({
             mapValue: {
                 fields: n.fields
             }
-        }), o = Gt.newFoundDocument(r, s, i);
+        }), o = Qt.newFoundDocument(r, s, i);
         return e && o.setHasCommittedMutations(), e ? o.setHasCommittedMutations() : o;
     }(e.q, t.document, void 0)));
 }
@@ -3184,7 +3205,7 @@ async function re(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 se = new Map;
+ */ const re = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3195,17 +3216,17 @@ async function re(t, n) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function ie(t) {
+function se(t) {
     if (t._terminated) throw new U(F, "The client has already been terminated.");
-    if (!se.has(t)) {
+    if (!re.has(t)) {
         p("ComponentProvider", "Initializing Datastore");
         const i = function(t) {
             return new mt(t, fetch.bind(null));
         }((n = t._databaseId, e = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
-        new K(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Xn(t._databaseId), u = function(t, n, e, r) {
-            return new te(t, n, e, r);
+        new K(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Jn(t._databaseId), u = function(t, n, e, r) {
+            return new Zn(t, n, e, r);
         }(t._authCredentials, t._appCheckCredentials, i, o);
-        se.set(t, u);
+        re.set(t, u);
     }
     var n, e, r, s;
     /**
@@ -3223,7 +3244,7 @@ function ie(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 se.get(t);
+ */    return re.get(t);
 }
 
 /**
@@ -3235,7 +3256,7 @@ function ie(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 oe {
+class ie {
     constructor(t) {
         var n;
         if (void 0 === t.host) {
@@ -3277,14 +3298,14 @@ class oe {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class ue {
+ */ class oe {
     /** @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 oe({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new ie({}), 
         this._settingsFrozen = !1, t instanceof J ? this._databaseId = t : (this._app = t, 
         this._databaseId = function(t) {
             if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new U(R, '"projectId" not provided in firebase.initializeApp.');
@@ -3317,7 +3338,7 @@ class oe {
     }
     _setSettings(t) {
         if (this._settingsFrozen) throw new U(F, "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 oe(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new ie(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new B;
             switch (t.type) {
               case "gapi":
@@ -3358,13 +3379,13 @@ class oe {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const n = se.get(t);
-            n && (p("ComponentProvider", "Removing Datastore"), se.delete(t), n.terminate());
+            const n = re.get(t);
+            n && (p("ComponentProvider", "Removing Datastore"), re.delete(t), n.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function ce(t, n) {
+function ue(t, n) {
     const e = _getProvider(t, "firestore/lite");
     if (e.isInitialized()) throw new U(F, "Firestore can only be initialized once per app.");
     return e.initialize({
@@ -3380,7 +3401,7 @@ function ce(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 ae(n = t()) {
+ */ function ce(n = t()) {
     return _getProvider(n, "firestore/lite").getImmediate();
 }
 
@@ -3396,9 +3417,9 @@ function ce(t, n) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function he(t, n, e, r = {}) {
+ */ function ae(t, n, e, r = {}) {
     var s;
-    const i = (t = ut(t, ue))._getSettings();
+    const i = (t = ut(t, oe))._getSettings();
     if ("firestore.googleapis.com" !== i.host && i.host !== n && _("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, i), {
         host: `${n}:${e}`,
@@ -3436,8 +3457,8 @@ function ce(t, n) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function le(t) {
-    return t = ut(t, ue), n(t.app, "firestore/lite"), t._delete();
+ */ function he(t) {
+    return t = ut(t, oe), n(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3477,7 +3498,7 @@ function ce(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 fe {
+class le {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -3505,17 +3526,17 @@ class fe {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new we(this.firestore, this.converter, this._key.path.popLast());
+        return new de(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new fe(this.firestore, t, this._key);
+        return new le(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 de {
+ */ class fe {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -3528,14 +3549,14 @@ class fe {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new de(this.firestore, t, this._query);
+        return new fe(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 we extends de {
+ */ class de extends fe {
     /** @hideconstructor */
     constructor(t, n, e) {
         super(t, n, new an(e)), this._path = e, 
@@ -3556,23 +3577,23 @@ class fe {
      * subcollection. If this isn't a subcollection, the reference is null.
      */    get parent() {
         const t = this._path.popLast();
-        return t.isEmpty() ? null : new fe(this.firestore, 
+        return t.isEmpty() ? null : new le(this.firestore, 
         /* converter= */ null, new et(t));
     }
     withConverter(t) {
-        return new we(this.firestore, t, this._path);
+        return new de(this.firestore, t, this._path);
     }
 }
 
-function me(t, n, ...e) {
-    if (t = l(t), rt("collection", "path", n), t instanceof ue) {
+function we(t, n, ...e) {
+    if (t = l(t), rt("collection", "path", n), t instanceof oe) {
         const r = Z.fromString(n, ...e);
-        return it(r), new we(t, /* converter= */ null, r);
+        return it(r), new de(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof fe || t instanceof we)) throw new U(R, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof le || t instanceof de)) throw new U(R, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(Z.fromString(n, ...e));
-        return it(r), new we(t.firestore, 
+        return it(r), new de(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -3589,9 +3610,9 @@ function me(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 pe(t, n) {
-    if (t = ut(t, ue), rt("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new U(R, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
-    return new de(t, 
+ */ function me(t, n) {
+    if (t = ut(t, oe), rt("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new U(R, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
+    return new fe(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
@@ -3602,19 +3623,19 @@ function me(t, n, ...e) {
     }(n));
 }
 
-function ye(t, n, ...e) {
+function pe(t, n, ...e) {
     if (t = l(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (n = yt.R()), rt("doc", "path", n), t instanceof ue) {
+    1 === arguments.length && (n = yt.R()), rt("doc", "path", n), t instanceof oe) {
         const r = Z.fromString(n, ...e);
-        return st(r), new fe(t, 
+        return st(r), new le(t, 
         /* converter= */ null, new et(r));
     }
     {
-        if (!(t instanceof fe || t instanceof we)) throw new U(R, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof le || t instanceof de)) throw new U(R, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(Z.fromString(n, ...e));
-        return st(r), new fe(t.firestore, t instanceof we ? t.converter : null, new et(r));
+        return st(r), new le(t.firestore, t instanceof de ? t.converter : null, new et(r));
     }
 }
 
@@ -3625,8 +3646,8 @@ function ye(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 _e(t, n) {
-    return t = l(t), n = l(n), (t instanceof fe || t instanceof we) && (n instanceof fe || n instanceof we) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
+ */ function ye(t, n) {
+    return t = l(t), n = l(n), (t instanceof le || t instanceof de) && (n instanceof le || n instanceof de) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
 }
 
 /**
@@ -3637,8 +3658,8 @@ function ye(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 ge(t, n) {
-    return t = l(t), n = l(n), t instanceof de && n instanceof de && (t.firestore === n.firestore && pn(t._query, n._query) && t.converter === n.converter);
+ */ function _e(t, n) {
+    return t = l(t), n = l(n), t instanceof fe && n instanceof fe && (t.firestore === n.firestore && pn(t._query, n._query) && t.converter === n.converter);
 }
 
 /**
@@ -3664,7 +3685,7 @@ function ye(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 ve {
+ */ class ge {
     /**
      * 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.
@@ -3688,8 +3709,8 @@ function ye(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 be() {
-    return new ve("__name__");
+ */ function ve() {
+    return new ge("__name__");
 }
 
 /**
@@ -3710,7 +3731,7 @@ function ye(t, n, ...e) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class Ee {
+ */ class be {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -3722,7 +3743,7 @@ function ye(t, n, ...e) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new Ee(Rt.fromBase64String(t));
+            return new be(Rt.fromBase64String(t));
         } catch (t) {
             throw new U(R, "Failed to construct data from Base64 string: " + t);
         }
@@ -3732,7 +3753,7 @@ function ye(t, n, ...e) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new Ee(Rt.fromUint8Array(t));
+        return new be(Rt.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3784,7 +3805,7 @@ function ye(t, n, ...e) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class Te {
+ */ class Ee {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -3816,7 +3837,7 @@ function ye(t, n, ...e) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ class Ie {
+ */ class Te {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3875,9 +3896,9 @@ function ye(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 Ae = /^__.*__$/;
+ */ const Ie = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class Re {
+/** The result of parsing document data (e.g. for a setData call). */ class Ae {
     constructor(t, n, e) {
         this.data = t, this.fieldMask = n, this.fieldTransforms = e;
     }
@@ -3886,7 +3907,7 @@ function ye(t, n, ...e) {
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class Pe {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class Re {
     constructor(t, 
     // The fieldMask does not include document transforms.
     n, e) {
@@ -3897,7 +3918,7 @@ function ye(t, n, ...e) {
     }
 }
 
-function Ve(t) {
+function Pe(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3915,7 +3936,7 @@ function Ve(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class Ne {
+/** A "context" object passed around while parsing user data. */ class Ve {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3947,7 +3968,7 @@ function Ve(t) {
         return this.settings.tt;
     }
     /** Returns a new context with the specified settings overwritten. */    nt(t) {
-        return new Ne(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+        return new Ve(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
     et(t) {
         var n;
@@ -3974,7 +3995,7 @@ function Ve(t) {
         });
     }
     ut(t) {
-        return He(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
+        return Ye(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)));
@@ -3986,19 +4007,19 @@ function Ve(t) {
     }
     st(t) {
         if (0 === t.length) throw this.ut("Document fields must not be empty");
-        if (Ve(this.tt) && Ae.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
+        if (Pe(this.tt) && Ie.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 De {
+ */ class Ne {
     constructor(t, n, e) {
-        this.databaseId = t, this.ignoreUndefinedProperties = n, this.q = e || Xn(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = n, this.q = e || Jn(t);
     }
     /** Creates a new top-level parse context. */    ht(t, n, e, r = !1) {
-        return new Ne({
+        return new Ve({
             tt: t,
             methodName: n,
             at: e,
@@ -4009,29 +4030,29 @@ function Ve(t) {
     }
 }
 
-function $e(t) {
-    const n = t._freezeSettings(), e = Xn(t._databaseId);
-    return new De(t._databaseId, !!n.ignoreUndefinedProperties, e);
+function De(t) {
+    const n = t._freezeSettings(), e = Jn(t._databaseId);
+    return new Ne(t._databaseId, !!n.ignoreUndefinedProperties, e);
 }
 
-/** Parse document data from a set() call. */ function Se(t, n, e, r, s, i = {}) {
+/** Parse document data from a set() call. */ function $e(t, n, e, r, s, i = {}) {
     const o = t.ht(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , n, e, s);
-    Qe("Data must be an object, but it was:", o, r);
-    const u = Be(r, o);
+    ze("Data must be an object, but it was:", o, r);
+    const u = Me(r, o);
     let c, a;
     if (i.merge) c = new It(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
         const t = [];
         for (const r of i.mergeFields) {
             const s = Ge(n, r, e);
             if (!o.contains(s)) throw new U(R, `Field '${s}' is specified in your field mask but missing from your input data.`);
-            Ke(t, s) || t.push(s);
+            He(t, s) || t.push(s);
         }
         c = new It(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
     } else c = null, a = o.fieldTransforms;
-    return new Re(new Qt(u), c, a);
+    return new Ae(new Gt(u), c, a);
 }
 
-class Fe extends Te {
+class Se extends Ee {
     _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
@@ -4039,7 +4060,7 @@ class Fe extends Te {
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof Fe;
+        return t instanceof Se;
     }
 }
 
@@ -4058,8 +4079,8 @@ class Fe extends Te {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function xe(t, n, e) {
-    return new Ne({
+ */ function Fe(t, n, e) {
+    return new Ve({
         tt: 3 /* Argument */ ,
         at: n.settings.at,
         methodName: t._methodName,
@@ -4067,22 +4088,22 @@ class Fe extends Te {
     }, n.databaseId, n.q, n.ignoreUndefinedProperties);
 }
 
-class qe extends Te {
+class xe extends Ee {
     _toFieldTransform(t) {
         return new Tn(t.path, new gn);
     }
     isEqual(t) {
-        return t instanceof qe;
+        return t instanceof xe;
     }
 }
 
-class Oe extends Te {
+class qe extends Ee {
     constructor(t, n) {
         super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        const n = xe(this, t, 
-        /*array=*/ !0), e = this.lt.map((t => Me(t, n))), r = new vn(e);
+        const n = Fe(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => je(t, n))), r = new vn(e);
         return new Tn(t.path, r);
     }
     isEqual(t) {
@@ -4091,13 +4112,13 @@ class Oe extends Te {
     }
 }
 
-class Ce extends Te {
+class Oe extends Ee {
     constructor(t, n) {
         super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        const n = xe(this, t, 
-        /*array=*/ !0), e = this.lt.map((t => Me(t, n))), r = new bn(e);
+        const n = Fe(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => je(t, n))), r = new bn(e);
         return new Tn(t.path, r);
     }
     isEqual(t) {
@@ -4106,7 +4127,7 @@ class Ce extends Te {
     }
 }
 
-class Le extends Te {
+class Ce extends Ee {
     constructor(t, n) {
         super(t), this.ft = n;
     }
@@ -4120,50 +4141,50 @@ class Le extends Te {
     }
 }
 
-/** Parse update data from an update() call. */ function ke(t, n, e, r) {
+/** Parse update data from an update() call. */ function Le(t, n, e, r) {
     const s = t.ht(1 /* Update */ , n, e);
-    Qe("Data must be an object, but it was:", s, r);
-    const i = [], o = Qt.empty();
+    ze("Data must be an object, but it was:", s, r);
+    const i = [], o = Gt.empty();
     Tt(r, ((t, r) => {
-        const u = Ye(n, t, e);
+        const u = We(n, t, e);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = l(r);
         const c = s.it(u);
-        if (r instanceof Fe) 
+        if (r instanceof Se) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = Me(r, c);
+            const t = je(r, c);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
     const u = new It(i);
-    return new Pe(o, u, s.fieldTransforms);
+    return new Re(o, u, s.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function Ue(t, n, e, r, s, i) {
+/** Parse update data from a list of field/value arguments. */ function ke(t, n, e, r, s, i) {
     const o = t.ht(1 /* Update */ , n, e), u = [ Ge(n, r, e) ], c = [ s ];
     if (i.length % 2 != 0) throw new U(R, `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(Ge(n, i[t])), c.push(i[t + 1]);
-    const a = [], h = Qt.empty();
+    const a = [], h = Gt.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 (!Ke(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!He(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 = l(e);
         const r = o.it(n);
-        if (e instanceof Fe) 
+        if (e instanceof Se) 
         // Add it to the field mask, but don't add anything to updateData.
         a.push(n); else {
-            const t = Me(e, r);
+            const t = je(e, r);
             null != t && (a.push(n), h.set(n, t));
         }
     }
     const f = new It(a);
-    return new Pe(h, f, o.fieldTransforms);
+    return new Re(h, f, o.fieldTransforms);
 }
 
 /**
@@ -4172,8 +4193,8 @@ class Le extends Te {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function je(t, n, e, r = !1) {
-    return Me(e, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
+ */ function Ue(t, n, e, r = !1) {
+    return je(e, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
 }
 
 /**
@@ -4184,12 +4205,12 @@ class Le extends Te {
  * 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 Me(t, n) {
-    if (ze(
+ */ function je(t, n) {
+    if (Be(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = l(t))) return Qe("Unsupported field value:", n, t), Be(t, n);
-    if (t instanceof Te) 
+    t = l(t))) return ze("Unsupported field value:", n, t), Me(t, n);
+    if (t instanceof Ee) 
     // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
     // (as doing so will overwrite the field directly prior to the transform
@@ -4201,7 +4222,7 @@ class Le extends Te {
  */
     return function(t, n) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Ve(n.tt)) throw n.ut(`${t._methodName}() can only be used with update() and set()`);
+        if (!Pe(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);
@@ -4231,7 +4252,7 @@ class Le extends Te {
             const e = [];
             let r = 0;
             for (const s of t) {
-                let t = Me(s, n.ot(r));
+                let t = je(s, n.ot(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4272,16 +4293,16 @@ class Le extends Te {
                 timestampValue: Fn(n.q, e)
             };
         }
-        if (t instanceof Ie) return {
+        if (t instanceof Te) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof Ee) return {
+        if (t instanceof be) return {
             bytesValue: xn(n.q, t._byteString)
         };
-        if (t instanceof fe) {
+        if (t instanceof le) {
             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 {
@@ -4299,13 +4320,13 @@ class Le extends Te {
  */ (t, n);
 }
 
-function Be(t, n) {
+function Me(t, n) {
     const e = {};
     return !function(t) {
         for (const n in t) if (Object.prototype.hasOwnProperty.call(t, n)) return !1;
         return !0;
     }(t) ? Tt(t, ((t, r) => {
-        const s = Me(r, n.et(t));
+        const s = je(r, n.et(t));
         null != s && (e[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -4317,12 +4338,12 @@ function Be(t, n) {
     };
 }
 
-function ze(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof vt || t instanceof Ie || t instanceof Ee || t instanceof fe || t instanceof Te);
+function Be(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof vt || t instanceof Te || t instanceof be || t instanceof le || t instanceof Ee);
 }
 
-function Qe(t, n, e) {
-    if (!ze(e) || !function(t) {
+function ze(t, n, e) {
+    if (!Be(e) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(e)) {
         const r = ot(e);
@@ -4336,16 +4357,16 @@ function Qe(t, n, e) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    n = l(n)) instanceof ve) return n._internalPath;
-    if ("string" == typeof n) return Ye(t, n);
-    throw He("Field path arguments must be of type string or ", t, 
+    n = l(n)) instanceof ge) return n._internalPath;
+    if ("string" == typeof n) return We(t, n);
+    throw Ye("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 We = new RegExp("[~\\*/\\[\\]]");
+ */ const Qe = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4355,20 +4376,20 @@ function Qe(t, n, e) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function Ye(t, n, e) {
-    if (n.search(We) >= 0) throw He(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function We(t, n, e) {
+    if (n.search(Qe) >= 0) throw Ye(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, e);
     try {
-        return new ve(...n.split("."))._internalPath;
+        return new ge(...n.split("."))._internalPath;
     } catch (r) {
-        throw He(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw Ye(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, e);
     }
 }
 
-function He(t, n, e, r, s) {
+function Ye(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 += ". ";
@@ -4377,7 +4398,7 @@ function He(t, n, e, r, s) {
     c += ")"), new U(R, u + t + c);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Ke(t, n) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function He(t, n) {
     return t.some((t => t.isEqual(n)));
 }
 
@@ -4405,7 +4426,7 @@ function He(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 Je {
+ */ class Ke {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4421,7 +4442,7 @@ function He(t, n, e, r, s) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new fe(this._firestore, this._converter, this._key);
+        return new le(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -4441,7 +4462,7 @@ function He(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 Xe(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new Je(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4461,7 +4482,7 @@ function He(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(nr("DocumentSnapshot.get", t));
+            const n = this._document.data.field(tr("DocumentSnapshot.get", t));
             if (null !== n) return this._userDataWriter.convertValue(n);
         }
     }
@@ -4477,7 +4498,7 @@ function He(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 Xe extends Je {
+ */ class Je extends Ke {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -4495,7 +4516,7 @@ function He(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 Ze {
+ */ class Xe {
     /** @hideconstructor */
     constructor(t, n) {
         this._docs = n, this.query = t;
@@ -4526,14 +4547,14 @@ function He(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 tr(t, n) {
-    return t = l(t), n = l(n), t instanceof Je && n instanceof Je ? 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 Ze && n instanceof Ze && (ge(t.query, n.query) && gt(t.docs, n.docs, tr));
+ */ function Ze(t, n) {
+    return t = l(t), n = l(n), t instanceof Ke && n instanceof Ke ? 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 Xe && n instanceof Xe && (_e(t.query, n.query) && gt(t.docs, n.docs, Ze));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function nr(t, n) {
-    return "string" == typeof n ? Ye(t, n) : n instanceof ve ? n._internalPath : n._delegate._internalPath;
+ */ function tr(t, n) {
+    return "string" == typeof n ? We(t, n) : n instanceof ge ? n._internalPath : n._delegate._internalPath;
 }
 
 /**
@@ -4560,7 +4581,7 @@ function He(t, n, e, r, s) {
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
  */
-class er {}
+class nr {}
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4570,32 +4591,32 @@ class er {}
  * @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 rr(t, ...n) {
+ */ function er(t, ...n) {
     for (const e of n) t = e._apply(t);
     return t;
 }
 
-class sr extends er {
+class rr extends nr {
     constructor(t, n, e) {
         super(), this.dt = t, this.wt = n, this.yt = e, this.type = "where";
     }
     _apply(t) {
-        const n = $e(t.firestore), e = function(t, n, e, r, s, i, o) {
+        const n = De(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(R, `Invalid Query. You can't perform '${i}' queries on documentId().`);
                 if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
-                    gr(o, i);
+                    _r(o, i);
                     const n = [];
-                    for (const e of o) n.push(_r(r, t, e));
+                    for (const e of o) n.push(yr(r, t, e));
                     u = {
                         arrayValue: {
                             values: n
                         }
                     };
-                } else u = _r(r, t, o);
-            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || gr(o, i), 
-            u = je(e, n, o, 
+                } else u = yr(r, t, o);
+            } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || _r(o, i), 
+            u = Ue(e, n, o, 
             /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
             const c = Ht.create(s, i, u);
             return function(t, n) {
@@ -4603,7 +4624,7 @@ class sr extends er {
                     const e = fn(t);
                     if (null !== e && !e.isEqual(n.field)) throw new U(R, `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 = ln(t);
-                    null !== r && vr(t, n.field, r);
+                    null !== r && gr(t, n.field, r);
                 }
                 const e = function(t, n) {
                     for (const e of t.filters) if (n.indexOf(e.op) >= 0) return e.op;
@@ -4647,7 +4668,7 @@ class sr extends er {
                 throw e === n.op ? new U(R, `Invalid query. You cannot use more than one '${n.op.toString()}' filter.`) : new U(R, `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 de(t.firestore, t.converter, function(t, n) {
+        return new fe(t.firestore, t.converter, function(t, n) {
             const e = t.filters.concat([ n ]);
             return new an(t.path, t.collectionGroup, t.explicitOrderBy.slice(), e, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
@@ -4664,12 +4685,12 @@ class sr extends er {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function ir(t, n, e) {
-    const r = n, s = nr("where", t);
-    return new sr(s, r, e);
+ */ function sr(t, n, e) {
+    const r = n, s = tr("where", t);
+    return new rr(s, r, e);
 }
 
-class or extends er {
+class ir extends nr {
     constructor(t, n) {
         super(), this.dt = t, this._t = n, this.type = "orderBy";
     }
@@ -4682,7 +4703,7 @@ class or extends er {
                 if (null === ln(t)) {
                     // This is the first order by. It must match any inequality.
                     const e = fn(t);
-                    null !== e && vr(t, e, n.field);
+                    null !== e && gr(t, e, n.field);
                 }
             }(t, r), r;
         }
@@ -4697,7 +4718,7 @@ class or extends er {
  * 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 de(t.firestore, t.converter, function(t, n) {
+        return new fe(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 an(t.path, t.collectionGroup, e, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
@@ -4713,17 +4734,17 @@ class or extends er {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function ur(t, n = "asc") {
-    const e = n, r = nr("orderBy", t);
-    return new or(r, e);
+ */ function or(t, n = "asc") {
+    const e = n, r = tr("orderBy", t);
+    return new ir(r, e);
 }
 
-class cr extends er {
+class ur extends nr {
     constructor(t, n, e) {
         super(), this.type = t, this.gt = n, this.vt = e;
     }
     _apply(t) {
-        return new de(t.firestore, t.converter, function(t, n, e) {
+        return new fe(t.firestore, t.converter, function(t, n, e) {
             return new an(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), n, e, t.startAt, t.endAt);
         }(t._query, this.gt, this.vt));
     }
@@ -4734,8 +4755,8 @@ class cr extends er {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function ar(t) {
-    return ct("limit", t), new cr("limit", t, "F" /* First */);
+ */ function cr(t) {
+    return ct("limit", t), new ur("limit", t, "F" /* First */);
 }
 
 /**
@@ -4746,53 +4767,55 @@ class cr extends er {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function hr(t) {
-    return ct("limitToLast", t), new cr("limitToLast", t, "L" /* Last */);
+ */ function ar(t) {
+    return ct("limitToLast", t), new ur("limitToLast", t, "L" /* Last */);
 }
 
-class lr extends er {
+class hr extends nr {
     constructor(t, n, e) {
         super(), this.type = t, this.bt = n, this.Et = e;
     }
     _apply(t) {
-        const n = yr(t, this.type, this.bt, this.Et);
-        return new de(t.firestore, t.converter, function(t, n) {
+        const n = pr(t, this.type, this.bt, this.Et);
+        return new fe(t.firestore, t.converter, function(t, n) {
             return new an(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, n, t.endAt);
         }(t._query, n));
     }
 }
 
-function fr(...t) {
-    return new lr("startAt", t, /*before=*/ !0);
+function lr(...t) {
+    return new hr("startAt", t, 
+    /*inclusive=*/ !0);
 }
 
-function dr(...t) {
-    return new lr("startAfter", t, 
-    /*before=*/ !1);
+function fr(...t) {
+    return new hr("startAfter", t, 
+    /*inclusive=*/ !1);
 }
 
-class wr extends er {
+class dr extends nr {
     constructor(t, n, e) {
         super(), this.type = t, this.bt = n, this.Et = e;
     }
     _apply(t) {
-        const n = yr(t, this.type, this.bt, this.Et);
-        return new de(t.firestore, t.converter, function(t, n) {
+        const n = pr(t, this.type, this.bt, this.Et);
+        return new fe(t.firestore, t.converter, function(t, n) {
             return new an(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, n);
         }(t._query, n));
     }
 }
 
-function mr(...t) {
-    return new wr("endBefore", t, /*before=*/ !0);
+function wr(...t) {
+    return new dr("endBefore", t, 
+    /*inclusive=*/ !1);
 }
 
-function pr(...t) {
-    return new wr("endAt", t, /*before=*/ !1);
+function mr(...t) {
+    return new dr("endAt", t, /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function yr(t, n, e, r) {
-    if (e[0] = l(e[0]), e[0] instanceof Je) return function(t, n, e, r, s) {
+/** Helper function to create a bound from a document or fields */ function pr(t, n, e, r) {
+    if (e[0] = l(e[0]), e[0] instanceof Ke) return function(t, n, e, r, s) {
         if (!r) throw new U(V, `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
@@ -4817,7 +4840,7 @@ function pr(...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 = $e(t.firestore);
+        const s = De(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;
@@ -4833,7 +4856,7 @@ function pr(...t) {
                     const s = new et(e);
                     u.push(kt(n, s));
                 } else {
-                    const t = je(e, r, c);
+                    const t = Ue(e, r, c);
                     u.push(t);
                 }
             }
@@ -4847,7 +4870,7 @@ function pr(...t) {
     }
 }
 
-function _r(t, n, e) {
+function yr(t, n, e) {
     if ("string" == typeof (e = l(e))) {
         if ("" === e) throw new U(R, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
         if (!dn(n) && -1 !== e.indexOf("/")) throw new U(R, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${e}' contains a '/' character.`);
@@ -4855,19 +4878,19 @@ function _r(t, n, e) {
         if (!et.isDocumentKey(r)) throw new U(R, `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 kt(t, new et(r));
     }
-    if (e instanceof fe) return kt(t, e._key);
+    if (e instanceof le) return kt(t, e._key);
     throw new U(R, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${ot(e)}.`);
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function gr(t, n) {
+ */ function _r(t, n) {
     if (!Array.isArray(t) || 0 === t.length) throw new U(R, `Invalid Query. A non-empty array is required for '${n.toString()}' filters.`);
     if (t.length > 10) throw new U(R, `Invalid Query. '${n.toString()}' filters support a maximum of 10 elements in the value array.`);
 }
 
-function vr(t, n, e) {
+function gr(t, n, e) {
     if (!e.isEqual(n)) throw new U(R, `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.`);
 }
 
@@ -4918,7 +4941,7 @@ function vr(t, n, e) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function br(t, n, e) {
+function vr(t, n, e) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -4927,7 +4950,7 @@ function br(t, n, e) {
     r;
 }
 
-class Er extends class {
+class br extends class {
     convertValue(t, n = "none") {
         switch (xt(t)) {
           case 0 /* NullValue */ :
@@ -4974,7 +4997,7 @@ class Er extends class {
         })), e;
     }
     convertGeoPoint(t) {
-        return new Ie(Nt(t.latitude), Nt(t.longitude));
+        return new Te(Nt(t.latitude), Nt(t.longitude));
     }
     convertArray(t, n) {
         return (t.values || []).map((t => this.convertValue(t, n)));
@@ -4998,7 +5021,7 @@ class Er extends class {
     }
     convertDocumentKey(t, n) {
         const e = Z.fromString(t);
-        b(Jn(e));
+        b(Kn(e));
         const r = new J(e.get(1), e.get(3)), s = new et(e.popFirst(5));
         return r.isEqual(n) || 
         // TODO(b/64130202): Somehow support foreign references.
@@ -5010,11 +5033,11 @@ class Er extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new Ee(t);
+        return new be(t);
     }
     convertReference(t) {
         const n = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new fe(this.firestore, /* converter= */ null, n);
+        return new le(this.firestore, /* converter= */ null, n);
     }
 }
 
@@ -5030,12 +5053,12 @@ class Er extends class {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function Tr(t) {
-    const n = ie((t = ut(t, fe)).firestore), e = new Er(t.firestore);
-    return ee(n, [ t._key ]).then((n => {
+ */ function Er(t) {
+    const n = se((t = ut(t, le)).firestore), e = new br(t.firestore);
+    return ne(n, [ t._key ]).then((n => {
         b(1 === n.length);
         const r = n[0];
-        return new Je(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new Ke(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5050,33 +5073,33 @@ class Er extends class {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function Ir(t) {
+ */ function Tr(t) {
     !function(t) {
         if (hn(t) && 0 === t.explicitOrderBy.length) throw new U(O, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = ut(t, de))._query);
-    const n = ie(t.firestore), e = new Er(t.firestore);
-    return re(n, t._query).then((n => {
-        const r = n.map((n => new Xe(t.firestore, e, n.key, n, t.converter)));
+    }((t = ut(t, fe))._query);
+    const n = se(t.firestore), e = new br(t.firestore);
+    return ee(n, t._query).then((n => {
+        const r = n.map((n => new Je(t.firestore, e, n.key, n, t.converter)));
         return hn(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 Ze(t, r);
+        r.reverse(), new Xe(t, r);
     }));
 }
 
-function Ar(t, n, e) {
-    const r = br((t = ut(t, fe)).converter, n, e), s = Se($e(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
-    return ne(ie(t.firestore), [ s.toMutation(t._key, In.none()) ]);
+function Ir(t, n, e) {
+    const r = vr((t = ut(t, le)).converter, n, e), s = $e(De(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
+    return te(se(t.firestore), [ s.toMutation(t._key, In.none()) ]);
 }
 
-function Rr(t, n, e, ...r) {
-    const s = $e((t = ut(t, fe)).firestore);
+function Ar(t, n, e, ...r) {
+    const s = De((t = ut(t, le)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    i = "string" == typeof (n = l(n)) || n instanceof ve ? Ue(s, "updateDoc", t._key, n, e, r) : ke(s, "updateDoc", t._key, n);
-    return ne(ie(t.firestore), [ i.toMutation(t._key, In.exists(!0)) ]);
+    i = "string" == typeof (n = l(n)) || n instanceof ge ? ke(s, "updateDoc", t._key, n, e, r) : Le(s, "updateDoc", t._key, n);
+    return te(se(t.firestore), [ i.toMutation(t._key, In.exists(!0)) ]);
 }
 
 /**
@@ -5090,8 +5113,8 @@ function Rr(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 Pr(t) {
-    return ne(ie((t = ut(t, fe)).firestore), [ new Vn(t._key, In.none()) ]);
+ */ function Rr(t) {
+    return te(se((t = ut(t, le)).firestore), [ new Vn(t._key, In.none()) ]);
 }
 
 /**
@@ -5108,9 +5131,9 @@ function Rr(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 Vr(t, n) {
-    const e = ye(t = ut(t, we)), r = br(t.converter, n), s = Se($e(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
-    return ne(ie(t.firestore), [ s.toMutation(e._key, In.exists(!1)) ]).then((() => e));
+ */ function Pr(t, n) {
+    const e = pe(t = ut(t, de)), r = vr(t.converter, n), s = $e(De(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
+    return te(se(t.firestore), [ s.toMutation(e._key, In.exists(!1)) ]).then((() => e));
 }
 
 /**
@@ -5132,15 +5155,15 @@ function Rr(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 Nr() {
-    return new Fe("deleteField");
+ */ function Vr() {
+    return new Se("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 Dr() {
-    return new qe("serverTimestamp");
+ */ function Nr() {
+    return new xe("serverTimestamp");
 }
 
 /**
@@ -5154,10 +5177,10 @@ function Rr(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 $r(...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 Oe("arrayUnion", t);
+    return new qe("arrayUnion", t);
 }
 
 /**
@@ -5170,10 +5193,10 @@ function Rr(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 Sr(...t) {
+ */ function $r(...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 Ce("arrayRemove", t);
+    return new Oe("arrayRemove", t);
 }
 
 /**
@@ -5194,8 +5217,8 @@ function Rr(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 Fr(t) {
-    return new Le("increment", t);
+ */ function Sr(t) {
+    return new Ce("increment", t);
 }
 
 /**
@@ -5221,24 +5244,24 @@ function Rr(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 xr {
+ */ class Fr {
     /** @hideconstructor */
     constructor(t, n) {
         this._firestore = t, this._commitHandler = n, this._mutations = [], this._committed = !1, 
-        this._dataReader = $e(t);
+        this._dataReader = De(t);
     }
     set(t, n, e) {
         this._verifyNotCommitted();
-        const r = qr(t, this._firestore), s = br(r.converter, n, e), i = Se(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
+        const r = xr(t, this._firestore), s = vr(r.converter, n, e), i = $e(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
         return this._mutations.push(i.toMutation(r._key, In.none())), this;
     }
     update(t, n, e, ...r) {
         this._verifyNotCommitted();
-        const s = qr(t, this._firestore);
+        const s = xr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (n = l(n)) || n instanceof ve ? Ue(this._dataReader, "WriteBatch.update", s._key, n, e, r) : ke(this._dataReader, "WriteBatch.update", s._key, n), 
+        return i = "string" == typeof (n = l(n)) || n instanceof ge ? ke(this._dataReader, "WriteBatch.update", s._key, n, e, r) : Le(this._dataReader, "WriteBatch.update", s._key, n), 
         this._mutations.push(i.toMutation(s._key, In.exists(!0))), this;
     }
     /**
@@ -5248,7 +5271,7 @@ function Rr(t, n, e, ...r) {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const n = qr(t, this._firestore);
+        const n = xr(t, this._firestore);
         return this._mutations = this._mutations.concat(new Vn(n._key, In.none())), this;
     }
     /**
@@ -5270,7 +5293,7 @@ function Rr(t, n, e, ...r) {
     }
 }
 
-function qr(t, n) {
+function xr(t, n) {
     if ((t = l(t)).firestore !== n) throw new U(R, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -5287,9 +5310,9 @@ function qr(t, n) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function Or(t) {
-    const n = ie(t = ut(t, ue));
-    return new xr(t, (t => ne(n, t)));
+ */ function qr(t) {
+    const n = se(t = ut(t, oe));
+    return new Fr(t, (t => te(n, t)));
 }
 
 /**
@@ -5311,7 +5334,7 @@ function qr(t, n) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ class Cr {
+ */ class Or {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5331,7 +5354,7 @@ function qr(t, n) {
     }
     async lookup(t) {
         if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new U(R, "Firestore transactions require all reads to be executed before all writes.");
-        const n = await ee(this.datastore, t);
+        const n = await ne(this.datastore, t);
         return n.forEach((t => this.recordVersion(t))), n;
     }
     set(t, n) {
@@ -5360,7 +5383,7 @@ function qr(t, n) {
         t.forEach(((t, n) => {
             const e = et.fromPath(n);
             this.mutations.push(new Nn(e, this.precondition(e)));
-        })), await ne(this.datastore, this.mutations), this.committed = !0;
+        })), await te(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let n;
@@ -5434,17 +5457,17 @@ function qr(t, n) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class Lr {
+class Cr {
     constructor(t, n, e, r) {
         this.asyncQueue = t, this.datastore = n, this.updateFunction = e, this.deferred = r, 
-        this.Tt = 5, this.It = new Zn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.Tt = 5, this.It = new Xn(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 Cr(this.datastore), n = this.Rt(t);
+            const t = new Or(this.datastore), n = this.Rt(t);
             n && n.then((n => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(n);
@@ -5534,7 +5557,7 @@ class Lr {
  * 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 kr() {
+/** The Platform's 'document' implementation or null if not available. */ function Lr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5566,7 +5589,7 @@ class Lr {
  * 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 Ur {
+ */ class kr {
     constructor(t, n, e, r, s) {
         this.asyncQueue = t, this.timerId = n, this.targetTimeMs = e, this.op = r, this.removalCallback = s, 
         this.deferred = new j, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
@@ -5589,7 +5612,7 @@ class Lr {
      *   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 Ur(t, n, i, r, s);
+        const i = Date.now() + e, o = new kr(t, n, i, r, s);
         return o.start(e), o;
     }
     /**
@@ -5638,7 +5661,7 @@ class Lr {
  * 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 jr {
+ */ class Ur {
     constructor() {
         // The last promise in the queue.
         this.Nt = Promise.resolve(), 
@@ -5661,15 +5684,15 @@ class Lr {
         // List of TimerIds to fast-forward delays for.
         this.Ot = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new Zn(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new Xn(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 = kr();
+            const t = Lr();
             t && p("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
         };
-        const t = kr();
+        const t = Lr();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ct);
     }
     get isShuttingDown() {
@@ -5690,7 +5713,7 @@ class Lr {
     enterRestrictedMode(t) {
         if (!this.$t) {
             this.$t = !0, this.qt = t || !1;
-            const n = kr();
+            const n = Lr();
             n && "function" == typeof n.removeEventListener && n.removeEventListener("visibilitychange", this.Ct);
         }
     }
@@ -5822,7 +5845,7 @@ class Lr {
         this.Lt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ot.indexOf(t) > -1 && (n = 0);
-        const r = Ur.createAndSchedule(this, t, n, e, (t => this.jt(t)));
+        const r = kr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
         return this.St.push(r), r;
     }
     Lt() {
@@ -5866,7 +5889,7 @@ class Lr {
     }
     /**
      * For Tests: Skip all subsequent delays for a timer id.
-     */    Qt(t) {
+     */    Gt(t) {
         this.Ot.push(t);
     }
     /** Called once a DelayedOperation is run or canceled. */    jt(t) {
@@ -5876,10 +5899,10 @@ class Lr {
     }
 }
 
-class Mr {
+class jr {
     /** @hideconstructor */
     constructor(t, n) {
-        this._firestore = t, this._transaction = n, this._dataReader = $e(t);
+        this._firestore = t, this._transaction = n, this._dataReader = De(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -5887,25 +5910,25 @@ class Mr {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const n = qr(t, this._firestore), e = new Er(this._firestore);
+        const n = xr(t, this._firestore), e = new br(this._firestore);
         return this._transaction.lookup([ n._key ]).then((t => {
             if (!t || 1 !== t.length) return v();
             const r = t[0];
-            if (r.isFoundDocument()) return new Je(this._firestore, e, r.key, r, n.converter);
-            if (r.isNoDocument()) return new Je(this._firestore, e, n._key, null, n.converter);
+            if (r.isFoundDocument()) return new Ke(this._firestore, e, r.key, r, n.converter);
+            if (r.isNoDocument()) return new Ke(this._firestore, e, n._key, null, n.converter);
             throw v();
         }));
     }
     set(t, n, e) {
-        const r = qr(t, this._firestore), s = br(r.converter, n, e), i = Se(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, e);
+        const r = xr(t, this._firestore), s = vr(r.converter, n, e), i = $e(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 = qr(t, this._firestore);
+        const s = xr(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 let i;
-        return i = "string" == typeof (n = l(n)) || n instanceof ve ? Ue(this._dataReader, "Transaction.update", s._key, n, e, r) : ke(this._dataReader, "Transaction.update", s._key, n), 
+        return i = "string" == typeof (n = l(n)) || n instanceof ge ? ke(this._dataReader, "Transaction.update", s._key, n, e, r) : Le(this._dataReader, "Transaction.update", s._key, n), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -5914,7 +5937,7 @@ class Mr {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const n = qr(t, this._firestore);
+        const n = xr(t, this._firestore);
         return this._transaction.delete(n._key), this;
     }
 }
@@ -5935,9 +5958,9 @@ class Mr {
  * (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 Br(t, n) {
-    const e = ie(t = ut(t, ue)), r = new j;
-    return new Lr(new jr, e, (e => n(new Mr(t, e))), r).run(), r.promise;
+ */ function Mr(t, n) {
+    const e = se(t = ut(t, oe)), r = new j;
+    return new Cr(new Ur, e, (e => n(new jr(t, e))), r).run(), r.promise;
 }
 
 /**
@@ -5950,11 +5973,11 @@ class Mr {
  */ !function(t) {
     d = t;
 }(`${s}_lite`), e(new i("firestore/lite", ((t, {options: n}) => {
-    const e = t.getProvider("app").getImmediate(), r = new ue(e, new Q(t.getProvider("auth-internal")), new H(t.getProvider("app-check-internal")));
+    const e = t.getProvider("app").getImmediate(), r = new oe(e, new G(t.getProvider("auth-internal")), new H(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
-r("firestore-lite", "3.4.4", "rn"), r("firestore-lite", "3.4.4", "esm2017");
+r("firestore-lite", "3.4.5-2022116201138", "rn"), r("firestore-lite", "3.4.5-2022116201138", "esm2017");
 
-export { Ee as Bytes, we as CollectionReference, fe as DocumentReference, Je as DocumentSnapshot, ve as FieldPath, Te as FieldValue, ue as Firestore, U as FirestoreError, Ie as GeoPoint, de as Query, er as QueryConstraint, Xe as QueryDocumentSnapshot, Ze as QuerySnapshot, vt as Timestamp, Mr as Transaction, xr as WriteBatch, Vr as addDoc, Sr as arrayRemove, $r as arrayUnion, me as collection, pe as collectionGroup, he as connectFirestoreEmulator, Pr as deleteDoc, Nr as deleteField, ye as doc, be as documentId, pr as endAt, mr as endBefore, Tr as getDoc, Ir as getDocs, ae as getFirestore, Fr as increment, ce as initializeFirestore, ar as limit, hr as limitToLast, ur as orderBy, rr as query, ge as queryEqual, _e as refEqual, Br as runTransaction, Dr as serverTimestamp, Ar as setDoc, m as setLogLevel, tr as snapshotEqual, dr as startAfter, fr as startAt, le as terminate, Rr as updateDoc, ir as where, Or as writeBatch };
+export { be as Bytes, de as CollectionReference, le as DocumentReference, Ke as DocumentSnapshot, ge as FieldPath, Ee as FieldValue, oe as Firestore, U as FirestoreError, Te as GeoPoint, fe as Query, nr as QueryConstraint, Je as QueryDocumentSnapshot, Xe as QuerySnapshot, vt as Timestamp, jr as Transaction, Fr as WriteBatch, Pr as addDoc, $r as arrayRemove, Dr as arrayUnion, we as collection, me as collectionGroup, ae as connectFirestoreEmulator, Rr as deleteDoc, Vr as deleteField, pe as doc, ve as documentId, mr as endAt, wr as endBefore, Er as getDoc, Tr as getDocs, ce as getFirestore, Sr as increment, ue as initializeFirestore, cr as limit, ar as limitToLast, or as orderBy, er as query, _e as queryEqual, ye as refEqual, Mr as runTransaction, Nr as serverTimestamp, Ir as setDoc, m as setLogLevel, Ze as snapshotEqual, fr as startAfter, lr as startAt, he as terminate, Ar as updateDoc, sr as where, qr as writeBatch };
 //# sourceMappingURL=index.rn.esm2017.js.map