@firebase/firestore 3.4.7 → 3.4.8-canary.44948ac91

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.10";
+let d = "9.6.11-canary.44948ac91";
 
 /**
  * @license
@@ -2358,14 +2358,10 @@ function cn(t, n) {
 }
 
 /** Creates a new Query for a query that matches all documents at `path` */ function hn(t) {
-    return !at(t.limit) && "L" /* Last */ === t.limitType;
-}
-
-function ln(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function fn(t) {
+function ln(t) {
     for (const n of t.filters) if (n.D()) return n.field;
     return null;
 }
@@ -2378,7 +2374,7 @@ function fn(t) {
  * Returns whether the query matches a collection group rather than a specific
  * collection.
  */
-function dn(t) {
+function fn(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2386,11 +2382,11 @@ function dn(t) {
  * Returns the implicit order by constraint that is used to execute the Query,
  * which can be different from the order by constraints the user provided (e.g.
  * the SDK and backend always orders by `__name__`).
- */ function wn(t) {
+ */ function dn(t) {
     const n = E(t);
     if (null === n.$) {
         n.$ = [];
-        const t = fn(n), e = ln(n);
+        const t = ln(n), e = hn(n);
         if (null !== t && null === e) 
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
@@ -2411,24 +2407,24 @@ function dn(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function mn(t) {
+ */ function wn(t) {
     const n = E(t);
-    if (!n.S) if ("F" /* First */ === n.limitType) n.S = Yt(n.path, n.collectionGroup, wn(n), n.filters, n.limit, n.startAt, n.endAt); else {
+    if (!n.S) if ("F" /* First */ === n.limitType) n.S = Yt(n.path, n.collectionGroup, dn(n), n.filters, n.limit, n.startAt, n.endAt); else {
         // Flip the orderBy directions since we want the last results
         const t = [];
-        for (const e of wn(n)) {
+        for (const e of dn(n)) {
             const n = "desc" /* DESCENDING */ === e.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
             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.inclusive) : null, r = n.startAt ? new sn(n.startAt.position, !n.startAt.inclusive) : 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);
     }
     return n.S;
 }
 
-function pn(t, n) {
+function mn(t, n) {
     return function(t, n) {
         if (t.limit !== n.limit) return !1;
         if (t.orderBy.length !== n.orderBy.length) return !1;
@@ -2438,7 +2434,7 @@ function pn(t, n) {
         e.op !== r.op || !e.field.isEqual(r.field) || !qt(e.value, r.value)) return !1;
         var e, r;
         return t.collectionGroup === n.collectionGroup && !!t.path.isEqual(n.path) && !!cn(t.startAt, n.startAt) && cn(t.endAt, n.endAt);
-    }(mn(t), mn(n)) && t.limitType === n.limitType;
+    }(wn(t), wn(n)) && t.limitType === n.limitType;
 }
 
 /**
@@ -2466,7 +2462,7 @@ function pn(t, n) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function yn(t, n) {
+function pn(t, n) {
     return function(t) {
         return "number" == typeof t && Number.isInteger(t) && !ht(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(n) ? 
@@ -2511,7 +2507,7 @@ function yn(t, n) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Used to represent a field transform on a mutation. */ class _n {
+/** Used to represent a field transform on a mutation. */ class yn {
     constructor() {
         // Make sure that the structural type of `TransformOperation` is unique.
         // See https://github.com/microsoft/TypeScript/issues/5451
@@ -2519,15 +2515,15 @@ function yn(t, n) {
     }
 }
 
-/** Transforms a value into a server-generated timestamp. */ class gn extends _n {}
+/** Transforms a value into a server-generated timestamp. */ class _n extends yn {}
 
-/** Transforms an array value via a union operation. */ class vn extends _n {
+/** Transforms an array value via a union operation. */ class gn extends yn {
     constructor(t) {
         super(), this.elements = t;
     }
 }
 
-/** Transforms an array value via a remove operation. */ class bn extends _n {
+/** Transforms an array value via a remove operation. */ class vn extends yn {
     constructor(t) {
         super(), this.elements = t;
     }
@@ -2538,7 +2534,7 @@ function yn(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 En extends _n {
+ */ class bn extends yn {
     constructor(t, n) {
         super(), this.q = t, this.O = n;
     }
@@ -2560,7 +2556,7 @@ function yn(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 Tn {
+/** A field path and the TransformOperation to perform upon it. */ class En {
     constructor(t, n) {
         this.field = t, this.transform = n;
     }
@@ -2570,18 +2566,18 @@ function yn(t, n) {
  * Encodes a precondition for a mutation. This follows the model that the
  * backend accepts with the special case of an explicit "empty" precondition
  * (meaning no precondition).
- */ class In {
+ */ class Tn {
     constructor(t, n) {
         this.updateTime = t, this.exists = n;
     }
     /** Creates a new empty Precondition. */    static none() {
-        return new In;
+        return new Tn;
     }
     /** Creates a new Precondition with an exists flag. */    static exists(t) {
-        return new In(void 0, t);
+        return new Tn(void 0, t);
     }
     /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {
-        return new In(t);
+        return new Tn(t);
     }
     /** Returns whether this Precondition is empty. */    get isNone() {
         return void 0 === this.updateTime && void 0 === this.exists;
@@ -2634,12 +2630,12 @@ function yn(t, n) {
  * applyToLocalView() to implement the actual behavior of applying the mutation
  * to some source document (see `setMutationApplyToRemoteDocument()` for an
  * example).
- */ class An {}
+ */ class In {}
 
 /**
  * A mutation that creates or replaces the document at the given key with the
  * object value contents.
- */ class Rn extends An {
+ */ class An extends In {
     constructor(t, n, e, r = []) {
         super(), this.key = t, this.value = n, this.precondition = e, this.fieldTransforms = r, 
         this.type = 0 /* Set */;
@@ -2658,14 +2654,14 @@ function yn(t, n) {
  *    is deleted.
  *  * When a field is not in the mask but is in the values, the values map is
  *    ignored.
- */ class Pn extends An {
+ */ class Rn extends In {
     constructor(t, n, e, r, s = []) {
         super(), this.key = t, this.data = n, this.fieldMask = e, this.precondition = r, 
         this.fieldTransforms = s, this.type = 1 /* Patch */;
     }
 }
 
-/** A mutation that deletes the document at the given key. */ class Vn extends An {
+/** A mutation that deletes the document at the given key. */ class Pn extends In {
     constructor(t, n) {
         super(), this.key = t, this.precondition = n, this.type = 2 /* Delete */ , this.fieldTransforms = [];
     }
@@ -2677,7 +2673,7 @@ function yn(t, n) {
  *
  * The `verify` operation is only used in Transactions, and this class serves
  * primarily to facilitate serialization into protos.
- */ class Nn extends An {
+ */ class Vn extends In {
     constructor(t, n) {
         super(), this.key = t, this.precondition = n, this.type = 3 /* Verify */ , this.fieldTransforms = [];
     }
@@ -2698,13 +2694,13 @@ function yn(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 Dn = (() => {
+ */ const Nn = (() => {
     const t = {
         asc: "ASCENDING",
         desc: "DESCENDING"
     };
     return t;
-})(), $n = (() => {
+})(), Dn = (() => {
     const t = {
         "<": "LESS_THAN",
         "<=": "LESS_THAN_OR_EQUAL",
@@ -2734,7 +2730,7 @@ function yn(t, n) {
  * TODO(klimt): We can remove the databaseId argument if we keep the full
  * resource name in documents.
  */
-class Sn {
+class $n {
     constructor(t, n) {
         this.databaseId = t, this.F = n;
     }
@@ -2751,7 +2747,7 @@ class Sn {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Fn(t, n) {
+function Sn(t, n) {
     if (t.F) {
         return `${new Date(1e3 * n.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + n.nanoseconds).slice(-9)}Z`;
     }
@@ -2766,35 +2762,35 @@ function Fn(t, n) {
  *
  * Visible for testing.
  */
-function xn(t, n) {
+function Fn(t, n) {
     return t.F ? n.toBase64() : n.toUint8Array();
 }
 
-function qn(t, n) {
-    return Fn(t, n.toTimestamp());
+function xn(t, n) {
+    return Sn(t, n.toTimestamp());
 }
 
-function On(t) {
+function qn(t) {
     return b(!!t), bt.fromTimestamp(function(t) {
         const n = Vt(t);
         return new vt(n.seconds, n.nanos);
     }(t));
 }
 
-function Cn(t, n) {
+function On(t, n) {
     return function(t) {
         return new Z([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(n).canonicalString();
 }
 
-function Ln(t, n) {
-    return Cn(t.databaseId, n.path);
+function Cn(t, n) {
+    return On(t.databaseId, n.path);
 }
 
-function kn(t, n) {
+function Ln(t, n) {
     const e = function(t) {
         const n = Z.fromString(t);
-        return b(Kn(n)), n;
+        return b(Hn(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);
@@ -2802,25 +2798,25 @@ function kn(t, n) {
     var r;
     /** Creates a Document proto from key and fields (but no create/update time) */}
 
-function Un(t, n) {
-    return Cn(t.databaseId, n);
+function kn(t, n) {
+    return On(t.databaseId, n);
 }
 
-function jn(t) {
+function Un(t) {
     return new Z([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function Mn(t, n, e) {
+function jn(t, n, e) {
     return {
-        name: Ln(t, n),
+        name: Cn(t, n),
         fields: e.value.mapValue.fields
     };
 }
 
-function Bn(t, n) {
+function Mn(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 Gt({
+        const e = Ln(t, n.found.name), r = qn(n.found.updateTime), s = new Gt({
             mapValue: {
                 fields: n.found.fields
             }
@@ -2828,67 +2824,67 @@ function Bn(t, n) {
         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);
+        const e = Ln(t, n.missing), r = qn(n.readTime);
         return Qt.newNoDocument(e, r);
     }(t, n) : v();
 }
 
-function zn(t, n) {
+function Bn(t, n) {
     let e;
-    if (n instanceof Rn) e = {
-        update: Mn(t, n.key, n.value)
-    }; else if (n instanceof Vn) e = {
-        delete: Ln(t, n.key)
+    if (n instanceof An) e = {
+        update: jn(t, n.key, n.value)
     }; else if (n instanceof Pn) e = {
-        update: Mn(t, n.key, n.data),
-        updateMask: Hn(n.fieldMask)
+        delete: Cn(t, n.key)
+    }; else if (n instanceof Rn) e = {
+        update: jn(t, n.key, n.data),
+        updateMask: Yn(n.fieldMask)
     }; else {
-        if (!(n instanceof Nn)) return v();
+        if (!(n instanceof Vn)) return v();
         e = {
-            verify: Ln(t, n.key)
+            verify: Cn(t, n.key)
         };
     }
     return n.fieldTransforms.length > 0 && (e.updateTransforms = n.fieldTransforms.map((t => function(t, n) {
         const e = n.transform;
-        if (e instanceof gn) return {
+        if (e instanceof _n) return {
             fieldPath: n.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
-        if (e instanceof vn) return {
+        if (e instanceof gn) return {
             fieldPath: n.field.canonicalString(),
             appendMissingElements: {
                 values: e.elements
             }
         };
-        if (e instanceof bn) return {
+        if (e instanceof vn) return {
             fieldPath: n.field.canonicalString(),
             removeAllFromArray: {
                 values: e.elements
             }
         };
-        if (e instanceof En) return {
+        if (e instanceof bn) return {
             fieldPath: n.field.canonicalString(),
             increment: e.O
         };
         throw v();
     }(0, t)))), n.precondition.isNone || (e.currentDocument = function(t, n) {
         return void 0 !== n.updateTime ? {
-            updateTime: qn(t, n.updateTime)
+            updateTime: xn(t, n.updateTime)
         } : void 0 !== n.exists ? {
             exists: n.exists
         } : v();
     }(t, n.precondition)), e;
 }
 
-function Gn(t, n) {
+function zn(t, n) {
     // Dissect the path into parent, collectionId, and optional key filter.
     const e = {
         structuredQuery: {}
     }, r = n.path;
-    null !== n.collectionGroup ? (e.parent = Un(t, r), e.structuredQuery.from = [ {
+    null !== n.collectionGroup ? (e.parent = kn(t, r), e.structuredQuery.from = [ {
         collectionId: n.collectionGroup,
         allDescendants: !0
-    } ]) : (e.parent = Un(t, r.popLast()), e.structuredQuery.from = [ {
+    } ]) : (e.parent = kn(t, r.popLast()), e.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     const s = function(t) {
@@ -2899,34 +2895,34 @@ function Gn(t, n) {
             if ("==" /* EQUAL */ === t.op) {
                 if (Mt(t.value)) return {
                     unaryFilter: {
-                        field: Yn(t.field),
+                        field: Wn(t.field),
                         op: "IS_NAN"
                     }
                 };
                 if (jt(t.value)) return {
                     unaryFilter: {
-                        field: Yn(t.field),
+                        field: Wn(t.field),
                         op: "IS_NULL"
                     }
                 };
             } else if ("!=" /* NOT_EQUAL */ === t.op) {
                 if (Mt(t.value)) return {
                     unaryFilter: {
-                        field: Yn(t.field),
+                        field: Wn(t.field),
                         op: "IS_NOT_NAN"
                     }
                 };
                 if (jt(t.value)) return {
                     unaryFilter: {
-                        field: Yn(t.field),
+                        field: Wn(t.field),
                         op: "IS_NOT_NULL"
                     }
                 };
             }
             return {
                 fieldFilter: {
-                    field: Yn(t.field),
-                    op: Wn(t.op),
+                    field: Wn(t.field),
+                    op: Qn(t.op),
                     value: t.value
                 }
             };
@@ -2946,8 +2942,8 @@ function Gn(t, n) {
         // visible for testing
         function(t) {
             return {
-                field: Yn(t.field),
-                direction: Qn(t.dir)
+                field: Wn(t.field),
+                direction: Gn(t.dir)
             };
         }(t)));
     }(n.orderBy);
@@ -2971,29 +2967,29 @@ function Gn(t, n) {
     (n.endAt)), e;
 }
 
-function Qn(t) {
-    return Dn[t];
+function Gn(t) {
+    return Nn[t];
 }
 
 // visible for testing
-function Wn(t) {
-    return $n[t];
+function Qn(t) {
+    return Dn[t];
 }
 
-function Yn(t) {
+function Wn(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function Hn(t) {
+function Yn(t) {
     const n = [];
     return t.fields.forEach((t => n.push(t.canonicalString()))), {
         fieldPaths: n
     };
 }
 
-function Kn(t) {
+function Hn(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -3013,8 +3009,8 @@ function Kn(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 Jn(t) {
-    return new Sn(t, /* useProto3Json= */ !0);
+ */ function Kn(t) {
+    return new $n(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -3042,7 +3038,7 @@ function Kn(t) {
  * base delay. This prevents clients from accidentally synchronizing their
  * delays causing spikes of load to the backend.
  */
-class Xn {
+class Jn {
     constructor(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3140,7 +3136,7 @@ class Xn {
  * An implementation of Datastore that exposes additional state for internal
  * consumption.
  */
-class Zn extends class {} {
+class Xn extends class {} {
     constructor(t, n, e, r) {
         super(), this.authCredentials = t, this.appCheckCredentials = n, this.K = e, this.q = r, 
         this.J = !1;
@@ -3167,19 +3163,19 @@ class Zn extends class {} {
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-async function te(t, n) {
-    const e = E(t), r = jn(e.q) + "/documents", s = {
-        writes: n.map((t => zn(e.q, t)))
+async function Zn(t, n) {
+    const e = E(t), r = Un(e.q) + "/documents", s = {
+        writes: n.map((t => Bn(e.q, t)))
     };
     await e.m("Commit", r, s);
 }
 
-async function ne(t, n) {
-    const e = E(t), r = jn(e.q) + "/documents", s = {
-        documents: n.map((t => Ln(e.q, t)))
+async function te(t, n) {
+    const e = E(t), r = Un(e.q) + "/documents", s = {
+        documents: n.map((t => Cn(e.q, t)))
     }, i = await e.T("BatchGetDocuments", r, s), o = new Map;
     i.forEach((t => {
-        const n = Bn(e.q, t);
+        const n = Mn(e.q, t);
         o.set(n.key.toString(), n);
     }));
     const u = [];
@@ -3189,12 +3185,12 @@ async function ne(t, n) {
     })), u;
 }
 
-async function ee(t, n) {
-    const e = E(t), r = Gn(e.q, mn(n));
+async function ne(t, n) {
+    const e = E(t), r = zn(e.q, wn(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 Gt({
+        const r = Ln(t, n.name), s = qn(n.updateTime), i = new Gt({
             mapValue: {
                 fields: n.fields
             }
@@ -3218,7 +3214,7 @@ async function ee(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 re = new Map;
+ */ const ee = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3229,17 +3225,17 @@ async function ee(t, n) {
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
  */
-function se(t) {
+function re(t) {
     if (t._terminated) throw new U(F, "The client has already been terminated.");
-    if (!re.has(t)) {
+    if (!ee.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 = Jn(t._databaseId), u = function(t, n, e, r) {
-            return new Zn(t, n, e, r);
+        new K(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);
         }(t._authCredentials, t._appCheckCredentials, i, o);
-        re.set(t, u);
+        ee.set(t, u);
     }
     var n, e, r, s;
     /**
@@ -3257,7 +3253,7 @@ function se(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 re.get(t);
+ */    return ee.get(t);
 }
 
 /**
@@ -3269,7 +3265,7 @@ function se(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 ie {
+class se {
     constructor(t) {
         var n;
         if (void 0 === t.host) {
@@ -3311,14 +3307,14 @@ class ie {
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link getFirestore}.
- */ class oe {
+ */ class ie {
     /** @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 ie({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new se({}), 
         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.');
@@ -3351,7 +3347,7 @@ class ie {
     }
     _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 ie(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new se(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new B;
             switch (t.type) {
               case "gapi":
@@ -3392,13 +3388,13 @@ class ie {
      * Only ever called once.
      */    _terminate() {
         return function(t) {
-            const n = re.get(t);
-            n && (p("ComponentProvider", "Removing Datastore"), re.delete(t), n.terminate());
+            const n = ee.get(t);
+            n && (p("ComponentProvider", "Removing Datastore"), ee.delete(t), n.terminate());
         }(this), Promise.resolve();
     }
 }
 
-function ue(t, n) {
+function oe(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({
@@ -3414,7 +3410,7 @@ function ue(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 ce(n = t()) {
+ */ function ue(n = t()) {
     return _getProvider(n, "firestore/lite").getImmediate();
 }
 
@@ -3430,9 +3426,9 @@ function ue(t, n) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function ae(t, n, e, r = {}) {
+ */ function ce(t, n, e, r = {}) {
     var s;
-    const i = (t = ut(t, oe))._getSettings();
+    const i = (t = ut(t, ie))._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}`,
@@ -3470,8 +3466,8 @@ function ue(t, n) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function he(t) {
-    return t = ut(t, oe), n(t.app, "firestore/lite"), t._delete();
+ */ function ae(t) {
+    return t = ut(t, ie), n(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3511,7 +3507,7 @@ function ue(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 le {
+class he {
     /** @hideconstructor */
     constructor(t, 
     /**
@@ -3539,17 +3535,17 @@ class le {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new de(this.firestore, this.converter, this._key.path.popLast());
+        return new fe(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
-        return new le(this.firestore, t, this._key);
+        return new he(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 fe {
+ */ class le {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     constructor(t, 
@@ -3562,14 +3558,14 @@ class le {
         this.type = "query", this.firestore = t;
     }
     withConverter(t) {
-        return new fe(this.firestore, t, this._query);
+        return new le(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 de extends fe {
+ */ class fe extends le {
     /** @hideconstructor */
     constructor(t, n, e) {
         super(t, n, new an(e)), this._path = e, 
@@ -3590,23 +3586,23 @@ class le {
      * subcollection. If this isn't a subcollection, the reference is null.
      */    get parent() {
         const t = this._path.popLast();
-        return t.isEmpty() ? null : new le(this.firestore, 
+        return t.isEmpty() ? null : new he(this.firestore, 
         /* converter= */ null, new et(t));
     }
     withConverter(t) {
-        return new de(this.firestore, t, this._path);
+        return new fe(this.firestore, t, this._path);
     }
 }
 
-function we(t, n, ...e) {
-    if (t = l(t), rt("collection", "path", n), t instanceof oe) {
+function de(t, n, ...e) {
+    if (t = l(t), rt("collection", "path", n), t instanceof ie) {
         const r = Z.fromString(n, ...e);
-        return it(r), new de(t, /* converter= */ null, r);
+        return it(r), new fe(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof le || t instanceof de)) throw new U(R, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof he || t instanceof fe)) 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 de(t.firestore, 
+        return it(r), new fe(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -3623,9 +3619,9 @@ function we(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 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, 
+ */ function we(t, n) {
+    if (t = ut(t, ie), 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 le(t, 
     /* converter= */ null, 
     /**
  * Creates a new Query for a collection group query that matches all documents
@@ -3636,19 +3632,19 @@ function we(t, n, ...e) {
     }(n));
 }
 
-function pe(t, n, ...e) {
+function me(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 oe) {
+    1 === arguments.length && (n = yt.R()), rt("doc", "path", n), t instanceof ie) {
         const r = Z.fromString(n, ...e);
-        return st(r), new le(t, 
+        return st(r), new he(t, 
         /* converter= */ null, new et(r));
     }
     {
-        if (!(t instanceof le || t instanceof de)) throw new U(R, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof he || t instanceof fe)) 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 le(t.firestore, t instanceof de ? t.converter : null, new et(r));
+        return st(r), new he(t.firestore, t instanceof fe ? t.converter : null, new et(r));
     }
 }
 
@@ -3659,8 +3655,8 @@ function pe(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 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);
+ */ function pe(t, n) {
+    return t = l(t), n = l(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);
 }
 
 /**
@@ -3671,8 +3667,8 @@ function pe(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 _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);
+ */ function ye(t, n) {
+    return t = l(t), n = l(n), t instanceof le && n instanceof le && (t.firestore === n.firestore && mn(t._query, n._query) && t.converter === n.converter);
 }
 
 /**
@@ -3698,7 +3694,7 @@ function pe(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 ge {
+ */ class _e {
     /**
      * 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.
@@ -3722,8 +3718,8 @@ function pe(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 ve() {
-    return new ge("__name__");
+ */ function ge() {
+    return new _e("__name__");
 }
 
 /**
@@ -3744,7 +3740,7 @@ function pe(t, n, ...e) {
  */
 /**
  * An immutable object representing an array of bytes.
- */ class be {
+ */ class ve {
     /** @hideconstructor */
     constructor(t) {
         this._byteString = t;
@@ -3756,7 +3752,7 @@ function pe(t, n, ...e) {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    static fromBase64String(t) {
         try {
-            return new be(Rt.fromBase64String(t));
+            return new ve(Rt.fromBase64String(t));
         } catch (t) {
             throw new U(R, "Failed to construct data from Base64 string: " + t);
         }
@@ -3766,7 +3762,7 @@ function pe(t, n, ...e) {
      *
      * @param array - The Uint8Array used to create the `Bytes` object.
      */    static fromUint8Array(t) {
-        return new be(Rt.fromUint8Array(t));
+        return new ve(Rt.fromUint8Array(t));
     }
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -3818,7 +3814,7 @@ function pe(t, n, ...e) {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ class Ee {
+ */ class be {
     /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
@@ -3850,7 +3846,7 @@ function pe(t, n, ...e) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ class Te {
+ */ class Ee {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -3909,29 +3905,29 @@ function pe(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 Ie = /^__.*__$/;
+ */ const Te = /^__.*__$/;
 
-/** The result of parsing document data (e.g. for a setData call). */ class Ae {
+/** The result of parsing document data (e.g. for a setData call). */ class Ie {
     constructor(t, n, e) {
         this.data = t, this.fieldMask = n, this.fieldTransforms = e;
     }
     toMutation(t, n) {
-        return null !== this.fieldMask ? new Pn(t, this.data, this.fieldMask, n, this.fieldTransforms) : new Rn(t, this.data, n, this.fieldTransforms);
+        return null !== this.fieldMask ? new Rn(t, this.data, this.fieldMask, n, this.fieldTransforms) : new An(t, this.data, n, this.fieldTransforms);
     }
 }
 
-/** The result of parsing "update" data (i.e. for an updateData call). */ class Re {
+/** The result of parsing "update" data (i.e. for an updateData call). */ class Ae {
     constructor(t, 
     // The fieldMask does not include document transforms.
     n, e) {
         this.data = t, this.fieldMask = n, this.fieldTransforms = e;
     }
     toMutation(t, n) {
-        return new Pn(t, this.data, this.fieldMask, n, this.fieldTransforms);
+        return new Rn(t, this.data, this.fieldMask, n, this.fieldTransforms);
     }
 }
 
-function Pe(t) {
+function Re(t) {
     switch (t) {
       case 0 /* Set */ :
  // fall through
@@ -3949,7 +3945,7 @@ function Pe(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ class Ve {
+/** A "context" object passed around while parsing user data. */ class Pe {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -3981,7 +3977,7 @@ function Pe(t) {
         return this.settings.tt;
     }
     /** Returns a new context with the specified settings overwritten. */    nt(t) {
-        return new Ve(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
+        return new Pe(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.q, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
     et(t) {
         var n;
@@ -4008,7 +4004,7 @@ function Pe(t) {
         });
     }
     ut(t) {
-        return Ye(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.at);
+        return We(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)));
@@ -4020,19 +4016,19 @@ function Pe(t) {
     }
     st(t) {
         if (0 === t.length) throw this.ut("Document fields must not be empty");
-        if (Pe(this.tt) && Ie.test(t)) throw this.ut('Document fields cannot begin and end with "__"');
+        if (Re(this.tt) && Te.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 Ne {
+ */ class Ve {
     constructor(t, n, e) {
-        this.databaseId = t, this.ignoreUndefinedProperties = n, this.q = e || Jn(t);
+        this.databaseId = t, this.ignoreUndefinedProperties = n, this.q = e || Kn(t);
     }
     /** Creates a new top-level parse context. */    ht(t, n, e, r = !1) {
-        return new Ve({
+        return new Pe({
             tt: t,
             methodName: n,
             at: e,
@@ -4043,29 +4039,29 @@ function Pe(t) {
     }
 }
 
-function De(t) {
-    const n = t._freezeSettings(), e = Jn(t._databaseId);
-    return new Ne(t._databaseId, !!n.ignoreUndefinedProperties, e);
+function Ne(t) {
+    const n = t._freezeSettings(), e = Kn(t._databaseId);
+    return new Ve(t._databaseId, !!n.ignoreUndefinedProperties, e);
 }
 
-/** Parse document data from a set() call. */ function $e(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);
-    ze("Data must be an object, but it was:", o, r);
-    const u = Me(r, o);
+    Be("Data must be an object, but it was:", o, r);
+    const u = je(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);
+            const s = ze(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.`);
-            He(t, s) || t.push(s);
+            Ye(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 Ae(new Gt(u), c, a);
+    return new Ie(new Gt(u), c, a);
 }
 
-class Se extends Ee {
+class $e 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
@@ -4073,7 +4069,7 @@ class Se extends Ee {
         return t.fieldMask.push(t.path), null;
     }
     isEqual(t) {
-        return t instanceof Se;
+        return t instanceof $e;
     }
 }
 
@@ -4092,8 +4088,8 @@ class Se extends Ee {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function Fe(t, n, e) {
-    return new Ve({
+ */ function Se(t, n, e) {
+    return new Pe({
         tt: 3 /* Argument */ ,
         at: n.settings.at,
         methodName: t._methodName,
@@ -4101,23 +4097,23 @@ class Se extends Ee {
     }, n.databaseId, n.q, n.ignoreUndefinedProperties);
 }
 
-class xe extends Ee {
+class Fe extends be {
     _toFieldTransform(t) {
-        return new Tn(t.path, new gn);
+        return new En(t.path, new _n);
     }
     isEqual(t) {
-        return t instanceof xe;
+        return t instanceof Fe;
     }
 }
 
-class qe extends Ee {
+class xe extends be {
     constructor(t, n) {
         super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        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);
+        const n = Se(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => Ue(t, n))), r = new gn(e);
+        return new En(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4125,14 +4121,14 @@ class qe extends Ee {
     }
 }
 
-class Oe extends Ee {
+class qe extends be {
     constructor(t, n) {
         super(t), this.lt = n;
     }
     _toFieldTransform(t) {
-        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);
+        const n = Se(this, t, 
+        /*array=*/ !0), e = this.lt.map((t => Ue(t, n))), r = new vn(e);
+        return new En(t.path, r);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4140,13 +4136,13 @@ class Oe extends Ee {
     }
 }
 
-class Ce extends Ee {
+class Oe extends be {
     constructor(t, n) {
         super(t), this.ft = n;
     }
     _toFieldTransform(t) {
-        const n = new En(t.q, yn(t.q, this.ft));
-        return new Tn(t.path, n);
+        const n = new bn(t.q, pn(t.q, this.ft));
+        return new En(t.path, n);
     }
     isEqual(t) {
         // TODO(mrschmidt): Implement isEquals
@@ -4154,50 +4150,50 @@ class Ce extends Ee {
     }
 }
 
-/** Parse update data from an update() call. */ function Le(t, n, e, r) {
+/** Parse update data from an update() call. */ function Ce(t, n, e, r) {
     const s = t.ht(1 /* Update */ , n, e);
-    ze("Data must be an object, but it was:", s, r);
+    Be("Data must be an object, but it was:", s, r);
     const i = [], o = Gt.empty();
     Tt(r, ((t, r) => {
-        const u = We(n, t, e);
+        const u = Qe(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 Se) 
+        if (r instanceof $e) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
-            const t = je(r, c);
+            const t = Ue(r, c);
             null != t && (i.push(u), o.set(u, t));
         }
     }));
     const u = new It(i);
-    return new Re(o, u, s.fieldTransforms);
+    return new Ae(o, u, s.fieldTransforms);
 }
 
-/** 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 ];
+/** 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 ];
     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]);
+    for (let t = 0; t < i.length; t += 2) u.push(ze(n, i[t])), c.push(i[t + 1]);
     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 (!He(a, u[t])) {
+    for (let t = u.length - 1; t >= 0; --t) if (!Ye(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 Se) 
+        if (e instanceof $e) 
         // Add it to the field mask, but don't add anything to updateData.
         a.push(n); else {
-            const t = je(e, r);
+            const t = Ue(e, r);
             null != t && (a.push(n), h.set(n, t));
         }
     }
     const f = new It(a);
-    return new Re(h, f, o.fieldTransforms);
+    return new Ae(h, f, o.fieldTransforms);
 }
 
 /**
@@ -4206,8 +4202,8 @@ class Ce extends Ee {
  *
  * @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 je(e, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
+ */ function ke(t, n, e, r = !1) {
+    return Ue(e, t.ht(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
 }
 
 /**
@@ -4218,12 +4214,12 @@ class Ce extends Ee {
  * 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 je(t, n) {
-    if (Be(
+ */ function Ue(t, n) {
+    if (Me(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = l(t))) return ze("Unsupported field value:", n, t), Me(t, n);
-    if (t instanceof Ee) 
+    t = l(t))) return Be("Unsupported field value:", n, t), je(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
     // (as doing so will overwrite the field directly prior to the transform
@@ -4235,7 +4231,7 @@ class Ce extends Ee {
  */
     return function(t, n) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Pe(n.tt)) throw n.ut(`${t._methodName}() can only be used with update() and set()`);
+        if (!Re(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);
@@ -4265,7 +4261,7 @@ class Ce extends Ee {
             const e = [];
             let r = 0;
             for (const s of t) {
-                let t = je(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.
@@ -4284,7 +4280,7 @@ class Ce extends Ee {
         if (null === (t = l(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return yn(n.q, t);
+        if ("number" == typeof t) return pn(n.q, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4294,7 +4290,7 @@ class Ce extends Ee {
         if (t instanceof Date) {
             const e = vt.fromDate(t);
             return {
-                timestampValue: Fn(n.q, e)
+                timestampValue: Sn(n.q, e)
             };
         }
         if (t instanceof vt) {
@@ -4303,23 +4299,23 @@ class Ce extends Ee {
             // truncation immediately without waiting for the backend to do that.
             const e = new vt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Fn(n.q, e)
+                timestampValue: Sn(n.q, e)
             };
         }
-        if (t instanceof Te) return {
+        if (t instanceof Ee) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof be) return {
-            bytesValue: xn(n.q, t._byteString)
+        if (t instanceof ve) return {
+            bytesValue: Fn(n.q, t._byteString)
         };
-        if (t instanceof le) {
+        if (t instanceof he) {
             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 {
-                referenceValue: Cn(t.firestore._databaseId || n.databaseId, t._key.path)
+                referenceValue: On(t.firestore._databaseId || n.databaseId, t._key.path)
             };
         }
         throw n.ut(`Unsupported field value: ${ot(t)}`);
@@ -4333,13 +4329,13 @@ class Ce extends Ee {
  */ (t, n);
 }
 
-function Me(t, n) {
+function je(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 = je(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
@@ -4351,12 +4347,12 @@ function Me(t, n) {
     };
 }
 
-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 Me(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof vt || t instanceof Ee || t instanceof ve || t instanceof he || t instanceof be);
 }
 
-function ze(t, n, e) {
-    if (!Be(e) || !function(t) {
+function Be(t, n, e) {
+    if (!Me(e) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(e)) {
         const r = ot(e);
@@ -4366,20 +4362,20 @@ function ze(t, n, e) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function Ge(t, n, e) {
+ */ function ze(t, n, e) {
     if ((
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    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, 
+    n = l(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, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, e);
 }
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ const Qe = new RegExp("[~\\*/\\[\\]]");
+ */ const Ge = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4389,20 +4385,20 @@ function ze(t, n, e) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function We(t, n, e) {
-    if (n.search(Qe) >= 0) throw Ye(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
+ */ function Qe(t, n, e) {
+    if (n.search(Ge) >= 0) throw We(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, e);
     try {
-        return new ge(...n.split("."))._internalPath;
+        return new _e(...n.split("."))._internalPath;
     } catch (r) {
-        throw Ye(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
+        throw We(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, e);
     }
 }
 
-function Ye(t, n, e, r, s) {
+function We(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 += ". ";
@@ -4411,7 +4407,7 @@ function Ye(t, n, e, r, s) {
     c += ")"), new U(R, u + t + c);
 }
 
-/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function He(t, n) {
+/** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function Ye(t, n) {
     return t.some((t => t.isEqual(n)));
 }
 
@@ -4439,7 +4435,7 @@ function Ye(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 Ke {
+ */ class He {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4455,7 +4451,7 @@ function Ye(t, n, e, r, s) {
     /**
      * The `DocumentReference` for the document included in the `DocumentSnapshot`.
      */    get ref() {
-        return new le(this._firestore, this._converter, this._key);
+        return new he(this._firestore, this._converter, this._key);
     }
     /**
      * Signals whether or not the document at the snapshot's location exists.
@@ -4475,7 +4471,7 @@ function Ye(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 Je(this._firestore, this._userDataWriter, this._key, this._document, 
+                const t = new Ke(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4495,7 +4491,7 @@ function Ye(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(tr("DocumentSnapshot.get", t));
+            const n = this._document.data.field(Ze("DocumentSnapshot.get", t));
             if (null !== n) return this._userDataWriter.convertValue(n);
         }
     }
@@ -4511,7 +4507,7 @@ function Ye(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 Je extends Ke {
+ */ class Ke extends He {
     /**
      * Retrieves all fields in the document as an `Object`.
      *
@@ -4529,7 +4525,7 @@ function Ye(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 Xe {
+ */ class Je {
     /** @hideconstructor */
     constructor(t, n) {
         this._docs = n, this.query = t;
@@ -4560,14 +4556,14 @@ function Ye(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 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));
+ */ function Xe(t, n) {
+    return t = l(t), n = l(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) && gt(t.docs, n.docs, Xe));
 }
 
 /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
- */ function tr(t, n) {
-    return "string" == typeof n ? We(t, n) : n instanceof ge ? n._internalPath : n._delegate._internalPath;
+ */ function Ze(t, n) {
+    return "string" == typeof n ? Qe(t, n) : n instanceof _e ? n._internalPath : n._delegate._internalPath;
 }
 
 /**
@@ -4594,7 +4590,7 @@ function Ye(t, n, e, r, s) {
  * can then be passed to {@link query} to create a new query instance that
  * also contains this `QueryConstraint`.
  */
-class nr {}
+class tr {}
 
 /**
  * Creates a new immutable instance of {@link Query} that is extended to also include
@@ -4604,40 +4600,40 @@ class nr {}
  * @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 er(t, ...n) {
+ */ function nr(t, ...n) {
     for (const e of n) t = e._apply(t);
     return t;
 }
 
-class rr extends nr {
+class er extends tr {
     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 = Ne(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) {
-                    _r(o, i);
+                    yr(o, i);
                     const n = [];
-                    for (const e of o) n.push(yr(r, t, e));
+                    for (const e of o) n.push(pr(r, t, e));
                     u = {
                         arrayValue: {
                             values: n
                         }
                     };
-                } 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, 
+                } 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 = ke(e, n, o, 
             /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
             const c = Ht.create(s, i, u);
             return function(t, n) {
                 if (n.D()) {
-                    const e = fn(t);
+                    const e = ln(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 && gr(t, n.field, r);
+                    const r = hn(t);
+                    null !== r && _r(t, n.field, r);
                 }
                 const e = function(t, n) {
                     for (const e of t.filters) if (n.indexOf(e.op) >= 0) return e.op;
@@ -4681,7 +4677,7 @@ class rr extends nr {
                 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 fe(t.firestore, t.converter, function(t, n) {
+        return new le(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));
@@ -4698,12 +4694,12 @@ class rr extends nr {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link Query}.
- */ function sr(t, n, e) {
-    const r = n, s = tr("where", t);
-    return new rr(s, r, e);
+ */ function rr(t, n, e) {
+    const r = n, s = Ze("where", t);
+    return new er(s, r, e);
 }
 
-class ir extends nr {
+class sr extends tr {
     constructor(t, n) {
         super(), this.dt = t, this._t = n, this.type = "orderBy";
     }
@@ -4713,10 +4709,10 @@ class ir extends nr {
             if (null !== t.endAt) throw new U(R, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
             const r = new on(n, e);
             return function(t, n) {
-                if (null === ln(t)) {
+                if (null === hn(t)) {
                     // This is the first order by. It must match any inequality.
-                    const e = fn(t);
-                    null !== e && gr(t, e, n.field);
+                    const e = ln(t);
+                    null !== e && _r(t, e, n.field);
                 }
             }(t, r), r;
         }
@@ -4731,7 +4727,7 @@ class ir extends nr {
  * 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 fe(t.firestore, t.converter, function(t, n) {
+        return new le(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);
@@ -4747,17 +4743,17 @@ class ir extends nr {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link Query}.
- */ function or(t, n = "asc") {
-    const e = n, r = tr("orderBy", t);
-    return new ir(r, e);
+ */ function ir(t, n = "asc") {
+    const e = n, r = Ze("orderBy", t);
+    return new sr(r, e);
 }
 
-class ur extends nr {
+class or extends tr {
     constructor(t, n, e) {
         super(), this.type = t, this.gt = n, this.vt = e;
     }
     _apply(t) {
-        return new fe(t.firestore, t.converter, function(t, n, e) {
+        return new le(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));
     }
@@ -4768,8 +4764,8 @@ class ur extends nr {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function cr(t) {
-    return ct("limit", t), new ur("limit", t, "F" /* First */);
+ */ function ur(t) {
+    return ct("limit", t), new or("limit", t, "F" /* First */);
 }
 
 /**
@@ -4780,55 +4776,55 @@ class ur extends nr {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link Query}.
- */ function ar(t) {
-    return ct("limitToLast", t), new ur("limitToLast", t, "L" /* Last */);
+ */ function cr(t) {
+    return ct("limitToLast", t), new or("limitToLast", t, "L" /* Last */);
 }
 
-class hr extends nr {
+class ar extends tr {
     constructor(t, n, e) {
         super(), this.type = t, this.bt = n, this.Et = e;
     }
     _apply(t) {
-        const n = pr(t, this.type, this.bt, this.Et);
-        return new fe(t.firestore, t.converter, function(t, n) {
+        const n = mr(t, this.type, this.bt, this.Et);
+        return new le(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 lr(...t) {
-    return new hr("startAt", t, 
+function hr(...t) {
+    return new ar("startAt", t, 
     /*inclusive=*/ !0);
 }
 
-function fr(...t) {
-    return new hr("startAfter", t, 
+function lr(...t) {
+    return new ar("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
-class dr extends nr {
+class fr extends tr {
     constructor(t, n, e) {
         super(), this.type = t, this.bt = n, this.Et = e;
     }
     _apply(t) {
-        const n = pr(t, this.type, this.bt, this.Et);
-        return new fe(t.firestore, t.converter, function(t, n) {
+        const n = mr(t, this.type, this.bt, this.Et);
+        return new le(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 wr(...t) {
-    return new dr("endBefore", t, 
+function dr(...t) {
+    return new fr("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function mr(...t) {
-    return new dr("endAt", t, /*inclusive=*/ !0);
+function wr(...t) {
+    return new fr("endAt", t, /*inclusive=*/ !0);
 }
 
-/** 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) {
+/** Helper function to create a bound from a document or fields */ function mr(t, n, e, r) {
+    if (e[0] = l(e[0]), e[0] instanceof He) 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
@@ -4838,7 +4834,7 @@ function mr(...t) {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-                for (const e of wn(t)) if (e.field.isKeyField()) i.push(kt(n, r.key)); else {
+                for (const e of dn(t)) if (e.field.isKeyField()) i.push(kt(n, r.key)); else {
             const t = r.data.field(e.field);
             if ($t(t)) throw new U(R, 'Invalid query. You are trying to start or end a query using a document for which the field "' + e.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
             if (null === t) {
@@ -4853,7 +4849,7 @@ function mr(...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 = Ne(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;
@@ -4863,13 +4859,13 @@ function mr(...t) {
                 const c = s[i];
                 if (o[i].field.isKeyField()) {
                     if ("string" != typeof c) throw new U(R, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
-                    if (!dn(t) && -1 !== c.indexOf("/")) throw new U(R, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
+                    if (!fn(t) && -1 !== c.indexOf("/")) throw new U(R, `Invalid query. When querying a collection and ordering by documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
                     const e = t.path.child(Z.fromString(c));
                     if (!et.isDocumentKey(e)) throw new U(R, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${e}' is not because it contains an odd number of segments.`);
                     const s = new et(e);
                     u.push(kt(n, s));
                 } else {
-                    const t = Ue(e, r, c);
+                    const t = ke(e, r, c);
                     u.push(t);
                 }
             }
@@ -4883,27 +4879,27 @@ function mr(...t) {
     }
 }
 
-function yr(t, n, e) {
+function pr(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.`);
+        if (!fn(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.`);
         const r = n.path.child(Z.fromString(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 le) return kt(t, e._key);
+    if (e instanceof he) 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 _r(t, n) {
+ */ function yr(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 gr(t, n, e) {
+function _r(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.`);
 }
 
@@ -4954,7 +4950,7 @@ function gr(t, n, e) {
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
  */
-function vr(t, n, e) {
+function gr(t, n, e) {
     let r;
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
@@ -4963,7 +4959,7 @@ function vr(t, n, e) {
     r;
 }
 
-class br extends class {
+class vr extends class {
     convertValue(t, n = "none") {
         switch (xt(t)) {
           case 0 /* NullValue */ :
@@ -5010,7 +5006,7 @@ class br extends class {
         })), e;
     }
     convertGeoPoint(t) {
-        return new Te(Nt(t.latitude), Nt(t.longitude));
+        return new Ee(Nt(t.latitude), Nt(t.longitude));
     }
     convertArray(t, n) {
         return (t.values || []).map((t => this.convertValue(t, n)));
@@ -5034,7 +5030,7 @@ class br extends class {
     }
     convertDocumentKey(t, n) {
         const e = Z.fromString(t);
-        b(Kn(e));
+        b(Hn(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.
@@ -5046,11 +5042,11 @@ class br extends class {
         super(), this.firestore = t;
     }
     convertBytes(t) {
-        return new be(t);
+        return new ve(t);
     }
     convertReference(t) {
         const n = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new le(this.firestore, /* converter= */ null, n);
+        return new he(this.firestore, /* converter= */ null, n);
     }
 }
 
@@ -5066,12 +5062,12 @@ class br extends class {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function Er(t) {
-    const n = se((t = ut(t, le)).firestore), e = new br(t.firestore);
-    return ne(n, [ t._key ]).then((n => {
+ */ function br(t) {
+    const n = re((t = ut(t, he)).firestore), e = new vr(t.firestore);
+    return te(n, [ t._key ]).then((n => {
         b(1 === n.length);
         const r = n[0];
-        return new Ke(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new He(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5086,33 +5082,33 @@ class br extends class {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function Tr(t) {
+ */ function Er(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, 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) && 
+        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new U(O, "limitToLast() queries require specifying at least one orderBy() clause");
+    }((t = ut(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)));
+        return "L" /* Last */ === t._query.limitType && 
         // 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 Xe(t, r);
+        r.reverse(), new Je(t, r);
     }));
 }
 
-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 Tr(t, n, e) {
+    const r = gr((t = ut(t, he)).converter, n, e), s = De(Ne(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
+    return Zn(re(t.firestore), [ s.toMutation(t._key, Tn.none()) ]);
 }
 
-function Ar(t, n, e, ...r) {
-    const s = De((t = ut(t, le)).firestore);
+function Ir(t, n, e, ...r) {
+    const s = Ne((t = ut(t, he)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
         let i;
-    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)) ]);
+    i = "string" == typeof (n = l(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, Tn.exists(!0)) ]);
 }
 
 /**
@@ -5126,8 +5122,8 @@ function Ar(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 Rr(t) {
-    return te(se((t = ut(t, le)).firestore), [ new Vn(t._key, In.none()) ]);
+ */ function Ar(t) {
+    return Zn(re((t = ut(t, he)).firestore), [ new Pn(t._key, Tn.none()) ]);
 }
 
 /**
@@ -5144,9 +5140,9 @@ function Ar(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 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));
+ */ function Rr(t, n) {
+    const e = me(t = ut(t, fe)), r = gr(t.converter, n), s = De(Ne(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
+    return Zn(re(t.firestore), [ s.toMutation(e._key, Tn.exists(!1)) ]).then((() => e));
 }
 
 /**
@@ -5168,15 +5164,15 @@ function Ar(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 Vr() {
-    return new Se("deleteField");
+ */ function Pr() {
+    return new $e("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 Nr() {
-    return new xe("serverTimestamp");
+ */ function Vr() {
+    return new Fe("serverTimestamp");
 }
 
 /**
@@ -5190,10 +5186,10 @@ function Ar(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 Nr(...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("arrayUnion", t);
+    return new xe("arrayUnion", t);
 }
 
 /**
@@ -5206,10 +5202,10 @@ function Ar(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 $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("arrayRemove", t);
+    return new qe("arrayRemove", t);
 }
 
 /**
@@ -5230,8 +5226,8 @@ function Ar(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 Sr(t) {
-    return new Ce("increment", t);
+ */ function $r(t) {
+    return new Oe("increment", t);
 }
 
 /**
@@ -5257,25 +5253,25 @@ function Ar(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 Fr {
+ */ class Sr {
     /** @hideconstructor */
     constructor(t, n) {
         this._firestore = t, this._commitHandler = n, this._mutations = [], this._committed = !1, 
-        this._dataReader = De(t);
+        this._dataReader = Ne(t);
     }
     set(t, n, e) {
         this._verifyNotCommitted();
-        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;
+        const r = Fr(t, this._firestore), s = gr(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, Tn.none())), this;
     }
     update(t, n, e, ...r) {
         this._verifyNotCommitted();
-        const s = xr(t, this._firestore);
+        const s = Fr(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 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;
+        return i = "string" == typeof (n = l(n)) || n instanceof _e ? Le(this._dataReader, "WriteBatch.update", s._key, n, e, r) : Ce(this._dataReader, "WriteBatch.update", s._key, n), 
+        this._mutations.push(i.toMutation(s._key, Tn.exists(!0))), this;
     }
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -5284,8 +5280,8 @@ function Ar(t, n, e, ...r) {
      * @returns This `WriteBatch` instance. Used for chaining method calls.
      */    delete(t) {
         this._verifyNotCommitted();
-        const n = xr(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Vn(n._key, In.none())), this;
+        const n = Fr(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Pn(n._key, Tn.none())), this;
     }
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5306,7 +5302,7 @@ function Ar(t, n, e, ...r) {
     }
 }
 
-function xr(t, n) {
+function Fr(t, n) {
     if ((t = l(t)).firestore !== n) throw new U(R, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -5323,9 +5319,9 @@ function xr(t, n) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function qr(t) {
-    const n = se(t = ut(t, oe));
-    return new Fr(t, (t => te(n, t)));
+ */ function xr(t) {
+    const n = re(t = ut(t, ie));
+    return new Sr(t, (t => Zn(n, t)));
 }
 
 /**
@@ -5347,7 +5343,7 @@ function xr(t, n) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ class Or {
+ */ class qr {
     constructor(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5367,7 +5363,7 @@ function xr(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 ne(this.datastore, t);
+        const n = await te(this.datastore, t);
         return n.forEach((t => this.recordVersion(t))), n;
     }
     set(t, n) {
@@ -5382,7 +5378,7 @@ function xr(t, n) {
         this.writtenDocs.add(t.toString());
     }
     delete(t) {
-        this.write(new Vn(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Pn(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }
     async commit() {
         if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
@@ -5395,8 +5391,8 @@ function xr(t, n) {
         // a `verify` operation.
         t.forEach(((t, n) => {
             const e = et.fromPath(n);
-            this.mutations.push(new Nn(e, this.precondition(e)));
-        })), await te(this.datastore, this.mutations), this.committed = !0;
+            this.mutations.push(new Vn(e, this.precondition(e)));
+        })), await Zn(this.datastore, this.mutations), this.committed = !0;
     }
     recordVersion(t) {
         let n;
@@ -5417,7 +5413,7 @@ function xr(t, n) {
      * as a precondition, or no precondition if it was not read.
      */    precondition(t) {
         const n = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && n ? In.updateTime(n) : In.none();
+        return !this.writtenDocs.has(t.toString()) && n ? Tn.updateTime(n) : Tn.none();
     }
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -5438,11 +5434,11 @@ function xr(t, n) {
             // transaction.
             throw new U(R, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return In.updateTime(n);
+                        return Tn.updateTime(n);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-        return In.exists(!0);
+        return Tn.exists(!0);
     }
     write(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
@@ -5470,17 +5466,17 @@ function xr(t, n) {
  * TransactionRunner encapsulates the logic needed to run and retry transactions
  * with backoff.
  */
-class Cr {
+class Or {
     constructor(t, n, e, r) {
         this.asyncQueue = t, this.datastore = n, this.updateFunction = e, this.deferred = r, 
-        this.Tt = 5, this.It = new Xn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.Tt = 5, this.It = new Jn(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 Or(this.datastore), n = this.Rt(t);
+            const t = new qr(this.datastore), n = this.Rt(t);
             n && n.then((n => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(n);
@@ -5570,7 +5566,7 @@ class Cr {
  * 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 Lr() {
+/** The Platform's 'document' implementation or null if not available. */ function Cr() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -5602,7 +5598,7 @@ class Cr {
  * 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 kr {
+ */ class Lr {
     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), 
@@ -5625,7 +5621,7 @@ class Cr {
      *   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 kr(t, n, i, r, s);
+        const i = Date.now() + e, o = new Lr(t, n, i, r, s);
         return o.start(e), o;
     }
     /**
@@ -5674,7 +5670,7 @@ class Cr {
  * 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 kr {
     constructor() {
         // The last promise in the queue.
         this.Nt = Promise.resolve(), 
@@ -5697,15 +5693,15 @@ class Cr {
         // List of TimerIds to fast-forward delays for.
         this.Ot = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.It = new Xn(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.It = new Jn(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 = Lr();
+            const t = Cr();
             t && p("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
         };
-        const t = Lr();
+        const t = Cr();
         t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ct);
     }
     get isShuttingDown() {
@@ -5726,7 +5722,7 @@ class Cr {
     enterRestrictedMode(t) {
         if (!this.$t) {
             this.$t = !0, this.qt = t || !1;
-            const n = Lr();
+            const n = Cr();
             n && "function" == typeof n.removeEventListener && n.removeEventListener("visibilitychange", this.Ct);
         }
     }
@@ -5858,7 +5854,7 @@ class Cr {
         this.Lt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ot.indexOf(t) > -1 && (n = 0);
-        const r = kr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
+        const r = Lr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
         return this.St.push(r), r;
     }
     Lt() {
@@ -5912,10 +5908,10 @@ class Cr {
     }
 }
 
-class jr {
+class Ur {
     /** @hideconstructor */
     constructor(t, n) {
-        this._firestore = t, this._transaction = n, this._dataReader = De(t);
+        this._firestore = t, this._transaction = n, this._dataReader = Ne(t);
     }
     /**
      * Reads the document referenced by the provided {@link DocumentReference}.
@@ -5923,25 +5919,25 @@ class jr {
      * @param documentRef - A reference to the document to be read.
      * @returns A `DocumentSnapshot` with the read data.
      */    get(t) {
-        const n = xr(t, this._firestore), e = new br(this._firestore);
+        const n = Fr(t, this._firestore), e = new vr(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 Ke(this._firestore, e, r.key, r, n.converter);
-            if (r.isNoDocument()) return new Ke(this._firestore, e, n._key, null, n.converter);
+            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);
             throw v();
         }));
     }
     set(t, n, 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);
+        const r = Fr(t, this._firestore), s = gr(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 = xr(t, this._firestore);
+        const s = Fr(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 ge ? ke(this._dataReader, "Transaction.update", s._key, n, e, r) : Le(this._dataReader, "Transaction.update", s._key, n), 
+        return i = "string" == typeof (n = l(n)) || n instanceof _e ? Le(this._dataReader, "Transaction.update", s._key, n, e, r) : Ce(this._dataReader, "Transaction.update", s._key, n), 
         this._transaction.update(s._key, i), this;
     }
     /**
@@ -5950,7 +5946,7 @@ class jr {
      * @param documentRef - A reference to the document to be deleted.
      * @returns This `Transaction` instance. Used for chaining method calls.
      */    delete(t) {
-        const n = xr(t, this._firestore);
+        const n = Fr(t, this._firestore);
         return this._transaction.delete(n._key), this;
     }
 }
@@ -5971,9 +5967,9 @@ class jr {
  * (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 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;
+ */ function jr(t, n) {
+    const e = re(t = ut(t, ie)), r = new j;
+    return new Or(new kr, e, (e => n(new Ur(t, e))), r).run(), r.promise;
 }
 
 /**
@@ -5986,11 +5982,11 @@ class jr {
  */ !function(t) {
     d = t;
 }(`${s}_lite`), e(new i("firestore/lite", ((t, {options: n}) => {
-    const e = t.getProvider("app").getImmediate(), r = new oe(e, new G(t.getProvider("auth-internal")), new H(t.getProvider("app-check-internal")));
+    const e = t.getProvider("app").getImmediate(), r = new ie(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.7", "rn"), r("firestore-lite", "3.4.7", "esm2017");
+r("firestore-lite", "3.4.8-canary.44948ac91", "rn"), r("firestore-lite", "3.4.8-canary.44948ac91", "esm2017");
 
-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 };
+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, vt as Timestamp, Ur as Transaction, Sr as WriteBatch, Rr as addDoc, Dr as arrayRemove, Nr 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, m as setLogLevel, Xe as snapshotEqual, lr as startAfter, hr as startAt, ae as terminate, Ir as updateDoc, rr as where, xr as writeBatch };
 //# sourceMappingURL=index.rn.esm2017.js.map