@firebase/firestore 3.7.1 → 3.7.2-canary.457fc2eeb

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

@@ -66,7 +66,7 @@ w.MOCK_USER = new w("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let m = "9.12.1";
+let m = "9.13.0-canary.457fc2eeb";
 
 /**
  * @license
@@ -200,7 +200,7 @@ function _(t, ...e) {
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function T(t, 
+ */ function A(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     return t;
@@ -221,7 +221,7 @@ 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 A = "ok", R = "cancelled", P = "unknown", V = "invalid-argument", N = "deadline-exceeded", $ = "not-found", D = "already-exists", x = "permission-denied", S = "unauthenticated", F = "resource-exhausted", q = "failed-precondition", O = "aborted", k = "out-of-range", C = "unimplemented", L = "internal", M = "unavailable", U = "data-loss";
+ */ const T = "ok", R = "cancelled", P = "unknown", V = "invalid-argument", N = "deadline-exceeded", $ = "not-found", D = "already-exists", x = "permission-denied", S = "unauthenticated", F = "resource-exhausted", q = "failed-precondition", O = "aborted", k = "out-of-range", C = "unimplemented", L = "internal", M = "unavailable", U = "data-loss";
 
 /** An error returned by a Firestore operation. */ class j extends c {
     /** @hideconstructor */
@@ -909,7 +909,7 @@ function pt(t) {
         switch (t) {
       case 200:
         // OK
-        return A;
+        return T;
 
       case 400:
         // Bad Request
@@ -968,7 +968,7 @@ function pt(t) {
         return N;
 
       default:
-        return t >= 200 && t < 300 ? A : t >= 400 && t < 500 ? q : t >= 500 && t < 600 ? L : P;
+        return t >= 200 && t < 300 ? T : t >= 400 && t < 500 ? q : t >= 500 && t < 600 ? L : P;
     }
 }
 
@@ -1017,10 +1017,10 @@ class {
         return !1;
     }
     I(t, e, n, r, s) {
-        const i = this.T(t, e);
+        const i = this.A(t, e);
         g("RestConnection", "Sending: ", i, n);
         const o = {};
-        return this.A(o, r, s), this.R(t, i, o, n).then((t => (g("RestConnection", "Received: ", t), 
+        return this.T(o, r, s), this.R(t, i, o, n).then((t => (g("RestConnection", "Received: ", t), 
         t)), (e => {
             throw v("RestConnection", `${t} failed with error: `, e, "url: ", i, "request:", n), 
             e;
@@ -1034,7 +1034,7 @@ class {
     /**
      * Modifies the headers for a request, adding any authorization token if
      * present and any additional headers for the request.
-     */    A(t, e, n) {
+     */    T(t, e, n) {
         t["X-Goog-Api-Client"] = "gl-js/ fire/" + m, 
         // Content-Type: text/plain will avoid preflight requests which might
         // mess with CORS and redirects by proxies. If we add custom headers
@@ -1043,7 +1043,7 @@ class {
         t["Content-Type"] = "text/plain", this.databaseInfo.appId && (t["X-Firebase-GMPID"] = this.databaseInfo.appId), 
         e && e.headers.forEach(((e, n) => t[n] = e)), n && n.headers.forEach(((e, n) => t[n] = e));
     }
-    T(t, e) {
+    A(t, e) {
         const n = dt[t];
         return `${this.p}/v1/${e}:${n}`;
     }
@@ -1059,19 +1059,25 @@ class {
         throw new Error("Not supported by FetchConnection");
     }
     async R(t, e, n, r) {
-        const s = JSON.stringify(r);
-        let i;
+        var s;
+        const i = JSON.stringify(r);
+        let o;
         try {
-            i = await this.V(e, {
+            o = await this.V(e, {
                 method: "POST",
                 headers: n,
-                body: s
+                body: i
             });
         } catch (t) {
             throw new j(pt(t.status), "Request failed with error: " + t.statusText);
         }
-        if (!i.ok) throw new j(pt(i.status), "Request failed with error: " + i.statusText);
-        return i.json();
+        if (!o.ok) {
+            let t = await o.json();
+            Array.isArray(t) && (t = t[0]);
+            const e = null === (s = null == t ? void 0 : t.error) || void 0 === s ? void 0 : s.message;
+            throw new j(pt(o.status), `Request failed with error: ${null != e ? e : o.statusText}`);
+        }
+        return o.json();
     }
 }
 
@@ -1371,13 +1377,13 @@ class Et {
  * 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 Tt(t) {
+ */ function At(t) {
     let e = 0;
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
 }
 
-function At(t, e) {
+function Tt(t, e) {
     for (const n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
@@ -2238,7 +2244,7 @@ function jt(t) {
       case 10 /* ObjectValue */ :
         return function(t, e) {
             const n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (Tt(n) !== Tt(r)) return !1;
+            if (At(n) !== At(r)) return !1;
             for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Bt(n[t], r[t]))) return !1;
             return !0;
         }
@@ -2382,7 +2388,7 @@ function Gt(t, e) {
                 fields: {}
             }
         };
-        return At(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Xt(n))), e;
+        return Tt(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Xt(n))), e;
     }
     if (t.arrayValue) {
         const e = {
@@ -2478,7 +2484,7 @@ class Zt {
      * Modifies `fieldsMap` by adding, replacing or deleting the specified
      * entries.
      */    applyChanges(t, e, n) {
-        At(e, ((e, n) => t[e] = n));
+        Tt(e, ((e, n) => t[e] = n));
         for (const e of n) delete t[e];
     }
     clone() {
@@ -2863,7 +2869,7 @@ function _e(t) {
  * which can be different from the order by constraints the user provided (e.g.
  * the SDK and backend always orders by `__name__`).
  */ function ve(t) {
-    const e = T(t);
+    const e = A(t);
     if (null === e.O) {
         e.O = [];
         const t = ge(e), n = ye(e);
@@ -2888,7 +2894,7 @@ function _e(t) {
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
  */ function be(t) {
-    const e = T(t);
+    const e = A(t);
     if (!e.k) if ("F" /* First */ === e.limitType) e.k = ne(e.path, e.collectionGroup, ve(e), e.filters, e.limit, e.startAt, e.endAt); else {
         // Flip the orderBy directions since we want the last results
         const t = [];
@@ -2987,7 +2993,7 @@ function Ie(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Used to represent a field transform on a mutation. */ class Te {
+/** Used to represent a field transform on a mutation. */ class Ae {
     constructor() {
         // Make sure that the structural type of `TransformOperation` is unique.
         // See https://github.com/microsoft/TypeScript/issues/5451
@@ -2995,15 +3001,15 @@ function Ie(t, e) {
     }
 }
 
-/** Transforms a value into a server-generated timestamp. */ class Ae extends Te {}
+/** Transforms a value into a server-generated timestamp. */ class Te extends Ae {}
 
-/** Transforms an array value via a union operation. */ class Re extends Te {
+/** Transforms an array value via a union operation. */ class Re extends Ae {
     constructor(t) {
         super(), this.elements = t;
     }
 }
 
-/** Transforms an array value via a remove operation. */ class Pe extends Te {
+/** Transforms an array value via a remove operation. */ class Pe extends Ae {
     constructor(t) {
         super(), this.elements = t;
     }
@@ -3014,7 +3020,7 @@ function Ie(t, e) {
  * 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 Ve extends Te {
+ */ class Ve extends Ae {
     constructor(t, e) {
         super(), this.L = t, this.M = e;
     }
@@ -3338,7 +3344,7 @@ function He(t, e) {
     }
     return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((t => function(t, e) {
         const n = e.transform;
-        if (n instanceof Ae) return {
+        if (n instanceof Te) return {
             fieldPath: e.field.canonicalString(),
             setToServerValue: "REQUEST_TIME"
         };
@@ -3630,40 +3636,40 @@ class sn {
  */
 class on extends class {} {
     constructor(t, e, n, r) {
-        super(), this.authCredentials = t, this.appCheckCredentials = e, this.tt = n, this.L = r, 
-        this.et = !1;
+        super(), this.authCredentials = t, this.appCheckCredentials = e, this.connection = n, 
+        this.L = r, this.tt = !1;
     }
-    nt() {
-        if (this.et) throw new j(q, "The client has already been terminated.");
+    et() {
+        if (this.tt) throw new j(q, "The client has already been terminated.");
     }
     /** Invokes the provided RPC with auth and AppCheck tokens. */    I(t, e, n) {
-        return this.nt(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.tt.I(t, e, n, r, s))).catch((t => {
+        return this.et(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([r, s]) => this.connection.I(t, e, n, r, s))).catch((t => {
             throw "FirebaseError" === t.name ? (t.code === S && (this.authCredentials.invalidateToken(), 
             this.appCheckCredentials.invalidateToken()), t) : new j(P, t.toString());
         }));
     }
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */    P(t, e, n, r) {
-        return this.nt(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([s, i]) => this.tt.P(t, e, n, s, i, r))).catch((t => {
+        return this.et(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((([s, i]) => this.connection.P(t, e, n, s, i, r))).catch((t => {
             throw "FirebaseError" === t.name ? (t.code === S && (this.authCredentials.invalidateToken(), 
             this.appCheckCredentials.invalidateToken()), t) : new j(P, t.toString());
         }));
     }
     terminate() {
-        this.et = !0;
+        this.tt = !0;
     }
 }
 
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
 async function un(t, e) {
-    const n = T(t), r = Ge(n.L) + "/documents", s = {
+    const n = A(t), r = Ge(n.L) + "/documents", s = {
         writes: e.map((t => He(n.L, t)))
     };
     await n.I("Commit", r, s);
 }
 
 async function cn(t, e) {
-    const n = T(t), r = Ge(n.L) + "/documents", s = {
+    const n = A(t), r = Ge(n.L) + "/documents", s = {
         documents: e.map((t => Qe(n.L, t)))
     }, i = await n.P("BatchGetDocuments", r, s, e.length), o = new Map;
     i.forEach((t => {
@@ -3678,7 +3684,7 @@ async function cn(t, e) {
 }
 
 async function an(t, e) {
-    const n = T(t), r = Je(n.L, be(e));
+    const n = A(t), r = Je(n.L, be(e));
     return (await n.P("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, e, n) {
@@ -3692,7 +3698,7 @@ async function an(t, e) {
 }
 
 async function hn(t, e) {
-    const n = T(t), r = function(t, e) {
+    const n = A(t), r = function(t, e) {
         const n = Je(t, e);
         return {
             structuredAggregationQuery: {
@@ -3705,7 +3711,7 @@ async function hn(t, e) {
             parent: n.parent
         };
     }(n.L, be(e)), s = r.parent;
-    n.tt.v || delete r.parent;
+    n.connection.v || delete r.parent;
     return (await n.P("RunAggregationQuery", s, r, /*expectedResponseCount=*/ 1)).filter((t => !!t.result)).map((t => t.result.aggregateFields));
 }
 
@@ -4114,7 +4120,7 @@ class _n {
     /**
      * The collection this `DocumentReference` belongs to.
      */    get parent() {
-        return new Tn(this.firestore, this.converter, this._key.path.popLast());
+        return new An(this.firestore, this.converter, this._key.path.popLast());
     }
     withConverter(t) {
         return new En(this.firestore, t, this._key);
@@ -4144,7 +4150,7 @@ class _n {
 /**
  * A `CollectionReference` object can be used for adding documents, getting
  * document references, and querying for documents (using {@link query}).
- */ class Tn extends In {
+ */ class An extends In {
     /** @hideconstructor */
     constructor(t, e, n) {
         super(t, e, new pe(n)), this._path = n, 
@@ -4169,19 +4175,19 @@ class _n {
         /* converter= */ null, new st(t));
     }
     withConverter(t) {
-        return new Tn(this.firestore, t, this._path);
+        return new An(this.firestore, t, this._path);
     }
 }
 
-function An(t, e, ...n) {
+function Tn(t, e, ...n) {
     if (t = f(t), it("collection", "path", e), t instanceof wn) {
         const r = et.fromString(e, ...n);
-        return ut(r), new Tn(t, /* converter= */ null, r);
+        return ut(r), new An(t, /* converter= */ null, r);
     }
     {
-        if (!(t instanceof En || t instanceof Tn)) throw new j(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof En || t instanceof An)) throw new j(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(et.fromString(e, ...n));
-        return ut(r), new Tn(t.firestore, 
+        return ut(r), new An(t.firestore, 
         /* converter= */ null, r);
     }
 }
@@ -4221,9 +4227,9 @@ function Pn(t, e, ...n) {
         /* converter= */ null, new st(r));
     }
     {
-        if (!(t instanceof En || t instanceof Tn)) throw new j(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+        if (!(t instanceof En || t instanceof An)) throw new j(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
         const r = t._path.child(et.fromString(e, ...n));
-        return ot(r), new En(t.firestore, t instanceof Tn ? t.converter : null, new st(r));
+        return ot(r), new En(t.firestore, t instanceof An ? t.converter : null, new st(r));
     }
 }
 
@@ -4235,7 +4241,7 @@ function Pn(t, e, ...n) {
  * @returns true if the references point to the same location in the same
  * Firestore database.
  */ function Vn(t, e) {
-    return t = f(t), e = f(e), (t instanceof En || t instanceof Tn) && (e instanceof En || e instanceof Tn) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
+    return t = f(t), e = f(e), (t instanceof En || t instanceof An) && (e instanceof En || e instanceof An) && (t.firestore === e.firestore && t.path === e.path && t.converter === e.converter);
 }
 
 /**
@@ -4547,55 +4553,55 @@ function Cn(t) {
         this.settings = t, this.databaseId = e, this.L = n, this.ignoreUndefinedProperties = r, 
         // Minor hack: If fieldTransforms is undefined, we assume this is an
         // external call and we need to validate the entire path.
-        void 0 === s && this.rt(), this.fieldTransforms = s || [], this.fieldMask = i || [];
+        void 0 === s && this.nt(), this.fieldTransforms = s || [], this.fieldMask = i || [];
     }
     get path() {
         return this.settings.path;
     }
-    get st() {
-        return this.settings.st;
+    get rt() {
+        return this.settings.rt;
     }
-    /** Returns a new context with the specified settings overwritten. */    it(t) {
+    /** Returns a new context with the specified settings overwritten. */    st(t) {
         return new Ln(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.L, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
     }
-    ot(t) {
+    it(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.it({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.st({
             path: n,
-            ut: !1
+            ot: !1
         });
-        return r.ct(t), r;
+        return r.ut(t), r;
     }
-    at(t) {
+    ct(t) {
         var e;
-        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.it({
+        const n = null === (e = this.path) || void 0 === e ? void 0 : e.child(t), r = this.st({
             path: n,
-            ut: !1
+            ot: !1
         });
-        return r.rt(), r;
+        return r.nt(), r;
     }
-    ht(t) {
+    at(t) {
         // TODO(b/34871131): We don't support array paths right now; so make path
         // undefined.
-        return this.it({
+        return this.st({
             path: void 0,
-            ut: !0
+            ot: !0
         });
     }
-    lt(t) {
-        return ir(t, this.settings.methodName, this.settings.ft || !1, this.path, this.settings.dt);
+    ht(t) {
+        return ir(t, this.settings.methodName, this.settings.lt || !1, this.path, this.settings.ft);
     }
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */    contains(t) {
         return void 0 !== this.fieldMask.find((e => t.isPrefixOf(e))) || void 0 !== this.fieldTransforms.find((e => t.isPrefixOf(e.field)));
     }
-    rt() {
+    nt() {
         // TODO(b/34871131): Remove null check once we have proper paths for fields
         // within arrays.
-        if (this.path) for (let t = 0; t < this.path.length; t++) this.ct(this.path.get(t));
+        if (this.path) for (let t = 0; t < this.path.length; t++) this.ut(this.path.get(t));
     }
-    ct(t) {
-        if (0 === t.length) throw this.lt("Document fields must not be empty");
-        if (Cn(this.st) && qn.test(t)) throw this.lt('Document fields cannot begin and end with "__"');
+    ut(t) {
+        if (0 === t.length) throw this.ht("Document fields must not be empty");
+        if (Cn(this.rt) && qn.test(t)) throw this.ht('Document fields cannot begin and end with "__"');
     }
 }
 
@@ -4606,14 +4612,14 @@ function Cn(t) {
     constructor(t, e, n) {
         this.databaseId = t, this.ignoreUndefinedProperties = e, this.L = n || rn(t);
     }
-    /** Creates a new top-level parse context. */    wt(t, e, n, r = !1) {
+    /** Creates a new top-level parse context. */    dt(t, e, n, r = !1) {
         return new Ln({
-            st: t,
+            rt: t,
             methodName: e,
-            dt: n,
+            ft: n,
             path: rt.emptyPath(),
-            ut: !1,
-            ft: r
+            ot: !1,
+            lt: r
         }, this.databaseId, this.L, this.ignoreUndefinedProperties);
     }
 }
@@ -4624,7 +4630,7 @@ function Un(t) {
 }
 
 /** Parse document data from a set() call. */ function jn(t, e, n, r, s, i = {}) {
-    const o = t.wt(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, s);
+    const o = t.dt(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , e, n, s);
     er("Data must be an object, but it was:", o, r);
     const u = Zn(r, o);
     let c, a;
@@ -4642,7 +4648,7 @@ function Un(t) {
 
 class Bn extends Sn {
     _toFieldTransform(t) {
-        if (2 /* MergeSet */ !== t.st) throw 1 /* Update */ === t.st ? t.lt(`${this._methodName}() can only appear at the top level of your update data`) : t.lt(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
+        if (2 /* MergeSet */ !== t.rt) throw 1 /* Update */ === t.rt ? t.ht(`${this._methodName}() can only appear at the top level of your update data`) : t.ht(`${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
         // fieldMask so it gets deleted.
         return t.fieldMask.push(t.path), null;
@@ -4669,16 +4675,16 @@ class Bn extends Sn {
  * @param arrayElement - Whether or not the FieldValue has an array.
  */ function Qn(t, e, n) {
     return new Ln({
-        st: 3 /* Argument */ ,
-        dt: e.settings.dt,
+        rt: 3 /* Argument */ ,
+        ft: e.settings.ft,
         methodName: t._methodName,
-        ut: n
+        ot: n
     }, e.databaseId, e.L, e.ignoreUndefinedProperties);
 }
 
 class zn extends Sn {
     _toFieldTransform(t) {
-        return new Ne(t.path, new Ae);
+        return new Ne(t.path, new Te);
     }
     isEqual(t) {
         return t instanceof zn;
@@ -4687,11 +4693,11 @@ class zn extends Sn {
 
 class Wn extends Sn {
     constructor(t, e) {
-        super(t), this.yt = e;
+        super(t), this.wt = e;
     }
     _toFieldTransform(t) {
         const e = Qn(this, t, 
-        /*array=*/ !0), n = this.yt.map((t => Xn(t, e))), r = new Re(n);
+        /*array=*/ !0), n = this.wt.map((t => Xn(t, e))), r = new Re(n);
         return new Ne(t.path, r);
     }
     isEqual(t) {
@@ -4702,11 +4708,11 @@ class Wn extends Sn {
 
 class Gn extends Sn {
     constructor(t, e) {
-        super(t), this.yt = e;
+        super(t), this.wt = e;
     }
     _toFieldTransform(t) {
         const e = Qn(this, t, 
-        /*array=*/ !0), n = this.yt.map((t => Xn(t, e))), r = new Pe(n);
+        /*array=*/ !0), n = this.wt.map((t => Xn(t, e))), r = new Pe(n);
         return new Ne(t.path, r);
     }
     isEqual(t) {
@@ -4717,10 +4723,10 @@ class Gn extends Sn {
 
 class Kn extends Sn {
     constructor(t, e) {
-        super(t), this.gt = e;
+        super(t), this.yt = e;
     }
     _toFieldTransform(t) {
-        const e = new Ve(t.L, Ie(t.L, this.gt));
+        const e = new Ve(t.L, Ie(t.L, this.yt));
         return new Ne(t.path, e);
     }
     isEqual(t) {
@@ -4730,15 +4736,15 @@ class Kn extends Sn {
 }
 
 /** Parse update data from an update() call. */ function Yn(t, e, n, r) {
-    const s = t.wt(1 /* Update */ , e, n);
+    const s = t.dt(1 /* Update */ , e, n);
     er("Data must be an object, but it was:", s, r);
     const i = [], o = Zt.empty();
-    At(r, ((t, r) => {
+    Tt(r, ((t, r) => {
         const u = sr(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = f(r);
-        const c = s.at(u);
+        const c = s.ct(u);
         if (r instanceof Bn) 
         // Add it to the field mask, but don't add anything to updateData.
         i.push(u); else {
@@ -4751,7 +4757,7 @@ class Kn extends Sn {
 }
 
 /** Parse update data from a list of field/value arguments. */ function Hn(t, e, n, r, s, i) {
-    const o = t.wt(1 /* Update */ , e, n), u = [ nr(e, r, n) ], c = [ s ];
+    const o = t.dt(1 /* Update */ , e, n), u = [ nr(e, r, n) ], c = [ s ];
     if (i.length % 2 != 0) throw new j(V, `Function ${e}() 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(nr(e, i[t])), c.push(i[t + 1]);
     const a = [], h = Zt.empty();
@@ -4763,7 +4769,7 @@ class Kn extends Sn {
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 n = f(n);
-        const r = o.at(e);
+        const r = o.ct(e);
         if (n instanceof Bn) 
         // Add it to the field mask, but don't add anything to updateData.
         a.push(e); else {
@@ -4782,7 +4788,7 @@ class Kn extends Sn {
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
  */ function Jn(t, e, n, r = !1) {
-    return Xn(n, t.wt(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
+    return Xn(n, t.dt(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , e));
 }
 
 /**
@@ -4810,8 +4816,8 @@ class Kn extends Sn {
  */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Cn(e.st)) throw e.lt(`${t._methodName}() can only be used with update() and set()`);
-        if (!e.path) throw e.lt(`${t._methodName}() is not currently supported inside arrays`);
+        if (!Cn(e.rt)) throw e.ht(`${t._methodName}() can only be used with update() and set()`);
+        if (!e.path) throw e.ht(`${t._methodName}() is not currently supported inside arrays`);
         const n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
     }
@@ -4835,12 +4841,12 @@ class Kn extends Sn {
         // the set of values to be included for the IN query) that may directly
         // contain additional arrays (each representing an individual field
         // value), so we disable this validation.
-        if (e.settings.ut && 4 /* ArrayArgument */ !== e.st) throw e.lt("Nested arrays are not supported");
+        if (e.settings.ot && 4 /* ArrayArgument */ !== e.rt) throw e.ht("Nested arrays are not supported");
         return function(t, e) {
             const n = [];
             let r = 0;
             for (const s of t) {
-                let t = Xn(s, e.ht(r));
+                let t = Xn(s, e.at(r));
                 null == t && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4892,12 +4898,12 @@ class Kn extends Sn {
         };
         if (t instanceof En) {
             const n = e.databaseId, r = t.firestore._databaseId;
-            if (!r.isEqual(n)) throw e.lt(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${n.projectId}/${n.database}`);
+            if (!r.isEqual(n)) throw e.ht(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${n.projectId}/${n.database}`);
             return {
                 referenceValue: Be(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e.lt(`Unsupported field value: ${ct(t)}`);
+        throw e.ht(`Unsupported field value: ${ct(t)}`);
     }
     /**
  * Checks whether an object looks like a JSON object that should be converted
@@ -4913,8 +4919,8 @@ function Zn(t, e) {
     return !function(t) {
         for (const e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
         return !0;
-    }(t) ? At(t, ((t, r) => {
-        const s = Xn(r, e.ot(t));
+    }(t) ? Tt(t, ((t, r) => {
+        const s = Xn(r, e.it(t));
         null != s && (n[t] = s);
     })) : 
     // If we encounter an empty object, we explicitly add it to the update
@@ -4935,7 +4941,7 @@ function er(t, e, n) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         const r = ct(n);
-        throw "an object" === r ? e.lt(t + " a custom object") : e.lt(t + " " + r);
+        throw "an object" === r ? e.ht(t + " a custom object") : e.ht(t + " " + r);
     }
 }
 
@@ -5186,7 +5192,7 @@ class fr {}
 
 class wr extends fr {
     constructor(t, e, n) {
-        super(), this._t = t, this.vt = e, this.bt = n, this.type = "where";
+        super(), this.gt = t, this._t = e, this.vt = n, this.type = "where";
     }
     _apply(t) {
         const e = Un(t.firestore), n = function(t, e, n, r, s, i, o) {
@@ -5255,7 +5261,7 @@ class wr extends fr {
                 // Special case when it's a duplicate op to give a slightly clearer error message.
                 throw n === e.op ? new j(V, `Invalid query. You cannot use more than one '${e.op.toString()}' filter.`) : new j(V, `Invalid query. You cannot use '${e.op.toString()}' filters with '${n.toString()}' filters.`);
             }(t, c), c;
-        }(t._query, "where", e, t.firestore._databaseId, this._t, this.vt, this.bt);
+        }(t._query, "where", e, t.firestore._databaseId, this.gt, this._t, this.vt);
         return new In(t.firestore, t.converter, function(t, e) {
             const n = t.filters.concat([ e ]);
             return new pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
@@ -5280,7 +5286,7 @@ class wr extends fr {
 
 class pr extends fr {
     constructor(t, e) {
-        super(), this._t = t, this.Et = e, this.type = "orderBy";
+        super(), this.gt = t, this.bt = e, this.type = "orderBy";
     }
     _apply(t) {
         const e = function(t, e, n) {
@@ -5305,7 +5311,7 @@ class pr extends fr {
  * Will throw if the document does not contain all fields of the order by
  * of the query or if any of the fields in the order by are an uncommitted
  * server timestamp.
- */ (t._query, this._t, this.Et);
+ */ (t._query, this.gt, this.bt);
         return new In(t.firestore, t.converter, function(t, e) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             const n = t.explicitOrderBy.concat([ e ]);
@@ -5329,12 +5335,12 @@ class pr extends fr {
 
 class gr extends fr {
     constructor(t, e, n) {
-        super(), this.type = t, this.It = e, this.Tt = n;
+        super(), this.type = t, this.Et = e, this.It = n;
     }
     _apply(t) {
         return new In(t.firestore, t.converter, function(t, e, n) {
             return new pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
-        }(t._query, this.It, this.Tt));
+        }(t._query, this.Et, this.It));
     }
 }
 
@@ -5361,10 +5367,10 @@ class gr extends fr {
 
 class br extends fr {
     constructor(t, e, n) {
-        super(), this.type = t, this.At = e, this.Rt = n;
+        super(), this.type = t, this.At = e, this.Tt = n;
     }
     _apply(t) {
-        const e = Pr(t, this.type, this.At, this.Rt);
+        const e = Pr(t, this.type, this.At, this.Tt);
         return new In(t.firestore, t.converter, function(t, e) {
             return new pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
@@ -5381,25 +5387,25 @@ function Ir(...t) {
     /*inclusive=*/ !1);
 }
 
-class Tr extends fr {
+class Ar extends fr {
     constructor(t, e, n) {
-        super(), this.type = t, this.At = e, this.Rt = n;
+        super(), this.type = t, this.At = e, this.Tt = n;
     }
     _apply(t) {
-        const e = Pr(t, this.type, this.At, this.Rt);
+        const e = Pr(t, this.type, this.At, this.Tt);
         return new In(t.firestore, t.converter, function(t, e) {
             return new pe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
 }
 
-function Ar(...t) {
-    return new Tr("endBefore", t, 
+function Tr(...t) {
+    return new Ar("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
 function Rr(...t) {
-    return new Tr("endAt", t, /*inclusive=*/ !0);
+    return new Ar("endAt", t, /*inclusive=*/ !0);
 }
 
 /** Helper function to create a bound from a document or fields */ function Pr(t, e, n, r) {
@@ -5580,7 +5586,7 @@ class xr extends class {
     }
     convertObject(t, e) {
         const n = {};
-        return At(t.fields, ((t, r) => {
+        return Tt(t.fields, ((t, r) => {
             n[t] = this.convertValue(r, e);
         })), n;
     }
@@ -5720,7 +5726,7 @@ function Or(t, e, n, ...r) {
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
  */ function Cr(t, e) {
-    const n = Pn(t = at(t, Tn)), r = Dr(t.converter, e), s = jn(Un(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    const n = Pn(t = at(t, An)), r = Dr(t.converter, e), s = jn(Un(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
     return un(fn(t.firestore), [ s.toMutation(n._key, $e.exists(!1)) ]).then((() => n));
 }
 
@@ -6116,26 +6122,26 @@ function Gr(t, e) {
 class Jr {
     constructor(t, e, n, r, s) {
         this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
-        this.deferred = s, this.Pt = n.maxAttempts, this.Vt = new sn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
+        this.deferred = s, this.Rt = n.maxAttempts, this.Pt = new sn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
     }
     /** Runs the transaction and sets the result on deferred. */    run() {
-        this.Pt -= 1, this.Nt();
+        this.Rt -= 1, this.Vt();
     }
-    Nt() {
-        this.Vt.J((async () => {
-            const t = new Yr(this.datastore), e = this.$t(t);
+    Vt() {
+        this.Pt.J((async () => {
+            const t = new Yr(this.datastore), e = this.Nt(t);
             e && e.then((e => {
                 this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                     this.deferred.resolve(e);
                 })).catch((t => {
-                    this.Dt(t);
+                    this.$t(t);
                 }))));
             })).catch((t => {
-                this.Dt(t);
+                this.$t(t);
             }));
         }));
     }
-    $t(t) {
+    Nt(t) {
         try {
             const e = this.updateFunction(t);
             return !lt(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
@@ -6145,16 +6151,16 @@ class Jr {
             return this.deferred.reject(t), null;
         }
     }
-    Dt(t) {
-        this.Pt > 0 && this.xt(t) ? (this.Pt -= 1, this.asyncQueue.enqueueAndForget((() => (this.Nt(), 
+    $t(t) {
+        this.Rt > 0 && this.Dt(t) ? (this.Rt -= 1, this.asyncQueue.enqueueAndForget((() => (this.Vt(), 
         Promise.resolve())))) : this.deferred.reject(t);
     }
-    xt(t) {
+    Dt(t) {
         if ("FirebaseError" === t.name) {
             // In transactions, the backend will fail outdated reads with FAILED_PRECONDITION and
             // non-matching document versions with ABORTED. These errors should be retried.
             const e = t.code;
-            return "aborted" === e || "failed-precondition" === e || !
+            return "aborted" === e || "failed-precondition" === e || "already-exists" === e || !
             /**
  * Determines whether an error code represents a permanent error when received
  * in response to a non-write operation.
@@ -6320,39 +6326,39 @@ class Jr {
  */ class ts {
     constructor() {
         // The last promise in the queue.
-        this.St = Promise.resolve(), 
+        this.xt = Promise.resolve(), 
         // A list of retryable operations. Retryable operations are run in order and
         // retried with backoff.
-        this.Ft = [], 
+        this.St = [], 
         // Is this AsyncQueue being shut down? Once it is set to true, it will not
         // be changed again.
-        this.qt = !1, 
+        this.Ft = !1, 
         // Operations scheduled to be queued in the future. Operations are
         // automatically removed after they are run or canceled.
-        this.Ot = [], 
+        this.qt = [], 
         // visible for testing
-        this.kt = null, 
+        this.Ot = null, 
         // Flag set while there's an outstanding AsyncQueue operation, used for
         // assertion sanity-checks.
-        this.Ct = !1, 
+        this.kt = !1, 
         // Enabled during shutdown on Safari to prevent future access to IndexedDB.
-        this.Lt = !1, 
+        this.Ct = !1, 
         // List of TimerIds to fast-forward delays for.
-        this.Mt = [], 
+        this.Lt = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.Vt = new sn(this, "async_queue_retry" /* AsyncQueueRetry */), 
+        this.Pt = new sn(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.Ut = () => {
+        this.Mt = () => {
             const t = Xr();
-            t && g("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.Vt.Z();
+            t && g("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.Pt.Z();
         };
         const t = Xr();
-        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ut);
+        t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Mt);
     }
     get isShuttingDown() {
-        return this.qt;
+        return this.Ft;
     }
     /**
      * Adds a new operation to the queue without waiting for it to complete (i.e.
@@ -6362,38 +6368,38 @@ class Jr {
         this.enqueue(t);
     }
     enqueueAndForgetEvenWhileRestricted(t) {
-        this.jt(), 
+        this.Ut(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
-        this.Bt(t);
+        this.jt(t);
     }
     enterRestrictedMode(t) {
-        if (!this.qt) {
-            this.qt = !0, this.Lt = t || !1;
+        if (!this.Ft) {
+            this.Ft = !0, this.Ct = t || !1;
             const e = Xr();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Ut);
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Mt);
         }
     }
     enqueue(t) {
-        if (this.jt(), this.qt) 
+        if (this.Ut(), this.Ft) 
         // Return a Promise which never resolves.
         return new Promise((() => {}));
         // Create a deferred Promise that we can return to the callee. This
         // allows us to return a "hanging Promise" only to the callee and still
         // advance the queue even when the operation is not run.
                 const e = new B;
-        return this.Bt((() => this.qt && this.Lt ? Promise.resolve() : (t().then(e.resolve, e.reject), 
+        return this.jt((() => this.Ft && this.Ct ? Promise.resolve() : (t().then(e.resolve, e.reject), 
         e.promise))).then((() => e.promise));
     }
     enqueueRetryable(t) {
-        this.enqueueAndForget((() => (this.Ft.push(t), this.Qt())));
+        this.enqueueAndForget((() => (this.St.push(t), this.Bt())));
     }
     /**
      * Runs the next operation from the retryable queue. If the operation fails,
      * reschedules with backoff.
-     */    async Qt() {
-        if (0 !== this.Ft.length) {
+     */    async Bt() {
+        if (0 !== this.St.length) {
             try {
-                await this.Ft[0](), this.Ft.shift(), this.Vt.reset();
+                await this.St[0](), this.St.shift(), this.Pt.reset();
             } catch (t) {
                 if (!
                 /**
@@ -6437,7 +6443,7 @@ class Jr {
  // Failure will be handled by AsyncQueue
                                 g("AsyncQueue", "Operation failed with retryable error: " + t);
             }
-            this.Ft.length > 0 && 
+            this.St.length > 0 && 
             // If there are additional operations, we re-schedule `retryNextOp()`.
             // This is necessary to run retryable operations that failed during
             // their initial attempt since we don't know whether they are already
@@ -6448,12 +6454,12 @@ class Jr {
             // Since `backoffAndRun()` cancels an existing backoff and schedules a
             // new backoff on every call, there is only ever a single additional
             // operation in the queue.
-            this.Vt.J((() => this.Qt()));
+            this.Pt.J((() => this.Bt()));
         }
     }
-    Bt(t) {
-        const e = this.St.then((() => (this.Ct = !0, t().catch((t => {
-            this.kt = t, this.Ct = !1;
+    jt(t) {
+        const e = this.xt.then((() => (this.kt = !0, t().catch((t => {
+            this.Ot = t, this.kt = !1;
             const e = 
             /**
  * Chrome includes Error.message in Error.stack. Other browsers do not.
@@ -6494,38 +6500,38 @@ class Jr {
             // all further attempts to chain (via .then) will just short-circuit
             // and return the rejected Promise.
             throw _("INTERNAL UNHANDLED ERROR: ", e), t;
-        })).then((t => (this.Ct = !1, t))))));
-        return this.St = e, e;
+        })).then((t => (this.kt = !1, t))))));
+        return this.xt = e, e;
     }
     enqueueAfterDelay(t, e, n) {
-        this.jt(), 
+        this.Ut(), 
         // Fast-forward delays for timerIds that have been overriden.
-        this.Mt.indexOf(t) > -1 && (e = 0);
-        const r = Zr.createAndSchedule(this, t, e, n, (t => this.zt(t)));
-        return this.Ot.push(r), r;
+        this.Lt.indexOf(t) > -1 && (e = 0);
+        const r = Zr.createAndSchedule(this, t, e, n, (t => this.Qt(t)));
+        return this.qt.push(r), r;
     }
-    jt() {
-        this.kt && E();
+    Ut() {
+        this.Ot && E();
     }
     verifyOperationInProgress() {}
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
      * operations are not run.
-     */    async Wt() {
+     */    async zt() {
         // Operations in the queue prior to draining may have enqueued additional
         // operations. Keep draining the queue until the tail is no longer advanced,
         // which indicates that no more new operations were enqueued and that all
         // operations were executed.
         let t;
         do {
-            t = this.St, await t;
-        } while (t !== this.St);
+            t = this.xt, await t;
+        } while (t !== this.xt);
     }
     /**
      * For Tests: Determine if a delayed operation with a particular TimerId
      * exists.
-     */    Gt(t) {
-        for (const e of this.Ot) if (e.timerId === t) return !0;
+     */    Wt(t) {
+        for (const e of this.qt) if (e.timerId === t) return !0;
         return !1;
     }
     /**
@@ -6534,24 +6540,24 @@ class Jr {
      * @param lastTimerId - Delayed operations up to and including this TimerId
      * will be drained. Pass TimerId.All to run all delayed operations.
      * @returns a Promise that resolves once all operations have been run.
-     */    Kt(t) {
+     */    Gt(t) {
         // Note that draining may generate more delayed ops, so we do that first.
-        return this.Wt().then((() => {
+        return this.zt().then((() => {
             // Run ops in the same order they'd run if they ran naturally.
-            this.Ot.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
-            for (const e of this.Ot) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
-            return this.Wt();
+            this.qt.sort(((t, e) => t.targetTimeMs - e.targetTimeMs));
+            for (const e of this.qt) if (e.skipDelay(), "all" /* All */ !== t && e.timerId === t) break;
+            return this.zt();
         }));
     }
     /**
      * For Tests: Skip all subsequent delays for a timer id.
-     */    Yt(t) {
-        this.Mt.push(t);
+     */    Kt(t) {
+        this.Lt.push(t);
     }
-    /** Called once a DelayedOperation is run or canceled. */    zt(t) {
+    /** Called once a DelayedOperation is run or canceled. */    Qt(t) {
         // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
-        const e = this.Ot.indexOf(t);
-        this.Ot.splice(e, 1);
+        const e = this.qt.indexOf(t);
+        this.qt.splice(e, 1);
     }
 }
 
@@ -6658,7 +6664,7 @@ class es {
     return n && s._setSettings(n), s;
 }), "PUBLIC").setMultipleInstances(!0)), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-r("firestore-lite", "3.7.1", "rn"), r("firestore-lite", "3.7.1", "esm2017");
+r("firestore-lite", "3.7.2-canary.457fc2eeb", "rn"), r("firestore-lite", "3.7.2-canary.457fc2eeb", "esm2017");
 
-export { _n as AggregateField, vn as AggregateQuerySnapshot, $n as Bytes, Tn as CollectionReference, En as DocumentReference, ur as DocumentSnapshot, Dn as FieldPath, Sn as FieldValue, wn as Firestore, j as FirestoreError, Fn as GeoPoint, In as Query, fr as QueryConstraint, cr as QueryDocumentSnapshot, ar as QuerySnapshot, Et as Timestamp, es as Transaction, Wr as WriteBatch, Cr as addDoc, Mr as aggregateQuerySnapshotEqual, Qr as arrayRemove, Br as arrayUnion, An as collection, Rn as collectionGroup, yn as connectFirestoreEmulator, kr as deleteDoc, Ur as deleteField, Pn as doc, xn as documentId, Rr as endAt, Ar as endBefore, Lr as getCount, Sr as getDoc, Fr as getDocs, pn as getFirestore, zr as increment, mn as initializeFirestore, _r as limit, vr as limitToLast, yr as orderBy, dr as query, Nn as queryEqual, Vn as refEqual, ns as runTransaction, jr as serverTimestamp, qr as setDoc, y as setLogLevel, hr as snapshotEqual, Ir as startAfter, Er as startAt, gn as terminate, Or as updateDoc, mr as where, Kr as writeBatch };
+export { _n as AggregateField, vn as AggregateQuerySnapshot, $n as Bytes, An as CollectionReference, En as DocumentReference, ur as DocumentSnapshot, Dn as FieldPath, Sn as FieldValue, wn as Firestore, j as FirestoreError, Fn as GeoPoint, In as Query, fr as QueryConstraint, cr as QueryDocumentSnapshot, ar as QuerySnapshot, Et as Timestamp, es as Transaction, Wr as WriteBatch, Cr as addDoc, Mr as aggregateQuerySnapshotEqual, Qr as arrayRemove, Br as arrayUnion, Tn as collection, Rn as collectionGroup, yn as connectFirestoreEmulator, kr as deleteDoc, Ur as deleteField, Pn as doc, xn as documentId, Rr as endAt, Tr as endBefore, Lr as getCount, Sr as getDoc, Fr as getDocs, pn as getFirestore, zr as increment, mn as initializeFirestore, _r as limit, vr as limitToLast, yr as orderBy, dr as query, Nn as queryEqual, Vn as refEqual, ns as runTransaction, jr as serverTimestamp, qr as setDoc, y as setLogLevel, hr as snapshotEqual, Ir as startAfter, Er as startAt, gn as terminate, Or as updateDoc, mr as where, Kr as writeBatch };
 //# sourceMappingURL=index.rn.esm2017.js.map