@firebase/firestore 3.8.0 → 3.8.1-canary.0bab0b7a7

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

@@ -67,7 +67,7 @@ v.MOCK_USER = new v("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var g = "9.15.0", w = new l("@firebase/firestore");
+var g = "9.16.0-canary.0bab0b7a7", w = new l("@firebase/firestore");
 
 /**
  * @license
@@ -98,11 +98,11 @@ var g = "9.15.0", w = new l("@firebase/firestore");
  *     <li><code>`silent` to turn off logging.</li>
  *   </ul>
  */
-function _(t) {
+function b(t) {
     w.setLogLevel(t);
 }
 
-function b(t) {
+function _(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
     if (w.logLevel <= f.DEBUG) {
         var i = e.map(k);
@@ -917,10 +917,10 @@ var vt = /** @class */ function(r) {
         configurable: !0
     }), t.prototype.I = function(t, e, n, r, i) {
         var o = this.T(t, e);
-        b("RestConnection", "Sending: ", o, n);
+        _("RestConnection", "Sending: ", o, n);
         var a = {};
         return this.A(a, r, i), this.R(t, o, a, n).then((function(t) {
-            return b("RestConnection", "Received: ", t), t;
+            return _("RestConnection", "Received: ", t), t;
         }), (function(e) {
             throw E("RestConnection", "".concat(t, " failed with error: "), e, "url: ", o, "request:", n), 
             e;
@@ -1030,11 +1030,11 @@ var vt = /** @class */ function(r) {
     }, t;
 }();
 
-function _t(t, e) {
+function bt(t, e) {
     return t < e ? -1 : t > e ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function bt(t, e, n) {
+/** Helper to compare arrays using isEqual(). */ function _t(t, e, n) {
     return t.length === e.length && t.every((function(t, r) {
         return n(t, e[r]);
     }));
@@ -1131,7 +1131,7 @@ function Et(t, e) {
     }, t.prototype.approximateByteSize = function() {
         return 2 * this.binaryString.length;
     }, t.prototype.compareTo = function(t) {
-        return _t(this.binaryString, t.binaryString);
+        return bt(this.binaryString, t.binaryString);
     }, t.prototype.isEqual = function(t) {
         return this.binaryString === t.binaryString;
     }, t;
@@ -1290,7 +1290,7 @@ var St = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     t.prototype.toMillis = function() {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }, t.prototype._compareTo = function(t) {
-        return this.seconds === t.seconds ? _t(this.nanoseconds, t.nanoseconds) : _t(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? bt(this.nanoseconds, t.nanoseconds) : bt(this.seconds, t.seconds);
     }, 
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1466,7 +1466,7 @@ var St = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         }(t, e);
 
       case 9 /* TypeOrder.ArrayValue */ :
-        return bt(t.arrayValue.values || [], e.arrayValue.values || [], Rt);
+        return _t(t.arrayValue.values || [], e.arrayValue.values || [], Rt);
 
       case 10 /* TypeOrder.ObjectValue */ :
         return function(t, e) {
@@ -1490,14 +1490,14 @@ function Ct(t, e) {
 function xt(t, e) {
     if (t === e) return 0;
     var n = qt(t), r = qt(e);
-    if (n !== r) return _t(n, r);
+    if (n !== r) return bt(n, r);
     switch (n) {
       case 0 /* TypeOrder.NullValue */ :
       case 9007199254740991 /* TypeOrder.MaxValue */ :
         return 0;
 
       case 1 /* TypeOrder.BooleanValue */ :
-        return _t(t.booleanValue, e.booleanValue);
+        return bt(t.booleanValue, e.booleanValue);
 
       case 2 /* TypeOrder.NumberValue */ :
         return function(t, e) {
@@ -1514,7 +1514,7 @@ function xt(t, e) {
         return Lt(Ot(t), Ot(e));
 
       case 5 /* TypeOrder.StringValue */ :
-        return _t(t.stringValue, e.stringValue);
+        return bt(t.stringValue, e.stringValue);
 
       case 6 /* TypeOrder.BlobValue */ :
         return function(t, e) {
@@ -1525,16 +1525,16 @@ function xt(t, e) {
       case 7 /* TypeOrder.RefValue */ :
         return function(t, e) {
             for (var n = t.split("/"), r = e.split("/"), i = 0; i < n.length && i < r.length; i++) {
-                var o = _t(n[i], r[i]);
+                var o = bt(n[i], r[i]);
                 if (0 !== o) return o;
             }
-            return _t(n.length, r.length);
+            return bt(n.length, r.length);
         }(t.referenceValue, e.referenceValue);
 
       case 8 /* TypeOrder.GeoPointValue */ :
         return function(t, e) {
-            var n = _t(At(t.latitude), At(e.latitude));
-            return 0 !== n ? n : _t(At(t.longitude), At(e.longitude));
+            var n = bt(At(t.latitude), At(e.latitude));
+            return 0 !== n ? n : bt(At(t.longitude), At(e.longitude));
         }(t.geoPointValue, e.geoPointValue);
 
       case 9 /* TypeOrder.ArrayValue */ :
@@ -1543,7 +1543,7 @@ function xt(t, e) {
                 var o = xt(n[i], r[i]);
                 if (o) return o;
             }
-            return _t(n.length, r.length);
+            return bt(n.length, r.length);
         }(t.arrayValue, e.arrayValue);
 
       case 10 /* TypeOrder.ObjectValue */ :
@@ -1558,12 +1558,12 @@ function xt(t, e) {
             // canonical IDs are independent of insertion order.
                         r.sort(), o.sort();
             for (var a = 0; a < r.length && a < o.length; ++a) {
-                var u = _t(r[a], o[a]);
+                var u = bt(r[a], o[a]);
                 if (0 !== u) return u;
                 var s = xt(n[r[a]], i[o[a]]);
                 if (0 !== s) return s;
             }
-            return _t(r.length, o.length);
+            return bt(r.length, o.length);
         }(t.mapValue, e.mapValue);
 
       default:
@@ -1572,9 +1572,9 @@ function xt(t, e) {
 }
 
 function Lt(t, e) {
-    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return _t(t, e);
-    var n = It(t), r = It(e), i = _t(n.seconds, r.seconds);
-    return 0 !== i ? i : _t(n.nanos, r.nanos);
+    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return bt(t, e);
+    var n = It(t), r = It(e), i = bt(n.seconds, r.seconds);
+    return 0 !== i ? i : bt(n.nanos, r.nanos);
 }
 
 function jt(t, e) {
@@ -2345,7 +2345,7 @@ var fe = /** @class */ function() {
         }
         return !1;
     }, t.prototype.isEqual = function(t) {
-        return bt(this.fields, t.fields, (function(t, e) {
+        return _t(this.fields, t.fields, (function(t, e) {
             return t.isEqual(e);
         }));
     }, t;
@@ -2617,7 +2617,7 @@ function(t, e, n, r, i, o /* LimitType.First */ , a, u) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function _e(t) {
+function be(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
         var r = n[e].getFirstInequalityField();
         if (null !== r) return r;
@@ -2632,7 +2632,7 @@ function _e(t) {
 /**
  * Returns whether the query matches a collection group rather than a specific
  * collection.
- */ function be(t) {
+ */ function _e(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2644,7 +2644,7 @@ function _e(t) {
     var e = A(t);
     if (null === e.q) {
         e.q = [];
-        var n = _e(e), r = we(e);
+        var n = be(e), r = we(e);
         if (null !== n && null === r) 
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
@@ -2685,7 +2685,7 @@ function _e(t) {
 }
 
 function ke(t, e) {
-    e.getFirstInequalityField(), _e(t);
+    e.getFirstInequalityField(), be(t);
     var n = t.filters.concat([ e ]);
     return new ge(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
 }
@@ -3170,7 +3170,7 @@ function an(t) {
         // honored as such).
         var n = Math.floor(this.W + this.J()), r = Math.max(0, Date.now() - this.K), i = Math.max(0, n - r);
         // Guard against lastAttemptTime being in the future due to a clock change.
-                i > 0 && b("ExponentialBackoff", "Backing off for ".concat(i, " ms (base delay: ").concat(this.W, " ms, delay with jitter: ").concat(n, " ms, last attempt: ").concat(r, " ms ago)")), 
+                i > 0 && _("ExponentialBackoff", "Backing off for ".concat(i, " ms (base delay: ").concat(this.W, " ms, delay with jitter: ").concat(n, " ms, last attempt: ").concat(r, " ms ago)")), 
         this.G = this.M.enqueueAfterDelay(this.timerId, i, (function() {
             return e.K = Date.now(), t();
         })), 
@@ -3379,7 +3379,7 @@ var hn = new Map;
  */ function pn(t) {
     if (t._terminated) throw new B(C, "The client has already been terminated.");
     if (!hn.has(t)) {
-        b("ComponentProvider", "Initializing Datastore");
+        _("ComponentProvider", "Initializing Datastore");
         var e = function(t) {
             return new vt(t, fetch.bind(null));
         }((i = t._databaseId, o = t.app.options.appId || "", a = t._persistenceKey, u = t._freezeSettings(), 
@@ -3507,7 +3507,7 @@ var hn = new Map;
      * Only ever called once.
      */
     t.prototype._terminate = function() {
-        return t = this, (e = hn.get(t)) && (b("ComponentProvider", "Removing Datastore"), 
+        return t = this, (e = hn.get(t)) && (_("ComponentProvider", "Removing Datastore"), 
         hn.delete(t), e.terminate()), Promise.resolve();
         var t, e;
     }, t;
@@ -3647,10 +3647,10 @@ function vn(t, e) {
  * Represents an aggregation that can be performed by Firestore.
  */
 // eslint-disable-next-line @typescript-eslint/no-unused-vars
-var _n = function() {
+var bn = function() {
     /** A type string to uniquely identify instances of this class. */
     this.type = "AggregateField";
-}, bn = /** @class */ function() {
+}, _n = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._data = e, 
@@ -3716,7 +3716,7 @@ var _n = function() {
                 var n = e[1];
                 return t.userDataWriter.convertValue(n);
             }))[0];
-            return I("number" == typeof n), Promise.resolve(new bn(t.query, {
+            return I("number" == typeof n), Promise.resolve(new _n(t.query, {
                 count: n
             }));
         }));
@@ -4115,7 +4115,7 @@ function(t) {
      * with an underscore.
      */
     t.prototype._compareTo = function(t) {
-        return _t(this._lat, t._lat) || _t(this._long, t._long);
+        return bt(this._lat, t._lat) || bt(this._long, t._long);
     }, t;
 }(), Cn = /^__.*__$/, xn = /** @class */ function() {
     function t(t, e, n) {
@@ -4793,7 +4793,7 @@ function ur(t, e) {
  * @returns true if the snapshots are equal.
  */
 function fr(t, e) {
-    return t = p(t), e = p(e), t instanceof sr && e instanceof sr ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof lr && e instanceof lr && Pn(t.query, e.query) && bt(t.docs, e.docs, fr)
+    return t = p(t), e = p(e), t instanceof sr && e instanceof sr ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof lr && e instanceof lr && Pn(t.query, e.query) && _t(t.docs, e.docs, fr)
     /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */;
@@ -4959,13 +4959,14 @@ function hr(t, e) {
 }(pr);
 
 /**
- * Creates a {@link QueryCompositeFilterConstraint} that performs a logical OR
- * of all the provided {@link QueryFilterConstraint}s.
+ * Creates a new {@link QueryCompositeFilterConstraint} that is a disjunction of
+ * the given filter constraints. A disjunction filter includes a document if it
+ * satisfies any of the given filters.
  *
- * @param queryConstraints - Optional. The {@link QueryFilterConstraint}s
- * for OR operation. These must be created with calls to {@link where},
- * {@link or}, or {@link and}.
- * @returns The created {@link QueryCompositeFilterConstraint}.
+ * @param queryConstraints - Optional. The list of
+ * {@link QueryFilterConstraint}s to perform a disjunction for. These must be
+ * created with calls to {@link where}, {@link or}, or {@link and}.
+ * @returns The newly created {@link QueryCompositeFilterConstraint}.
  * @internal TODO remove this internal tag with OR Query support in the server
  */ function wr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
@@ -4974,18 +4975,19 @@ function hr(t, e) {
         return xr("or", t);
     })), gr._create("or" /* CompositeOperator.OR */ , t)
     /**
- * Creates a {@link QueryCompositeFilterConstraint} that performs a logical AND
- * of all the provided {@link QueryFilterConstraint}s.
- *
- * @param queryConstraints - Optional. The {@link QueryFilterConstraint}s
- * for AND operation. These must be created with calls to {@link where},
- * {@link or}, or {@link and}.
- * @returns The created {@link QueryCompositeFilterConstraint}.
+ * Creates a new {@link QueryCompositeFilterConstraint} that is a conjunction of
+ * the given filter constraints. A conjunction filter includes a document if it
+ * satisfies all of the given filters.
+ *
+ * @param queryConstraints - Optional. The list of
+ * {@link QueryFilterConstraint}s to perform a conjunction for. These must be
+ * created with calls to {@link where}, {@link or}, or {@link and}.
+ * @returns The newly created {@link QueryCompositeFilterConstraint}.
  * @internal TODO remove this internal tag with OR Query support in the server
  */;
 }
 
-function _r() {
+function br() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // Only support QueryFilterConstraints
         return t.forEach((function(t) {
@@ -5002,7 +5004,7 @@ function _r() {
  */;
 }
 
-var br = /** @class */ function(e) {
+var _r = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5022,7 +5024,7 @@ var br = /** @class */ function(e) {
             return function(t, e) {
                 if (null === we(t)) {
                     // This is the first order by. It must match any inequality.
-                    var n = _e(t);
+                    var n = be(t);
                     null !== n && Cr(t, n, e.field);
                 }
             }(t, r), r;
@@ -5049,7 +5051,7 @@ var br = /** @class */ function(e) {
  */ function Tr(t, e) {
     void 0 === e && (e = "asc");
     var n = e, r = hr("orderBy", t);
-    return br._create(r, n);
+    return _r._create(r, n);
 }
 
 /**
@@ -5213,7 +5215,7 @@ function Dr() {
             var c = i[s];
             if (a[s].field.isKeyField()) {
                 if ("string" != typeof c) throw new B(P, "Invalid query. Expected a string for document ID in ".concat(r, "(), but got a ").concat(typeof c));
-                if (!be(t) && -1 !== c.indexOf("/")) throw new B(P, "Invalid query. When querying a collection and ordering by documentId(), the value passed to ".concat(r, "() must be a plain document ID, but '").concat(c, "' contains a slash."));
+                if (!_e(t) && -1 !== c.indexOf("/")) throw new B(P, "Invalid query. When querying a collection and ordering by documentId(), the value passed to ".concat(r, "() must be a plain document ID, but '").concat(c, "' contains a slash."));
                 var l = t.path.child(et.fromString(c));
                 if (!it.isDocumentKey(l)) throw new B(P, "Invalid query. When querying a collection group and ordering by documentId(), the value passed to ".concat(r, "() must result in a valid document path, but '").concat(l, "' is not because it contains an odd number of segments."));
                 var f = new it(l);
@@ -5230,7 +5232,7 @@ function Dr() {
 function Nr(t, e, n) {
     if ("string" == typeof (n = p(n))) {
         if ("" === n) throw new B(P, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!be(e) && -1 !== n.indexOf("/")) throw new B(P, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '".concat(n, "' contains a '/' character."));
+        if (!_e(e) && -1 !== n.indexOf("/")) throw new B(P, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '".concat(n, "' contains a '/' character."));
         var r = e.path.child(et.fromString(n));
         if (!it.isDocumentKey(r)) throw new B(P, "Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '".concat(r, "' is not because it has an odd number of segments (").concat(r.length, ")."));
         return jt(t, new it(r));
@@ -5260,7 +5262,7 @@ function Nr(t, e, n) {
  * Disjunctive operators: `IN`, `ARRAY_CONTAINS_ANY`, `NOT_IN`
  */ function Rr(t, e) {
     if (e.isInequality()) {
-        var n = _e(t), r = e.field;
+        var n = be(t), r = e.field;
         if (null !== n && !n.isEqual(r)) throw new B(P, "Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '".concat(n.toString(), "' and '").concat(r.toString(), "'"));
         var i = we(t);
         null !== i && Cr(t, r, i);
@@ -6171,7 +6173,7 @@ function ti(t, e) {
         // after page comes into foreground.
         this.Dt = function() {
             var e = oi();
-            e && b("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.gt.X();
+            e && _("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.gt.X();
         };
         var e = oi();
         e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Dt);
@@ -6242,7 +6244,7 @@ function ti(t, e) {
                   case 3:
                     if (t = n.sent(), "IndexedDbTransactionError" !== t.name) throw t;
                     // Failure will be handled by AsyncQueue
-                                        return b("AsyncQueue", "Operation failed with retryable error: " + t), 
+                                        return _("AsyncQueue", "Operation failed with retryable error: " + t), 
                     [ 3 /*break*/ , 4 ];
 
                   case 4:
@@ -6475,7 +6477,7 @@ ai = "".concat(i, "_lite"), g = ai, o(new c("firestore/lite", (function(t, e) {
     return r && o._setSettings(r), o;
 }), "PUBLIC").setMultipleInstances(!0)), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-a("firestore-lite", "3.8.0", ""), a("firestore-lite", "3.8.0", "esm5");
+a("firestore-lite", "3.8.1-canary.0bab0b7a7", ""), a("firestore-lite", "3.8.1-canary.0bab0b7a7", "esm5");
 
-export { _n as AggregateField, bn as AggregateQuerySnapshot, Dn as Bytes, Sn as CollectionReference, En as DocumentReference, sr as DocumentSnapshot, On as FieldPath, qn as FieldValue, yn as Firestore, B as FirestoreError, Rn as GeoPoint, kn as Query, gr as QueryCompositeFilterConstraint, dr as QueryConstraint, cr as QueryDocumentSnapshot, Vr as QueryEndAtConstraint, mr as QueryFieldFilterConstraint, Er as QueryLimitConstraint, br as QueryOrderByConstraint, lr as QuerySnapshot, Ir as QueryStartAtConstraint, Vt as Timestamp, ci as Transaction, $r as WriteBatch, zr as addDoc, Wr as aggregateQuerySnapshotEqual, _r as and, Jr as arrayRemove, Xr as arrayUnion, In as collection, An as collectionGroup, gn as connectFirestoreEmulator, Qr as deleteDoc, Hr as deleteField, Fn as doc, Nn as documentId, Dr as endAt, Pr as endBefore, Kr as getCount, Mr as getDoc, Ur as getDocs, vn as getFirestore, Zr as increment, mn as initializeFirestore, kr as limit, Sr as limitToLast, wr as or, Tr as orderBy, yr as query, Pn as queryEqual, Vn as refEqual, li as runTransaction, Yr as serverTimestamp, Br as setDoc, _ as setLogLevel, fr as snapshotEqual, Fr as startAfter, Ar as startAt, wn as terminate, Gr as updateDoc, vr as where, ei as writeBatch };
+export { bn as AggregateField, _n as AggregateQuerySnapshot, Dn as Bytes, Sn as CollectionReference, En as DocumentReference, sr as DocumentSnapshot, On as FieldPath, qn as FieldValue, yn as Firestore, B as FirestoreError, Rn as GeoPoint, kn as Query, gr as QueryCompositeFilterConstraint, dr as QueryConstraint, cr as QueryDocumentSnapshot, Vr as QueryEndAtConstraint, mr as QueryFieldFilterConstraint, Er as QueryLimitConstraint, _r as QueryOrderByConstraint, lr as QuerySnapshot, Ir as QueryStartAtConstraint, Vt as Timestamp, ci as Transaction, $r as WriteBatch, zr as addDoc, Wr as aggregateQuerySnapshotEqual, br as and, Jr as arrayRemove, Xr as arrayUnion, In as collection, An as collectionGroup, gn as connectFirestoreEmulator, Qr as deleteDoc, Hr as deleteField, Fn as doc, Nn as documentId, Dr as endAt, Pr as endBefore, Kr as getCount, Mr as getDoc, Ur as getDocs, vn as getFirestore, Zr as increment, mn as initializeFirestore, kr as limit, Sr as limitToLast, wr as or, Tr as orderBy, yr as query, Pn as queryEqual, Vn as refEqual, li as runTransaction, Yr as serverTimestamp, Br as setDoc, b as setLogLevel, fr as snapshotEqual, Fr as startAfter, Ar as startAt, wn as terminate, Gr as updateDoc, vr as where, ei as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map