@firebase/firestore 3.4.7 → 3.4.8-canary.19e31a231

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

@@ -63,7 +63,7 @@ l.MOCK_USER = new l("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-let f = "9.6.10";
+let f = "9.6.11-canary.19e31a231";
 
 /**
  * @license
@@ -1660,9 +1660,16 @@ const At = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * 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 St = {
+    fields: {
+        __type__: {
+            stringValue: "__max__"
+        }
+    }
+};
+
 /** Extracts the backend's type order for the provided value. */
-function St(t) {
+function Ft(t) {
     return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Dt(t) ? 4 /* ServerTimestampValue */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
@@ -1687,13 +1694,13 @@ function St(t) {
     /**
  * An ObjectValue represents a MapValue in the Firestore Proto and offers the
  * ability to add and remove fields (via the ObjectValueBuilder).
- */ (t) ? 9 /* ArrayValue */ : 10 /* ObjectValue */ : g();
+ */ (t) ? 9007199254740991 /* MaxValue */ : 10 /* ObjectValue */ : g();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Ft(t, e) {
+/** Tests `left` and `right` for equality based on the backend semantics. */ function xt(t, e) {
     if (t === e) return !0;
-    const n = St(t);
-    if (n !== St(e)) return !1;
+    const n = Ft(t);
+    if (n !== Ft(e)) return !1;
     switch (n) {
       case 0 /* NullValue */ :
       case 9007199254740991 /* MaxValue */ :
@@ -1741,13 +1748,13 @@ function St(t) {
         }(t, e);
 
       case 9 /* ArrayValue */ :
-        return _t(t.arrayValue.values || [], e.arrayValue.values || [], Ft);
+        return _t(t.arrayValue.values || [], e.arrayValue.values || [], xt);
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
             const n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
             if (bt(n) !== bt(r)) return !1;
-            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !Ft(n[t], r[t]))) return !1;
+            for (const t in n) if (n.hasOwnProperty(t) && (void 0 === r[t] || !xt(n[t], r[t]))) return !1;
             return !0;
         }
         /** Returns true if the ArrayValue contains the specified element. */ (t, e);
@@ -1757,13 +1764,13 @@ function St(t) {
     }
 }
 
-function xt(t, e) {
-    return void 0 !== (t.values || []).find((t => Ft(t, e)));
+function qt(t, e) {
+    return void 0 !== (t.values || []).find((t => xt(t, e)));
 }
 
-function qt(t, e) {
+function Ot(t, e) {
     if (t === e) return 0;
-    const n = St(t), r = St(e);
+    const n = Ft(t), r = Ft(e);
     if (n !== r) return yt(n, r);
     switch (n) {
       case 0 /* NullValue */ :
@@ -1782,10 +1789,10 @@ function qt(t, e) {
         }(t, e);
 
       case 3 /* TimestampValue */ :
-        return Ot(t.timestampValue, e.timestampValue);
+        return Ct(t.timestampValue, e.timestampValue);
 
       case 4 /* ServerTimestampValue */ :
-        return Ot($t(t), $t(e));
+        return Ct($t(t), $t(e));
 
       case 5 /* StringValue */ :
         return yt(t.stringValue, e.stringValue);
@@ -1817,7 +1824,7 @@ function qt(t, e) {
         return function(t, e) {
             const n = t.values || [], r = e.values || [];
             for (let t = 0; t < n.length && t < r.length; ++t) {
-                const e = qt(n[t], r[t]);
+                const e = Ot(n[t], r[t]);
                 if (e) return e;
             }
             return yt(n.length, r.length);
@@ -1825,6 +1832,9 @@ function qt(t, e) {
 
       case 10 /* ObjectValue */ :
         return function(t, e) {
+            if (t === St && e === St) return 0;
+            if (t === St) return 1;
+            if (e === St) return -1;
             const n = t.fields || {}, r = Object.keys(n), s = e.fields || {}, i = Object.keys(s);
             // Even though MapValues are likely sorted correctly based on their insertion
             // order (e.g. when received from the backend), local modifications can bring
@@ -1834,7 +1844,7 @@ function qt(t, e) {
             for (let t = 0; t < r.length && t < i.length; ++t) {
                 const e = yt(r[t], i[t]);
                 if (0 !== e) return e;
-                const o = qt(n[r[t]], s[i[t]]);
+                const o = Ot(n[r[t]], s[i[t]]);
                 if (0 !== o) return o;
             }
             return yt(r.length, i.length);
@@ -1846,35 +1856,35 @@ function qt(t, e) {
     }
 }
 
-function Ot(t, e) {
+function Ct(t, e) {
     if ("string" == typeof t && "string" == typeof e && t.length === e.length) return yt(t, e);
     const n = Rt(t), r = Rt(e), s = yt(n.seconds, r.seconds);
     return 0 !== s ? s : yt(n.nanos, r.nanos);
 }
 
-function Ct(t, e) {
+function Lt(t, e) {
     return {
         referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${e.path.canonicalString()}`
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Lt(t) {
+/** Returns true if `value` is an ArrayValue. */ function Ut(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Ut(t) {
+/** Returns true if `value` is a NullValue. */ function kt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function kt(t) {
+/** Returns true if `value` is NaN. */ function jt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function jt(t) {
+/** Returns true if `value` is a MapValue. */ function Mt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Mt(t) {
+/** Creates a deep copy of `source`. */ function Bt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1887,7 +1897,7 @@ function Ct(t, e) {
                 fields: {}
             }
         };
-        return Et(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Mt(n))), e;
+        return Et(t.mapValue.fields, ((t, n) => e.mapValue.fields[t] = Bt(n))), e;
     }
     if (t.arrayValue) {
         const e = {
@@ -1895,18 +1905,18 @@ function Ct(t, e) {
                 values: []
             }
         };
-        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Mt(t.arrayValue.values[n]);
+        for (let n = 0; n < (t.arrayValue.values || []).length; ++n) e.arrayValue.values[n] = Bt(t.arrayValue.values[n]);
         return e;
     }
     return Object.assign({}, t);
 }
 
-class Bt {
+class zt {
     constructor(t) {
         this.value = t;
     }
     static empty() {
-        return new Bt({
+        return new zt({
             mapValue: {}
         });
     }
@@ -1920,7 +1930,7 @@ class Bt {
         {
             let e = this.value;
             for (let n = 0; n < t.length - 1; ++n) if (e = (e.mapValue.fields || {})[t.get(n)], 
-            !jt(e)) return null;
+            !Mt(e)) return null;
             return e = (e.mapValue.fields || {})[t.lastSegment()], e || null;
         }
     }
@@ -1930,7 +1940,7 @@ class Bt {
      * @param path - The field path to set.
      * @param value - The value to set.
      */    set(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Mt(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Bt(e);
     }
     /**
      * Sets the provided fields to the provided values.
@@ -1944,7 +1954,7 @@ class Bt {
                 const t = this.getFieldsMap(e);
                 this.applyChanges(t, n, r), n = {}, r = [], e = s.popLast();
             }
-            t ? n[s.lastSegment()] = Mt(t) : r.push(s.lastSegment());
+            t ? n[s.lastSegment()] = Bt(t) : r.push(s.lastSegment());
         }));
         const s = this.getFieldsMap(e);
         this.applyChanges(s, n, r);
@@ -1956,10 +1966,10 @@ class Bt {
      * @param path - The field path to remove.
      */    delete(t) {
         const e = this.field(t.popLast());
-        jt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        Mt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }
     isEqual(t) {
-        return Ft(this.value, t.value);
+        return xt(this.value, t.value);
     }
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -1971,7 +1981,7 @@ class Bt {
         });
         for (let n = 0; n < t.length; ++n) {
             let r = e.mapValue.fields[t.get(n)];
-            jt(r) && r.mapValue.fields || (r = {
+            Mt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -1987,7 +1997,7 @@ class Bt {
         for (const e of n) delete t[e];
     }
     clone() {
-        return new Bt(Mt(this.value));
+        return new zt(Bt(this.value));
     }
 }
 
@@ -2016,7 +2026,7 @@ class Bt {
  * not transition to one of these states even after all mutations have been
  * applied, `isValidDocument()` returns false and the document should be removed
  * from all views.
- */ class zt {
+ */ class Gt {
     constructor(t, e, n, r, s, i) {
         this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.data = s, 
         this.documentState = i;
@@ -2025,23 +2035,23 @@ class Bt {
      * Creates a document with no known version or data, but which can serve as
      * base document for mutations.
      */    static newInvalidDocument(t) {
-        return new zt(t, 0 /* INVALID */ , vt.min(), vt.min(), Bt.empty(), 0 /* SYNCED */);
+        return new Gt(t, 0 /* INVALID */ , vt.min(), vt.min(), zt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist with the given data at the
      * given version.
      */    static newFoundDocument(t, e, n) {
-        return new zt(t, 1 /* FOUND_DOCUMENT */ , e, vt.min(), n, 0 /* SYNCED */);
+        return new Gt(t, 1 /* FOUND_DOCUMENT */ , e, vt.min(), n, 0 /* SYNCED */);
     }
     /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, e) {
-        return new zt(t, 2 /* NO_DOCUMENT */ , e, vt.min(), Bt.empty(), 0 /* SYNCED */);
+        return new Gt(t, 2 /* NO_DOCUMENT */ , e, vt.min(), zt.empty(), 0 /* SYNCED */);
     }
     /**
      * Creates a new document that is known to exist at the given version but
      * whose data is not known (e.g. a document that was updated without a known
      * base document).
      */    static newUnknownDocument(t, e) {
-        return new zt(t, 3 /* UNKNOWN_DOCUMENT */ , e, vt.min(), Bt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
+        return new Gt(t, 3 /* UNKNOWN_DOCUMENT */ , e, vt.min(), zt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
     }
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2054,7 +2064,7 @@ class Bt {
      * Changes the document type to indicate that it doesn't exist at the given
      * version.
      */    convertToNoDocument(t) {
-        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = Bt.empty(), 
+        return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = zt.empty(), 
         this.documentState = 0 /* SYNCED */ , this;
     }
     /**
@@ -2062,7 +2072,7 @@ class Bt {
      * that its data is not known (e.g. a document that was updated without a known
      * base document).
      */    convertToUnknownDocument(t) {
-        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = Bt.empty(), 
+        return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = zt.empty(), 
         this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
     }
     setHasCommittedMutations() {
@@ -2096,10 +2106,10 @@ class Bt {
         return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
     }
     isEqual(t) {
-        return t instanceof zt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
+        return t instanceof Gt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
     }
     mutableCopy() {
-        return new zt(this.key, this.documentType, this.version, this.readTime, this.data.clone(), this.documentState);
+        return new Gt(this.key, this.documentType, this.version, this.readTime, this.data.clone(), this.documentState);
     }
     toString() {
         return `Document(${this.key}, ${this.version}, ${JSON.stringify(this.data.value)}, {documentType: ${this.documentType}}), {documentState: ${this.documentState}})`;
@@ -2123,7 +2133,7 @@ class Bt {
  * limitations under the License.
  */
 // Visible for testing
-class Gt {
+class Qt {
     constructor(t, e = null, n = [], r = [], s = null, i = null, o = null) {
         this.path = t, this.collectionGroup = e, this.orderBy = n, this.filters = r, this.limit = s, 
         this.startAt = i, this.endAt = o, this.P = null;
@@ -2137,26 +2147,26 @@ class Gt {
  * NOTE: you should always construct `Target` from `Query.toTarget` instead of
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
- */ function Qt(t, e = null, n = [], r = [], s = null, i = null, o = null) {
-    return new Gt(t, e, n, r, s, i, o);
+ */ function Wt(t, e = null, n = [], r = [], s = null, i = null, o = null) {
+    return new Qt(t, e, n, r, s, i, o);
 }
 
-class Wt extends class {} {
+class Yt extends class {} {
     constructor(t, e, n) {
         super(), this.field = t, this.op = e, this.value = n;
     }
     /**
      * Creates a filter based on the provided arguments.
      */    static create(t, e, n) {
-        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, n) : new Yt(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Xt(t, n) : "in" /* IN */ === e ? new Zt(t, n) : "not-in" /* NOT_IN */ === e ? new te(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ee(t, n) : new Wt(t, e, n);
+        return t.isKeyField() ? "in" /* IN */ === e || "not-in" /* NOT_IN */ === e ? this.V(t, e, n) : new Ht(t, e, n) : "array-contains" /* ARRAY_CONTAINS */ === e ? new Zt(t, n) : "in" /* IN */ === e ? new te(t, n) : "not-in" /* NOT_IN */ === e ? new ee(t, n) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === e ? new ne(t, n) : new Yt(t, e, n);
     }
     static V(t, e, n) {
-        return "in" /* IN */ === e ? new Ht(t, n) : new Kt(t, n);
+        return "in" /* IN */ === e ? new Kt(t, n) : new Jt(t, n);
     }
     matches(t) {
         const e = t.data.field(this.field);
         // Types do not have to match in NOT_EQUAL filters.
-                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.D(qt(e, this.value)) : null !== e && St(this.value) === St(e) && this.D(qt(e, this.value));
+                return "!=" /* NOT_EQUAL */ === this.op ? null !== e && this.D(Ot(e, this.value)) : null !== e && Ft(this.value) === Ft(e) && this.D(Ot(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }
     D(t) {
@@ -2189,7 +2199,7 @@ class Wt extends class {} {
 }
 
 /** Filter that matches on key fields (i.e. '__name__'). */
-class Yt extends Wt {
+class Ht extends Yt {
     constructor(t, e, n) {
         super(t, e, n), this.key = et.fromName(n.referenceValue);
     }
@@ -2199,69 +2209,69 @@ class Yt extends Wt {
     }
 }
 
-/** Filter that matches on key fields within an array. */ class Ht extends Wt {
+/** Filter that matches on key fields within an array. */ class Kt extends Yt {
     constructor(t, e) {
-        super(t, "in" /* IN */ , e), this.keys = Jt("in" /* IN */ , e);
+        super(t, "in" /* IN */ , e), this.keys = Xt("in" /* IN */ , e);
     }
     matches(t) {
         return this.keys.some((e => e.isEqual(t.key)));
     }
 }
 
-/** Filter that matches on key fields not present within an array. */ class Kt extends Wt {
+/** Filter that matches on key fields not present within an array. */ class Jt extends Yt {
     constructor(t, e) {
-        super(t, "not-in" /* NOT_IN */ , e), this.keys = Jt("not-in" /* NOT_IN */ , e);
+        super(t, "not-in" /* NOT_IN */ , e), this.keys = Xt("not-in" /* NOT_IN */ , e);
     }
     matches(t) {
         return !this.keys.some((e => e.isEqual(t.key)));
     }
 }
 
-function Jt(t, e) {
+function Xt(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((t => et.fromName(t.referenceValue)));
 }
 
-/** A Filter that implements the array-contains operator. */ class Xt extends Wt {
+/** A Filter that implements the array-contains operator. */ class Zt extends Yt {
     constructor(t, e) {
         super(t, "array-contains" /* ARRAY_CONTAINS */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return Lt(e) && xt(e.arrayValue, this.value);
+        return Ut(e) && qt(e.arrayValue, this.value);
     }
 }
 
-/** A Filter that implements the IN operator. */ class Zt extends Wt {
+/** A Filter that implements the IN operator. */ class te extends Yt {
     constructor(t, e) {
         super(t, "in" /* IN */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return null !== e && xt(this.value.arrayValue, e);
+        return null !== e && qt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the not-in operator. */ class te extends Wt {
+/** A Filter that implements the not-in operator. */ class ee extends Yt {
     constructor(t, e) {
         super(t, "not-in" /* NOT_IN */ , e);
     }
     matches(t) {
-        if (xt(this.value.arrayValue, {
+        if (qt(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         const e = t.data.field(this.field);
-        return null !== e && !xt(this.value.arrayValue, e);
+        return null !== e && !qt(this.value.arrayValue, e);
     }
 }
 
-/** A Filter that implements the array-contains-any operator. */ class ee extends Wt {
+/** A Filter that implements the array-contains-any operator. */ class ne extends Yt {
     constructor(t, e) {
         super(t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , e);
     }
     matches(t) {
         const e = t.data.field(this.field);
-        return !(!Lt(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => xt(this.value.arrayValue, t)));
+        return !(!Ut(e) || !e.arrayValue.values) && e.arrayValue.values.some((t => qt(this.value.arrayValue, t)));
     }
 }
 
@@ -2278,7 +2288,7 @@ function Jt(t, e) {
  * Bound provides a function to determine whether a document comes before or
  * after a bound. This is influenced by whether the position is just before or
  * just after the provided values.
- */ class ne {
+ */ class re {
     constructor(t, e) {
         this.position = t, this.inclusive = e;
     }
@@ -2286,22 +2296,22 @@ function Jt(t, e) {
 
 /**
  * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
- */ class re {
+ */ class se {
     constructor(t, e = "asc" /* ASCENDING */) {
         this.field = t, this.dir = e;
     }
 }
 
-function se(t, e) {
+function ie(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
-function ie(t, e) {
+function oe(t, e) {
     if (null === t) return null === e;
     if (null === e) return !1;
     if (t.inclusive !== e.inclusive || t.position.length !== e.position.length) return !1;
     for (let n = 0; n < t.position.length; n++) {
-        if (!Ft(t.position[n], e.position[n])) return !1;
+        if (!xt(t.position[n], e.position[n])) return !1;
     }
     return !0;
 }
@@ -2328,7 +2338,7 @@ function ie(t, e) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ class oe {
+ */ class ue {
     /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2341,11 +2351,7 @@ function ie(t, e) {
     }
 }
 
-/** Creates a new Query for a query that matches all documents at `path` */ function ue(t) {
-    return !ct(t.limit) && "L" /* Last */ === t.limitType;
-}
-
-function ce(t) {
+/** Creates a new Query for a query that matches all documents at `path` */ function ce(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
@@ -2379,14 +2385,14 @@ function he(t) {
         // In order to implicitly add key ordering, we must also add the
         // inequality filter field for it to be a valid query.
         // Note that the default inequality field and key ordering is ascending.
-        t.isKeyField() || e.$.push(new re(t)), e.$.push(new re(tt.keyField(), "asc" /* ASCENDING */)); else {
+        t.isKeyField() || e.$.push(new se(t)), e.$.push(new se(tt.keyField(), "asc" /* ASCENDING */)); else {
             let t = !1;
             for (const n of e.explicitOrderBy) e.$.push(n), n.field.isKeyField() && (t = !0);
             if (!t) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 const t = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* ASCENDING */;
-                e.$.push(new re(tt.keyField(), t));
+                e.$.push(new se(tt.keyField(), t));
             }
         }
     }
@@ -2397,17 +2403,17 @@ function he(t) {
  * Converts this `Query` instance to it's corresponding `Target` representation.
  */ function fe(t) {
     const e = b(t);
-    if (!e.S) if ("F" /* First */ === e.limitType) e.S = Qt(e.path, e.collectionGroup, le(e), e.filters, e.limit, e.startAt, e.endAt); else {
+    if (!e.S) if ("F" /* First */ === e.limitType) e.S = Wt(e.path, e.collectionGroup, le(e), e.filters, e.limit, e.startAt, e.endAt); else {
         // Flip the orderBy directions since we want the last results
         const t = [];
         for (const n of le(e)) {
             const e = "desc" /* DESCENDING */ === n.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
-            t.push(new re(n.field, e));
+            t.push(new se(n.field, e));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                const n = e.endAt ? new ne(e.endAt.position, !e.endAt.inclusive) : null, r = e.startAt ? new ne(e.startAt.position, !e.startAt.inclusive) : null;
+                const n = e.endAt ? new re(e.endAt.position, e.endAt.inclusive) : null, r = e.startAt ? new re(e.startAt.position, e.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
-        e.S = Qt(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
+        e.S = Wt(e.path, e.collectionGroup, t, e.filters, e.limit, n, r);
     }
     return e.S;
 }
@@ -2416,12 +2422,12 @@ function de(t, e) {
     return function(t, e) {
         if (t.limit !== e.limit) return !1;
         if (t.orderBy.length !== e.orderBy.length) return !1;
-        for (let n = 0; n < t.orderBy.length; n++) if (!se(t.orderBy[n], e.orderBy[n])) return !1;
+        for (let n = 0; n < t.orderBy.length; n++) if (!ie(t.orderBy[n], e.orderBy[n])) return !1;
         if (t.filters.length !== e.filters.length) return !1;
         for (let s = 0; s < t.filters.length; s++) if (n = t.filters[s], r = e.filters[s], 
-        n.op !== r.op || !n.field.isEqual(r.field) || !Ft(n.value, r.value)) return !1;
+        n.op !== r.op || !n.field.isEqual(r.field) || !xt(n.value, r.value)) return !1;
         var n, r;
-        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!ie(t.startAt, e.startAt) && ie(t.endAt, e.endAt);
+        return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!oe(t.startAt, e.startAt) && oe(t.endAt, e.endAt);
     }(fe(t), fe(e)) && t.limitType === e.limitType;
 }
 
@@ -2804,16 +2810,16 @@ function Ue(t, e, n) {
 function ke(t, e) {
     return "found" in e ? function(t, e) {
         v(!!e.found), e.found.name, e.found.updateTime;
-        const n = Oe(t, e.found.name), r = Fe(e.found.updateTime), s = new Bt({
+        const n = Oe(t, e.found.name), r = Fe(e.found.updateTime), s = new zt({
             mapValue: {
                 fields: e.found.fields
             }
         });
-        return zt.newFoundDocument(n, r, s);
+        return Gt.newFoundDocument(n, r, s);
     }(t, e) : "missing" in e ? function(t, e) {
         v(!!e.missing), v(!!e.readTime);
         const n = Oe(t, e.missing), r = Fe(e.readTime);
-        return zt.newNoDocument(n, r);
+        return Gt.newNoDocument(n, r);
     }(t, e) : g();
 }
 
@@ -2881,26 +2887,26 @@ function Me(t, e) {
         // visible for testing
         function(t) {
             if ("==" /* EQUAL */ === t.op) {
-                if (kt(t.value)) return {
+                if (jt(t.value)) return {
                     unaryFilter: {
                         field: Ge(t.field),
                         op: "IS_NAN"
                     }
                 };
-                if (Ut(t.value)) return {
+                if (kt(t.value)) return {
                     unaryFilter: {
                         field: Ge(t.field),
                         op: "IS_NULL"
                     }
                 };
             } else if ("!=" /* NOT_EQUAL */ === t.op) {
-                if (kt(t.value)) return {
+                if (jt(t.value)) return {
                     unaryFilter: {
                         field: Ge(t.field),
                         op: "IS_NOT_NAN"
                     }
                 };
-                if (Ut(t.value)) return {
+                if (kt(t.value)) return {
                     unaryFilter: {
                         field: Ge(t.field),
                         op: "IS_NOT_NULL"
@@ -3178,11 +3184,11 @@ async function Ze(t, e) {
     return (await n.T("RunQuery", r.parent, {
         structuredQuery: r.structuredQuery
     })).filter((t => !!t.document)).map((t => function(t, e, n) {
-        const r = Oe(t, e.name), s = Fe(e.updateTime), i = new Bt({
+        const r = Oe(t, e.name), s = Fe(e.updateTime), i = new zt({
             mapValue: {
                 fields: e.fields
             }
-        }), o = zt.newFoundDocument(r, s, i);
+        }), o = Gt.newFoundDocument(r, s, i);
         return n && o.setHasCommittedMutations(), n ? o.setHasCommittedMutations() : o;
     }(n.q, t.document, void 0)));
 }
@@ -3556,7 +3562,7 @@ class an {
  */ class ln extends hn {
     /** @hideconstructor */
     constructor(t, e, n) {
-        super(t, e, new oe(n)), this._path = n, 
+        super(t, e, new ue(n)), this._path = n, 
         /** The type of this Firestore reference. */
         this.type = "collection";
     }
@@ -3616,7 +3622,7 @@ function fn(t, e, ...n) {
  * within the provided collection group.
  */
     function(t) {
-        return new oe(X.emptyPath(), t);
+        return new ue(X.emptyPath(), t);
     }(e));
 }
 
@@ -4046,7 +4052,7 @@ function Vn(t) {
         }
         c = new Tt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
     } else c = null, a = o.fieldTransforms;
-    return new Tn(new Bt(u), c, a);
+    return new Tn(new zt(u), c, a);
 }
 
 class Nn extends vn {
@@ -4141,7 +4147,7 @@ class qn extends vn {
 /** Parse update data from an update() call. */ function On(t, e, n, r) {
     const s = t.ht(1 /* Update */ , e, n);
     Mn("Data must be an object, but it was:", s, r);
-    const i = [], o = Bt.empty();
+    const i = [], o = zt.empty();
     Et(r, ((t, r) => {
         const u = Gn(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
@@ -4163,7 +4169,7 @@ class qn extends vn {
     const o = t.ht(1 /* Update */ , e, n), u = [ Bn(e, r, n) ], c = [ s ];
     if (i.length % 2 != 0) throw new U(A, `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(Bn(e, i[t])), c.push(i[t + 1]);
-    const a = [], l = Bt.empty();
+    const a = [], l = zt.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 (!Wn(a, u[t])) {
@@ -4615,7 +4621,7 @@ class er extends Zn {
             } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || pr(o, i), 
             u = Ln(n, e, o, 
             /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
-            const c = Wt.create(s, i, u);
+            const c = Yt.create(s, i, u);
             return function(t, e) {
                 if (e.N()) {
                     const n = ae(t);
@@ -4667,7 +4673,7 @@ class er extends Zn {
         }(t._query, "where", e, t.firestore._databaseId, this.dt, this.wt, this.yt);
         return new hn(t.firestore, t.converter, function(t, e) {
             const n = t.filters.concat([ e ]);
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, n));
     }
 }
@@ -4695,7 +4701,7 @@ class rr extends Zn {
         const e = function(t, e, n) {
             if (null !== t.startAt) throw new U(A, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
             if (null !== t.endAt) throw new U(A, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            const r = new re(e, n);
+            const r = new se(e, n);
             return function(t, e) {
                 if (null === ce(t)) {
                     // This is the first order by. It must match any inequality.
@@ -4718,7 +4724,7 @@ class rr extends Zn {
         return new hn(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 ]);
-            return new oe(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new ue(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }
 }
@@ -4742,7 +4748,7 @@ class ir extends Zn {
     }
     _apply(t) {
         return new hn(t.firestore, t.converter, function(t, e, n) {
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
         }(t._query, this.gt, this.vt));
     }
 }
@@ -4775,7 +4781,7 @@ class cr extends Zn {
     _apply(t) {
         const e = wr(t, this.type, this.bt, this.Et);
         return new hn(t.firestore, t.converter, function(t, e) {
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }
 }
@@ -4797,7 +4803,7 @@ class lr extends Zn {
     _apply(t) {
         const e = wr(t, this.type, this.bt, this.Et);
         return new hn(t.firestore, t.converter, function(t, e) {
-            return new oe(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+            return new ue(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }
 }
@@ -4822,7 +4828,7 @@ function dr(...t) {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-                for (const n of le(t)) if (n.field.isKeyField()) i.push(Ct(e, r.key)); else {
+                for (const n of le(t)) if (n.field.isKeyField()) i.push(Lt(e, r.key)); else {
             const t = r.data.field(n.field);
             if (Dt(t)) throw new U(A, 'Invalid query. You are trying to start or end a query using a document for which the field "' + n.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) {
@@ -4831,7 +4837,7 @@ function dr(...t) {
             }
             i.push(t);
         }
-        return new ne(i, s);
+        return new re(i, s);
     }
     /**
  * Converts a list of field values to a `Bound` for the given query.
@@ -4851,13 +4857,13 @@ function dr(...t) {
                     const n = t.path.child(X.fromString(c));
                     if (!et.isDocumentKey(n)) throw new U(A, `Invalid query. When querying a collection group and ordering by documentId(), the value passed to ${r}() must result in a valid document path, but '${n}' is not because it contains an odd number of segments.`);
                     const s = new et(n);
-                    u.push(Ct(e, s));
+                    u.push(Lt(e, s));
                 } else {
                     const t = Ln(n, r, c);
                     u.push(t);
                 }
             }
-            return new ne(u, i);
+            return new re(u, i);
         }
         /**
  * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
@@ -4873,9 +4879,9 @@ function mr(t, e, n) {
         if (!he(e) && -1 !== n.indexOf("/")) throw new U(A, `Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '${n}' contains a '/' character.`);
         const r = e.path.child(X.fromString(n));
         if (!et.isDocumentKey(r)) throw new U(A, `Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
-        return Ct(t, new et(r));
+        return Lt(t, new et(r));
     }
-    if (n instanceof an) return Ct(t, n._key);
+    if (n instanceof an) return Lt(t, n._key);
     throw new U(A, `Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ${it(n)}.`);
 }
 
@@ -4949,7 +4955,7 @@ function _r(t, e, n) {
 
 class gr extends class {
     convertValue(t, e = "none") {
-        switch (St(t)) {
+        switch (Ft(t)) {
           case 0 /* NullValue */ :
             return null;
 
@@ -5072,12 +5078,12 @@ class gr extends class {
  * @returns A Promise that will be resolved with the results of the query.
  */ function br(t) {
     !function(t) {
-        if (ue(t) && 0 === t.explicitOrderBy.length) throw new U(q, "limitToLast() queries require specifying at least one orderBy() clause");
+        if ("L" /* Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new U(q, "limitToLast() queries require specifying at least one orderBy() clause");
     }((t = ot(t, hn))._query);
     const e = en(t.firestore), n = new gr(t.firestore);
     return Ze(e, t._query).then((e => {
         const r = e.map((e => new Hn(t.firestore, n, e.key, e, t.converter)));
-        return ue(t._query) && 
+        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.
@@ -5974,7 +5980,7 @@ class Ur {
     return e && r._setSettings(e), r;
 }), "PUBLIC")), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-registerVersion("firestore-lite", "3.4.7", ""), registerVersion("firestore-lite", "3.4.7", "esm2017");
+registerVersion("firestore-lite", "3.4.8-canary.19e31a231", ""), registerVersion("firestore-lite", "3.4.8-canary.19e31a231", "esm2017");
 
 export { gn as Bytes, ln as CollectionReference, an as DocumentReference, Yn as DocumentSnapshot, yn as FieldPath, vn as FieldValue, rn as Firestore, U as FirestoreError, bn as GeoPoint, hn as Query, Zn as QueryConstraint, Hn as QueryDocumentSnapshot, Kn as QuerySnapshot, gt as Timestamp, Ur as Transaction, $r as WriteBatch, Ar as addDoc, Dr as arrayRemove, Vr as arrayUnion, fn as collection, dn as collectionGroup, un as connectFirestoreEmulator, Ir as deleteDoc, Rr as deleteField, wn as doc, _n as documentId, dr as endAt, fr as endBefore, vr as getDoc, br as getDocs, on as getFirestore, Nr as increment, sn as initializeFirestore, or as limit, ur as limitToLast, sr as orderBy, tr as query, pn as queryEqual, mn as refEqual, kr as runTransaction, Pr as serverTimestamp, Er as setDoc, w as setLogLevel, Jn as snapshotEqual, hr as startAfter, ar as startAt, cn as terminate, Tr as updateDoc, nr as where, Fr as writeBatch };
 //# sourceMappingURL=index.browser.esm2017.js.map